E. G. Gulinin ekumeeninen työ ja ajattelu

This study explores ecumenical activity of professor and bishop E. G. Gulin (1893 1975). Gulin was one of the key figures in the Finland s Evangelical Lutheran Church during the twentieth century. He was also one of the leading persons who imported ecumenical influences from abroad. However, unlike other churches, the Church of Finland did not recognise his importance. For example, in the 1950s Gulin was seen by the Anglicans as a future archbishop for the Evangelical Lutheran Church of Finland. Gulin s career as an ecumenist can be divided to three parts. Between 1917 and 1929, Gulin learned ecumenical working methods in Finland s World Student Christian Federation. He had a background in the revivalist movement, and his parents supported him in his studies. The Evangelical Lutheran Church did not originally play a major role for Gulin, although he was a member. Between 1930 and 1944, Gulin had more and more responsibility as a leading ecumenist in Finland. He became a member of Finland s ecumenical board, Yleiskirkollinen toimikunta. During the Second World War Gulin tried to solicit assistance for Finland s war effort at theological conferences, where Finnish theologians often discussed cooperation among Christians. A third period started in 1945, when Gulin became the bishop of Tampere. His new status in the Evangelical Lutheran Church placed him in a challenging position in ecumenical questions. He had responsibility for inter-church aid in Finland. He also participated in the World Council of Churches (WCC) assemblies in Evanston in 1954 and in New Delhi in 1961. Gulin s role was quite insignificant in those meetings. Closely related to Gulin s texts about ecumenism is kokemus, experience. Gulin wrote about his ecumenical experience or ekumeeninen kokemus. He believed that it was vital for the churches to appreciate their own experiences, since experience was the basis for further development. Yet Gulin mentioned very little about Christian dogma. The main reason seems to have been that he did not believe that a union between churches could be built on dogma.

Separation of sulfur-containing components of transfer ribonucleic acid on Bio-Gel P-2 and Sephadex G-10 columns

S-Labeled nucleosides of E. coli tRNA and some of the derivatives of thionucleosides were separated on Bio-Gel P-2 and Sephadex G-10 columns employing buffers of low salt concentration and high pH.

Popular Mixed Matchings

We study the problem of matching applicants to jobs under one-sided preferences: that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be rnore popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M,T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based oil the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distributions over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P,Q) >= phi(Q,P) for all mixed matchings Q. We show that popular mixed matchings always exist. and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem.

Acoustic emission source location in composite structure by Voronoi construction using geodesic curve evolution

Conventional analytical/numerical methods employing triangulation technique are suitable for locating acoustic emission (AE) source in a planar structure without structural discontinuities. But these methods cannot be extended to structures with complicated geometry, and, also, the problem gets compounded if the material of the structure is anisotropic warranting complex analytical velocity models. A geodesic approach using Voronoi construction is proposed in this work to locate the AE source in a composite structure. The approach is based on the fact that the wave takes minimum energy path to travel from the source to any other point in the connected domain. The geodesics are computed on the meshed surface of the structure using graph theory based on Dijkstra's algorithm. By propagating the waves in reverse virtually from these sensors along the geodesic path and by locating the first intersection point of these waves, one can get the AE source location. In this work, the geodesic approach is shown more suitable for a practicable source location solution in a composite structure with arbitrary surface containing finite discontinuities. Experiments have been conducted on composite plate specimens of simple and complex geometry to validate this method.

Using a glow graph to represent data flow and dependency in event logs

The idea of extracting knowledge in process mining is a descendant of data mining. Both mining disciplines emphasise data flow and relations among elements in the data. Unfortunately, challenges have been encountered when working with the data flow and relations. One of the challenges is that the representation of the data flow between a pair of elements or tasks is insufficiently simplified and formulated, as it considers only a one-to-one data flow relation. In this paper, we discuss how the effectiveness of knowledge representation can be extended in both disciplines. To this end, we introduce a new representation of the data flow and dependency formulation using a flow graph. The flow graph solves the issue of the insufficiency of presenting other relation types, such as many-to-one and one-to-many relations. As an experiment, a new evaluation framework is applied to the Teleclaim process in order to show how this method can provide us with more precise results when compared with other representations.

Synthesis and Evaluation of a Novel Class of G-Quadruplex-Stabilizing Small Molecules Based on the 1,3-Phenylene-Bis(piperazinyl benzimidazole) System

