For any N, natural number greater than 1: * if N is odd; N=N*3+1 * if N is even N=N/2 If the new value of N is 1, the cycle ends, else repeats. Collatz says that this cycle, ends always with 1. I'm ……続きを見る
Python for Mathematics introduces readers to effective methods for doing mathematics using the Python programming language. Most programming texts introduce readers to the building blocks of program……続きを見る
The theory of differential identities in associative rings and algebras is the basis of this monograph. Informally, an identical relation involving arbitrary elements in the underlying rings (or alg……続きを見る
Applied Mathematics with Open-source Software: Operational Research Problems with Python and R is aimed at a broad segment of readers who wish to learn how to use open-source software to solve probl……続きを見る
This introductory textbook covers all the mathematical concepts necessary for a computing degree, limiting coverage only to the material needed for the fundamentals of computing rather than delving ……続きを見る
Graphs & Digraphs, Seventh Edition masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, the……続きを見る
Introducing state-of-the art computational methods, this book combines detailed explanations with real-world case studies to give a full grounding in the design of engineering materials. This book p……続きを見る
This book introduces readers to a workload-aware methodology for large-scale graph algorithm optimization in graph-computing systems, and proposes several optimization techniques that can enable the……続きを見る
Focusing on the mathematics that lies at the intersection of probability theory, statistical physics, combinatorics and computer science, this volume collects together lecture notes on recent develo……続きを見る
著者：Vincent Traag
出版社： Springer International Publishing
発売日： 2014年05月28日
A persistent problem when finding communities in large complex networks is the so-called resolution limit. This thesis addresses this issue meticulously, and introduces the important notion of resol……続きを見る
Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection grap……続きを見る
Phylogenetic combinatorics is a branch of discrete applied mathematics concerned with the combinatorial description and analysis of phylogenetic trees and related mathematical structures such as phy……続きを見る
This book presents the first cohesive treatment of Information Theoretic Learning (ITL) algorithms to adapt linear or nonlinear learning machines both in supervised or unsupervised paradigms. ITL is……続きを見る
