Multi expression programming: a new approach to formulation of soil classification

This paper presents an alternative approach to formulation of soil classification by means of a promising variant of genetic programming (GP), namely multi expression programming (MEP). Properties of soil, namely plastic limit, liquid limit, color of soil, percentages of gravel, sand, and fine-grained particles are used as input variables to predict the classification of soils. The models are developed using a reliable database obtained from the previously published literature. The results demonstrate that the MEP-based formulas are able to predict the target values to high degree of accuracy. The MEP-based formulation results are found to be more accurate compared with numerical and analytical results obtained by other researchers.     

An ant swarm-inspired energy-aware routing protocol for wireless ad-hoc networks

Primitive routing protocols for ad-hoc networks are “power hungry” and can therefore consume considerable amount of the limited amount of battery power resident in the nodes. Thus, routing in ad-hoc networks is very much energy-constrained. Continuous drainage of energy degrades battery performance as well. If a battery is allowed to intermittently remain in an idle state, it recovers some of its lost charge due to the charge recovery effect, which, in turn, results in prolonged battery life.In this paper, we use the ideas of naturally occurring ants’ foraging behavior (Dorigo and Stuetzle, 2004) [1] and based on those ideas, we design an energy-aware routing protocol, which not only incorporates the effect of power consumption in routing a packet, but also exploits the multi-path transmission properties of ant swarms and, hence, increases the battery life of a node. The efficiency of the protocol with respect to some of the existing ones has been established through simulations. It has been observed that the energy consumed in the network, the energy per packet in the case of EAAR are 60% less compared to MMBCR and the packets lost is only around 12% of what we have in AODV, in mobility scenarios.     

Adaptive popularity-driven replica placement in hierarchical data grids

Data grids support access to widely distributed storage for large numbers of users accessing potentially many large files. Efficient access is hindered by the high latency of the Internet. To improve access time, replication at nearby sites may be used. Replication also provides high availability, decreased bandwidth use, enhanced fault tolerance, and improved scalability. Resource availability, network latency, and user requests in a grid environment may vary with time. Any replica placement strategy must be able to adapt to such dynamic behavior. In this paper, we describe a new dynamic replica placement algorithm, Popularity Based Replica Placement (PBRP), for hierarchical data grids which is guided by file “popularity”. Our goal is to place replicas close to clients to reduce data access time while still using network and storage resources efficiently. The effectiveness of PBRP depends on the selection of a threshold value related to file popularity. We also present Adaptive-PBRP (APBRP) that determines this threshold dynamically based on data request arrival rates. We evaluate both algorithms using simulation. Results for a range of data access patterns show that our algorithms can shorten job execution time significantly and reduce bandwidth consumption compared to other dynamic replication methods.     

The setpoint overshoot method: A simple and fast closed-loop approach for PID tuning

A simple method has been developed for PID controller tuning of an unidentified process using closed-loop experiments. The proposed method requires one closed-loop step setpoint response experiment using a proportional only controller, and it mainly uses information about the first peak (overshoot) which is very easy to identify. The setpoint experiment is similar to the classical Ziegler–Nichols (1942) experiment, but the controller gain is typically about one half, so the system is not at the stability limit with sustained oscillations. Based on simulations for a range of first-order with delay processes, simple correlations have been derived to give PI controller settings similar to those of the SIMC tuning rules (Skogestad (2003) [6]). The recommended controller gain change is a function of the height of the first peak (overshoot), whereas the controller integral time is mainly a function of the time to reach the peak. The method includes a detuning factor that allows the user to adjust the final closed-loop response time and robustness. The proposed tuning method, originally derived for first-order with delay processes, has been tested on a wide range of other processes typical for process control applications and the results are comparable with the SIMC tunings using the open-loop model.     

RUSHES—an annotation and retrieval engine for multimedia semantic units

Multimedia analysis and reuse of raw un-edited audio visual content known as rushes is gaining acceptance by a large number of research labs and companies. A set of research projects are considering multimedia indexing, annotation, search and retrieval in the context of European funded research, but only the FP6 project RUSHES is focusing on automatic semantic annotation, indexing and retrieval of raw and un-edited audio-visual content. Even professional content creators and providers as well as home-users are dealing with this type of content and therefore novel technologies for semantic search and retrieval are required. In this paper, we present a summary of the most relevant achievements of the RUSHES project, focusing on specific approaches for automatic annotation as well as the main features of the final RUSHES search engine.     

