Incorporation of a Regularization Term to Control Negative Correlation in Mixture of Experts

Combining accurate neural networks (NN) in the ensemble with negative error correlation greatly improves the generalization ability. Mixture of experts (ME) is a popular combining method which employs special error function for the simultaneous training of NN experts to produce negatively correlated NN experts. Although ME can produce negatively correlated experts, it does not include a control parameter like negative correlation learning (NCL) method to adjust this parameter explicitly. In this study, an approach is proposed to introduce this advantage of NCL into the training algorithm of ME, i.e., mixture of negatively correlated experts (MNCE). In this proposed method, the capability of a control parameter for NCL is incorporated in the error function of ME, which enables its training algorithm to establish better balance in bias-variance-covariance trade-off and thus improves the generalization ability. The proposed hybrid ensemble method, MNCE, is compared with their constituent methods, ME and NCL, in solving several benchmark problems. The experimental results show that our proposed ensemble method significantly improves the performance over the original ensemble methods.     

Direct adaptive fuzzy control with membership function tuning

In this paper, a direct self‐structured adaptive fuzzy control is introduced for the class of nonlinear systems with unknown dynamic models. Control is accomplished by an adaptive fuzzy system with a fixed number of rules and adaptive membership functions. The reference signal and state errors are used to tune the membership functions and update them instantaneously. The Lyapunov synthesis method is also used to guarantee the stability of the closed loop system. The proposed control scheme is applied to an inverted pendulum and a magnetic levitation system, and its effectiveness is shown via simulation. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

A Methionine Chemical Shift Based Order Parameter Characterizing Global Protein Dynamics

Coupling of side chain dynamics over long distances is an important component of allostery. Methionine side chains show the largest intrinsic flexibility among methyl-containing residues but the actual degree of conformational averaging depends on the proximity and mobility of neighboring residues. The ¹³C NMR chemical shifts of the methyl groups of methionine residues located at long distances in the same protein show a similar scaling with respect to the values predicted from the static X-ray structure by quantum methods. This results in a good linear correlation between calculated and observed chemical shifts. The slope is protein dependent and ranges from zero for the highly flexible calmodulin to 0.7 for the much more rigid calcineurin catalytic domain. The linear correlation is indicative of a similar level of side-chain conformational averaging over long distances, and the slope of the correlation line can be interpreted as an order parameter of the global side-chain flexibility.     

Long‐term water uptake behavior of natural fiber/polypropylene composites

Composites of different natural fibers and polypropylene were prepared and their long‐term water absorption behaviors were studied. Wood flour, rice hulls, newsprint fibers, and kenaf fibers (at 25 and 50% by weight contents) were mixed with polypropylene and 1 and 2% compatibilizer, respectively. Water absorption tests were carried out on injection‐molded specimens at room temperature for 5 weeks. Measurements were made every week and water absorption was calculated. Water diffusion coefficients were also calculated by evaluating the water absorption isotherms. Results indicated a significant difference among different natural fibers, with kenaf fibers and newsprint fibers exhibiting the highest and wood flour and rice hulls the lowest water absorption values, respectively. The difference between 25 and 50% fiber contents for all composite formulations increased at longer immersion times. Water diffusion coefficients of the composites were found to be about 3 orders of magnitude higher than that of pure PP. © 2005 Wiley Periodicals, Inc. J Appl Polym Sci, 2006     

Numerical and Experimental Study of an Under-Ground Water Reservoir,Cistern

This article presents experimental and numerical study of an under-ground water reservoir (cistern) during six months operation in a semi-arid region. The cistern with one dome, four windcatchers and a water reservoir is located in Lar, a hot arid city at south of Iran. Outdoor and indoor air temperature and humidity, water temperature in three depths and dome surface temperature were measured using a data logging system. The results show that the average air humidity inside the cistern was almost constant during the experiments but its slight variation during a day follows inside air temperature changes. The inside air temperature was always lower than the ambient temperature and inside and outside average air temperature difference was about 6 °C. The difference was slightly higher in the hot seasons. The water reservoir was also modeled in 2D, axisymmetric and quasi steady numerical simulation for six months of operation. Highly stratified water temperature distribution was observed in the numerical results as well as the experimental measurements.     

PGSW-OS: a novel approach for resource management in a semantic web operating system based on a P2P grid architecture

