Hierarchy Of Subsystems Research Articles

ГЕНЕЗИС ЛОГІСТИЧНОЇ СИСТЕМИ РЕКЛАМНОЇ КАМПАНІЇ В УМОВАХ ЦИФРОВОЇ ТРАНСФОРМАЦІЇ

The article is devoted to the characteristics of the features of the modern advertising campaign and its logistics system caused by the influence of digital transformation, the determination of the theoretical foundations of the formation of logistics systems in the conditions of digital transformation. This was reflected in the clarification of such concepts as advertising, advertising campaign, information logistics system. The theoretical foundations and the process of forming logistics systems of modern advertising campaigns in terms of expanding the concept of a logistics system, systematizing the hierarchy of subsystems of the logistics system of an advertising campaign have been studied. Special attention is paid to researching concepts and approaches to working with various types of information within the logistics system of an advertising campaign. It was established that in the conditions of digital transformation, an effective advertising campaign should be ensured by the implementation and use of various information systems and tools. The logistics system of the advertising campaign in this case integrates interrelated and interdependent cash and information flows.

Aromatic Fragmentation Based on a Ring Overlap Scheme: An Algorithm for Large Polycyclic Aromatic Hydrocarbons Using the Molecules-in-Molecules Fragmentation-Based Method

We present a novel and systematic fragmentation scheme to treat polycyclic aromatic hydrocarbons (PAHs) built off the molecules-in-molecules composite method. Our algorithm generates a set of biphenyl and naphthalene subsystems overlapping by whole sextet rings, ensuring all calculations are performed on aromatic molecules. Hence, our method is called Aromatic Fragmentation Based on a Ring Overlap Scheme (AroBOROS), and the generated fragments may be combined to form a hierarchy of subsystems to reduce errors for more complex PAHs. Errors are reduced to below chemical accuracy by combining subsystems that reflect the lowest energy structures determined by Clar's rule of aromatic sextets, and this is shown on two diverse test sets of PAHs ranging from 18 to 84 carbon atoms. Additionally, evaluations are performed for larger PAHs, as well as a nanotube fragment, containing up to 132 carbon atoms, and it is shown that good results may be achieved even with fragments representing an appreciably small portion of the full system.

Chrono::Vehicle: template-based ground vehicle modelling and simulation

Chrono::Vehicle is a module of the open-source multi-physics simulation package Chrono, aimed at modelling, simulation, and visualisation of wheeled and tracked ground vehicle multi-body systems. Its software architecture and design was dictated by the desire to provide an expeditious and user friendly mechanism for assembling complex vehicle models, while leveraging the underlying Chrono modelling and simulation capabilities, allowing seamless interfacing to other optional Chrono modules (e.g., its granular dynamics and fluid-solid interaction (FSI) capabilities), and providing a modular and expressive API to facilitate its use in third-party applications. Vehicle models are specified as a hierarchy of subsystems, each of which is an instantiation of a predefined subsystem template. Written in C++, Chrono::Vehicle is offered as a middleware library. In this paper, we provide an overview of the Chrono::Vehicle software design philosophy, its main capabilities and features, describe the types of ground vehicle mobility simulations it enables, and outline several directions of future development and planned extensions.

DEVELOPMENT OF A MODEL OF TECHNOLOGICAL SYSTEM OF SEMI-FINISHED PRODUCTS WITH EMULSION PASTE STRUCTURE

There was realized the analysis of modern methods of modification and correction of functional-technological properties of milk proteins for increasing the efficiency of their use in the technology of emulsion products. It was demonstrated, that it is prospective to use cheese-milk mixtures, based on decalcified milk raw materials at the expanse of the increased content of soluble protein. It was proved, that the use of decalcified milk raw materials results in raising the emulsifying power of systems and also in increasing indices of aggregative and kinetic stability. There was determined the aim of the study that is in elaborating a model of the technological system of semi-products with the emulsion paste structure. There was substantiated the expedience of using methods of system analysis at modeling the technological system of semi-products with the emulsion paste structure. There was designed the model of new products using the hierarchy of subsystems by levels. The aim of functioning of each separate subsystem was determined. Connections between separate elements of the system were assessed, internal and intersystem flows between them were analyzed. The influence of separate subsystems on formation of qualitative parameters of a final product was established. There were elaborated the way of forming the assortment of culinary and confectionary products based on semi-products with the emulsion paste structure. It was demonstrated, that depending on a fat content, new semi-products may be used in technologies of cold dishes and snacks, dessert products, hot dishes of sour milk cheese, confectionary products (especially, baked and dressing semi-products) and sauce group of products. Technological advantages of using developed semi-products were presented.

