一种系统生物学建模语言的开发

本文设计并实现了一种用于系统生物学研究的交互式解释型语言——B语言及其运行环境。根据系统生物学标记语言(SBML)的标准定义设计B语言的建模语法，介绍了B语言解释器和运行环境的开发过程，最后通过仿真实例对B语言与Matlab语言的仿真方式进行了比较，结果表明B语言可更快速获得仿真结果。     

Timed Concurrent Constraint Programming for Analysing Biological Systems

In this paper we present our first approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information constructs in ntcc can provide a suitable language for such systems. We also illustrate how ntcc may provide a unified framework for the analysis of biological systems, as they can be described, simulated and verified using the elements provided by the calculus.     

Stochastic Constraint Programming: A Scenario-Based Approach

To model combinatorial decision problems involving uncertainty and probability, we introduce scenario based stochastic constraint programming. Stochastic constraint programs contain both decision variables, which we can set, and stochastic variables, which follow a discrete probability distribution. We provide a semantics for stochastic constraint programs based on scenario trees. Using this semantics, we can compile stochastic constraint programs down into conventional (non-stochastic) constraint programs. This allows us to exploit the full power of existing constraint solvers. We have implemented this framework for decision making under uncertainty in stochastic OPL, a language which is based on the OPL constraint modelling language [Van Hentenryck et al., 1999]. To illustrate the potential of this framework, we model a wide range of problems in areas as diverse as portfolio diversification, agricultural planning and production/inventory management.     

PETRI网描述的VPML语义

企事业过程建模系统EPMS（Enterprise Process Modeling System）以可视化过程建模语言VPML（Visual Process Modeling Language）为基础,用于过程模型建造和过程模型模拟。VPML语义的正确性与完备性是得到可靠的过程模型的基本保证。文章以枚举法为基础,利用PETRI网描述VPML的所有语义,证明其语义的正确性与完备性。利用二者之间建立的映射关系,将VPML建立的模型转换为PETRI网描述,借助于PETRI网工具可进行系统性能分析,提高产品开发的可靠性。     

Communication Port: A Language Concept for Concurrent Programming

A new language concept–communication port (CP), is introduced for programming on distributed processor networks. Such a network can contain an arbitrary number of processors each with its own private storage but with no memory sharing. The processors must communicate via explicit message passing. Communication port is an encapsulation of two language properties: "communication non-determinism" and "communication disconnect time." It provides a tool for progranmers to write well-structured, modular, and efficient concurrent programs. A number of examples are given in the paper to demonstrate the power of the new concepts.     

Concurrent C: A programming language for distributed multiprocessor systems

Recent advances in hardware technology have made the construction of multiprocessor systems economically feasible. This paper describes a new programming language (Concurrent C) suitable for distributed systems which are networks of loosely connected processors, each with its own local storage. Concurrent C is the extended version of the programming language C, incorporating features for parallel processing and interprocess communications.     

Ann: A domain-specific language for the effective design and validation of Java annotations

This paper describes a new modelling language for the effective design and validation of Java annotations. Since their inclusion in the 5th edition of Java, annotations have grown from a useful tool for the addition of meta-data to play a central role in many popular software projects. Usually they are not conceived in isolation, but in groups, with dependency and integrity constraints between them. However, the native support provided by Java for expressing this design is very limited.To overcome its deficiencies and make explicit the rich conceptual model which lies behind a set of annotations, we propose a domain-specific modelling language. The proposal has been implemented as an Eclipse plug-in, including an editor and an integrated code generator that synthesises annotation processors. The environment also integrates a model finder, able to detect unsatisfiable constraints between different annotations, and to provide examples of correct annotation usages for validation. The language has been tested using a real set of annotations from the Java Persistence API (JPA). Within this subset we have found enough rich semantics expressible with Ann and omitted nowadays by the Java language, which shows the benefits of Ann in a relevant field of application.     

GSML:一种面向交互和协同的用户端编程语言

现有面向服务的编程语言往往强调服务的组合和使用,而忽略用户端的表现和协作．文章定义了一种语言GSML来描述灵活多变的网格应用逻辑,并实现了相关工具集以支持网格环境中用户端的“按需”编程．GSML包括启发自π演算的若干概念,并使用这些概念统一描述用户端组件和网格资源之间的交互关系,把它们连接成为完整的网格应用,并且还对GSML描述的网格应用进行了递归定义,不同用户可以通过在各自的GSML浏览器中互相包含对方的应用来实现协同工作．     

非计算机专业C语言程序设计实验教学模式

本文就C语言程序设计的实验教学,针对非计算机专业学生的特点,通过多个实验教学实践,提出激发学生学习兴趣、与理论授课老师保持良好沟通、合理安排实验教学内容的教学思路,并就具体实现方法进行探讨。     

Parallel programming with logic languages: A survey

Formal properties of logic languages are largely studied; however, their impact on the practice of software design and programming is currently minimal. In this paper we survey some interesting representatives of the family of logic languages aiming at comparing the different capabilities they offer for designing and programming parallel systems. The logic languages Prolog, Aurora, Flat Concurrent Prolog, Parlog, GHC, and DeltaProlog were chosen, because a suitable set of relevant examples has been published, mostly by the language designers themselves. A number of sample programs is used to expose and compare the languages with respect to their object oriented programming capabilities for multiprocess coordination, interprocess communication, and resource management. Special attention is devoted also to metaprogramming as well, seen as a useful technique for specifying and building the operating environments of the languages themselves. The paper ends with a discussion on positive and negative features found comparing these languages, and indicates some guidelines to be followed in the design of new logic languages.     

