|
 |
|
 |
|
|
 |
|  |
|
, Название: Parallel Cryptanalysis Автор: Ruben Niederhagen Издательство: Autoedici?n Год: 2012 Формат: pdf Страниц: 125 Размер: 0,8 mb. Язык: English
Most of today’s cryptographic primitives are based on computations that are hard to perform for a potential attacker but easy to perform for somebody who is in possession of some secret information, the key, that opens a back door in these hard computations and allows them to be solved in a small amount of time. Each cryptographic primitive should be designed such that the cost of an attack grows exponentially with the problem size, while the computations using the secret key only grow polynomially. To estimate the strength of a cryptographic primitive it is important to know how hard it is to perform the computation without knowledge of the secret back door and to get an understanding of how much money or time the attacker has to spend. Usually a cryptographic primitive allows the cryptographer to choose parameters that make an attack harder at the cost of making the computations using the secret key harder as well. Therefore designing a cryptographic primitive imposes the dilemma of choosing the parameters strong enough to resist an attack up to a certain cost while choosing them small enough to allow usage of the primitive in the real world, e.g. on small computing devices like smart phones. |
Разместил: Semka 11-01-2019, 12:19 | Комментарии: 0 | Подробнее
| | | |
 |
|  |
 |
|
 |
|
|
 |
|  |
|
 Название: Multiobjective Analysis and Inference of Phylogenetic Hypotheses by Means of Parallel and Bioinspired Computing Автор: Sergio Santander Jim?nez Издательство: Universidad de Extremadura Год: 2015 Формат: pdf Страниц: 271 Размер: 10,3 mb. Язык: English
One of the most outstanding research topics in the field of bioinformatics is the reconstruction of evolutionary relationships among species. By studying the molecular features of living organisms, phylogenetic inference procedures seek to provide hypotheses about the evolutionary events which led to the current biodiversity in nature. The result of a phylogenetic analysis is given by a treeshaped data structure known as phylogenetic tree, whose topology describes the evolutionary history of the input species by defining ancestor-descendant relationships. The biological quality of the inferred phylogenies is usually evaluated by means of optimality criteria, which allow the modelling of phylogenetic inference as an optimization problem. |
Разместил: Semka 11-01-2019, 12:19 | Комментарии: 0 | Подробнее
| | | |
 |
|  |
 |
|
 |
|
|
 |
|  |
|
 Название: Labs for Foundations of Applied Mathematics Volume III: Modeling with Uncertainty and Data Автор: Various Издательство: Autoedici?n Год: 2016 Формат: pdf Страниц: 239 Размер: 2,1 mb. Язык: English
This lab manual is designed to accompany the textbook Foundations of Applied Mathematics by Humpherys and Jarvis.
Contents:
SQL Intro to pandas State Machines Web Scraping Web Technologies Introduction to Parallel Programming Collective Communication in Parallel Programs MongoDB Principal Component Analysis Latent Semantic Indexing Kalman Filter Projectile Tracking HMM State Estimation English Language HMM Parameter Estimation Russian Alphabet CDHMM Generation Speech Recognition Bayesian Updates Bayesian Search Metropolis Algorithm Ising Model Gibbs Sampling Latent Dirichlet Allocation K-Means Clustering Gaussian Mixture Models Crime Mapping Classification Trees Random Forests K-Nearest Neighbors and Support Vector Machines Image Recognition Tasks |
Разместил: Semka 11-01-2019, 12:19 | Комментарии: 0 | Подробнее
| | | |
 |
|  |
 |
|
 |
|
|
 |
|  |
|
 Название: From Algorithms to Z-Scores: Probabilistic and Statistical Modeling in Computer Science Автор: Norm Matloff Издательство: University of California Год: 2016 Формат: pdf Страниц: 409 Размер: 2,07 mb. Язык: English
The materials here form a textbook for a course in mathematical probability and statistics for computer science students. (It would work fine for general students too.) |
Разместил: Semka 11-01-2019, 12:19 | Комментарии: 0 | Подробнее
| | | |
 |
|  |
 |
|
 |
|
|
 |
|  |
|
 Название: Data-Intensive Text Processing with MapReduce Автор: Jimmy Lin , Chris Dyer Издательство: Morgan & Claypool Publishers Год: 2010 Формат: pdf Страниц: 175 Размер: 1,3 mb. Язык: English
