In order to improve the usability of the current home monitoring system, increase the storage capacity of historical data and solve the problem of strong system dependence, an embedded gateway design scheme is propose...
详细信息
This paper gives denotational models for three logic programming languages of progressive complexity, adopting the "logic programming without logic" approach. The first language is the control flow kernel of...
详细信息
ISBN:
(纸本)1581132654
This paper gives denotational models for three logic programming languages of progressive complexity, adopting the "logic programming without logic" approach. The first language is the control flow kernel of sequential Prolog, featuring sequential composition and backtracking. A committed-choice concurrent logic language with parallel composition (parallel And) and don't care nondeterminism is studied next. The third language is the core of Warren's basic Andorra model, combining parallel composition and don't care nondeterminism with two forms of don't know nondeterminism (interpreted as sequential and parallel OR) and favoring deterministic over nondeterministic computation. We show that continuations are a valuable tool in the analysis and design of semantic models for both sequential and parallel logic programming. Instead of using mathematical notation, we use the functional programming language Haskell as a metalanguage for our denotational semantics, and employ monads in order to facilitate the transition from one language under study to another.
The detailed stage of structural design has benefited considerably from computer automation of the numerically intensive tasks of structural analysis, optimization and conformance checking using the procedural program...
详细信息
The detailed stage of structural design has benefited considerably from computer automation of the numerically intensive tasks of structural analysis, optimization and conformance checking using the procedural programming approach. Such an approach, however, does not allow for the representation and utilization of heuristic knowledge implicit in previous design solutions, which is often difficult or impossible to represent algorithmically. This paper describes how artificial neural networks can be trained to learn heuristic knowledge from previous design solutions and how this knowledge can then be applied to produce a solution to a similar design problem. Copyright (C) 1996 Civil-Comp Limited and Elsevier science Limited
Information technology for e-governance system could yield great benefits and modernization of the different government sectors. The experience of e-governance system in a number of developed and developing countries ...
详细信息
Polygonal approximation is suitable for expressing ECG signal with a few vertices, and it is possible to reliably detect the fiducial point by emphasizing the feature values of the fiducial point. However, there are d...
详细信息
Aspect-oriented programming makes possible to express changes in a modular way directly at the level of programming language constructs. This is particularly useful in situations that require explicit change manipulat...
详细信息
The paper advances the view that Java language is a computer programming language which is easily learned and utilized according to its character, and then summarizes a learning route about Java language through which...
详细信息
Constraint programming holds many promises for model driven software development (MDSD). Up to now, constraints have only started to appear in MDSD modeling languages, but have not been properly reflected in model tra...
详细信息
ISBN:
(纸本)9783642024078
Constraint programming holds many promises for model driven software development (MDSD). Up to now, constraints have only started to appear in MDSD modeling languages, but have not been properly reflected in model transformation. This paper introduces constraint programming in model transformation, shows how constraint programming integrates with QVT Relations - as a pathway to wide spread use of our approach - and describes the corresponding model transformation engine. In particular, the paper will illustrate the use of constraint programming for the specification of attribute values in target models, and provide a qualitative evaluation of the benefit drawn from constraints integrated with QVT Relations.
The vulnerabilities are found not only in the programming language syntax and core but also in the coding style of the programmer. It is necessary to welcome good coding practice with security in mind for every progra...
详细信息
Multi-table Pivoting Algorithms is a method based on pivoting algorithms for solving linear bi-level programming problems. By combination of tables, the method can also solve similar problems such as linear multi-leve...
详细信息
暂无评论