Effective C


Book Description

A detailed introduction to the C programming language for experienced programmers. The world runs on code written in the C programming language, yet most schools begin the curriculum with Python or Java. Effective C bridges this gap and brings C into the modern era--covering the modern C17 Standard as well as potential C2x features. With the aid of this instant classic, you'll soon be writing professional, portable, and secure C programs to power robust systems and solve real-world problems. Robert C. Seacord introduces C and the C Standard Library while addressing best practices, common errors, and open debates in the C community. Developed together with other C Standards committee experts, Effective C will teach you how to debug, test, and analyze C programs. You'll benefit from Seacord's concise explanations of C language constructs and behaviors, and from his 40 years of coding experience. You'll learn: How to identify and handle undefined behavior in a C program The range and representations of integers and floating-point values How dynamic memory allocation works and how to use nonstandard functions How to use character encodings and types How to perform I/O with terminals and filesystems using C Standard streams and POSIX file descriptors How to understand the C compiler's translation phases and the role of the preprocessor How to test, debug, and analyze C programs Effective C will teach you how to write professional, secure, and portable C code that will stand the test of time and help strengthen the foundation of the computing world.




Energy-Efficient Area Coverage for Intruder Detection in Sensor Networks


Book Description

This Springer Brief presents recent research results on area coverage for intruder detection from an energy-efficient perspective. These results cover a variety of topics, including environmental surveillance and security monitoring. The authors also provide the background and range of applications for area coverage and elaborate on system models such as the formal definition of area coverage and sensing models. Several chapters focus on energy-efficient intruder detection and intruder trapping under the well-known binary sensing model, along with intruder trapping under the probabilistic sensing model. The brief illustrates efficient algorithms rotate the duty of each sensor to prolong the network lifetime and ensure intruder trapping performance. The brief concludes with future directions of the field. Designed for researchers and professionals working with wireless sensor networks, the brief also provides a wide range of applications which are also valuable for advanced-level students interested in efficiency and networking.





Book Description




Normal Surface Singularities


Book Description

This monograph provides a comprehensive introduction to the theory of complex normal surface singularities, with a special emphasis on connections to low-dimensional topology. In this way, it unites the analytic approach with the more recent topological one, combining their tools and methods. In the first chapters, the book sets out the foundations of the theory of normal surface singularities. This includes a comprehensive presentation of the properties of the link (as an oriented 3-manifold) and of the invariants associated with a resolution, combined with the structure and special properties of the line bundles defined on a resolution. A recurring theme is the comparison of analytic and topological invariants. For example, the Poincaré series of the divisorial filtration is compared to a topological zeta function associated with the resolution graph, and the sheaf cohomologies of the line bundles are compared to the Seiberg–Witten invariants of the link. Equivariant Ehrhart theory is introduced to establish surgery-additivity formulae of these invariants, as well as for the regularization procedures of multivariable series. In addition to recent research, the book also provides expositions of more classical subjects such as the classification of plane and cuspidal curves, Milnor fibrations and smoothing invariants, the local divisor class group, and the Hilbert–Samuel function. It contains a large number of examples of key families of germs: rational, elliptic, weighted homogeneous, superisolated and splice-quotient. It provides concrete computations of the topological invariants of their links (Casson(–Walker) and Seiberg–Witten invariants, Turaev torsion) and of the analytic invariants (geometric genus, Hilbert function of the divisorial filtration, and the analytic semigroup associated with the resolution). The book culminates in a discussion of the topological and analytic lattice cohomologies (as categorifications of the Seiberg–Witten invariant and of the geometric genus respectively) and of the graded roots. Several open problems and conjectures are also formulated. Normal Surface Singularities provides researchers in algebraic and differential geometry, singularity theory, complex analysis, and low-dimensional topology with an invaluable reference on this rich topic, offering a unified presentation of the major results and approaches.




LATIN 2004: Theoretical Informatics


Book Description

