1  20
Next
 Washington, D.C. : United States. Dept. of Energy. ; Oak Ridge, Tenn. : distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 2013
 Description
 Book — 3.3 MB : digital, PDF file.
 Summary

The UCLA Plasma Simulation Group is a major partner of the "Community Petascale Project for Accelerator Science and Simulation. This is the final technical report. We include an overall summary, a list of publications and individual progress reports for each years. During the past five years we have made tremendous progress in enhancing the capabilities of OSIRIS and QuickPIC, in developing new algorithms and data structures for PIC codes to run on GPUS and many future core architectures, and in using these codes to model experiments and in making new scientific discoveries. Here we summarize some highlights for which SciDAC was a major contributor.
 Online
 Cham : Springer, 2015.
 Description
 Book — 1 online resource Digital: text file; PDF.
 Summary

 CMPoints on Straight Lines
 Maass Waveforms and LowLying Zeros
 Théorème de Jordan Friable
 On Conjectures of T. Ordowski and Z.W. Sun Concerning Primes and Quadratic Forms
 Large Gaps Between Consecutive Prime Numbers Containing Perfect Powers
 On the Parity of the Number of Small Divisors of n
 Counting Primes in Arithmetic Progressions
 Limit Points of the Sequence of Normalized Differences Between Consecutive Prime Numbers
 Spirals of the Zeta Function I
 Best Possible Densities of Dickson mtuples, as a Consequence of ZhangMaynardTao
 A Note on Helson's Conjecture on Moments of Random Multiplicative Functions
 Large Values of the ZetaFunction on the Critical Line
 A Note on Bessel Twists of LFunctions
 The Sound of Fractal Strings and the Riemann Hypothesis
 Sums of two Squares in Short Intervals
 Infinite Sumsets with Many Representations
 On the Ratio of Consecutive Gaps Between Primes
 Remarks on Fibers of the SumofDivisors Function
 On Amicable Numbers
 Trigonometric Representations of Generalized Dedekind and Hardy Sums via the Discrete Fourier Transform
 On Arithmetic Properties of Products and Shifted Products
 Narrow Progressions in the Primes.
 ICSI (Conference) (9th : 2018 : Shanghai, China)
 Cham, Switzerland : Springer, 2018.
 Description
 Book — 1 online resource (xxiv, 579 pages) : illustrations Digital: text file.PDF.
 Summary

 Multiagent systems. swarm robotics. fuzzy logic approaches. planning and routing problems. recommendation in social media. predication. classification. finding patterns. image enhancement. deep learning. theories and models of swarm intelligence. ant colony optimization. particle swarm optimization. artificial bee colony algorithms. genetic algorithms. differential evolution. fireworks algorithm. bacterial foraging optimization. artificial immune system. hydrologic cycle optimization. other swarmbased optimization algorithms. hybrid optimization algorithms. multiobjective optimization. largescale global optimization. .
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Freeman, Adam, 1972 author.
 [Berkeley, CA] : Apress, 2018.
 Description
 Book — 1 online resource Digital: text file.PDF.
 Summary

 Part 11  Entity Framework Core in Context2  Your First Entity Framework Core Application3  Working with Databases4  SportsStore  A Real (Data) Application5  SportsStore  Storing Data6  SportsStore  Modifying Data7  SportsStore  Expanding the Data Model8  SportsStore  Scaling Up9  SportsStore  Customer Features10  SportsStore  Creating An API Part 211  Working with Entity Framework Core12  Performing Data Operations13  Understanding Migrations14  Creating Data Relationships15  Working with Relationships,
 Part 116  Working with Relationships,
 Part 217  Scaffolding an Existing Database18  Manually Modelling a Database Part 319  Keys20  Querying Data21  Storing Data22  Deleting Data23  Using Database Server Features24  Using Transactions.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Frampton, Michael, author.
 [Berkeley, CA] : Apress, 2018.
 Description
 Book — 1 online resource Digital: text file.PDF.
 Summary

 Chapter 1: The Big Data Stack Overview.
 Chapter 2: Cloud Storage.
 Chapter 3: Apache Brooklyn.
 Chapter 4: Apache Mesos.
 Chapter 5: Stack Storage Options.
 Chapter 6: Processing.
 Chapter 7: Streaming.
 Chapter 8: Frameworks.
 Chapter 9: Visualization.
 Chapter 10: The Big Data Stack..
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Estrada, Raul.
 Berkeley, CA : Apress ; New York : Distributed to the Book trade worldwide by Springer, ©2016.
 Description
 Book — 1 online resource (277 pages) Digital: text file.PDF.
 Summary

 Part 1. Introduction
 Chapter 1. Big Data, Big Problems
 Chapter 2. Big Data, Big Solutions
 Part 2. Playing SMACK
 Chapter 3. The Language: Scala
 Chapter 4. The Model: Akka
 Chapter 5. Storage. Apache Cassandra
 Chapter 6. The View
 Chapter 7. The Manager: Apache Mesos
 Chapter 8. The Broker: Apache Kafka
 Part 3. Improving SMACK
 Chapter 9. Fast Data Patterns
 Chapter 10. Big Data Pipelines
 Chapter 11. Glossary.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
