the proceedings contain 64 papers. the special focus in this conference is on Intelligent Data Engineering and Automated Learning. the topics include: Data streams fusion by frequent correlations mining;web genre clas...
the proceedings contain 64 papers. the special focus in this conference is on Intelligent Data Engineering and Automated Learning. the topics include: Data streams fusion by frequent correlations mining;web genre classification via hierarchical multi-label classification;multi-agent reinforcement learning for control systems: challenges and proposals;optimal filtering for time series classification;managing monotonicity in classification by a pruned random forest;ensemble selection based on discriminant functions in binary classification task;an extension of multi-label binary relevance models based on randomized reference classifier and local fuzzy confusion matrix;fusion of self-organizing maps with different sizes;a particle swarm clustering algorithm with fuzzy weighted step sizes;a bacterial colony algorithm for association rule mining;information retrieval and data forecasting via probabilistic nodes combination;knowledge discovery in enterprise databases for forecasting new product success;deterministic extraction of compact sets of rules for subgroup discovery;variable transformation for granularity change in hierarchical databases in actual data mining solutions;an empirical evaluation of robust Gaussian process models for system identification;throughput analysis of automatic production lines based on simulation methods;study of collective robotic tasks based on the behavioral model of the agent;minimalist artificial eye for autonomous robots and path planning;intelligent automated design of machine components using antipatterns;application of fuzzy logic controller for machine load balancing in discrete manufacturing system;local search based on a local utopia point for the multiobjective travelling salesman problem;a hybrid programming framework for resource-constrained scheduling problems and building an efficient evolutionary algorithm for forex market predictions.
Fractional-order calculus offers flexible computational possibilities that can be applied to control design gaining improvement in control loop performance. this paper deals with design of fractional-order controller ...
详细信息
Fractional-order calculus offers flexible computational possibilities that can be applied to control design gaining improvement in control loop performance. this paper deals with design of fractional-order controller (PI λ D δ ) function block in Automation Studio environment. We provide overview of the tools and methods that were used in the process of function block creation. Created function block will be used for programmable logic controllers (PLC).
To achieve high performance on modern computers, it is vital to map algorithmic parallelism to that inherent in the hardware. From an application developer's perspective, it is also important that code can be main...
详细信息
ISBN:
(纸本)9781479961238
To achieve high performance on modern computers, it is vital to map algorithmic parallelism to that inherent in the hardware. From an application developer's perspective, it is also important that code can be maintained in a portable manner across a range of hardware. Here we present targetDP (target Data Parallel), a lightweight programming layer that allows the abstraction of data parallelism for applications that employ structured grids. A single source code may be used to target boththread level parallelism (TLP) and instruction level parallelism (ILP) on either SIMD multi-core CPUs or GPU-accelerated platforms. targetDP is implemented via standard C preprocessor macros and library functions, can be added to existing applications incrementally, and can be combined with higher-level paradigms such as MPI. We present CPU and GPU performance results for a benchmark taken from the lattice Boltzmann application that motivated this work. these demonstrate not only performance portability, but also the optimisation resulting from the intelligent exposure of ILP.
the proceedings contain 15 papers. the topics discussed include: partial type signatures for Haskell;abstract modular inference systems and solvers;sunroof: a monadic DSL for generating JavaScript;compiling DNA strand...
ISBN:
(纸本)9783319041315
the proceedings contain 15 papers. the topics discussed include: partial type signatures for Haskell;abstract modular inference systems and solvers;sunroof: a monadic DSL for generating JavaScript;compiling DNA strand displacement reactions using a functional programming language;two applications of the ASP-prolog system: decomposable programs and multi-context systems;towards modeling morality computationally withlogicprogramming;a declarative specification of giant number arithmetic;embedding foreign code;on the correctness and efficiency of lock-free expandable tries for tabled logic programs;typelets - a rule-based evaluation model for dynamic, statically typed user interfaces;expand: towards an extensible pandoc system;and generic generic programming.
Modeling, Simulation and Verification Language (MSVL) is a useful formalism for specification and verification of concurrent systems. To make it more practical and easier to use, we extend MSVL with function calls in ...
详细信息
ISBN:
(纸本)9783319117379;9783319117362
Modeling, Simulation and Verification Language (MSVL) is a useful formalism for specification and verification of concurrent systems. To make it more practical and easier to use, we extend MSVL with function calls in this paper. To do so, an approach for function calls similar as in imperative programming languages is presented. Further, the semantics of expressions is redefined and the semantics of new added function call statements is formalized. Moreover, an example is given to illustrate how to use function calls in practice with MSVL.
We propose a framework for reasoning about dynamic Web data, based on probabilistic Answer Set programming (ASP). Our approach, which is prototypically implemented, allows for the annotation of first-order formulas as...
详细信息
ISBN:
(纸本)9783319111131;9783319111124
We propose a framework for reasoning about dynamic Web data, based on probabilistic Answer Set programming (ASP). Our approach, which is prototypically implemented, allows for the annotation of first-order formulas as well as ASP rules and facts with probabilities, and for learning of such weights from examples (parameter estimation). Knowledge as well as examples can be provided incrementally in the form of RDF data streams. Optionally, stream data can be configured to decay over time. With its hybrid combination of various contemporary AI techniques, our framework aims at prevalent challenges in relation to data streams and Linked Data, such as inconsistencies, noisy data, and probabilistic processing rules.
Researchers have attempted to compute a fuel-optimal vehicle trajectory by receiving traffic signal phasing and timing information. this problem, however, is complex when microscopic models are used to compute the obj...
详细信息
ISBN:
(纸本)9781479929146
Researchers have attempted to compute a fuel-optimal vehicle trajectory by receiving traffic signal phasing and timing information. this problem, however, is complex when microscopic models are used to compute the objective function. this paper suggests use of a multi-stage dynamic programming tool that not only provides outputs that are closer to optimum, but are also computationally much faster. It uses a recursive trajectory generation that is similar to least-cost path-finding algorithms that optimizes the upstream profile while comparing discretized downstream cases. Since dynamic programming is faster than traditional computational methods, the algorithm can afford to use microscopic models and thereby be sensitive to a multitude of inputs such as grade, weather etc. Agent-based simulations suggest fuel savings in the range of 19 percent and travel-time savings of 32 percent in the vicinity of intersections. this research also showed potential benefits to vehicles following a vehicle that uses the proposed logic.
We present an illative system I-s of classical higher-order logic with subtyping and basic inductive types. the system I-s allows for direct definitions of partial and general recursive functions, and provides means f...
详细信息
ISBN:
(纸本)9783642370755;9783642370748
We present an illative system I-s of classical higher-order logic with subtyping and basic inductive types. the system I-s allows for direct definitions of partial and general recursive functions, and provides means for handling functions whose termination has not been proven. We give examples of how properties of some recursive functions may be established in our system. In a technical appendix to the paper we prove consistency of I-s. the proof is by model construction. We then use this construction to show conservativity of I-s over classical first-order logic. Conservativity over higher-order logic is conjectured, but not proven.
We present an algebraic theory for a fragment of predicate logic. the fragment has disjunction, existential quantification and equality. It is not an algebraic theory in the classical sense, but rather within a new fr...
详细信息
ISBN:
(纸本)9783642370755;9783642370748
We present an algebraic theory for a fragment of predicate logic. the fragment has disjunction, existential quantification and equality. It is not an algebraic theory in the classical sense, but rather within a new framework that we call 'parameterized algebraic theories'. We demonstrate the relevance of this algebraic presentation to computer science by identifying a programming language in which every type carries a model of the algebraic theory. the result is a simple functional logicprogramming language. We provide a syntax-free representation theorem which places terms in bijection with sieves, a concept from category theory. We study presentation-invariance for general parameterized algebraic theories by providing a theory of clones. We show that parameterized algebraic theories characterize a class of enriched monads.
Long gone are the days when you could use a logic analyser on a CPU to find out what it is executing. Caches, out-of-order memory accesses and especially multi-processing all effectively hide the sequence of instructi...
详细信息
Long gone are the days when you could use a logic analyser on a CPU to find out what it is executing. Caches, out-of-order memory accesses and especially multi-processing all effectively hide the sequence of instructions that the CPU is working on. Traditional debug techniques with breakpoints and single-stepping help, but require interactive sessions at human rates rather than the gigahertz rates of today's processors. To help this situation, many of today's sophisticated processors come with a side-port (e.g. BDM, ETM, Nexus or Aurora) that the CPU can use to communicate what it is doing in real-time, at its full rate. By using a debug probe to capture this stream of information, the activities of the CPU can be traced. this trace data can be post-analysed to determine what the processor did, and even what memory values were processed. the problem is that at gigahertz processing speeds, that's many gigabytes of data every second: what techniques are available to help understand this firehose of data? this trace data is one-dimensional: linear over time. So if a programming bug occurred during the trace capture, it is possible to see the sequence of steps leading up to it. Indeed, it is also possible to work backwards through the data looking for the exact condition that started the bug. the data is also suitable for use in profiling and coverage analysis: how often or whether certain routines were executed, and how long they took - all without instrumenting the code by adding time-wasting in-band profiling code, or by using statistical sampling techniques. Useful as this is, even more information can be gleaned by adding a second dimension: depth. More for optimising code than debugging it, being able to analyse call stacks can give insights into the (perhaps unexpected) way that the code base functions. However, to see code two-dimensionally requires a different view from the traditional source-based one: a graphical view, one that represents the call stack over
暂无评论