Composition Specificity Research Articles

Bottom-up hierarchical and categorical metacomputing for automating composition and deployment of directly computable multiphysics models

The present paper describes a proposed solution for reducing the complexity and time required by experienced users of legacy codes for solving multiphysics problems. A bottom-up hierarchical specification-driven metacomputing framework was developed to automate the composition and deployment of necessary resources, and the generation of all necessary code, files, and parameter selections required for solving multiphysics problems. Utilization of the framework amounts to the generation of directly computable multiphysics models. The user’s role is reduced to providing (through a graphical user interface) the specification of the problem and its associated physics every time a new problem arises, while the rest of the resources are specified once at the beginning of the process. The proposed approach requires enabling and implementing transformation and composition of specifications describing seemingly heterogeneous entities such as problem (physics, boundary and initial conditions) and computational resources specifications. This is achieved by the utilization of Category Theory constructs and software that can implement them. This framework features a graphical user interface for capturing physics problem specifications at the meta-meta level, generating runtime scripts and input files for problem solving, and capturing problem specifications intuitively. Finally, the framework is demonstrated with its application to a conjugate heat transfer challenge problem associated with an aerobraking structure under hypersonic conditions.

An Automatic Generation and Verification Method of Software Requirements Specification

The generation of standardized requirements specification documents plays a crucial role in software processes. However, the manual composition of software requirements specifications is a laborious and time-consuming task, often leading to errors that deviate from the actual requirements. To address this issue, this paper proposes an automated method for generating requirements specifications utilizing a knowledge graph and graphviz. Furthermore, in order to overcome the limitations of the existing automated requirement generation process, such as inadequate emphasis on data information and evaluation, we enhance the traditional U/C matrix by introducing an S/U/C matrix. This novel matrix represents the outcomes of data/function systematic analysis, and verification is facilitated through the design of inspection rules. Experimental results demonstrate that the requirements specifications generated using this method achieve standardization and adherence to regulations, while the devised S/U/C inspection rules facilitate the updating and iteration of the requirements specifications.

Bringing runtime verification home: a case study on the hierarchical monitoring of smart homes using decentralized specifications

We use runtime verification (RV) to check various specifications in a smart apartment. The specifications can be broken down into three types: behavioral correctness of the apartment sensors, detection of specific user activities (known as activities of daily living), and composition of specifications of the previous types. The context of the smart apartment provides us with a complex system with a large number of components with two different hierarchies to group specifications and sensors: geographically within the same room, floor or globally in the apartment, and logically following the different types of specifications. We leverage a recent approach to decentralized RV of decentralized specifications, where monitors have their own specifications and communicate together to verify more general specifications. We leverage the hierarchies, modularity and re-use afforded by decentralized specifications to: (1) scale beyond existing centralized RV techniques, and (2) greatly reduce computation and communication costs.

Prediction of indicators of cow diet composition and authentication of feeding specifications of Protected Designation of Origin cheese using mid-infrared spectroscopy on milk

The ability of mid-infrared spectroscopy (MIR) to predict indicators (1) of diet composition in dairy herds and (2) for the authentication of the cow feeding restrictions included in the specification of 2 Protected Designation of Origin (PDO) cheeses (Cantal and Laguiole) was tested on 7,607 bulk milk spectra from 1,355 farms located in the Massif Central area of France. For each milk sample, the corresponding cow diet composition data were obtained through on-farm surveys. The cow diet compositions varied largely (i.e., from full grazing for extensive farming systems to corn silage-based diets, which are typical of more intensive farming systems). Partial least square regression and discriminant analysis were used to predict the proportion of different feedstuffs in the cows' diets and to authenticate the cow feeding restrictions for the PDO cheese specifications, respectively. The groups for the discriminant analysis were created by dividing the data set according to the threshold of a specific feedstuff. They were issued based on the specifications of the restriction of the PDO cheese. The pasture proportion in the cows' diets was predicted by MIR with an coefficient of determination in external validation (R2V) = 0.81 and a standard error of prediction of 11.7% dry matter. Pasture + hay, corn silage, conserved herbage, fermented forage, and total herbage proportion in the cows' diets were predicted with a R2V >0.61 and a standard error of prediction <14.8. The discrimination models for pasture presence, pasture ≥50%, and pasture ≥57% in the cows' diets achieved an accuracy and specificity ≥90%. A sensitivity and precision ≥85% were also observed for the pasture proportion discrimination models, but both of these indexes decreased at increasing thresholds from 0 to 50, and 57% pasture in the cows' diets. An accuracy ≥80% was also observed for pasture + hay ≥72%, herbage ≥50%, pasture + hay ≥25%, absence of fermented herbage, absence of corn silage, and corn silage ≤30% in the cows' diets, but for several models, either the sensitivity or precision was lower than the accuracy. Models built on the simultaneous respect of all the criteria of the feeding restrictions of PDO cheese specifications achieved an accuracy, specificity, sensitivity, and precision >90%. Both the regression and discriminant MIR models for bulk milk can provide useful indicators of cow diet composition and PDO cheese specifications to producers and consumers (farmers, dairy plants).

