Dynamic Complexity

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 156165 Experts worldwide ranked by ideXlab platform

Nabil Abu El Ata - One of the best experts on this subject based on the ideXlab platform.

  • Identifying the Cure for Dynamic Complexity: Improve, Transform or Disrupt?
    Leading from Under the Sword of Damocles, 2017
    Co-Authors: Nabil Abu El Ata, Annie Drucbert
    Abstract:

    In this chapter:Understanding how X-Act® OBC Platform supports a decision to cure the risk caused by Dynamic ComplexityExplaining disruption as a viable path for the treatment of riskReviewing areas of risks that may be best solved through disruptionWhy disruption is sometimes imposed by circumstances

  • Dynamic Complexity: The Cancer of Business
    Leading from Under the Sword of Damocles, 2017
    Co-Authors: Nabil Abu El Ata, Annie Drucbert
    Abstract:

    In this chapter:Understanding the impact of Dynamic Complexity through three-dimensional coordinates (volume, cost and quality)Why balancing business objectives versus architectural and infrastructure choices creates a dilemmaHow changing Dynamics can force disruption as a business imperative

  • The Predictive Estimation of Dynamic Complexity
    Leading from Under the Sword of Damocles, 2017
    Co-Authors: Nabil Abu El Ata, Annie Drucbert
    Abstract:

    In this chapter: Learning how metrics aide in the estimation and prediction of Dynamic Complexity Using X-Act ® OBC Platform metrics to measure risk exposure Sample cases that show the practical use of X-Act ® OBC Platform metrics

  • Identifying the Cure for Dynamic Complexity: Improve, Transform or Disrupt?
    Leading from Under the Sword of Damocles, 2017
    Co-Authors: Nabil Abu El Ata, Annie Drucbert
    Abstract:

    In this chapter:Understanding how X-Act® OBC Platform supports a decision to cure the risk caused by Dynamic ComplexityExplaining disruption as a viable path for the treatment of riskReviewing areas of risks that may be best solved through disruptionWhy disruption is sometimes imposed by circumstances

  • Understanding the Hidden Risk of Dynamic Complexity
    The Tyranny of Uncertainty, 2016
    Co-Authors: Nabil Abu El Ata, Rudolf Schmandt
    Abstract:

    Before we can effectively manage risk, we must have reliable methods to identify, assess, and prioritize risks. If we fail to identify a major source of risk, then all plans to minimize, monitor, and control the probability and/or impact of unfortunate events will likely fail. At some point, the unidentified risk will be exposed as a surprise and we will be forced to reactively manage the risk. Surprises like the 2007 economic crisis or Fukushima Daiichi nuclear disaster, which were caused by the unknown impacts of Dynamic Complexity, demonstrate the shortcomings of current risk management practices.