Witnessing matrix identities and proof complexity

We use results from the theory of algebras with polynomial identities (PI-algebras) to study the witness complexity of matrix identities. A matrix identity of [Formula: see text] matrices over a field [Formula: see text]is a non-commutative polynomial (f(x1, …, xn)) over [Formula: see text], such that [Formula: see text] vanishes on every [Formula: see text] matrix assignment to its variables. For every field [Formula: see text]of characteristic 0, every [Formula: see text] and every finite basis of [Formula: see text] matrix identities over [Formula: see text], we show there exists a family of matrix identities [Formula: see text], such that each [Formula: see text] has [Formula: see text] variables and requires at least [Formula: see text] many generators to generate, where the generators are substitution instances of elements from the basis. The lower bound argument uses fundamental results from PI-algebras together with a generalization of the arguments in [P. Hrubeš, How much commutativity is needed to prove polynomial identities? Electronic colloquium on computational complexity, ECCC, Report No.: TR11-088, June 2011].We apply this result in algebraic proof complexity, focusing on proof systems for polynomial identities (PI proofs) which operate with algebraic circuits and whose axioms are the polynomial-ring axioms [P. Hrubeš and I. Tzameret, The proof complexity of polynomial identities, in Proc. 24th Annual IEEE Conf. Computational Complexity, CCC 2009, 15–18 July 2009, Paris, France (2009), pp. 41–51; Short proofs for the determinant identities, SIAM J. Comput. 44(2) (2015) 340–383], and their subsystems. We identify a decrease in strength hierarchy of subsystems of PI proofs, in which the [Formula: see text]th level is a sound and complete proof system for proving [Formula: see text] matrix identities (over a given field). For each level [Formula: see text] in the hierarchy, we establish an [Formula: see text] lower bound on the number of proof-steps needed to prove certain identities.Finally, we present several concrete open problems about non-commutative algebraic circuits and speed-ups in proof complexity, whose solution would establish stronger size lower bounds on PI proofs of matrix identities, and beyond.

Transitions in System Analysis and Design Methodology

Systems Analysis and Design is an exciting endeavour as well as an active field in which analysts continually learn new techniques and approaches to develop systems more effectively and efficiently. Any organization that wants to have a long-lasting impact on its target market, must be ready to invest its resources in planning and research, to ascertain whether a new project is viable, partially viable or impracticable. This will either show the survival tendencies of the organization as it relates to the project or its weaknesses in handling the project. Every system development inadvertently follows four phases, which are: planning, analysis, design, and implementation. All complex systems can be decomposed into a nested hierarchy of subsystems because the different facets of every individual organization are either a system, part of a system or a subsystem. For an embodiment of various singular interconnected parts to be considered a system, it must have followed through with a methodology or an approach. This paper utilizes expository methodology and drives towards giving a concise overview of the various approaches to be adopted while developing a system. It begs to give more insight to the current methodologies in systems development, the emerging approaches and the pros and cons. The authors investigate from inception to the current methodologies, knowing full well that many occurrences in life happens in correspondence to dispensations, times and seasons; just like winter and summer, the authors understudy the various dispensations to pin the prevalent methodologies in certain time spaces, the advances or improvement as well as the advantages and disadvantages they have over others as time progresses. In the process, old systems methodologies are improved to serve a larger target and the amount of work needed per time reduces as new system methodology are developed over time.

Lumped models of the cardiovascular system of various complexity

PurposeThe main objective is to accelerate the mathematical modeling of complex systems and offer the researchers an accessible and standardized platform for model sharing and reusing. MethodsWe describe a methodology for creating mathematical lumped models, decomposing a system into basic components represented by elementary physical laws and relationships expressed as equations. Our approach is based on Modelica, an object-oriented, equation-based, visual, non-proprietary modeling language, together with Physiolibrary, an open-source library for the domain of physiology. ResultsWe demonstrate this methodology on an open implementation of a range of simple to complex cardiovascular models, with great complexity variance (simulation time from several seconds to hours). The parts of different complexity could be combined together. ConclusionsThanks to the equation-based nature of Modelica, a hierarchy of subsystems can be built with an appropriate connecting component. Such a structural model follows the concept of the system rather than the computational order. Such a model representation retains structural knowledge, which is important for e.g., model maintainability and reusability of the components and multidisciplinary cooperation with domain experts not familiar with modeling methods.

