Generic Coordination Research Articles

On the Mortification of Novelistic Discourse inThree Novels

This paper argues for a specific labour of form in the so-called Trilogy, namely, the irreversible mortification of novelistic discourse. The great three-novel sequence is the literary space in which Beckett contrived to have done with his most dangerous temptations towards “life and invention”, in and around the generic tar-pits of the comic novel. With implacable resolve, the author laid out before him the generic coordinates – novelistic narration; novelistic description; novelistic characterization; and the novelistic calibration of ‘opinions’ – only to take each to the internal limit of its humanistic delusion. The result is a leave-taking with a difference: not the sudden supersession or heroic vanquishing of ‘novelism’, but its laborious mortification, in order to immunise the promise of some form to come against the lingering infections of a now undead genre. Beckett's path through the novel was immanent, subjecting it to a process of degradation and internal dissolution, rather than attacking it through satire or side-stepping it altogether. The new form toward which he was reaching could only be attained through this patient and systematic dismantlement of the novel form from within its own coordinates. Reviewing the accelerating and metastasizing immanent critique from novel to novel in the Trilogy, this essay demonstrates how remorseless and logical it was, and how the momentum it gained served an aesthetic ambition that was also a biographical purgation: never again would Beckett attempt a novel. From this point forward, prose was liberated to serve non-novelistic ends.

Configuration logics: Modeling architecture styles

We study a framework for the specification of architecture styles as families of architectures involving a common set of types of components and coordination mechanisms. The framework combines two logics: 1) interaction logics for the specification of architectures as generic coordination schemes involving a configuration of interactions between typed components; and 2) configuration logics for the specification of architecture styles as sets of interaction configurations. The presented results build on previous work on architecture modeling in BIP. We show how propositional interaction logic can be extended into a corresponding configuration logic by adding new operators on sets of interaction configurations. In addition to the usual set-theoretic operators, configuration logic is equipped with a coalescing operator + to express combination of configuration sets. We provide a complete axiomatization of propositional configuration logic as well as decision procedures for checking that an architecture satisfies given logical specifications. To allow genericity of specifications, we study first-order and second-order extensions of the propositional configuration logic. First-order logic formulas involve quantification over component variables. Second-order logic formulas involve additional quantification over sets of components. We provide several examples illustrating the application of the results to the characterization of various architecture styles. We also provide an experimental evaluation using the Maude rewriting system to implement the decision procedure for the propositional flavor of the logic.

Exact Solution of Laminated Orthogonal Hyperbolic Shells of Thermoelastic with Four Simply Supported

The exact solution of laminated Orthogonal Hyperbolic shell of thermoelastic composite is very important to investigate it’s the mechanical properties. Therefore, many studies were completed in this paper. Firstly, the non-homogeneous state equation in generic coordinates is derived for thermoelastic composites including thermal gradient relationships by the basic equations and state space method. Secondly, an augmented dimension constitutive relationship was obtained by combining thermal gradient relationships into constitutive relationships of composite constitutive relationships based on the theory of symplectic variable and precise time-integration with dimension expanding method. Lastly, uniting state space method and the augmented dimension constitutive relationships, a homogeneous state equation which can be solely solved was deduced by eliminating the stresses in plane. The homogeneous state equation can simplify greatly the solution process of the laminated Orthogonal Hyperbolic shell, improve the calculation accuracy. What’s more, it can be discrete straightly in finite element format. So, the homogeneous state equation, derived in the paper, can supply a new method for the exact solution of laminated structures with complicated boundary condition in practice.

New parametrization for spherically symmetric black holes in metric theories of gravity

We propose a new parametric framework to describe in generic metric theories of gravity the spacetime of spherically symmetric and slowly rotating black holes. In contrast to similar approaches proposed so far, we do not use a Taylor expansion in powers of M/r, where M and r are the mass of the black hole and a generic radial coordinate, respectively. Rather, we use a continued-fraction expansion in terms of a compactified radial coordinate. This choice leads to superior convergence properties and allows us to approximate a number of known metric theories with a much smaller set of coefficients. The measure of these coefficients via observations of near-horizon processes can be used to effectively constrain and compare arbitrary metric theories of gravity. Although our attention is here focussed on spherically symmetric black holes, we also discuss how our approach could be extended to rotating black holes.

Identification of slow molecular order parameters for Markov model construction

