Complexity of classical dynamics of molecular systems. II. Finite statistical complexity of a water-Na+ system

The computational mechanics approach has been applied to the orientational behavior of water molecules in a molecular dynamics simulated water–Na + system. The distinctively different statistical complexity of water molecules in the bulk and in the first solvation shell of the ion is demonstrated. It is shown that the molecules undergo more complex orientational motion when surrounded by other water molecules compared to those constrained by the electric field of the ion. However the spatial coordinates of the oxygen atom shows the opposite complexity behavior in that complexity is higher for the solvation shell molecules. New information about the dynamics of water molecules in the solvation shell is provided that is additional to that given by traditional methods of analysis.

FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials

In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate that whereas F LQ runs on average faster (or quite faster) than LM Q, nonetheless the quality of the bounds computed by both is about the same; moreover, it was revealed that when VAS-CF is run on our benchmark polynomials using F LQ, LM Q and min(F LQ, LM Q) all three versions run equally well and, hence, it is inconclusive which one should be used in the VAS-CF method.

The Point of Continuity Property: Descriptive Complexity and Ordinal Index

∗ Supported by D.G.I.C.Y.T. Project No. PB93-1142

Enhancing the performance of intelligent control systems in the face of higher levels of complexity and uncertainty

Modern advances in technology have led to more complex manufacturing processes whose success centres on the ability to control these processes with a very high level of accuracy. Plant complexity inevitably leads to poor models that exhibit a high degree of parametric or functional uncertainty. The situation becomes even more complex if the plant to be controlled is characterised by a multivalued function or even if it exhibits a number of modes of behaviour during its operation. Since an intelligent controller is expected to operate and guarantee the best performance where complexity and uncertainty coexist and interact, control engineers and theorists have recently developed new control techniques under the framework of intelligent control to enhance the performance of the controller for more complex and uncertain plants. These techniques are based on incorporating model uncertainty. The newly developed control algorithms for incorporating model uncertainty are proven to give more accurate control results under uncertain conditions. In this paper, we survey some approaches that appear to be promising for enhancing the performance of intelligent control systems in the face of higher levels of complexity and uncertainty.

Quasi-Monte Carlo Methods for some Linear Algebra Problems. Convergence and Complexity

We present quasi-Monte Carlo analogs of Monte Carlo methods for some linear algebra problems: solving systems of linear equations, computing extreme eigenvalues, and matrix inversion. Reformulating the problems as solving integral equations with a special kernels and domains permits us to analyze the quasi-Monte Carlo methods with bounds from numerical integration. Standard Monte Carlo methods for integration provide a convergence rate of O(N^(−1/2)) using N samples. Quasi-Monte Carlo methods use quasirandom sequences with the resulting convergence rate for numerical integration as good as O((logN)^k)N^(−1)). We have shown theoretically and through numerical tests that the use of quasirandom sequences improves both the magnitude of the error and the convergence rate of the considered Monte Carlo methods. We also analyze the complexity of considered quasi-Monte Carlo algorithms and compare them to the complexity of the analogous Monte Carlo and deterministic algorithms.

On the Time Complexity of the Problem Related to Reducts of Consistent Decision Tables

In recent years, rough set approach computing issues concerning reducts of decision tables have attracted the attention of many researchers. In this paper, we present the time complexity of an algorithm computing reducts of decision tables by relational database approach. Let DS = (U, C ∪ {d}) be a consistent decision table, we say that A ⊆ C is a relative reduct of DS if A contains a reduct of DS. Let s = be a relation schema on the attribute set C ∪ {d}, we say that A ⊆ C is a relative minimal set of the attribute d if A contains a minimal set of d. Let Qd be the family of all relative reducts of DS, and Pd be the family of all relative minimal sets of the attribute d on s. We prove that the problem whether Qd ⊆ Pd is co-NP-complete. However, the problem whether Pd ⊆ Qd is in P .

A question of complexity:measuring the maturity of online enquiry communities

Online enquiry communities such as Question Answering (Q&A) websites allow people to seek answers to all kind of questions. With the growing popularity of such platforms, it is important for community managers to constantly monitor the performance of their communities. Although different metrics have been proposed for tracking the evolution of such communities, maturity, the process in which communities become more topic proficient over time, has been largely ignored despite its potential to help in identifying robust communities. In this paper, we interpret community maturity as the proportion of complex questions in a community at a given time. We use the Server Fault (SF) community, a Question Answering (Q&A) community of system administrators, as our case study and perform analysis on question complexity, the level of expertise required to answer a question. We show that question complexity depends on both the length of involvement and the level of contributions of the users who post questions within their community. We extract features relating to askers, answerers, questions and answers, and analyse which features are strongly correlated with question complexity. Although our findings highlight the difficulty of automatically identifying question complexity, we found that complexity is more influenced by both the topical focus and the length of community involvement of askers. Following the identification of question complexity, we define a measure of maturity and analyse the evolution of different topical communities. Our results show that different topical communities show different maturity patterns. Some communities show a high maturity at the beginning while others exhibit slow maturity rate. Copyright 2013 ACM.

Impact of reduced complexity inverse Volterra series transfer function-based nonlinear equalizer in coherent OFDM systems for next-generation core networks

A modern electronic nonlinearity equalizer (NLE) based on inverse Volterra series transfer function (IVSTF) with reduced complexity is applied on coherent optical orthogonal frequency-division multiplexing (CO-OFDM) signals for next-generation long- and ultra-long-haul applications. The OFDM inter-subcarrier crosstalk effects are explored thoroughly using the IVSTF-NLE and compared with the case of linear equalization (LE) for transmission distances of up to 7000 km. © 2013 IEEE.

Reconstructing institutional complexity in practice:a relational model of institutional work and complexity

