Filtry
wszystkich: 1414
-
Katalog
- Publikacje 1107 wyników po odfiltrowaniu
- Czasopisma 24 wyników po odfiltrowaniu
- Konferencje 8 wyników po odfiltrowaniu
- Osoby 77 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 7 wyników po odfiltrowaniu
- Wydarzenia 6 wyników po odfiltrowaniu
- Dane Badawcze 184 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: VOICE CLONING
-
Cloning, Expression and Purification of Wild-Type Trehalose Synthase from Deinococcus geothermalis
PublikacjaThe 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, expression, purification and characterization of recombinant trehalose synthase from Deinococcus radiodurans.
PublikacjaTrehalose (α-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...
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublikacjaA 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
PublikacjaIn 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...
-
Biofilm Growth Causes Damage to Silicone Voice Prostheses in Patients after Surgical Treatment of Locally Advanced Laryngeal Cancer
Publikacja -
New Voices in Translation Studies
Czasopisma -
RecA Proteins from Deinococcus geothermalis and Deinococcus murrayi - Cloning, Purification and Biochemical Characterisation
PublikacjaEscherichia 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
Czasopisma -
Koala graph coloring library: an open graph coloring library for real-world applications
PublikacjaPomimo 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
Publikacja -
Interval edge-coloring of graphs.
PublikacjaRozdział 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.
PublikacjaW 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.
-
On the complexity of distributed greedy coloring
PublikacjaW 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.
-
A note on mixed tree coloring
PublikacjaZaproponowano 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].
-
Mixed graph edge coloring
PublikacjaW 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
PublikacjaArtykuł 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.
-
On-line P-coloring of graphs
PublikacjaFor 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...
-
Brushing with additional cleaning restrictions
PublikacjaIn 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...
-
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...
-
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...
-
Equitable vertex coloring of graphs
PublikacjaW 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
PublikacjaThe 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
Publikacja -
Analysis of the Sieve Unit Inclination Angle in the Cleaning Process of Oat Grain in a Rotary Cleaning Device
Publikacja -
JOURNAL OF VOICE
Czasopisma -
Clothing and Textiles Research Journal
Czasopisma -
Appraisal of a hybrid air cleaning process
Publikacja -
The Backbone Coloring Problem for Small Graphs
PublikacjaIn 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...
-
Equitable coloring of corona products of graphs
PublikacjaIn 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.
-
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...
-
The new concept of product. Cooling band
PublikacjaThe 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.
-
The complexity of equitable vertex coloring graphs
PublikacjaW 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
PublikacjaThis 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...
-
Modelling of pipes conveying flowing liquid
PublikacjaThe 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.
-
Equitable coloring of corona multiproducts of graphs
PublikacjaWe 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.
-
Edge-coloring of 3-uniform hypergraphs
PublikacjaWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
Interval incidence coloring of subcubic graphs
PublikacjaIn 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.
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Interval incidence coloring of bipartite graphs
PublikacjaIn 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...
-
On greedy graph coloring in the distributed model
PublikacjaArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Zaprezentowano nowy probabilistyczny algorytm dający w wyniku pokolorowanie LF. Udowodniono, że jakakolwiek rozproszona implementacja LF wymaga co najmniej D rund, gdzie D jest maksymalnym stopniem wierzchołka w grafie.
-
Simulation of the Opening and Closing of Hsp70 Chaperones by Coarse-Grained Molecular Dynamics
Publikacja -
Detection of Closing Crack in Beam Based on Responses Induced by Harmonic Excitation
PublikacjaThe non-linear contact model was chosen to simulate the closed crack in the cantilever beam. The study examines the shape and characteristics of the phase diagram of a cantilever beam with closed cracks. It investigates how various crack properties influence the geometry of the phase diagram and proposes a method for identifying cracks based on their features. The area of each closed curve in the phase diagram is determined using...
-
Recombinant !ermostable AP Exonuclease from Thermoanaerobacter tengcongensis: Cloning, Expression, Purification, Properties and PCR Application
PublikacjaApurinic/apyrimidinic (AP) sites in DNA are considered to be highly mutagenic and must be corrected to preserve genetic integrity, especially at high temperatures. !e gene encoding a homologue of AP exonuclease was cloned from the thermophilic anaerobic bacterium Thermoanaerobacter tengcongensis and transformed into Escherichia coli. The protein product showed high identity (80%) to human Ape1 nuclease, whereas to E. coli exonuclease...
-
Voices - Journal of New York Folklore
Czasopisma -
VOICES-THE JOURNAL OF NEW YORK FOLKLORE
Czasopisma -
Cloning, expression in Komagataella phaffii, and biochemical characterization of recombinant sequence variants of Pseudomonas sp. S9 GDSL-esterase
PublikacjaTwo recombinant Komagataella phaffii (formerly Pichia pastoris) yeast strains for production of two sequential variants of EstS9 esterase from psychrotolerant bacterium Pseudomonas sp. S9, i.e. αEstS9N (a two-domain enzyme consisting of a catalytic domain and an autotransporter domain) and αEstS9Δ (a single-domain esterase) were constructed. However, only one of recombinant K. phaffii strains, namely Komagataella phaffii X-33/pPICZαestS9Δ,...
-
A novel cold-active beta-D-galactosidase from the Paracoccus sp. 32d - gene cloning, purification and characterization
PublikacjaBeta-D-galactosidase (EC 3.2.1.23) catalyze the hydrolysis of terminal non-reducing beta-D-galactose residues in beta-D-galactosides. Cold-active beta-D-galactosidases have recently become a focus of attention of researchers and dairy product manufactures owing to theirs ability to: (I) eliminate of lactose from refrigerated milk for people afflicted with lactose intolerance, (II) convert lactose to glucose and galactose which...
-
Cloning, expression, and purification of a recombinant cold-adapted β-galactosidase from antarctic bacterium Pseudoalteromonas sp. 22b
PublikacjaAntarktyczny szczep, gram-ujemnych bakterii Pseudoalteromonas sp. 22b, wyizolowanych z przewodu pokarmowego kryla z gatunku Thyssanoessa macrura, jest producentem wewnątrzkomórkowej zimnolubnej beta-galaktozydazy. Białko to jest homotetramerem, w którym każda z jednostek monomeru zbudowana jest z 1028 reszt aminokwasowych. Gen kodujący ten enzym został sklonowany i eksprymowany w komórkach E. coli. Następnie z zastosowaniem procedury...
-
A new cold-active β-galactosidase from Arthrobacter sp. S3* - gene cloning, overexpression, purification and properties
PublikacjaA psychrotrophic bacterium producing a cold-active β-galactosidase was isolated from Spitsbergen soil and classified as Arthrobacter sp. S3*. The gene encoding β-galactosidase was isolated from the genomic DNA library, sequenced, cloned, expressed in Escherichia coli, purified by ion exchange chromatography and characterized. The Arthrobaster sp. S3* β-galactosidase is a homotrimeric enzyme composed of 74,4 kDa subunits. It is...
-
Slowly-closing valve behaviour during steam machine accelerated start-up
PublikacjaThe paper discusses the state of stress in a slowly-closing valve during accelerated start-up of a steam turbine. The valve is one of the first components affected by high temperature gradients and is a key element on which the power, efficiency and safety of the steam system depend. The authors calibrated the valve model based on experimental data and then performed extended Thermal-FSI analyses relative to experiment. The issue...