تحسين النتائح
ترتيب حسب
من
الى
الصفحة 1
الصفحة 1
Knowledge graphs and big data processing
This book is part of the LAMBDA Project (Learning, Applying, Multiplying Big Data Analytics), funded by the European Union, GA No. 809965. Data Analytics involves applying algorithmic processes to derive insights.
Java 17 Recipes : A Problem-Solution Approach
Quickly find solutions to dozens of common programming problems encountered while building Java applications, with recipes presented in the popular problem-solution format. Look up the programming problem that you want to resolve. Read the solution. Apply the solution directly in your own code. Problem solved! covers of some of the newest features, APIs, and more such as pattern matching for switch, Restore Always-Strict-Floating-Point-Semantics, enhanced pseudo-random number generators, the vector API, sealed classes, and enhancements in the use of String. Source code for all recipes is available in a dedicated GitHub repository. This must-have reference belongs in your library. You will learn : Look up solutions to everyday problems involving Java SE 17 LTS and other recent releases / Develop Java SE applications using the latest in Java SE technology / Incorporate Java major features introduced in versions 17, 16, and 15 into your code
Comprehensive mathematics for computer scientists 2 : Calculus and ODEs, splines, probability, fourier and wavelet theory, fractals and neural networks, categories and lambda calculus
This second volume of a comprehensive tour through mathematical core subjects for computer scientists completes the ?rst volume in two - gards: Part III ?rst adds topology, di?erential, and integral calculus to the t- ics of sets, graphs, algebra, formal logic, machines, and linear geometry, of volume 1. With this spectrum of fundamentals in mathematical e- cation, young professionals should be able to successfully attack more involved subjects, which may be relevant to the computational sciences. In a second regard, the end of part III and part IV add a selection of more advanced topics. In view of the overwhelming variety of mathematical approaches in the computational sciences, any selection, even the most empirical, requires a methodological justi?cation. Our primary criterion has been the search for harmonization and optimization of thematic - versity and logical coherence. This is why we have, for instance, bundled such seemingly distant subjects as recursive constructions, ordinary d- ferential equations, and fractals under the unifying perspective of c- traction theory.
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.
Magnetic Functions Beyond the Spin-Hamiltonian
Using the spin-Hamiltonian formalism the magnetic parameters are introduced through the components of the Lambda-tensor involving only the matrix elements of the angular momentum operator. The energy levels for a variety of spins are generated and the modeling of the magnetization, the magnetic susceptibility and the heat capacity is done. Theoretical formulae necessary in performing the energy level calculations for a multi-term system are prepared with the help of the irreducible tensor operator approach. The goal of the programming lies in the fact that the entire relevant matrix elements (electron repulsion, crystal field, spin-orbit interaction, orbital-Zeeman, and spin-Zeeman operators) are evaluated in the basis set of free-atom terms. The modeling of the zero-field splitting is done at three levels of sophistication. The spin-Hamiltonian formalism offers simple formulae for the magnetic parameters by evaluating the matrix elements of the angular momentum operator in the basis set of the crystal-field terms. The magnetic functions for dn complexes are modeled for a wide range of the crystal-field strengths.
