Language Parametric Module Management for IDEs

An integrated development environment (IDE) monitors all the changes that a user makes to source code modules and responds accordingly by flagging errors, by reparsing, by rechecking, or by recompiling modules and by adjusting visualizations or other information derived from a module. A module manager is the central component of the IDE that is responsible for this behavior. Although the overall functionality of a module manager in a given IDE is fixed, its actual behavior strongly depends on the programming languages it has to support. What is a module? How do modules depend on each other? What is the effect of a change to a module?We propose a concise design for a language parametric module manager: a module manager that is parameterized with the module behavior of a specific language. We describe the design of our module manager and discuss some of its properties. We also report on the application of the module manager in the construction of IDEs for the specification language Asf+Sdf as well as for Java.Our overall goal is the rapid development (generation) of IDEs for programming languages and domain specific languages. The module manager presented here represents a next step in the creation of such generic language workbenches.     

Linear covariant gauges on the lattice

Linear covariant gauges, such as Feynman gauge, are very useful in perturbative calculations. Their non-perturbative formulation is, however, highly non-trivial. In particular, it is a challenge to define linear covariant gauges on a lattice. We consider a class of gauges in lattice gauge theory that coincides with the perturbative definition of linear covariant gauges in the formal continuum limit. The corresponding gauge-fixing procedure is described and analyzed in detail, with an application to the pure SU(2) case. In addition, results for the gluon propagator in the two-dimensional case are given.     

基于模板的重构

重构是对软件的一种调整,在不改变软件的行为的同时提高其可理解性,降低其修改成本。模板是标准C 语言中的一个重要特性,并激起了对于基于此的泛型程序设计的研究。文中研究了如何将C 模板特性应用到软件重构中。重构是提高软件内部质量的重要途径,通过结合C 语言的模板特性,可以让程序更为精练、更为容易重用和改进。通过一些具体的实例,论述和介绍了三个基于模板的重构手法,以及对原有的程序设计的改进。     

Design shells: A formalism for prototype refinement in knowledge-based design systems

The paper presents an approach for the development of a specialized shell for design. The concept of a knowledge-based design shell is proposed as a medium for encoding and using structured schema of generic design knowledge. The prototype as one kind of significant class of generic knowledge in architectural design is introduced. The significance of the concept of a design shell is discussed with respect to formalization, implementation, application and operation. A generative prototype design shell is proposed, defined and elaborated. The schema of generative prototype shell provides a vehicle for the representation of both the syntactic and the semantic content in design generation. A method for representing various types of knowledge in these schema is proposed. The method exploits the characteristics of both rules and frames, and integrates them in a single schema. A plan type of a row house, as one kind of significant class of design prototypes in architectural design, a specific design knowledge in GPRS, is demonstrated in a system called PRODS. The implementation and significance of such an approach is knowledge-based design systems containing knowledge of multiple prototypes is discussed. Relevant future research topics are identified.     

A fuzzy adaptive variable structure controller with applications torobot manipulators

A new adaptive fuzzy control algorithm is developed in this paper, which has a regular fuzzy controller and a supervisory control term. This control algorithm does not require the system model, but has stability assurance for the closed-loop controlled system. The design is simple, in the sense that both the membership functions and the rule base are simple, yet generic. It can be applied to a large class of robotic and other mechanical systems.     

Apla中泛型约束机制研究

泛型程序设计可大幅提高程序的可重用性、可靠性和开发效率.泛型约束机制是对泛型参数进行形式描述,并对其合法性进行检测及验证,从而保证泛型程序的可靠性和安全性.分析总结多种主流语言的泛型约束特性,存在难以描述及验证基于动态语义的复杂约束需求问题,与完整实现GP尚有距离;以抽象程序设计语言Apla为宿主语言,提出了基于代数结构及公理语义的泛型约束方法,给出了基本数据类型、自定义抽象数据类型和子程序的3类泛型约束机制,拓展了泛型程序设计约束的应用范围.同时,支持静态语法和动态语义层约束,提高了泛型约束的精确度;借助Isabelle定理证明器,设计了泛型约束匹配检测和验证算法;进一步设计了泛型约束机制在PAR平台的实现方案及其系统原型.实验部分给出了该泛型约束机制描述、检测及验证一系列复杂泛型约束问题的全过程,自动生成的C++模板程序的可靠性和安全性得到显著提高.     

