Sökning: "Lan Do"
Visar resultat 1 - 5 av 14 avhandlingar innehållade orden Lan Do.
1. New tools for sample preparation and instrumental analysis of dioxins in environmental samples
Sammanfattning : Polychlorinated dibenzo-p-dioxins (PCDDs) and dibenzofurans (PCDFs), two groups of structurally related chlorinated aromatic hydrocarbons, are of high concern due to their global distribution and extreme toxicity. Since they occur at very low levels, their analysis is complex, challenging and hence there is a need for efficient, reliable and rapid alternative analytical methods. LÄS MER
2. Mortality in transitional Vietnam
Sammanfattning : Understanding mortality patterns is an essential pre-requisite for guiding public health action and for supporting development of evidence-based policy. However, such information is not sufficiently available in Vietnam. LÄS MER
3. Molten carbonate fuel cells for electrolysis
Sammanfattning : The molten carbonate fuel cell has evolved to current megawatt-scale commercial power plants. When using the fuel cell for electrolysis, it provides a promising option for producing fuel gases such as hydrogen and syngas. The cell can thereby operate reversibly as a dual energy converter for electricity generation and fuel gas production. LÄS MER
4. On avoiding and completing edge colorings
Sammanfattning : These papers are all related to the problem of avoiding and completing an edge precoloring of a graph. In more detail, given a graph G and a partial proper edge precoloring φ of G and a list assignment L for every non-colored edge of G, can we extend the precoloring to a proper edge coloring avoiding any list assignment? In the first paper, G is a d-dimensional hypercube graph Qd, a partial proper edge precoloring φ and every list assignment L must satisfy certain sparsity conditions. LÄS MER
5. On avoiding and completing colorings
Sammanfattning : All of my papers are related to the problem of avoiding and completing an edge precoloring of a graph. In more detail, given a graph G and a partial proper edge precoloring φ of G and a list assignment L for every non-colored edge of G, can we extend φ to a proper edge coloring of G which avoids L? In Paper I, G is the d-dimensional hypercube graph Qd, a partial proper edge precoloring φ and a list assignment L must satisfy certain sparsity conditions. LÄS MER