University computer application foundation

Jonathan A. Dell University of York, UKMany computer applications require microprocessors to reliably interconnect and communicate with other peripherals in order to perform their intended functions.

本書是為高等院校學生編寫的計算機基礎教材。全書共10 章，第1 章介紹了計算機的發展､特點與分類和計算思維的基本概念；第2 章介紹了計算機硬件系統的體系結構以及新型硬件設備的發展等；第3 章介紹了計算機軟件系統的組成以及Windows 7 的主要功能和基本使用方法；第4 章介紹了計算機網絡的基本概念和Internet 的應用等；第5 ～8 章介紹了Office的使用方法，包括Word

This carefully edited book presents an up-to-date state of current research in the use of fuzzy sets and their extensions. It pays particular attention to foundation issues and to their application to

The essential guide to understanding, designing, conducting, and presenting a qualitative research study Qualitative Research: A Guide to Design and Implementation, 5th Edition is filled with practical advice and proven guidance for designing and implementing qualitative research studies, and for communicating findings clearly and effectively. Readers will develop a strong foundation in qualitative research theory and application, including an understanding of data sources, data analysis tools, and the types of qualitative research. This revised Fifth Edition offers an expanded interdisciplinary focus, covering qualitative research in the medical and health professions, the social sciences, education, and the humanities.It also covers new tools and technologies—including discussion of AI in qualitative research—that facilitate the process of conducting, analyzing, and presenting research. Written in reader-friendly terms, Qualitative Research is accessible to both novice and experience

Originating from the authors' own graduate course at the University of North Carolina, this material has been thoroughly tried and tested over many years, making the book perfect for a two-term course or for self-study. It provides a concise introduction that covers all of the measure theory and probability most useful for statisticians, including Lebesgue integration, limit theorems in probability, martingales, and some theory of stochastic processes. Readers can test their understanding of the material through the 300 exercises provided. The book is especially useful for graduate students in statistics and related fields of application (biostatistics, econometrics, finance, meteorology, machine learning, and so on) who want to shore up their mathematical foundation. The authors establish common ground for students of varied interests which will serve as a firm 'take-off point' for them as they specialize in areas that exploit mathematical machinery.

Originating from the authors' own graduate course at the University of North Carolina, this material has been thoroughly tried and tested over many years, making the book perfect for a two-term course or for self-study. It provides a concise introduction that covers all of the measure theory and probability most useful for statisticians, including Lebesgue integration, limit theorems in probability, martingales, and some theory of stochastic processes. Readers can test their understanding of the material through the 300 exercises provided. The book is especially useful for graduate students in statistics and related fields of application (biostatistics, econometrics, finance, meteorology, machine learning, and so on) who want to shore up their mathematical foundation. The authors establish common ground for students of varied interests which will serve as a firm 'take-off point' for them as they specialize in areas that exploit mathematical machinery.

There is a resurgence of applications in which the calculus of variations has direct relevance. In addition to application to solid mechanics and dynamics, it is now being applied in a variety of numerical methods, numerical grid generation, modern physics, various optimization settings and fluid dynamics. Many applications, such as nonlinear optimal control theory applied to continuous systems, have only recently become tractable computationally, with the advent of advanced algorithms and large computer systems. This book reflects the strong connection between calculus of variations and the applications for which variational methods form the fundamental foundation. The mathematical fundamentals of calculus of variations (at least those necessary to pursue applications) is rather compact and is contained in a single chapter of the book. The majority of the text consists of applications of variational calculus for a variety of fields.

Automata theory lies at the foundation of computer science, and is vital to a theoretical understanding of how computers work and what constitutes formal methods. This treatise gives a rigorous account of the topic and illuminates its real meaning by looking at the subject in a variety of ways. The first part of the book is organised around notions of rationality and recognisability. The second part deals with relations between words realised by finite automata, which not only exemplifies the automata theory but also illustrates the variety of its methods and its fields of application. Many exercises are included, ranging from those that test the reader, to those that are technical results, to those that extend ideas presented in the text. Solutions or answers to many of these are included in the book.