Safe model polymorphism for flexible modeling

Domain-Specific Languages (DSLs) are increasingly used by domain experts to handle various concerns in systems and software development. To support this trend, the Model-Driven Engineering (MDE) community has developed advanced techniques for designing new DSLs. However, the widespread use of independently developed, and constantly evolving DSLs is hampered by the rigidity imposed to the language users by the DSLs and their tooling, e.g., for manipulating a model through various similar DSLs or successive versions of a given DSL. In this paper, we propose a disciplined approach that leverages type groups׳ polymorphism to provide an advanced type system for manipulating models, in a polymorphic way, through different DSL interfaces. A DSL interface, a.k.a. model type, specifies a set of features, or services, available on the model it types, and subtyping relations among these model types define the safe substitutions. This type system complements the Melange language workbench and is seamlessly integrated into the Eclipse Modeling Framework (EMF), hence providing structural interoperability and compatibility of models between EMF-based tools. We illustrate the validity and practicability of our approach by bridging safe interoperability between different semantic and syntactic variation points of a finite-state machine (FSM) language, as well as between successive versions of the Unified Modeling Language (UML).     

A compositional reasoning system for executing nonmonotonic theories of reasoning

In this paper the framework DESIRE for the design of compositional reasoning systems and multi‐agent systems was applied to build a generic nonmonotonic reasoning system. The outcome is a general reasoning system that can be used to model different nonmonotonic reasoning formalisms and that can be executed by a generic execution mechanism. The main advantages of using DESIRE (for example, compared to a direct implementation in a programming language such as PROLOG) are that the design is generic and has a transparent compositional structure, and the explicit declarative specification of both the static and dynamic aspects of the nonmonotonic reasoning processes, including their control. © 2003 Wiley Periodicals, Inc.     

The systems programming language,Malus

This paper reports on the design and development of a high level language, Malus, for use in implementing a time-sharing system. Emphasized are the ways that the language and its compiler accommodate the specialized requirements of systems programming and programmers. Among these are the need to generate highly efficient object code, to allow inter-programmer communication by program self-documentation, and to define and organize system tables and data. In addition, the Malus compiler is highly modular; thus the language may be modified or augmented in response to user needs unforeseen during langauge design. Systems programs cannot be machine independent and Malus allows explicit control of emitted code when an application requires particular efficiency or use of privileged instructions. There is also a facility allowing nested redefinition of identifiers. Efficient storage management and data access is effected by the availability of based structures, a register storage class and built-in functions to facilitate their use. Malus is evaluated both in terms of some general criteria for systems implementation languages and by an appraisal of user reactions. While this assessment shows a few areas where the language might be improved, it is felt that Malus is a valuable and effective tool for systems implementation.     

A Generic P/T Net Model and Framework for Concurrent Integrated Design and Planning of Electromechanical Assemblies

This paper describes a new unified formal modeling framework based on generic place/transition nets (PTNs) for concurrent integrated design and planning of electromechanical assemblies. First, a generic PTN model is defined as an abstract (meta)class of all types of PTNs. Then, an integrated object modeling framework is proposed for capturing and representing information and knowledge in the assembly design and planning processes based on the defined generic PTN modeling language and formalisms. The proposed integrated assembly model with the generic PTNs can uniformly represent the causal relations at the assembly level, the operation level, and the feature-based single-part level through the data abstraction of components and connectors on various levels of integrated assembly design and planning. An assembly model compatible with the STandard for the Exchange of Product model data (STEP, officially ISO 10303) is also built with the generic PTNs. To validate the proposed modeling framework, a prototype system has been developed, and a case study on gearbox assembly design and planning is provided.     