Assessment of the applicability of goal- and risk-based design on Arctic sea transport systems

This paper proposes a framework for holistic goal- and risk-based design (GBD/RBD) of arctic maritime transport systems (AMTS). In order to best utilize the principles of GBD/RBD, the framework treats an AMTS as a hierarchy of subsystems. Each subsystem performs a specific function and can be designed separately. As a result, it possible to apply GBD/RBD where appropriate and feasible, and to use other methods where not. In addition, the applied system thinking makes it possible to extend the boundaries of the design process beyond the individual ship, making it possible to consider the performance of an AMTS as a whole. In order to assess the stochastic performance of an AMTS, and to produce the operational data required for the design of its individual ships, the framework integrates simulations and probabilistic assessments into the design process. To further extend the applicability of the framework, a number of knowledge gaps (e.g. an incomplete understanding of the ship-ice interaction), data gaps (e.g. a lack of full-scale ice load measurements), and regulatory gaps (e.g. a lack of performance measures and criteria for some ship functions) need to be addressed.

Methodology for estimating promising development paradigm for mineral mining and processing industry

Based on the analysis of etymological hierarchy of subsystems inside a complicated system, the authors substantiate and put forward a definition of a subsoil development method structured based on the degree of complexity of the development. It is hypothesized on information analogy between patterns of substance flows in biological and geotechnological systems, and the procedure has been offered for quantification of integrated subsoil development in terms of correlating the substance of lithosphere that enters a technological level and that passes to the next one, based on homeostatic transformation of mechanisms of biological substance flow where informative elements are replaced for technological target analogues.

Implementation of the Kinetic Plasma Code with Locally Recursive non-Locally Asynchronous Algorithms

Numerical simulation is presently considered impractical for several relevant plasma kinetics problems due to limitations of computer hardware even with the use of supercomputers. To overcome the existing limitations it is suggested to develop algorithms which would effectively utilize the computer memory subsystem hierarchy to optimize the dependency graph traversal rules. The ideas for general cases of numerical simulation and implementation of such algorithms to particle-in-cell code is discussed in the paper. This approach enables the simulation of previously unaccessible for modeling problems and the execution of series of numerical experiments in reasonable time. The latter is demonstrated on a multiscale problem of the development of filamentation instability in laser interaction with overdense plasma. One variant of the simulation with parameters typical for simulations on supercomputers is performed with the use of one cluster node. The series of such experiments revealed the dependency of energy loss on incoming laser pulse amplitude to be nonmonotonic and reach over 4%, an interesting result for research of fast ignition concept.

Causal Groupoid Symmetries

Proposed here is a new framework for the analysis of complex systems as a non-explicitly programmed mathematical hierarchy of subsystems using only the fundamental principle of causality, the mathematics of groupoid symmetries, and a basic causal metric needed to support measurement in Physics. The complex system is described as a discrete set S of state variables. Causality is described by an acyclic partial order w on S, and is considered as a constraint on the set of allowed state transitions. Causal set (S, w) is the mathematical model of the system. The dynamics it describes is uncertain. Consequently, we focus on invariants, particularly group-theoretical block systems. The symmetry of S by itself is characterized by its symmetric group, which generates a trivial block system over S. The constraint of causality breaks this symmetry and degrades it to that of a groupoid, which may yield a non-trivial block system on S. In addition, partial order w determines a partial order for the blocks, and the set of blocks becomes a causal set with its own, smaller block system. Recursion yields a multilevel hierarchy of invariant blocks over S with the properties of a scale-free mathematical fractal. This is the invariant being sought. The finding hints at a deep connection between the principle of causality and a class of poorly understood phenomena characterized by the formation of hierarchies of patterns, such as emergence, selforganization, adaptation, intelligence, and semantics. The theory and a thought experiment are discussed and previous evidence is referenced. Several predictions in the human brain are confirmed with wide experimental bases. Applications are anticipated in many disciplines, including Biology, Neuroscience, Computation, Artificial Intelligence, and areas of Engineering such as system autonomy, robotics, systems integration, and image and voice recognition.

Reverse Mathematics and Algebraic Field Extensions

