Intelligent control (IC) tasks are naturally formalized in terms of object-oriented Design (OOD) and programming (OOP). However there are important problems with this approach. Often software is not reusable. Many C++...
详细信息
ISBN:
(纸本)0780344235
Intelligent control (IC) tasks are naturally formalized in terms of object-oriented Design (OOD) and programming (OOP). However there are important problems with this approach. Often software is not reusable. Many C++ classes are so specific to a particular manufacturing process and/or control method that reuse of them is hardly possible. Inheritance and other relations are so specific that they do not lead to selection of the most appropriate intelligent control method. We develop methodology and prototypes of reusable C++ classes for intelligent control tasks related to fuzzy control. These classes incorporate several members: to set components, generate, tune and optimize control functions, and arrange sensor input and output control signals to be executed by external devices. This is based on object-oriented programming combined with multiresolution approach and discovered relations between fuzzy control and classical interpolation [4,6]. The effectiveness of this approach is illustrated with one of the manufacturing processes.
The Liverpool Telescope will be a fully robotic 2m telescope situated in La Palma and managed from Liverpool John Moores University. The telescope observatory control system is responsible for operating the telescope ...
详细信息
ISBN:
(纸本)0819427985
The Liverpool Telescope will be a fully robotic 2m telescope situated in La Palma and managed from Liverpool John Moores University. The telescope observatory control system is responsible for operating the telescope in a fully automated fashion, with observations selected from a database. After a brief introduction to object-oriented techniques this paper presents a class model for observatory control system database and discusses the choice of programming language and database management system. Finally we present a brief description of the automatic code generation tool we have developed to allow fast and reliable implementation of the object model and discuss our overall experience of using object-oriented techniques to implement an observatory control system.
An object-oriented extension to the real-time programming language PEARL is presented in this paper. The new language preserves PEARL's expressiveness for timeliness and industrial processes and, at the same time,...
详细信息
ISBN:
(纸本)0080430457
An object-oriented extension to the real-time programming language PEARL is presented in this paper. The new language preserves PEARL's expressiveness for timeliness and industrial processes and, at the same time, improves the language's readability and manageability through the adoption of a better encapsulation paradigm, derived from the object concept. Some extensions are also proposed, to enhance the language's testability and safety. The proposed language is fully backward compatible with PEARL, while allowing powerful abstraction concepts. (C) 1998 Elsevier Science Ltd. All rights reserved.
We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of feature constraints by a selection constraint ...
详细信息
ISBN:
(纸本)3540653880
We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of feature constraints by a selection constraint x(y)z "by first-class feature tree" y, in contrast to the standard selection constraint x[f]y "by fixed feature" f. We investigate the satisfiability problem of OF and show that it can be solved in polynomial time, and even in quadratic time in an important special case. We compare OF with Treinen's constraint system EF of feature constraints with first-class features, which has an NP-complete satisfiability problem. This comparison yields that the satisfiability problem for OF with negation is NP-hard. Based on OF we give a simple account of type inference for first-class messages in the spirit of Nishimura's recent proposal, and we show that it has polynomial time complexity: We also highlight an immediate extension,that is desirable but makes type inference NP-hard.
作者:
Zhang, QLi, WHChen, SHWuhan Univ
Comp Sci & Technol Coll Natl Engn Technol Res Ctr Multimedia Software Open Res Lab Multimedia Software State Educ Commi Wuhan 430072 Peoples R China
The research of concurrent object-oriented programming languages has suffered from the lack of a widely accepted formal foundation for describing the semantics of concurrent object systems. Basing on pi-calculus and a...
详细信息
ISBN:
(纸本)0818690968
The research of concurrent object-oriented programming languages has suffered from the lack of a widely accepted formal foundation for describing the semantics of concurrent object systems. Basing on pi-calculus and actor model respectively, people have tried to define a common semantic framework for concurrent object-oriented programming. In this paper, we try to compromise these two approaches. We defined a formalism that enjoys a clean formal definition which allowing the reuse of standard results of the theory of concurrency, meanwhile preserving a high level object-oriented programming style. We propose the actor algebra and the concurrent object calculus, and then we give the translation relationship between these two.
In this paper, an application framework for distributed multimedia is proposed. The framework is based on Model-New-Controller of Smalltalk-80. Development of highly interactive multimedia applications for today's...
详细信息
Information technology can bridge the gap between users and analysts with new approaches to modeling user requirements and transforming them into the look and feel of the application in an iterative fashion, interacti...
详细信息
With the development of the network technology, the scale of the information system is becoming larger Component software engineering is the hot point method supporting the development of such kind of application base...
详细信息
ISBN:
(纸本)0818690968
With the development of the network technology, the scale of the information system is becoming larger Component software engineering is the hot point method supporting the development of such kind of application based on network computing model Java Beans is a standard for software components. For develop high quality components, this paper proposes a toolkit -- MChecker for checking the consistency between the Java Beans semantic constraints and its implementation. MChecker uses a logic-based language -- Java Beans Description Language for describing the bean's semantic constraints. Consistency checking is based on a dynamic model checking approach. A generator is used to generate the checker automatically SOY a source bean. A wrapper is used to make the source support the check process. We in the paper illustrate the system architecture, the key technology and the core algorithm. Some experimental results are showed by examples.
Distributed time service is a basic object service in distributed computing environment based on CORBA. In this paper, We present a clock synchronization method based on clock groups. We dividing machines in a system ...
详细信息
ISBN:
(纸本)0818690968
Distributed time service is a basic object service in distributed computing environment based on CORBA. In this paper, We present a clock synchronization method based on clock groups. We dividing machines in a system into groups, nodes in a group are in the same LAN. There is a master clock and several slave clocks in a group, who carry out intra-group synchronization. Master clocks of all groups together accomplish inter-group synchronization. Such dividing-to-group synchronization method make the system scalable and flexible. At the same time, it reduces machines spanning LANs to attend synchronization, thus synchronization overhead is reduced. We have implemented clock synchronization based on clock groups in our experimental distributed object environment.
Method schemas were proposed as a formal model of object-oriented languages. A method schema S is called consistent if, for each method invocation during the execution of S, a method definition to be bound to the invo...
详细信息
Method schemas were proposed as a formal model of object-oriented languages. A method schema S is called consistent if, for each method invocation during the execution of S, a method definition to be bound to the invoked method name is uniquely determined. However, the consistency testing problem is known to be undecidable in general. This paper presents an algorithm which analyzes the consistency of a given method schema. The algorithm decides the consistency problem in polynomial time for monadic method schemas. We also provide an incremental algorithm for testing consistency after updates of a method schema.
暂无评论