7. Applied number theory [2015]
 Niederreiter, Harald, 1944 author.
 Cham : Springer, 2015.
 Description
 Book — 1 online resource (x, 442 pages) : illustrations (some color) Digital: text file.PDF.
 Summary

 Preface
 1 A Review of Number Theory and Algebra
 2 Cryptography
 3 Coding Theory
 4 QuasiMonte Carlo Methods
 5 Pseudorandom Numbers
 6 Further Applications
 Bibliography
 Index.
8. Classes of directed graphs [2018]
 Cham : Springer, [2018]
 Description
 Book — 1 online resource Digital: text file; PDF.
 Summary

 1. Basic Terminology, Notation and Results (J. BangJensen, G. Gutin).
 2. Tournaments and Semicomplete Digraphs (J. BangJensen, F. Havet).
 3. Acyclic Digraphs (G. Gutin).
 4. Euler Digraphs (M. Wahlstroem).
 5. Planar digraphs (M. Pilipczuk, M. Pilipczuk).
 6. Locally Semicomplete Digraphs and Generalizations (J. BangJensen).
 7. Semicomplete Multipartite Digraphs (A. Yeo).
 8. QuasiTransitive Digraphs and Their Extensions (H. GaleanaSanchez, C. HernandezCruz).
 9. Digraphs of Bounded Width (S. Kreutzer, O. Kwon).
 10. Digraphs Products (R. Hammack).
 11. Miscellaneous Digraph Classes (Y. Guo, M. Surmacs).
 12. Lexicographic Orientation Algorithms (J. Huang). Indices.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Ventura, S. (Sebastian), author.
 Switzerland : Springer, 2016.
 Description
 Book — 1 online resource (xiii, 190 pages) : illustrations (some color) Digital: text file.PDF.
 Summary

 Introduction to Pattern Mining. Quality Measures in Pattern Mining. Introduction to Evolutionary Computation. Pattern Mining with Genetic Algorithms. Genetic Programming in Pattern Mining. Multiobjective Approaches in Pattern Mining. Supervised Local Pattern Mining. Mining Exceptional Relationships Between Patterns. Scalability in Pattern Mining.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
