Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
|||
Books > Computing & IT > General theory of computing > Mathematical theory of computation
This book constitutes the refereed proceedings of the 11th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2021 held in Shenzhen, China, in March 2021.The 47 full papers and 14 short papers were carefully reviewed and selected from 120 submissions. The papers are divided into the following topical sections: theory; algorithms; dynamic multi-objective optimization; constrained multi-objective optimization; multi-modal optimization; many-objective optimization; performance evaluations and empirical studies; EMO and machine learning; surrogate modeling and expensive optimization; MCDM and interactive EMO; and applications.
A comprehensive exploration of the mathematics behind the modeling and rendering of computer graphics scenes Mathematical Structures for Computer Graphics presents an accessible and intuitive approach to the mathematical ideas and techniques necessary for two- and three-dimensional computer graphics. Focusing on the significant mathematical results, the book establishes key algorithms used to build complex graphics scenes. Written for readers with various levels of mathematical background, the book develops a solid foundation for graphics techniques and fills in relevant graphics details often overlooked in the literature. Rather than use a rigid theorem/proof approach, the book provides a flexible discussion that moves from vector geometry through transformations, curve modeling, visibility, and lighting models. Mathematical Structures for Computer Graphics also includes: * Numerous examples of two- and three-dimensional techniques along with numerical calculations * Plenty of mathematical and programming exercises in each chapter, which are designed particularly for graphics tasks * Additional details at the end of each chapter covering historical notes, further calculations, and connected concepts for readers who wish to delve deeper * Unique coverage of topics such as calculations with homogeneous coordinates, computational geometry for polygons, use of barycentric coordinates, various descriptions for curves, and L-system techniques for recursive images Mathematical Structures for Computer Graphics is an excellent textbook for undergraduate courses in computer science, mathematics, and engineering, as well as an ideal reference for practicing engineers, researchers, and professionals in computer graphics fields. The book is also useful for those readers who wish to understand algorithms for producing their own interesting computer images.
This book constitutes selected revised and extended papers from the 10th International Conference on High-Performance Computing Systems and Technologies in Scientific Research, Automation of Control and Production, HPCST 2020, Barnaul, Russia, in May 2020. Due to the COVID-19 pancemic the conference was partly held in virtual mode. The 14 full papers presented in this volume were thoroughly reviewed and selected form 51 submissions. The papers are organized in topical sections on hardware for high-performance computing and its applications; information technologies and computer simulation of physical phenomena.
Build smart applications by implementing real-world artificial intelligence projects Key Features Explore a variety of AI projects with Python Get well-versed with different types of neural networks and popular deep learning algorithms Leverage popular Python deep learning libraries for your AI projects Book DescriptionArtificial Intelligence (AI) is the newest technology that's being employed among varied businesses, industries, and sectors. Python Artificial Intelligence Projects for Beginners demonstrates AI projects in Python, covering modern techniques that make up the world of Artificial Intelligence. This book begins with helping you to build your first prediction model using the popular Python library, scikit-learn. You will understand how to build a classifier using an effective machine learning technique, random forest, and decision trees. With exciting projects on predicting bird species, analyzing student performance data, song genre identification, and spam detection, you will learn the fundamentals and various algorithms and techniques that foster the development of these smart applications. In the concluding chapters, you will also understand deep learning and neural network mechanisms through these projects with the help of the Keras library. By the end of this book, you will be confident in building your own AI projects with Python and be ready to take on more advanced projects as you progress What you will learn Build a prediction model using decision trees and random forest Use neural networks, decision trees, and random forests for classification Detect YouTube comment spam with a bag-of-words and random forests Identify handwritten mathematical symbols with convolutional neural networks Revise the bird species identifier to use images Learn to detect positive and negative sentiment in user reviews Who this book is forPython Artificial Intelligence Projects for Beginners is for Python developers who want to take their first step into the world of Artificial Intelligence using easy-to-follow projects. Basic working knowledge of Python programming is expected so that you're able to play around with code
Complex networks are typically not homogeneous, as they tend to display an array of structures at different scales. A feature that has attracted a lot of research is their modular organisation, i.e., networks may often be considered as being composed of certain building blocks, or modules. In this Element, the authors discuss a number of ways in which this idea of modularity can be conceptualised, focusing specifically on the interplay between modular network structure and dynamics taking place on a network. They discuss, in particular, how modular structure and symmetries may impact on network dynamics and, vice versa, how observations of such dynamics may be used to infer the modular structure. They also revisit several other notions of modularity that have been proposed for complex networks and show how these can be related to and interpreted from the point of view of dynamical processes on networks.
It is the first text that in addition to standard convergence
theory treats other necessary ingredients for successful numerical
simulations of physical systems encountered by every practitioner.
The book is aimed at users with interests ranging from application
modeling to numerical analysis and scientific software development.
It is strongly influenced by the authors research in in space
physics, electrical and optical engineering, applied mathematics,
numerical analysis and professional software development. The
material is based on a year-long graduate course taught at the
University of Arizona since 1989. The book covers the first
two-semesters of a three semester series. The second semester is
based on a semester-long project, while the third semester
requirement consists of a particular methods course in specific
disciplines like computational fluid dynamics, finite element
method in mechanical engineering, computational physics, biology,
chemistry, photonics, etc.
Graduate from Excel to MATLAB(R) to keep up with the evolution of finance data Foundations of Computational Finance with MATLAB(R) is an introductory text for both finance professionals looking to branch out from the spreadsheet, and for programmers who wish to learn more about finance. As financial data grows in volume and complexity, its very nature has changed to the extent that traditional financial calculators and spreadsheet programs are simply no longer enough. Today's analysts need more powerful data solutions with more customization and visualization capabilities, and MATLAB provides all of this and more in an easy-to-learn skillset. This book walks you through the basics, and then shows you how to stretch your new skills to create customized solutions. Part I demonstrates MATLAB's capabilities as they apply to traditional finance concepts, and PART II shows you how to create interactive and reusable code, link with external data sources, communicate graphically, and more. Master MATLAB's basic operations including matrices, arrays, and flexible data structures Learn how to build your own customized solutions when the built-ins just won't do Learn how to handle financial data and industry-specific variables including risk and uncertainty Adopt more accurate modeling practices for portfolios, options, time series, and more MATLAB is an integrated development environment that includes everything you need in one well-designed user interface. Available Toolboxes provide tested algorithms that save you hours of code, and the skills you learn using MATLAB make it easier to learn additional languages if you choose to do so. Financial firms are catching up to universities in MATLAB usage, so this is skill set that will follow you throughout your career. When you're ready to step into the new age of finance, Foundations of Computational Finance with MATLAB provides the expert instruction you need to get started quickly.
This volume presents 38 classic texts in formal epistemology, and strengthens the ties between research into this area of philosophy and its neighbouring intellectual disciplines. The editors provide introductions to five subsections: Bayesian Epistemology, Belief Change, Decision Theory, Interactive Epistemology and Epistemic Logic. 'Formal epistemology' is a term coined in the late 1990s for a new constellation of interests in philosophy, the origins of which are found in earlier works of epistemologists, philosophers of science and logicians. It addresses a growing agenda of problems concerning knowledge, belief, certainty, rationality, deliberation, decision, strategy, action and agent interaction - and it does so using methods from logic, probability, computability, decision and game theory. The volume also includes a thorough index and suggestions for further reading, and thus offers a complete teaching and research package for students as well as research scholars of formal epistemology, philosophy, logic, computer science, theoretical economics and cognitive psychology.
The 14th International Conference on Principles of Distributed Systems (OPODIS 2010) took place during December 14-17, 2010 in Tozeur, Tunisia. It continued a tradition of successful conferences; Chantilly (1997), Amiens (1998), Hanoi (1999), Paris (2000), Mexico (2001), Reims (2002), La Martinique (2003), Gre- ble (2004), Pisa (2005), Bordeaux (2006), Guadeloupe (2007), Luxor (2008) and N?mes (2009). The OPODIS conference constitutes an open forum for the exchange of sta- of-the-art knowledge on distributed computing and systems among researchers from around the world. Following the tradition of the previous events, the p- gram was composed of high-quality contributed papers. The program call for papers looked for original and signi?cant research contributions to the theory, speci?cation, design and implementation of distributed systems, including: - Communication and synchronization protocols - Distributed algorithms, multiprocessor algorithms - Distributed cooperative computing - Embedded systems - Fault-tolerance, reliability, availability - Grid and cluster computing - Location- and context-aware systems - Mobile agents and autonomous robots - Mobile computing and networks - Peer-to-peer systems, overlay networks - Complexity and lower bounds - Performance analysis of distributed systems - Real-time systems - Security issues in distributed computing and systems - Sensor networks: theory and practice - Speci?cation and veri?cation of distributed systems - Testing and experimentation with distributed systems In response to this call for papers, 122 papers were submitted. Each paper was reviewed by at least three reviewers, and judged according to scienti?c and p- sentation quality, originality and relevance to the conference topics.
This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, in Saarbrucken, Germany, in September 2011. The 21 revised full papers presented were carefully reviewed and selected from 40 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, and implementation issues of parameterized and exact algorithms.
This book constitutes the refereed proceedings of the Fourth International Symposium on Algorithmic Game Theory, SAGT 2011, held in Amalfi, Italy, in October 2011. The 26 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 65 submissions. The papers are organized in topical sections on auctions and advertising, quality of solutions, externalities, mechanism design, complexity, network games, pricing, as well as routing games.
This comprehensive text provides a modern and technically precise exposition of the fundamental theory and applications of temporal logics in computer science. Part I presents the basics of discrete transition systems, including constructions and behavioural equivalences. Part II examines the most important temporal logics for transition systems and Part III looks at their expressiveness and complexity. Finally, Part IV describes the main computational methods and decision procedures for model checking and model building - based on tableaux, automata and games - and discusses their relationships. The book contains a wealth of examples and exercises, as well as an extensive annotated bibliography. Thus, the book is not only a solid professional reference for researchers in the field but also a comprehensive graduate textbook that can be used for self-study as well as for teaching courses.
John Vince describes a range of mathematical topics to provide a foundation for an undergraduate course in computer science, starting with a review of number systems and their relevance to digital computers, and finishing with differential and integral calculus. Readers will find that the author's visual approach will greatly improve their understanding as to why certain mathematical structures exist, together with how they are used in real-world applications. Each chapter includes full-colour illustrations to clarify the mathematical descriptions, and in some cases, equations are also coloured to reveal vital algebraic patterns. The numerous worked examples will consolidate comprehension of abstract mathematical concepts. Foundation Mathematics for Computer Science covers number systems, algebra, logic, trigonometry, coordinate systems, determinants, vectors, matrices, geometric matrix transforms, differential and integral calculus, and reveals the names of the mathematicians behind such inventions. During this journey, John Vince touches upon more esoteric topics such as quaternions, octonions, Grassmann algebra, Barycentric coordinates, transfinite sets and prime numbers. Whether you intend to pursue a career in programming, scientific visualisation, systems design, or real-time computing, you should find the author's literary style refreshingly lucid and engaging, and prepare you for more advanced texts.
An essential overview of quantum information
This book constitutes the proceedings of the 5th International Workshop on Algorithms and Computation, WALCOM 2011, held in New Delhi, India, in February 2011. The 20 papers presented in this volume were carefully reviewed and selected from 57 submissions. The papers are grouped in topical sections on approximation algorithms, hardness, algorithm engineering, computational geometry, string algorithms, and graph algorithms.
Advanced Java Programming is a textbook specially designed for undergraduate and postgraduate students of Computer Science, Information Technology, and Computer Applications (BE/BTech/BCA/ME/M.Tech/MCA). Divided into three parts, the book provides an exhaustive coverage of topics taught in advanced Java and other related subjects. It first introduces important language features such as Reflection, JNI, template, AWT and swing, Security etc. The second part primarily focuses on core network programming concepts such as sockets, RMI, Mail, XML-RPC etc. The state-of-the-art concepts such as SOAP, Applet, Servlet, JSP, JDBC, Hibernate, JMS, J2EE, JNDI, CORBA, JSF etc. have been discussed in the last part. The content is enhanced with numerous illustrations, examples, program codes, and screenshots. With its lucid presentation and inclusion of numerous real-world examples and codes, the book will be equally useful for Java professionals.
TheInternationalSymposiumonParameterizedandExactComputation(IPEC, formerly IWPEC) is an international symposium series that covers research in all aspects of parameterized and exact algorithms and complexity. Started in 2004 as a biennial workshop, it became an annual event from 2008. The four previous meetings of the IPEC/IWPEC series were held in Bergen, Norway(2004),Zu ..rich,Switzerland(2006),Victoria,Canada(2008)andCop- hagen, Denmark (2009). On recommendations of the Steering Committee, from this year, the word 'symposium' replaces the word 'workshop' in the name, and it gets a new abbreviation IPEC (rhyming with the old one IWPEC). IPEC 2010 was the ?fth symposium in the series, held in Chennai, India, during December 13-15, 2010. The symposium was co-located with the 30th Foundations of Software Technology and Theoretical Computer Science conf- ence (FSTTCS 2010), a premier theory conference in India. At IPEC 2010, we had three plenary speakers: Anuj Dawar (University of Cambridge, UK), Fedor V. Fomin (University of Bergen, Norway) and Toby Walsh (NICTA and University of New South Wales, Australia). The abstracts accompanyingtheirtalksareincludedintheseproceedings.Wethankthespe- ers for accepting our invitation and for their abstracts. Inresponseto the callforpapers,32papersweresubmitted. Eachsubmission was reviewed by at least four reviewers. The reviewers were either Program Committee members or invited external reviewers. The Program Committee held electronic meetings using the EasyChair system, went through extensive discussions,andselected19ofthesubmissionsforpresentationatthesymposium and inclusion in this LNCS volume.
This book constitutes the refereed proceedings of the 6th International Conference on Language and Automata Theory and Applications, LATA 2012, held in A Coruna, Spain in March 2012. The 41 revised full papers presented together with 3 invited talks and 2 invited tutorials were carefully reviewed and selected from 114 initial submissions. The volume features contributions from both classical theory fields and application areas; e.g. innformatics, systems biology, language technology, artificial intelligence, etc. Among the topics covered are algebraic language theory, automata and logic, systems analysis, systems verifications, computational complexity, decidability, unification, graph transformations, language-based cryptography, and applications in data mining, computational learning, and pattern recognition.
This book constitutes the refereed proceedings of the 17th
International Symposium on Formal Methods, FM 2011, held in
Limerick, Ireland, in June 2011.
The 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) took place in Big Island, Hawaii, USA, December 18-20, 2010. Past COCOA conferences were held in Xi'an, China (2007), Newfoundland, Canada (2008)and Huangshan, China (2009). COCOA2010providedaforumforresearchersworkingintheareasofcom- natorial optimization and its applications. In addition to theoretical results, the conference also included recent works on experimental and applied research of general algorithmic interest. The Program Committee received 108 submissions from more than 23 countries and regions, including Australia, Austria, Canada, China, Denmark, France, Germany, Hong Kong, India, Italy, Japan, Korea, Mexico, New Zealand, Poland, Slovak Republic, Spain, Sweden, Switzerland, Taiwan, UK, USA, Vietnam, etc. Among the 108 submissions, 49 regular papers were selected for presentation at the conference and are included in this volume. Some of these papers will be selected for publication in a special issue of the Journal of Combinatorial Optimization, a special issue of Theoretical Computer Science, a special issue of Optimization Letters, and a special issue of Discrete Mathematics, Algorithms and Applications under the standard refereeing procedure.
These are the proceedings of the 10th International Workshop on Compu- tional Logic in Multi-Agent Systems (CLIMA-X), held September 9-10, 2009 in Hamburg, co-located with MATES. The purpose of the CLIMA workshops is to provide a forum for discussing techniques, based on computational logic, for representing, in a formal way, programming and reasoning about agents and multi-agent systems. Multi-agentsystemsarecommunitiesofproblem-solvingentitiesthatcanp- ceive and act upon their environment in order to achieve both their individual goals and their joint goals. The work on such systems integrates many techno- giesandconceptsfromarti?cialintelligenceandotherareasofcomputingaswell as other disciplines. Over recent years, the agent paradigm gained popularity, due to its applicability to a full spectrum of domains, such as search engines, recommendation systems, educational support, e-procurement, simulation and routing,electroniccommerceandtrade,etc.Computationallogicprovidesawe- de?ned, general, and rigorousframeworkfor studying the syntax, semantics and procedures for the various tasks in individual agents, as well as the interaction between, and integration among, agents in multi-agent systems. It also provides tools, techniques and standards for implementations and environments, for li- ing speci?cations to implementations, and for the veri?cation of properties of individual agents, multi-agent systems and their implementations. These proceedings feature nine regularpapers (from a total of 18 papers s- mitted), as wellas one paper basedonthe invited talk givenby TranCao Son. IntheinvitedpaperbyTranCaoSon,EnricoPontelli,andNgoc-HieuNguyen, "Planning for Multi-Agents Using ASP-Prolog," the action language B is - tended to the multi-agent case. The used technology is based on answer set programming. The contribution by Nils Bulling and Berndt Farwer on "Expressing Prop-
This monograph addresses the state of the art of reduced order methods for modeling and computational reduction of complex parametrized systems, governed by ordinary and/or partial differential equations, with a special emphasis on real time computing techniques and applications in computational mechanics, bioengineering and computer graphics. Several topics are covered, including: design, optimization, and control theory in real-time with applications in engineering; data assimilation, geometry registration, and parameter estimation with special attention to real-time computing in biomedical engineering and computational physics; real-time visualization of physics-based simulations in computer science; the treatment of high-dimensional problems in state space, physical space, or parameter space; the interactions between different model reduction and dimensionality reduction approaches; the development of general error estimation frameworks which take into account both model and discretization effects. This book is primarily addressed to computational scientists interested in computational reduction techniques for large scale differential problems.
The@ first graduate-level textbook to focus on fundamental aspects of numerical methods for stochastic computations, this book describes the class of numerical methods based on generalized polynomial chaos (gPC). These fast, efficient, and accurate methods are an extension of the classical spectral methods of high-dimensional random spaces. Designed to simulate complex systems subject to random inputs, these methods are widely used in many areas of computer science and engineering. The book introduces polynomial approximation theory and probability theory; describes the basic theory of gPC methods through numerical examples and rigorous development; details the procedure for converting stochastic equations into deterministic ones; using both the Galerkin and collocation approaches; and discusses the distinct differences and challenges arising from high-dimensional problems. The last section is devoted to the application of gPC methods to critical areas such as inverse problems and data assimilation. Ideal for use by graduate students and researchers both in the classroom and for self-study, "Numerical Methods for Stochastic Computations" provides the required tools for in-depth research related to stochastic computations.The first graduate-level textbook to focus on the fundamentals of numerical methods for stochastic computations Ideal introduction for graduate courses or self-study Fast, efficient, and accurate numerical methods Polynomial approximation theory and probability theory included Basic gPC methods illustrated through examples
Numerical Methods for Linear Control Systems Design and Analysis is
an interdisciplinary textbook aimed at systematic descriptions and
implementations of numerically-viable algorithms based on
well-established, efficient and stable modern numerical linear
techniques for mathematical problems arising in the design and
analysis of linear control systems both for the first- and
second-order models. MATLAB-based software is included for
implementing all of the major algorithms from the book. |
You may like...
Guide to Computational Modelling for…
Stuart Berry, Val Lowndes, …
Hardcover
AI-based Metaheuristics for Information…
Apoorva S Shastri, Mangal Singh, …
Hardcover
R2,325
Discovery Miles 23 250
Algorithm Design: A Methodological…
Patrick Bosc, Marc Guyomard, …
Paperback
R1,587
Discovery Miles 15 870
PCI Compliance - Understand and…
Branden Williams, James Adamson
Paperback
R1,344
Discovery Miles 13 440
|