One-Way Functions Using Algorithmic and Classical Information Theories

We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by?E(K ^t (x|f(x))). These results are in both directions. More precisely, conditions on?E(K ^t (x|f(x))) that imply that?f is a weak one-way function, and properties of?E(K ^t (x|f(x))) that are implied by the fact that?f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function?f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate?E(K ^t (x|f(x))) and two forms of time-bounded entropy, the unpredictable entropy?H ^unp, in which ??one-wayness?? of a function can be easily expressed, and the Yao⁺ entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.     

A hardware design of a massive-parallel, modular NN-based vector quantizer for real-time video coding

This report describes the design of a modular, massive-parallel, neural-network (NN)-based vector quantizer for real-time video coding. The NN is a self-organizing map (SOM) that works only in the training phase for codebook generation, only at the recall phase for real-time image coding, or in both phases for adaptive applications. The neural net can be learned using batch or adaptive training and is controlled by an inside circuit, finite-state machine-based hard controller. The SOM is described in VHDL and implemented on electrically (FPGA) and mask (standard-cell) programmable devices.     

LEGClust—A Clustering Algorithm Based on Layered Entropic Subgraphs

Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGCIust) that builds layers of subgraphs based on this matrix and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure, we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones.     

LEGClust- a clustering algorithm based on layered entropic subgraphs.

Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGClust) that builds layers of subgraphs based on this matrix, and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones.     

Two proposals for the inclusion of directory information in the last-level private caches of glueless shared-memory multiprocessors

In glueless shared-memory multiprocessors where cache coherence is usually maintained using a directory-based protocol, the fast access to the on-chip components (caches and network router, among others) contrasts with the much slower main memory. Unfortunately, directory-based protocols need to obtain the sharing status of every memory block before coherence actions can be performed. This information has traditionally been stored in main memory, and therefore these cache coherence protocols are far from being optimal. In this work, we propose two alternative designs for the last-level private cache of glueless shared-memory multiprocessors: the lightweight directory and the SGluM cache. Our proposals completely remove directory information from main memory and store it in the home node’s L2 cache, thus reducing both the number of accesses to main memory and the directory memory overhead. The main characteristics of the lightweight directory are its simplicity and the significant improvement in the execution time for most applications. Its drawback, however, is that the performance of some particular applications could be degraded. On the other hand, the SGluM cache offers more modest improvements in execution time for all the applications by adding some extra structures that cope with the cases in which the lightweight directory fails.     

Post-embryonic development of the antennal sensilla in Melipona quadrifasciata anthidioides (Hymenoptera: Meliponini)

The sensilla are sensory organs formed by cuticular and cellular structures specialized in reception of chemical and physical stimuli from the environment and transmission to the insect's central nervous system. In function of the great concentration of sensilla, the antennae are the main organs for interaction between bees and with the environment. This work studied the presence of antennal sensilla in the different phases of pupal development of the stingless bee Melipona quadrifasciata anthidioides by means of scanning electron microscopy and light microscopy. The results showed that antennal sensilla begin their development in the transition of the prepupae to the white-eyed pupae and finish it in the pigmented-body pupae phase. The antennal sensilla were exposed to the environment in the black-eyed pupae when the old cuticle is completely digested, suggesting that only in the final pupal phases can these bees perceive the environmental stimuli.     

New insights into the morphology of Trypanosoma cruzi reservosome

Reservosomes are late endosomes present only in members of the Schizotrypanum subgenus of the Trypanosoma genus and are defined as the site of storage of endocytosed macromolecules and lysosomal enzymes. They have been extensively described in Trypanosoma cruzi epimastigote: are bounded by a membrane unit, present an electron-dense protein matrix with electron-lucent lipid inclusions, being devoid of inner membranes. Here we performed a detailed ultrastructural analysis of these organelles using a variety of electron microscopy techniques, including ultrathin sectioning, uranyl acetate stained preparations, and freeze fracture, either in intact epimastigotes or in isolated reservosomes. New informations were obtained. First, both isolated and in situ reservosomes presented small profiles of inner membranes that are morphologically similar to the membrane surrounding the organelle. In uranyl acetate stained preparations, internal membrane profiles turned out to be longer than they appeared in ultrathin section images and traversed the organelle diameter. Internal vesicles were also found. Second, endocytosed cargo are not associated with internal vesicles and reach reservosomes on board of vesicles that fuse with the boundary membrane, delivering cargo directly into reservosome lumen. Third, electron-lucent bodies with saturated lipid core surrounded by a membrane monolayer and with unusual rectangular shape were also observed. Fourth, it was possible to demonstrate the presence of intramembranous particles on the E face of both internal vesicles and the surrounding membrane. Collectively, these results indicate that reservosomes have a complex internal structure, which may correlate with their multiple functions.     

Joint Estimation of Location and Scatter in Complex Elliptically Symmetric Distributions

The joint estimation of the location vector and the shape matrix of a set of independent and identically Complex Elliptically Symmetric (CES) distributed observations is investigated from both the theoretical and computational viewpoints. This joint estimation problem is framed in the original context of semiparametric models allowing us to handle the (generally unknown) density generator as an infinite-dimensional nuisance parameter. In the first part of the paper, a computationally efficient and memory saving implementation of the robust and semiparmaetric efficient R-estimator for shape matrices is derived. Building upon this result, in the second part, a joint estimator, relying on the Tyler’s M-estimator of location and on the R-estimator of shape matrix, is proposed and its Mean Squared Error (MSE) performance compared with the Semiparametric Cramér-Rao Bound (SCRB).

     

Bandwidth selection in kernel density estimation for interval-grouped data

When interval-grouped data are available, the classical Parzen–Rosenblatt kernel density estimator has to be modified to get a computable and useful approach in this context. The new nonparametric grouped data estimator needs of the choice of a smoothing parameter. In this paper, two different bandwidth selectors for this estimator are analyzed. A plug-in bandwidth selector is proposed and its relative rate of convergence obtained. Additionally, a bootstrap algorithm to select the bandwidth in this framework is designed. This method is easy to implement and does not require Monte Carlo. Both proposals are compared through simulations in different scenarios. It is observed that when the sample size is medium or large and grouping is not heavy, both bandwidth selection methods have a similar and good performance. However, when the sample size is large and under heavy grouping scenarios, the bootstrap bandwidth selector leads to better results.