Feature-oriented contract composition

A software product line comprises a set of products that share a common code base, but vary in specific characteristics called features. Ideally, features of a product line are developed in isolation and composed subsequently. Product lines are increasingly used for safety–critical software, for which quality assurance becomes indispensable. While the verification of product lines gained considerable interest in research over the last decade, the subject of how to specify product lines is only covered rudimentarily. A challenge to overcome is composition; similar to inheritance in object-oriented programming, features of a product line may refine other features along with their specifications. To investigate how refinement and composition of specifications can be established, we derive a notion of feature-oriented contracts comprising preconditions, postconditions, and framing conditions of a method. We discuss six mechanisms to perform contract composition between original and refining contracts. Moreover, we identify and discuss desired properties for contract composition and evaluate which properties are established by which mechanism. Our three main insights are that (a) contract refinement is seldom but crucial, (b) the Liskov principle does not apply to features, and (c) it is sufficient to accommodate techniques from object-orientation in the contract-composition mechanisms for handling frame refinements.

Performance of warm mix asphalt with Buton natural asphalt-rubber and zeolite as an additives

The aim of this research is improving of asphalt industry to decrease the fuel consumption by lowering the temperature of mixing and compacting of asphalt mixture. This technology known as Warm Mix Asphalt (WMA). Buton Natural Asphalt Rubber (BNA-R) as a function of the additive has been able to improve the performance of HMA. Zeolit has a function as an additive to lowering the mixing temperature. Aggregate composition using the composition of aggregate grading specifications for airport pavement, with the composition of BNA-R 5% and 10% and Zeolite content of 2%. The mixture have produced Resilient Modulus value by using the Universal Material Testing Apparatus (UMATTA) on optimum bitumen content each of which has been obtained from the Marshall test. Furthermore, the value of permanent deformation of asphalt mixtures tested using Wheel Tracking Machine (WTM). The result shows that BNA-R modified binder for WMA can decrease the rutting potential. The additive of local materials has improved the performance of the WMA for airport pavement with certain restrictions. From this research it is known there have been changes in the characteristics of resilient modulus and permanent deformation due to the addition of BNA-R for type of aggregate composition.

PROTEIN-VITAMIN-MINERAL AND CONCENTRATES PASTE NO SOY SUBRODUKTOVOGO AND RAW MATERIALS FOR FOOD MILITARY CONTINGENT IN ARCTIC CONDITIONS

The aim is to study the methods of obtaining protein-vitamin-mineral pastes and concentrates, soy and subproduktovogo raw materials. The scientific novelty of this work is to develop production technology of protein-vitamin-mineral concentrates, pastes and functional orientation, to enrich the first and second dishes, sauces. A comparative characteristic of the chemical composition of offal relevant technical specifications, which are currently in production, and new products developed by the authors. The classification of methods for producing functional orientation concentrates on the basis of soy protein.

Characterisation of titanium-rich heavy mineral concentrates from the Brahmaputra River basin, Bangladesh

