Integrating Software Models and Platform Models for Performance Analysis

System performance is a key factor to take into account throughout the software life cycle of modern computer systems, mostly due to their typical characteristics such as distributed deployment, code mobility, and platform heterogeneity. An open challenge in this direction is to integrate the performance validation as a transparent and efficient activity in the system development process. Several methodologies have been proposed to automate the transformation of software/hardware models into performance models. In this paper, we do not take a transformational approach; rather, we present a framework to integrate a software model with a platform model in order to build a performance model. Performance indices are obtained from simulation of the resulting performance model. Our framework provides a library of predefined resource models, model annotation and integration procedures, and simulation support that makes the performance analysis a much easier activity. We present the results obtained from two different industrial case studies that show the maturity and the stability of our approach     

Semantic Vector Models and Functional Models for Pregroup Grammars

We show that vector space semantics and functional semantics in two-sorted first order logic are equivalent for pregroup grammars. We present an algorithm that translates functional expressions to vector expressions and vice-versa. The semantics is compositional, variable free and invariant under change of order or multiplicity. It includes the semantic vector models of Information Retrieval Systems and has an interior logic admitting a comprehension schema. A sentence is true in the interior logic if and only if the ‘usual’ first order formula translating the sentence holds. The examples include negation, universal quantifiers and relative pronouns.     

New Models for Old

When faced with a new thing, human beings do something very sensible. They try to harness previous experience and intuition in service of the new thing. How is this new thing like something that I already know and understand? Trying to model the new thing on some old thing can be efficient, making it easier to reason about the new thing by using analogies adopted from previous experience. We're in the midst of a huge society-wide change to move record keeping from paper systems to digital ones. In consequence, a vast number of existing rules can and should be rethought and revised. No better time than now, and no one better to do it than we.     

Models for fisheries management

Realization of the massive potential harvests from the oceans, coupled with disastrous collapses of substantial fisheries has seen the development over the last 25 years of a quantitative fisheries management science. As an aid to management, models are used to represent fish populations and the effects of exploitation on them. Basic models currently used for fisheries management are reviewed. The models discussed range from the simple surplus production model through to the analytical model of Beverton and Holt incorporating age structure and finally to Kicker's stock-recruitment model. The models are used to examine the dynamics and stability of fish stock when subjected to different exploitation policies. Some of the problems for management in interfacing real fisheries data with the mathematical models are discussed. The goals of management, including catch, fishing effort and economics (e.g. price, cost and inflation) are quantified to produce an objective function which may be used to determine optimal strategies. The optimal harvesting strategies are examined for each model, with a view to developing a general workable robust harvesting policy, independent of the model used.     

Biological Transactions for Quantitative Models

In this work an extension of stochastic π-calculus with biological transactions is presented. This permits to model multi-reactant multi-product reactions as atomic actions when quantitative information are given. First, the syntax and the semantics are defined, then some transaction properties are discussed. Finally, some examples are described.     

Models for Global Constraint Applications

In this paper we give an overview of some industrial applications built using global constraints. We look at three systems from different application domains and show the core models used to express their constraints. We also consider different search strategies that have been applied and discuss some of the application aspects.     

Seamless Montage for Texturing Models

We present an automatic method to recover high‐resolution texture over an object by mapping detailed photographs onto its surface. Such high‐resolution detail often reveals inaccuracies in geometry and registration, as well as lighting variations and surface reflections. Simple image projection results in visible seams on the surface. We minimize such seams using a global optimization that assigns compatible texture to adjacent triangles. The key idea is to search not only combinatorially over the source images, but also over a set of local image transformations that compensate for geometric misalignment. This broad search space is traversed using a discrete labeling algorithm, aided by a coarse‐to‐fine strategy. Our approach significantly improves resilience to acquisition errors, thereby allowing simple and easy creation of textured models for use in computer graphics.     

复合固体推进剂细观力学模型研究

