Conformational spread as a mechanism for cooperativity in the bacterial flagellar switch

The bacterial flagellar switch that controls the direction of flagellar rotation during chemotaxis has a highly cooperative response. This has previously been understood in terms of the classic two-state, concerted model of allosteric regulation. Here, we used high-resolution optical microscopy to observe switching of single motors and uncover the stochastic multistate nature of the switch. Our observations are in detailed quantitative agreement with a recent general model of allosteric cooperativity that exhibits conformational spread—the stochastic growth and shrinkage of domains of adjacent subunits sharing a particular conformational state. We expect that conformational spread will be important in explaining cooperativity in other large signaling complexes

Learning about knowledge: A complex network approach

This article describes an approach to modeling knowledge acquisition in terms of walks along complex networks. Each subset of knowledge is represented as a node, and relations between such knowledge are expressed as edges. Two types of edges are considered, corresponding to free and conditional transitions. The latter case implies that a node can only be reached after visiting previously a set of nodes (the required conditions). The process of knowledge acquisition can then be simulated by considering the number of nodes visited as a single agent moves along the network, starting from its lowest layer. It is shown that hierarchical networks, i.e. networks composed of successive interconnected layers, arise naturally as a consequence of compositions of the prerequisite relationships between the nodes. In order to avoid deadlocks, i.e. unreachable nodes, the subnetwork in each layer is assumed to be a connected component. Several configurations of such hierarchical knowledge networks are simulated and the performance of the moving agent quantified in terms of the percentage of visited nodes after each movement. The Barab\'asi-Albert and random models are considered for the layer and interconnecting subnetworks. Although all subnetworks in each realization have the same number of nodes, several interconnectivities, defined by the average node degree of the interconnection networks, have been considered. Two visiting strategies are investigated: random choice among the existing edges and preferential choice to so far untracked edges. A series of interesting results are obtained, including the identification of a series of plateaux of knowledge stagnation in the case of the preferential movements strategy in presence of conditional edges.Comment: 18 pages, 19 figure

Asset Management in Volatile Markets

The 27th SUERF Colloquium in Munich in June 2008: New Trends in Asset Management: Exploring the Implications was already topical in the Summer of 2008. The subsequent dramatic events in the Autumn of 2008 made the presentations in Munich even more relevant to investors and bankers that want to understand what happens in their investment universe. In the present SUERF Study, we have collected a sample of outstanding colloquium contributions under the fitting headline: Asset Management in Volatile Markets.derivatives, financial innovation, asset management, finance-growth-nexus; Relative Value Strategy, Pair Trading, Slippage, Implementation Shortfall, Asset Management, Fin4Cast

Basic conceptual structures theory

Although the theory of Conceptual Structures is over 10 years old, basic notions (like canonical graphs) are far from settled and are subject to constant extensions and reformulations. However, most of these are done in an informal way, which doesn't help in clarifying the issues involved. It is our hope that this paper will provide a first step towards the complete and rigorous account of Conceptual Structures (CS) Theory, which is needed for ongoing standardization and implementation efforts. Towards that goal, we present formal definitions of some of the central notions of CS theory (type, referent, concept, relation, conceptual graph, canonical formation rules, canon, and canonical graph) in its simplest form, i.e. no contexts nor coreference links are allowed and referents must be individuals. We thereby introduce higher-order types in order to enable the use of conceptual graphs at the metalevel, the restriction operation of the canonical formation rules is extended to make use of the relation hierarchy, we show the relationship between denotation and conformity relation, and we give a rigorous meaning to the canonical basis, among other things

Knowledge formalization in experience feedback processes : an ontology-based approach

