Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.

Noncommutative Quantum Field Theory : Problem of Time and Some Applications

In this thesis the current status and some open problems of noncommutative quantum field theory are reviewed. The introduction aims to put these theories in their proper context as a part of the larger program to model the properties of quantized space-time. Throughout the thesis, special focus is put on the role of noncommutative time and how its nonlocal nature presents us with problems. Applications in scalar field theories as well as in gauge field theories are presented. The infinite nonlocality of space-time introduced by the noncommutative coordinate operators leads to interesting structure and new physics. High energy and low energy scales are mixed, causality and unitarity are threatened and in gauge theory the tools for model building are drastically reduced. As a case study in noncommutative gauge theory, the Dirac quantization condition of magnetic monopoles is examined with the conclusion that, at least in perturbation theory, it cannot be fulfilled in noncommutative space.

Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems

In this paper, a novel genetic algorithm is developed by generating artificial chromosomes with probability control to solve the machine scheduling problems. Generating artificial chromosomes for Genetic Algorithm (ACGA) is closely related to Evolutionary Algorithms Based on Probabilistic Models (EAPM). The artificial chromosomes are generated by a probability model that extracts the gene information from current population. ACGA is considered as a hybrid algorithm because both the conventional genetic operators and a probability model are integrated. The ACGA proposed in this paper, further employs the ``evaporation concept'' applied in Ant Colony Optimization (ACO) to solve the permutation flowshop problem. The ``evaporation concept'' is used to reduce the effect of past experience and to explore new alternative solutions. In this paper, we propose three different methods for the probability of evaporation. This probability of evaporation is applied as soon as a job is assigned to a position in the permutation flowshop problem. Experimental results show that our ACGA with the evaporation concept gives better performance than some algorithms in the literature.

Mixed Convection Induced in a Gas Flowing Past a Hot Horizontal Flat Plate

A boundary layer analysis of mixed convective motion over a hot horizontal flat plate is performed under the conditions of steady flow and low speed. Use of the Howarth-Dorodnytsyn transformation makes it possible to dispense with the usual Boussinesq approximation, and variable gas properties are accounted for via the assumption that dynamic viscosity and thermal conductivity are proportional to the absolute temperature. The formulation presented enables the entire mixed convection regime to be described by a single set of equations. Finite difference solutions when the Prandtl number is 0.72 are obtained over the entire range of the mixed convection parameter ξ from 0 (free convection) to 1 (forced convection) and heating parameter ▵ values from 2 to 12. The effects of both ξ and ▵on the velocity profiles, the temperature profiles, and the variation of skin friction and heat transfer functions are clearly illustrated in tables and graphs.

Substance misuse problems during pregnancy with special emphasis on buprenorphine

Maternal drug abuse during pregnancy endangers the future health and wellbeing of the infant and growing child. On the other hand, via maternal abstinence, these problems would never occur; so the problems would be totally preventable. Buprenorphine is widely used in opioid maintenance treatment as a substitute medication. In Finland, during 2000 s buprenorphine misuse has steadily increased. In 2009 almost one third of clientele of substance treatment units were in treatment because of buprenorphine dependence. At Helsinki Women s Clinic the first child with prenatal buprenorphine exposure was born in 2001. During 1992-2001 in the three capital area maternity hospitals (Women s clinic, Maternity hospital, Jorvi hospital) 524 women were followed at special antenatal clinics due to substance abuse problems. Three control women were drawn from birth register to each case woman and matched for parity and same place and date of the index birth. According to register data mortality rate was 38-fold higher among cases than controls within 6-15 years after index birth. Especially, the risk for violent or accidental death was increased. The women with substance misuse problems had also elevated risk for viral hepatitis and psychiatric morbidity. They were more often reimbursed for psychopharmaceuticals. Disability pensions and rehabilitation allowances were more often granted to cases than controls. In total 626 children were born from these pregnancies. According to register data 38% of these children were placed in out-of-home care as part of child protection services by the age of two years, and half of them by the age of 12 years, the median follow-up time was 5.8 years. The risk for out-of-home care was associated with factors identifiable during the pre- and perinatal period. In 2002-2005 67 pregnant women with buprenorphine dependence were followed up at the Helsinki University Hospital, Department of Obstetrics and Gynecology. Their pregnancies were uneventful. The prematurity rate was similar and there were no more major anomalies compared to the national statistics. The neonates were lighter compared to the national statistics. They were also born in good condition, with no perinatal hypoxia as defined by standard clinical parameters or certain biochemical markers in the cord blood: erythropoietin, S100 and cardiac troponin-t. Almost 80% of newborns developed neonatal abstinence syndrome (NAS) and two third of them needed morphine medication for it. Maternal smoking over ten cigarettes per day aggravated and benzodiazepine use attenuated NAS. An infant s highest urinary norbuprenorphine concentration during their first 3 days of life correlated with the duration of morphine treatment. The average length of infant s hospital stay was 25 days.

