Filters
total: 2940
filtered: 2211
displaying 1000 best results Help
Search results for: EQUITABLE CHROMATIC NUMBER
-
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.
-
Speed, Alcohol and Safety Belts as Important Factors Influencing the Number of Fatalities in Road Accidents in the Voivodships
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....
-
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 -
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.
-
An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds
Publication -
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 -
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 -
Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych
PublicationW pracy rozpatrywane są sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych. Pokazano, że w odróżnieniu od tego pierwszego, który jest łatwy, problem istnienia pokolorowań półsprawiedliwych jest NP-zupełny w szerokim zakresie parametrów grafów.
-
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...
-
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 -
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 -
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 -
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...
-
The Backbone Coloring Problem for Small Graphs
PublicationIn this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...
-
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),...
-
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 -
Optimal backbone coloring of split graphs with matching backbones
PublicationFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.
-
Selecting wells for an optimal design of groundwater monitoring network based on monitoring priority map: A Kish Island case study
PublicationThis paper presents a novel approach, i.e. a combination of gamma test and monitoring priority map, for optimal design of groundwater monitoring network (GMN) by considering the cumulative effects of industries, human activities, and natural factors on the groundwater quality. The proposed method was successfully applied to design an optimal network for groundwater salinity monitoring on Kish Island, Persian Gulf. The priority...
-
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)....
-
Gender and Digital Divide - Information and Communication Technologiesand their Impact on Equality
PublicationIn the entire Europe more women than men graduate from tertiaryeducation institutes. However, they are underrepresented in scientific and engineering disciplines. Women researchers still constitute a minority in the Government and Higher Education Sectors. A number of industry reports highlight a low number of women in IT occupations49. This has led to a variety of public policy measures, such as subsidies on community provision,...
-
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...
-
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...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
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...
-
The Backbone Coloring Problem for Bipartite Backbones
PublicationLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Green, simple analytical method for total biogenic amines content determination in wine using spectrophotometry
PublicationA simple, green and equitable procedure for total biogenic amines (BAs) content determination was developed. The scientific novelty lies in the use of commercially available S 0378 dye, the reaction of which with BAs results in a colour change of the solution. Sample preparation and analysis were simplified to make the method suitable for routine analyses even in resource-scarce settings. The optimization of the method was carried...
-
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:...
-
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...
-
Development of novel smartphone-based methods of wine quality assessment
PublicationThe doctoral dissertation concerns the development of novel smartphone-based analytical methods of wine quality evaluation, which would be in line with the stipulations of green and equitable analytical chemistry. This solution is based on the analysis of biogenic amines and selected bioactive compounds. The dissertation is based on four articles containing the results of research which led to the development of smartphone-based...
-
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...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublicationAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Zirconia ceramics with additions of Alumina for advanced tribological and biomedical applications
PublicationThe results of an investigation on slip cast and sintered Y2O3 (3 wt%)- stabilized ZrO2 with additions of 5, 10, 15 wt% Al2O3 are reported. The surface roughness, porosity and density of the samples were measured. The hardness HRc and Hv, fracture toughness K1C, and friction coefficients were also measured using standard methods. The structural properties of the samples were observed by Scanning Electron Microscopy (SEM). The surface...
-
AMO perspectives on the well-being of neurodivergent human capital
PublicationExisting management research and management practices frequently overlook the relationship between the above-average human capital of highly functioning neurodivergent employees, their subjective well-being in the workplace and performance outcomes. This paper calls for greater attention to the hidden human capital associated with neurodiversity by mainstreaming implementation of neurodiversity-friendly policies and practices. Drawing...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe domination subdivision number sd(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 domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
AMO model for neuro-inclusive remote workplace
PublicationPurpose The aim of this article is to extend current debates on organizational equality, diversity and inclusion to a consideration of neurodivergence in the remote workplace context. Design/methodology/approach Drawing on the ability, motivation, and opportunity (AMO) model and an emerging strength-based approach to neurodiversity, this conceptual paper integrates research on neurodiversity at work and remote working to provide...
-
Building Confidence and Trust in Ireland's National Maternity Services Workforce –What matters most and how?
PublicationNational surveys on care experiences are increasingly adopted as regulatory mechanisms for improving care quality and increasing public trust in healthcare services. Based on data collected as part of Ireland's 2020 National Maternity Experience Survey, this study investigates care-related factors that contribute most to confidence and trust in the professional workforce (or carers) within Irish maternity services. The survey covered...
-
Nonlinearity shaping in nanostructured glass-diamond hybrid materials for optical fiber preforms
PublicationNanodiamond integration with optical fibers has proved a compelling methodology for magneto-optics. We reveal that the applicability of nanodiamonds in nonlinear optics goes beyond the previous demonstrations of frequency converters. Instead, we exploit the recently reported volumetric integration of nanodiamonds along the optical fiber core and show that the nonlinear response of glasses can be manipulated by nanodiamonds. By...
-
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...