作者：
Gondal, GZNUST
Inst Informat Technol New Lalazar Rawalpindi Pakistan
Technical Analysis is a financial risk management practice that has been in use since the advent of stock market and Pattern Recognition is an indivisible part of it. There has been a lot of research in to pattern rec...
详细信息
ISBN:
(纸本)0780382781
Technical Analysis is a financial risk management practice that has been in use since the advent of stock market and Pattern Recognition is an indivisible part of it. There has been a lot of research in to pattern recognition in time series. Existing pattern recognition techniques lacks dynamic extensibility. They do not provide any interfaces in order to include new patterns for recognition dynamically. This limits the operability of these techniques to a particular domain. This research devises a new technique for domain independent pattern recognition while giving sufficient speed and accuracy. This enables it to be used by critical Decision Support Systems for time series of different domains. The system emulates human visual cognition process by implementing the concept of Perceptually Important Points Identification (PIPI). Perceptually Important Points (PEP) represents minimal set of data points which are necessary to form a pattern. For dynamic inclusion of patterns a Pattern definition Language (PDL) has been conceptualized for defining patterns in time series by using declarative programming paradigm. This also results in domain independent pattern recognition without needing any modification.
In this paper we demonstrate several examples of solving challenging algorithmic problems from the Google Code Jam programming contest with the Prolog-based (ECLPSe)-P-i system using declarative techniques: constraint...
详细信息
ISBN:
(纸本)9781450331968
In this paper we demonstrate several examples of solving challenging algorithmic problems from the Google Code Jam programming contest with the Prolog-based (ECLPSe)-P-i system using declarative techniques: constraint logic programming and linear (integer) programming. These problems were designed to be solved by inventing clever algorithms and efficiently implementing them in a conventional imperative programming language, but we present relatively simple declarative programs in (ECLPSe)-P-i that are fast enough to find answers within the time limit imposed by the contest rules. We claim that declarative programming with (ECLPSe)-P-i is better suited for solving certain common kinds of programming problems offered in Google Code Jam than imperative programming. We show this by comparing the mental steps required to come up with both kinds of solutions.
declarative programming is a paradigm that allows programmers to specify what they want to compute, leaving how to compute it to a solver. Our declarative programming language, Dyna, is designed to compactly specify c...
详细信息
ISBN:
(纸本)9781450350716
declarative programming is a paradigm that allows programmers to specify what they want to compute, leaving how to compute it to a solver. Our declarative programming language, Dyna, is designed to compactly specify computations like those that are frequently encountered in machine learning. As a declarative language, Dyna's solver has a large space of (correct) strategies available to it. We describe a reinforcement learning framework for adaptively choosing among these strategies to maximize efficiency for a given workload. Adaptivity in execution is especially important for software that will run under a variety of workloads, where no fixed policy works well. We hope that reinforcement learning will identify good policies reasonably quickly-offloading the burden of writing efficient code from human programmers.
While recent advances in machine learning have yielded impressive results, researchers, practitioners, and even companies are beginning to recognize that true artificial intelligence requires much more sophisticated r...
详细信息
Researchers have used Distributed Constraint Optimization Problems (DCOPs) to model various multi-agent coordination and resource allocation problems. However, existing DCOP algorithms have focused almost exclusively ...
详细信息
ISBN:
(纸本)9781634391313
Researchers have used Distributed Constraint Optimization Problems (DCOPs) to model various multi-agent coordination and resource allocation problems. However, existing DCOP algorithms have focused almost exclusively on imperative programming techniques. This paper explores a new direction, which is to develop algorithms that use declarative programming, specifically logic programming, techniques.
Practical Aspects of declarative Languages : Second International Workshop, Padl 2000, Boston, Ma, Usa, January 2000 : Proceedings by Padl 2000 (2000 : Boston, Mass.); Pontelli, Enrico, 1967-; Santos Costa, Vítor, 19...
详细信息
Practical Aspects of declarative Languages : Second International Workshop, Padl 2000, Boston, Ma, Usa, January 2000 : Proceedings by Padl 2000 (2000 : Boston, Mass.); Pontelli, Enrico, 1967-; Santos Costa, Vítor, 1961-; published by Berlin ; New York : Springer
Modern distributed object systems pass remote parameters based on their runtime type. This design choice limits the expressiveness, readability, and maintainability of distributed applications. While a rich body of ...
详细信息
Modern distributed object systems pass remote parameters based on their runtime type. This design choice limits the expressiveness, readability, and maintainability of distributed applications. While a rich body of research is concerned with middleware extensibility, modern distributed object systems do not offer programming facilities to extend their remote parameter passing semantics. Thus, extending these semantics requires understanding and modifying the underlying middleware implementation.
This thesis addresses these design shortcomings by presenting (i) a declarative and extensible approach to remote parameter passing that decouples parameter passing from parameter types, and (ii) a plugin-based framework, DeXteR, that enables the programmer to extend the native set of remote parameter passing semantics, without having to understand or modify the underlying middleware implementation.
DeXteR treats remote parameter passing as a distributed cross-cutting concern. It uses generative and aspect-oriented techniques, enabling the implementation of different parameter passing semantics as reusable application-level plugins that work with application, system, and third-party library classes. The flexibility and expressiveness of the framework is validated by implementing several non-trivial parameter passing semantics as DeXteR plugins. The material presented in this thesis has been accepted for publication at the ACM/USENIX Middleware 2008 conference.
暂无评论