Algebraic geometry, central to pure mathematics, has important applications in such fields as engineering, computer science, statistics and computational biology, which exploit the computational algorithms that the theory provides. Users get the full benefit, however, when they know something of the underlying theory, as well as basic procedures and facts. This book is a systematic introduction to the central concepts of algebraic geometry most useful for computation. Written for advanced undergraduate and graduate students in mathematics and researchers in application areas, it focuses on specific examples and restricts development of formalism to what is needed to address these examples. In particular, it introduces the notion of Gröbner bases early on and develops algorithms for almost everything covered. It is based on courses given over the past five years in a large interdisciplinary programme in computational algebraic geometry at Rice University, spanning mathematics, computer

This book discusses recent research in the theoretical foundations of several subjects of importance for the design of hardware, and for computer science in general. The physical technologies of very large scale integration (VLSI) are having major effects on the electronic industry. The potential diversity and complexity of digital systems have begun a revolution in the technologies of digital design, involving the application of concepts and methods to do with algorithms and programming. In return, the problems of VLSI design have led to new subjects becoming of importance in computer science. Topics covered in this volume include: models of VLSI complexity; complexity theory; systolic algorithm design; specification theory; verification theory; design by stepwise refinement and transformations. A thorough literature survey with an exhaustive bibliography is also included. The book has grown from a workshop held at the Centre for Theoretical Computer Science at Leeds University and or

This volume contains survey papers by the invited speakers at the Conference on Semigroup Theory and Its Applications which took place at Tulane University in April, 1994. The authors represent the leading areas of research in semigroup theory and its applications, both to other areas of mathematics and to areas outside mathematics. Included are papers by Gordon Preston surveying Clifford's work on Clifford semigroups and by John Rhodes tracing the influence of Clifford's work on current semigroup theory. Notable among the areas of application are the paper by Jean-Eric Pin on applications of other areas of mathematics to semigroup theory and the paper by the editors on an application of semigroup theory to theoretical computer science and mathematical logic. All workers in semigroup theory will find this volume invaluable.

This book presents a coherent introduction to boundary integral, boundary element and singularity methods for steady and unsteady flow at zero Reynolds number. The focus of the discussion is not only on the theoretical foundation, but also on the practical application and computer implementation. The text is supplemented with a number of examples and unsolved problems, many drawn from the field of particulate creeping flows. The material is selected so that the book may serve both as a reference monograph and as a textbook in a graduate course on fluid mechanics or computational fluid mechanics.

This book presents a coherent introduction to boundary integral, boundary element and singularity methods for steady and unsteady flow at zero Reynolds number. The focus of the discussion is not only on the theoretical foundation, but also on the practical application and computer implementation. The text is supplemented with a number of examples and unsolved problems, many drawn from the field of particulate creeping flows. The material is selected so that the book may serve both as a reference monograph and as a textbook in a graduate course on fluid mechanics or computational fluid mechanics.

This book provides a comprehensive foundation of machine learning. To answer the questions of what to learn, how to learn, what to get from learning, and how to evaluate, as well as what is meant by learning, the book focuses on the fundamental basics of machine learning, its methodology, theory, algorithms, and evaluations, together with some philosophical thinking on comparison between machine learning and human learning for machinery intelligence.The book is organized as follows: Introduction (Chapter 1), Evaluation (Chapter 2), Supervised learning (Chapters 3, 4, and 5), Unsupervised learning (Chapter 6), Representation learning (Chapter 7), Problem decomposition (Chapter 8), Ensemble learning (Chapter 9), Deep learning (Chapter 10), Application (Chapter 11), and Challenges (Chapter 12).The book can be used as a textbook for college, undergraduate, graduate and PhD students majored in computer science, automation, electronic engineering, communication, ect. It can also be used as

Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on al