ECUT: Energy Conversion and Utilization Technologies program. Heterogeneous catalysis modeling program concept

Insufficient theoretical definition of heterogeneous catalysts is the major difficulty confronting industrial suppliers who seek catalyst systems which are more active, selective, and stable than those currently available. In contrast, progress was made in tailoring homogeneous catalysts to specific reactions because more is known about the reaction intermediates promoted and/or stabilized by these catalysts during the course of reaction. However, modeling heterogeneous catalysts on a microscopic scale requires compiling and verifying complex information on reaction intermediates and pathways. This can be achieved by adapting homogeneous catalyzed reaction intermediate species, applying theoretical quantum chemistry and computer technology, and developing a better understanding of heterogeneous catalyst system environments. Research in microscopic reaction modeling is now at a stage where computer modeling, supported by physical experimental verification, could provide information about the dynamics of the reactions that will lead to designing supported catalysts with improved selectivity and stability

Bond Graph Multi-time Scale Analysis of a Railway Traction System

The unified formalism of bond graphs is applicable to designing, modeling and analyzing complex and heterogeneous physical systems. Moreover, various order-reduction methods can be applied directly on bond graph models in order to simplify them. The aim of this paper is to demonstrate the characteristics and the advantages of the bond graph formalism, considering as an example, model simplification methods of a railway traction system. Several simulations are carried out in order to validate the simplified models. The analysis of couplings on these models highlights the elements that cause perturbations, such as mechanical resonance

Introducing Dynamic Behavior in Amalgamated Knowledge Bases

The problem of integrating knowledge from multiple and heterogeneous sources is a fundamental issue in current information systems. In order to cope with this problem, the concept of mediator has been introduced as a software component providing intermediate services, linking data resources and application programs, and making transparent the heterogeneity of the underlying systems. In designing a mediator architecture, we believe that an important aspect is the definition of a formal framework by which one is able to model integration according to a declarative style. To this purpose, the use of a logical approach seems very promising. Another important aspect is the ability to model both static integration aspects, concerning query execution, and dynamic ones, concerning data updates and their propagation among the various data sources. Unfortunately, as far as we know, no formal proposals for logically modeling mediator architectures both from a static and dynamic point of view have already been developed. In this paper, we extend the framework for amalgamated knowledge bases, presented by Subrahmanian, to deal with dynamic aspects. The language we propose is based on the Active U-Datalog language, and extends it with annotated logic and amalgamation concepts. We model the sources of information and the mediator (also called supervisor) as Active U-Datalog deductive databases, thus modeling queries, transactions, and active rules, interpreted according to the PARK semantics. By using active rules, the system can efficiently perform update propagation among different databases. The result is a logical environment, integrating active and deductive rules, to perform queries and update propagation in an heterogeneous mediated framework.Comment: Other Keywords: Deductive databases; Heterogeneous databases; Active rules; Update

Adaptive Sensing Based on Profiles for Sensor Systems

This paper proposes a profile-based sensing framework for adaptive sensor systems based on models that relate possibly heterogeneous sensor data and profiles generated by the models to detect events. With these concepts, three phases for building the sensor systems are extracted from two examples: a combustion control sensor system for an automobile engine, and a sensor system for home security. The three phases are: modeling, profiling, and managing trade-offs. Designing and building a sensor system involves mapping the signals to a model to achieve a given mission

Estimating the Potential Speedup of Computer Vision Applications on Embedded Multiprocessors

Computer vision applications constitute one of the key drivers for embedded multicore architectures. Although the number of available cores is increasing in new architectures, designing an application to maximize the utilization of the platform is still a challenge. In this sense, parallel performance prediction tools can aid developers in understanding the characteristics of an application and finding the most adequate parallelization strategy. In this work, we present a method for early parallel performance estimation on embedded multiprocessors from sequential application traces. We describe its implementation in Parana, a fast trace-driven simulator targeting OpenMP applications on the STMicroelectronics' STxP70 Application-Specific Multiprocessor (ASMP). Results for the FAST key point detector application show an error margin of less than 10% compared to the reference cycle-approximate simulator, with lower modeling effort and up to 20x faster execution time.Comment: Presented at DATE Friday Workshop on Heterogeneous Architectures and Design Methods for Embedded Image Systems (HIS 2015) (arXiv:1502.07241

Component-based Design of Heterogeneous Reactive Systems in Prometheus

Designing embedded systems increasingly demands coping with heterogeneous systems, involving different models of computation, communication, and execution, on different levels of abstraction and different time scales. The component model BIP (Behavior, Interaction model, Priority) has been designed to support the construction of heterogeneous reactive systems. It enables heterogeneous modeling by separating the notions of behavior, interaction model, and execution model. We present here the design tool Prometheus, which implements the BIP component model, along with a set of algorithms for compositional verification. The use of the component framework is illustrated with two case studies involving different models of computation and communication

Polynomial-time Solvable #CSP Problems via Algebraic Models and Pfaffian Circuits

A Pfaffian circuit is a tensor contraction network where the edges are labeled with changes of bases in such a way that a very specific set of combinatorial properties are satisfied. By modeling the permissible changes of bases as systems of polynomial equations, and then solving via computation, we are able to identify classes of 0/1 planar #CSP problems solvable in polynomial-time via the Pfaffian circuit evaluation theorem (a variant of L. Valiant's Holant Theorem). We present two different models of 0/1 variables, one that is possible under a homogeneous change of basis, and one that is possible under a heterogeneous change of basis only. We enumerate a series of 1,2,3, and 4-arity gates/cogates that represent constraints, and define a class of constraints that is possible under the assumption of a ``bridge" between two particular changes of bases. We discuss the issue of planarity of Pfaffian circuits, and demonstrate possible directions in algebraic computation for designing a Pfaffian tensor contraction network fragment that can simulate a swap gate/cogate. We conclude by developing the notion of a decomposable gate/cogate, and discuss the computational benefits of this definition