10. Structural pattern recognition with graph edit distance : approximation algorithms and applications [2015]
 Riesen, Kaspar, author.
 Cham : Springer, 2015.
 Description
 Book — 1 online resource (xiii, 158 pages) : illustrations (some color) Digital: text file; PDF.
 Summary

 Part I: Foundations and Applications of Graph Edit Distance
 Introduction and Basic Concepts
 Graph Edit Distance
 Bipartite Graph Edit Distance
 Part II: Recent Developments and Research on Graph Edit Distance
 Improving the Distance Accuracy of Bipartite Graph Edit Distance
 Learning Exact Graph Edit Distance
 Speeding Up Bipartite Graph Edit Distance
 Conclusions and Future Work
 Appendix A: Experimental Evaluation of Sorted Beam Search
 Appendix B: Data Sets.
 Reus, Bernhard, 1965 author.
 Cham : Springer, 2016.
 Description
 Book — 1 online resource (xviii, 348 pages) : illustrations Digital: text file.PDF.
 Summary

 Foreword
 Limits? What Limits?
 Part I Computability
 Problems and Effective Procedures
 The WHILELanguage
 Semantics of WHILE
 Extensions of WHILE
 Programs As Data Objects
 A SelfInterpreter for WHILE
 An Undecidable (Noncomputable) Problem
 More Undecidable Problems
 Selfreferencing Programs
 The ChurchTuring Thesis
 Part II Complexity
 Measuring Time Usage
 Complexity Classes
 Robustness of P
 Hierarchy Theorems
 Famous Problems in P
 Common Problems not Known to be in P
 The OneMillionDollar Question
 How Hard is a Problem?
 Complete Problems
 How to Solve NPcomplete Problems?
 Part III Emerging New Models of Computation
 "going nano"
 Molecular Computing
 Quantum Computing
 Appendix A: Further Reading
 Computability and Complexity Textbooks
 Glossary
 Index.
 MCM (Conference) (5th : 2015 : London, England)
 Cham : Springer, 2015.
 Description
 Book — 1 online resource (xiv, 392 pages) : illustrations Digital: text file.PDF.
 Summary

 A Structural Theory of Rhythm Notation Based on Tree Representations and Term Rewriting
 Renotation from Optical Music Recognition
 Foundations for Reliable and Flexible Interactive Multimedia Scores
 Genetic Algorithms Based on the Principles of Grundgestalt and Developing Variation
 Describing Global Musical Structures by Integer Programming on Musical Patterns
 Improved Iterative Random Walk for FourPart Harmonization
 Location Constraints for RepetitionBased Segmentation of Melodies
 Modeling Musical Structure with Parametric Grammars
 Perfect Balance: A Novel Principle for the Construction of Musical Scales and Meters
 Characteristics of Polyphonic Music Style and Markov Model of PitchClass Intervals
 A CorpusSensitive Algorithm for Automated Tonal Analysis
 Finding Optimal Triadic Transformational Spaces with Dijkstra's Shortest Path Algorithm
 A Probabilistic Approach to Determining Bass Voice Leading in Melodic Harmonisation
 Hypergestures in Complex Time: Creative Performance Between Symbolic and Physical Reality
 Generating Fingerings for Polyphonic Piano Music with a Tabu Search Algorithm
 Logistic Modeling of Note Transitions
 Evaluating Singer Consistency and Uniqueness in Vocal Performances
 A ChangePoint Approach Towards Representing Musical Dynamics
 Structural Similarity Based on TimeSpan SubTrees
 Cross Entropy as a Measure of Musical Contrast
 Symbolic Music Similarity Using Neuronal Periodicity and Dynamic Programming
 Applications of DFT to the Theory of TwentiethCentury Harmony
 Utilizing Computer Programming to Analyze PostTonal Music: Contour Analysis of Four Works for Solo Flute
 A Statistical Approach to the Global Structure of John Cage's Number Piece Five⁵
 Exact Cover Problem in Milton Babbitt's AllPartition Array
 Constructing Geometrical Spaces from Acoustical Representations
 Geometry, Iterated Quantization and Filtered VoiceLeading Spaces
 Using Fundamental Groups and Groupoids of Chord Spaces to Model Voice Leading
 AllInterval Structures
 Unifying Tone System Definitions: Ordering Chromas
 A Categorical Generalization of Klumpenhouwer Networks
 The SpinnenTonnetz: New Musical Dimensions in the 2D Network for Tonal Music Analysis: Using Polarization and Tonal Regions in a Dynamic Environment
 Probabilistic Segmentation of Musical Sequences Using Restricted Boltzmann Machines
 ¿El Caballo Viejo? Latin Genre Recognition with Deep Learning and Spectral Periodicity
 Can a Musical Scale Have 14 Generators?
 On the StepPatterns of Generated Scales That are Not WellFormed
 Triads as Modes within Scales as Modes
 Greek Ethnic Modal Names vs. Alia Musica's Nomenclature.
 MCM (Conference) (6th : 2017 : Mexico City, Mexico)
 Cham, Switzerland : Springer, 2017.
 Description
 Book — 1 online resource (xi, 373 pages) : illustrations Digital: text file.PDF.
 Summary

 PrimalCircular Substitutions. On the Group of Transformations of Classical Types of Seventh Chords. Pairwise WellFormed Modes and Transformations. Homometry in the Dihedral Groups: Lifting Sets from Zn to Dn. A Symmetric Quantum Theory of Modulation in Z20. Almost Difference Sets in Transformational Music Theory. Algebra of Harmony. Developing Software for Dancing Tango in Compas. Using Inharmonic Strings in Musical Instruments. RealTime Compositional Procedures for Mediated SoloistEnsemble Interaction: The Comprovisador. Strange Symmetries. Interval Content vs. DFT. Probing Questions about Keys: Tonal Distributions through the DFT. Abstract Gestures: A Unifying Concept in Mathematical Music Theory. Mathematical Music Theory and the Musical Math Game  Two Creative Ontological Switches. Hamiltonian Graphs as Harmonic Tools. New Investigations in Rhythmic Oddity. Polytopic Graph of Latent Relations: A Multiscale Structure Model for Music Segments. Dynamic Time Warping for Automatic Musical Form Identification in Symbolical Musical Files. Identification and Evolution of Musical Style I: Hierarchical Transition Networks and their Modular Structure. A FuzzyClustering Based Approach for Measuring Similarity Between Melodies. The Evolution of Tango Harmony, 19101960. Determination of Compositional Systems through Systemic Modelling. A Cluster Analysis for Mode Identification in Early Music Genres. Cross Entropy as a Measure of Coherence and Uniqueness. Complementary Collection and Ligeti's Combinatorial Tonality. Probabilistic Generation of Ragtime Music from Classical Melodies. Using Probabilistic Parsers to Support Composition of Salsa Music.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Description
 Book
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
126542  Available 
 Cham : Springer, 2016.
 Description
 Book — 1 online resource (241 pages) Digital: text file.PDF.
 Summary

 Introduction. Multiple Instance Learning. MultiInstance Classification. InstanceBased Classification Methods. BagBased Classification Methods. MultiInstance Regression. Unsupervised Multiple Instance Learning. Data Reduction. Imbalance MultiInstance Data. Multiple Instance Multiple Label Learning.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