This paper analyzes theorems about algebraic field extensions using the techniques of reverse mathematics. In section §2, we show that WKL0 is equivalent to the ability to extend F-automorphisms of field extensions to automorphisms of F, the algebraic closure of F. Section §3 explores finitary conditions for embeddability. Normal and Galois extensions are discussed in section §4, and the Galois correspondence theorems for infinite field extensions are treated in section §5. Reverse mathematics is a foundational program in which mathematical theorems are analyzed using a hierarchy of subsystems of second order arithmetic. This paper uses three such subsystems. The base system RCA0 includes 0 -IND (induction for 0 formulas) and set comprehension for 0 definable subsets of N. The stronger system WKL0 appends K¨ onig's theorem restricted to binary trees (subtrees of 2 <N ). The even stronger system ACA0 adds comprehension for arithmetically definable subsets of N. For a detailed formulation of these subsystems and related analysis of many mathematical theorems, see Simpson's book (15). Reverse mathematics of countable algebra, including topics from group theory, ring theory, and field theory, can be found in the paper of Friedman, Simpson, and Smith (4, 5). Further discussion appears throughout Simpson's book (15). A field is a set of natural numbers with operations and constants satisfying the field axioms. Field embeddings and isomorphisms can be defined as sets of (codes for) ordered pairs of field elements. Polynomials can be encoded by finite strings of coefficients, so polynomial rings are sets of (codes for) finite strings, with related ring operations. For details pertaining to any of these definitions, see either of the references above. Our study of fields begins in the next section with the definition of an algebraic field extension. To simplify the exposition in sections §1 through §3, we restrict our discussion to characteristic 0 fields. Consequently, in these sections all irreducible polynomials are separable. We indicate how to extend results of earlier sections to fields of other characteristics in section §6.

Injecting Semantics into Diagnosis of Discrete-Event Systems

Most modern approaches to diagnosis of discrete- event systems (DESs) are syntax-oriented. DESs are modeled as networks of communicating automata, where each automaton defines both normal and faulty behavior of one component: the syntax of its regular language. Faulty behavior is associated with a subset of transitions (or events) of the automaton. An evolution of the system (conforming to the observation) is classified as faulty when it involves at least one of such faulty transitions (or events). Consequently, the nature of the system behavior (normal or faulty) strictly conforms to the nature of the behavior of its components. This paper claims that syntax- oriented diagnosis suffers from limited expressiveness when applied to complex DESs. Since a complex DES is topologically organized in a hierarchy of subsystems, different (possibly independent) abstraction levels of diagnosis are required. To overcome the limitations of syntax- oriented diagnosis, a new approach is proposed, based on semantics. A set of semantic rules is specified on a semantic domain (the set of subsystems relevant to diagnosis). Each rule defines the faulty behavior of a subsystem, possibly depending on the behavior of other subsystems. The diagnostic output is a set of candidate diagnoses, which account for the faults of every subsystem in the semantic domain.

Viscoplasticity of heterogeneous metallic materials

Viscoplastic behavior of metallic materials is manifested by collective behavior of lattice defects at multiple length scales. The full gamut of length scales, from atomic to macroscopic, is considered in terms of both concurrent and hierarchical multiscale modeling of plasticity of metals. Particular challenges are identified in the realm between atomistic simulations and the scale of dislocation substructure formation in establishing next generation constitutive models. Bottom–up modeling is useful in applications such as fracture or dislocation mediation by interfaces. This is differentiated from top–down modeling that supports design of a material as a hierarchy of sub-systems. Examples of hierarchical microstructure-sensitive models are presented for both Ni-base superalloys and α–β Ti alloys, with emphasis on cyclic deformation behavior. Future directions to advance both discrete dislocation and crystal plasticity theories are discussed, emphasizing the need for additional focus on dislocation sources and dislocation line curvature in modeling scale dependent behavior. Difficulties with low order approximations of the dislocation density distribution, such as second-order gradient theories, are discussed in terms of predictive capability and transferability among geometric configurations. The multiscale nature of the decomposition of the deformation gradient into elastic and plastic parts is discussed in light of sources of incompatibility at each scale considered, with interpretation offered at different scales of Burgers circuits that highlight dislocation substructures and polycrystals, respectively. Recent atomistic studies of dislocation nucleation at grain boundaries are outlined and some thoughts are offered towards potentially fruitful directions to incorporate this understanding into statistical continuum models that account for the role of grain boundary structure as an element of the evolving incompatibility field.

