Making random permutations from physically unclonable constants

The recent availability of reliable schemes for physically unclonable constants (PUC) opens interesting possibilities in the field of security. In this paper, we explore the possibility of using PUCs to embed in a chip random permutations to be used, for example, as building blocks in cryptographic constructions such as sponge functions, substitution–permutation networks, and so on. We show that the most difficult part is the generation of random integers using as the only randomness source the bit-string produced by the PUC. In order to solve the integer generation problem, we propose a partial rejection method that allows the designer to trade-off between entropy and efficiency. The results show that the proposed schemes can be implemented with reasonable complexity.     

A quick tour on suffix arrays and compressed suffix arrays

Suffix arrays are a key data structure for solving a run of problems on texts and sequences, from data compression and information retrieval to biological sequence analysis and pattern discovery. In their simplest version, they can just be seen as a permutation of the elements in {1,2,…,n}, encoding the sorted sequence of suffixes from a given text of length n, under the lexicographic order. Yet, they are on a par with ubiquitous and sophisticated suffix trees. Over the years, many interesting combinatorial properties have been devised for this special class of permutations: for instance, they can implicitly encode extra information, and they are a well characterized subset of the n! permutations. This paper gives a short tutorial on suffix arrays and their compressed version to explore and review some of their algorithmic features, discussing the space issues related to their usage in text indexing, combinatorial pattern matching, and data compression.     

Feedforward networks in financial predictions: the future that modifies the present

The main goal of this paper is to show how relatively minor modifications of well-known algorithms (in particular, back propagation) can dramatically increase the performance of an artificial neural network (ANN) for time series prediction. We denote our proposed sets of modifications as the 'self-momentum', 'Freud' and 'Jung' rules. In our opinion, they provide an example of an alternative approach to the design of learning strategies for ANNs, one that focuses on basic mathematical conceptualization rather than on formalism and demonstration. The complexity of actual prediction problems makes it necessary to experiment with modelling possibilities whose inherent mathematical properties are often not well understood yet. The problem of time series prediction in stock markets is a case in point. It is well known that asset price dynamics in financial markets are difficult to trace, let alone to predict with an operationally interesting degree of accuracy. We therefore take financial prediction as a meaningful test bed for the validation of our techniques. We discuss in some detail both the theoretical underpinnings of the technique and our case study about financial prediction, finding encouraging evidence that supports the theoretical and operational viability of our new ANN specifications. Ours is clearly only a preliminary step. Further developments of ANN architectures with more and more sophisticated 'learning to learn' characteristics are now under study and test.     

Generalization in the XCSF classifier system: analysis, improvement, and extension

We analyze generalization in XCSF and introduce three improvements. We begin by showing that the types of generalizations evolved by XCSF can be influenced by the input range. To explain these results we present a theoretical analysis of the convergence of classifier weights in XCSF which highlights a broader issue. In XCSF, because of the mathematical properties of the Widrow-Hoff update, the convergence of classifier weights in a given subspace can be slow when the spread of the eigenvalues of the autocorrelation matrix associated with each classifier is large. As a major consequence, the system's accuracy pressure may act before classifier weights are adequately updated, so that XCSF may evolve piecewise constant approximations, instead of the intended, and more efficient, piecewise linear ones. We propose three different ways to update classifier weights in XCSF so as to increase the generalization capabilities of XCSF: one based on a condition-based normalization of the inputs, one based on linear least squares, and one based on the recursive version of linear least squares. Through a series of experiments we show that while all three approaches significantly improve XCSF, least squares approaches appear to be best performing and most robust. Finally we show how XCSF can be extended to include polynomial approximations.     

Exploring the other side of biologically relevant chemical space: insights into carboxylic, sulfonic and phosphonic acid bioisosteric relationships

Bioisosteric replacements have been widely and successfully applied to develop bioisosteric series of biologically active compounds in medicinal chemistry. In this work, the concept of bioisosterism is revisited using a novel approach based on charting the "other side" of biologically relevant chemical space. This space is composed by the ensemble of binding sites of protein structures. Explorations into the "other side" of biologically relevant chemical space are exploited to gain insight into the principles that rules molecular recognition and bioisosteric relationships of molecular fragments. We focused, in particular, on the construction of the "other side" of chemical space covered by binding sites of small molecules containing carboxylic, sulfonic, and phosphonic acidic groups. The analysis of differences in the occupation of that space by distinct types of binding sites unveils how evolution has worked in assessing principles that rule the selectivity of molecular recognition, and improves our knowledge on the molecular basis of bioisosteric relationships among carboxylic, sulfonic, and phosphonic acidic groups.     