Multiple domain feature mapping: a methodology based on deep models of features

In the research described in this paper, an approach that utilizes deep models of features to transform a component design represented by neutral features into domain-specific features has been developed. The neutral features are known as feature-oriented generic shapes (FOGSs). The proposed approach provides the flexibility needed to represent both the deep and shallow knowledge required in feature mapping. A deep model of a feature is represented in the form of a face connectivity graph (FCG) that embodies deep knowledge about its geometry, while other non-geometrical information can be represented as rules or procedural functions. By comparing the original faces of a product model with those of the resultant evaluated boundary model, faces of interest can be easily extracted and described using FCGs. A FCG can then be examined to determine its class and the relevant parameters for applications in such domains as process planning. The mapping shell is designed with layered architecture that makes it highly appropriate for implementation using blackboard technology.     

Capturing smart service systems: Development of a domain‐specific modelling language

Over the last years, the nature of service has changed owing to conceptual advances and developments in information technology. These developments have given rise to novel types of service and smart service systems (SSS), ie, resource configurations capable of learning, dynamic adaptation, and decision making. Currently, the internet of things (IoT) is turning physical objects into active smart things, bridging the gap between the physical and the digital world. Smart things advance SSS as they observe the physical environment, access local data, immerse into individuals' everyday lives and organizational routines. In line with the emergent nature of both phenomena, the impact of the IoT on SSS yet needs to be explored. Building the basis for explanatory and design‐led research and for the analysis and design of SSS, a means for the conceptual modelling of SSS that accounts for novel IoT‐enabled concepts is in high need. Hence, we designed, demonstrated, and evaluated a domain‐specific modelling language (DSML) for SSS. We evaluated the DSML by using it in the modelling of real‐world scenarios from all functional IoT domains, by submitting it to the scrutiny of industry experts, by discussing it against generic DSML requirements, and by analysing to what extent it meets domain‐specific design objectives compared with competing artefacts. To demonstrate the DSML, we included a complex real‐world scenario centred around the Nest Learning Thermostat.     

Optimal design of dispersive tubular reactors at steady-state using optimal control theory

This paper studies the design of optimal temperature profiles for a class of exothermic, jacketed dispersive tubular reactors under steady-state conditions and subject to maximum temperature constraints. The studied class ranges from perfectly mixed continuous stirred tank reactors to plug flow reactors. The aim is to derive the Pareto optimal set of temperature profiles for conflicting conversion and energy costs, while extracting generic features from the obtained solutions. Hereto, a four step procedure which is based on a weighted sum of both costs and which combines indirect, analytical and direct, numerical optimal control techniques, is employed. The generic features are studied (i) along the Pareto set by varying the weights and (ii) along the reactor class by adapting the dispersion level.     

Creating Specific Grammars with Generic Grammars: Towards Flexible Urban Design

The aim of the City Induction project is to develop an urban design tool consisting of 3 parts: an urban programme formulation module, a generation module and an evaluation module. The generation module relies on a very generic Urban Grammar composed of several generic grammars called Urban Induction Patterns (UIPs) corresponding to typical urban design moves. Specific grammars, such as the analytical grammars inferred from our case studies, can be obtained by defining specific arrangements of Urban Induction Patterns and specific constraints on the rule parameters. We show that variations on the UIP arrangements or rule parameters can provide design variations and specific grammars to be synthesised through design exploration. It is therefore seen as a process for synthesizing a specific design grammar within the field of urban design and has two main features: (1) it allows for the synthesis of specific grammars during the design process and (2) it allows for the customization of a personal design language within the broad scope of the generic grammar.     

一种类属编程方法的应用及分析

