تحسين النتائح
ترتيب حسب
من
الى
الصفحة 2
الصفحة 2
Artificial intelligence and national security
Analyses the implications of the technical, legal, ethical and privacy challenges as well as challenges for human rights and civil liberties regarding Artificial Intelligence (AI) and National Security. It also offers solutions that can be adopted to mitigate or eradicate these challenges wherever possible. As a general-purpose, dual-use technology, AI can be deployed for both good and evil. The use of AI is increasingly becoming of paramount importance to the governments mission to keep their nations safe. However, the design, development and use of AI for national security poses a wide range of legal, ethical, moral and privacy challenges. This book explores national security uses for Artificial Intelligence (AI) in Western Democracies and its malicious use. This book also investigates the legal, political, ethical, moral, privacy and human rights implications of the national security uses of AI in the aforementioned democracies. It illustrates how AI for national security purposes could threaten most individual fundamental rights, and how the use of AI in digital policing could undermine user human rights and privacy.
Artificial Intelligence : Applications and innovations
It's about the science of artificial intelligence (AI). AI is the study of the design of intelligent computational agents. This book provides a valuable resource for researchers, scientists, professionals, academicians and students dealing with the new challenges and advances in the areas of AI and innovations. This book also covers a wide range of applications of machine learning such as fire detection, structural health and pollution monitoring and control. Provides insight into prospective research and application areas related to industry and technology / Discusses industry- based inputs on success stories of technology adoption / Discusses technology applications from a research perspective in the field of AI / Provides a hands- on approach and case studies for readers of the book to practice and assimilate learning
Artificial general intelligence
This book focused on engineering general intelligence – autonomous, self-reflective, self-improving, commonsensical intelligence.Each author explains a specific aspect of AGI in detail in each chapter, while also investigating the common themes in the work of diverse groups, and posing the big, open questions in this vital area.
An Intuitive Exploration of Artificial Intelligence : Theory and Applications of Deep Learning
This book develops a conceptual understanding of Artificial Intelligence (AI), Deep Learning and Machine Learning in the truest sense of the word. It is an earnest endeavor to unravel what is happening at the algorithmic level, to grasp how applications are being built and to show the long adventurous road in the future.
Algorithms on Trees and Graphs : With Python Code
Introduces graph algorithms on an intuitive basis followed by a detailed exposition using structured pseudocode, with correctness proofs as well as worst-case analyses. Centered around the fundamental issue of graph isomorphism, the content goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. Numerous illustrations, examples, problems, exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference. Furthermore, Python code for all algorithms presented is given in an appendix. Topics and features: Algorithms are first presented on an intuitive basis, followed by a detailed exposition using structured pseudocode / Correctness proofs are given, together with a worst-case analysis of the algorithms / Full implementation of all the algorithms in Python / An extensive chapter is devoted to the algorithmic techniques used in the book / Solutions to all the problems
Algorithms in Invariant Theory
The book of Sturmfels is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. The Groebner bases method is the main tool by which the central problems in invariant theory become amenable to algorithmic solutions.
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 for Sensor and Ad Hoc Networks : Advanced Lectures
Thousands of mini computers (comparable to a stick of chewing gum in size), equipped with sensors, are deployed in some terrain or other. After activation the sensors form a self-organized network and provide data, for example about a forthcoming earthquake. The trend towards wireless communication increasingly affects electronic devices in almost every sphere of life. Conventional wireless networks rely on infrastructure such as base stations; mobile devices interact with these base stations in a client/server fashion. In contrast, current research is focusing on networks that are completely unstructured, but are nevertheless able to communicate (via several hops) with each other, despite the low coverage of their antennas. Such systems are called sensor or ad hoc networks, depending on the point of view and the application. Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area. Sensor networks have been adopted by researchers in many fields: from hardware technology to operating systems, from antenna design to databases, from information theory to networking, from graph theory to computational geometry.
Algorithms and data structures for massive datasets
Learn: Probabilistic sketching data structures for practical problems Choosing the right database engine for your application Evaluating and designing efficient on-disk data structures and algorithms Understanding the algorithmic trade-offs involved in massive-scale systems Deriving basic statistics from streaming data Correctly sampling streaming data Computing percentiles with limited space resources Algorithms and Data Structures for Massive Datasets reveals a toolbox of new methods that are perfect for handling modern big data applications. You'll explore the novel data structures and algorithms that underpin Google, Facebook, and other enterprise applications that work with truly massive amounts of data. These effective techniques can be applied to any discipline, from finance to text analysis. Graphics, illustrations, and hands-on industry examples make complex ideas practical to implement in your projects--and there's no mathematical proofs to puzzle over. Work through this one-of-a-kind guide, and you'll find the sweet spot of saving space without sacrificing your data's accuracy. About the Technology Standard algorithms and data structures may become slow--or fail altogether--when applied to large distributed datasets. Choosing algorithms designed for big data saves time, increases accuracy, and reduces processing cost.
Algorithms – ESA 2007 ; 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings
This book presented submissions in the engineering and applications track. The papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applicat.
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.
Algorithmic methods for railway optimization ; International Dagstuhl workshop, railway optimization 2004, Dagstuhl Castle, Germany, June 20-25, 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers
This state-of-the-art survey features papers that were selected after an open call following the International Dagstuhl Seminar on Algorithmic Methods for Railway Optimization. The second part of the volume constitutes the refereed proceedings of the 4th International Workshop on Algorithmic Methods and Models for Optimization of Railways.
Algorithmic learning theory ; Vol. 3734 ; 16th international conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings
This volume contains the papers presented at the 16th Annual InternationalConference on Algorithmic Learning Theory (ALT 2005), which was held (Republic of Singapore), 2005. The main objective of theconference is to provide an interdisciplinary forum for the discussion of the the-oretical foundations of machine learning as well as their relevance to practicalapplications. The volume includes 30 technical contributions, which were selected by theprogram committee from 98 submissions.
Algorithmic learning theory ; 18th International conference, ALT 2007, Sendai, Japan, October 1-4, 2007, Proceedings
This volume contains the papers presented at the 18th International Conf- ence on Algorithmic Learning Theory.The main objective of the conference was to provide an interdisciplinary forum for high-quality talks with a strong theore- cal background and scientiبهc interchange in areas such as query models, on-line learning, inductive inference, algorithmic forecasting, boosting, support vector machines, kernel methods, complexity and learning, reinforcement learning, - supervised learning and grammatical inference.
Algorithmic Learning in a Random World
This new monograph integrates mathematical theory and revealing experimental work. It demonstrates mathematically the validity of the reliability claimed by conformal predictors when they are applied to independent and identically distributed data, and it confirms experimentally that the accuracy is sufficient for many practical problems. Later chapters generalize these results to models called repetitive structures, which originate in the algorithmic theory of randomness and statistical physics. The approach is flexible enough to incorporate most existing methods of machine learning, including newer methods such as boosting and support vector machines and older methods such as nearest neighbors and the bootstrap.
Algorithmic Aspects of Bioinformatics
Advances in bioinformatics and systems biology require improved computational methods for analyzing data, while progress in molecular biology is in turn influencing the development of computer science methods. This book introduces some key problems in bioinformatics, discusses the models used to formally describe these problems, and analyzes the algorithmic approaches used to solve them. After introducing the basics of molecular biology and algorithmics, Part I explains string algorithms and alignments; Part II details the field of physical mapping and DNA sequencing; and Part III examines the application of algorithmics to the analysis of biological data. Exciting application examples include predicting the spatial structure of proteins, and computing haplotypes from genotype data. This book describes topics in detail and presents formal models in a mathematically precise, yet intuitive manner, with many figures and chapter summaries, detailed derivations, and examples. It is well suited as an introduction into the field of bioinformatics, and will benefit students and lecturers in bioinformatics and algorithmics, while also offering practitioners an update on current research topics.
AI in drug discovery
Constitutes the refereed proceedings of the First international workshop on ai in Drug Discovery, AIDD 2024, held as a part of the 33rd International Conference on Artificial Neural Networks, ICANN 2024, in Lugano, Switzerland, on September 19, 2024. These papers focus on various aspects of the rapidly evolving field of Artificial Intelligence (AI)-driven drug discovery in chemistry, including Big Data and advanced Machine Learning, eXplainable AI (XAI), Chemoinformatics, Use of deep learning to predict molecular properties, Modeling and prediction of chemical reaction data and Generative models.
Advanced Techniques in Knowledge Discovery and Data Mining
This explosion is a result of the growing use of electronic media. But what is data mining (DM)? A Web search using the Google search engine retrieves many (really many) definitions of data mining. We include here a few interesting ones. One of the simpler definitions is: “As the term suggests, data mining is the analysis of data to establish relationships and identify patterns” [1]. It focuses on identifying relations in data. Our next example is more elaborate: An information extraction activity whose goal is to discover hidden facts contained in databases. Using a combination of machine learning, statistical analysis, modeling techniques and database technology, data mining finds patterns and subtle relationships in data and infers rules that allow the prediction of future results. Typical applications include market segmentation, customer profiling, fraud detection, evaluation of retail promotions, and credit risk analysis .
Adaptive Business Intelligence
In the modern information era, managers must recognize the competitive opportunities represented by decision-support tools. Adaptive business intelligence systems combine prediction and optimization techniques to assist decision makers in complex, rapidly changing environments. These systems address the fundamental questions: What is likely to happen in the future? And what is the best decision right now? Adaptive Business Intelligence includes elements of data mining, predictive modeling, forecasting, optimization, and adaptability.
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.
