Politecnico di Torino

Uncovering the community structure exhibited by real networks is a crucial step toward an understanding of complex systems that goes beyond the local organization of their constituents. Many algorithms have been proposed so far, but none of them has been subjected to strict tests to evaluate their performance. Most of the sporadic tests performed so far involved small networks with known community structure and/or artificial graphs with a simplified structure, which is very uncommon in real systems. Here we test several methods against a recently introduced class of benchmark graphs, with heterogeneous distributions of degree and community size. The methods are also tested against the benchmark by Girvan and Newman [Proc. Natl. Acad. Sci. U.S.A. 99, 7821 (2002)] and on random graphs. As a result of our analysis, three recent algorithms introduced by Rosvall and Bergstrom [Proc. Natl. Acad. Sci. U.S.A. 104, 7327 (2007); Proc. Natl. Acad. Sci. U.S.A. 105, 1118 (2008)], Blondel [J. Stat. Mech.: Theory Exp. (2008), P10008], and Ronhovde and Nussinov [Phys. Rev. E 80, 016109 (2009)] have an excellent performance, with the additional advantage of low computational complexity, which enables one to analyze large systems.

It has been recognized by Zehavi (1992) that the performance of coded modulation over a Rayleigh fading channel can be improved by bit-wise interleaving at the encoder output, and by using an appropriate soft-decision metric as an input to a Viterbi (1990) decoder. The paper presents in a comprehensive fashion the theory underlying bit-interleaved coded modulation, provides tools for evaluating its performance, and gives guidelines for its design.

Measurements are reported of the loss per cycle (sinusoidal flux waveform) versus magnetizing frequency f/sub m/(0<or=f/sub m/<or=100 or 400 Hz) and peak magnetization I/sub max/, performed on 3% SiFe alloys (both grain-oriented and nonoriented), Armco iron, NiFe alloys, and amorphous ribbons. Using a novel theoretical framework, the microscopic origin of the observed dynamic losses is discussed, and a physical interpretation is given of the general fact that the loss per cycle is always a nonlinear function of f/sub m/. A theoretical procedure is discussed by which it is possible, for a generic material, given a single loss curve at a certain value of I/sub max/, to predict the dependence of dynamic losses on both I/sub max/ and f/sub m/, with an approximation within +or-10% in all the investigated cases. The behaviour of grain-oriented SiFe, which presents some specific complexities, is discussed in particular detail.<<ETX>>

In this paper we review the most peculiar and interesting information-theoretic and communications features of fading channels. We first describe the statistical models of fading channels which are frequently used in the analysis and design of communication systems. Next, we focus on the information theory of fading channels, by emphasizing capacity as the most important performance measure. Both single-user and multiuser transmission are examined. Further, we describe how the structure of fading channels impacts code design, and finally overview equalization of fading multipath channels.

It has been shown by Zehavi (1992) that the performance of coded modulation with a Rayleigh fading channel can be improved by bit-wise interleaving at the encoder output, and by using an appropriate soft-decision metric as an input to a Viterbi decoder. In this paper we present a unified theory of bit-interleaved coded modulation, provide tools for performance analysis and give guidelines for its design.

Comparing photosynthetic and photovoltaic efficiencies is not a simple issue. Although both processes harvest the energy in sunlight, they operate in distinctly different ways and produce different types of products: biomass or chemical fuels in the case of natural photosynthesis and nonstored electrical current in the case of photovoltaics. In order to find common ground for evaluating energy-conversion efficiency, we compare natural photosynthesis with present technologies for photovoltaic-driven electrolysis of water to produce hydrogen. Photovoltaic-driven electrolysis is the more efficient process when measured on an annual basis, yet short-term yields for photosynthetic conversion under optimal conditions come within a factor of 2 or 3 of the photovoltaic benchmark. We consider opportunities in which the frontiers of synthetic biology might be used to enhance natural photosynthesis for improved solar energy conversion efficiency.

