Sidelobe elimination for generalized synthetic discriminant functions by a two-filter correlation and subsequent postprocessing of the intensity distributions

One of the most important problems in optical pattern recognition by correlation is the appearance of sidelobes in the correlation plane, which causes false alarms. We present a method that eliminate sidelobes of up to a given height if certain conditions are satisfied. The method can be applied to any generalized synthetic discriminant function filter and is capable of rejecting lateral peaks that are even higher than the central correlation. Satisfactory results were obtained in both computer simulations and optical implementation.

New insights into cellular prion protein (PrPc) functions: the 'ying and yang' of a relevant protein.

The conversion of cellular prion protein (PrPc), a GPI-anchored protein, into a protease-K-resistant and infective form (generally termed PrPsc) is mainly responsible for Transmissible Spongiform Encephalopathies (TSEs), characterized by neuronal degeneration and progressive loss of basic brain functions. Although PrPc is expressed by a wide range of tissues throughout the body, the complete repertoire of its functions has not been fully determined. Recent studies have confirmed its participation in basic physiological processes such as cell proliferation and the regulation of cellular homeostasis. Other studies indicate that PrPc interacts with several molecules to activate signaling cascades with a high number of cellular effects. To determine PrPc functions, transgenic mouse models have been generated in the last decade. In particular, mice lacking specific domains of the PrPc protein have revealed the contribution of these domains to neurodegenerative processes. A dual role of PrPc has been shown, since most authors report protective roles for this protein while others describe pro-apoptotic functions. In this review, we summarize new findings on PrPc functions, especially those related to neural degeneration and cell signaling.

New insights into cellular prion protein (PrPc) functions: the 'ying and yang' of a relevant protein.

The conversion of cellular prion protein (PrPc), a GPI-anchored protein, into a protease-K-resistant and infective form (generally termed PrPsc) is mainly responsible for Transmissible Spongiform Encephalopathies (TSEs), characterized by neuronal degeneration and progressive loss of basic brain functions. Although PrPc is expressed by a wide range of tissues throughout the body, the complete repertoire of its functions has not been fully determined. Recent studies have confirmed its participation in basic physiological processes such as cell proliferation and the regulation of cellular homeostasis. Other studies indicate that PrPc interacts with several molecules to activate signaling cascades with a high number of cellular effects. To determine PrPc functions, transgenic mouse models have been generated in the last decade. In particular, mice lacking specific domains of the PrPc protein have revealed the contribution of these domains to neurodegenerative processes. A dual role of PrPc has been shown, since most authors report protective roles for this protein while others describe pro-apoptotic functions. In this review, we summarize new findings on PrPc functions, especially those related to neural degeneration and cell signaling.

Computational and Energy Costs of Cryptographic Algorithms on Handheld Devices

Networks are evolving toward a ubiquitous model in which heterogeneousdevices are interconnected. Cryptographic algorithms are required for developing securitysolutions that protect network activity. However, the computational and energy limitationsof network devices jeopardize the actual implementation of such mechanisms. In thispaper, we perform a wide analysis on the expenses of launching symmetric and asymmetriccryptographic algorithms, hash chain functions, elliptic curves cryptography and pairingbased cryptography on personal agendas, and compare them with the costs of basic operatingsystem functions. Results show that although cryptographic power costs are high and suchoperations shall be restricted in time, they are not the main limiting factor of the autonomyof a device.

A Forwarding Cooperation Protocol for Plain and Cluster-based Ad Hoc Networks

Peer-reviewed

Generalized multiresolution analyses with given multiplicity functions

Generalized multiresolution analyses are increasing sequences of subspaces of a Hilbert space H that fail to be multiresolution analyses in the sense of wavelet theory because the core subspace does not have an orthonormal basis generated by a fixed scaling function. Previous authors have studied a multiplicity function m which, loosely speaking, measures the failure of the GMRA to be an MRA. When the Hilbert space H is L2(Rn), the possible multiplicity functions have been characterized by Baggett and Merrill. Here we start with a function m satisfying a consistency condition which is known to be necessary, and build a GMRA in an abstract Hilbert space with multiplicity function m.

