Nonlinear measures of heart rate time series: influence of posture and controlled breathing

In this study, we investigated measures of nonlinear dynamics and chaos theory in regards to heart rate variability in 27 normal control subjects in supine and standing postures, and 14 subjects in spontaneous and controlled breathing conditions. We examined minimum embedding dimension (MED), largest Lyapunov exponent (LLE) and measures of nonlinearity (NL) of heart rate time series. MED quantifies the system's complexity, LLE predictability and NL, a measure of deviation from linear processes. There was a significant decrease in complexity (P<0.00001), a decrease in predictability (P<0.00001) and an increase in nonlinearity (P=0.00001) during the change from supine to standing posture. Decrease in MED, and increases in NL score and LLE in standing posture appear to be partly due to an increase in sympathetic activity of the autonomous nervous system in standing posture. An improvement in predictability during controlled breathing appears to be due to the introduction of a periodic component. (C) 2000 published by Elsevier Science B.V.

Cooperative Replies to Unbelievable Assertions

We propose a dialogue protocol for situations in which an agent makes to another agent an assertion that the other agent finds impossible to believe. In this interaction, unbelievable assertions are rejected using explanations formed by logical interpolation and new assertions are being made such that all previous rebuttals are taken into account.

A series of metallic oxides of the formula La3LnBaCu5O13+δ (Ln = rare earth or Y)

Oxides of the formula La3LnBaCu5O13+δ (Ln = Nd, Sm, Gd, Dy, or Y) exhibiting metallic resistivity have been prepared and characterized. In the case of yttrium, a composition close to La2Y2BaCu5O13+δ, which is also metallic, could be prepared.

A series of transition metal-azido extended complexes with various anionic and neutral co-ligands: synthesis, structure and their distinct magnetic behavior

The crystal structures and magnetic properties of five new transition metal-azido complexes with two anionic [pyrazine-2-carboxylate (pyzc) and p-aminobenzoate (paba)] and two neutral [pyrazine (pyz) and pyridine (py)] coligands are reported All five complexes were synthesized bysolvothermal methods The complex [Co-2(pyzc)(2)(N-3)(2)(H2O)(2)](n) (1) is 1D and exhibit canted antiferromagnetism, while the 3D complex [MnNa(pyzc)(N-3)(2)(H2O)(2)](n) (2) has a complicated structure and is weakly ferromagnetic in nature [Mn-2(paba)(2)(N-3)(2)(H2O)(2)](n) (3). is a 2D sheet and the Mn-II ions are found to be antiferromagnetically coupled The isostructural 2D complexes [Cu-3(pyz)(2)(N-3)(6)](n) (4) and [Cu-3(py)(2)(N-3)(6)](n) (5) resemble remarkably in their magnetic properties exhibiting moderately strong ferromagnetism. Density functional theory calculations (B3LYP functional) have been performed to provide a qualitative theoretical interpietation of the overall magnetic behavior shown by these complexes.

Gauge Field Theories, Quantum Space-Time and Some Applications

In this thesis, the possibility of extending the Quantization Condition of Dirac for Magnetic Monopoles to noncommutative space-time is investigated. The three publications that this thesis is based on are all in direct link to this investigation. Noncommutative solitons have been found within certain noncommutative field theories, but it is not known whether they possesses only topological charge or also magnetic charge. This is a consequence of that the noncommutative topological charge need not coincide with the noncommutative magnetic charge, although they are equivalent in the commutative context. The aim of this work is to begin to fill this gap of knowledge. The method of investigation is perturbative and leaves open the question of whether a nonperturbative source for the magnetic monopole can be constructed, although some aspects of such a generalization are indicated. The main result is that while the noncommutative Aharonov-Bohm effect can be formulated in a gauge invariant way, the quantization condition of Dirac is not satisfied in the case of a perturbative source for the point-like magnetic monopole.

Neoarchean sanukitoid series in the Karelian Province, Finland

Sanukitoid series intrusions can be found throughout the Archean Karelian Province of the Fennoscandian shield. All sanukitoids share the same controversial elemental characteristics: they have high content of incompatible elements such as K, Ba, and Sr as well as high content of the compatible elements Mg, Cr, and Ni, and high Mg#. This composition is explained by an enriched mantle wedge origin in a Neoarchean subduction setting. This study concentrates on sanukitoid intrusions and tonalite-trondhjemite-granodiorite series (TTGs) from Finnish part of the Karelian Province. The collected rock samples have been studied in the field and under microscope as well as for their whole-rock (including isotopes) and mineral compositions. The new data together with previously published analyses help us to better understand the petrogenesis, tectonic setting and reworking of the Archean rock units. TTGs from the Karelian Province form a voluminous series of granitoids and reworked migmatites. This study divides TTG series into two subgroups based on their elemental composition: low-HREE (heavy rare earth element) TTGs and high-HREE TTGs indicating pressure differences in their source. Sanukitoid series is a minor, divergent group of intrusions. These intrusions are variable sized, and the texture varies from even-grained to K-feldspar porphyritic. The elemental composition differentiates sanukitoids from more voluminous TTG groups, the SiO2 in sanukitoids varies to include series of gabbro, diorite, and granodiorite. U Pb age determinations from sanukitoid series show temporally limited emplacement between ~ 2745 2715 Ma after the main crust forming period in the area. Hafnium, neodymium, common lead, and oxygene isotopes indicate well homogenized characteristics. Recycled crust has made a variable, yet minor, contribution to sanukitoids, as evidenced by oxygene isotopes and inherited zircon cores. A proposed tectonic setting for the formation of the sanukitoid series is slab breakoff of oceanic lithosphere in subduction setting, with sanukitoids deriving from an enriched mantle wedge. The proposed setting explains some of the peculiar features of sanukitoids, such as their temporally limited occurrence and controversial elemental composition. Sanukitoids would occur after cessation of the regional growth of Archean crust, and they could be derived from mantle wedge previously enriched by melts and fluids from oceanic crust and sediments. A subsequent event during the Paleoproterozoic Svecofennian orogeny at ~1.9 Ga affected the appearance and microstructures of the rocks as well as caused redistribution of lead between minerals and whole rock. However, the deformation was not able to obliterate the original geochemical characteristics of these sanukitoids.