Fuzzy grey relational analysis for software effort estimation

Accurate and credible software effort estimation is a challenge for academic research and software industry. From many software effort estimation models in existence, Estimation by Analogy (EA) is still one of the preferred techniques by software engineering practitioners because it mimics the human problem solving approach. Accuracy of such a model depends on the characteristics of the dataset, which is subject to considerable uncertainty. The inherent uncertainty in software attribute measurement has significant impact on estimation accuracy because these attributes are measured based on human judgment and are often vague and imprecise. To overcome this challenge we propose a new formal EA model based on the integration of Fuzzy set theory with Grey Relational Analysis (GRA). Fuzzy set theory is employed to reduce uncertainty in distance measure between two tuples at the k ^th continuous feature ( | ( x_o(k) - x_i(k) | ) \left( {\left| {\left( {{x_o}(k) - {x_i}(k)} \right.} \right|} \right) .GRA is a problem solving method that is used to assess the similarity between two tuples with M features. Since some of these features are not necessary to be continuous and may have nominal and ordinal scale type, aggregating different forms of similarity measures will increase uncertainty in the similarity degree. Thus the GRA is mainly used to reduce uncertainty in the distance measure between two software projects for both continuous and categorical features. Both techniques are suitable when relationship between effort and other effort drivers is complex. Experimental results showed that using integration of GRA with FL produced credible estimates when compared with the results obtained using Case-Based Reasoning, Multiple Linear Regression and Artificial Neural Networks methods.     

Hardware/software co-design of a real-time kernel based tracking system

The probabilistic visual tracking methods using color histograms have been proven to be robust to target model variations and background illumination changes as shown by the recent research. However, the required computational cost is high due to intensive image data processing. The embedded solution of such algorithms become challenging due to high computational power demand and algorithm complexity. This paper presents a hardware/software co-design architecture for implementation of the well-known kernel based mean shift tracking algorithm. The design uses color histogram of the target as tracking feature. The target is searched in the consecutive images by maximizing the statistical match of the color distributions. The target localization is based on gradient based iterative search instead of exhaustive search which makes the system capable of achieving frame rate up to hundreds of frames per second while tracking multiple targets. The design, which is fully standalone, is implemented on a low-cost medium-size field programmable gate array (FPGA) device. The hardware cost of the design is compared with some other tracking systems. The performance of the system in terms of speed is evaluated and compared with the software based implementation. It is expected that the proposed solution will find its utility in applications like embedded automatic video surveillance systems.     

Numerical solution of fuzzy relational equations based on smooth fuzzy norms

In this paper, we study and formulate a BP learning algorithm for fuzzy relational neural networks based on smooth fuzzy norms for functions approximation. To elaborate the model behavior more, we have used different fuzzy norms led to a new pair of fuzzy norms. An important practical case in fuzzy relational equations (FREs) is the identification problem which is studied in this work. In this work we employ a neuro-based approach to numerically solve the set of FREs and focus on generalized neurons that use smooth s-norms and t-norms as fuzzy compositional operators.     

ARO: A new model free optimization algorithm for real time applications inspired by the asexual reproduction

This paper presents a new individual based optimization algorithm, which is inspired from asexual reproduction known as a remarkable biological phenomenon, called as asexual reproduction optimization (ARO). ARO can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survive according to a performance index obtained from the underlying objective function of the optimization problem; this leads to the fitter individual. ARO adaptive search ability along with its strength and weakness points are fully described in the paper. Furthermore, the ARO convergence to the global optimum is mathematically analyzed. To approve the effectiveness of the ARO performance, it is tested with several benchmark functions frequently used in the area of optimization. Finally, the ARO performance is statistically compared with that of an improved genetic algorithm (GA). Results of simulation illustrate that ARO remarkably outperforms GA.     

Implementation of speed controller for rotary hydraulic motor based on LS-SVM

The performance of a model-based control system depends strongly on the accuracy of the process model used. LS-SVM is a powerful method for modeling nonlinear systems. The main objective of this paper is to implement a conventional controller based on LS-SVM model for hydraulic motor. An off-line model is first identified based on LS-SVM, then via simulation tests the parameters of the discrete PI-Controller and its velocity-form are obtained then the controller parameters are applied experimentally for the hydraulic motor as a speed controller. The system performance has been evaluated; results show good performance over a wide range of operating conditions and load disturbances.