Achieving stabilization of telomeric DNA in G-quadruplex conformation by Various organic compounds has been an important goal for the medicinal chemists seeking to develop new anticancer agents. Several compounds are known to stabilize G-quadruplexes. However, relatively few are known to induce their formation and/or alter the topology, of the preformed quadruplex DNA. Herein, four compounds having the 1,3-phenylene-bis(piperazinyl benzimidazole) unit as a basic skeleton have been synthesized, and their interactions with the 24-mer telomeric DNA sequences from Tetrahymena thermophilia d(T(2)G(4))(4) have been investigated using high-resolution techniques Such as circular dichroism (CD) spectropolarimetry, CD melting, emission spectroscopy, and polyacrylamide gel electrophoresis. The data obtained, in the presence of one of three ions (Li+, Na+, or K+), indicate that all the new compounds have a high affinity for G-quadruplex DNA, and the strength of the binding with G-quadruplex depends on (1) phenyl ring substitution, (ii) the piperazinyl side chain, and (iii) the type of monovalent cation present in the buffer. Results further Suggest that these compounds are able to abet the conversion of the Intramolecular quadruplex into parallel stranded intermolecular G-quadruplex DNA. Notably, these compounds are also capable of inducing and stabilizing the parallel stranded quadruplex from randomly structured DNA in the absence of any stabilizing cation. The kinetics of the structural changes Induced by these compounds could be followed by recording the changes in the CD signal as a function of time. The implications of the findings mentioned above are discussed in this paper.

On the Structure of Contractible Edges in k-connected Partial k-trees

Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one of the end points of e is a neighbor of the new vertex. An edge in a k-connected graph is contractible if its contraction does not result in a graph with lesser connectivity; otherwise the edge is called non-contractible. In this paper, we present results on the structure of contractible edges in k-trees and k-connected partial k-trees. Firstly, we show that an edge e in a k-tree is contractible if and only if e belongs to exactly one (k + 1) clique. We use this characterization to show that the graph formed by contractible edges is a 2-connected graph. We also show that there are at least |V(G)| + k - 2 contractible edges in a k-tree. Secondly, we show that if an edge e in a partial k-tree is contractible then e is contractible in any k-tree which contains the partial k-tree as an edge subgraph. We also construct a class of contraction critical 2k-connected partial 2k-trees.

