Discrete Semantics for Hybrid Automata

Many natural systems exhibit a hybrid behavior characterized by a set of continuous laws which are switched by discrete events. Such behaviors can be described in a very natural way by a class of automata called hybrid automata. Their evolution are represented by both dynamical systems on dense domains and discrete transitions. Once a real system is modeled in a such framework, one may want to analyze it by applying automatic techniques, such as Model Checking or Abstract Interpretation. Unfortunately, the discrete/continuous evolutions not only provide hybrid automata of great flexibility, but they are also at the root of many undecidability phenomena. This paper addresses issues regarding the decidability of the reachability problem for hybrid automata (i.e., “can the system reach a state a from a state b?”) by proposing an “inaccurate” semantics. In particular, after observing that dense sets are often abstractions of real world domains, we suggest, especially in the context of biological simulation, to avoid the ability of distinguishing between values whose distance is less than a fixed ε. On the ground of the above considerations, we propose a new semantics for first-order formulæ which guarantees the decidability of reachability. We conclude providing a paradigmatic biological example showing that the new semantics mimics the real world behavior better than the precise one.     

Delivering public value through open government data initiatives in a Smart City context

By using ICT in an innovative way, governments can improve the delivery of services and interaction with stakeholders. Open data is a way to help public organizations became more open and improve interaction with stakeholders. This paper aims to identify what are the public values enhancements acquired on smart city environment that discloses open data. We propose a conceptual model to analyze the smart city initiative. We contextualized the model taking a smart city domain by analyzing three related-initiatives that comprises open data in a smart city case carried at Rio de Janeiro Operations Center (COR) in Brazil by seven deep-interviewees directly involved - from inside and outside – in this case. The findings reveal evidences that open data initiatives contribute to enhance the delivery of public value in smart city contexts.     

Compact representations of all members of an independence system

It is well known that (reduced, ordered) binary decision diagrams (BDDs) can sometimes be compact representations of the full solution set of Boolean optimization problems. Recently they have been suggested to be useful as discrete relaxations in integer and constraint programming (Hoda et al. 2010). We show that for every independence system there exists a top-down (i.e., single-pass) construction rule for the BDD. Furthermore, for packing and covering problems on n variables whose bandwidth is bounded by \(\mathcal {O}(\log n)\) the maximum width of the BDD is bounded by \(\mathcal {O}(n)\). We also characterize minimal widths of BDDs representing the set of all solutions to a stable set problem for various basic classes of graphs. Besides implicitly enumerating or counting all solutions and optimizing a class of nonlinear objective functions that includes separable functions, the results can be applied for effective evaluation of generating functions.     

Illustrating volume data sets and layered models with importance-aware composition

Non-photorealistic (illustrative) rendering augments typical rendering models to selectively emphasize or de-emphasize specific structures of rendered objects. Illustrative techniques may affect not only the rendering style of specific portions of an object but also their visibility, ensuring that less important regions do not occlude more important ones. Cutaway views completely remove occluding, unimportant structures—possibly also removing valuable context information—while existing solutions for smooth reduction of occlusion based on importance lack precise visibility control, simplicity and generality. We introduce a new front-to-back fragment composition equation that directly takes into account a measure of sample importance and allows smooth and precise importance-based visibility control. We demonstrate the generality of our composition equation with several illustrative effects, which were obtained by using a set of importance measures calculated on the fly or defined by the user. The presented composition method is suitable for direct volume rendering as well as rendering of layered 3D models. We discuss both cases and show examples, though focusing mainly on illustration of volumetric data.     

Supporting Different Dimensions of Adaptability in Workflow Modeling

This paper discusses the theme of workflow systemadaptability in relation to process modeling. Startingfrom a discussion on the role of formal constructs incooperation, the main claim is that adaptabilityinvolves different dimensions of process modeling.These dimensions concern the possibility to flexiblycombine a rich set of basic categories in order toobtain the most suitable language for modeling thetarget business process and the work practices aroundit; to take into account various levels of visibilityof the contexts of definition and use of a processmodel; and finally to allow for temporary as well aspermanent modifications of the process itself.Ariadne, a notation conceived for the above purpose,is illustrated by means of a working example.Moreover, the paper presents the main designprinciples governing Ariadne's implementation.     

An Efficient Solution for Model Checking Graph Transformation Systems

This paper presents an efficient solution for modeling checking graph transformation systems. The approach transforms AGG specifications into Bogor models and supports both attributed typed graphs and layered transformations. Resulting models are amenable to check interesting properties expressed as combinations of LTL (Linear Temporal Logic) and graph transformation rules. The first experimental results are encouraging and show that in most cases our proposal improves existing approaches, both in terms of performance and expressiveness.     