为了建立复合固体推进剂的细观力学模型,首要的问题是建立一个能够真实描述推进剂细观形态结构的颗粒填充模型.文中将推进剂看作是颗粒与基体组成的复合材料,详细地给出了应用分子动力学生成推进剂颗粒填充模型的方法,得到了推进剂颗粒在基体中随机分布的颗粒填充模型.在此基础上,采用细观有限元方法进行了分析,获得了推进剂颗粒与基体内的应力分布情况.研究表明:分子动力学方法可以有效地生成推进剂的细观颗粒填充模型,在此基础上进行的细观力学分析可以有效地考虑固体推进剂细观结构对其力学性能的影响.     

Normative Communication Models for Agent

An agent message is an attempted action upon the information state of the receiver that, if successful, would cause the receiver to move to a new information state. A model of normative communication can define when messages are not merely unsuccessful but instead are illegal or impossible actions upon the receiver’s internal state. The model uses the preconditions of the other core message types, coupled with a model of task interdependencies, agent roles, and belief-desire-intention elements, to define the preconditions for sending a canonical not-understood error message. By defining the space of messages that are legal actions on an agent’s internal state, a normative communication model also defines a set of ‘reasons’ that can accompany the error message. A not-understood error message signals a mismatch between agent interaction models and the accompanying reason opens the possibility for agents to realign their respective models. The paper discusses the matters arising from this possibility. This approach assumes that normative communication behavior reflects normative domain behavior. It also assumes that each agent accesses the normative model, in contrast with more centralized frameworks for defining normative interaction among agents and identifying interaction errors.     

车辆产生仿真模型

从满足交通仿真需求角度分析了车辆产生模块建模的特点,提出了详细的车辆产生仿真模型,该模型能准确细致地仿真初始车辆产生的全过程,为交通仿真模型真实的反映路网交通状态奠定了基础.     

Computing Models for FPGA-Based Accelerators

Field-programmable gate arrays are widely considered as accelerators for compute-intensive applications. A critical phase of FPGA application development is finding and mapping to the appropriate computing model. FPGA computing enables models with highly flexible fine-grained parallelism and associative operations such as broadcast and collective response. Several case studies demonstrate the effectiveness of using these computing models in developing FPGA applications for molecular modeling.     

Parameterized Models for Facial Animation

Parameterized models can produce realistic, manipulable images of human faces— with a surprisingly small number of parameters.     

Neurosymbolic Models for Computer Graphics

Procedural models (i.e. symbolic programs that output visual data) are a historically-popular method for representing graphics content: vegetation, buildings, textures, etc. They offer many advantages: interpretable design parameters, stochastic variations, high-quality outputs, compact representation, and more. But they also have some limitations, such as the difficulty of authoring a procedural model from scratch. More recently, AI-based methods, and especially neural networks, have become popular for creating graphic content. These techniques allow users to directly specify desired properties of the artifact they want to create (via examples, constraints, or objectives), while a search, optimization, or learning algorithm takes care of the details. However, this ease of use comes at a cost, as it's often hard to interpret or manipulate these representations. In this state-of-the-art report, we summarize research on neurosymbolic models in computer graphics: methods that combine the strengths of both AI and symbolic programs to represent, generate, and manipulate visual data. We survey recent work applying these techniques to represent 2D shapes, 3D shapes, and materials & textures. Along the way, we situate each prior work in a unified design space for neurosymbolic models, which helps reveal underexplored areas and opportunities for future research.     

Hexagonal Models for Channel Routing

In this paper we present new diagonal routing models based on the hexagonal grid, and investigate the potential of these models in terms of channel routing. The hexagonal grid consists of vertical columns, and positive and negative diagonal tracks with slopes and , respectively. The layout geometry of this grid is examined and shown to be compatible with VLSI implementation. Furthermore, this investigation demonstrates some advantages of routing on the hexagonal grid. For a channel routing problem (CRP) having maximum net span s ^* , we give an algorithm which routes any two-sided (two-terminal or multiterminal) net CRP in width in three reserved layers. For densities , this channel width is less than the lower bound of d for routing on the square grid in three nonreserved layers. For CRPs of large span, we show how a previous square grid algorithm can be adapted to the hexagonal grid to obtain three layer routings of width for two-terminal nets and for multiterminal nets. Received November 4, 1994; revised August 7, 1995.