On the impact of an event

Given an information structure a function that measures how the inferences made by the agents spread among the states is defined; it specifies for each event its impact at each state, for each agent. Several properties are established. Received November 1994/Revised version September 1996     

Statistical thermodynamic formalism in the solution of information theory problems

This is the first of several papers dealing with the application of statistical thermodynamic methodology to the solution of coding and communication theory problems. Emphasis is placed on the various ensemble techniques of statistical mechanics, the words or samples of a message taking the place of molecules in the prototype physical system. Analogs of temperature, internal energy, pressure, chemical potential, volume, entropy, etc., are developed. The isomorphism with thermodynamics is complete and these quantities transform (for example, by partial differentiation) in exactly the same way as the prototype physical quantities. The methods are nicely applicable to coding cases involving sources with memory, in which case, correlation can be discussed in terms of analog coupling energies between signals or words so that the store of many-body-problem techniques can be used. In addition, the manipulative freedom stemming from the possibility of choosing from a multiplicity of ensembles constrained by intensive parameters proves a distinct advantage. A concrete example dealing with the choice of a compact code for a nonextended source with memory is presented. The compact code is derived, and some discussion is given concerning the breadth of its power spectrum. In a following paper, its autocorrelation function within the framework of pulse code modulation is derived and transformed by Wiener theory so that the power spectrum is directly exhibited (along with the spectra for several other cases).Research supported under AFOSR Grant No. 70-1877. The present work is contribution No. 2643 of the Department of Chemistry, University of California-Los Angeles.     

Perfect Secret Sharing Schemes on Five Participants

A perfect secret sharing scheme is a system for the protection of a secret among a number of participants in such a way that only certain subsets of these participants can reconstruct the secret, and the remaining subsets can obtain no additional information about the secret. The efficiency of a perfect secret sharing scheme can be assessed in terms of its information rates. In this paper we discuss techniques for obtaining bounds on the information rates of perfect secret sharing schemes and illustrate these techniques using the set of monotone access structures on five participants. We give a full listing of the known information rate bounds for all the monotone access structures on five participants.     

一种菲涅尔全息图的快速算法

通过分析菲涅尔全息图计算模型,发现大量的平方运算和三角函数运算是计算速度的瓶颈,提出了一种菲涅尔全息图的快速计算方法.根据菲涅尔全息图的数学模型,利用三角函数的和差化积公式,将全息图的数学模型变换为由仅与水平或垂直方向有关的独立分量,通过四则运算来表示.在菲涅尔全息图的计算中,用少量的三角函数、平方运算和大量的四则运算代替原来大量的三角函数和平方运算,减少了全息图的运算量.实验表明,采用该算法后全息图的计算速度提高了9倍以上.     

Impact of delays and rewiring on the dynamics of small-world neuronal networks with two types of coupling

We study synchronization transitions and pattern formation on small-world networks consisting of Morris-Lecar excitable neurons in dependence on the information transmission delay and the rewiring probability. In addition, networks formed via gap junctional connections and coupling via chemical synapses are considered separately. For gap-junctionally coupled networks we show that short delays can induce zigzag fronts of excitations, whereas long delays can further detriment synchronization due to a dynamic clustering anti-phase synchronization transition. For the synaptically coupled networks, on the other hand, we find that the clustering anti-phase synchronization can appear as a direct consequence of the prolongation of information transmission delay, without being accompanied by zigzag excitatory fronts. Irrespective of the coupling type, however, we show that an appropriate small-world topology can always restore synchronized activity if only the information transmission delays are short or moderate at most. Long information transmission delays always evoke anti-phase synchronization and clustering, in which case the fine-tuning of the network topology fails to restore the synchronization of neuronal activity.     

The timing of information transmission in financial markets

This article shows turbulent behavior in a series of financial indexes assuming that they follow a cascade process of the same type as do turbulent fluids. With such a model, the energy flux between the eddies that emerge in the fluid is analogous to the financial information flux over the course of time. The results obtained confirm the variability of variation of the indexes for the considered time scale (the turbulent intermittency typical for fluids), and they also confirm that when we descend along the cascade, that is to say, when we consider smaller time intervals, the rate at which the hypothetical eddies of information dissipate becomes greater than the rate at which the information is transmitted. This fact can explain the cyclical nature of crises: ultimately, financial events have a memory of the past. Besides, the NASDAQ singular behavior regarding the number of jumps, the degree of intermittency of the turbulence and the life time of the hypothetical eddies has been analysed.     

Info-quantifiers’ map-characterization revisited

We highlight the potentiality of a special Information Theory (IT) approach in order to unravel the intricacies of nonlinear dynamics, the methodology being illustrated with reference to the logistic map. A rather surprising dynamic feature→plane-topography map becomes available.     

The effect of TTL on the information traffic

In real communication protocols, the information packets have a finite Time-to-Live (TTL) to avoid the waste of network resources, such as infinite loop induced by routing error or too long transferring time. In this paper, we introduce TTL into the information traffic model on Barabási-Albert scale-free networks under local routing strategy and focus on its effect on the network capacity measured by the critical point (R_c) of phase transition from free flow to congestion. Simulations show that the network capacity and the communication velocity are improved. However, some packets are dropped before they arrived at destinations. It is found that the share of successfully arrived packets monotonously increases with the increment of TTL and it is considerably acceptable if TTL is not very small. We also examine the effect of TTL on the positive-feedback preference (PFP) internet model and the results are alike. Our work may be helpful in quantifying the effect of packet lifetime in real communication networks and in routing strategy designing.     

The D-optimal saturated designs of order 22

This paper attempts to prove the D-optimality of the saturated designs X${}^1$ and X${}^{11}$ of order 22, already existing in the current literature. The corresponding non-equivalent information matrices M${}^1$=(X${}^1$)${}^T$X${}^1$ and M${}^{11}$=(X${}^{11}$)${}^T$X${}^{11}$ have the maximum determinant. Within the application of a specific procedure, all symmetric and positive definite matrices M of order 22 with determinant the square of an integer and $\ge$det(M${}^1$) are constructed. This procedure has indicated that there are 26 such non-equivalent matrices M, for 24 of which the non-existence of designs X such that X${}^T$X =M is proved. The remaining two matrices M are the information matrices M${}^1$ and M${}^{11}$.     

Improving biorefinery planning: Integration of spatial data using exact optimization nested in an evolutionary strategy

Biorefineries can provide a product portfolio from renewable biomass similar to that of crude oil refineries. To operate biorefineries of any kind, however, the availability of biomass inputs is crucial and must be considered during planning. Here, we develop a planning approach that uses Geographic Information Systems (GIS) to account for spatially scattered biomass when optimizing a biorefinery’s location, capacity, and configuration. To deal with the challenges of a non-smooth objective function arising from the geographic data, higher dimensionality, and strict constraints, the planning problem is repeatedly decomposed by nesting an exact nonlinear program (NLP) inside an evolutionary strategy (ES) heuristic, which handles the spatial data from the GIS. We demonstrate the functionality of the algorithm and show how including spatial data improves the planning process by optimizing a synthesis gas biorefinery using this new planning approach.