A note on subsystems of open induction

AbstractWe completely characterize the logical hierarchy of subsystems of open induction introduced by Boughattas [1].

Tools for the automation of large distributed control systems

The new LHC experiments at CERN will have very large numbers of channels to operate. In order to be able to configure and monitor such large systems, a high degree of parallelism is necessary. The control system is built as a hierarchy of sub-systems distributed over several computers. A toolkit-SMI++, combining two approaches: finite state machines and rule-based programming, allows for the description of the various sub-systems as decentralized deciding entities, reacting in real-time to changes in the system, thus providing for the automation of standard procedures and for the automatic recovery from error conditions in a hierarchical fashion. In this paper we will describe the principles and features of SMI++ as well as its integration with an industrial SCADA tool for use by the LHC experiments and we will try to show that such tools, can provide a very convenient mechanism for the automation of large scale, high complexity, applications.

Reengineering legacy systems for distributed environments

In the last decade, we have seen an increasing use of both the object-oriented paradigm and distributed systems. As a result, there is increasing interest in migrating and reengineering legacy systems to these new hardware technologies and software development paradigms. We define a reengineering environment that assists with the migration of legacy systems to distributed object environments. The reengineering environment includes the methodology and an integrated set of tools that support the implementation of the methodology. The methodology consists of multiple phases. First, we use reverse engineering techniques for program comprehension and design recovery. We then decompose the system into a hierarchy of subsystems by defining relationships between the entities of the underlying paradigm of the legacy system. The decomposition is driven by data mining, software metrics, and clustering techniques. Next, if the underlying paradigm of the legacy system is not object-based, we perform object-based adaptations on the subsystems. We then create components by wrapping objects and defining an interface. Finally, we allocate components to different sites by specifying the requirements of the system and characteristics of the network as an integer-programming model that minimizes the remote communication. We use middleware technologies for the implementation of the distributed object system.

5712237 Composition for cleaning textiles

Burnside Industrial Park encompasses an area of 1200 hectares with 1300 businesses and approximately 20 000 people in Dartmouth, Nova Scotia. Although never designed and constructed as a functioning ecosystem, the park contains many of the elements and characteristics of such a system, with diversity, resiliency, stability and integrity. Webs must be strengthened into nested hierarchies of subsystems guided by information functioning in positive and negative feedback systems. In ecological terms, a wider range of symbionts, metamorphs, polymorphs and hybrids must be established or developed. Support systems that will facilitate an ecosystem approach include an information network and clearing-house, a materials exchange network, environmental audit team, an educational program, an applied research program and a balance of regulatory and economic instruments.

Network languages for concurrent multiagent systems

This paper reports new results in the development of Linguistic Geometry towards concurrent multiagent aerospace systems. This formal theory is intended to discover the inner properties of human expert heuristics, which have been successful in a certain class of complex control systems, and apply them to different systems. The Linguistic Geometry relies on the formalization of search heuristics of the highly-skilled human experts, which allow for the decomposition of a complex system into a dynamic hierarchy of subsystems, and thus solve intractable problems by reducing the search dramatically. In this paper, we consider briefly the Linguistic Geometry tools and their application to multiagent systems represented 2D optimization problems for autonomous robotic vehicles in aerospace environment. First, we consider only serial motions, then we relax these constraints by allowing the cooperating agents move simultaneously if necessary while the motions of opposing agents alternate. Next we relax these constraints completely by allowing all the agents move simultaneously if necessary. A comparison of the searches for serial and concurrent cases shows that search reduction achieved in all types of problems with concurrent motions is even more dramatic than it was in the serial one.

Supporting pillars for industrial ecosystems

Burnside Industrial Park encompasses an area of 1200 hectares with 1300 businesses and approximately 20 000 people in Dartmouth, Nova Scotia. Although never designed and constructed as a functioning ecosystem, the park contains many of the elements and characteristics of such a system, with diversity, resiliency, stability and integrity. Webs must be strengthened into nested hierarchies of subsystems guided by information functioning in positive and negative feedback systems. In ecological terms, a wider range of symbionts, metamorphs, polymorphs and hybrids must be established or developed. Support systems that will facilitate an ecosystem approach include an information network and clearing-house, a materials exchange network, environmental audit team, an educational program, an applied research program and a balance of regulatory and economic instruments.