A web operating system is an operating system that users can access from any hardware at any location. A peer-to-peer (P2P) grid uses P2P communication for resource management and communication between nodes in a grid and manages resources locally in each cluster, and this provides a proper architecture for a web operating system. Use of semantic technology in web operating systems is an emerging field that improves the management and discovery of resources and services. In this paper, we propose PGSW-OS (P2P grid semantic Web OS), a model based on a P2P grid architecture and semantic technology to improve resource management in a web operating system through resource discovery with the aid of semantic features. Our approach integrates distributed hash tables (DHTs) and semantic overlay networks to enable semantic-based resource management by advertising resources in the DHT based upon their annotations to enable semantic-based resource matchmaking. Our model includes ontologies and virtual organizations. Our technique decreases the computational complexity of searching in a web operating system environment. We perform a simulation study using the Gridsim simulator, and our experiments show that our model provides enhanced utilization of resources, better search expressiveness, scalability, and precision.     

An improved Differential Evolution algorithm using learning automata and population topologies

A new variant of Differential Evolution (DE), called ADE-Grid, is presented in this paper which adapts the mutation strategy, crossover rate (CR) and scale factor (F) during the run. In ADE-Grid, learning automata (LA), which are powerful decision making machines, are used to determine the proper value of the parameters CR and F, and the suitable strategy for the construction of a mutant vector for each individual, adaptively. The proposed automata based DE is able to maintain the diversity among the individuals and encourage them to move toward several promising areas of the search space as well as the best found position. Numerical experiments are conducted on a set of twenty four well-known benchmark functions and one real-world engineering problem. The performance comparison between ADE-Grid and other state-of-the-art DE variants indicates that ADE-Grid is a viable approach for optimization. The results also show that the proposed ADE-Grid improves the performance of DE in terms of both convergence speed and quality of final solution.     

Perceiving,learning, and exploiting object affordances for autonomous pile manipulation

Autonomous manipulation in unstructured environments will enable a large variety of exciting and important applications. Despite its promise, autonomous manipulation remains largely unsolved. Even the most rudimentary manipulation task—such as removing objects from a pile—remains challenging for robots. We identify three major challenges that must be addressed to enable autonomous manipulation: object segmentation, action selection, and motion generation. These challenges become more pronounced when unknown man-made or natural objects are cluttered together in a pile. We present a system capable of manipulating unknown objects in such an environment. Our robot is tasked with clearing a table by removing objects from a pile and placing them into a bin. To that end, we address the three aforementioned challenges. Our robot perceives the environment with an RGB-D sensor, segmenting the pile into object hypotheses using non-parametric surface models. Our system then computes the affordances of each object, and selects the best affordance and its associated action to execute. Finally, our robot instantiates the proper compliant motion primitive to safely execute the desired action. For efficient and reliable action selection, we developed a framework for supervised learning of manipulation expertise. To verify the performance of our system, we conducted dozens of trials and report on several hours of experiments involving more than 1,500 interactions. The results show that our learning-based approach for pile manipulation outperforms a common sense heuristic as well as a random strategy, and is on par with human action selection.     

Performance evaluation of an importance sampling technique in a Jackson network

Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The standard approach, which simulates the system using an a priori fixed change of measure suggested by large deviation analysis, has been shown to fail in even the simplest network settings. Estimating probabilities associated with rare events has been a topic of great importance in queueing theory, and in applied probability at large. In this article, we analyse the performance of an importance sampling estimator for a rare event probability in a Jackson network. This article carries out strict deadlines to a two-node Jackson network with feedback whose arrival and service rates are modulated by an exogenous finite state Markov process. We have estimated the probability of network blocking for various sets of parameters, and also the probability of missing the deadline of customers for different loads and deadlines. We have finally shown that the probability of total population overflow may be affected by various deadline values, service rates and arrival rates.     

Analysis of impersonation attacks on systems using RF fingerprinting and low-end receivers

Recently, physical layer security commonly known as Radio Frequency (RF) fingerprinting has been proposed to provide an additional layer of security for wireless devices. A unique RF fingerprint can be used to establish the identity of a specific wireless device in order to prevent masquerading/impersonation attacks. In the literature, the performance of RF fingerprinting techniques is typically assessed using high-end (expensive) receiver hardware. However, in most practical situations receivers will not be high-end and will suffer from device specific impairments which affect the RF fingerprinting process. This paper evaluates the accuracy of RF fingerprinting employing low-end receivers. The vulnerability to an impersonation attack is assessed for a modulation-based RF fingerprinting system employing low-end commodity hardware (by legitimate and malicious users alike). Our results suggest that receiver impairment effectively decreases the success rate of impersonation attack on RF fingerprinting. In addition, the success rate of impersonation attack is receiver dependent.