The Brahmaputra River of Bangladesh is a potential source of significant amounts of heavy mineral (HM) sand concentrates. This study provides the first ever reported characterisation data for a bulk titanium-rich HM sand sample sourced from the river system. The prepared concentrate contained ∼10–15 wt-% HMs with the remaining 85–90 wt-% of the sample comprising silicate and aluminosilicates. Modal analysis for the Fe- and Ti-rich components indicated that the HM concentrate contained 4·7% primary ilmenite, 4·4% Fe-oxide (magnetite), 0·91% titanomagnetite, 0·94% titanite and 0·08% rutile. Quantitative analysis of the ilmenite component showed the TiO2 content of the ilmenite was within the range 40–52 wt-%TiO2 (average ∼48 wt-%TiO2) with major impurities including MnO (1·83 wt-%) and MgO (0·20 wt-%) and minor impurities being Al2O3 (0·02 wt-%), Cr2O3 (0·03 wt-%), SiO2 (0·08 wt-%) and V2O5 (0·08 wt-%). Based on the composition of ilmenite and current specifications regarding ilmenite compositional purity, the most likely method for processing would be via the sulphate route.

Agreement between conformance and composition

In our previous paper [1], a new model of a Labeled Transition System (LTS)-type implementation was proposed. In ordinary LTSs, transitions are labeled by actions; therefore, they can be called LTSs of actions. The new model is an LTS of observations; in this model, observations and test actions (buttons) are used instead of actions. This model generalizes many testing semantics that are based on the LTS of actions but use additional observations (refusals, ready sets, etc.). Moreover, systems with priority, which are not described by the LTS of actions, are simulated uniformly. In the present paper, we develop this approach by focusing on the composition of systems. The point is that, on observation traces, one cannot define a composition with respect to which a composition of LTSs would possess the property of additivity: the set of traces of a composition of LTSs coincides with the set of all pairwise compositions of traces of LTS operands. This is explained by the fact that an observation in a composition state is not calculated based on observations in states-operands. In this paper, we propose an approach that eliminates this drawback. To this end, we label the transitions of LTSs by symbols (events) that, on the one hand, can be composed to guarantee the property of additivity, and, on the other hand, can be used to generate observations under testing: a transition by an event gives rise to an observation related to this event. This model is called an LTS of events. In this paper, we define (1) a transformation of an LTS of events into an LTS of observations to conform with the principles of our previous paper [1]; (2) a composition of LTSs of events; (3) a composition of specifications that preserves conformance: a composition of conformal implementations is conformal to a composition of specifications; and (4) a uniform simulation of LTSs of actions in terms of the LTSs of events, which allows one to consider an implementation in any interaction semantics admissible for LTSs of actions. In this case, a composition of LTSs of events obtained as a result of simulation of the original LTSs of actions is equivalent to the LTS of events obtained as a result of simulation of the composition of these LTSs of actions.

Towards the Composition of Specifications in Event-B

The development of a system can start with the creation of a specification. Following this viewpoint, we claim that often a specification can be constructed from the combination of specifications which can be seen as composition. Event-B is a formal method that allows modelling and refinement of systems. The combination, reuse and validation of component specifications are not currently supported in Event-B. We extend the Event-B formalism using shared event composition as an option for developing (distributed) systems. Refinement is used in the development of specifications using composed machines and we prove that properties and proof obligations of specifications can be reused to ensure valid composed specifications. The main contributions of this work are the Event-B extension to support shared event composition and refinement including the proof obligations for a composed machine.

P03-359 - Composition in schizophrenic artistic expression

The issue of composition in the artistic creativity of people suffering from schizophrenia has not been widely taken up by the researchers dealing with schizophrenic artistic expression. Those who wrote about the problems of composition mostly referred to familiar authors with schizophrenic disorders in the context of the course of their disease. The article aims to approach the issue of expression's psychopathology specifically dealing with the analysis of one element of the artistic work. Schizophrenic disorders provoke troubles with process of the arrangement, selection and information integration characteristic to specific thinking disorders of the delusional type. It is particularly visible in the composition of drawings and paintings.Most often one can encounter compositional presentations that have an open configuration based on symmetry which is predominantly figurative in nature, with ornamentation and decorative background. In the literature available in the Clinic of Psychiatry at the Medical Academy and Neuropsychiatric Hospital in Lublin there also prevail open figurative compositions based on symmetry with richer or poorer ornamentation. The issue of the composition's specificity in schizophrenic artistic expression is hard to judge objectively as most of the available works are shallow, schematic, open and without any depth or chiaroscuro. Difficulties in analyzing the compositional rules that are prevalent among people with those disorders are connected with the lack of objective methods, which could be helpful in working on that artistic material.

