the authors present a real-time programming language, including concurrency, which could be used in the formal development of embedded systems. the semantics of the language is provided in the form of a time interval ...
详细信息
In view of the diversified characteristics of programming languages used by many current data processing algorithms, we have built an integrated platform based on Javaweb whose methods are developed by multiple progra...
详细信息
Inspired by Approximate Dynamic programming (ADP) and the algebraic Riccatic Equation (ARE), this paper investigate a new optimal tracking control strategy for a class of discrete-time linear quadratic regulation (LQR...
详细信息
ISBN:
(纸本)9781467362498;9781467362481
Inspired by Approximate Dynamic programming (ADP) and the algebraic Riccatic Equation (ARE), this paper investigate a new optimal tracking control strategy for a class of discrete-time linear quadratic regulation (LQR) problems with disturbance. First, the optimal tracking problem is converted into designing infinite-horizon optimal regulator for the tracking error dynamics via system transformation. then we compute the optimal tracking control policy, which can be considered as a way to solve the ARE of the well-known discrete-time optimal control problem forward in time. the iterative ADP algorithm via Heuristic Dynamic programming (HDP) technique is introduced to solve the value function of the controlled system. To verify its robustness, disturbance is added to the controlled system. the simulation results show the effectiveness and robustness of the proposed algorithm in this paper.
An approach of automatized object-oriented code refactoring is described that applies lattice-based algebraic structures for type hierarchy representation and optimization. A distinctive feature of these algebraic str...
详细信息
ISBN:
(纸本)9783030500979
An approach of automatized object-oriented code refactoring is described that applies lattice-based algebraic structures for type hierarchy representation and optimization. A distinctive feature of these algebraic structures is their ability to model aggregation not as a relation between two independent sets of types and attributes, but as a relation between two specific types. the property makes it possible to perform a more careful optimization of type hierarchy. the described approach focuses on redundant attributes removal and on the relocation of identical attributes into their common superclasses ("Pull Up Field" technique). In this paper it is demonstrated how the adopted algebraic structures can be extended to model a wide range of type hierarchies. Also, they are shown to be able to perform transformations allowing for external constraints. Such constraints may represent some additional knowledge of the type hierarchy or of the refactoring process itself. the described approach employs only the fundamental ideas of object-oriented programming. Supplemented with language-specific features it may be used as a basis for building intellectual systems that facilitate object-oriented code refactoring.
We present an operational process model for default logicthat allows calculation of the extensions of a theory, and give a prototypical Prolog implementation. then we present an improved approach for realizing the pr...
详细信息
While Computational logic plays an important role in several areas of Computer Science (CS), most educational software developed for teaching logic is not suitable to be used directly in other portions of the CS educa...
详细信息
ISBN:
(纸本)9789898565068
While Computational logic plays an important role in several areas of Computer Science (CS), most educational software developed for teaching logic is not suitable to be used directly in other portions of the CS education domain where the application of logical notions is usually required. In this paper we describe the logic teaching tool TVT based on semantic tableaux that has been developed to help the students to use logic as a formal proof technique in other advanced topics of CS, such as the verification of algorithms, the algorithmic debugging of imperative programs, the formal design of invariants, and the design and derivation of algorithms from logical specifications, which are at the basis of the formal learning of programming techniques and good development of software. We present the design, implementation, and results of the evaluation of this tool by means of several educational experiences during the academic courses 2009/2010 and 2010/2011. From the results of these experiences we conclude that the use of the TVT tool in the current CS teaching can help our students to understand more advanced CS concepts and to clarify the formal process involved in the design and analysis of correct and efficient imperative programs.
Cis-regulatory modules that control developmental gene expression process the regulatory inputs provided by the transcription factors for which they contain specific target sites. A prominent class of cis-regulatory p...
详细信息
this paper describes classification techniques to distinguish hand signs based only on electromyogram signals of a forearm. Relationship between finger gesture and forearm electromyogram is investigated by two signal ...
详细信息
ISBN:
(纸本)9781467369022
this paper describes classification techniques to distinguish hand signs based only on electromyogram signals of a forearm. Relationship between finger gesture and forearm electromyogram is investigated by two signal processing approaches;an empirical thresholding method and meta heuristic method. the former method judges muscle activity according to the criteria experimentally determined in advance, and evaluates activity pattern of muscles. the latter learns the electromyogram characteristics and automatically creates classification algorithm applying genetic programming. Discrimination experiments of typical hand signs are carried out to evaluate the effectiveness of the proposed methods.
the temporal logicprogramming language, "Tokio" can be executed by a resolution of Interval Temporal logic. the resolution consists of three parts, which are: the unification of the temporal variable, reduc...
详细信息
We explore here the application of Gleaner, an Inductive logicprogramming approach to learning in highly-skewed domains, to the Learning Language in logic 2005 biomedical information-extraction challenge task. We cre...
详细信息
We explore here the application of Gleaner, an Inductive logicprogramming approach to learning in highly-skewed domains, to the Learning Language in logic 2005 biomedical information-extraction challenge task. We create and describe a large number of background knowledge predicates suited for this task. We find that Gleaner outperforms standard Aleph theories with respect to recall and that additional linguistic background knowledge improves recall.
暂无评论