Filtry
wszystkich: 1661
wybranych: 693
Wyniki wyszukiwania dla: GAMMA GRAPHS, DIAMETER
-
Multimodal Network Based Graphs of Primitives Storage Concept for Web Mining CBIR
Publikacja -
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
PublikacjaThe problem of scheduling n identical jobs on 4 uniform machines with speeds s1>=s2>=s3>=s4 is considered.The aim is to find a schedule with minimum possible length. We assume that jobs are subject to mutual exclusion constraints modeled by a bipartite incompatibility graph of degree delta. We show that the general problem is NP-hard even if s1=s2=s3. If, however, delta<5 and s1>12s2 s2=s3=s4, then the problem can be solved to...
-
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
PublikacjaWe consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard,...
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublikacjaWe 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.
-
Musical Metadata Retrieval with Flow Graphs, in Rough Sets and Current Trends in Computing.
PublikacjaW pracy opisano metody wyszukiwania muzyki w Internecie w oparciu o opis semantyczny. W eksperymentach wykorzystano opis muzyczny stosowany w bazie CDDB. Zaprezentowano metodę grafów przepływowych zaproponowaną przez Pawlaka.
-
Sulfhydrylated graphene-encapsulated iron nanoparticles directly aminated with polyethylenimine: a novel magnetic nanoplatform for bioconjugation of gamma globulins and polyclonal antibodies
Publikacja -
Production of the anticancer drug taxol by the endophytic fungus Epicoccum nigrum TXB502: enhanced production by gamma irradiation mutagenesis and immobilization technique
Publikacja -
Bond-graphs based modelling of hybrid energy systems with permanent magnet brushless machines
PublikacjaW referacie przedstawiono metodę grafów wiązań (GW) w zastosowaniu do modelowania hybrydowych systemów energetycznych z bezszczotkowymi maszynami elektrycznymi o magnesach trwałych. W części pierwszej referatu omówiono ogólne formalizm GW. Następnie przedstawiono kolejno: ogólną strukturę modelu hybrydowego systemu energetycznego w ujęciu GW; założenia modelowania maszyn elektrycznych w ujęciu GW, model silnika bezszczotkowego...
-
Bond-graphs based modelling of hybrid energy systems with permanent magnet brushless machines
PublikacjaW referacie przedstawiono metodę grafów wiązań (GW) w zastosowaniu do modelowania hybrydowych systemów energetycznych z bezszczotkowymi maszynami elektrycznymi o magnesach trwałych. W części pierwszej referatu omówiono ogólne formalizm GW. Następnie przedstawiono kolejno: ogólną strukturę modelu hybrydowego systemu energetycznego w ujęciu GW; założenia modelowania maszyn elektrycznych w ujęciu GW, model silnika bezszczotkowego...
-
The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree
PublikacjaW pracy pokazano, że problem L(p,q)-kolorowania przy użyciu ''t'' kolorów jest NP-zupełny nawet w wersji ograniczonej do grafów planarnych dwudzielnych małego stopnia, nawet dla stosunkowo niewielkich wartości ''t''. Jako wniosek z uzyskanych wyników stwierdzono, że problem L(2,1)-kolorowania grafów planarnych przy użyciu 4 kolorów jest NP-zupełny, a także że problem L(p,q)-kolorowania grafów o maksymalnym stopniu 4 jest NP-zupełny...
-
Bond-graphs based modelling of hybrid energy systems with permanent magnet brushless machines
PublikacjaW referacie przedstawiono metodę grafów wiązań (GW) w zastosowaniu do modelowania hybrydowych systemów energetycznych z bezszczotkowymi maszynami o magnesach trwałych (BMMT). W części pierwszej referatu omówiono ogólne formalizm GW. Następnie przedstawiono kolejno: ogólną strukturę modelu hybrydowego systemu energetycznego w ujęciu GW; założenia modelowania maszyn elektrycznych w ujęciu GW, model SBMT w ujęciu GW dla potrzeb modelowania...
-
Microdosimetric analysis of response of LiF:Mg,Cu,P (MCP-N) TL detectors for alpha-particles and ultra-high doses of gamma-rays
Publikacja -
Gamma irradiation mediated production improvement of some myco-fabricated nanoparticles and exploring their wound healing, anti-inflammatory and acetylcholinesterase inhibitory potentials
Publikacja -
Unlocking the biosynthetic potential of Penicillium roqueforti for hyperproduction of the immunosuppressant mycophenolic acid: Gamma radiation mutagenesis and response surface optimization of fermentation medium
Publikacja -
Agro-industrial byproducts for production of the immunosuppressant mycophenolic acid by Penicillium roqueforti under solid-state fermentation: Enhanced production by ultraviolet and gamma irradiation
Publikacja -
Better polynomial algorithms for scheduling unit-length jobs with bipartite incompatibility graphs on uniform machines
PublikacjaThe goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|p j = 1, G = bisubquartic|Cmax . The second one is Algorithm 3 which is 4-approximate for the problem Qm|p...
-
Modelling of ic engine coolant system with permanent magnet brushless motor - bond graphs approach
PublikacjaW pierwszej części referatu przedstawiono strukturę i podstawy modelowania w ujęciu grafów wiązań nowoczesnego (nowej generacji) systemu chłodzenia silnika spalinowego. Istotną cechą rozważnego systemu chłodzenia jest zastosowanie zintegrowanego układu: pompa cieczy chłodzącej-bezszczotkowy silniki prądu stałego (BSPS, ang. BDCM). W kolejnych częściach referatu przedstawiono: podstawy modelowania całego systemu chłodzenia, model...
-
Use of Cytokine Mix-, Imiquimod-, and Serum-Induced Monoculture and Lipopolysaccharide- and Interferon Gamma-Treated Co-Culture to Establish In Vitro Psoriasis-like Inflammation Models
Publikacja -
Bioprocess optimization using response surface methodology for production of the anticancer drug paclitaxel by Aspergillus fumigatus and Alternaria tenuissima: Enhanced production by ultraviolet and gamma irradiation
Publikacja -
Optimization of submerged fermentation conditions for immunosuppressant mycophenolic acid production by Penicillium roqueforti isolated from blue-molded cheeses: enhanced production by ultraviolet and gamma irradiation
Publikacja -
Exploiting the exceptional biosynthetic potency of the endophytic Aspergillus terreus in enhancing production of Co3O4, CuO, Fe3O4, NiO, and ZnO nanoparticles using bioprocess optimization and gamma irradiation
Publikacja -
A novel source of the cardiac glycoside digoxin from the endophytic fungus Epicoccum nigrum : isolation, characterization, production enhancement by gamma irradiation mutagenesis and anticancer activity evaluation
Publikacja -
Certified domination
PublikacjaImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Modelling of Objects Behaviour for Their Re-identification in Multi-camera Surveillance System Employing Particle Filters and Flow Graphs
PublikacjaAn extension of the re-identification method of modeling objects behavior in muti-camera surveillance systems, related to adding a particle filter to the decision-making algorithm is covered by the paper. A variety of tracking methods related to a single FOV (Field of Vision) are known, proven to be quite different for inter-camera tracking, especially in case of non-overlapping FOVs. The re-identification methods refer to the...
-
The Backbone Coloring Problem for Bipartite Backbones
PublikacjaLet 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...
-
Decision Support in Selecting a Reliable Strategy for Sustainable Urban Transport Based on Laplacian Energy of T-Spherical Fuzzy Graphs
Publikacja -
Detailed experimental investigations on frictional pressure drop of R134a during flow boiling in 5 mm diameter channel: The influence of acceleration pressure drop component =Études expérimentales détaillées sur la chute de pression frictionnelle du R134a lors de l'ébullition en écoulement dans un canal de 5 mm de diamètre : influence de la composante d'accélération de la chute de pression
PublikacjaThis article presents detailed two-phase diabatic pressure drop data for refrigerant R134a at a saturation pressure of 5.5 bar corresponding to the saturation temperature of 19.4 °C. Study cases have been set for a mass flux varying from 100 to 500 kg m−2 s−1. The obtained data are used as a validation of the void fraction literature models, a set of graphs shows comparisons, for a representative set of experimental conditions,...
-
N-Alkyl Derivatives of L-Glutamine As Inhibitors of Glutamine - Utilizing Enzymes
PublikacjaA general facile method to synthesize the N-gamma-alkyl and N-gamma,N-gamma-dialkyl derivatives of L-glutamine (1a-d) from L-glutamic acid as a starting substrate is presented. The obtained compounds are shown to inhibit three diferent glutamine-utilizing enzymes, namely: glutaminase, gamma-glutamyl transpeptidase, and glucosamine-6-phosphate synthase, with inhibitory constants within the milimolar range.
-
Widespread theta synchrony and high-frequency desynchronization underlies enhanced cognition
PublikacjaThe idea that synchronous neural activity underlies cognition has driven an extensive body of research in human and animal neuroscience. Yet, insufficient data on intracranial electrical connectivity has precluded a direct test of this hypothesis in a whole-brain setting. Through the lens of memory encoding and retrieval processes, we construct whole-brain connectivity maps of fast gamma (30-100 Hz) and slow theta (3-8 Hz) spectral...
-
Analisys of the failure of fixator used in bone surgery
PublikacjaThe Gamma nail (fixator) made of stainless steel, which has broken in the body, was subjected to examination. The fixator was removed from the patient femur. The fracture occurred in the area of the nail hole after two months' stay in the organism. The research included chemical composition, hardness of the Gamma nail material and the observation and analysis of the type of fracture. The research showed the fatigue failure of the...
-
On Bayesian Tracking and Prediction of Radar Cross Section
PublikacjaWe consider the problem of Bayesian tracking of radar cross section. The adopted observation model employs the gamma family, which covers all Swerling cases in a unified framework. State dynamics are modeled using a nonstationary autoregressive gamma process. The principal component of the proposed solution is a nontrivial gamma approximation, applied during the time update recursion. The superior performance of the proposed approach...
-
A survey on known values and bounds on the Shannon capacity
PublikacjaIn this survey we present exact values and bounds on the Shannon capacity for different classes of graphs, for example for regular graphs and Kneser graphs. Additionally, we show a relation between Ramsey numbers and Shannon capacity.
-
Optimal edge-coloring with edge rate constraints
PublikacjaWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Product Graph Invariants with Applications in the Theory of Information
PublikacjaThere 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...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Interval incidence graph coloring
PublikacjaIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
Counting Lattice Paths With Four Types of Steps
Publikacja -
Tighter bounds on the size of a maximum P3-matching in a cubic graph
PublikacjaW pracy pokazano, że największe P3-skojarzenie dla dowolnego grafu o n>16 wierzchołkach składa się z przynajmniej 117n/152 wierzchołków.
-
Analysis and interpretation of radiometric signals in a liquid-gas bubble flow
PublikacjaThe article presents the analysis of signals from a radiometric system consisting of two scintillation probes and two gamma radiation sealed sources. Calculations and interpretation were carried out for the bubble flow of the water-air mixture in the horizontal pipeline. The analysis of the obtained signals was done in time and frequency domain. In the frequency domain, a range of usable frequencies was identified, which were associated...
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublikacjaWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
APROKSYMACJE DE VYLDERA PRAWDOPODOBIEŃSTWA RUINY DLA MODELU Z CZASEM CIĄGŁYM W NIESKOŃCZONYM HORYZONCIE CZASOWYM
PublikacjaArtykuł przedstawia przegląd badań oraz ewolucję aproksymacji De Vyldera. Metoda ta polega na zastąpieniu procesu ryzyka poprzez inny proces ryzyka z wykładniczym rozkładem szkód tak, aby momenty pierwszych trzech rzędów przyrostu dla obu procesów były jednakowe. Idea tego oszacowania została wykorzystana w aproksymacji 4-gamma De Vyldera, w której zastosowano zastąpienie procesu ryzyka procesem ryzyka z rozkładem gamma szkód,...
-
Marcinkiewicz Averages of Smooth Orthogonal Projections on Sphere
PublikacjaWe construct a single smooth orthogonal projection with desired localization whose average under a group action yields the decomposition of the identity operator. For any full rank lattice \Gamma ⊂ R^d , a smooth projection is localized in a neighborhood of an arbitrary precompact fundamental domain R^d / \Gamma. We also show the existence of a highly localized smooth orthogonal projection, whose Marcinkiewicz average under the...
-
2-Coloring number revisited
Publikacja2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
A construction for the hat problem on a directed graph
PublikacjaA team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...
-
High frequency oscillations are associated with cognitive processing in human recognition memory
PublikacjaHigh frequency oscillations are associated with normal brain function, but also increasingly recognized as potential biomarkers of the epileptogenic brain. Their role in human cognition has been predominantly studied in classical gamma frequencies (30-100 Hz), which reflect neuronal network coordination involved in attention, learning and memory. Invasive brain recordings in animals and humans demonstrate that physiological oscillations...
-
A simple approach to heat exchanger sizing optimisation by means of entrophy generation minimisation
PublikacjaIn the paper an attempt is presented to find the method of optimization of microtube diameter with respect to optimal thermal-hydraulic conditions in the single-phase shell-and-tube heat exchangers. The approach is based on consideration of pumping power at the condition of maximum heat transfer by the heat exchanger tube system. In the optimization method the tube diameter is first specified and then appropriate calculations are...
-
Influence of edge subdivision on the convex domination number
PublikacjaWe study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.
-
Dedicated scheduling of tasks to minimize mean flow time
PublikacjaThis paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.
-
Graph classes generated by Mycielskians
PublikacjaIn 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...
-
Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych
PublikacjaW 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.