Page 26
Page 26
Finite-state methods and natural language processing ; 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers
This book constitutes the thoroughly refereed post-proceedings of the 5th International Workshop on Finite-State Methods in Natural Language Processing, FSMNLP 2005, held in Helsinki, Finland, September 2005. The book presents 24 revised full papers and seven revised poster papers together with two invited contributions and abstracts of six software demos. Topics include morphology, optimality theory, some special FSM families, weighted FSM algorithms, FSM representations, exploration, ordered structures, and surface parsing.
Finite element methods : Parallel-sparse statics and Eigen-Solutions
FEM, and the associated computer software are widely recognized as some of the most effective tools for solutions of large-scale engineering applications. Efficient equation and eigen-solvers play critical roles in solving these problems. Sparse matrix technologies have evolved and are now mature enough that all popular and commercialized FEM codes have inserted sparse solvers into their software. So far, however, few books include detailed discussion and explanation of sparse equation-solvers and Lanczos domain decomposition (DD) or finite element formulation for parallel computing purposes. The material in Finite Element Methods: Parallel-Sparse Statics and Eigen-Solutions has evolved over the past several years from the author's research work and his graduate courses.
Finite Difference Computing with PDEs : A Modern Software Approach
This easy-to-read book introduces the basics of solving partial differential equations by means of finite difference methods. Unlike many of the traditional academic works on the topic, this book was written for practitioners. Accordingly, it especially addresses: the construction of finite difference schemes, formulation and implementation of algorithms, verification of implementations, analyses of physical behavior as implied by the numerical solutions, and how to apply the methods and software to solve problems in the fields of physics and biology.
Finite Difference Computing with Exponential Decay Models
This text provides a very simple, initial introduction to the complete scientific computing pipeline: models, discretization, algorithms, programming, verification, and visualization. The pedagogical strategy is to use one case study – an ordinary differential equation describing exponential decay processes – to illustrate fundamental concepts in mathematics and computer science. The book is easy to read and only requires a command of one-variable calculus and some very basic knowledge about computer programming. Contrary to similar texts on numerical methods and programming, this text has a much stronger focus on implementation and teaches testing and software engineering in particular.
Federation over the Web ; International Workshop, Dagstuhl Castle, Germany, May 1-6, 2005, Revised Selected Papers
The lives of people all around the world, especially in industrialized nations, continue to be changed by the presence and growth of the Internet. Its in?uence is felt at scales ranging from private lifestyles to national economies, boosting thepaceatwhichmoderninformationandcommunicationtechnologiesin?uence personal choices along with business processes and scienti?c endeavors. In addition to its billions of HTML pages, the Web can now be seen as an open repository of computing resources. These resources provide access to computational services as well as data repositories, through a rapidly growing variety of Web applications and Web services.
Feature Extraction : Foundations and Applications
This book is both a reference for engineers and scientists and a teaching resource, featuring tutorial chapters and research papers on feature extraction. "This book compiles some very promising techniques, coming from an extremely smart collection of researchers, delivering their best ideas in a competitive environment."
Feasibility and Infeasibility in Optimization : Algorithms and Computational Methods
Feasibility and Infeasibility in Optimization is a timely expository book that summarizes the state of the art in both classical and recent algorithms related to feasibility and infeasibility in optimization, with a focus on practical methods. All model forms are covered, including linear, nonlinear, and mixed-integer programs. Connections to related work in constraint programming are shown. Part I of the book addresses algorithms for seeking feasibility quickly, including new methods for the difficult cases of nonlinear and mixed-integer programs. Part II provides algorithms for analyzing infeasibility by isolating minimal infeasible (or maximum feasible) subsets of constraints, or by finding the best repair for the infeasibility. Infeasibility analysis algorithms have arisen primarily over the last two decades, and the book covers these in depth and detail. Part III describes applications in numerous areas outside of direct infeasibility analysis such as finding decision trees for data classification, analyzing protein folding, radiation treatment planning, automated test assembly, etc.
Fault Diagnosis and Tolerance in Cryptography ; 3rd International Workshop, FDTC 2006, Yokohama, Japan, October 10, 2006, Proceedings
The sophistication of the underlying cryptographic algorithms, the high complexity of the implementations, and the easy access and low cost of cryptographic devices resulted in increased concerns regarding the reliability and security of crypto-devices. The effectiveness of side channel attacks on cryptographic devices, like timing and power-based attacks, has been known for some time. Several recent investigations have demonstrated the need to develop methodologies and techniques for designing robust cryptographic systems (both hardware and software) to protect them against both accidental faults and maliciously injected faults with the purpose of extracting the secret key. This trend has been particularly motivated by the fact that the equipment needed to carry out a successful side channel attack based on fault injection is easily accessible at a relatively low cost (for example, laser beam technology), and that the skills needed to use it are quite common.
FastSLAM : A Scalable Method for the Simultaneous Localization and Mapping Problem in Robotics
This monograph describes a new family of algorithms for the simultaneous localization and mapping problem in robotics (SLAM). SLAM addresses the problem of acquiring an environment map with a roving robot, while simultaneously localizing the robot relative to this map. This problem has received enormous attention in the robotics community in the past few years, reaching a peak of popularity on the occasion of the DARPA Grand Challenge in October 2005, which was won by the team headed by the authors. The FastSLAM family of algorithms applies particle filters to the SLAM Problem, which provides new insights into the data association problem that is paramount in SLAM. The FastSLAM-type algorithms have enabled robots to acquire maps of unprecedented size and accuracy, in a number of robot application domains and have been successfully applied in different dynamic environments, including the solution to the problem of people tracking.
Fast, Efficient and Predictable Memory Accesses : Optimization Algorithms for Memory Architecture Aware Compilation
Fast, Efficient and Predictable Memory Accesses presents techniques for designing fast, energy-efficient and timing predictable memory systems. By using a careful combination of compiler optimizations and architectural improvements, we can achieve more than what would be feasible at one of the levels in isolation. The described optimization algorithms achieve the goals of high performance and low energy consumption. In addition to these benefits, the use of scratchpad memories significantly improves the timing predictability of the entire system, leading to tighter worst case execution time bounds (WCET). The WCET is a relevant design parameter for all timing critical systems. In addition, the book covers algorithms to exploit the power down modes of main memories in SDRAM technology, as well as the execute-in-place feature of Flash memories. The final chapter considers the impact of the register file, which is also part of the memory hierarchy.
Fast software encryption ; Vol. 3557 ; 12th International Workshop, FSE 2005, Paris, France, February 21-23, 2005, Revised Selected Papers
The Fast Software Encryption 2005 Workshop was the twelfth in a series of annual workshops on symmetric cryptography, sponsored for the fourth year by the International Association for Cryptologic Research (IACR). The workshop concentratedonallaspectsoffastprimitivesforsymmetriccryptology, including thedesign, cryptanalysisandimplementationofblockandstreamciphersaswell as hash functions and message authentication codes. The ?rst FSE workshop was held in Cambridge in 1993, followed by Leuven in 1994, Cambridge in 1996, Haifain1997, Parisin1998, Romein1999, NewYorkin2000, Yokohamain2001, Leuven in 2002, Lund in 2003, and New Delhi in 2004. This year, a total of 96 submissions were received. After an extensive review by the Program Committee, 30 submissions were accepted.
Fast Motions in Biomechanics and Robotics : Optimization and Feedback Control
In the past decades, much progress has been made in the field of walking robots. The current state of technology makes it possible to create humanoid robots that nearly walk like a human being, climb stairs, or avoid small - stacles. However, the dream of a robot running as fast and as elegantly as a human is still far from becoming reality. Control of such fast motions is still a big technological issue in robotics, and the maximum running speed of contemporary robots is still much smaller than that of human track runners. The conventional control approach that most of these robots are based on does not seem to be suitable to increase the running speeds up to a biological level.
Face Biometrics for Personal Identification : Multi-Sensory Multi-Modal Systems
This book provides an ample coverage of theoretical and experimental state-of-the-art work as well as new trends and directions in the biometrics field. It offers students and software engineers a thorough understanding of how some core low-level building blocks of a multi-biometric system are implemented. While this book covers a range of biometric traits including facial geometry, 3D ear form, fingerprints, vein structure, voice, and gait, its main emphasis is placed on multi-sensory and multi-modal face biometrics algorithms and systems. "Multi-sensory" refers to combining data from two or more biometric sensors, such as synchronized reflectance-based and temperature-based face images. "Multi-modal" biometrics means fusing two or more biometric modalities, like face images and voice timber. The first part addresses new and emerging face biometrics. Emphasis is placed on biometric systems where single sensor and single modality are employed in challenging imaging conditions. The second part on multi-sensory face biometrics deals with the personal identification task in challenging variable illuminations and outdoor operating scenarios by employing visible and thermal sensors. The third part of the book focuses on multi-modal face biometrics by integrating voice, ear, and gait modalities with facial data. The last part presents generic chapters on multi-biometrics fusion methodologies and performance prediction techniques.
Extending the Scalability of Linkage Learning Genetic Algorithms : Theory & Practice
This book aims to gain better understanding of the LLGA in theory and to improve the LLGA's performance in practice. It starts with a survey and classification of the existing genetic linkage learning techniques and describes the steps and approaches taken to tackle the research topics, including using promoters, developing the convergence time model, and adopting subchromosomes. It also provides the experimental results for observation of the linkage learning process as well as for verification of the theoretical models proposed in this study.
Extending the Horizons : Advances in Computing, Optimization, and Decision Technologies
Computer Science and Operations Research continue to have a synergistic relationship and this book represents the results of cross-fertilization between OR/MS and CS/AI. It is this interface of OR/CS that makes possible advances that could not have been achieved in isolation. Taken collectively, these articles are indicative of the state-of-the-art in the interface between OR/MS and CS/AI and of the high caliber of research being conducted by members of the INFORMS Computing Society.
Expert Clouds and Applications ; Proceedings of ICOECA 2021
Features original papers from International Conference on Expert Clouds and Applications (ICOECA 2021), organized by GITAM School of Technology, Bangalore, India during February 18–19, 2021. It covers new research insights on artificial intelligence, big data, cloud computing, sustainability, and knowledge-based expert systems. The book discusses innovative research from all aspects including theoretical, practical, and experimental domains that pertain to the expert systems, sustainable clouds, and artificial intelligence technologies.
Experimental Research in Evolutionary Computation : The New Experimentalism
This book introduces the new experimentalism in evolutionary computation, providing tools to understand algorithms and programs and their interaction with optimization problems. The book develops and applies statistical techniques to analyze and compare modern search heuristics such as evolutionary algorithms and particle swarm optimization. Treating optimization runs as experiments, the author offers methods for solving complex real-world problems that involve optimization via simulation, and he describes successful applications in engineering and industrial control projects.
Experimental and Efficient Algorithms ; 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings
This proceedings volume contains the accepted papers and invited talks p- sented at the 4th International Workshop of E?cient and Experimental Al- rithms (WEA 2005), that was held May 10–13, on Santorini Island, Greece. The WEA events are intended to be an international forum for research on the design, analysis and especially the experimental implementation, evaluation and engineering of algorithms, as well as on combinatorial optimization and its applications. The?rstthreeworkshopsinthisserieswereheldinRiga(2001),MonteVerita (2003) and Rio de Janeiro (2004). Thisvolumecontains3invitedpapersrelatedtocorrespondingkeynotetalks.
Experimental Algorithms ; 7th International Workshop, WEA 2008 Provincetown, MA, USA, May 30-June 1, 2008 Proceedings
The Workshop on Experimental Algorithms, WEA, is intended to be an international forum for research on the experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. The emphasis of the workshop is the use of experimental me- ods to guide the design, analysis, implementation, and evaluation of algorithms, heuristics, and optimization programs. WEA 2008 was held at the Provincetown Inn, Provincetown, MA, USA, on May 30 – June 1, 2008. This was the seventh workshop of the series.
Experimental Algorithms ; 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings
Fostering and disseminating high quality research results focused on the experimental analysis of algorithms the papers are devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, data mining, simulation, cryptography and security, scheduling, searching, sorting, string matching, coding, networking, etc.