Our world is being revolutionized by data-driven methods: access to large amounts of data has generated new insights and opened exciting new opportunities in commerce, science, and computing applications. Processing the enormous quantities of data necessary for these advances requires large clusters, making distributed computing paradigms more crucial than ever. MapReduce is a programming model for expressing distributed computations on massive datasets and an execution framework for large-scale data processing on clusters of commodity servers. |
Разместил: Semka 11-01-2019, 12:18 | Комментарии: 0 | Подробнее
| | | |
 |
|  |
 |
|
 |
|
|
 |
|  |
|
 Название: Computer Science III Автор: Dr. Chris Bourke Издательство: University of Nebraska–Lincoln Год: 2016 Формат: pdf Страниц: 244 Размер: 1,07 mb. Язык: English
Computers are awesome. The human race has seen more advancements in the last 50 years than in the entire 10,000 years of human history. Technology has transformed the way we live our daily lives, how we interact with each other, and has changed the course of our history. Today, everyone carries smart phones which have more computational power than supercomputers from 20 years ago. Computing has become ubiquitous, the “internet of things” will soon become a reality in which every device will become interconnected and data will be collected and available even about the smallest of minutiae. |
Разместил: Semka 11-01-2019, 12:18 | Комментарии: 0 | Подробнее
| | | |
 |
|  |
 |
|
 |
|
|
 |
|  |
|
 Название: A Brief Introduction to Neural Networks Автор: David Kriesel Издательство: Autoedici?n Год: 2012 Формат: pdf Страниц: 244 Размер: 5,6 mb. Язык: English
"Originally, this work has been prepared in the framework of a seminar of the University of Bonn in Germany, but it has been and will be extended. First and foremost, to provide a comprehensive overview of the subject of neural networks and, second, just to acquire more and more knowledge about LATEX . And who knows – maybe one day this summary will become a real preface!" |
Разместил: Semka 11-01-2019, 12:18 | Комментарии: 0 | Подробнее
| | | |
 |
|  |
 |
|
 |
|
|
 |
|  |
|
 Название: Big CPU, Big Data Автор: Alan Kaminsky Издательство: Autoedici?n Год: 2015 Формат: pdf Страниц: 424 Размер: 11 mb. Язык: English
To study parallel programming with this book, you’ll need the following prerequisite knowledge: Java programming; C programming (for GPU programs); computer organization concepts (CPU, memory, cache, and so on); operating system concepts (threads, thread synchronization). |
Разместил: Semka 11-01-2019, 12:17 | Комментарии: 0 | Подробнее
| | | |
 |
|  |
 |
|
 |
|
|
 |
|  |
|
 Название: Algorithmics and Optimization Автор: Andreas de Vries Издательство: University of Applied Sciences of Hagen Год: 2015 Формат: pdf Страниц: 123 Размер: 1,24 mb. Язык: English
Why mathematics in a book about algorithmics? Algorithms are, in essence, applied mathematics. Even if they deal with apparently “unmathematical” subjects such as manipulating strings or searching objects, mathematics is the basis. To mention just a few examples: the classical algorithmic concept of recursion is very closely related to the principle of mathematical induction; rigorous proofs are needed for establishing the correctness of given algorithms; running times have to be computed. |
Разместил: Semka 11-01-2019, 12:17 | Комментарии: 0 | Подробнее
| | | |
 |
|  |
 |
|
 |
|
|
 |
|  |
|
Название: Алгоритмы на Java Автор: Роберт Седжвик, Кевин Уэйн Издательство: Вильямс Год: 2013 Страниц: 843 Формат: DJVU Размер: 42 Мб Язык: русский
В книге представлено исчерпывающее толкование структур данных и алгоритмов сортировки, поиска, обработки графов и строк, включая пятьдесят алгоритмов, которые должен знать каждый программист. Описываются новые реализации алгоритмов на Java, написанные в ясном модульном стиле, при котором весь код доступен читателю и полностью готов к использованию. В книге изучение алгоритмов на Java ведется в контексте важнейших научных, инженерных и коммерческих приложений. |
Разместил: black 11-01-2019, 12:01 | Комментарии: 0 | Подробнее
| | | |
 |
|  |
br>
|