Sebanyak 173 item atau buku ditemukan

Functional and Constraint Logic Programming

18th International Workshop, WFLP 2009, Brasilia, Brazil, June 28, 2009, Revised Selected Papers

This book constitutes the thoroughly refereed post-conference proceedings of the 18th International Workshop on Functional and Constraint Logic Programming, WFLP 2009, held in Brasilia, Brazil, in June 2009 as part of RDP 2009, the Federated Conference on Rewriting, Deduction, and Programming. The 9 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 14 initial workshop contributions. The papers cover current research in all areas of functional and constraint logic programming including typical areas of interest, such as foundational issues, language design, implementation, transformation and analysis, software engineering, integration of paradigms, and applications.

This paper presents a taxonomy of some exact, right-to-left, string-matching
algorithms. The taxonomy is based on results obtained by using logic program
transformation over a naive and nondeterministic specification. A derivation of the
search part and some notes about the preprocessing part of each algorithm is
presented. The derivations show several design decisions behind each algorithm
, and allow us to organize the algorithms within a taxonomic tree, giving us a
better ...

Fuzzy Logic Augmentation of Nature-Inspired Optimization Metaheuristics

Theory and Applications

This book describes recent advances on fuzzy logic augmentation of nature-inspired optimization metaheuristics and their application in areas such as intelligent control and robotics, pattern recognition, time series prediction and optimization of complex problems. The book is organized in two main parts, which contain a group of papers around a similar subject. The first part consists of papers with the main theme of theoretical aspects of fuzzy logic augmentation of nature-inspired optimization metaheuristics, which basically consists of papers that propose new optimization algorithms enhanced using fuzzy systems. The second part contains papers with the main theme of application of optimization algorithms, which are basically papers using nature-inspired techniques to achieve optimization of complex optimization problems in diverse areas of application.

Theory and Applications Oscar Castillo, Patricia Melin. Table 12 Simulation
results for the sum squared function Bat algorithm Fuzzy Bat algorithm Number of
bats Best Number of bats Best 30 0.000006 10 0.00899885 The results of the
tests of the Sum Squared function between the original method and the proposed
one taking the best result of 30 experiments for each method are shown in Table
12.

Field-Programmable Logic and Applications

5th International Workshop, FPL '95, Oxford, United Kingdom, August 29 - September 1, 1995. Proceedings

This volume constitutes the proceedings of the Fifth International Workshop on Field-Programmable Logic and Its Applications, FPL '95, held in Oxford, UK in August/September 1995. The volume presents 46 full revised papers carefully selected by the program committee from a large number and wide range of submissions. The papers document the progress achieved since the predecessor conference (see LNCS 849). They are organized in sections on architectures, platforms, tools, arithmetic and signal processing, embedded systems and other applications, and reconfigurable design and models.

The REDOC III algorithm for data ciphering is a potential replacement for DES.
This paper looks at ways of customising the algorithm to increase security without
reducing ciphering speed. Many valuable modifications are possible if
reconfigurable hardware is used.

Logic and Theory of Algorithms

4th Conference on Computability in Europe, CiE 2008 Athens, Greece, June 15-20, 2008, Proceedings

This book constitutes the refereed proceedings of the 4th International Conference on Computability in Europe, CiE 2008, held in Athens, Greece, in June 2008. The 36 revised full papers presented together with 25 invited tutorials and lectures were carefully reviewed and selected from 108 submissions. Among them are papers of 6 special sessions entitled algorithms in the history of mathematics, formalising mathematics and extracting algorithms from proofs, higher-type recursion and applications, algorithmic game theory, quantum algorithms and complexity, and biology and computation.

We study the satisfiability problem for LTLACK and related decidability problem.
The key result is an algorithm which recognizes theorems of LTLACK (so we
show that LTLACK is decidable), which, as a consequence, also solves the
satisfiability problem. Technique is based on verification of validity for special
normal reduced forms of rules in models of double exponential in the size of rules
. Keywords: linear temporal logic, multi-agent logics,hybrid logics, re- lational
Kripke-Hintikka ...

