Refine Results
Sort By
From
To
Page 1
Page 1
Machine Learning in Computer Vision
The goal of this book is to address the use of several important machine learning techniques into computer vision applications. An innovative combination of computer vision and machine learning techniques has the promise of advancing the field of computer vision, which contributes to better understanding of complex real-world applications. The effective usage of machine learning technology in real-world computer vision problems requires understanding the domain of application, abstraction of a learning problem from a given computer vision task, and the selection of appropriate representations for the learnable (input) and learned (internal) entities of the system. In this book, we address all these important aspects from a new perspective: that the key element in the current computer revolution is the use of machine learning to capture the variations in visual appearance, rather than having the designer of the model accomplish this. As a bonus, models learned from large datasets are likely to be more robust and more realistic than the brittle all-design models.
Logics of Specification Languages
Dedicated chapters address : the use of ASM (Abstract State Machines) in the classroom; the Event-B modelling method; a methodological guide to CafeOBJ logic; CASL, the Common Algebraic Specification Language; the Duration Calculus; the logic of the RAISE specification language (RSL); the specification language TLA+; the typed logic of partial functions and the Vienna Development Method (VDM); and Z logic and its applications. Each chapter is self-contained, with references, and symbol and concept indexes. Finally, in a unique feature, the book closes with short commentaries on the specification languages written by researchers closely associated with their original development.
Business process management : Concepts, languages, architectures
Business process management is usually treated from two different perspectives: business administration and computer science. While business administration professionals tend to consider information technology as a subordinate aspect for experts to handle, by contrast computer scientists often consider business goals and organizational regulations as terms that do not deserve much thought but require the appropriate level of abstraction.This textbook is ideally suited for classes on business process management, information systems architecture, and workflow management. It is also valuable for project managers and IT professionals working in business process management.
Boundary value problems, Weyl Functions, and differential operators
This book presents a comprehensive survey of modern operator techniques for boundary value problems and spectral theory, employing abstract boundary mappings and Weyl functions.
Big data analysis of nanoscience bibliometrics, patent, and funding data (2000-2019)
Presents an evaluation of nanotechnologies outputs (academic outputs and patents) and their impact from 2000-2019. The evaluation uses Elsevier’s Scopus (the largest abstract and citation database of peer-reviewed literature), SciVal (a scientific research analysis platform), Funding Institutional (a funding database), and PatentSight (a patent analysis platform). It covers four key topics regarding nanoscience research, including: 1) An overview of nano-related scholarly output, 2) Nanoscience and its contribution to basic science, 3) Nanoscience and its impact on and collaboration with industry partners, and 4) Key factors that promote the development of nanoscience.
Architecting dependable systems III
As software systems become ubiquitous, the issues of dependability become more and more crucial. Given that solutions to these issues must be considered from the very beginning of the design process, it is reasonable that dependability is addressed at the architectural level. This book comes as a result of an effort to bring together the research communities of software architectures and dependability. The papers are organised in topical sections on architectures for dependable services, monitoring and reconfiguration in software architectures, dependability support for software architectures, architectural evaluation, and architectural abstractions for dependability
Applications of Membrane Computing
Membrane computing is a branch of natural computing which investigates computing models abstracted from the structure and functioning of living cells and from their interactions in tissues or higher-order biological structures. The models considered, called membrane systems (P systems), are parallel, distributed computing models, processing multisets of symbols in cell-like compartmental architectures. In many applications membrane systems have considerable advantages – among these are their inherently discrete nature, parallelism, transparency, scalability and nondeterminism.
Applications of evolutionary computing ; EvoWorkshops 2008 : EvoCOMNET, EvoFIN, EvoHOT, EvoIASP, EvoMUSART, EvoNUM, EvoSTOC, and EvoTransLog, Naples, Italy, March 26-28, 2008. Proceedings
This volume presents a careful selection of relevant EC examples combined with a thorough examination of the techniques used in EC. The papers in the volume illustrate the current state of the art in the application of EC and should help and - spire researchers and professionals to develop e?cient EC methods for design and problem solving.
Ant Colony Optimization and Swarm Intelligence ; 6th International Conference, ANTS 2008, Brussels, Belgium, September 22-24, 2008. Proceedings
This book constitutes the refereed proceedings of the 6th International Workshop on Ant Colony Optimization and Swarm Intelligence, ANTS 2008, held in Brussels, Belgium, in September 2008.
Algorithms in Bioinformatics ; 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings
This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms in Bioinformatics, WABI 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 meeting.
Algorithms – ESA 2005 ; 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
This volume contains the 75 contributed papers and the abstracts of the threeinvited lectures presented at the 13th Annual European Symposium on Algo-rithms (ESA 2005), held in Spain, 2005. respectively.Papers were solicited in all areas of algorithmic research, including but notlimited to algorithmic aspects of networks, approximation and on-line algo-rithms, computational biology, computational geometry, computational financeand algorithmic game theory, data structures, database and information re-trieval, external memory algorithms, graph algorithms, graph drawing, machinelearning, mobile computing, pattern matching and data compression, quantumcomputing, and randomized algorithms. The algorithms could be sequential,distributed, or parallel. Submissions were especially encouraged in the area ofmathematical programming and operations research, including combinatorialoptimization, integer programming, polyhedral combinatorics, and semidefiniteprogramming.Each extended abstract was submitted to one of the two tracks.
Agile software engineering
This textbook presents the crucial issues in software engineering using the agile approach to software development - one of the mainstream paradigms for the management of software projects and one that is being applied more and more extensively.
Adapting Proofs-as-Programs : The Curry--Howard Protocol
This book nuds new things to do with an old idea. The proofs-as-programs paradigm constitutes a set of approaches to developing programs from proofs in constructive logic. there is increasingly active research in applying constructive techniques to industrial-scale, complex software engineering problems. Thismonographdetailsseveralimportantadvancesinthisdirectionofpr- tical proofs-as-programs. One of the central themes of the book is a general, abstract framework for developing new systems of program synthesis by adapting proofs-as-programs to new contexts. Framework-oriented approaches that facilitate analogous - proaches to building systems for solving particular problems have been popular and successful. Thesemethodsarehelpful asthey providea formal toolbox that enablesa“roll-your-own”approachtodevelopingsolutions.Itishopedthatour framework will have a similar impact. The framework is demonstrated by example. We will give two novel - plications of proofs-as-programs to large-scale, coarse-grain software engine- ing problems: contractual imperative program synthesis and structured p- gram synthesis.
Abstraction, refinement and proof for probabilistic systems
Probabilistic techniques are increasingly being employed in computer programs and systems because they can increase efficiency in sequential algorithms, enable otherwise nonfunctional distribution applications, and allow quantification of risk and safety in general. This makes operational models of how they work, and logics for reasoning about them, extremely important. Abstraction, Refinement and Proof for Probabilistic Systems presents a rigorous approach to modeling and reasoning about computer systems that incorporate probability. Its foundations lie in traditional Boolean sequential-program logic—but its extension to numeric rather than merely true-or-false judgments takes it much further, into areas such as randomized algorithms, fault tolerance, and, in distributed systems, almost-certain symmetry breaking. The presentation begins with the familiar "assertional" style of program development and continues with increasing specialization: Part I treats probabilistic program logic, including many examples and case studies; Part II sets out the detailed semantics; and Part III applies the approach to advanced material on temporal calculi and two-player games.
Abstract Computing Machines : A Lambda Calculus Perspective
The book addresses ways and means of organizing computations, highlighting the relationship between algorithms and the basic mechanisms and runtime structures necessary to execute them using machines. It completely abstracts from concrete programming languages and machine architectures, taking instead the lambda calculus as the basic programming and program execution model to design various abstract machines for its correct implementation. The emphasis is on fully normalizing machines based on full-fledged beta-reductions as essential prerequisites for symbolic computations that treat functions and variables truly as first-class objects. Their weakly normalizing counterparts are shown to be functional abstract machines that sacrifice the flavors of full beta-reductions for decidedly simpler runtime structures and improved runtime efficiency. Further downgrading of the lambda calculus leads to classical imperative machines that permit side-effecting operations on the runtime environment.
A first course in differential equations with modeling applications
A comprehensive treatment of ordinary differential equations, concisely presenting basic and essential results in a rigorous manner. Including various examples from physics, mechanics, natural sciences, engineering and automatic theory, Differential Equations is a bridge between the abstract theory of differential equations and applied systems theory.
A Concise Introduction to Languages and Machines
This easy-to-follow text provides an accessible introduction to the key topics of formal languages and abstract machines within Computer Science.
25 Years of Model Checking : History, Achievements, Perspectives
Model checking technology is among the foremost applications of logic to computer science and computer engineering. The model checking community has achieved many breakthroughs, bridging the gap between theoretical computer science and hardware and software engineering, and it is reaching out to new challenging areas such as system biology and hybrid systems. Model checking is extensively used in the hardware industry and has also been applied to the verification of many types of software. Model checking has been introduced into computer science and electrical engineering curricula at universities worldwide and has become a universal tool for the analysis of systems.
Biased technical change and economic conservation laws
Makes use of Lie groups to shed new light on the analysis of economic conservation laws. Economic conservation laws are not simply abstract concepts; this book shows that they are tools of empirical analysis that can be applied to such topics as analyses of macro performance and corporate efficiency.
Landscape Performance Modeling Using Rhino and Grasshopper
A guidebook for landscape architects to learn the fundamental practices and use of the computational software Rhino 3D and the plugin Grasshopper for parametric modeling, landscape inventory, and performative analysis. This process visually connects intangible and abstract information with physical and spatial relationships to signify the impact ecological, climate, and cultural factors have on landscape performance and decision making.