Understanding deadlock and livelock behaviors in Hybrid Control Systems

This paper introduces a formal definition and a categorization of Deadlock and Livelock behaviors for a general class of deterministic Hybrid Control Systems (HCS), thus extending the classical notion known for (uncontrolled) discrete transition systems. This characterization hinges on three important aspects: (1) the concept of composition (or interconnection) of HCSs; (2) the notion of control-dependent specification, and that of composition of specifications; (3) the dynamical structure of an HCS and its related behaviors. The first notion is introduced in a novel manner, by including aspects from the literature of discrete transition systems, as well as accounting for classical concepts such as that of feedback interconnection of dynamical systems. The second point allows us to formally express general properties that are of interest from a systems and control theory perspective. The third part discriminates between the different and possibly pathological behaviors that are characteristic to HCSs. After commenting on the issues of Deadlock and Livelock prevention and verification, the article concludes with two case studies.

A language for configuring multi-level specifications

This paper shows how systems can be built from their component parts with specified sharing. Its principle contribution is a modular language for configuring systems. A configuration is a description in the new language of how a system is constructed hierarchically from specifications of its component parts. Category theory has been used to represent the composition of specifications that share a component part by constructing colimits of diagrams. We reformulated this application of category theory to view both configured specifications and their diagrams as algebraic presentations of presheaves. The framework of presheaves leads naturally to a configuration language that expresses structuring from instances of specifications, and also incorporates a new notion of instance reduction to extract the component instances from a particular configuration. The configuration language now expresses the hierarchical structuring of multi-level configured specifications. The syntax is simple because it is independent of any specification language; structuring a diagram to represent a configuration is simple because there is no need to calculate a colimit; and combining specifications is simple because structuring is by configuration morphisms with no need to flatten either specifications or their diagrams to calculate colimits.

Composing invariants

We explore the question of the composition of invariance specifications in a context of concurrent and reactive systems. Depending on how compositionality is stated and how invariants are defined, invariance specifications may or may not be compositional. This article first examines two classic forms of invariants and their compositional properties. After pointing out what we see as deficiencies of these two kinds of invariants, two new forms are defined and shown to have useful compositional properties that the more classic forms do not enjoy. The last form, in particular, is shown to be well suited to situations where none of the other three is adapted.

Composition and Refinement of Specifications of Parameterized Data Types

In [5] we introduced a framework for specification of parameterized data types utilizing a generalization of the traditional semantics based on the pushout construction. In the present paper, we address the issue of program development using this framework with particular emphasis on the notion of refinement. Unlike for the loose specifications, refinement does not amount merely to a narrowing of the model class, but primarily to introduction of additional structure into the specified program. We give examples based on the analogues of the classical vertical and horizontal composition of such specifications.

Parallel composition and decomposition of specifications

In the discipline of derivation of programs from specifications by refinement the demonic calculus of relations is a well-established tool, which allows the use of demonic operators on relations considered as specifications of a program's input–output-behaviour together with the standard relation-algebraic operators to reason about specifications ordered by the refinement ordering. The central contribution of this paper is the introduction of a demonic product operator that embodies a natural concept of parallel composition of specifications. Of course, this raises the question of parallel decomposition, which in turn motivates the introduction of demonic implication and totalisation operators. Finally, we also present first results concerning parallel decomposition.

Composition of Default Specifications