The area of multiphase variable-speed motor drives in general and multiphase induction motor drives in particular has experienced a substantial growth since the beginning of this century. Research has been conducted worldwide and numerous interesting developments have been reported in the literature. An attempt is made to provide a detailed overview of the current state-of-the-art in this area. The elaborated aspects include advantages of multiphase induction machines, modelling of multiphase induction machines, basic vector control and direct torque control schemes and PWM control of multiphase voltage source inverters. The authors also provide a detailed survey of the control strategies for five-phase and asymmetrical six-phase induction motor drives, as well as an overview of the approaches to the design of fault tolerant strategies for post-fault drive operation, and a discussion of multiphase multi-motor drives with single inverter supply. Experimental results, collected from various multiphase induction motor drive laboratory rigs, are also included to facilitate the understanding of the drive operation.

The similarity in the three-dimensional structures of homologous proteins imposes strong constraints on their sequence variability. It has long been suggested that the resulting correlations among amino acid compositions at different sequence positions can be exploited to infer spatial contacts within the tertiary protein structure. Crucial to this inference is the ability to disentangle direct and indirect correlations, as accomplished by the recently introduced direct-coupling analysis (DCA). Here we develop a computationally efficient implementation of DCA, which allows us to evaluate the accuracy of contact prediction by DCA for a large number of protein domains, based purely on sequence information. DCA is shown to yield a large number of correctly predicted contacts, recapitulating the global structure of the contact map for the majority of the protein domains examined. Furthermore, our analysis captures clear signals beyond intradomain residue contacts, arising, e.g., from alternative protein conformations, ligand-mediated residue couplings, and interdomain interactions in protein oligomers. Our findings suggest that contacts predicted by DCA can be used as a reliable guide to facilitate computational predictions of alternative protein conformations, protein complex formation, and even the de novo prediction of protein domain structures, contingent on the existence of a large number of homologous sequences which are being rapidly made available due to advances in genome sequencing.

We present a maximum-likelihood decoding algorithm for an arbitrary lattice code when used over an independent fading channel with perfect channel state information at the receiver. The decoder is based on a bounded distance search among the lattice points falling inside a sphere centered at the received point. By judicious choice of the decoding radius we show that this decoder can be practically used to decode lattice codes of dimension up to 32 in a fading environment.

Poly(lactic-co-glycolic) acid (PLGA) has attracted considerable interest as a base material for biomedical applications due to its: (i) biocompatibility; (ii) tailored biodegradation rate (depending on the molecular weight and copolymer ratio); (iii) approval for clinical use in humans by the U.S. Food and Drug Administration (FDA); (iv) potential to modify surface properties to provide better interaction with biological materials; and (v) suitability for export to countries and cultures where implantation of animal-derived products is unpopular. This paper critically reviews the scientific challenge of manufacturing PLGA-based materials with suitable properties and shapes for specific biomedical applications, with special emphasis on bone tissue engineering. The analysis of the state of the art in the field reveals the presence of current innovative techniques for scaffolds and material manufacturing that are currently opening the way to prepare biomimetic PLGA substrates able to modulate cell interaction for improved substitution, restoration, or enhancement of bone tissue function.

This brief review examines some of the methods used to infer central control strategies from surface electromyogram (EMG) recordings. Among the many uses of the surface EMG in studying the neural control of movement, the review critically evaluates only some of the applications. The focus is on the relations between global features of the surface EMG and the underlying physiological processes. Because direct measurements of motor unit activation are not available and many factors can influence the signal, these relations are frequently misinterpreted. These errors are compounded by the counterintuitive effects that some system parameters can have on the EMG signal. The phenomenon of crosstalk is used as an example of these problems. The review describes the limitations of techniques used to infer the level of muscle activation, the type of motor unit recruited, the upper limit of motor unit recruitment, the average discharge rate, and the degree of synchronization between motor units. Although the global surface EMG is a useful measure of muscle activation and assessment, there are limits to the information that can be extracted from this signal.