Logic Program Synthesis from Incomplete Information

Program synthesis is a solution to the software crisis. If we had a program that develops correct programs from specifications, then program validation and maintenance would disappear from the software life-cycle, and one could focus on the more creative tasks of specification elaboration, validation, and maintenance, because replay of program development would be less costly. This monograph describes a novel approach to Inductive Logic Programming (ILP), which cross-fertilizes logic programming and machine learning. Aiming at the synthesis of recursive logic programs only, and this from incomplete information, we take a software engineering approach that is more appropriate than a pure artificial intelligence approach. This book is suitable as a secondary text for graduate level courses in software engineering and artificial intelligence, and as a reference for practitioners of program synthesis.

Logic Algorithm 4-1: Logic Algorithm 4-2. Logic Algorithm 4-3: Logic Algorithm 5-
1: Logic Algorithm 5-2. Logic Algorithm 5-3: Logic Algorithm 5-4: Logic Algorithm
5-5: Logic Algorithm 5-6. Logic Algorithm 5-7: Logic Algorithm 5-8: Logic
Algorithm 5-9: Logic Algorithm 5-10: Logic Algorithm 5-11: Logic Algorithm 5-12:
Logic Algorithm 5-13: Logic Algorithm 5-14: Logic Algorithm 5-15: Logic
Algorithm 5-16: Logic Algorithm 5-17: Logic Algorithm 5-18: Logic Algorithm 5-19:
Logic Algorithm ...

The Nature of Computation: Logic, Algorithms, Applications

9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013, Proceedings

This book constitutes the refereed proceedings of the 9th Conference on Computability in Europe, CiE 2013, held in Milan, Italy, in July 2013. The 48 revised papers presented together with 1 invited lecture and 2 tutorials were carefully reviewed and selected with an acceptance rate of under 31,7%. Both the conference series and the association promote the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences such as physics and biology, and also including the promotion of related non-scientific fields such as philosophy and history of computing.

9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013
, Proceedings Paola Bonizzoni, Vasco Brattka, Benedikt Löwe. Analytic Root
Clustering: A Complete Algorithm Using Soft Zero Tests⋆ Chee Yap1,⋆⋆,
Michael Sagraloff2, and Vikram Sharma3 1 Courant Institute of Mathematical
Sciences, New York University, New York, NY 10012, U.S.A. ...

Logic, Automata, and Algorithms

In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation; methods for low-rank matrix approximations; hybrid methods based on a combination of iterative procedures and best operator approximation; and methods for information compression and filtering under condition that a filter model should satisfy restrictions associated with causality and different types of memory. As a result, the book represents a blend of new methods in general computational analysis, and specific, but also generic, techniques for study of systems theory ant its particular branches, such as optimal filtering and information compression. - Best operator approximation, - Non-Lagrange interpolation, - Generic Karhunen-Loeve transform - Generalised low-rank matrix approximation - Optimal data compression - Optimal nonlinear filtering

The needs of modern technology have therefore prompted an intensive study of
the general relationships governing this class, in order to develop methods of
analysis and of optimal synthesis of these dynamical systems. 2. The continuing
progress in science and technology, particularly in computers, increasingly poses
questions such as: What can a machine “do” and what is it incapable of “doing”?
Could a machine perform any algorithm? In principle, could a machine do
something ...

Genetic Algorithms and Fuzzy Logic Systems

Soft Computing Perspectives

Ever since fuzzy logic was introduced by Lotfi Zadeh in the mid-sixties and genetic algorithms by John Holland in the early seventies, these two fields widely been subjects of academic research the world over. During the last few years, they have been experiencing extremely rapid growth in the industrial world, where they have been shown to be very effective in solving real-world problems. These two substantial fields, together with neurocomputing techniques, are recognized as major parts of soft computing: a set of computing technologies already riding the waves of the next century to produce the human-centered intelligent systems of tomorrow; the collection of papers presented in this book shows the way. The book also contains an extensive bibliography on fuzzy logic and genetic algorithms.

