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.     

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     

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.     

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.     

一种网格融合算法

快速建模是三维游戏动画领域的重要技术,从已有模型经过修改、编辑、融合构建出新的模型是一种高效的建模方法.本文提出了一种网格模型融合算法,该算法首先将需要的部分网格从源模型上交互剪切下来,并将其配准对齐;然后将两网格模型转化成点模型表示,并将点模型转化成RBF隐函数表示;再对两隐函数进行布尔运算;最后将布尔运算生的隐函数曲面在两网格接合区域进行三角形化,得到最终的网格模型.算法定义了隐函数曲面的影响区域,有效控制融合过渡.采用边界扩展的三角形化方法,保留了融合区域以外源模型的特征.实验结果表明,本文算法具有很好的网格融合结果,可用于游戏动画中快速造型.     

Models for high-intensity turbulent combustion

Since direct numerical simulation of the Navier-Stokes plus combustion chemistry equations will not be practical in the foreseeable future, models are required for the parameter range of practical interest, i.e. high Reynolds Numbers and a wide range of Damkohler Numbers. Models based on the notion of a flamelet are not appropriate when the turbulence intensity is much greater than the laminar flame speed, but a stochastic model based on the joint PDF of velocity and composition is promising. If the velocity field and inhomogeneities in physical space are ignored in the joint PDF equation, the “Partially Stirred Reactor” or PaSR model is obtained. The PaSR model has recently been studied in detail. Full chemical schemes are computationally tractable. Because the composition PDF has a large number of dimensions (e.g. N_s > 20 for methane), finite-element/volume techniques are not viable, but particle-tracking Monte-Carlo algorithms work well. An enabling feature of the PaSR is that, with the IEM scalar mixing sub-model, it is well suited to parallel computers. The PaSR can describe the effect of turbulence (coupled to a full kinetic scheme) on combustion, including the behavior of emissions such as NO_x and CO, of minor species such as free radicals, and the ignition-extinction bifurcation.     

属性集质量评估模式

为满足用户对约简属性集的不同要求,提出了几种属性集质量的评估模式,从属性集的区分准确度、平衡度、强壮度和相似度几个方面对属性集作出客观的评估。实验结果表明：通过几种属性集质量评估模式,能从更多方面去了解属性集。     

Reversibility and Models for Concurrency

There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [Danos, V. and J. Krivine, Reversible communicating systems, in: P. Gardner and N. Yoshida, editors, Proceedings of the 15th International Conference on Concurrency Theory CONCUR 2004, LNCS 3170 (2004), pp. 292–307] and CCSK [Phillips, I.C.C. and I. Ulidowski, Reversing algebraic process calculi, in: Proceedings of 9th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2006, LNCS 3921 (2006), pp. 246–260. Extended version accepted by Journal of Logic and Algebraic Programming] were developed and general techniques for reversing other process operators were proposed. The paper shows that the notion of reversibility can bridge the gap between some interleaving models and non-interleaving models of concurrency, and makes them interchangeable. We prove that transition systems associated with reversible process algebras are equivalent as models to labelled prime event structures. Furthermore, we show that forward-reverse bisimulation corresponds to hereditary history-preserving bisimulation in the setting with no auto-concurrency and no auto-causation.     

Models for practical parallel computation

A major reason for the lack of practical use of parallel computers has been the absence of a suitable model of parallel computation. Many existing models are either theoretical or are tied to a particular architecture. A more general model must be architecture independent, must realistically reflect execution costs, and must reduce the cognitive overhead of managing massive parallelism. A growing number of models meeting some of these goals have been suggested. We discuss their properties and relative strengths and weaknesses. We conclude that data parallelism is a style with much to commend it, and discuss the Bird-Meertens formalism as a coherent approach to data parallel programming.This work was supported by the Natural Sciences and Engineering Research Council of Canada.     

Ratio Selection for Classification Models

This paper is concerned with the selection of inputs for classification models based on ratios of measured quantities. For this purpose, all possible ratios are built from the quantities involved and variable selection techniques are used to choose a convenient subset of ratios. In this context, two selection techniques are proposed: one based on a pre-selection procedure and another based on a genetic algorithm. In an example involving the financial distress prediction of companies, the models obtained from ratios selected by the proposed techniques compare favorably to a model using ratios usually found in the financial distress literature.     

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.     

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.     

UML模型的协调性检查

本文融合UML用例图、类图、顺序图和状态图，得到一个软件系统的需求模型，给出了这个需求模型的各个元素及相互间协调性检查的一种方法，这样。可以从软件开发的需求分析阶段检查模型的协调性，减少开发成本，最后再从协调的需求模型生成代码。     

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.