The identified security areas comprise protecting hosts against malicious agents, protecting the agent’s transmission and protecting agents against malicious hosts. The first two security issues and the protection of the agent’s code state can be solved by applying traditional security techniques. Even though there are some works that manage the privacy of execution, their implementation is alm...

In this document I respond to three sections of Prof. Milgrom and Prof. Ausubel’s analysis in their Comments on the Second Wye River Package Bidding Conference. First I examine the expressivity of the auction #31 bidding language. Second I discuss some computational issues that arise from the choice of bidding language, concentrating on computational benefits of the OR-of-XOR language and on ho...

This paper proposes secure regenerating codes that are composed of non-secure regenerating codes and a new all-or-nothing transform. Unlike the previous analysis of secure regenerating codes, the security of the proposed codes is analyzed in the sense of the indistinguishability. The advantage of the proposed codes is that the overhead caused by the security against eavesdropping is much less t...

Conventional studies of biomolecular behaviors rely largely on the construction of kinetic schemes. Since the selection of these networks is not unique, a concern is raised whether and under which conditions hierarchical schemes can reveal the same experimentally measured fluctuating behaviors and unique fluctuation related physical properties. To clarify these questions, we introduce stochasti...

Introduction Conclusions References

As EXOR (Exclusive-OR) expansions of binary output functions, the ESOP (EXOR Sum of Products) form and its extension, the ESCT (EXOR Sum of Complex Terms) form, have been studied extensively in the literature. An efficient algorithm for minimizing ESOP forms is known for two-variable multiple-valued input functions. On the other hand, no ESCT minimization algorithm is known for such functions. ...

In this paper, a general concept called n+k/n method is introduced. In n+k/n method, a special mapping function is defined to map an intermediate set with n+k bits into n bits information set. In the embedding process, the intermediate set is embedded into cover image rather than embedding the information set. If the distance between the features of cover image and the bits of intermediate set ...

Consider the situation where two individuals observe the same chaotic physical process but through time series of different measured variables (e.g., one individual measures a temperature and the other measures a voltage). If the two individuals now use their data to reconstruct (e.g., via delay coordinates) a map, the maps they obtain may appear quite different. In the case where the resulting...

In this paper, we propose a novel method for increasing the entropy of a sequence of independent, discrete random variables with arbitrary distributions. The method uses an auxiliary table and a novel theorem that concerns the entropy of a sequence in which the elements are a bitwise exclusive-or sum of independent discrete random variables.