Buffer management in a real-time shared disks cluster

A great deal of research indicates that the shared disks (SD) cluster is suitable to high performance transaction processing. However, the aggregation of SD cluster with real-time processing has not been investigated. By adopting cluster technology, the real-time services will be highly available and can exploit internode parallelism. In this paper, we consider buffer management issues in a real-time SD cluster. We first propose a real-time buffer coherency algorithm that exploits inherent characteristics of real-time applications and SD cluster. Then we extend traditional buffer replacement algorithms to the real-time SD cluster. They emphasize specific attributes of buffer pages to capitalize locality of references, transaction deadline, and affinity-based routing. We evaluate the performance of the proposed algorithms under a wide variety of transaction workloads and system configurations.     

A comprehensive survey on functional link neural networks and an adaptive PSO–BP learning for CFLNN

This paper proposed a hybrid genetic based functional link artificial neural network (HFLANN) with simultaneous optimization of input features for the purpose of solving the problem of classification in data mining. The aim of the proposed approach is to choose an optimal subset of input features using genetic algorithm by eliminating features with little or no predictive information and increase the comprehensibility of resulting HFLANN. Using the functionally expanded of selected features, HFLANN overcomes the nonlinearity nature of problems, which is commonly encountered in single-layer neural networks. The features like simplicity of the architecture and low computational complexity of the network encourage us to use it in classification task of data mining. Further, the issue of statistical tests for comparison of algorithms on multiple datasets, which is even more essential to typical machine learning and data mining studies, has been all but ignored. In this work, we recommend a set of simple, yet safe and robust parametric and nonparametric tests for statistical comparisons of HFLANN with FLANN and RBF classifiers over multiple datasets by an extensive simulation studies.     

Emergent self-organizing feature map for recognizing road sign images

Road sign recognition system remains a challenging part of designing an Intelligent Driving Support System. While there exist many approaches to classify road signs, none have adopted an unsupervised approach. This paper proposes a way of Self-Organizing feature mapping for recognizing a road sign. The emergent self-organizing map (ESOM) is employed for the feature mapping in this study. It has the capability of visualizing the distance structures as well as the density structure of high-dimensional data sets, in which the ESOM is suitable to detect non-trivial cluster structures. This paper discusses the usage of ESOM for road sign detection and classification. The benchmarking against some other commonly used classifiers was performed. The results demonstrate that the ESOM approach outperforms the others in conducting the same simulations of the road sign recognition. We further demonstrate that the result obtained with ESOM is significantly more superior than traditional SOM which does not take into the boundary effect like ESOM did.     

Two versions of architectures for dynamic implied addressing mode

The complexity of today’s embedded applications increases with various requirements such as execution time, code size or power consumption. To satisfy these requirements for performance, efficient instruction set design is one of the important issues because an instruction customized for specific applications can make better performance than multiple instructions in aspect of fast execution time, decrease of code size, and low power consumption. Limited encoding space, however, does not allow adding application specific and complex instructions freely to the instruction set architecture. To resolve this problem, conventional architectures increases free space for encoding by trimming excessive bits required beyond the fixed word length. This approach however shows severe weakness in terms of the complexity of compiler, code size and execution time. In this paper, we propose a new instruction encoding scheme based on the dynamic implied addressing mode (DIAM) to resolve limited encoding space and side-effect by trimming. We report our two versions of architectures to support our DIAM-based approach. In the first version, we use a special on-chip memory to store extra encoding information. In the second version, we replace the memory by a small on-chip buffer along with a special instruction. We also suggest a code generation algorithm to fully utilize DIAM. In our experiment, the architecture augmented with DIAM shows about 8% code size reduction and 18% speed up on average, as compared to the basic architecture without DIAM.     

Robust Calibration for Localization in Clustered Wireless Sensor Networks

