Filters
total: 3887
displaying 1000 best results Help
Search results for: COMBINATORIAL BOUND
-
Desmoplastic small round cell tumor - Male, 6 - Tissue image [5070730026206061]
Open Research DataThis is the histopathological image of RETROPERITONEUM AND PERITONEUM tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Desmoplastic small round cell tumor - Male, 6 - Tissue image [5070730026202171]
Open Research DataThis is the histopathological image of RETROPERITONEUM AND PERITONEUM tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Desmoplastic small round cell tumor - Male, 6 - Tissue image [507073002620631]
Open Research DataThis is the histopathological image of RETROPERITONEUM AND PERITONEUM tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
The CON−H…+NH2 Blue-Shifting H-Bond Stabilizing Effect on Z Secondary Amides and Cyclic System Conformational Rearrangement through an Alkylamine-Chain Migration Pathway
PublicationThe paper is focusing on the amide linkage exceptional properties and usage of chemistry (conformational rearrangement, geometrical stereoisomers, spectroscopic blue shift phenomenon, protonation and deprotonation reactions, synthetic scope, and mechanistic implications). Hydrogen-bond-stabilized acylation reactions of a diamine with thioamides or nitriles reveal how substituents influence both the outcome of stereoselectivity...
-
Photoelectrochemical activity of visible light-responsive BiVO4@La1-xSrxFeO3-δ (x = 0, 0.2, 0.4) heterojunction architectures – Optimizing activity by tuning Fe O bond in perovskites
Publication -
Parallel tabu search for graph coloring problem
PublicationTabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...
-
Sound Field Intensity Measurements and Visualization around the Human Head Model . Rozkłąd natężenia pola akustycznego w komorze bezechowej obecności sztucznej głowy i w przypadku braku jej obecności
PublicationThe main goal of this research study was to measure and visualize sound field intensity distribution in and without presence of the human head model. Measurements were performed in the anechoic chamber with the 5 cm grid. Experimental setup consisted of a multitone generator, two loudspeakers, human head model, intensimetric probe, the Cartesian robot applied for precise positioning of the acoustic sensor, and an analyzer. Based...
-
Workshop on Combinatorial and Algorithmic Aspects of Networking
Conferences -
Conference on Integer Programming and Combinatorial Optimization
Conferences -
The hydrogen bond network structure within the hydration shell around simple osmolytes: Urea, tetramethylurea, and trimethylamine-N-oxide, investigated using both a fixed charge and a polarizable water model
PublicationDespite numerous experimental and computer simulation studies, a controversy still exists regarding the effect of osmolytes on the structure of surrounding water. There is a question, to what extent some of the contradictory results may arise from differences in potential models used to simulate the system or parameters employed to describe physical properties of the mixture and interpretation of the results. Bearing this in mind,...
-
The hydrogen bond network structure within the hydration shell around simple osmolytes: Urea, tetramethylurea, and trimethylamine-N-oxide, investigated using both a fixed charge and a polarizable water model
PublicationDespite numerous experimental and computer simulation studies, a controversy still exists regarding the effect of osmolytes on the structure of surrounding water. There is a question, to what extent some of the contradictory results may arise from differences in potential models used to simulate the system or parameters employed to describe physical properties of the mixture and interpretation of the results. Bearing this in mind,...
-
Morse decompositions for a non-linear Leslie population model with 2 varying parameters
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
Morse decompositions for a non-linear Leslie population model with 3 varying parameters
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
Oxidative DNA damage: assessment of the role in carcinogenesis, atherosclerosis, and acquired immunodeficiency syndrome1 1This article is part of a series of reviews on “Oxidative DNA Damage and Repair.” The full list of papers may be found on the homepage of the journal.
Publication -
Sound signals generated during lapping of technical ceramics using electroplated tools with diamond grains
Open Research DataData contains the recordings of sound generated during single-sided lapping with the use of electroplated diamond tools. This relationship was examined with the use of spectral analysis of the sound signal in the frequency domain with a focus on the Ra parameter of the surface roughness. The estimated sound coefficient increased as the surface roughness...
-
Justyna Płotka-Wasylka dr hab. inż.
PeopleUrodziła się w Słupsku (24.03.1986).W 2005 roku ukończyła I Liceum Ogólnokształcące im. Jana II Sobieskiego w Wejherowie i rozpoczęła studia na Wydziale Chemicznym Politechniki Gdańskiej. Po ich ukończeniu w 2010 rozpoczęła pracę naukową na tej uczelni, uzyskując w 2014 roku stopień doktora nauk chemicznych. Tematem jej rozprawy doktorskiej, wykonywanej pod kierunkiem prof. Marka Biziuka oraz dr Caluma Morrisona (Uniwersytet w...
-
Mariusz Kaczmarek dr hab. inż.
PeopleReceived M.Sc., Eng. in Electronics in 1995 from Gdansk University of Technology, Ph.D. in Medical Electronics in 2003 and habilitation in Biocybernetics and Biomedical Engineering in 2017. He was an investigator in about 13 projects receiving a number of awards, including four best papers, practical innovations (7 medals and awards) and also the Andronicos G. Kantsios Award and Siemens Award. Main research activities: the issues...
-
Reducing the number of periodic points in the smooth homotopy class of a self-map of a simply-connected manifold with periodic sequence of Lefschetz numbers
PublicationLet f be a smooth self-map of an m-dimensional (m >3) closed connected and simply-connected manifold such that the sequence of the Lefschetz num- bers of its iterations is periodic. For a fixed natural r we wish to minimize, in the smooth homotopy class, the number of periodic points with periods less than or equal to r. The resulting number is given by a topological invariant J[f] which is defned in combinatorial terms and is...
-
On the connected and weakly convex domination numbers
PublicationIn this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublicationThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
International Workshop on Algebraic and Combinatorial Coding Theory
Conferences -
European Conference on Evolutionary Computation in Combinatorial Optimisation
Conferences -
MSRI Combinatorial Game Theory Research Workshop
Conferences -
Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Conferences -
An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds
PublicationFor a given self-map f of M, a closed smooth connected and simply-connected manifold of dimension m 4, we provide an algorithm for estimating the values of the topological invariant D^m_r [f], which equals the minimal number of r-periodic points in the smooth homotopy class of f. Our results are based on the combinatorial scheme for computing D^m_r [f] introduced by G. Graff and J. Jezierski [J. Fixed Point Theory Appl. 13 (2013),...
-
Parameter values for topological chaos in the reduced Chialvo model
Open Research DataThe following dataset is connected with a map-based neuron model introduced by D. Chialvo (Chaos, Solitons & Fractals, 5 (3-4) 1995). The reduced version of this model is a one dimensional discrete system which describes the evolution of the membrane voltage when the value of the second variable, the recovery variable, is fixed. We have recently...
-
International Conference on Computing and Combinatorics
Conferences -
Workshop on Analytic Algorithmics and Combinatorics
Conferences -
Workshop on Algorithms, Combinatorics, and Geometry
Conferences -
Morse decompositions for a two-patch vaccination model
Open Research DataThis dataset contains selected results of rigorous numerical computations described in Section 5 of the paper "Rich bifurcation structure in a two-patch vaccination model" by D.H. Knipl, P. Pilarczyk, G. Röst, published in SIAM Journal on Applied Dynamical Systems (SIADS), Vol. 14, No. 2 (2015), pp. 980–1017, doi: 10.1137/140993934.
-
Bartosz Sawik
PeopleDr Bartosz Sawik is a Professor at the Department of Business Informatics and Engineering Management, AGH University of Science and Technology, Krakow, Poland and at the Institute of Smart Cities, GILT-OR Group, Department of Statistics, Computer Science and Mathematics, Public University of Navarre, Pamplona, Spain. He is a Visiting Researcher at the University of California, Berkeley, USA. He has a Ph.D. and a M.Sc. and Eng....
-
Grzegorz Szwoch dr hab. inż.
PeopleGrzegorz Szwoch was born in 1972 in Gdansk. In 1991-1996 he studied at the Technical University of Gdansk. In 1996 he graduated as a student from the Sound Engineering Department. His thesis was related to physical modeling of musical instruments. Since that time he has been a member of the research staff at the Multimedia Systems Department as a PhD student (1996-2001), Assistant (2001-2004), Assistant professor (2004-2020) and...
-
Positron binding to alkali-metal hydrides: The role of molecular vibrations
PublicationThe bound vibrational levels for J=0 have been computed for the series of alkali-metal hydride molecules from LiH to RbH, including NaH and KH. For all four molecules the corresponding potential-energy curves have been obtained for each isolated species and for its positron-bound complex (e+XH). It is found that the calculated positron affinity values strongly depend on the molecular vibrational state for which they are obtained...
-
Computations of the least number of periodic points of smooth boundary-preserving self-maps of simply-connected manifolds
PublicationLet $r$ be an odd natural number, $M$ a compact simply-connected smooth manifold, $\dim M\geq 4$, such that its boundary $\partial M$ is also simply-connected. We consider $f$, a $C^1$ self-maps of $M$, preserving $\partial M$. In [G. Graff and J. Jezierski, Geom. Dedicata 187 (2017), 241-258] the smooth Nielsen type periodic number $D_r(f;M,\partial M)$ was defined and proved to be equal to the minimal number of $r$-periodic points...
-
International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
Conferences -
International Workshop on Combinatorial Image Analysis: Theory and Applications
Conferences -
Collision-free network exploration
PublicationMobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Types of Markov Fields and Tilings
PublicationThe method of types is one of the most popular techniques in information theory and combinatorics. However, thus far the method has been mostly applied to one-dimensional Markov processes, and it has not been thoroughly studied for general Markov fields. Markov fields over a finite alphabet of size m ≥ 2 can be viewed as models for multi-dimensional systems with local interactions. The locality of these interactions is represented...
-
The complexity of list ranking of trees
PublicationUporządkowane kolorowanie grafu polega na takim etykietowaniu jego wierzchołków, aby każda ścieżka łącząca dwa wierzchołki o tym samym kolorze zawierała wierzchołek o kolorze wyższym. Jeśli każdy wierzchołek posiada dodatkowo listę dozwolonych dla niego etykiet, to mówimy wówczas o uporządkowanym listowym kolorowaniu wierzchołków. W pracy wskazano szereg klas grafów, dla których problem jest trudny: pełne drzewa binarne, drzewa...
-
Packing Three-Vertex Paths in 2-Connected Cubic Graphs
PublicationW pracy rozważano problem rozmieszczanie ścieżek P3 w 2-spójnych grafach 3-regularnych. Pokazano, że w 2-spójnym grafie 3-regularnym o n wierzchołkach można zawsze pokryć 9/11 n wierzchołków przez ścieżki P3; podano także odpowiednie oszacowania górne.
-
On trees with double domination number equal to total domination number plus one
PublicationA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
The hat problem on cycles on at least nine vertices
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Weakly convex and convex domination numbers of some products of graphs
PublicationIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
PublicationThe Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....
-
Discrete Models: Combinatorics, Computation and Geometry
Conferences -
Formal Power Series and Algebraic Combinatorics
Conferences -
EuroConference on Combinatorics, Graph Theory and Applications
Conferences -
Workshop on Computational Graph Theory and Combinatorics
Conferences