Eclipse Support for Using Eli and Teaching Programming Languages

This demonstration will show Eclipse plugins developed at Macquarie and Colorado to support the Eli Language Processor Generation system and to enhance teaching of programming language concepts and implementation techniques. The plugins support exploration of programming language semantics, integrated development in the Eli system, and high-level observations of compiler execution.     

UML面向对象建模在网上图书销售系统中的应用

文章首先简要介绍了基于面向对象思想的统一建模语言UML的基本概念,然后阐述了UML建模机制与RUP相结合的生命周期迭代化建模思想,最后以网上图书销售系统的UML建模为背景,探索了基于UML的管理信息系统建模及UML中多种模型图的使用方法.     

Giotto:与平台无关的嵌入式时序触发语言

Gitto语言是一种能适用于硬实时控制应用的高级编程语言。介绍了Giotto语言的编程方法,以自主航模的设计为例,说明了Giotto语言如何在实际设计中应用,由于Giotto设计过程中将时序程序与功能程序分离的特点,使Giotto程序与具体的运行平台无关,提高了程序的健壮性、稳定性及代码的复用性。     

支持即时构造的业务端编程语言VINCA

提出一种支持Web服务组合、面向业务用户的可视化编程语言VINCA,基于VINCA的应用即时构建方法——业务端编程,帮助业务用户即时构造应用．实现了一个支撑环境,并进行了初步的应用验证。     

A Neural Network for Solving Nonlinear Programming Problems

A neural network for solving convex nonlinear programming problems is proposed in this paper. The distinguishing features of the proposed network are that the primal and dual problems can be solved simultaneously, all necessary and sufficient optimality conditions are incorporated, and no penalty parameter is involved. Based on Lyapunov, LaSalle and set stability theories, we prove strictly an important theoretical result that, for an arbitrary initial point, the trajectory of the proposed network does converge to the set of its equilibrium points, regardless of whether a convex nonlinear programming problem has unique or infinitely many optimal solutions. Numerical simulation results also show that the proposed network is feasible and efficient. In addition, a general method for transforming non-linear programming problems into unconstrained problems is also proposed. ID="A1" Correspondence and offprint requests to: Dr Z Chen, Department of Electronic Engineering, Brunel University, Uxbridge, Middle-sex, UK     

Mumbo: A Rule-Based Implementation of a Run-time Program Generation Language

We describe our efforts to use rule-based programming to produce a model of Jumbo, a run-time program generation (RTPG) system for Java. Jumbo incorporates RTPG following the simple principle that the regular compiler — or, rather, its back-end — can be used both for ordinary, static compilation and for run-time compilation. This tends to produce a run-time compiler that is inefficient but potentially subject to improvement by partial evaluation. However, the complexity of the language and compiler have made it difficult for us to achieve actual optimization. The model, written in Maude, preserves all the essential ingredients of Jumbo, but operates on a simplified language, called Mumbo. The simplification in the language together with Maude's support for code rewriting has allowed us to make rapid progress. We discuss the model in detail, the kinds of optimizations we have obtained, and the impact on the Jumbo project.     

E<Emphasis Type=SmallCaps>ssence</Emphasis>: A constraint language for specifying combinatorial problems

Essence is a formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete mathematics. Essence provides a high level of abstraction, much of which is the consequence of the provision of decision variables whose values can be combinatorial objects, such as tuples, sets, multisets, relations, partitions and functions. Essence also allows these combinatorial objects to be nested to arbitrary depth, providing for example sets of partitions, sets of sets of partitions, and so forth. Therefore, a problem that requires finding a complex combinatorial object can be specified directly by using a decision variable whose type is precisely that combinatorial object.     

An Efficient Modular Method for the Control of Concurrent Discrete Event Systems: A Language-based Approach

In this paper, we are interested in the control of a particular class of Concurrent Discrete Event Systems defined by a collection of components that interact with each other. We investigate the computation of the supremal controllable language contained in the language of the specification. We do not adopt the decentralized approach. Instead, we have chosen to use a modular centralized approach and to perform the control on some approximations of the plant derived from the behavior of each component. The behavior of these approximations is restricted so that they respect a new language property for discrete event systems called partial controllability condition that depends on the specification. It is shown that, under some assumptions, the intersection of these “controlled approximations” corresponds to the supremal controllable language contained in the specification with respect to the plant. This computation is performed without having to build the whole plant, hence avoiding the state space explosion induced by the concurrent nature of the plant. It is finally shown that the class of specifications on which our method can be applied strictly subsumes the class of separable specifications.

SGPL:一种面向服务组合的结构化网格编程语言

现有的网格编程语言与环境可以分为两大类,一类是对现有语言扩充,引入网格特征,一类是使用工作流技术,支持服务定制.论文提出了一种面向服务组合的结构化网格编程语言SGPL,并在此基础上,设计了一个可视化的网格编程环境VGPE.VGPE结合了现行网格编程环境的优点,具有结构化、可定制性和可视化等特点.论文对SGPL的主要语言要素（活动、转移和关联等）和主要结构体（顺序、条件、循环、并行和宏等）进行了定义,论述了SGPL的中间代码生成规则,给出了分支结构和宏结构的解析算法.最后论文在校园网格环境下,实现了SGPL和VGPE,并通过实验验证了SGPL可以一次性定制和组合复杂的或重复的网格服务请求,简化了服务过程,提高了工作效率.