16. Lectures on convex optimization [2018]
 Nesterov, I͡U. E., author.
 Second edition.  Cham, Switzerland : Springer, 2018.
 Description
 Book — 1 online resource (xxiii, 589 pages) : illustrations Digital: text file.PDF.
 Summary

 Introduction
 Part I BlackBox Optimization
 1 Nonlinear Optimization
 2 Smooth Convex Optimization
 3 Nonsmooth Convex Optimization
 4 SecondOrder Methods
 Part II Structural Optimization
 5 Polynomialtime InteriorPoint Methods
 6 PrimalDual Model of Objective Function
 7 Optimization in Relative Scale
 Bibliographical Comments
 Appendix A. Solving some Auxiliary Optimization Problems
 References
 Index.
17. Apache HBase primer [2016]
 Vohra, Deepak, author.
 [Berkeley] : Apress, 2016.
 Description
 Book — 1 online resource Digital: text file.PDF.
 Summary

 Section I: Core Concepts 1. Fundamental Characteristics of Apache HBase2. Apache HBase and HDFS3. Application Characteristics for Apache HBase
 Section IIData Model 4. Physical Storage 5. Column Family and a Column Qualifier6. Row Versioning7. Logical Storage
 Section IIIArchitecture 8. Components of HBase Cluster9. Regions10. Finding a row in an HBase table11. Compactions12. RegionServer Failover 13. RegionServer Splits
 Section IVSchema Design 14. Creating Column Families15. Defining the row keys for optimal read performance and Locality
 Section VApache HBase API 16. The HBaseAdmin Class 17. The Get Class18. The HTable Class
 Section VIAdministration19. Using the Shell20. Bulk loading data into Apache HBase.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