AN EVOLUTIONARY ALGORITHM FOR FUZZY CONTROLLER SYNTHESIS
AND OPTIMIZATION BASED ON SGS-THOMSON'S W.A.R.P. FUZZY
PROCESSOR RINALDO POLUZZI, GIAN GUIDO RIZZOTTO C.A.S.A. Group,
SGS-Thomson Microelectronics, Via Olivetti 2 1-20041 Agrate. Brianza, Milano,
Italy E-mail: {rinaldo . poluzzi , gianguido . rizzotto}<8st . com ANDREA G. B.
TETTAMANZI Dipartimento di Scienze dell'Informazione, Universitd degli Studi di
Milano, Via Comelico ...

Logic Minimization Algorithms for VLSI Synthesis

The roots of the project which culminates with the writing of this book can be traced to the work on logic synthesis started in 1979 at the IBM Watson Research Center and at University of California, Berkeley. During the preliminary phases of these projects, the impor tance of logic minimization for the synthesis of area and performance effective circuits clearly emerged. In 1980, Richard Newton stirred our interest by pointing out new heuristic algorithms for two-level logic minimization and the potential for improving upon existing approaches. In the summer of 1981, the authors organized and participated in a seminar on logic manipulation at IBM Research. One of the goals of the seminar was to study the literature on logic minimization and to look at heuristic algorithms from a fundamental and comparative point of view. The fruits of this investigation were surprisingly abundant: it was apparent from an initial implementation of recursive logic minimiza tion (ESPRESSO-I) that, if we merged our new results into a two-level minimization program, an important step forward in automatic logic synthesis could result. ESPRESSO-II was born and an APL implemen tation was created in the summer of 1982. The results of preliminary tests on a fairly large set of industrial examples were good enough to justify the publication of our algorithms. It is hoped that the strength and speed of our minimizer warrant its Italian name, which denotes both express delivery and a specially-brewed black coffee.

The proof (omitted) follows from the fact that each cube of F must be orthogonal to
all the cubes of F. This translates directly into the statement that each row of M is
a column cover of M. 3.6 Simplify We now illustrate the use of the unate recursive
paradigm to construct a heuristic minimization algorithm, SIMPLIFY. Even though
this is not one of the algorithms of ESPRESSO-II, we discuss it for illustrative
purposes, and also because it has proven to be an extremely valuable algorithm
in ...

Fuzzy Logic-Based Algorithms for Video De-Interlacing

The ‘Fuzzy Logic’ research group of the Microelectronics Institute of Seville is composed of researchers who have been doing research on fuzzy logic since the beginning of the 1990s. Mainly, this research has been focused on the microel- tronic design of fuzzy logic-based systems using implementation techniques which range from ASICs to FPGAs and DSPs. Another active line was the development of a CAD environment, named Xfuzzy, to ease such design. Several versions of Xfuzzy have been and are being currently developed by the group. The addressed applications had basically belonged to the control ?eld domain. In this sense, s- eral problems without a linear control solution had been studied thoroughly. Some examples are the navigation control of an autonomous mobile robot and the level control of a dosage system. The research group tackles a new activity with the work developed in this book: the application of fuzzy logic to video and image processing. We addressed our interest to problems related to pixel interpolation, with the aim of adapting such interpolation to the local features of the images. Our hypothesis was that measures and decisions to solve image interpolation, which traditionally had been done in a crisp way, could better be done in a fuzzy way. Validation of this general hypothesis has been done speci?cally in the interpolation problem of video de-interlacing. - interlacing is one of the main tasks in video processing.

Algorithm. for. Video. De-Interlacing. Abstract. The ability of fuzzy logic-based
systems for video de-interlacing is ex- plored in this Chapter. Particularly, our
study is focused on how motion-adaptive de-interlacing can be performed by a
fuzzy logic-based system. This Chapter is structured as follows. Firstly, several
motion-adaptive strategies are described in Section 2.1. The starting point of our
study is the algorithm developed by Van de Ville et al. in [6] described in Section
2.2.