tower429的博客

DESIGN AND IMPLEMENTATION OF LATTICE-BASED CRYPTOGRAPHY 1. Introduction 2. Fully Homomorphic Encryption 3. Cryptographic Multilinear Maps 4. Conclusion

Practical Full Resolution Learned Lossless Image Compression。

The power of two samples for Generative Adversarial Networks Sewoong Oh Department of Industrial and Enterprise Systems Engineering University of Illinois at Urbana-Champaign joint work with Giulia Fanti, Ashish Khetan, Zinan Lin

Deep Learning in Steganography and Steganalysis since 2015 Marc CHAUMONT 1 (1) LIRMM, Univ Montpellier, CNRS, Univ N^ımes, Montpellier, France November 2, 2018 Tutorial given at the \Mini - Workshop: Image Signal & Security", Inria Rennes / IRISA. Rennes, France, the 30th of October 2018

Foundations: lattice problems, SIS/LWE and their applications 2 Ring-Based Crypto: NTRU, Ring-SIS/LWE and ideal lattices 3 Practical Implementations: BLISS, NewHope, Frodo, HElib, Λ◦λ, . . . 4 Along the Way: open questions, research directions

From the early days of computing, games have been important testbeds for studying how well machines can do sophisticated decision making. In recent years, machine learning has made dramatic advances with artificial agents reaching superhuman performance in challenge domains like Go, Atari, and some variants of poker. As with their predecessors of chess, checkers, and backgammon, these game domains have driven research by providing sophisticated yet well-defined challenges for artificial intelligence practitioners. We continue this tradition by proposing the game of Hanabi as a new challenge domain with novel problems that arise from its combination of purely cooperative gameplay and imperfect information in a two to five player setting. In particular, we argue that Hanabi elevates reasoning about the beliefs and intentions of other agents to the foreground. We believe developing novel techniques capable of imbuing artificial agents with such theory of mind will not only be crucial for their success in Hanabi, but also in broader collaborative efforts, and especially those with human partners. To facilitate future research, we introduce the open-source Hanabi Learning Environment, propose an experimental framework for the research community to evaluate algorithmic advances, and assess the performance of current state-of-the-art techniques. Keywords: multi-agent learning, challenge paper, reinforcement learning, games, theory of mind, communication, imperfect information, cooperative

现有无监督特征学习算法通常在 RGB 色彩空间进行特征提取，而图像和视频压缩编码标准则广泛采用 YUV 色彩空间。为了利用人类视觉特性和避免色彩空间转换所消耗的计算量，该文提出一种基于稀疏自动编码器 在 YUV 色彩空间进行无监督特征学习的方法。首先在 YUV 空间随机采集图像子块并进行白化处理，然后利用稀 疏自动编码器进行无监督局部特征学习。在预处理阶段，针对 YUV 空间亮度和色度通道相互独立的特性，提出一 种将亮度和色度进行分离的白化措施。最后用学习到的局部特征在大尺寸图像上进行卷积操作从而获得全局特征， 并送入图像分类系统进行性能测试。实验结果表明：只要对亮度分量进行适当的白化处理，在 YUV 空间中的无监 督特征学习就能够获得相当于甚至优于 RGB 空间的彩色图像分类性能。

计算机研究与发展；2014年，全同态加密研究动态与概述。

Using Random Numbers Modeling and Simulation of Biological Systems 21-366B Lecture 2-3 A textbook on probability: G.R. Grimmett and D.R. Stirzaker Probability and Random Processes OXFORD

Part I: Introduction 1. How do we define security for encryption? Arguably the most important step in breaking out of the “build-break-tweak” cycle that Poe’s quote described has been the idea that we can have a mathematically precise definition of security, rather than relying on fuzzy notions, that allow us only to determine with certainty that a system is broken but never have a chance of proving that a system is secure . 2. Perfect security and its limitations: Showing the possibility (and the limitations) of encryptions that are perfectly secure regardless of the attacker’s computational resources. 3. Computational security: Bypassing the above limitations by restricting to computationally efficient attackers. Proofs of19 security by reductions. Part II: Private Key Cryptography • 1. Pseudorandom generators: The basic building block of cryptography, which also provided a new twist on the age-old philosophical and scientific question of the nature of randomness. 2. Pseudorandom functions, permutations, block ciphers: Block ciphers are the working horse of crypto. 3. Authentication and active attacks: Authentication turns out to be as crucial, if not more, to security than secrecy and often a precondition to the latter. We’ll talk about notions such as Message Authentication Codes and Chosen-Ciphertext-Attack secure encryption, as well as real-world examples why these notions are necessary. 4. Hash functions and the “Random Oracle Model”: Hash functions are used all over in crypto, including for verifying integrity, entropy distillation, and many other cases. 5. Building pseudorandom generators from one-way permutations (optional): Justifying our “axiom” of pseudo-random generators by deriving it from a weaker assumption. • Part III: Pubic key encryption 1. Public key cryptography and the obfuscation paradigm: How did Diffie, Hellman, Merkle, Ellis even dare to imagine the possiblity of public key encryption? 2. Constructing public key encryption: Factoring, disc