18. Apache HBase primer [2016]
 Vohra, Deepak, author.
 [Berkeley] : Apress, 2016.
 Description
 Book — 1 online resource Digital: text file.PDF.
 Summary

 Section I: Core Concepts 1. Fundamental Characteristics of Apache HBase2. Apache HBase and HDFS3. Application Characteristics for Apache HBase
 Section IIData Model 4. Physical Storage 5. Column Family and a Column Qualifier6. Row Versioning7. Logical Storage
 Section IIIArchitecture 8. Components of HBase Cluster9. Regions10. Finding a row in an HBase table11. Compactions12. RegionServer Failover 13. RegionServer Splits
 Section IVSchema Design 14. Creating Column Families15. Defining the row keys for optimal read performance and Locality
 Section VApache HBase API 16. The HBaseAdmin Class 17. The Get Class18. The HTable Class
 Section VIAdministration19. Using the Shell20. Bulk loading data into Apache HBase.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
19. Algebra for cryptologists [2016]
 Meijer, Alko Renzo, author.
 Switzerland : Springer, 2016.
 Description
 Book — 1 online resource (xiv, 301 pages) : illustrations
 Summary

 Prerequisites and Notation. Basic Properties of the Integers. Groups, Rings and Ideals. Applications to Public Key Cryptography. Fields. Properties of Finite Fields. Applications to Stream Ciphers. Boolean Functions. Applications to Block Ciphers. Number Theory in Public Key Cryptography. Where do we go from here?. Probability. .
 (source: Nielsen Book Data)
 2.6 Solving Linear Congruences2.7 The Chinese Remainder Theorem; 2.8 Some NumberTheoretic Functions; 2.8.1 Multiplicative Functions; 2.8.2 The Möbius Function; 2.8.3 Euler's ϕFunction; 2.8.4 The Case n = p ·q; 3 Groups, Rings and Ideals; 3.1 Groups; 3.2 Subgroups; 3.3 The Lattice of Subgroups; 3.4 Cosets; 3.5 Cyclic Groups; 3.6 Fermat's Little Theorem; 3.7 Primality Testing; 3.7.1 Miller's Test; 3.7.2 The MillerRabin Primality Test; 3.8 Rings and Ideals; 4 Applications to Public Key Cryptography; 4.1 Public Key Encryption: The RSA Mechanism; 4.1.1 RSA; 4.1.2 Breaking RSA
(source: Nielsen Book Data)
20. Algebra for cryptologists [2016]
 Meijer, Alko Renzo, author.
 Switzerland : Springer, 2016.
 Description
 Book — 1 online resource (xiv, 301 pages) : illustrations
 Summary

 Prerequisites and Notation. Basic Properties of the Integers. Groups, Rings and Ideals. Applications to Public Key Cryptography. Fields. Properties of Finite Fields. Applications to Stream Ciphers. Boolean Functions. Applications to Block Ciphers. Number Theory in Public Key Cryptography. Where do we go from here?. Probability. .
 (source: Nielsen Book Data)
 2.6 Solving Linear Congruences2.7 The Chinese Remainder Theorem; 2.8 Some NumberTheoretic Functions; 2.8.1 Multiplicative Functions; 2.8.2 The Möbius Function; 2.8.3 Euler's ϕFunction; 2.8.4 The Case n = p ·q; 3 Groups, Rings and Ideals; 3.1 Groups; 3.2 Subgroups; 3.3 The Lattice of Subgroups; 3.4 Cosets; 3.5 Cyclic Groups; 3.6 Fermat's Little Theorem; 3.7 Primality Testing; 3.7.1 Miller's Test; 3.7.2 The MillerRabin Primality Test; 3.8 Rings and Ideals; 4 Applications to Public Key Cryptography; 4.1 Public Key Encryption: The RSA Mechanism; 4.1.1 RSA; 4.1.2 Breaking RSA
(source: Nielsen Book Data)
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.