Listing 1 - 10 of 33 | << page >> |
Sort by
|
Choose an application
This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice's Theorem, Kleene's Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin's Theorem. Each chapter contains classroom-tested material, including examples and exercises. Links between adjacent chapters provide a coherent narrative. Fundamental results are explained lucidly by means of programs written in a simple, high-level imperative programming language, which only requires basic mathematical knowledge. Throughout the book, the impact of the presented results on the entire field of computer science is emphasised. Examples range from program analysis to networking, from database programming to popular games and puzzles. Numerous biographical footnotes about the famous scientists who developed the subject are also included. "Limits of Computation" offers a thorough, yet accessible, introduction to computability and complexity for the computer science student of the 21st century.
Complex analysis --- Computer science --- complexe analyse (wiskunde) --- computers --- algoritmen --- computerkunde
Choose an application
This volume of LNCSE is a collection of the papers from the proceedings of the third workshop on sparse grids and applications. Sparse grids are a popular approach for the numerical treatment of high-dimensional problems. Where classical numerical discretization schemes fail in more than three or four dimensions, sparse grids, in their different guises, are frequently the method of choice, be it spatially adaptive in the hierarchical basis or via the dimensionally adaptive combination technique. Demonstrating once again the importance of this numerical discretization scheme, the selected articles present recent advances on the numerical analysis of sparse grids as well as efficient data structures. The book also discusses a range of applications, including uncertainty quantification and plasma physics.
Complex analysis --- Mathematics --- Computer science --- Computer. Automation --- complexe analyse (wiskunde) --- computers --- informatica --- wiskunde --- algoritmen --- informaticaonderzoek
Choose an application
.
Complex analysis --- Mathematical statistics --- Computer science --- Information systems --- patroonherkenning --- factoranalyse --- complexe analyse (wiskunde) --- computers --- database management --- algoritmen --- computerkunde --- data acquisition
Choose an application
This book serves as a basic reference for those interested in the application of metaheuristics to speech enhancement. The major goal of the book is to explain the basic concepts of optimization methods and their use in heuristic optimization in speech enhancement to scientists, practicing engineers, and academic researchers in speech processing. The authors discuss why it has been a challenging problem for researchers to develop new enhancement algorithms that aid in the quality and intelligibility of degraded speech. They present powerful optimization methods to speech enhancement that can help to solve the noise reduction problems. Readers will be able to understand the fundamentals of speech processing as well as the optimization techniques, how the speech enhancement algorithms are implemented by utilizing optimization methods, and will be given the tools to develop new algorithms. The authors also provide a comprehensive literature survey regarding the topic.
Complex analysis --- Applied physical engineering --- Computer science --- Computer architecture. Operating systems --- Computer. Automation --- Mathematical linguistics --- beeldverwerking --- spraaktechnologie --- complexe analyse (wiskunde) --- algoritmen --- ingenieurswetenschappen --- signaalverwerking
Choose an application
This book sheds new light on topological defects in widely differing systems, using the Velocity-Dependent One-Scale Model to better understand their evolution. Topological defects – cosmic strings, monopoles, domain walls or others - necessarily form at cosmological (and condensed matter) phase transitions. If they are stable and long-lived they will be fossil relics of higher-energy physics. Understanding their behaviour and consequences is a key part of any serious attempt to understand the universe, and this requires modelling their evolution. The velocity-dependent one-scale model is the only fully quantitative model of defect network evolution, and the canonical model in the field. This book provides a review of the model, explaining its physical content and describing its broad range of applicability.
Complex analysis --- Cosmology --- Statistical physics --- Physics --- Applied physical engineering --- Artificial intelligence. Robotics. Simulation. Graphics --- toegepaste wiskunde --- complexe analyse (wiskunde) --- KI (kunstmatige intelligentie) --- fysica --- kosmologie --- AI (artificiële intelligentie)
Choose an application
This book presents practical optimization techniques used in image processing and computer vision problems. Ill-posed problems are introduced and used as examples to show how each type of problem is related to typical image processing and computer vision problems. Unconstrained optimization gives the best solution based on numerical minimization of a single, scalar-valued objective function or cost function. Unconstrained optimization problems have been intensively studied, and many algorithms and tools have been developed to solve them. Most practical optimization problems, however, arise with a set of constraints. Typical examples of constraints include: (i) pre-specified pixel intensity range, (ii) smoothness or correlation with neighboring information, (iii) existence on a certain contour of lines or curves, and (iv) given statistical or spectral characteristics of the solution. Regularized optimization is a special method used to solve a class of constrained optimization problems. The term regularization refers to the transformation of an objective function with constraints into a different objective function, automatically reflecting constraints in the unconstrained minimization process. Because of its simplicity and efficiency, regularized optimization has many application areas, such as image restoration, image reconstruction, optical flow estimation, etc. Optimization plays a major role in a wide variety of theories for image processing and computer vision. Various optimization techniques are used at different levels for these problems, and this volume summarizes and explains these techniques as applied to image processing and computer vision.
Complex analysis --- Mathematics --- Computer science --- Computer. Automation --- DIP (documentimage processing) --- beeldverwerking --- complexe analyse (wiskunde) --- computers --- informatica --- externe fixatie (geneeskunde --- wiskunde --- algoritmen --- computerkunde --- signaalverwerking
Choose an application
This book provides a general overview of multiple instance learning (MIL), defining the framework and covering the central paradigms. The authors discuss the most important algorithms for MIL such as classification, regression and clustering. With a focus on classification, a taxonomy is set and the most relevant proposals are specified. Efficient algorithms are developed to discover relevant information when working with uncertainty. Key representative applications are included. This book carries out a study of the key related fields of distance metrics and alternative hypothesis. Chapters examine new and developing aspects of MIL such as data reduction for multi-instance problems and imbalanced MIL data. Class imbalance for multi-instance problems is defined at the bag level, a type of representation that utilizes ambiguity due to the fact that bag labels are available, but the labels of the individual instances are not defined. Additionally, multiple instance multiple label learning is explored. This learning framework introduces flexibility and ambiguity in the object representation providing a natural formulation for representing complicated objects. Thus, an object is represented by a bag of instances and is allowed to have associated multiple class labels simultaneously. This book is suitable for developers and engineers working to apply MIL techniques to solve a variety of real-world problems. It is also useful for researchers or students seeking a thorough overview of MIL literature, methods, and tools.
Complex analysis --- Computer science --- Artificial intelligence. Robotics. Simulation. Graphics --- Computer. Automation --- DIP (documentimage processing) --- beeldverwerking --- complexe analyse (wiskunde) --- computers --- algoritmen --- KI (kunstmatige intelligentie) --- computerkunde --- robots --- AI (artificiële intelligentie)
Choose an application
The master thesis of Susanne Göbel generates the deep understanding of the Mobile Ambient (MA) calculus that is necessary to use it as a modeling language. Instead of calculus terms a much more convenient representation via MA trees naturally maps to the application area of networks where processes pass hierarchical protection domains like firewalls. The work analyses MA’s function principles and derives a translation into Safe Petri nets. It extends to arbitrary MA processes but finiteness of the net and therefore decidability of reachability is only guaranteed for bounded processes. The construction is polynomial in process size and bounds so that reachability analysis is only PSPACE-complete. Contents Translating Mobile Ambient (MA) Processes into Safe Petri Nets – The Idea Managing Names in the Petri Net Translating Mobile Ambient Processes into Safe Petri Nets – Complete Construction From MA to rMA From rMA to MA-PN Polynomial Construction Using a Substitution Net Target Groups Students of Theoretical Computer Science and Verification Researchers in Verification of Process Calculi The Author Susanne Göbel currently works towards her PhD in Computer Science a t the University of Kaiserslautern. She engages in various research projects to help people understand computational frameworks of theory and practice. While devoting most of her free time to her family she still finds time to work as women councilor and on improving studying and working conditions in the faculty.
Logic --- Complex analysis --- Computer science --- Computer architecture. Operating systems --- Computer. Automation --- complexe analyse (wiskunde) --- mobiele netwerken --- computers --- computerbesturingssystemen --- programmeren (informatica) --- algoritmen --- OS (operating system) --- computerkunde
Choose an application
This reference and handbook describes theory, algorithms and applications of the Global Positioning System (GPS/Glonass/Galileo/Compass). It is primarily based on source-code descriptions of the KSGsoft program developed at the GFZ in Potsdam. The theory and algorithms are extended and verified for a new development of a multi-functional GPS/Galileo software. Besides the concepts such as the unified GPS data processing method, the diagonalisation algorithm, the adaptive Kalman filter, the general ambiguity search criteria, and the algebraic solution of variation equation reported in the first edition, the equivalence theorem of the GPS algorithms, the independent parameterisation method, and the alternative solar radiation model reported in the second edition, the modernisation of the GNSS system, the new development of the theory and algorithms, and research in broad applications are supplemented in this new edition. Mathematically rigorous, the book begins with the introduction, the basics of coordinate and time systems and satellite orbits, as well as GPS observables, and deals with topics such as physical influences, observation equations and their parameterisation, adjustment and filtering, ambiguity resolution, software development and data processing and the determination of perturbed orbits.
Complex analysis --- Geodesy. Cartography --- Geophysics --- Geology. Earth sciences --- Computer science --- Geography --- geodesie --- GIS (geografisch informatiesysteem) --- complexe analyse (wiskunde) --- geografie --- algoritmen --- geologie --- aarde (astronomie) --- geofysica
Choose an application
This book constitutes the refereed proceedings of the International Conference on Applications and Techniques in Information Security, ATIS 2016, held in Cairns, Australia, October 2016. The 10 revised full papers and three short papers presented together with two invited talks were carefully reviewed and selected from 38 submissions. The papers are organized in topical sections on invited speeches; attacks on data security systems; detection of attacks on data security systems; data security; data privacy.
Complex analysis --- Computer science --- Computer architecture. Operating systems --- Computer. Automation --- DES (data encryption standard) --- complexe analyse (wiskunde) --- computers --- informatica --- algoritmen --- computerbeveiliging --- computerkunde
Listing 1 - 10 of 33 | << page >> |
Sort by
|