A goal in the kinetic characterization of a macromolecular system is the description of its slow relaxation processes via (i) identification of the structural changes involved in these processes and (ii) estimation of the rates or timescales at which these slow processes occur. Most of the approaches to this task, including Markov models, master-equation models, and kinetic network models, start by discretizing the high-dimensional state space and then characterize relaxation processes in terms of the eigenvectors and eigenvalues of a discrete transition matrix. The practical success of such an approach depends very much on the ability to finely discretize the slow order parameters. How can this task be achieved in a high-dimensional configuration space without relying on subjective guesses of the slow order parameters? In this paper, we use the variational principle of conformation dynamics to derive an optimal way of identifying the "slow subspace" of a large set of prior order parameters - either generic internal coordinates or a user-defined set of parameters. Using a variational formulation of conformational dynamics, it is shown that an existing method-the time-lagged independent component analysis-provides the optional solution to this problem. In addition, optimal indicators-order parameters indicating the progress of the slow transitions and thus may serve as reaction coordinates-are readily identified. We demonstrate that the slow subspace is well suited to construct accurate kinetic models of two sets of molecular dynamics simulations, the 6-residue fluorescent peptide MR121-GSGSW and the 30-residue intrinsically disordered peptide kinase inducible domain (KID). The identified optimal indicators reveal the structural changes associated with the slow processes of the molecular system under analysis.

Aspiration Learning in Coordination Games

We consider the problem of distributed convergence to efficient outcomes in coordination games through dynamics based on aspiration learning. Our first contribution is the characterization of the asymptotic behavior of the induced Markov chain of the iterated process in terms of an equivalent finite-state Markov chain. We then characterize explicitly the behavior of the proposed aspiration learning in a generalized version of coordination games, examples of which include network formation and common-pool games. In particular, we show that in generic coordination games the frequency at which an efficient action profile is played can be made arbitrarily large. Although convergence to efficient outcomes is desirable, in several coordination games, such as common-pool games, attainability of fair outcomes, i.e., sequences of plays at which players experience highly rewarding returns with the same frequency, might also be of special interest. To this end, we demonstrate through analysis and simulations that aspiration learning also establishes fair outcomes in all symmetric coordination games, including common-pool games.

Metaphorical Models for Limits to Growth and Industrialization

In this paper, I present two system dynamics models and simulators to explore sustainability and limits to growth in industrial society. I first describe a small model of the fishing industry. I then use the same model as a metaphor to think about global growth and industrialization and to interpret the closed‐loop feedback structure and dynamics of Jay Forrester's World Dynamics model. This famously concise (yet dynamically intricate) model represents an industrial society whose growth is eventually curtailed. My approach with both models is to investigate the feedback structure surrounding investment policy. Building on this material, I examine the value of metaphorical models for interpreting puzzling phenomena in business and society. Finally, I discuss generic coordination problems in managing the growth of firms, industries and society. Copyright © 2012 John Wiley & Sons, Ltd.

