Behavioral Types for Embedded Software - A Survey

At present, there is a variety of formalisms for modeling and analyzing the communication behavior of components. Due to a tremendous increase in size and complexity of embedded systems accompanied by shorter time to market cycles and cost reduction, so called behavioral type systems become more and more important. This chapter presents an overview and a taxonomy of behavioral types. The intentions of this taxonomy are to provide a guidance for software engineers and to form the basis for future research.

Diffusion modeling of percutaneous absorption kinetics: 2. Finite vehicle volume and solvent deposited solids

The diffusion model for percutaneous absorption is developed for the specific case of delivery to the skin being limited by the application of a finite amount of solute. Two cases are considered; in the first, there is an application of a finite donor (vehicle) volume, and in the second, there are solvent-deposited solids and a thin vehicle with a high partition coefficient. In both cases, the potential effect of an interfacial resistance at the stratum corneum surface is also considered. As in the previous paper, which was concerned with the application of a constant donor concentration, clearance limitations due to the viable eqidermis, the in vitro sampling rate, or perfusion rate in vivo are included. Numerical inversion of the Laplace domain solutions was used for simulations of solute flux and cumulative amount absorbed and to model specific examples of percutaneous absorption of solvent-deposited solids. It was concluded that numerical inversions of the Laplace domain solutions for a diffusion model of the percutaneous absorption, using standard scientific software (such as SCIENTIST, MicroMath Scientific software) on modern personal computers, is a practical alternative to computation of infinite series solutions. Limits of the Laplace domain solutions were used to define the moments of the flux-time profiles for finite donor volumes and the slope of the terminal log flux-time profile. The mean transit time could be related to the diffusion time through stratum corneum, viable epidermal, and donor diffusion layer resistances and clearance from the receptor phase. Approximate expressions for the time to reach maximum flux (peak time) and maximum flux were also derived. The model was then validated using reported amount-time and flux-time profiles for finite doses applied to the skin. It was concluded that for very small donor phase volume or for very large stratum corneum-vehicle partitioning coefficients (e.g., for solvent deposited solids), the flux and amount of solute absorbed are affected by receptor conditions to a lesser extent than is obvious for a constant donor constant donor concentrations. (C) 2001 Wiley-Liss, Inc. and the American Pharmaceutical Association J Pharm Sci 90:504-520, 2001.

Identifying trajectories of adolescent smoking: An application of latent growth mixture modeling

The goal of the current study was to identify discrete longitudinal patterns of change in adolescent smoking using latent growth mixture modeling. Five distinct longitudinal patterns were identified. A group of early rapid escalators was characterized by early escalation (at age 13) that rapidly increased to heavy smoking. A pattern characterized by occasional puffing up until age 15, at which time smoking escalated to moderate levels was also identified (late moderate escalators). Another group included adolescents who, after age 15, began to escalate slowly in their smoking to light (0.5 cigarettes per month) levels (late slow escalators). Finally, a group of stable light smokers (those who smoked 1-2 cigarettes per month) and a group of stable puffers (those. who smoked only a few puffs per month) were also identified. The stable puffer group was the largest group and represented 25% of smokers.

A formal representation of assumptions in process modelling

In this work, we present a systematic approach to the representation of modelling assumptions. Modelling assumptions form the fundamental basis for the mathematical description of a process system. These assumptions can be translated into either additional mathematical relationships or constraints between model variables, equations, balance volumes or parameters. In order to analyse the effect of modelling assumptions in a formal, rigorous way, a syntax of modelling assumptions has been defined. The smallest indivisible syntactical element, the so called assumption atom has been identified as a triplet. With this syntax a modelling assumption can be described as an elementary assumption, i.e. an assumption consisting of only an assumption atom or a composite assumption consisting of a conjunction of elementary assumptions. The above syntax of modelling assumptions enables us to represent modelling assumptions as transformations acting on the set of model equations. The notion of syntactical correctness and semantical consistency of sets of modelling assumptions is defined and necessary conditions for checking them are given. These transformations can be used in several ways and their implications can be analysed by formal methods. The modelling assumptions define model hierarchies. That is, a series of model families each belonging to a particular equivalence class. These model equivalence classes can be related to primal assumptions regarding the definition of mass, energy and momentum balance volumes and to secondary and tiertinary assumptions regarding the presence or absence and the form of mechanisms within the system. Within equivalence classes, there are many model members, these being related to algebraic model transformations for the particular model. We show how these model hierarchies are driven by the underlying assumption structure and indicate some implications on system dynamics and complexity issues. (C) 2001 Elsevier Science Ltd. All rights reserved.

MapScript: A map algebra programming language incorporating neighborhood analysis

Map algebra is a data model and simple functional notation to study the distribution and patterns of spatial phenomena. It uses a uniform representation of space as discrete grids, which are organized into layers. This paper discusses extensions to map algebra to handle neighborhood operations with a new data type called a template. Templates provide general windowing operations on grids to enable spatial models for cellular automata, mathematical morphology, and local spatial statistics. A programming language for map algebra that incorporates templates and special processing constructs is described. The programming language is called MapScript. Example program scripts are presented to perform diverse and interesting neighborhood analysis for descriptive, model-based and processed-based analysis.

Using a cartographic modeling language to manipulate spectral satellite imagery

Land related information about the Earth's surface is commonIJ found in two forms: (1) map infornlation and (2) satellite image da ta. Satellite imagery provides a good visual picture of what is on the ground but complex image processing is required to interpret features in an image scene. Increasingly, methods are being sought to integrate the knowledge embodied in mop information into the interpretation task, or, alternatively, to bypass interpretation and perform biophysical modeling directly on derived data sources. A cartographic modeling language, as a generic map analysis package, is suggested as a means to integrate geographical knowledge and imagery in a process-oriented view of the Earth. Specialized cartographic models may be developed by users, which incorporate mapping information in performing land classification. In addition, a cartographic modeling language may be enhanced with operators suited to processing remotely sensed imagery. We demonstrate the usefulness of a cartographic modeling language for pre-processing satellite imagery, and define two nerv cartographic operators that evaluate image neighborhoods as post-processing operations to interpret thematic map values. The language and operators are demonstrated with an example image classification task.