This article develops a relational model of institutional work and complexity. This model advances current institutional debates on institutional complexity and institutional work in three ways. First, it provides a relational and dynamic perspective on institutional complexity by explaining how constellations of logics - and their degree of internal contradiction - are constructed rather than given. Second, it refines our current understanding of agency, intentionality and effort in institutional work by demonstrating how different dimensions of agency interact dynamically in the institutional work of reconstructing institutional complexity. Third, it situates institutional work in the everyday practice of individuals coping with the institutional complexities of their work. In doing so, it reconnects the construction of institutionally complex settings to the actions and interactions of the individuals who inhabit them. © The Author(s) 2013.

Motivations for servitization:the impact of product complexity

Purpose – The purpose of this paper is to identify the commonalities and differences in manufacturers’ motivations to servitise. Design/methodology/approach – UK study based on interviews with 40 managers in 25 companies in 12 sectors. Using the concept of product complexity, sectors were grouped using the Complex Products and Systems (CoPS) typology: non-complex products, complex products and systems. Findings – Motivations to servitise were categorised as competitive, demand based (i.e. derived from the customer) or economic. Motivations to servitise vary according to product complexity, although cost savings and improved service quality appear important demand-based motivations for all manufacturers. Non-complex product manufacturers also focus on services to help product differentiation. For CoPS manufacturers, both risk reduction and developing a new revenue stream were important motivations. For uniquely complex product manufacturers, stabilising revenue and increased profitability were strong motivations. For uniquely systems manufacturers, customers sought business transformation, whilst new service business models were also identified. Research limitations/implications – Using the CoPS typology, this study delineates motivations to servitise by sector. The findings show varying motivations to servitise as product complexity increases, although some motivational commonality existed across all groups. Manufacturers may have products of differing complexity within their portfolio. To overcome this limitation the unit of analysis was the strategic business unit. Practical implications – Managers can reflect on and benchmark their motivation for, and opportunities from, servitisation, by considering product complexity. Originality/value – The first study to categorise servitisation motivations by product complexity. Identifying that some customers of systems manufacturers seek business transformation through outsourcing.

Spatial ecological complexity measures in GRASS GIS

Good estimates of ecosystem complexity are essential for a number of ecological tasks: from biodiversity estimation, to forest structure variable retrieval, to feature extraction by edge detection and generation of multifractal surface as neutral models for e.g. feature change assessment. Hence, measuring ecological complexity over space becomes crucial in macroecology and geography. Many geospatial tools have been advocated in spatial ecology to estimate ecosystem complexity and its changes over space and time. Among these tools, free and open source options especially offer opportunities to guarantee the robustness of algorithms and reproducibility. In this paper we will summarize the most straightforward measures of spatial complexity available in the Free and Open Source Software GRASS GIS, relating them to key ecological patterns and processes.

Encouraging majority support for immigrant access to health services:multiple categorization and social identity complexity as antecedents of health equality

Health disparities between groups remain even after accounting for established causes such as structural and economic factors. The present research tested, for the first time, whether multiple social categorization processes can explain enhanced support for immigrant health (measured by respondents’ behavioral intention to support immigrants’ vaccination against A H1N1 disease by cutting regional public funds). Moreover, the mediating role of individualization and the moderating role of social identity complexity were tested. Findings showed that multiple versus single categorization of immigrants lead to support their right to health and confirmed the moderated mediation hypothesis. The potential in developing this sort of social cognitive intervention to address health disparities is discussed.

Multiple roles for executive control in belief-desire reasoning:distinct neural networks are recruited for self perspective inhibition and complexity of reasoning

Belief-desire reasoning is a core component of 'Theory of Mind' (ToM), which can be used to explain and predict the behaviour of agents. Neuroimaging studies reliably identify a network of brain regions comprising a 'standard' network for ToM, including temporoparietal junction and medial prefrontal cortex. Whilst considerable experimental evidence suggests that executive control (EC) may support a functioning ToM, co-ordination of neural systems for ToM and EC is poorly understood. We report here use of a novel task in which psychologically relevant ToM parameters (true versus false belief; approach versus avoidance desire) were manipulated orthogonally. The valence of these parameters not only modulated brain activity in the 'standard' ToM network but also in EC regions. Varying the valence of both beliefs and desires recruits anterior cingulate cortex, suggesting a shared inhibitory component associated with negatively valenced mental state concepts. Varying the valence of beliefs additionally draws on ventrolateral prefrontal cortex, reflecting the need to inhibit self perspective. These data provide the first evidence that separate functional and neural systems for EC may be recruited in the service of different aspects of ToM.

Institutional complexity in Thai state-owned enterprises:the implementation of performance measurement systems

This study explores institutional complexity in Thai State-Owned Enterprises (SOEs). In doing so, a qualitative approach has been employed in this study in order to identify institutional logics in the field of Thai SOEs and to understand organisational and individual perceptions of institutional complexity in the implementation of performance measurement systems (PMS) and how they respond to the complexity. To achieve this goal, two Thai SOEs were studied, both of which faced challenges in the implementation of Economic Value Management (EVM) and Balance Scorecard (BSC) as well as difficulties in linking their individual BSC and incentive systems. The qualitative data were collected from semi-structured interviews and document reviews. The empirical aspects of this study reveal that the institutional logics in the field of Thai SOEs are the logic of bureaucracy, commercial operations, social activities, seniority and unity. Regarding the multiple institutional logics embedded, SOEs experienced the institutional complexity in the implementation of PMS. The results suggest that the organisations have decoupled the EVM and loosely coupled the BSC from organisational practices to cope with institutional complexity and conflict institutional demands. Also, the evidence shows that the institutional logics influence SOEs’ actions towards resisting changes incentive systems and the relationship between individual BSC and incentives.