Many algorithms for both identifying and reconstructing a 3-D object are based on the 2-D silhouettes of the object. In general, identifying a nonconvex object using a silhouette-based approach implies neglecting some features of its surface as identification clues. The same features cannot be reconstructed by volume intersection techniques using multiple silhouettes of the object. This paper addresses the problem of finding which parts of a nonconvex object are relevant for silhouette-based image understanding. For this purpose, the geometric concept of visual hull of a 3-D object is introduced. This is the closest approximation of object S that can be obtained with the volume intersection approach; it is the maximal object silhouette-equivalent to S, i.e., which can be substituted for S without affecting any silhouette. Only the parts of the surface of S that also lie on the surface of the visual hull can be reconstructed or identified using silhouette-based algorithms. The visual hull depends not only on the object but also on the region allowed to the viewpoint. Two main viewing regions result in the external and internal visual hull. In the former case the viewing region is related to the convex hull of S, in the latter it is bounded by S. The internal visual hull also admits an interpretation not related to silhouettes. Algorithms for computing visual hulls are presented and their complexity analyzed. In general, the visual hull of a 3-D planar face object turns out to be bounded by planar and curved patches.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

The Internet is continuously changing and evolving. The main communication form of present Internet is human-human. The Internet of Things (IoT) can be considered as the future evaluation of the Internet that realizes machine-to-machine (M2M) learning. Thus, IoT provides connectivity for everyone and everything. The IoT embeds some intelligence in Internet-connected objects to communicate, exchange information, take decisions, invoke actions and provide amazing services. This paper addresses the existing development trends, the generic architecture of IoT, its distinguishing features and possible future applications. This paper also forecast the key challenges associated with the development of IoT. The IoT is getting increasing popularity for academia, industry as well as government that has the potential to bring significant personal, professional and economic benefits.

Generalized Stochastic Petri Nets (GSPNs) are presented and are applied to the performance evaluation of multiprocessor systems. GSPNs are derived from standard Petri nets by partitioning the set of transitions into two subsets comprising timed and immediate transitions. An exponentially distributed random firing time is associated with each timed transition, whereas immediate transitions fire in zero time. It is shown that GSPNs are equivalent to continuous-time stochastic processes, and solution methods for the derivation of the steady state probability distribution are presented. Examples of application of GSPN models to the performance evaluation of multiprocessor systems show the usefulness and the effectiveness of this modeling tool. 1.

In this paper we study a model quantum register $R$ made of $N$ replicas (cells) of a given finite-dimensional quantum system S. Assuming that all cells are coupled with a common environment with equal strength we show that, for $N$ large enough, in the Hilbert space of $R$ there exists a linear subspace ${C}_{N}$ which is dynamically decoupled from the environment. The states in ${C}_{N}$ evolve unitarily and are therefore decoherence-dissipation free. The space ${C}_{N}$ realizes a noiseless quantum code in which information can be stored, in principle, for an arbitrarily long time without being affected by errors.

A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer codewords bits, and an inner encoder whose input words are the permuted outer codewords. The construction can be generalized to h cascaded encoders separated by h-1 interleavers. We obtain upper bounds to the average maximum-likelihood bit error probability of serially concatenated block and convolutional coding schemes. Then, we derive design guidelines for the outer and inner encoders that maximize the interleaver gain and the asymptotic slope of the error probability curves. Finally, we propose a new, low-complexity iterative decoding algorithm. Throughout the paper, extensive comparisons with parallel concatenated convolutional codes known as "turbo codes" are performed, showing that the new scheme can offer superior performance.