传统以C++实现的面向对象的软件系统中,类接口往往以虚拟基类与虚拟函数定义。然而随着软件更新速度的加快,这种方法难以使接口兼顾效率与兼容性。实现一种Policiesbased的设计,以类属组件的形式实现类接口,使其具有按需定制的特点,从而具有更大的复用性。经理论分析和模拟实验证明,这种方法表现优于虚拟函数机制。     

Quantum inferring acausal structures and the Monty Hall problem

This paper presents a quantum version of the Monty Hall problem based upon the quantum inferring acausal structures, which can be identified with generalization of Bayesian networks. Considered structures are expressed in formalism of quantum information theory, where density operators are identified with quantum generalization of probability distributions. Conditional relations between quantum counterpart of random variables are described by quantum conditional operators. Presented quantum inferring structures are used to construct a model inspired by scenario of well-known Monty Hall game, where we show the differences between classical and quantum Bayesian reasoning.     

SEIS++:一个油气勘探领域软件建造和集成的模式语言

工业化的软件复用从通用类库进化到了面向领域的应用框架和设计模式,与框架相比,设计模式更集中于软件体系结构中重复出现的设计韵律,它主要由可复用的抽象设计结构组成,特定领域内一组相关的设计模式构成了该领域的模式语言,它们可在领域内重复使用以完成某类特定系统的体系结构设计。     

A Generic Reification Technique for Object-Oriented Reflective Languages

Computational reflection is gaining interest in practical applications as witnessed by the use of reflection in the Java programming environment and recent work on reflective middleware. Reflective systems offer many different reflection programming interfaces, the so-called Meta-Object Protocols (MOPs). Their design is subject to a number of constraints relating to, among others, expressive power, efficiency and security properties. Since these constraints are different from one application to another, it would be desirable to easily provide specially-tailored MOPs.In this paper, we present a generic reification technique based on program transformation. It enables the selective reification of arbitrary parts of object-oriented meta-circular interpreters. The reification process is of fine granularity: individual objects of the run-time system can be reified independently. Furthermore, the program transformation can be applied to different interpreter definitions. Each resulting reflective implementation provides a different MOP directly derived from the original interpreter definition.     

A Class of Generalized Laplacians on Vector Bundles Devoted to Multi-Channel Image Processing

In the context of fibre bundles theory, there exist some differential operators of order 2, called generalized Laplacians, acting on sections of vector bundles over Riemannian manifolds, and generalizing the Laplace-Beltrami operator. Such operators are determined by covariant derivatives on vector bundles. In this paper, we construct a class of generalized Laplacians, devoted to multi-channel image processing, from the construction of optimal covariant derivatives. The key idea is to consider an image as a section of an associate bundle, that is a vector bundle related to a principal bundle through a group representation. In this context, covariant derivatives are determined by connection 1-forms on principal bundles. We construct optimal connection 1-forms by the minimization of a variational problem on principal bundles. From the heat equations of the generalized Laplacians induced by the corresponding optimal covariant derivatives, we obtain diffusions whose behaviors depend of the choice of the group representation. We provide experiments on color images.     

A generic framework for modeling resources with UML

Current wisdom encourages designers to first focus on the logical aspects of their problem and then defer platform and technology issues until the concluding phases of development. This behavior is reasonable, considering that devising logically sound solutions is frequently the most difficult aspect of development. Unfortunately-and this has been understated to date-there are many situations in which this approach is inappropriate. Real-time software design is one domain where this situation is particularly obvious because the domain's requirements force software to interact with the physical world in some way. Recently, a generic object oriented framework has been proposed for modeling both physical and logical resources. Although the framework is generic, it is mainly used with the industry-standard Unified Modeling Language (UML). By providing a standard means for representing resources and their attributes, it becomes possible to seamlessly transfer UML models of real-time systems between design and specialized analysis tools. The author shows how developers can use the OMG's UML to model resources and thus predict crucial system properties before fully implementing a system