This volume contains the proceedings of the Latin American Theoretical Inf- matics (LATIN) conference that was held in Buenos Aires, Argentina, April 5–8, 2004. The LATIN series of symposia was launched in 1992 to foster interactions between the Latin American community and computer scientists around the world. This was the sixth event in the series, following S ̃ ao Paulo, Brazil (1992), Valparaiso, Chile (1995), Campinas, Brazil (1998), Punta del Este, Uruguay (2000), and Cancun, Mexico (2002). The proceedings of these conferences were also published by Springer-Verlag in the Lecture Notes in Computer Science series: Volumes 583, 911, 1380, 1776, and 2286, respectively. Also, as before, we published a selection of the papers in a special issue of a prestigious journal. We received 178 submissions. Each paper was assigned to four program c- mittee members, and 59 papers were selected. This was 80% more than the previous record for the number of submissions. We feel lucky to have been able to build on the solid foundation provided by the increasingly successful previous LATINs. And we are very grateful for the tireless work of Pablo Mart ́ ?nez L ́ opez, the Local Arrangements Chair. Finally, we thank Springer-Verlag for publishing these proceedings in its LNCS series.




Handbook of Elliptic and Hyperelliptic Curve Cryptography


Book Description

The discrete logarithm problem based on elliptic and hyperelliptic curves has gained a lot of popularity as a cryptographic primitive. The main reason is that no subexponential algorithm for computing discrete logarithms on small genus curves is currently available, except in very special cases. Therefore curve-based cryptosystems require much smaller key sizes than RSA to attain the same security level. This makes them particularly attractive for implementations on memory-restricted devices like smart cards and in high-security applications. The Handbook of Elliptic and Hyperelliptic Curve Cryptography introduces the theory and algorithms involved in curve-based cryptography. After a very detailed exposition of the mathematical background, it provides ready-to-implement algorithms for the group operations and computation of pairings. It explores methods for point counting and constructing curves with the complex multiplication method and provides the algorithms in an explicit manner. It also surveys generic methods to compute discrete logarithms and details index calculus methods for hyperelliptic curves. For some special curves the discrete logarithm problem can be transferred to an easier one; the consequences are explained and suggestions for good choices are given. The authors present applications to protocols for discrete-logarithm-based systems (including bilinear structures) and explain the use of elliptic and hyperelliptic curves in factorization and primality proving. Two chapters explore their design and efficient implementations in smart cards. Practical and theoretical aspects of side-channel attacks and countermeasures and a chapter devoted to (pseudo-)random number generation round off the exposition. The broad coverage of all- important areas makes this book a complete handbook of elliptic and hyperelliptic curve cryptography and an invaluable reference to anyone interested in this exciting field.




Mechanics of the Household


Book Description




Nine Mathematical Challenges: An Elucidation


Book Description

This volume stems from the Linde Hall Inaugural Math Symposium, held from February 22–24, 2019, at California Institute of Technology, Pasadena, California. The content isolates and discusses nine mathematical problems, or sets of problems, in a deep way, but starting from scratch. Included among them are the well-known problems of the classification of finite groups, the Navier-Stokes equations, the Birch and Swinnerton-Dyer conjecture, and the continuum hypothesis. The other five problems, also of substantial importance, concern the Lieb–Thirring inequalities, the equidistribution problems in number theory, surface bundles, ramification in covers and curves, and the gap and type problems in Fourier analysis. The problems are explained succinctly, with a discussion of what is known and an elucidation of the outstanding issues. An attempt is made to appeal to a wide audience, both in terms of the field of expertise and the level of the reader.




Automata, Languages and Programming


Book Description

This volume features the refereed proceedings from the 34th International Colloquium on Automata, Languages and Programming, held in Wroclaw, Poland in July 2007. Seventy-six full papers are presented, together with four invited lectures. The papers are grouped into three major tracks covering algorithms, automata, complexity, and games; logic, semantics, and theory of programming; and security and cryptography foundations.