Because of the current trend of integration and interoperability of industrial systems, their size and complexity continue to grow making it more difficult to analyze, to understand and to solve the problems that happen in their organizations. Continuous improvement methodologies are powerful tools in order to understand and to solve problems, to control the effects of changes and finally to capitalize knowledge about changes and improvements. These tools involve suitably represent knowledge relating to the concerned system. Consequently, knowledge management (KM) is an increasingly important source of competitive advantage for organizations. Particularly, the capitalization and sharing of knowledge resulting from experience feedback are elements which play an essential role in the continuous improvement of industrial activities. In this paper, the contribution deals with semantic interoperability and relates to the structuring and the formalization of an experience feedback (EF) process aiming at transforming information or understanding gained by experience into explicit knowledge. The reuse of such knowledge has proved to have significant impact on achieving themissions of companies. However, the means of describing the knowledge objects of an experience generally remain informal. Based on an experience feedback process model and conceptual graphs, this paper takes domain ontology as a framework for the clarification of explicit knowledge and know-how, the aim of which is to get lessons learned descriptions that are significant, correct and applicable

Ex vivo detection and characterization of early dental caries by optical coherence tomography and Raman spectroscopy.

Early dental caries detection will facilitate implementation of nonsurgical methods for arresting caries progression and promoting tooth remineralization. We present a method that combines optical coherence tomography (OCT) and Raman spectroscopy to provide morphological information and biochemical specificity for detecting and characterizing incipient carious lesions found in extracted human teeth. OCT imaging of tooth samples demonstrated increased light backscattering intensity at sites of carious lesions as compared to the sound enamel. The observed lesion depth on an OCT image was approximately 290 mm matching those previously documented for incipient caries. Using Raman microspectroscopy and fiber-optic- based Raman spectroscopy to characterize the caries further, spectral changes were observed in PO 42 vibrations arising from hydroxyapa- tite of mineralized tooth tissue. Examination of various ratios of PO 42 n 2 , n 3 , n 4 vibrations against the n 1 vibration showed consistent in- creases in carious lesions compared to sound enamel. The changes were attributed to demineralization-induced alterations of enamel crystallite morphology and/or orientation. OCT imaging is useful for screening carious sites and determining lesion depth, with Raman spectroscopy providing biochemical confirmation of caries. The com- bination has potential for development into a new fiber-optic diagnos- tic tool enabling dentists to identify early caries lesions with greater sensitivity and specificity. © 2005 Society of Photo-Optical Instrumentation Engi

Glutathione-S-transferase subtypes α and π as a tool to predict and monitor graft failure or regeneration in a pilot study of living donor liver transplantation

<p>Abstract</p> <p>Objective</p> <p>Glutathione-S-Transferase (GST) subtype α and π are differentially expressed in adult liver tissue. Objective of the study was if GST α and p may serve as predictive markers for liver surgery, especially transplantations.</p> <p>Methods</p> <p>13 patients receiving living donor liver transplantation (LDLT) and their corresponding donors were analyzed for standard serum parameters (ALT, AST, gGT, bilirubin) as well as GST-α and -π before LDLT and daily for 10 days after LDLT. Patients (R) and donors (D) were grouped according to graft loss (R1/D1) or positive outcome (R2/D2) and above named serum parameters were compared between the groups.</p> <p>Results</p> <p>R1 showed significantly increased GST-α and significantly lower GST-π levels than R2 patients or the donors. There was a positive correlation between GST-α and ALT, AST as well as bilirubin and a negative correlation to γGT. However, γGT correlated positively with GST-π. Graft failure was associated with combined low GST-π levels in donors and their recipients before living donor liver transplantation.</p> <p>Conclusion</p> <p>Our data suggest that high GST-α serum levels reflect ongoing liver damage while GST-P indicates the capacity and process of liver regeneration. Additionally, GST-π may be useful as marker for optimizing donor and recipient pairs in living donor liver transplantation.</p

Representing First-Order Logic Using Graphs

Abstract. We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds to the negation of a set of existentials. The model is a direct generalisation of the negative application conditions used in graph rewriting, which count a single level of nesting and are thereby shown to correspond to the fragment ∃¬∃ of first-order logic. Vice versa, this generalisation may be used to strengthen the notion of application conditions. We then proceed to show how these nested models may be flattened to (sets of) plain graphs, by allowing some structure on the labels. The resulting formulae-as-graphs may form the basis of a unification of the theories of graph transformation and predicate transformation