Patterns in permuted binary matrices

Reorganizing a dataset so that its hidden structure can be observed is useful in any data analysis task. For example, detecting a regularity in a dataset helps us to interpret the data, compress the data, and explain the processes behind the data. We study datasets that come in the form of binary matrices (tables with 0s and 1s). Our goal is to develop automatic methods that bring out certain patterns by permuting the rows and columns. We concentrate on the following patterns in binary matrices: consecutive-ones (C1P), simultaneous consecutive-ones (SC1P), nestedness, k-nestedness, and bandedness. These patterns reflect specific types of interplay and variation between the rows and columns, such as continuity and hierarchies. Furthermore, their combinatorial properties are interlinked, which helps us to develop the theory of binary matrices and efficient algorithms. Indeed, we can detect all these patterns in a binary matrix efficiently, that is, in polynomial time in the size of the matrix. Since real-world datasets often contain noise and errors, we rarely witness perfect patterns. Therefore we also need to assess how far an input matrix is from a pattern: we count the number of flips (from 0s to 1s or vice versa) needed to bring out the perfect pattern in the matrix. Unfortunately, for most patterns it is an NP-complete problem to find the minimum distance to a matrix that has the perfect pattern, which means that the existence of a polynomial-time algorithm is unlikely. To find patterns in datasets with noise, we need methods that are noise-tolerant and work in practical time with large datasets. The theory of binary matrices gives rise to robust heuristics that have good performance with synthetic data and discover easily interpretable structures in real-world datasets: dialectical variation in the spoken Finnish language, division of European locations by the hierarchies found in mammal occurrences, and co-occuring groups in network data. In addition to determining the distance from a dataset to a pattern, we need to determine whether the pattern is significant or a mere occurrence of a random chance. To this end, we use significance testing: we deem a dataset significant if it appears exceptional when compared to datasets generated from a certain null hypothesis. After detecting a significant pattern in a dataset, it is up to domain experts to interpret the results in the terms of the application.

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.

A Hybrid Multilevel Inverter Topology for an Open-End Winding Induction-Motor Drive Using Two-Level Inverters in Series With a Capacitor-Fed H-Bridge Cell

In this paper, a new five-level inverter topology for open-end winding induction-motor (IM) drive is proposed. The open-end winding IM is fed from one end with a two-level inverter in series with a capacitor-fed H-bridge cell, while the other end is connected to a conventional two-level inverter. The combined inverter system produces voltage space-vector locations identical to that of a conventional five-level inverter. A total of 2744 space-vector combinations are distributed over 61 space-vector locations in the proposed scheme. With such a high number of switching state redundancies, it is possible to balance the H-bridge capacitor voltages under all operating conditions including overmodulation region. In addition to that, the proposed topology eliminates 18 clamping diodes having different voltage ratings compared with the neutral point clamped inverter. On the other hand, it requires only one capacitor bank per phase, whereas the flying-capacitor scheme for a five-level topology requires more than one capacitor bank per phase. The proposed inverter topology can be operated as a three-level inverter for full modulation range, in case of any switch failure in the capacitor-fed H-bridge cell. This will increase the reliability of the system. The proposed scheme is experimentally verified on a four-pole 5-hp IM drive.

A Hub System for Cloud-Computing Based Business-Collaboration: Automating Ontology-Enabled Electronic Business-Service Discovery

The management and coordination of business-process collaboration experiences changes because of globalization, specialization, and innovation. Service-oriented computing (SOC) is a means towards businessprocess automation and recently, many industry standards emerged to become part of the service-oriented architecture (SOA) stack. In a globalized world, organizations face new challenges for setting up and carrying out collaborations in semi-automating ecosystems for business services. For being efficient and effective, many companies express their services electronically in what we term business-process as a service (BPaaS). Companies then source BPaaS on the fly from third parties if they are not able to create all service-value inhouse because of reasons such as lack of reasoures, lack of know-how, cost- and time-reduction needs. Thus, a need emerges for BPaaS-HUBs that not only store service offers and requests together with information about their issuing organizations and assigned owners, but that also allow an evaluation of trust and reputation in an anonymized electronic service marketplace. In this paper, we analyze the requirements, design architecture and system behavior of such a BPaaS-HUB to enable a fast setup and enactment of business-process collaboration. Moving into a cloud-computing setting, the results of this paper allow system designers to quickly evaluate which services they need for instantiationg the BPaaS-HUB architecture. Furthermore, the results also show what the protocol of a backbone service bus is that allows a communication between services that implement the BPaaS-HUB. Finally, the paper analyzes where an instantiation must assign additional computing resources vor the avoidance of performance bottlenecks.