This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor nodes in an ad-hoc sensor network. The calibration problem is formulated as a parameter estimation problem using a linear calibration model. For reducing or eliminating the unwanted influence of measurement corruptions or outliers on parameter estimation, which may be caused by sensor or communication failures, a robust regression estimator such as the least-trimmed squares (LTS) estimator is a natural choice. Despite the availability of the FAST-LTS routine in several statistical packages (e.g., R, S-PLUS, SAS), applying it to the sensor network calibration is not a simple task. To use the FAST-LTS, one needs to input a trimming parameter, which is a function of the sensor redundancy in a network. Computing the redundancy degree and subsequently solving the LTS estimation both turn out to be computationally demanding. Our research aims at utilizing some cluster structure in a network configuration in order to do robust estimation more efficiently. We present two algorithms that compute the exact value and a lower bound of the redundancy degree, respectively, and an algorithm that computes the LTS estimation. Two examples are presented to illustrate how the proposed methods help alleviate the computational demands associated with robust estimation and thus facilitate robust calibration in a sensor network.     

Modeling and simulation of powered hip orthosis by pneumatic actuators

In this study, a simulation model for a powered hip orthosis (PHO) with air muscles to predict the gait of paraplegics is presented which can be used as a design tool for hip orthoses. Before simulation, mathematical models for a human dummy with an orthosis and a pneumatic muscle actuator were generated. For the air muscle, coefficients required were obtained by static and dynamic experiments of the air muscle and experiments for the valve controlling the air pressure. The computation was conducted on the ADAMS package together with MATLAB. Computer simulation of the flexion of hip joints by the pneumatic muscle results in similar values to those from gait analysis. With the development of a simulation model for a PHO, the gait simulation model using pneumatic muscles can be used to analyze and evaluate the characteristics and efficiency of a PHO by setting the input and boundary conditions.     

Adaptive product tracking in RFID-enabled large-scale supply chain

The Radio Frequency Identification (RFID) technology is gradually being adopted and deployed for product flow management in the supply chain. In order to track RFID-tagged products efficiently in the RFID-enabled, large-scale supply chain, this paper first presents the design of a product tracking system that can collaborate with the EPC Network, a suite of network services for RFID data management in the supply chain. Next, we explain a product monitoring procedure that is performed by comparing the actual path of a product with its planned path. Finally, we develop an adaptive product search algorithm based on a reinforcement learning technique to efficiently locate a product deviated from its planned path. Experiment results are provided to show the performance of the search algorithm.     

Development of a sequential robust–tolerance design model for a destructive quality characteristic

Robust design (RD) and tolerance design (TD) have received much attention from researchers and practitioners for more than two decades, and a number of methodologies for modeling and optimizing the RD and TD processes have been studied. However, there is ample room for improvement. Because most existing research considers RD and TD as separate research fields, the primary objective of this paper is to develop a sequential robust–tolerance design method to jointly determine the best factor settings and the closed-form solutions for the optimal specification limits. We then apply the proposed method to a destructive quality characteristic. Finally, a case study and sensitivity analyses are performed for verification purposes, and further studies are discussed.     

Web-based algorithm for cylindricity evaluation using support vector machine learning

This paper introduces a cylindricity evaluation algorithm based on support vector machine learning with a specific kernel function, referred to as SVR, as a viable alternative to traditional least square method (LSQ) and non-linear programming algorithm (NLP). Using the theory of support vector machine regression, the proposed algorithm in this paper provides more robust evaluation in terms of CPU time and accuracy than NLP and this is supported by computational experiments. Interestingly, it has been shown that the SVR significantly outperforms LSQ in terms of the accuracy while it can evaluate the cylindricity in a more robust fashion than NLP when the variance of the data points increases. The robust nature of the proposed algorithm is expected because it converts the original nonlinear problem with nonlinear constraints into other nonlinear problem with linear constraints. In addition, the proposed algorithm is programmed using Java Runtime Environment to provide users with a Web based open source environment. In a real-world setting, this would provide manufacturers with an algorithm that can be trusted to give the correct answer rather than making a good part rejected because of inaccurate computational results.     

Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm

This paper deals with a scheduling problem for reentrant hybrid flowshop with serial stages where each stage consists of identical parallel machines. In a reentrant flowshop, a job may revisit any stage several times. Local-search based Pareto genetic algorithms with Minkowski distance-based crossover operator is proposed to approximate the Pareto optimal solutions for the minimization of makespan and total tardiness in a reentrant hybrid flowshop. The Pareto genetic algorithms are compared with existing multi-objective genetic algorithm, NSGA-II in terms of the convergence to optimal solution, the diversity of solution and the dominance of solution. Experimental results show that the proposed crossover operator and local search are effective and the proposed algorithm outperforms NSGA-II by statistical analysis.