"This book provides a comprehensive reference for the many different types and methods of compression. Included are a detailed and helpful taxonomy, analysis of most common methods, and discussions ...on the use and comparative benefits of methods and description of ""how to"" use them. Detailed descriptions and explanations of the most well-known and frequently used compression methods are covered in a self-contained fashion, with an accessible style and technical level for specialists and nonspecialists. This 4th edition of this successful volume contains significant additional material as there has been tremendous progress in this field, especially in audio compression such as FLAC, AAC, WavPack, ALS and Dolby AC3, which are all covered. Additional key features include: RAR, Tunstall code, Differential and Hyperspectral Compression, LZMA, H.264, 3D data sets, PDF. This book provides an invaluable reference and guide for all researchers and practitioners needing a comprehensive compilation for a broad range of compression methods."
Real-time object detection is one of the most important research topics in computer vision. As new approaches regarding architecture optimization and training optimization are continually being ...developed, we have found two research topics that have spawned when dealing with these latest state-of-the-art methods. To address the topics, we propose a trainable bag-of-freebies oriented solution. We combine the flexible and efficient training tools with the proposed architecture and the compound scaling method. YOLOv7 surpasses all known object detectors in both speed and accuracy in the range from 5 FPS to 120 FPS and has the highest accuracy 56.8% AP among all known real-time object detectors with 30 FPS or higher on GPU V100. Source code is released in https://github.com/WongKinYiu/yolov7.
Power analysis attacks allow the extraction of secret information from smart cards. Smart cards are used in many applications including banking, mobile communications, pay TV, and electronic ...signatures. In all these applications, the security of the smart cards is of crucial importance. Power Analysis Attacks: Revealing the Secrets of Smart Cardsis the first comprehensive treatment of power analysis attacks and countermeasures. Based on the principle that the only way to defend against power analysis attacks is to understand them, this book explains how power analysis attacks work. Using many examples, it discusses simple and differential power analysis as well as advanced techniques like template attacks. Furthermore, the authors provide an extensive discussion of countermeasures like shuffling, masking, and DPA-resistant logic styles. By analyzing the pros and cons of the different countermeasures, this volume allows practitioners to decide how to protect smart cards.
Chaos-based cryptography has attracted great interest in the past decade. This book gives a thorough description of chaos-based cryptography. Written by leading experts, it covers the basic theories, ...algorithms and applications of chaos-based cryptography.
Algebraic Cryptanalysis acts as a guide for advanced-level students and researchers/practitioners who wish to enter this new field. This text bridges the gap between a course in cryptography, and ...being able to read the cryptanalytic literature. Algebraic Cryptanalysis also covers several chapters on finite field linear algebra and the equicomplexity of matrix operations. This volume introduces several techniques, including linear systems of equations over finite fields, polynomial systems, along with how to adapt the latter to be solved by SAT-solvers. The cipher Keeloq, used in nearly all automobiles with remote key-less entry, is described as a running example, including the manipulation of the equations to enable their solution. Algebraic Cryptanalysis is designed for advanced level students in computer science and mathematics, as a secondary text or reference book. This book is also suitable for practitioners working for intelligence agencies or security companies. Finally, this work is of special interest to algebraic geometers interested in seeking more applied topics.
The book focuses on a recently emerging topic in security. Specifically, the book focuses on physical layer security. Whereas conventional security mechanisms involve cryptography that operates at ...higher layers of the protocol stack, the methods described in this book secure communications at the physical layer. The area of physical layer security is an emerging field of research that has seen an explosion of research in the past few years. This trend is only expected to continue as there is a growing need to secure wireless communications without conventional cryptographic network security protocols. The proposed book will consist of contributions from roughly a dozen of the leading research groups in this emerging area. For the first time, important results will be collected together. Important topics will include the secrecy rate of MIMO wireless systems, practical codes for the dissemination of secrets, and authentication of wireless transmitters using waveform-level properties.
Algorithms for Big Data Bast, Hannah; Korzen, Claudius; Meyer, Ulrich ...
2022, 2023, 2023-01-17, Volume:
13201
eBook
Open access
This open access book surveys the progress in addressing selected challenges related to the growth of big data in combination with increasingly complicated hardware. It emerged from a research ...program established by the German Research Foundation (DFG) as priority program SPP 1736 on Algorithmics for Big Data where researchers from theoretical computer science worked together with application experts in order to tackle problems in domains such as networking, genomics research, and information retrieval. Such domains are unthinkable without substantial hardware and software support, and these systems acquire, process, exchange, and store data at an exponential rate. The chapters of this volume summarize the results of projects realized within the program and survey-related work. This is an open access book.
In the past few years, significant progress has been made on deep neural networks (DNNs) in achieving human-level performance on several long-standing tasks. With the broader deployment of DNNs on ...various applications, the concerns over their safety and trustworthiness have been raised in public, especially after the widely reported fatal incidents involving self-driving cars. Research to address these concerns is particularly active, with a significant number of papers released in the past few years. This survey paper conducts a review of the current research effort into making DNNs safe and trustworthy, by focusing on four aspects: verification, testing, adversarial attack and defence, and interpretability. In total, we survey 202 papers, most of which were published after 2017.
Inspired by a
width
invariant defined on permutations by Guillemot and Marx SODA’14, we introduce the notion of twin-width on graphs and on matrices. Proper minor-closed classes, bounded rank-width ...graphs, map graphs,
K
t
-free unit
d
-dimensional ball graphs, posets with antichains of bounded size, and proper subclasses of dimension-2 posets all have bounded twin-width. On all these classes (except map graphs without geometric embedding) we show how to compute in polynomial time a
sequence of
d
-contractions
, witness that the twin-width is at most
d
. We show that FO model checking, that is deciding if a given first-order formula ϕ evaluates to true for a given binary structure
G
on a domain
D
, is FPT in |ϕ| on classes of bounded twin-width, provided the witness is given. More precisely, being given a
d
-contraction sequence for
G
, our algorithm runs in time
f
(
d
,|ϕ |) · |D| where
f
is a computable but non-elementary function. We also prove that bounded twin-width is preserved under FO interpretations and transductions (allowing operations such as squaring or complementing a graph). This unifies and significantly extends the knowledge on fixed-parameter tractability of FO model checking on non-monotone classes, such as the FPT algorithm on bounded-width posets by Gajarský et al. FOCS’15.
PDF
