Search
Filters
total: 3053
filtered: 2298
displaying 1000 best results Help
Search results for: backbone chromatic number
-
Minimal number of periodic points for C^1 self-maps of compact simply-connected manifolds
PublicationNiech f będzie odwzorowaniem gładkiej zwartej i jednospójnej rozmaitości o wymiarze większym lub równym 3. W pracy zdefiniowany został topologiczny niezmiennik będący najlepszym dolnym oszacowaniem liczby punktów periodycznych w klasie gładkich odwzorowań homotopijnych z f.
-
High-order compact difference algorithm on half-staggered meshes for low Mach number flows
Publication -
Derivatives of 1-nitroacridine induce apoptosis only in a limited number of human colon adenocarcinoma cells
PublicationPraca dotyczy indukcji apoptozy w komórkach ludzkich raków okrężnicy HT29 i HCT8 pod wpływem pochodnych 1-nitroakrydyny: C-857 i C-1748. Wykazano, że związki te w stężeniach biologicznie istotnych (EC90) indukują apoptozę tylko w części populacji komórek. Efekt ten uzależniony był od czasu inkubacji komórek ze związkiem, a nie zależał od stężenia związku.
-
Microbiological Survey in Two Arctic Fjords: Total Bacterial Number and Biomass Comparison of Hornsund and Kongsfjorden
Publication -
Sex contribution to average age at onset of Huntington's disease depends on the number of (CAG)n repeats
PublicationHuntington’s disease (HD) is a hereditary neurodegenerative disorder caused by the extension of the CAG repeats in exon 1 of the HTT gene and is transmitted in a dominant manner. The present study aimed to assess whether patients’ sex, in the context of mutated and normal allele length, contributes to age on onset (AO) of HD. The study population comprised a large cohort of 3723 HD patients from the European Huntington’s Disease...
-
Speed, Alcohol and Safety Belts as Important Factors Influencing the Number of Fatalities in Road Accidents in the Voivodships
Publication -
An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds
Publication -
Minimal number of periodic points for smooth self-maps of two-holed 3-dimensional closed ball
PublicationDla ciągłego odwzorowania f przestrzeni określonej w tytule w siebie, które posiada rzeczywiste wartości własne na drugiej grupie homologii, wyznaczona została minimalna liczba punktów r-periodycznych w klasie wszystkich gładkich odwzorowań homotopijnych z f.
-
A Text as a Set of Research Data. A Number of Aspects of Data Acquisition and Creation of Datasets in Neo-Latin Studies
PublicationIn this paper, the authors, who specialise in part in neo-Latin studies and the his-tory of early modern education, share their experiences of collecting sources for Open Research Data sets under the Bridge of Data project. On the basis of inscription texts from St. Mary’s Church in Gdańsk, they created 29 Open Research Data sets. In turn, the text of the lectures of the Gdańsk scholar Michael Christoph Hanow, Praecepta de arte...
-
Predicting the Number of Days With Visibility in a Specific Range in Warsaw (Poland) Based on Meteorological and Air Quality Data
Publication -
Simulation of the number of storm overflows considering changes in precipitation dynamics and the urbanisation of the catchment area: a probabilistic approach
PublicationThis paper presents a probabilistic methodology that allows the study of the interactions between changes in rainfall dynamics and impervious areas in urban catchment on a long- and short-term basis. The proposed probabilistic model predict future storm overflows while taking into account the dynamics of changes in impervious areas and rainfall. In this model, a logistic regression method was used to simulate overflow resulting...
-
Person Tracking in Ultra-Wide Band Hybrid Localization System Using Reduced Number of Reference Nodes
PublicationIn this article a novel method of positional data integration in an indoor hybrid localization system combining inertial navigation with radio distance measurements is presented. A point of interest is the situation when the positional data and the radio distance measurements are obtained from less than thee reference nodes and it is impossible to unambiguously localize the moving person due to undetermined set of positional equations....
-
Are Radiosensitive and Regular Response Cells Homogeneous in Their Correlations Between Copy Number State and Surviving Fraction After Irradiation?
Publication -
Does blood flow restriction influence the maximal number of repetitions performed during the bench press? A pilot study
Publication -
Determination of an adequate number of competitive functional models in the square Msplit(q) estimation with the use of a modified Baarda’s approach
Publication -
Equitable colorings of some variation of corona products of cubic graphs
PublicationThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublicationIn the paper, we show that the incidence chromatic number of a complete k-partite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.
-
PM10 concentration and microbiological assessment of air in relation to the number of acute cases of type 1 diabetes mellitus in the Lubelskie Voivodeship. Preliminary report
Publication -
A general method for the derivation of the functional forms of the effective energy terms in coarse-grained energy functions of polymers. III. Determination of scale-consistent backbone-local and correlation potentials in the UNRES force field and force-field calibration and validation
Publication -
Equitable coloring of corona multiproducts of graphs
PublicationWe give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.
-
Amplification of a single-locus variable-number direct-repeats with restriction fragment length polymorphism (DR-PCR/RFLP) for genetic typing of Acinetobacter baumannii strains
PublicationW celu poszukiwania nowych metod typowania genetycznego szczepów Acinetobacter baumannii przydatnych w szpitalnych badaniach epidemiologicznych przeprowadzono analizę dostępnych w banku genów sekwencji szczepów referencyjnych na obecność nowych motywów repetytywnych. Do badania polimorfizmu sekwencji repetytywnych w szczepach Acinetobacter sp. wykorzystano proste powtórzenia typu "direct repeat" (DR) zlokalizowane w jednym miejscu...
-
Concurrent DNA Copy-Number Alterations and Mutations in Genes Related to Maintenance of Genome Stability in Uninvolved Mammary Glandular Tissue from Breast Cancer Patients
Publication -
<p>Potential effects of microbial air quality on the number of new cases of diabetes type 1 in children in two regions of Poland: a pilot study</p>
Publication -
Type A Behavior Pattern, Impulsiveness, Risk Propensity, and Empathy as Predictors of Dyspnea and Number of Infections in Men with Chronic Obstructive Pulmonary Disease: A Cross-Sectional Study
Publication -
The PF6−n(R)n−anions (R = CH3, C2H5;n= 0–6): the dependence of the electronic stability on the number of non-electronegative alkyl ligands
Publication -
Product Graph Invariants with Applications in the Theory of Information
PublicationThere are a large number of graph invariants. In the paper, we consider some of them, e.g. the independence and chromatic numbers. It is well know that we cannot efficiently calculate these numbers for arbitrary graphs. In the paper we present relations between these invariants and concepts from the theory of information. Concepts such as source coding and transmission over a noisy channel with zero probability of error are modeled...
-
Minimum order of graphs with given coloring parameters
PublicationA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Equitable coloring of corona products of graphs
PublicationIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
Emphysema affects the number and appearance of solitary pulmonary nodules identified in chest low-dose computed tomography: a study on high risk lung cancer screenees recruited in Silesian District
Publication -
Parity vertex colouring of graphs
PublicationA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
Restricted open shop scheduling
PublicationIn the real applications the open shop scheduling models often require some additional constraints and adequate models. We concern the restrictions in the open shop scheduling related to an instance of the problem and to a feasible solution. Precisely, we require that each jobs consists of the bounded number of operations and each machine has a bounded load (i.e., the total number of operations executed on this machine in a schedule)....
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublicationA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublicationWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
-
Graph classes generated by Mycielskians
PublicationIn this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...
-
Speed, alcohol and safety belts as important factors influencing the number voivodship = Prędkość, alkohol i pasy bezpieczeństwa jako istotne czynniki wpływające na liczbę ofiar śmiertelnych wypadków drogowych na obszarze województw
PublicationNiniejszy referat prezentuje wyniki wstępne szerszego programu prac badawczych dotyczących bezpieczeństwa ruchu drogowego na obszarach województw.
-
Edge coloring of graphs of signed class 1 and 2
PublicationRecently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...
-
Are stabilizing osmolytes preferentially excluded from the protein surface? FTIR and MD studies
PublicationInteractions between osmolytes and hen egg white lysozyme in aqueous solutions were studied by means of FTIR spectroscopy and molecular dynamics. A combination of difference spectra method and chemometric analysis of spectroscopic data was used to determine the number of osmolyte molecules interacting with the protein, and the preferential interaction coefficient in presented systems. Both osmolytes – L-proline and trimethylamine-N-oxide...
-
Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios
PublicationThe problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension d and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes...
-
The chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used for the computations. The results we got using the model have been compared to the results obtained from real computational environment.
PublicationThe chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used...
-
Mechanism of recognition of parallel G-quadruplexes by DEAH/RHAU helicase DHX36 explored by molecular dynamics simulations
PublicationBecause of high stability and slow unfolding rates of G-quadruplexes (G4), cells have evolved specialized helicases that disrupt these non-canonical DNA and RNA structures in an ATP-dependent manner. One example is DHX36, a DEAH-box helicase, which participates in gene expression and replication by recognizing and unwinding parallel G4s. Here, we studied the molecular basis for the high affinity and specificity of DHX36 for parallel-type...
-
Dynamic coloring of graphs
PublicationDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Molecular dynamics simulations reveal the balance of forces governing the formation of a guanine tetrad—a common structural unit of G-quadruplex DNA
PublicationG-quadruplexes (G4) are nucleic acid conformations of guanine-rich sequences, in which guanines are arranged in the square-planar G-tetrads, stacked on one another. G4 motifs form in vivo and are implicated in regulation of such processes as gene expression and chromosome maintenance. The structure and stability of various G4 topologies were determined experimentally; however, the driving forces for their formation are not fully...
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublicationWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
How acidic amino acid residues facilitate DNA target site selection
PublicationDespite the negative charge of the DNA backbone, acidic residues (Asp/Glu) commonly participate in the base readout, with a strong preference for cytosine. In fact, in the solved DNA/protein structures, cytosine is recognized almost exclusively by Asp/Glu through a direct hydrogen bond, while at the same time, adenine, regardless of its amino group, shows no propensity for Asp/Glu. Here, we analyzed the contribution of Asp/Glu...
-
A new approach to design of weather disruption-tolerant wireless mesh networks
PublicationWireless Mesh Networks, offering transmission rates of 1–10 Gb/s per a millimeter-wave link (utilizing the 71–86 GHz band) seem to be a promising alternative to fiber optic backbone metropolitan area networks because of significantly lower costs of deployment and maintenance. However, despite providing high transmission rates in good weather conditions, high-frequency wireless links are very susceptible to weather disruptions....
-
Optical properties of polyazomethine with oxygen atom in the backbon
PublicationPurpose: The aim of this paper is to show results of optical measurement performed on poly –(1-(4-methylenephenoxy-1)phenylene-4-methylene-1.4-phenylnenitrylomethylene) (PPI2) polyazomethine thinfilms and to compare with poly - (1.4-phenylenemethylenenitrilo-1.4 phenylenenitrilomethylene) (PPI).Design/methodology/approach: Influence of oxygen atom in the polymer chain on optical properties ofpolyazomethine was investigated....
-
Valence and ionic lowest-lying electronic states of small esters studied by high resolution vacuum ultraviolet photoabsorption, photoelectron spectroscopy and ab initio calculations
PublicationEsters are an important class of oxygenated volatile organic compounds used in food flavorings, perfumes and other cosmetic products. They are present in fruits and pheromones and are emitted to the atmosphere naturally. Esters are also formed in the atmosphere as a product of the oxidation of ethers. Some of them form poly-molecule chains and are used in plastics. Phosphoesters form DNA backbone, while nitroesters are known for...
-
Pomiary grubości cienkich warstw metodą modulacji chromatycznej.
PublicationTematem artykułu jest pomiar grubości struktur cienkowarstwowych szerokostosowanych w optoelektronice, transparentnych warstw dielektrycznych. Grubość jest najistotniejszym parametrem warstwy i determinuje jej właściwościoptyczne. Metoda pomiaru grubości cienkich warstw powinna być bezkontaktowa, nieniszcząca, niekosztowna oraz odporna na zakłócenia
-
Detection and segmentation of moving vehicles and trains using Gaussian mixtures, shadow detection and morphological processing
PublicationSolution presented in this paper combines background modelling, shadow detection and morphological and temporal processing into one system responsible for detection and segmentation of moving objects recorded with a static camera. Vehicles and trains are detected based on their pixellevel difference from the continually updated background model utilizing a Gaussian mixture calculated separately for every pixel. The shadow detection...