Acyclic edge coloring of subcubic graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and it is denoted by a′(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using five colors. This result is tight since there are 3-regular graphs which require five colors. In this paper we prove that any non-regular connected graph of maximum degree 3 is acyclically edge colorable using at most four colors. This result is tight since all edge maximal non-regular connected graphs of maximum degree 3 require four colors.

IL-10 in Human Newborns : Ontogeny of IL-10 secretion and relation to the secretion of IFN-g, immunoglobulin M, G, and A, and mononuclear cell composition in newborns

The purpose of this work was to elucidate the ontogeny of interleukin-10 (IL-10) secretion from newborn mononuclear cells (MCs), and to examine its relation to the secretion of interferon-g (IFN-g) and immunoglobulins (Igs). The initial hypothesis was that the decreased immunoglobulin (Ig) synthesis of newborn babies was the result of immature cytokine synthesis regulation, which would lead to excessive IL-10 production, leading in turn to suppressed IFN-g secretion. Altogether 57 full-term newborns and 34 adult volunteers were enrolled. Additionally, surface marker compositions of 29 premature babies were included. Enzyme-linked immunoassays were used to determine the amount of secreted IL-10, IFN-g, and Igs, and the surface marker composition of MC were analyzed with a FACScan flow cytometer. The three most important findings were: 1. Cord blood MC, including CD5+ B cells, are able to secrete IL-10. However, when compared with adults, the secretion of IL-10 was decreased. This indicates that reasons other than excessive IL-10 secretion are responsible of reduced IFN-g secretion in newborns. 2. As illustrated by the IL-10 and IFN-g secretion pattern, newborn cytokine profile was skewed towards the Th2 type. However, approximately 25% of newborns had an adult like cytokine profile with both good IL10 and IFN-g secretion, demonstrating that fullterm newborns are not an immunologically homogenous group at the time of birth. 3. There were significant differences in the surface marker composition of MCs between individual neonates. While gestational age correlated with the proportion of some MC types, it is evident that there are many other maternal and fetal factors that influence the maturity and nature of lymphocyte subpopulations in individual neonates. In conclusion, the reduced ability of neonates to secrete Ig and IFN-g is not a consequence of high IL-10 secretion. However, individual newborns differ significantly in their ability to secrete cytokines as well as Igs.

Analysis of the MAP/G(a,b)/1/N queue with multiple vacations

This paper deals with a batch service queue and multiple vacations. The system consists of a single server and a waiting room of finite capacity. Arrival of customers follows a Markovian arrival process (MAP). The server is unavailable for occasional intervals of time called vacations, and when it is available, customers are served in batches of maximum size ‘b’ with a minimum threshold value ‘a’. We obtain the queue length distributions at various epochs along with some key performance measures. Finally, some numerical results have been presented.

Bond graph model of doubly fed three phase induction motor using the Axis Rotator element for frame transformation

Induction motor is a typical member of a multi-domain, non-linear, high order dynamic system. For speed control a three phase induction motor is modelled as a d–q model where linearity is assumed and non-idealities are ignored. Approximation of the physical characteristic gives a simulated behaviour away from the natural behaviour. This paper proposes a bond graph model of an induction motor that can incorporate the non-linearities and non-idealities thereby resembling the physical system more closely. The model is validated by applying the linearity and idealities constraints which shows that the conventional ‘abc’ model is a special case of the proposed generalised model.

Heritability of the network architecture of intrinsic brain functional connectivity

The brain's functional network exhibits many features facilitating functional specialization, integration, and robustness to attack. Using graph theory to characterize brain networks, studies demonstrate their small-world, modular, and "rich-club" properties, with deviations reported in many common neuropathological conditions. Here we estimate the heritability of five widely used graph theoretical metrics (mean clustering coefficient (γ), modularity (Q), rich-club coefficient (ϕnorm), global efficiency (λ), small-worldness (σ)) over a range of connection densities (k=5-25%) in a large cohort of twins (N=592, 84 MZ and 89 DZ twin pairs, 246 single twins, age 23±2.5). We also considered the effects of global signal regression (GSR). We found that the graph metrics were moderately influenced by genetic factors h2 (γ=47-59%, Q=38-59%, ϕnorm=0-29%, λ=52-64%, σ=51-59%) at lower connection densities (≤15%), and when global signal regression was implemented, heritability estimates decreased substantially h2 (γ=0-26%, Q=0-28%, ϕnorm=0%, λ=23-30%, σ=0-27%). Distinct network features were phenotypically correlated (|r|=0.15-0.81), and γ, Q, and λ were found to be influenced by overlapping genetic factors. Our findings suggest that these metrics may be potential endophenotypes for psychiatric disease and suitable for genetic association studies, but that genetic effects must be interpreted with respect to methodological choices.

Disease burden due to Streptococcus dysgalactiae subsp equisimilis (group G and C streptococcus) is higher than that due to Streptococcus pyogenes among Mumbai school children

Streptococcus pyogenes [group A streptococcus (GAS)], a human pathogen, and Streptococcus dysgalactiae subsp. equisimilis [human group G and C streptococcus (GGS/GCS)] are evolutionarily related, share the same tissue niche in humans, exchange genetic material, share up to half of their virulence-associated genes and cause a similar spectrum of diseases. Yet, GGS/GCS is often considered as a commensal bacterium and its role in streptococcal disease burden is under-recognized. While reports of the recovery of GGS/GCS from normally sterile sites are increasing, studies describing GGS/GCS throat colonization rates relative to GAS in the same population are very few. This study was carried out in India where the burden of streptococcal diseases, including rheumatic fever and rheumatic heart disease, is high. As part of a surveillance study, throat swabs were taken from 1504 children attending 7 municipal schools in Mumbai, India, during 2006-2008. GAS and GGS/GCS were identified on the basis of beta-haemolytic activity, carbohydrate group and PYR test, and were subsequently typed. The GGS/GCS carriage rate (1166/1504, 11%) was eightfold higher than the GAS carriage (22/1504, 1.5%) rate in this population. The 166 GGS/GCS isolates collected represented 21 different emm types (molecular types), and the 22 GAS isolates represented 15 different emm types. Although the rate of pharyngitis associated with GGS/GCS is marginally lower than with GAS, high rates of throat colonization by GGS/GCS underscore its importance in the pathogenesis of pharyngitis.

d-Regular Graphs of Acyclic Chromatic Index at Least d+2

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Suclakov and Zaks (and earlier by Fiamcik) that a'(G) <= Delta+2, where Delta = Delta(G) denotes the maximum degree of the graph. Alon et al. also raised the question whether the complete graphs of even order are the only regular graphs which require Delta+2 colors to be acyclically edge colored. In this article, using a simple counting argument we observe not only that this is not true, but in fact all d-regular graphs with 2n vertices and d&gt;n, requires at least d+2 colors. We also show that a'(K-n,K-n) &gt;= n+2, when n is odd using a more non-trivial argument. (Here K-n,K-n denotes the complete bipartite graph with n vertices on each side.) This lower bound for Kn,n can be shown to be tight for some families of complete bipartite graphs and for small values of n. We also infer that for every d, n such that d &gt;= 5, n &gt;= 2d+3 and dn even, there exist d-regular graphs which require at least d+2-colors to be acyclically edge colored. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 63: 226-230, 2010.