Thomas Schwentick - One of the best experts on this subject based on the ideXlab platform.

  • CSL - Dynamic Complexity Meets Parameterised Algorithms
    2020
    Co-Authors: Jonas Schmidt, Thomas Zeume, Thomas Schwentick, Nils Vortmeier, Ioannis Kokkinis
    Abstract:

    Dynamic Complexity studies the maintainability of queries with logical formulas in a setting where the underlying structure or database changes over time. Most often, these formulas are from first-order logic, giving rise to the Dynamic Complexity class DynFO. This paper investigates extensions of DynFO in the spirit of parameterised algorithms. In this setting structures come with a parameter k and the extensions allow additional "space" of size f(k) (in the form of an additional structure of this size) or additional time f(k) (in the form of iterations of formulas) or both. The resulting classes are compared with their non-Dynamic counterparts and other classes. The main part of the paper explores the applicability of methods for parameterised algorithms to this setting through case studies for various well-known parameterised problems.

  • Dynamic Complexity Meets Parameterised Algorithms
    arXiv: Logic in Computer Science, 2019
    Co-Authors: Jonas Schmidt, Thomas Zeume, Thomas Schwentick, Nils Vortmeier, Ioannis Kokkinis
    Abstract:

    Dynamic Complexity studies the maintainability of queries with logical formulas in a setting where the underlying structure or database changes over time. Most often, these formulas are from first-order logic, giving rise to the Dynamic Complexity class DynFO. This paper investigates extensions of DynFO in the spirit of parameterised algorithms. In this setting structures come with a parameter $k$ and the extensions allow additional "space" of size $f(k)$ (in the form of an additional structure of this size) or additional time $f(k)$ (in the form of iterations of formulas) or both. The resulting classes are compared with their non-Dynamic counterparts and other classes. The main part of the paper explores the applicability of methods for parameterised algorithms to this setting through case studies for various well-known parameterised problems.

  • Dynamic Complexity under Definable Changes
    arXiv: Logic in Computer Science, 2017
    Co-Authors: Thomas Schwentick, Nils Vortmeier, Thomas Zeume
    Abstract:

    This paper studies Dynamic Complexity under definable change operations in the DynFO framework by Patnaik and Immerman. It is shown that for changes definable by parameter-free first-order formulas, all (uniform) $AC^1$ queries can be maintained by first-order Dynamic programs. Furthermore, many maintenance results for single-tuple changes are extended to more powerful change operations: (1) The reachability query for undirected graphs is first-order maintainable under single tuple changes and first-order defined insertions, likewise the reachability query for directed acyclic graphs under quantifier-free insertions. (2) Context-free languages are first-order maintainable under $\Sigma_1$-defined changes. These results are complemented by several inexpressibility results, for example, that the reachability query cannot be maintained by quantifier-free programs under definable, quantifier-free deletions.

  • on the quantifier free Dynamic Complexity of reachability
    Information & Computation, 2015
    Co-Authors: Thomas Zeume, Thomas Schwentick
    Abstract:

    The Dynamic Complexity of the reachability query is studied in the Dynamic Complexity framework of Patnaik and Immerman, restricted to quantifier-free update formulas.It is shown that, with this restriction, the reachability query cannot be Dynamically maintained, neither with binary auxiliary relations nor with unary auxiliary functions, and that ternary auxiliary relations are more powerful with respect to graph queries than binary auxiliary relations.Further inexpressibility results are given for the reachability query in a different setting as well as for a syntactical restriction of quantifier-free update formulas. Moreover inexpressibility results for some other queries are presented.

  • on the quantifier free Dynamic Complexity of reachability
    Mathematical Foundations of Computer Science, 2013
    Co-Authors: Thomas Zeume, Thomas Schwentick
    Abstract:

    The Dynamic Complexity of the reachability query is studied in the Dynamic Complexity framework of Patnaik and Immerman, restricted to quantifier-free update formulas.

Chris J Bleakley - One of the best experts on this subject based on the ideXlab platform.

  • real time h 264 video encoding in software with fast mode decision and Dynamic Complexity control
    ACM Transactions on Multimedia Computing Communications and Applications, 2010
    Co-Authors: Yuri Ivanov, Chris J Bleakley
    Abstract:

    This article presents a novel real-time algorithm for reducing and Dynamically controlling the computational Complexity of an H.264 video encoder implemented in software. A fast mode decision algorithm, based on a Pareto-optimal macroblock classification scheme, is combined with a Dynamic Complexity control algorithm that adjusts the MB class decisions such that a constant frame rate is achieved. The average coding efficiency of the proposed algorithm was found to be similar to that of conventional encoding operating at half the frame rate. The proposed algorithm was found to provide lower average bitrate and distortion than static Complexity scaling.

  • Dynamic Complexity scaling for real time h 264 avc video encoding
    ACM Multimedia, 2007
    Co-Authors: Yuri Ivanov, Chris J Bleakley
    Abstract:

    The H.264 video encoding standard can achieve high coding efficiency at the expense of high computational Complexity. Typically, real-time software implementation requires omission of most optional encoding tools leading to significantly reduced coding efficiency. This paper proposes a novel method for real-time H.264 encoding based on Dynamic control of the encoding parameters to meet real-time constraints while minimizing coding efficiency loss. Experimental results show that the method provides up to 19% lower bit rate than conventional real-time encoding using fixed parameters with the same visual quality. The method allows real-time 30fps QCIF encoding on a Pentium IV with similar coding efficiency to full search baseline profile encoding.

Annie Drucbert - One of the best experts on this subject based on the ideXlab platform.

