We introduce a first-order language for semantic underspecification that we call Constraint Language for Lambda-Structures (CLLS). A λ-structure can be considered as a λ-term up to consistent renaming of bound varia...
详细信息
This paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time systems, enjoying increasing populari...
详细信息
We present the basis of the original autonomous adaptive control (AAC) methodology. It is an approach to the design of intelligent systems that simulate structure and functions of the nervous system and brain. The AAC...
详细信息
We present the basis of the original autonomous adaptive control (AAC) methodology. It is an approach to the design of intelligent systems that simulate structure and functions of the nervous system and brain. The AAC methodology idea is that structure and functions of the nervous system are forced to follow the control system conditions at an initial moment. The initial conditions are: (a) the control system (CS) is a discrete device; (b) the CS is located inside of the controlled object; (c) the CS has minimum initial knowledge. We briefly described the AAC CS structure and functions. The AAC CS can be made, for example, in neural networks form.
Global Instruction Schedulers can be classified as either structure or profile driven. Structure driven approaches attempt to find instruction level parallelism by redistributing instructions along all possible execut...
详细信息
ISBN:
(纸本)9780818685910
Global Instruction Schedulers can be classified as either structure or profile driven. Structure driven approaches attempt to find instruction level parallelism by redistributing instructions along all possible execution paths. When resources are limited, poor choices may penalize the frequently executed paths. By contrast, profile driven approaches use feedback information to identify frequently executed (hot) regions, and attempt to improve their performance. This may be at the expense of less frequently executed (cold) regions, for instance by inserting fixup code. The overall performance improves if the frequency information is accurate and there is a dominant trace in the program. If either of these conditions does not hold, performance may degrade. We present a novel algorithm that attempts to combine the individual merits of the above two approaches while avoiding some of their drawbacks. We have also incorporated several techniques which improve the global scheduling performance on out-of-order (OOO) processors. Our algorithm is integrated with a parametric resource model and can be applied both before and after register allocation. It has been implemented in the SGI MIPSpro compiler, and the results have been evaluated on the MIPS R8000 and R10000 processors.
In this paper, we supplement the set of basic and back-forth behavioural equivalences for Petri nets considered in [11] by place bisimulation ones. The relationships of all the equivalence notions are examined, and th...
In this paper, we supplement the set of basic and back-forth behavioural equivalences for Petri nets considered in [11] by place bisimulation ones. The relationships of all the equivalence notions are examined, and their preservation by refinements is investigated to find out which of these relations may be used in top-down design. It is demonstrated that the place bisimulation equivalences may be used for the compositional and history preserving reduction of Petri nets. In addition, we consider all the mentioned equivalences on sequential nets which are a special subclass of general Petri nets modelling sequential systems, where no two actions can happen simultaneously. On this net subclass all pomset equivalences merge with the corresponding interleaving ones, and it allows us to simplify their check.
We have developed an Enterprise Document Management System which supports document management in offices. This system is intended to construct business systems for the next generation. We designed this system with the...
详细信息
We have developed an Enterprise Document Management System which supports document management in offices. This system is intended to construct business systems for the next generation. We designed this system with the aim of handling a document, in the mission critical business application system. The Enterprise Document Management System combines numeric information with documents. Our Enterprise Document Management System adopts a standardized specification called "DMA (Document Management Alliance) 1.0". DMA specifies the document object model and the API (application programming interface). This standard has been proposed by DMA which is one of the task forces of AIIM (Association for Information and Image Management International). AIIM is the international standardization organization of document management. We expand the DMA specification and implement its facilities for managing structured documents such as SGML (standard generalized markup language) and XML (extensible markup language). This system is built on ORDB (object relational database), a database system in order to integrate document with numeric information. Database systems are added to the document management oriental functions, such as full-text retrieval. We are constructing a document oriented business application with the Enterprise Document Management System.
The system FT/sub /spl les// of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the first-order theory of FT/sub ...
详细信息
The system FT/sub /spl les// of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the first-order theory of FT/sub /spl les// and its fragments, both over finite trees and over possibly infinite trees. We prove that the first-order theory of FT/sub /spl les// is undecidable, in contrast to the first-order theory of FT which is well-known to be decidable. We determine the complexity of the entailment problem of FT/sub /spl les// with existential quantification to be PSPACE-complete, by proving its equivalence to the inclusion problem of non-deterministic finite automata. Our reduction from the entailment problem to the inclusion problem is based on a new algorithm that, given an existential formula of FT/sub /spl les//, computes a finite automaton which accepts all its logic consequences.
Whereas it is generally acknowledged that code tangling reduces the quality of software and that aspect-oriented programming (AOP) is a means of addressing this problem, there is — as yet — no clear definition or ch...
详细信息
One of the major difficulties in controlling software development project cost overruns and schedule delays has been developing practical and accurate software cost models. Software development could be modeled as an ...
详细信息
One of the major difficulties in controlling software development project cost overruns and schedule delays has been developing practical and accurate software cost models. Software development could be modeled as an economic production process and we therefore propose a theoretical approach to software cost modeling. Specifically, we present the Minimum Software Cost Model (MSCM), derived from economic production theory and systems optimization. The MSCM model is compared with other widely used software cost models, such as COCOMO and SLIM, on the basis of goodness of fit and quality of estimation using software project data sets available in the literature. Judged by both criteria, the MSCM model is comparable to, if not better than, the SLIM, and significantly better than the rest of the models. In addition, the MSCM model provides some insights about the behavior of software development processes and environment, which could be used to formulate guidelines for better software project management polic es and practices.
暂无评论