Clarke critical values of subanalytic Lipschitz continuous functions

We prove that any subanalytic locally Lipschitz function has the Sard property. Such functions are typically nonsmooth and their lack of regularity necessitates the choice of some generalized notion of gradient and of critical point. In our framework these notions are defined in terms of the Clarke and of the convex-stable subdifferentials. The main result of this note asserts that for any subanalytic locally Lipschitz function the set of its Clarke critical values is locally finite. The proof relies on Pawlucki's extension of the Puiseuxlemma. In the last section we give an example of a continuous subanalytic function which is not constant on a segment of "broadly critical" points, that is, points for which we can find arbitrarily short convex combinations of gradients at nearby points.

Elicited bid functions in (a)symmetric first-price auctions

We report on a series of experiments that examine bidding behavior in first-price sealed bid auctions with symmetric and asymmetric bidders. To study the extent of strategic behavior, we use an experimental design that elicits bidders' complete bid functions in each round (auction) of the experiment. In the aggregate, behavior is consistent with the basic equilibrium predictions for risk neutral or homogenous risk averse bidders (extent of bid shading, average seller's revenues and deviations from equilibrium). However, when we look at the extent of best reply behavior and the shape of bid functions, we find that individual behavior is not in line with the received equilibrium models, although it exhibits strategic sophistication.

The Cuntz semigroup, the Elliott conjecture, and dimension functions on C*-Algebras

We prove that the Cuntz semigroup is recovered functorially from the Elliott invariant for a large class of C¤-algebras. In particular, our results apply to the largest class of simple C¤-algebras for which K-theoretic classification can be hoped for. This work has three significant consequences. First, it provides new conceptual insight into Elliott's classification program, proving that the usual form of the Elliott conjecture is equivalent, among Z-stable algebras, to a conjecture which is in general substantially weaker and for which there are no known counterexamples. Second and third, it resolves, for the class of algebras above, two conjectures of Blackadar and Handelman concerning the basic structure of dimension functions on C¤-algebras. We also prove in passing that the Kuntz-Pedersen semigroup is recovered functorially from the Elliott invariant for all simple unital C¤-algebras of interest.

Generating trees for permutations avoiding generalized patterns

We construct generating trees with with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, which allows us to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern. We use these trees to find functional equations for the generating functions enumerating these classes of permutations with respect to different parameters. In several cases we solve them using the kernel method and some ideas of Bousquet-Mélou [2]. We obtain refinements of known enumerative results and find new ones.

The simultaneous conjugacy problem in groups of piecewise linear functions

Guba and Sapir asked, in their joint paper [8], if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give an elementary proof for the solution of the latter question. This relies purely on the description of F as the group of piecewise linear orientation-preserving homeomorphisms of the unit. The techniques we develop allow us also to solve the ordinary conjugacy problem as well, and we can compute roots and centralizers. Moreover, these techniques can be generalized to solve the same questions in larger groups of piecewise-linear homeomorphisms.

Inversion of analytic characteristic functions and infinite convolutions of exponential and Laplace densities

This paper shows that certain quotients of entire functions are characteristic functions. Under some conditions, we provide expressions for the densities of such characteristic functions which turn out to be generalized Dirichlet series which in turn can be expressed as an infinite linear combination of exponential or Laplace densities. We apply these results to several examples.

Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results

We define different concepts of group strategy-proofness for social choice functions. We discuss the connections between the defined concepts under different assumptions on their domains of definition. We characterize the social choice functions that satisfy each one of them and whose ranges consist of two alternatives, in terms of two types of basic properties.

Newton-Hooke algebras, nonrelativistic branes, and generalized pp-wave metrics

The Newton-Hooke algebras in d dimensions are constructed as contractions of dS(AdS) algebras. Nonrelativistic brane actions are WZ terms of these Newton-Hooke algebras. The NH algebras appear also as subalgebras of multitemporal relativistic conformal algebras, SO(d+1,p+2). We construct generalizations of pp-wave metrics from these algebras.