Andrei P Kirilyuk - One of the best experts on this subject based on the ideXlab platform.

  • Unreduced Complex Dynamics of Real Computer and Control Systems
    2015
    Co-Authors: Andrei P Kirilyuk
    Abstract:

    The unreduced Dynamic Complexity of modern computer, production, communication and control systems has become essential and cannot be efficiently simulated any more by traditional, basically regular models. We propose the universal concept of Dynamic Complexity and chaoticity of any real interaction process based on the unreduced solution of the many-body problem by the generalised effective potential method. We show then how the obtained mathematically exact novelties of system behaviour can be applied to the development of qualitatively new, complex-Dynamical kind of computer and control systems.

  • Extended Mathematics of Unreduced Dynamic Complexity: The Exact Image of Unified Reality, from the Electron to Consciousness
    2014
    Co-Authors: Andrei P Kirilyuk
    Abstract:

    The current crisis in exact description of fundamental and applied systems has the well-defined origin and rigorously substantiated resolution in the form of qualitatively extended, unified mathematical framework of unreduced Dynamic Complexity. It is based on the unreduced universal solution of arbitrary interaction problem revealing the new, extended qualities with respect to traditional mathematical constructions. We describe the origin of the problem, the proposed causally complete solution and its mathematical novelties confirmed by problem-solving applications in fundamental and applied sciences.

  • unreduced Dynamic Complexity towards the unified science of intelligent communication networks and software
    arXiv: General Physics, 2006
    Co-Authors: Andrei P Kirilyuk
    Abstract:

    Operation of autonomic communication networks with complicated user-oriented functions should be described as unreduced many-body interaction process. The latter gives rise to complex-Dynamic behaviour including fractally structured hierarchy of chaotically changing realisations. We recall the main results of the universal science of Complexity (physics/9806002) based on the unreduced interaction problem solution and its application to various real systems, from nanobiosystems (physics/0412097, physics/0502133) and quantum devices (physics/0211071) to intelligent networks (physics/0412058) and emerging consciousness (physics/0409140). We concentrate then on applications to autonomic communication leading to fundamentally substantiated, exact science of intelligent communication and software. It aims at unification of the whole diversity of complex information system behaviour, similar to the conventional, "Newtonian" science order for sequential, regular models of system Dynamics. Basic principles and first applications of the unified science of complex-Dynamic communication networks and software are outlined to demonstrate its advantages and emerging practical perspectives.

  • The Universal Dynamic Complexity as Extended Dynamic Fractality: Causally Complete Understanding of Living Systems Emergence and Operation
    2002
    Co-Authors: Andrei P Kirilyuk
    Abstract:

    The universal concept of Complexity by the Dynamic redundance paradigm and the ensuing concept of extended Dynamic fractality (physics/9806002) are applied here to higher levels of Complexity corresponding to living systems. After recalling the framework of unreduced Dynamic Complexity and Dynamically probabilistic fractality (see also physics/0211071), we concentrate on the novelties they propose for the case of living systems with respect to the conventional, Dynamically single-valued theory. The phenomenon of life can now be demystified and consistently understood as a particular case of the universal symmetry of Complexity realised by unreduced Complexity transformation from Dynamic information into (extended) entropy that preserves the total Complexity amount and involves its high enough levels. This intrinsically creative, and therefore realistic, version of bio-physical "reductionism" reveals the explicit, Dynamical source of adaptability and qualitatively new entity emergence and leads to essential, well substantiated changes in the strategy of research in such fields as evolution theory, genetics and medicine, allowing for the unique and efficient solution of the accumulated "difficult" problems.

  • New Concept of Dynamic Complexity in Quantum Mechanics and Beyond
    arXiv: Quantum Physics, 1998
    Co-Authors: Andrei P Kirilyuk
    Abstract:

    The qualitatively new concept of Dynamic Complexity in quantum mechanics is based on a new paradigm appearing within a nonperturbational analysis of the Schroedinger equation for a generic Hamiltonian system. The unreduced analysis explicitly provides the complete, consistent solution as a set of many incompatible components ('realisations') which should permanently and probabilistically replace one another, since each of them is 'complete' in the ordinary sense. This discovery leads to the universally applicable concept of Dynamic Complexity and self-consistent, realistic resolution of the stagnating problems of quantum chaos, quantum measurement, indeterminacy and wave reduction. The peculiar, 'mysterious' character of quantum behaviour itself is seen now as a result of a Dynamically complex, intrinsically multivalued behaviour of interacting fields at the corresponding lowest levels of the (now completely causal) structure of reality. Incorporating the results of the canonical theories as an over-simplified limiting case, this new approach urgently needs support, since its causality and completeness are directly extendible to arbitrary cases of complex behaviour of real systems, in sharp contrast to the dominating inefficient empiricism of 'computer experimentation' with primitive mechanistic (i. e. Dynamically single-valued) 'models' of the irreducibly multivalued reality.

Related terms

Dynamic Complexity - 15 days free trial to Access Experts & Abstracts