Thermal stability in bulk cryomilled ultrafine-grained 5083 Al alloy

Thermal stability in bulk ultrafine-grained (UFG) 5083 Al that was processed by gas atomization followed by cryomilling, consolidation, and extrusion, and that exhibited an average grain size of 305 nm, was investigated in the temperature range of 473 to 673 K (0.55 to 0.79 T _m , where T _m is the melting temperature of the material) for different annealing times. Appreciable grain growth was observed at temperatures > 573 K, whereas there was limited grain growth at temperatures < 573 K even after long annealing times. The values of the grain growth exponent, n, deduced from the grain growth data were higher than the value of 2 predicted from elementary grain growth theories. The discrepancy was attributed to the operation of strong pinning forces on boundaries during the annealing treatment. An examination of the microstructure of the alloy suggests that the origin of the pinning forces is most likely related to the presence of dispersion particles, which are mostly introduced during cryomilling. Two-grain growth regimes were identified: the low-temperature region (<573 K) and the high-temperature region (>573 K). For temperatures lower than 573 K, the activation energy of 25 ± 5 kJ/mol was determined. It is suggested that this low activation energy represents the energy for the reordering of grain boundaries in the UFG material. For temperatures higher than 573 K, an activation energy of 124 ± 5 kJ/mol was measured. This value of activation energy, 124 ± 5 kJ/mol, lies between that for grain boundary diffusion and lattice diffusion in analogous aluminum polycrystalline systems. The results show that the strength and ductility of bulk UFG 5083 Al, as obtained from tensile tests, correlate well with substructural changes introduced in the alloy by the annealing treatment.     

Group technology based adaptive cell formation using predator-prey genetic algorithm

In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future.     

Generating vegetation leaf area index Earth system data record from multiple sensors. Part 2: Implementation,analysis and validation

The evaluation of a new global monthly leaf area index (LAI) data set for the period July 1981 to December 2006 derived from AVHRR Normalized Difference Vegetation Index (NDVI) data is described. The physically based algorithm is detailed in the first of the two part series. Here, the implementation, production and evaluation of the data set are described. The data set is evaluated both by direct comparisons to ground data and indirectly through inter-comparisons with similar data sets. This indirect validation showed satisfactory agreement with existing LAI products, importantly MODIS, at a range of spatial scales, and significant correlations with key climate variables in areas where temperature and precipitation limit plant growth. The data set successfully reproduced well-documented spatio-temporal trends and inter-annual variations in vegetation activity in the northern latitudes and semi-arid tropics. Comparison with plot scale field measurements over homogeneous vegetation patches indicated a 7% underestimation when all major vegetation types are taken into account. The error in mean values obtained from distributions of AVHRR LAI and high-resolution field LAI maps for different biomes is within 0.5 LAI for six out of the ten selected sites. These validation exercises though limited by the amount of field data, and thus less than comprehensive, indicated satisfactory agreement between the LAI product and field measurements. Overall, the inter-comparison with short-term LAI data sets, evaluation of long term trends with known variations in climate variables, and validation with field measurements together build confidence in the utility of this new 26 year LAI record for long term vegetation monitoring and modeling studies.     

Prognostics of machine condition using soft computing

This paper presents a system for monitoring and prognostics of machine conditions using soft computing (SC) techniques. The machine condition is assessed through a suitable ‘monitoring index’ extracted from the vibration signals. The progression of the monitoring index is predicted using an SC technique, namely adaptive neuro-fuzzy inference system (ANFIS). Comparison with a machine learning method, namely support vector regression (SVR), is also presented. The proposed prediction procedures have been evaluated through benchmark data sets. The prognostic effectiveness of the techniques has been illustrated through previously published data on several types of faults in machines. The performance of SVR was found to be better than ANFIS for the data sets used. The results are helpful in understanding the relationship of machine conditions, the corresponding indicating features, the level of damage/degradation and their progression.     

AVCOL: Availability-aware information aggregation in large distributed systems under uncollaborative behavior

Aggregation of system-wide information in large-scale distributed systems, such as p2p systems and Grids, can be unfairly influenced by nodes that are selfish, colluding with each other, or are offline most of the time. We present AVCOL, which uses probabilistic and gossip-style techniques to provide availability-aware aggregation. Concretely, AVCOL is the first aggregation system that: (1) implements any (arbitrary) global predicate that explicitly specifies any node’s probability of inclusion in the global aggregate, as a mathematical function of that node’s availability (i.e., percentage time online); (2) probabilistically tolerates large numbers of selfish nodes and large groups of colluders; and (3) scales well with hundreds to thousands of nodes. AVCOL uses several unique design decisions: per-aggregation tree construction where nodes are allowed a limited but flexible probabilistic choice of parents or children, probabilistic aggregation along trees, and auditing of nodes both during aggregation as well as in gossip-style (i.e., periodically). We have implemented AVCOL, and we experimentally evaluated it using real-life churn traces. Our evaluation and our mathematical analysis show that AVCOL satisfies arbitrary predicates, scales well, and withstands a variety of selfish and colluding attacks.     

Multilevel segmentation of Hippocampus images using global steered quantum inspired firefly algorithm

Applied Intelligence - Microscopic Image segmentation has a crucial role in detecting and diagnosing numerous critical diseases like Alzheimer’s disease, Kidney disease, Cancer, many...     

Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks

All elliptic curve cryptographic schemes are based on scalar multiplication of points, and hence its faster computation signifies faster operation. This paper proposes two different parallelization techniques to speedup the GF(p) elliptic curve multiplication in affine coordinates and the corresponding architectures. The proposed implementations are capable of resisting different side channel attacks based on time and power analysis. The 160, 192, 224 and 256 bits implementations of both the architectures have been synthesized and simulated for both FPGA and 0.13μ CMOS ASIC. The final designs have been prototyped on a Xilinx Virtex-4 xc4vlx200-12ff1513 FPGA board and performance analyzes carried out. The experimental result and performance comparison show better throughput of the proposed implementations as compared to existing reported architectures.     

Construction of a radial basis function network using an evolutionary algorithm for grade estimation in a placer gold deposit

This paper presents a study highlighting the predictive performance of a radial basis function (RBF) network in estimating the grade of an offshore placer gold deposit. In applying the radial basis function network to grade estimation of the deposit, several pertinent issues regarding RBF model construction are addressed in this study. One of the issues is the selection of the RBF network along with its center and width parameters. Selection was done by an evolutionary algorithm that utilizes the concept of cooperative coevolutions of the RBFs and the associated network. Furthermore, the problem of data division, which arose during the creation of the training, calibration and validation of data sets for the RBF model development, was resolved with the help of an integrated approach of data segmentation and genetic algorithms (GA). A simulation study conducted showed that nearly 27% of the time, a bad data division would result if random data divisions were adopted in this study. In addition, the efficacy of the RBF network was tested against a feed-forward network and geostatistical techniques. The outcome of this comparative study indicated that the RBF model performed decisively better than the feed-forward network and the ordinary kriging (OK).