In this paper we develop a theory of composition of default specifications. This theory generalizes the work by Goguen and Burstall, where specifications written in an arbitrary logical system (institution) are structured as com- binations of theories. It extends the classical composition by allowing partial re-use (and overriding) of specification modules. The modularisation units are hierarchic specifications, i.e. axioms and defaults organized by priority lev- els. The semantics are given by default institutions, which are a generalisation of institutions in order to enable partial reuse of specifications. Composition is formalized by the use of appropriate categories, both at the syntactic and semantic levels. The theory of composition with overriding is illustrated with an example of an object-oriented specification. Large specifications must be structured in independent, reusable modules in order to ensure modularity and reusability. Modularity enables large specifications to be split into smaller parts, where each part is well-defined in itself. This allows specifications to be developed in an incremental way, where different modules are elaborated independently. Large specifi- cations are then built from small, understandable pieces, which ameliorate the difficulties in producing consistent, rigorous specifications that reflect the users' requirements. Reusability is important where many specifications share big parts, as these need not be recreated. In order to get the desired levels of modularity and reusability, we need to say how to form larger specifications from smaller modules. Therefore, an essential purpose of a specification language is to say how to assemble theories to make new and larger specifications. Moreover, and having this purpose in mind, much of the syntax and semantics of specifications does not depend upon the logical system in which the theories are expressed. Institutions (7) provide a foundation for approaching these problems. They provide a way of talking about the informal notion of a 'logical system' and a way of 'gluing' together theories using colimits in order to form larger specifications. Although institutions provide a way of structuring specifications, they allow existing spec- ifications to be enriched but not modified. In (13), default institutions are proposed as a complementary structure that allows partial reuse of existing specification modules: a 'de- fault' module is used as a template that can be modified by introducing specific exceptions to suit the needs of the application at hand. Default institutions are a generalisation of the con- cept of institution presented in (7). In addition to the usual components of institutions, they include a notion of distance between morphisms of interpretations. This notion of distance is used in order to choose the models of the exception closest to the models of the default module. In this paper, we develop a theory of composition of default specifications, which general-

Detecting equivalence of modular specifications with categorical diagrams

The composition of modular specifications can be modeled, in a category theoretic framework, by colimits of diagrams. Pushouts in particular describe the combination of two specifications sharing a common part. In this paper, we propose to represent the combination of modular specification as diagrams. First, we define a term language to represent modular specifications built with colimit constructions over a category of base specifications. Then, we propose to associate with each term a diagram. This interpretation provides us with a more abstract representation of modular specifications because irrelevant steps of the construction are eliminated. Finally, we propose an algorithm to normalize diagrams, in the case when the base category is skeletal, finite and cycle free. This allows us to detect “construction isomorphisms” between modular specifications, i.e. isomorphisms which do not depend on the semantics of the base specifications, but only on their combination.

Tcc

tcc is a compiler that provides efficient and high-level access to dynamic code generation. It implements the 'C ("Tick-C") programming language, an extension of ANSI C that supports dynamic code generation [15]. 'C gives power and flexibility in specifying dynamically generated code: whereas most other systems use annotations to denote run-time invariants. 'C allows the programmer to specify and compose arbitrary expressions and statements at run time. This degree of control is needed to efficiently implement some of the most important applications of dynamic code generation, such as "just in time" compilers [17] and efficient simulators [10, 48, 46].The paper focuses on the techniques that allow tcc to provide 'C's flexibility and expressiveness without sacrificing run-time code generation efficiency. These techniques include fast register allocation, efficient creation and composition of dynamic code specifications, and link-time analysis to reduce the size of dynamic code generators. tcc also implements two different dynamic code generation strategies, designed to address the tradeoff of dynamic compilation speed versus generated code quality. To characterize the effects of dynamic compilation, we present performance measurements for eleven programs compiled using tcc. On these applications, we measured performance improvements of up to one order of magnitude.To encourage further experimentation and use of dynamic code generation, we are making the tcc compiler available in the public domain. This is, to our knowledge, the first high-level dynamic compilation system to be made available.

Integrating calendar dates and qualitative temporal constraints in the treatment of periodic events

The paper describes a framework for representing and reasoning with periodic events. In particular, it proposes a temporal formalism which deals with both (1) quantitative information concerning the frame of time (e.g., between 1990 and 1993) and the user-defined calendar-dates (e.g., on the first Mondays of April) in which periodic events are located and (2) the qualitative relations between periodic events (e.g., Sam visits the branch office XO1 before going to his office). The meaning of the temporal specifications in our formalism is described in logical terms. The paper defines the basic operations of inversion, intersection and composition of temporal specifications. These operations are correct (with respect to the logical definition of the specifications) and do not lose information. Finally, the paper also describes a correct algorithm which takes advantage of these operations for performing temporal reasoning, and analyses its complexity. An application of the temporal framework to the scheduling in an office is shown in an example.