The evolutionary trajectory of a protein through sequence space is constrained by its function. Collections of sequence homologs record the outcomes of millions of evolutionary experiments in which the protein evolves according to these constraints. Deciphering the evolutionary record held in these sequences and exploiting it for predictive and engineering purposes presents a formidable challenge. The potential benefit of solving this challenge is amplified by the advent of inexpensive high-throughput genomic sequencing.In this paper we ask whether we can infer evolutionary constraints from a set of sequence homologs of a protein. The challenge is to distinguish true co-evolution couplings from the noisy set of observed correlations. We address this challenge using a maximum entropy model of the protein sequence, constrained by the statistics of the multiple sequence alignment, to infer residue pair couplings. Surprisingly, we find that the strength of these inferred couplings is an excellent predictor of residue-residue proximity in folded structures. Indeed, the top-scoring residue couplings are sufficiently accurate and well-distributed to define the 3D protein fold with remarkable accuracy.We quantify this observation by computing, from sequence alone, all-atom 3D structures of fifteen test proteins from different fold classes, ranging in size from 50 to 260 residues, including a G-protein coupled receptor. These blinded inferences are de novo, i.e., they do not use homology modeling or sequence-similar fragments from known structures. The co-evolution signals provide sufficient information to determine accurate 3D protein structure to 2.7-4.8 Å C(α)-RMSD error relative to the observed structure, over at least two-thirds of the protein (method called EVfold, details at http://EVfold.org). This discovery provides insight into essential interactions constraining protein evolution and will facilitate a comprehensive survey of the universe of protein structures, new strategies in protein and drug design, and the identification of functional genetic variants in normal and disease genomes.

Community structure is one of the main structural features of networks, revealing both their internal organization and the similarity of their elementary units. Despite the large variety of methods proposed to detect communities in graphs, there is a big need for multi-purpose techniques, able to handle different types of datasets and the subtleties of community structure. In this paper we present OSLOM (Order Statistics Local Optimization Method), the first method capable to detect clusters in networks accounting for edge directions, edge weights, overlapping communities, hierarchies and community dynamics. It is based on the local optimization of a fitness function expressing the statistical significance of clusters with respect to random fluctuations, which is estimated with tools of Extreme and Order Statistics. OSLOM can be used alone or as a refinement procedure of partitions/covers delivered by other techniques. We have also implemented sequential algorithms combining OSLOM with other fast techniques, so that the community structure of very large networks can be uncovered. Our method has a comparable performance as the best existing algorithms on artificial benchmark graphs. Several applications on real networks are shown as well. OSLOM is implemented in a freely available software (http://www.oslom.org), and we believe it will be a valuable tool in the analysis of networks.

The technologies, architectures, and methodologies traditionally used to develop distributed applications exhibit a variety of limitations and drawbacks when applied to large scale distributed settings (e.g., the Internet). In particular, they fail in providing the desired degree of configurability, scalability, and customizability. To address these issues, researchers are investigating a variety of innovative approaches. The most promising and intriguing ones are those based on the ability of moving code across the nodes of a network, exploiting the notion of mobile code. As an emerging research field, code mobility is generating a growing body of scientific literature and industrial developments. Nevertheless, the field is still characterized by the lack of a sound and comprehensive body of concepts and terms. As a consequence, it is rather difficult to understand, assess, and compare the existing approaches. In turn, this limits our ability to fully exploit them in practice, and to further promote the research work on mobile code. Indeed, a significant symptom of this situation is the lack of a commonly accepted and sound definition of the term mobile code itself. This paper presents a conceptual framework for understanding code mobility. The framework is centered around a classification that introduces three dimensions: technologies, design paradigms, and applications. The contribution of the paper is two-fold. First, it provides a set of terms and concepts to understand and compare the approaches based on the notion of mobile code. Second, it introduces criteria and guidelines that support the developer in the identification of the classes of applications that can leverage off of mobile code, in the design of these applications, and, finally, in the selection of the most appropriate implementation technologies. The presentation of the classification is intertwined with a review of state-of-the-art in the field. Finally, the use of the classification is exemplified in a case study.

We consider a nonlinear, passive optical system contained in an appropriate cavity, and driven by a coherent, plane-wave, stationary beam. Under suitable conditions, diffraction gives rise to an instability which leads to the emergence of a stationary spatial dissipative structure in the transverse profile of the transmitted beam.