A study of the spectrum of an acoustic field in shallow water due to noise sources at the surface

An expression for the spectrum and cross spectrum of an acoustic field measured at two vertically separated sensors in shallow water has been obtained for any correlated noise sources distributed over the surface. Numerical results are presented for the case where the noise sources, white noise and wind-induced colored noise, are contained within a circular disk centered over the sensors. The acoustic field is generally inhomogeneous except when the channel is deep. The coherence function becomes real for a large disk, for a radius greater than 25 times the depth of the channel, decreases with further increase of the size of the disk, and finally tapers off after certain limiting size, approximately given by 1/alpha, where alpha is the attenuation coefficient.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.

A microcomputer program to analyze the CD spectrum of proteins and nucleic acids—Use of LOTUS 1-2-3 spread sheet

A user friendly interactive computer program, CIRDIC, is developed which calculates the molar ellipticity and molar circular dichroic absorption coefficients from the CD spectrum. This, in combination with LOTUS 1-2-3 spread sheet, will give the spectra of above parameters vs wavelength. The code is implemented in MicroSoft FORTRAN 77 which runs on any IBM compatible PC under MSDOS environment.

Detection, epidemiology and host spectrum of cowpox and Borna disease virus infections

Several orthopoxviruses (OPV) and Borna disease virus (BDV) are enveloped, zoonotic viruses with a wide geographical distribution. OPV antibodies cross-react, and former smallpox vaccination has therefore protected human populations from another OPV infection, rodent-borne cowpox virus (CPXV). Cowpox in humans and cats usually manifests as a mild, self-limiting dermatitis and constitutional symptoms, but it can be severe and even life-threatening in the immunocompromised. Classical Borna disease is a progressive meningoencephalomyelitis in horses and sheep known in central Europe for centuries. Nowadays the virus or its close relative infects humans and also several other species in central Europe and elsewhere, but the existence of human Borna disease with its suspected neuropsychiatric symptoms is controversial. The epidemiology of BDV is largely unknown, and the present situation is even more intriguing following the recent detection of several-million-year-old, endogenized BDV genes in primate and various other vertebrate genomes. The aims of this study were to elucidate the importance of CPXV and BDV in Finland and in possible host species, and particularly to 1) establish relevant methods for the detection of CPXV and other OPVs as well as BDV in Finland, 2) determine whether CPXV and BDV exist in Finland, 3) discover how common OPV immunity is in different age groups in Finland, 4) characterize possible disease cases and clarify their epidemiological context, 5) establish the hosts and possible reservoir species of these viruses and their geographical distribution in wild rodents, and 6) elucidate the infection kinetics of BDV in the bank vole. An indirect immunofluorescence assay and avidity measurement were established for the detection, timing and verification of OPV or BDV antibodies in thousands of blood samples from humans, horses, ruminants, lynxes, gallinaceous birds, dogs, cats and rodents. The mostly vaccine-derived OPV seroprevalence was found to decrease gradually according to the year of birth of the sampled human subjects from 100% to 10% in those born after 1977. On the other hand, OPV antibodies indicating natural contact with CPXV or other OPVs were commonly found in domestic and wild animals: the horse, cow, lynx, dog, cat and, with a prevalence occasionally even as high as 92%, in wild rodents, including some previously undetected species and new regions. Antibodies to BDV were detected in humans, horses, a dog, cats, and for the first time in wild rodents, such as bank voles (Myodes glareolus). Because of the controversy within the human Borna disease field, extra verification methods were established for BDV antibody findings: recombinant nucleocapsid and phosphoproteins were produced in Escherichia coli and in a baculovirus system, and peptide arrays were additionally applied. With these verification assays, Finnish human, equine, feline and rodent BDV infections were confirmed. Taken together, wide host spectra were evident for both OPV and BDV infections based on the antibody findings, and OPV infections were found to be geographically broadly distributed. PCR amplification methods were utilised for hundreds of blood and tissue samples. The methods included conventional, nested and real-time PCRs with or without the reverse transcription step and detecting four or two genes of OPVs and BDV, respectively. OPV DNA could be amplified from two human patients and three bank voles, whereas no BDV RNA was detected in naturally infected individuals. Based on the phylogenetic analyses, the Finnish OPV sequences were closely related although not identical to a Russian CPXV isolate, and clearly different from other CPXV strains. Moreover, the Finnish sequences only equalled each other, but the short amplicons obtained from German rodents were identical to monkeypox virus, in addition to German CPXV variants. This reflects the close relationship of all OPVs. In summary, RNA of the Finnish BDV variant could not be detected with the available PCR methods, but OPV DNA infrequently could. The OPV species infecting the patients of this study was proven to be CPXV, which is most probably also responsible for the rodent infections. Multiple cell lines and some newborn rodents were utilised in the isolation of CPXV and BDV from patient and wildlife samples. CPXV could be isolated from a child with severe, generalised cowpox. BDV isolation attempts from rodents were unsuccessful in this study. However, in parallel studies, a transient BDV infection of cells inoculated with equine brain material was detected, and BDV antigens discovered in archival animal brains using established immunohistology. Thus, based on several independent methods, both CPXV and BDV (or a closely related agent) were shown to be present in Finland. Bank voles could be productively infected with BDV. This experimental infection did not result in notable pathological findings or symptoms, despite the intense spread of the virus in the central and peripheral nervous system. Infected voles commonly excreted the virus in urine and faeces, which emphasises their possible role as a BDV reservoir. Moreover, BDV RNA was regularly reverse transcribed into DNA in bank voles, which was detected by amplifying DNA by PCR without reverse transcription, and verified with nuclease treatments. This finding indicates that BDV genes could be endogenized during an acute infection. Although further transmission studies are needed, this experimental infection demonstrated that the bank vole can function as a potential BDV reservoir. In summary, multiple methods were established and applied in large panels to detect two zoonoses novel to Finland: cowpox virus and Borna disease virus. Moreover, new information was obtained on their geographical distribution, host spectrum, epidemiology and infection kinetics.

