A multi-objective adaptive immune algorithm for multi-application NoC mapping

Current SoC design trends are characterized by the integration of larger amount of IPs targeting a wide range of application fields. Such multi-application systems are constrained by a set of requirements. In such scenario network-on-chips (NoC) are becoming more important as the on-chip communication structure. Designing an optimal NoC for satisfying the requirements of each individual application requires the specification of a large set of configuration parameters leading to a wide solution space. It has been shown that IP mapping is one of the most critical parameters in NoC design, strongly influencing the SoC performance. IP mapping has been solved for single application systems using single and multi-objective optimization algorithms. In this paper we propose the use of a multi-objective adaptive immune algorithm (M(2)AIA), an evolutionary approach to solve the multi-application NoC mapping problem. Latency and power consumption were adopted as the target multi-objective functions. To compare the efficiency of our approach, our results are compared with those of the genetic and branch and bound multi-objective mapping algorithms. We tested 11 well-known benchmarks, including random and real applications, and combines up to 8 applications at the same SoC. The experimental results showed that the M(2)AIA decreases in average the power consumption and the latency 27.3 and 42.1 % compared to the branch and bound approach and 29.3 and 36.1 % over the genetic approach.

Solvability near the characteristic set for a special class of complex vector fields

This work deals with the solvability near the characteristic set Sigma = {0} x S-1 of operators of the form L = partial derivative/partial derivative t+(x(n) a(x)+ ix(m) b(x))partial derivative/partial derivative x, b not equivalent to 0 and a(0) not equal 0, defined on Omega(epsilon) = (-epsilon, epsilon) x S-1, epsilon > 0, where a and b are real-valued smooth functions in (-epsilon, epsilon) and m >= 2n. It is shown that given f belonging to a subspace of finite codimension of C-infinity (Omega(epsilon)) there is a solution u is an element of L-infinity of the equation Lu = f in a neighborhood of Sigma; moreover, the L-infinity regularity is sharp.

Mapping of angular leaf spot resistance QTL in common bean (Phaseolus vulgaris L.) under different environments

Background: Common bean (Phaseolus vulgaris L.) is the most important grain legume for human diet worldwide and the angular leaf spot (ALS) is one of the most devastating diseases of this crop, leading to yield losses as high as 80%. In an attempt to breed resistant cultivars, it is important to first understand the inheritance mode of resistance and to develop tools that could be used in assisted breeding. Therefore, the aim of this study was to identify quantitative trait loci (QTL) controlling resistance to ALS under natural infection conditions in the field and under inoculated conditions in the greenhouse. Results: QTL analyses were made using phenotypic data from 346 recombinant inbreed lines from the IAC-UNA x CAL 143 cross, gathered in three experiments, two of which were conducted in the field in different seasons and one in the greenhouse. Joint composite interval mapping analysis of QTL x environment interaction was performed. In all, seven QTLs were mapped on five linkage groups. Most of them, with the exception of two, were significant in all experiments. Among these, ALS10.1(DG,UC) presented major effects (R-2 between 16% - 22%). This QTL was found linked to the GATS11b marker of linkage group B10, which was consistently amplified across a set of common bean lines and was associated with the resistance. Four new QTLs were identified. Between them the ALS5.2 showed an important effect (9.4%) under inoculated conditions in the greenhouse. ALS4.2 was another major QTL, under natural infection in the field, explaining 10.8% of the variability for resistance reaction. The other QTLs showed minor effects on resistance. Conclusions: The results indicated a quantitative inheritance pattern of ALS resistance in the common bean line CAL 143. QTL x environment interactions were observed. Moreover, the major QTL identified on linkage group B10 could be important for bean breeding, as it was stable in all the environments. Thereby, the GATS11b marker is a potential tool for marker assisted selection for ALS resistance.

URANS calculations for smooth circular cylinder flow in a wide range of Reynolds Numbers: solution verification and validation

The flow around circular smooth fixed cylinder in a large range of Reynolds numbers is considered in this paper. In order to investigate this canonical case, we perform CFD calculations and apply verification & validation (V&V) procedures to draw conclusions regarding numerical error and, afterwards, assess the modeling errors and capabilities of this (U)RANS method to solve the problem. Eight Reynolds numbers between Re = 10 and Re 5 x 10(5) will be presented with, at least, four geometrically similar grids and five discretization in time for each case (when unsteady), together with strict control of iterative and round-off errors, allowing a consistent verification analysis with uncertainty estimation. Two-dimensional RANS, steady or unsteady, laminar or turbulent calculations are performed. The original 1994 k - omega SST turbulence model by Menter is used to model turbulence. The validation procedure is performed by comparing the numerical results with an extensive set of experimental results compiled from the literature. [DOI: 10.1115/1.4007571]

A new evolutionary clustering search for a no-wait flow shop problem with set-up times

This paper addresses the m-machine no-wait flow shop problem where the set-up time of a job is separated from its processing time. The performance measure considered is the total flowtime. A new hybrid metaheuristic Genetic Algorithm-Cluster Search is proposed to solve the scheduling problem. The performance of the proposed method is evaluated and the results are compared with the best method reported in the literature. Experimental tests show superiority of the new method for the test problems set, regarding the solution quality. (c) 2012 Elsevier Ltd. All rights reserved.

Mapping the hydrodynamic response to the initial geometry in heavy-ion collisions

We investigate how the initial geometry of a heavy-ion collision is transformed into final flow observables by solving event-by-event ideal hydrodynamics with realistic fluctuating initial conditions. We study quantitatively to what extent anisotropic flow (nu(n)) is determined by the initial eccentricity epsilon(n) for a set of realistic simulations, and we discuss which definition of epsilon(n) gives the best estimator of nu(n). We find that the common practice of using an r(2) weight in the definition of epsilon(n) in general results in a poorer predictor of nu(n) than when using r(n) weight, for n > 2. We similarly study the importance of additional properties of the initial state. For example, we show that in order to correctly predict nu(4) and nu(5) for noncentral collisions, one must take into account nonlinear terms proportional to epsilon(2)(2) and epsilon(2)epsilon(3), respectively. We find that it makes no difference whether one calculates the eccentricities over a range of rapidity or in a single slice at z = 0, nor is it important whether one uses an energy or entropy density weight. This knowledge will be important for making a more direct link between experimental observables and hydrodynamic initial conditions, the latter being poorly constrained at present.

Mapping virtual networks onto substrate networks

Network virtualization is a promising technique for building the Internet of the future since it enables the low cost introduction of new features into network elements. An open issue in such virtualization is how to effect an efficient mapping of virtual network elements onto those of the existing physical network, also called the substrate network. Mapping is an NP-hard problem and existing solutions ignore various real network characteristics in order to solve the problem in a reasonable time frame. This paper introduces new algorithms to solve this problem based on 0–1 integer linear programming, algorithms based on a whole new set of network parameters not taken into account by previous proposals. Approximative algorithms proposed here allow the mapping of virtual networks on large network substrates. Simulation experiments give evidence of the efficiency of the proposed algorithms.