Filters
total: 1932
-
Catalog
- Publications 1380 available results
- Journals 93 available results
- Conferences 2 available results
- People 83 available results
- Inventions 12 available results
- Projects 14 available results
- Laboratories 1 available results
- Research Teams 1 available results
- e-Learning Courses 121 available results
- Events 12 available results
- Open Research Data 213 available results
displaying 1000 best results Help
Search results for: D-XYLOSE REDUCTASE
-
Bounds on the vertex-edge domination number of a tree
PublicationA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
Chemopreventive activity of bioactive fungal fractions isolated from milk-supplemented cultures of Cerrena unicolor and Pycnoporus sanguineus on colon cancer cells
Publication -
Photocatalytic properties of Nafion membranes containing graphene oxide/titania nanocomposites
Publication -
Levels of Antioxidant Activity and Fluoride Content in Coffee Infusions of Arabica, Robusta and Green Coffee Beans in According to their Brewing Methods
Publication -
The simultaneous determination of hydrophobicity and dissociation constant by liquid chromatography–mass spectrometry
Publication -
The first order phase transition and superconductivity in BaNi2As2 single crystals
PublicationDyskutowane są synteza i właściwości fizyczne monokryształów BaNi2As2. BaNi2As2 krystalizuje w strukturze ThCr2Si2, a stałe sieciowe wynoszą odpowiednio: a = 4.112(4) A i c = 11.54(2) A. Pomiar oporu elektrycznego, zmiennopolowej podatności magnetycznej, ciepła właściwego, pokazują objętościowy efekt nadprzewodzący z Tc = 0.7 K.
-
Experimental database of 3D lattice structure scaffolds testing
Open Research DataDataset contains results of validation (experimental testing) of 3D lattice scaffolds proposed in the paper "Mathematical approach to design 3D scaffolds for the 3D printable bone implant". There are presented three series of experimental testing for each of seven tested scaffolds:
-
Structure and properties of the exopolysaccharides produced by Pseudomonas mutabilis T6 and P. mutabilis ATCC 31014
PublicationThis paper presents a study on the purification, primary structure, and rheological properties of exopolysaccharides isolated from cultures of Pseudomonas mutabilis T6 and P. mutabilis ATCC 31014. Both polymers are exopolysaccharides of D-mannose. The mannan isolated from P. mutabilis T6 contains on average about 5% of residual b-D-glucose, in contrast to the mannan from P. mutabilis ATCC 31014, which contained only trace amounts...
-
On greedy graph coloring in the distributed model
PublicationArtykuł 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.
-
Cold-Active beta-Galactosidases: Sources, Biochemical Properties and Their Biotechnological Potential
Publicationbeta-D-Galactosidases have been studied extensively in terms of their application to a variety of industrial technologies. To date, considerable research efforts have been devoted to characterization of new cold-active beta-D-galactosidases which were isolated directly from selected species of bacteria and yeasts, as well as with the use of metagenomic approaches. This chapter will provide a review of current research towards cold-active...
-
Strefa podmiejska w warunkach zrównoważonego rozwoju.
PublicationNR DOKUM: D 73137
-
An upper bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
Kamila Klimaszewska dr inż.
PeopleBorn 1979, Warsaw, Poland.Studies in chemistry at Faculty of Chemistry of the Gdańsk University of Technology (1998-2003), PhD in 2008. From 2008 she is employed in Department of Analytical Chemistry.
-
Vijayakumar B Ph D
People -
Irina Abaloszewa Ph. D.
People -
Systems of Nonlinear Fractional Differential Equations
PublicationUsing the iterative method, this paper investigates the existence of a unique solution to systems of nonlinear fractional differential equations, which involve the right-handed Riemann-Liouville fractional derivatives D(T)(q)x and D(T)(q)y. Systems of linear fractional differential equations are also discussed. Two examples are added to illustrate the results.
-
Scintillation light trapping and radiation damage in CeF/sub 3/
Publication -
Methods of preparation and performance of sealed gas photomultipliers for visible light
Publication -
CdWO/sub 4/ crystal in gamma-ray spectrometry
Publication -
Low temperature removal of SO2 traces from air by MgO-loaded porous carbons
Publication -
Electronic and lattice properties of noncentrosymmetric superconductors ThTSi (T=Co, Ir, Ni, and Pt)
Publication -
The influence of charge compensation defects on the spectroscopic properties of europium doped Ca9Y(PO4)7
Publication -
Robust HPLC–MS/MS method for levofloxacin and ciprofloxacin determination in human prostate tissue
Publication -
Influence of geometry and surface morphology of the U-tube on the fluid flow in the range of various velocities
Publication -
Structural and magnetic properties of Cu-alloyed FePd films
Publication -
Polymeric nanocapsules with up-converting nanocrystals cargo make ideal fluorescent bioprobes
Publication -
Fast collaborative graph exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
An upper bound for the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
Amygdalin: Toxicity, Anticancer Activity and Analytical Procedures for Its Determination in Plant Seeds
PublicationAmygdalin (D-Mandelonitrile 6-O--D-glucosido--D-glucoside) is a natural cyanogenic glycoside occurring in the seeds of some edible plants, such as bitter almonds and peaches. It is a medically interesting but controversial compound as it has anticancer activity on one hand and can be toxic via enzymatic degradation and production of hydrogen cyanide on the other hand. Despite numerous contributions on cancer cell lines, the clinical...
-
MC1R common variants, CDKN2A and their association with melanoma and breast cancer risk
Publication -
Certified domination
PublicationImagine 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...
-
A demand for innovation support in samll and medium-sized enterprises in the baltic sea region
Publicationthe aim of the expertise is to analyze the actual demand of smes from the baltic sea region for innovation support. the results of the conducted study can help formulate recommendations designed to increase innovation and competitiveness of smes in the baltic sea region in the future. research activities of this study include: the evaluation of innovation level of the baltic sea region enterprises (type and intensity of implemented...
-
Fluoride as a factor initiating and potentiating inflammation in THP1 differentiated monocytes/macrophages
Publication -
New fast photomultipliers with a screening grid at the anode
Publication -
Accuracy Analysis of Measurements in Electrochemical Biosensing
Publication -
Dispersing hydrophilic nanoparticles in hydrophobic polymers: HDPE/ZnO nanocomposites by a novel template-based approach
Publication -
Distributed largest-first algorithm for graph coloring.
PublicationW artykule zaprezentowano rozproszony, probabilistyczny algorytm kolorowania grafów. Kolorowanie uzyskane jest optymalne lub prawie optymalne dla takich klas grafów jak koła dwudzielne, gąsienice czy korony. Udowodniono, że algorytm ten działa w czasie O(D^2 log n) rund dla dowolnego grafu n wierzchołkowegoo stopniu maksymalnym D.
-
Combinatorial scheme of finding minimal number of periodic points for smooth self-maps of simply connected manifolds
PublicationLet M be a closed smooth connected and simply connected manifold of dimension m at least 3, and let r be a fixed natural number. The topological invariant D^m_r [f], defined by the authors in [Forum Math. 21 (2009), 491-509], is equal to the minimal number of r-periodic points in the smooth homotopy class of f, a given self-map of M. In this paper, we present a general combinatorial scheme of computing D^m_r [f] for arbitrary dimension...
-
Wiktoria Wojnicz dr hab. inż.
PeopleDSc in Mechanics (in the field of Biomechanics) - Lodz Univeristy of Technology, 2019 PhD in Mechanics (in the field of Biomechanics) - Lodz Univeristy of Technology, 2009 (with distinction) List of papers (2009 - ) Wojnicz W., Wittbrodt E., Analysis of muscles' behaviour. Part I. The computational model of muscle. Acta of Bioengineering and Biomechanics, Vol. 11, No.4, 2009, p. 15-21 Wojnicz W., Wittbrodt E., Analysis of...
-
Note on the multidimensional Gebelein inequality
PublicationWe generalize the Gebelein inequality for Gaussian random vectors in R^d.
-
Central nervous system involvement in mantle cell lymphoma: clinical features, prognostic factors and outcomes from the European Mantle Cell Lymphoma Network†
Publication -
Correlation between in vitro and in vivo data on food digestion. What can we predict with static in vitro digestion models?
PublicationDuring the last decade, there has been a growing interest in understanding food's digestive fate in order to strengthen the possible effects of food on human health. Ideally, food digestion should be studied in vivo on humans but this is not always ethically and financially possible. Therefore, simple in vitro digestion models mimicking the gastrointestinal tract have been proposed as alternatives to in vivo experiments. Thus,...
-
A lower bound on the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
On the super domination number of lexicographic product graphs
PublicationThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
On the Trail of the Oldest Domestic Cat in Poland. An Insight from Morphometry, Ancient DNA and Radiocarbon Dating
Publication -
One-Step Combustion Synthesis of Novel Nanocarbons via Magnesiothermic Reduction of Carbon-Containing Oxidants
Publication -
Parametric Study on a Performance of a Small Counter-Rotating Wind Turbine
PublicationA small Counter-Rotating Wind Turbine (CRWT) has been proposed and its performancehas been investigated numerically. Results of a parametric study have been presented in this paper.As parameters, the axial distance between rotors and a tip speed ratio of each rotor have been selected.Performance parameters have been compared with reference to a Single Rotor Wind Turbine (SRWT).Simulations were carried out with Computational Fluids...
-
Studies of scintillation light nonproportionality of ZnSe(Te), CsI(Tl) and YAP(Ce) crystals using heavy ions
Publication -
Sleep assessment in obsessive-compulsive disorder treated with deep brain stimulation - double case report of morning and evening chronotype patients
Publication -
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
PublicationWe study the classical and quantum values of a class of one-and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR(XOR-d) games we study are a subclass of the well-known linear games. We introduce a 'constraint graph' associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the...