Gas-phase ion chemistry in organometallic systems

This review essentially deals with positive ion/molecule reactions occurring in gas-phase organometallic systems, and encompasses a period of time of approximately 7 years, going from 1997 to early 2004. Following the example of the excellent review by Eller & Schwarz (1991; Chem Rev 91:1121-1177), in the first part, results of reaction of naked ions are presented by grouping them according to the neutral substrate, while in the second part, ligated ions are grouped according to the different ligands. Whenever possible, comparison among similar studies is attempted, and general trends of reactivities are evidenced.     

A strategy for blood vessels segmentation based on the threshold which combines statistical and scale space filter. Application to the study of angiogenesis

This paper presents a strategy for segmenting blood vessels based on the threshold, which combines statistics and scale space filter. By incorporating statistical information, the strategy is capable of reducing over-segmentation. We propose a two-stage strategy which involves: (1) optimal selection of window size and (2) optimal selection of scale. We compared our strategy to two commonly used thresholding techniques. Experimental results showed that our method is much more robust and accurate. Our strategy suggested a modification to Otsu's method. In this application the important information to be extracted from images is only the number of blood vessels present in the images. The proposed segmentation technique is tested on manual segmentation, where segmentation errors less than 3% were observed. The work presented in this paper is a part of a global image analysis process. Therefore, these images will be subject to a further morphometrical analysis in order to diagnose and predict automatically malign tumors.     

Self-adaptation in next-generation Internet networks: how to react to traffic changes while respecting QoS?

Next-generation network infrastructure should support different services and several levels of quality of service (QoS) and resilience. The main requirements for such multiservice networks are flexibility, effective utilization of network resources, and ability to react to traffic demand changes with time. These requisites lead to the fact that next-generation networks should, to some extend, be "self-adapting," to cope with the need of promptly reacting to traffic demand changes, in an effective way, while taking into account the different requirements in terms of QoS. This paper sketches the reference network scenario and discusses the subject of self-adapting networks, attempting to focus on the key issues that need to be solved to realize future infrastructures. As a relevant example, this paper briefly reports a system developed by the authors' laboratory that implements a traffic engineering solution able to fulfill the mentioned requirements. This system could be regarded as a first concrete step toward the realization of self-adapting networks. In addition, some relevant results that were obtained either by simulation or by experiments on a real test bed are reported to discuss the main characteristics of such a system and assess the feasibility of the concept. Finally, the paper reviews the main hot issues that need to be addressed, in the authors' opinion, by the international research community.     

Model for small superconducting variable-thickness bridge constrictions

We present a simple model to simulate small three-dimensional superconducting constrictions of variable thickness (VTBs) for which the cross-sectional dimensions are of the same order as the length, and both are less than (T). We study the behavior of the modulus of the order parameterf and the supercurrent densityJ _s as a function of the various dimensions. We find that the extent to whichf is depressed in the banks depends on the ratio of width to length of the constriction. We show that even for very abrupt geometries,J _s is not zero andf does not reach its equilibrium value immediately outside the constriction. On the basis of our results, we propose a more general expression for the effective length valid also when all dimensions are of the same order. The calculated values ofdI _c /dT are consistent with experimental data from well-characterized VTBs. We suggest that the discrepancy between the calculated and experimental values ofI _c R _n may be due to the nonuniformity of the normal current density in the constriction.     

An Integrated Assessment of the Impacts of Changing Climate Variability on Agricultural Productivity and Profitability in an Irrigated Mediterranean Catchment

Climate change is likely to have a profound effect on many agricultural variables, although the extent of its influence will vary over the course of the annual farm management cycle. Consequently, the effect of different and interconnected physical, technical and economic factors must be modeled in order to estimate the effects of climate change on agricultural productivity. Such modeling commonly makes use of indicators that summarize the among environmental factors that are considered when farmers plan their activities. This study uses net evapotranspiration (ET_N), estimated using EPIC, as a proxy index for the physical factors considered by farmers when managing irrigation. Recent trends suggest that the probability distribution function of ET_N may continue to change in the near future due to changes in the irrigation needs of crops. Also, water availability may continue to vary due to changes in the rainfall regime. The impacts of the uncertainties related to these changes on costs are evaluated using a Discrete Stochastic Programming model representing an irrigable Mediterranean area where limited water is supplied from a reservoir. In this context, adaptation to climate change can be best supported by improvements to the collective irrigation systems, rather than by measures aimed at individual farms such as those contained within the rural development policy.