Simulation and graph mining tools for improving gene mapping efficiency

Gene mapping is a systematic search for genes that affect observable characteristics of an organism. In this thesis we offer computational tools to improve the efficiency of (disease) gene-mapping efforts. In the first part of the thesis we propose an efficient simulation procedure for generating realistic genetical data from isolated populations. Simulated data is useful for evaluating hypothesised gene-mapping study designs and computational analysis tools. As an example of such evaluation, we demonstrate how a population-based study design can be a powerful alternative to traditional family-based designs in association-based gene-mapping projects. In the second part of the thesis we consider a prioritisation of a (typically large) set of putative disease-associated genes acquired from an initial gene-mapping analysis. Prioritisation is necessary to be able to focus on the most promising candidates. We show how to harness the current biomedical knowledge for the prioritisation task by integrating various publicly available biological databases into a weighted biological graph. We then demonstrate how to find and evaluate connections between entities, such as genes and diseases, from this unified schema by graph mining techniques. Finally, in the last part of the thesis, we define the concept of reliable subgraph and the corresponding subgraph extraction problem. Reliable subgraphs concisely describe strong and independent connections between two given vertices in a random graph, and hence they are especially useful for visualising such connections. We propose novel algorithms for extracting reliable subgraphs from large random graphs. The efficiency and scalability of the proposed graph mining methods are backed by extensive experiments on real data. While our application focus is in genetics, the concepts and algorithms can be applied to other domains as well. We demonstrate this generality by considering coauthor graphs in addition to biological graphs in the experiments.

Vacuum ultraviolet circular dichroism spectrum of β-turn in solution

The vacuum ultraviolet circular dichroism spectrum of an isolated 4 → 1 hydrogen bonded β-turn is reported. The observed spectrum of N-acetyl-Pro-Gly-Leu-OH at − 40°C in trifluoroethanol is in good agreement with the theoretically calculated CD spectrum of the β-turn conformation. This spectrum, particularly the presence of a strong negative band around 180 nm and a large ratio [θ]201/[θ]225, can be taken as a characteristic feature of the isolated β-turn conformation. These CD spectral features can thus be used to distinguish the β-turn conformation from the β-structure in solution.

Generation of spectrum compatible accelerograms

In this paper a new method is presented for generating earthquake accelerograms which have pre-established response spectra. The non-stationary random nature and other salient features of the accelerograms can be taken care of by the procedure developed. The method leads to a sample spectrum which lies above the given spectrum. The generation of records to suit several spectra simultaneously can also be handled by this approach. The method is detailed first. This is followed by several numerical examples.

Macroscopic model of city traffic using bond graph modelling

Modelling of city traffic involves capturing of all the dynamics that exist in real-time traffic. Probabilistic models and queuing theory have been used for mathematical representation of the traffic system. This paper proposes the concept of modelling the traffic system using bond graphs wherein traffic flow is based on energy conservation. The proposed modelling approach uses switched junctions to model complex traffic networks. This paper presents the modelling, simulation and experimental validation aspects.

Analysis of the Ce 3d-4d4d Auger spectrum with the use of synchrotron radiation

We report 3d-4d4d Auger spectra of Ce metal with the use of synchrotron radiation to excite the initial core hole. By sweeping the excitation energy through the 3d-->4f threshold, it has been possible to excite different initial states selectively, enabling us to analyze the complex spectrum in terms of different contributions arising from various deca channels.

Analysis of the Gd 4d-XY Auger spectrum using synchrotron radiation

We report the 4d-XY (X, Y = 5p, 4f, and the conduction band) Auger spectra of clean Gd using a monochromatic photon source with energies above and below the 3d threshold. The spectra with higher hv show the existence of intense spectator-hole Auger transitions. Comparison of these spectra with those obtained with a primary electron source allows detailed interpretation of the various features and explains the unusual spin polarization of the electron-induced spectrum reported earlier.

On the Nash-Williams′ Lemma in Graph Reconstruction Theory

A generalization of Nash-Williams′ lemma is proved for the Structure of m-uniform null (m − k)-designs. It is then applied to various graph reconstruction problems. A short combinatorial proof of the edge reconstructibility of digraphs having regular underlying undirected graphs (e.g., tournaments) is given. A type of Nash-Williams′ lemma is conjectured for the vertex reconstruction problem.