In the fourth edition of this dictionary many new entries have been added reflecting, in particular, the expanding interest in Bayesian statistics, causality and machine learning. There has also been a comprehensive review and, where thought necessary, subsequent revision of existing entries. The number of biographies of important statisticians has been increased by including many from outside the UK and the USA and by the inclusion of entries for those who have died since the publication of the third edition. But perhaps the most significant addition to this edition is that of a co-author, namely Professor Anders Skrondal.

Taken literally, the title “All of Statistics” is an exaggeration. But in spirit, the title is apt, as the book does cover a much broader range of topics than a typical introductory book on mathematical statistics. This book is for people who want to learn probability and statistics quickly. It is suitable for graduate or advanced undergraduate students in computer science, mathematics, statistics, and related disciplines. The book includes modern topics like nonparametric curve estimation, bootstrapping, and classification, topics that are usually relegated to follow-up courses. The reader is presumed to know calculus and a little linear algebra. No previous knowledge of probability and statistics is required. Statistics, data mining, and machine learning are all concerned with collecting and analyzing data. For some time, statistics research was conducted in statistics departments while data mining and machine learning research was conducted in computer science departments. Statisticians thought that computer scientists were reinventing the wheel. Computer scientists thought that statistical theory didn’t apply to their problems.

Traditionally, Fourier analysis has been focused the analysis of func- tions in terms of linear phase functions such as the sequence n ! e(n) = e2in. In recent years, though, applications have arisen - particularly in connection with problems involving linear patterns such as arithmetic progressions - in which it has been necessary to go beyond the linear phases, replacing them to higher order functions such as quadratic phases n ! e(n2). This has given rise to the sub- ject of quadratic Fourier analysis, and more generally to higher order Fourier analysis.

Statistical distributions and models are commonly used in many applied ar- eas such as economics, engineering, social, health, and biological sciences. In this era of inexpensive and faster personal computers, practitioners of statistics and scientists in various disciplines have no di±culty in ¯tting a probability model to describe the distribution of a real-life data set. Indeed, statistical distribu- tions are used to model a wide range of practical problems, from modeling the size grade distribution of onions to modeling global positioning data. Successful applications of these probability models require a thorough understanding of the theory and familiarity with the practical situations where some distributions can be postulated. Although there are many statistical software packages available to ¯t a probability distribution model for a given data set, none of the packages is comprehensive enough to provide table values and other formulas for numer- ous probability distributions. The main purpose of this book and the software is to provide users with quick and easy access to table values, important formulas, and results of the many commonly used, as well as some specialized, statistical distributions. The book and the software are intended to serve as reference ma- terials. With practitioners and researchers in disciplines other than statistics in mind, I have adopted a format intended to make it simple to use the book for reference purposes. Examples are provided mainly for this purpose.

本工具包包括一些常见的聚类分析算法的matlab实现，并比较各种算法的性能。

This book includes three parts. The first part covers the basic topics on audio compression, such as quantization, entropy coding, psychoacoustic models, and sound quality assessment. The second part of the book highlights the current most prevalent low-bit-rate high-performance audio coding standard—MPEG-4 Audio. More emphasis is given to the audio standards that are capable of supporting multichannel signals, that is, MPEG Advanced Audio Coding (AAC), including the original MPEG-2 AAC specification, additional MPEG-4 toolsets, and the most recent aacPlus standard. The third part of this book introduces several innovative multichannel audio coding methods, which can further improve the coding performance and expand the available functionalities of MPEG AAC. This section is more suitable for graduate students and researcher