Reactions of Mixed-Valent Palladium (IV,II) Complexes of Tetradentate Schiff-Bases Involving Bond Isomerization

Reactions of [PdIVB-(AI)2]++ [PdIICl4]-- (i) B-(AI)2 = dianion of N,N'-ethylene-/i-propylene-/n-propylene-bis(acetyl-acetoneimine) with some π-acceptor ligands, aliphatic primary amines and nitrosating reagents have been investigated. In all these reactions except nitrosation, 1:1 adducts having the formula, [PdIVB-(AI)2.X] [PdIICl4] [X = triphenylphosphine (TPP), triphenylarsine (TPA), pyridine (Py), methylamine (CH3NH2) or ethylamine (C2H5NH2)] are obtained. The formation of these complexes is associated with a bond isomerization - from Pd-Cxo-π -allylic bond prevailing in [PdIVB-(AI)2]2+ to PdIV-O bonding.Reaction of (i) with nitrosating reagents reduces PdIV to PdII and subsequently transform the γ-CH group, into an ambidentate isonitroso group (°C = NOH). The latter enters into coordination with PdII by dislodging the already coordinated carbonyl group. Further, selective nitrosation (mono- and dinitrosation) has been carried out by controlling the amount of the nitrosating reagent and the reaction time. The complexes have been characterized by elemental analyses, electrical conductivity, magnetic susceptibility and ir spectral data.

Quantification problems in the design of forest policy programs.

XVIII IUFRO World Congress, Ljubljana 1986.

Private and municipal forests and the forestry planning system in Japan - trends and problems after World War II.

XVIII IUFRO World Congress, Ljubljana 1986.

Unsteady mixed convection flow in stagnation region adjacent to a vertical surface

The unsteady two-dimensional laminar mixed convection flow in the stagnation region of a vertical surface has been studied where the buoyancy forces are due to both the temperature and concentration gradients. The unsteadiness in the flow and temperature fields is caused by the time-dependent free stream velocity. Both arbitrary wall temperature and concentration, and arbitrary surface heat and mass flux variations have been considered. The Navier-Stokes equations, the energy equation and the concentration equation, which are coupled nonlinear partial differential equations with three independent variables, have been reduced to a set of nonlinear ordinary differential equations. The analysis has also been done using boundary layer approximations and the difference between the solutions has been discussed. The governing ordinary differential equations for buoyancy assisting and buoyancy opposing regions have been solved numerically using a shooting method. The skin friction, heat transfer and mass transfer coefficients increase with the buoyancy parameter. However, the skin friction coefficient increases with the parameter lambda, which represents the unsteadiness in the free stream velocity, but the heat and mass transfer coefficients decrease. In the case of buoyancy opposed flow, the solution does not exist beyond a certain critical value of the buoyancy parameter. Also, for a certain range of the buoyancy parameter dual solutions exist.

Varistors based on mixed‐phase ceramics containing ZnO and negative temperature coefficient spinels

High nonlinearity coefficients of 60–150 are observed in the current‐voltage (I‐V) curves of the mixed phase ceramics formed by cosintering ZnO with spinel phases having large negative temperature coefficients (NTCs) in resistivity. The region of negative slope in the I‐V curves of the NTC ceramics is progressively made positive with ZnO phase content, wherein ZnO grains function as a built‐in resistor in series to the resistance of the NTC phase. High α depends on the optimum phase content of ZnO as much as its intrinsic conductivity. The studies indicate that the predominent contribution to power dissipation is by way of joule heating from the resistive component of the current.

Optimisation problems in wireless sensor networks

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating–dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating–dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs – these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating–dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.