The degree complexity of smooth surfaces of codimension [formula omitted

For a given term order, the degree complexity of a projective scheme is defined by the maximal degree of the reduced Gröbner basis of its defining saturated ideal in generic coordinates (Bayer and Mumford, 1993). It is well known that the degree complexity with respect to the graded reverse lexicographic order is equal to the Castelnuovo–Mumford regularity (Bayer and Stillman, 1987). However, much less is known if one uses the graded lexicographic order (Ahn, 2008; Conca and Sidman, 2005).In this paper, we study the degree complexity of a smooth irreducible surface in P4 with respect to the graded lexicographic order and its geometric meaning. As in the case of a smooth curve (Ahn, 2008), we expect that this complexity is closely related to the invariants of the double curve of a surface under a generic projection. As results, we prove that except in a few cases, the degree complexity of a smooth surface S of degree d with h0(IS(2))≠0 in P4 is given by 2+(degY1(S)−12)−g(Y1(S)), where Y1(S) is a double curve of degree (d−12)−g(S∩H) under a generic projection of S. In particular, this complexity is actually obtained at the monomial x0x1x3(degY1(S)−12)−g(Y1(S)) where k[x0,x1,x2,x3,x4] is a polynomial ring defining P4. Exceptional cases are a rational normal scroll, a complete intersection surface of (2,2)-type, or a Castelnuovo surface of degree 5 in P4 whose degree complexities are in fact equal to their degrees. This complexity can also be expressed in terms of degrees of defining equations of IS in the same manner as the result of A. Conca and J. Sidman (Conca and Sidman, 2005). We also provide some illuminating examples of our results via calculations done withMacaulay 2 (Grayson and Stillman, 1997).

Calculation of capillary jet

AbstractThe Arbitrary Lagrangian Eulerian (ALE) framework coupled with some boundary tracking techniques is proven to be an effective method for simulation of free‐surface flows. In this paper, a special ALE framework is derived with clarification of three velocities, the notion of mesh‐frozen and field‐frozen, and the notion of tentatively inertial coordinates. A weighted integral ALE governing equations are formulated on generic coordinates and discretized with a finite element method and linear implicit time scheme. The system is solved with a discrete operator splitting technique and superposition‐based logistic parallelization. The formulation and implementation are verified through several fixed‐geometry problems and a reasonably good parallel performance is observed. Capillary jet flow is the main problem of the paper and the numerical techniques for boundary tracking are elaborated, which include an indirect boundary tracking of flux method and an iterative direct boundary tracking method. Also, a high‐order compact scheme for dynamic boundary condition and a squeeze technique for kinematic boundary condition are adopted. The axisymmetric jet breakup is studied in detail and numerical results match with the published data very well. Numerical accuracy and sensitivity are studied, including effects of element type, time scheme, compact scheme, and boundary tracking techniques. Copyright © 2010 John Wiley & Sons, Ltd.

A method to compute probability current in generic coordinates

A method to compute probability current and its surface integral, the total flux, for systems of many particles of different masses is presented, based on transforming the wave function and its gradient onto a mass-weighted coordinate system. As a test for this methodology, it has been applied to a nontrivial 6-dimensional quantum dynamics study of a model of the operation of the proton-wire in Green Fluorescent Protein [O. Vendrell, R. Gelabert, M. Moreno, and J. M. Lluch, J. Phys. Chem. B, 112, 5500-5511 (2008)]. An adaptive Monte Carlo method is proposed, with favorable scaling properties for future applications, to solve the flux integral. Comparison of total reactive flux with the time derivative of the survival probability is satisfactory, corroborating the adequacy of the derivation. Using the new method the flux can quantitatively be divided into its positive and negative contributions, or more relevantly, into tunneling and classical parts.

Separating Agent-Functioning and Inter-Agent Coordination by Activated Modules: The DECOMAS Architecture

The embedding of self-organizing inter-agent processes in distributed software applications enables the decentralized coordination system elements, solely based on concerted, localized interactions. The separation and encapsulation of the activities that are conceptually related to the coordination, is a crucial concern for systematic development practices in order to prepare the reuse and systematic integration of coordination processes in software systems. Here, we discuss a programming model that is based on the externalization of processes prescriptions and their embedding in Multi-Agent Systems (MAS). One fundamental design concern for a corresponding execution middleware is the minimal-invasive augmentation of the activities that affect coordination. This design challenge is approached by the activation of agent modules. Modules are converted to software elements that reason about and modify their host agent. We discuss and formalize this extension within the context of a generic coordination architecture and exemplify the proposed programming model with the decentralized management of (web) service infrastructures.

A specification language for problem partitioning in decomposition-based design optimization

Decomposition-based design optimization consists of two steps: partitioning of a system design problem into a number of subproblems, and coordination of the design of the decomposed system. Although several generic frameworks for coordination method implementation are available (the second step), generic approaches for specification of the partitioned problem (the first step) are rare. Available specification methods are often based on matrix or graph representations of the entire system. For larger systems these representations become intractable due to the large number of design variables and functions. This article presents a new linguistic approach for specification of partitioned problems in decomposition-based design optimization. With the elements of the proposed specification language, called ? (the Greek letter "Psi"), a designer can define subproblems, and assemble these into larger systems in a bottom-up fashion. The assembly process allows the system designer to control the complexity and tractability of the problem partitioning task. To facilitate coupling to generic coordination frameworks, a compiler has been developed for ? that generates an interchange file in the INI format. This INI-definition of the partitioned problem can easily be interpreted by programs written in other languages. The flexibility provided by the ? language and the automated generation of input files for computational frameworks is demonstrated on a vehicle chassis design problem. The developed tools, including user manuals and examples, are made publicly available.

Strong Nœther Position and Stabilized Regularities

In this article, we introduce the notion of a homogeneous ideal in strong Nœther position (SNP); a new definition for the notion of generic coordinates for some problems. This definition is simple to check, because it can be tested on the initial ideal for the degree reverse lexicographic ordering. It is explicit, because we provide an algorithm to decide whether a monomial ideal is in SNP or not. To any notion of regularity of an ideal (Castelnuovo–Mumford regularity, satiety, maximal degree of the elements of the reduced Gröbner basis with respect to the degree reverse lexicographic ordering, and Hilbert regularity), we associate a stabilized regularity. The main result of this article is that SNP shows simply and explicitly the relationships between these regularities.

On the Concept of Service Coordination

In this research report we study service coordination, which is a crucial aspect when services are combined into service-based systems (Metzger & Pohl, 2009).Coordination is not only in computer science an important research topic. It is also studied in disciplines such as organization theory, operations research, economics, linguistics, and psychology. Malone & Crowston (1994) studied the similarities and connections between the different flavors of coordination and created a more generic coordination theory. They define coordination as managing dependencies between activities. This definition is based on the intuitive idea that there is nothing to coordinate without any interdependence. In their work they state that coordination theories should try to characterize different kinds of dependencies and identify the coordination processes that can be used to manage them. Therefore, in the next section (see Section 2), we will discuss several types of dependencies that can exist when composing services to service-based systems. In the rest of this research report is targeted at two types of dependencies, namely sequence dependencies and data dependencies. Therefore, the research continues in Sections 3 and 4 with an overview of existing techniques for managing sequence and data dependencies, respectively. In each section there is also a general conclusion included.

Equilibrium tracing in strategic-form games

We analyze the relationships of the van den Elzen–Talman algorithm, the Lemke–Howson algorithm and the global Newton method for equilibrium computation by Govindan and Wilson. For two-player games, all three can be implemented as complementary pivoting algorithms. The algorithms by Lemke and Howson and by van den Elzen and Talman start at a pair of strategies: the first method at a pure strategy and its best reply, the latter anywhere in the strategy space. However, we show that even with the same starting point they may find different equilibria. Our second result is that the van den Elzen–Talman algorithm is a special case of the global Newton method, which was known only for the Lemke–Howson algorithm. More generally, the global Newton method implements the linear tracing procedure for any number of players. All three algorithms find generically only equilibria of positive index. Even though the van den Elzen–Talman algorithm is extremely flexible in the choice of starting point, we show that there are generic coordination games where the completely mixed equilibrium, which has positive index, is generically not found by the algorithm.

Modeling Per-Flow Throughput and Capturing Starvation in CSMA Multi-Hop Wireless Networks

Multi-hop wireless networks employing random access protocols have been shown to incur large discrepancies in the throughputs achieved by the flows sharing the network. Indeed, flow throughputs can span orders of magnitude from near starvation to many times greater than the mean. In this paper, we address the foundations of this disparity. We show that the fundamental cause is not merely differences in the number of contending neighbors, but a generic coordination problem of CSMA-based random access in a multi-hop environment. We develop a new analytical model that incorporates this lack of coordination, identifies dominating and starving flows and accurately predicts per-flow throughput in a large-scale network. We then propose metrics that quantify throughput imbalances due to the MAC protocol operation. Our model and metrics provide a deeper understanding of the behavior of CSMA protocols in arbitrary topologies and can aid the design of effective protocol solutions to the starvation problem.

Calculation of the potential of mean force from nonequilibrium measurements via maximum likelihood estimators

We present an approach to the estimate of the potential of mean force along a generic reaction coordinate based on maximum likelihood methods and path-ensemble averages in systems driven far from equilibrium. Following similar arguments, various free energy estimators can be recovered, all providing comparable computational accuracy. The method, applied to the unfolding process of the alpha -helix form of an alanine decapeptide, gives results in good agreement with thermodynamic integration.

The degree-complexity of the defining ideal of a smooth integral curve

Let I be the defining ideal of a non-degenerate smooth integral curve of degree d and of genus g in P n where n ≥ 3 . The degree-complexity of I with respect to a term order τ is the maximum degree in a reduced Gröbner basis of I , and is exactly the highest degree of a minimal generator of in τ ( I ) . For the degree lexicographic order, we show that the degree-complexity of I in generic coordinates is 1 + ( d − 1 2 ) − g with the exception of two cases: (1) a rational normal curve in P 3 and (2) an elliptic curve of degree 4 in P 3 , where the degree-complexities are 3 and 4 respectively. Additionally if X ⊂ P n is a non-degenerate integral scheme then we show that, for the degree lexicographic order, the degree-complexity of X in generic coordinates is not changed by an isomorphic projection of X from a general point.

On an extension of Galligo's theorem concerning the Borel-fixed points on the Hilbert scheme

Given an ideal I and a weight vector w which partially orders monomials we can consider the initial ideal in w ( I ) which has the same Hilbert function. A well known construction carries this out via a one-parameter subgroup of a GL n + 1 which can then be viewed as a curve on the corresponding Hilbert scheme. Galligo [A. Galligo, Théorème de division et stabilité en géométrie analytique locale, Ann. Inst. Fourier (Grenoble) 29 (2) (1979) 107–184, vii] proved that if I is in generic coordinates, and if w induces a monomial order up to a large enough degree, then in w ( I ) is fixed by the action of the Borel subgroup of upper-triangular matrices. We prove that the direction the path approaches this Borel-fixed point on the Hilbert scheme is also Borel-fixed.

Nondegenerate superintegrable systems in n-dimensional Euclidean spaces

We analyze the concept of a nondegenerate superintegrable system in n-dimensional Euclidean space. Attached to this idea is the notion that every such system affords a separation of variables in one of the various types of generic elliptical coordinates that are possible in complex Euclidean space. An analysis of how these coordinates are arrived at in terms of their expression in terms of Cartesian coordinates is presented in detail. The use of well-defined limiting processes illustrates just how all these systems can be obtained from the most general nondegenerate superintegrable system in n-dimensional Euclidean space. Two examples help with the understanding of how the general results are obtained.