Principal component analysis as a tool for studying interdependences among trace metals in edible mussels from the gulf of Trieste

Summary Principal component analysis has been applied to analyze the correlation matrix obtained from a (6 × 44) data matrix. The 6 trace metals are Co, Ni, Cu, Cd, Hg, and Pb, which are contained in the soft part of edible mussels (Mytilus galloprovincialis Lamarck) from a hatchery on the gulf of Trieste. In the space of eigenvectors, the dimensions are reduced to 3 principal axes, which account for about 77% of the total variance.The unrotated factor matrix obtained by the principal components shows that Co, Ni and Cu are bonded to the first principal component, Cd and Pb to the second, Hg to the third. This picture is also assessed by the Varimax-rotated matrix and it is tentatively explained, at least in part, by considering the associations of the trace metals from various geographical sources.

---

Hauptkomponentenanalyse für das Studium der Assoziationen unter Spurenmetallen in Miesmuscheln im Golf von Triest

Zusammenfassung Die Hauptkomponentenanalyse wurde auf die Korrelationsmatrix, die aus der (6 × 44) Datenmatrix hervorgeht, angewandt. Die 6 Spurenmetalle sind Co, Ni, Cu, Cd, Hg, Pb, die im Miesmuschelnfleisch (Mytilus galloprovineialis Lamarck) gefunden werden. Die Miesmuschelnproben stammen aus der Zucht des Golfes von Triest. In dem Eigenvektorraum werden die Dimensionen auf drei Hauptachsen reduziert, die ungefähr 77% der totalen Varianz erklären.Die unrotierte Faktorenmatrix, die aus den Hauptkomponenten hervorgeht, zeigt, daß Co, Ni, Cu an die erste Hauptkomponente, Cd und Pb an die zweite, Hg an die dritte gebunden sind. Dieses Bild wird von der Varimax-rotierten Matrix bestätigt und es findet eine Erklärung in der Herkunft der Spurenmetalle.

     

Hematopoietic progenitor constituents and adherent cell progenitor morphology isolated from black-rumped agouti (Dasyprocta prymnolopha, Wagler 1831) bone marrow

Stem cells are present in the adult tissues of most diverse species. Bone marrow is recognized to be the most exploited site to obtain stem cells and cell progenitors. The objective of the present study was to characterize hematopoietic progenitor (HP) morphology and analyze the performance of adherent cell progenitors (ACPs) cultivated in vitro from black‐rumped agouti bone marrow (Dasyprocta prymnolopha). Bone marrow aspirates were obtained from tibia crest and used to prepare histological slides and identify cell morphology. Cells were also scattered on culture plates for later isolation, expansion, and quantification. Smears obtained from bone marrow demonstrated HPs at different stages of maturity. In culture, these cells showed fibroblastoid morphology and a strong tendency to form colonies, demonstrated by the presence of cell aggregates, cytoplasmic elongations lying side by side. An 80% cell confluence was observed at 18 days in culture and progressive reduction in the percentage of nonadherent mononuclear cells. After eight passes, a mean cell viability of 96.07% was observed, from a pool of 1.6 × 10⁷ cells (ACP). Thirteen 25‐cm² culture bottles were trypsinized, resuspended in freezing medium, stored in 14 criotubes at a concentration of 1 × 10⁶ cells per milliliter, and placed in liquid nitrogen at ?196°C. Agouti bone marrow demonstrated high plasticity, moreover different HP lines, and a population of adherent cells demonstrated morphology similar to mesenchymal stem cells in culture. Microsc. Res. Tech. 2012. © 2012 Wiley Periodicals, Inc.     

Move limits definition in structural optimization with sequential linear programming. Part II: Numerical examples

A variety of numerical methods have been proposed in literature in purpose to deal with the complexity and non-linearity of structural optimization problems. In practical design, sequential linear programming (SLP) is very popular because of its inherent simplicity and because linear solvers (e.g. Simplex) are easily available. However, SLP performance is sensitive to the definition of proper move limits for the design variables which task itself often involves considerable heuristics. This research presents a new SLP algorithm (LESLP) that implements an advanced technique for defining the move limits. The linearization error sequential linear programming (LESLP) algorithm is formulated so to overcome the traditional limitations of the SLP method. In a companion paper [Comput. Struct. 81 (2003) 197] the basics of the LESLP formulation along with a guide to programming are provided.The new algorithm is successfully tested in weight minimisation problems of truss structures with up to hundreds of design variables and thousands of constraints: sizing and configuration problems are considered. Optimization problems of non-truss structures are also presented. The numerical efficiency, advantages and drawbacks of LESLP are discussed and compared to those of other SLP algorithms recently published or implemented in commercial software packages.