Filters
total: 1228
displaying 1000 best results Help
Search results for: cloning
-
CLONING AND STEM CELLS
Journals -
Integration of Active Clothing with a Personal Cooling System within the NGIoT Architecture for the Improved Comfort of Construction Workers
Publication -
Advanced Macromodel Matrix Structure Cloning for FDTD
PublicationWe propose an improved macromodel-based techniquefor efficient analysis of the structures based on PhotonicCrystals (PhC). The technique involves a new structure of thecoupling matrix and advanced cloning of not only the macromodel matrices, but also the coupling matrices SE and SH.The method allows one to shorten considerably the preprocessingtime, the RAM usage and also the iterating speed of performingFDTD. With this...
-
Clothing Cultures
Journals -
Stem Cells and Cloning-Advances and Applications
Journals -
Thermal cooling process by nanofluid flowing near stagnating point of expanding surface under induced magnetism force: A computational case study
PublicationThis paper is dedicated to the exam of entropy age and research of the effect of mixing nanosolid additives over an extending sheet. In this review, Newtonian nanofluid version turned into researched at the actuated appealing field, heat radiation and variable heat conductivity results. With becoming modifications, the proven PDEs are moved into popular differential situations and paintings mathematically making use of a specific...
-
Direct cloning of heavy metal resistance genes from metagenomic DNA
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.
-
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...
-
Equitable coloring of hypergraphs
PublicationA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Rank Coloring of Graphs.
PublicationRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Harmonions Coloring of Graphs.
PublicationProblem kolorowania grafów jest motywowany radionawigacją lotniczą, kompresją obrazów i in. W rozdziale podano podstawowe fakty dotyczące tego modelu kolorowania, a wsród nich dolne i górne oszacowania na liczbę harmoniczną i algorytm o złożoności 0 (mm3) dający bardzo dobre pokolorowania przybliżone.
-
T-coloring of graphs.
PublicationNiniejszy rozdział omawia kontrastowe kolorowanie grafów. Podana została jego definicja i podstawowe własności, zastosowania oraz złożoność obliczeniowa problemów rozważanych w ramach tej dziedziny.
-
Classical coloring of graphs.
PublicationRozdział obejmuje klasyczne kolorowanie krawędzi i wierzołków w grafach prostych. Oprócz podstawowych definicji podane zostały najczęściej stosowane metody przybliżone oraz ich właściwości. Dodatkowo rozdział zawiera przegląd znanych benczmarków dla podanych metod w kontekście klasycznego modelu kolorowania.
-
Sum Coloring of Graphs.
PublicationRozdział jest poświęcony sumacyjnemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Cloning, Expression and Purification of Wild-Type Trehalose Synthase from Deinococcus geothermalis
PublicationThe aim of this study was isolation and cloning of trehalose synthase gene derived from extremophilic microorganism to the expression vectors in the Tabor-Studier system and its expression in Rosetta(DE3)pLysS Escherichia coli cells. The second phase of the study consisted of proteins purification using an initial denaturation of host proteins and salting-out proteins by ammonium sulfate.
-
Cloning and characterization of the dnaK heat shock operon of the marine bacterium Vibrio harveyi
Publication -
Cloning, expression, purification and characterization of recombinant trehalose synthase from Deinococcus radiodurans.
PublicationTrehalose (α-D-glucopyranosyl-1,1-α-D-glucopyranoside) is a nonreducing disacharide in which the two glucose molecules are linked trough a α-1,1-glycosidic bond. Trehalose is readily hydrolyzed to glucose and can be used as a reserve of that sugar in the cell. The presence of trehalose was found in the cells of fungi and yeasts, bacteria, nematodes, insects, eggs, pupae and some plants. The characteristics of trehalose make it...
-
Cloning of the thermostable alpha-amylase gene from Pyrococcus woesei in Escherichia coli.
PublicationGen kodujący alfa-amylazę z Pyrococcus woesei klonowano do plazmidów pET21d(+)lub pYTB2, którymi transformowano komórki Escherichia coli. Otrzymana rekombinantowa alfa amylaza wykazuje maksymalną aktywność przy pH 5.6 w temperaturze 95 stC i przejawia około 24 % początkowej aktywności nawet po 2 godz. inkubacji w 120 stC. Duża termostabilność otrzymanego preparatu świadczy o jego przydatności do enzymatycznego upłynniania skrobi.
-
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...
-
The saga of a fish: from a survival guide to closing lemmas
PublicationIn the paper by D. Burago, S. Ivanov and A. Novikov, “A survival guide for feeble fish”, it has been shown that a fish with limited velocity can reach any point in the (possibly unbounded) ocean provided that the fluid velocity field is incompressible, bounded and has vanishing mean drift. This result extends some known global controllability theorems though being substantially nonconstructive. We give a fish a different recipe...
-
RecA Proteins from Deinococcus geothermalis and Deinococcus murrayi - Cloning, Purification and Biochemical Characterisation
PublicationEscherichia coli RecA plays a crucial role in recombinational processes, the induction of SOS response and mutagenic lesion bypasses. It has also been demonstrated that RecA protein is indispensable when it comes to the reassembly of shattered chromosomes in gamma-irradiated Deinococcus radiodurans, one of the most radiation-resistant organisms known. Moreover, some functional differences between E. coli and D. radiodurans RecA...
-
Non-coding RNA
Journals -
Koala graph coloring library: an open graph coloring library for real-world applications
PublicationPomimo intensywnej pracy naukowej na polu kolorowania grafów, nie jest znana kompletna i dedykowana biblioteka programistyczna. Celem artykułu jest zaproponowanie architektury takiej biblioteki. Celem jest spełnienie oczekiwań wypływających z rzeczywistych zastosowań, w szczególności spełnienie potrzeb wydajnościowych. Zaimplementowano szereg algorytmów cheurystycznego kolorowania grafów. Przyjętym językiem programowania jest C++....
-
Interval Edge-Coloring of Graphs
Publication -
A note on mixed tree coloring
PublicationZaproponowano liniowy algorytm dla problemu kolorowania mieszanego w drzewach, uzyskując tym samym poprawę w stosunku do algorytmu o złożoności O(n^2) podanego w pracy [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].
-
On the complexity of distributed greedy coloring
PublicationW pracy rozważono problem kolorowania grafów przy dodatkowym założeniu, że kolor żadnego wierzchołka nie może zostać zmniejszony bez zmiany kolorów przynajmniej jednego z jego sąsiadów. Przeprowadzone rozważania dotyczyły złożoności obiczeniowej problemu w modelu Liniala obliczeń rozproszonych. Podano ograniczenia dolne i górne złożoności problemu oraz zestawiono problem z innymi pokrewnymi zagadnieniami grafowymi.
-
Brushing with additional cleaning restrictions
PublicationIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
Mixed graph edge coloring
PublicationW pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.
-
On efficient coloring of chordless graphs
PublicationArtykuł omawia zagadnienie optymalnego, wielomianowego rozpoznawania i kolorowania grafów bezcięciwowych. Zawiera dowód tego, że takie grafy są zawsze 4-kolorowalne oraz opis wielomianowego algorytmu, który koloruje je minimalną możliwą liczbą kolorów.
-
Interval incidence graph coloring
PublicationIn 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...
-
On-line P-coloring of graphs
PublicationFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
2-Coloring number revisited
Publication2-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...
-
Interval edge-coloring of graphs.
PublicationRozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.
-
Path Coloring and Routing in Graphs.
PublicationW rozdziale omówione zostały problemy kolorowania ścieżek i routingu w grafach. Podano podstawowe definicje związane z tymi problemami, znane wyniki wraz z dyskusją złożoności obliczeniowej dla grafów ogólnych i dla kilku podstawowych klas grafów oraz zastosowania.
-
Equitable vertex coloring of graphs
PublicationW pracy podajemy wartości sprawiedliwej liczby chromatycznej dla niektórych klas grafów. Podajemy również dwa algorytmy heurystyczne dla sprawiedliwego kolorowania grafów z suboptymalna liczba koloru.
-
Influence of Honing Parameters on the Quality of the Machined Parts and Innovations in Honing Processes
PublicationThe article presents a literature review dealing with the effect of the honing parameters on the quality of the machined parts, as well as with the recent innovations in honing processes. First, an overview about the honing and the plateau-honing processes is presented, considering the main parameters that can be varied during machining. Then, the influence of the honing parameters on surface finish, shape deviation and material...
-
Effect of Sieve Drum Inclination Angle on Wheat Grain Cleaning in a Novel Rotary Cleaning Device
Publication -
Analysis of the Sieve Unit Inclination Angle in the Cleaning Process of Oat Grain in a Rotary Cleaning Device
Publication -
Clothing and Textiles Research Journal
Journals -
Appraisal of a hybrid air cleaning process
Publication -
The new concept of product. Cooling band
PublicationThe chapter below presents the innovative solution consist in applying the cooling band to help holding the hot object. The solution was found through substitute inputs analysis and brain storm method. The new product was submitted in Polish Patent Office under the No. W.120905.
-
Modelling of pipes conveying flowing liquid
PublicationThe paper introduces the method of modal reduction of system which consists of pipe with flowing liquid. The concept of hybrid model is proposed. The system model consists of two parts, the modal model and the finite elements model. The modal model represents linear, self-adjoined part of the system, while simple lumped technique is applied for modelling of Coriolis phenomena.
-
The complexity of equitable vertex coloring graphs
PublicationW artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.
-
Parallel immune system for graph coloring
PublicationThis paper presents a parallel artificial immune system designed forgraph coloring. The algorithm is based on the clonal selection principle. Each processor operates on its own pool of antibodies and amigration mechanism is used to allow processors to exchange information. Experimental results show that migration improves the performance of the algorithm. The experiments were performed using a high performance cluster on a set...
-
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...
-
Interval incidence coloring of subcubic graphs
PublicationIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
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.
-
Interval incidence coloring of bipartite graphs
PublicationIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...
-
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...