Principle Component Analysis in Conjuction with Data Driven Methods for Sediment Load Prediction

This study investigates sediment load prediction and generalization from laboratory scale to field scale using principle component analysis (PCA) in conjunction with data driven methods of artificial neural networks (ANNs) and genetic algorithms (GAs). Five main dimensionless parameters for total load are identified by using PCA. These parameters are used in the input vector of ANN for predicting total sediment loads. In addition, nonlinear equations are constructed, based upon the same identified dimensionless parameters. The optimal values of exponents and constants of the equations are obtained by the GA method. The performance of the so-developed ANN and GA based methods is evaluated using laboratory and field data. Results show that the expert methods (ANN and GA), calibrated with laboratory data, are capable of predicting total sediment load in field, thus showing their transferability. In addition, this study shows that the expert methods are not transferable for suspended load, perhaps due to insufficient laboratory data. Yet, these methods are able to predict suspended load in field, when trained with respective field data.     

Hierarchical Classifiers for Robust Topological Robot Localization

This paper presents a novel appearance-based technique for topological robot localization and place recognition. A vocabulary of visual words is formed automatically, representing local features that frequently occur in the set of training images. Using the vocabulary, a spatial pyramid representation is built for each image by repeatedly subdividing it and computing histograms of visual words at increasingly fine resolutions. An information maximization technique is then applied to build a hierarchical classifier for each class by learning informative features. While top-level features in the hierarchy are selected from the coarsest resolution of the representation, capturing the holistic statistical properties of the images, child features are selected from finer resolutions, encoding more local characteristics, redundant with the information coded by their parents. Exploiting the redundancy in the data enables the localization system to achieve greater reliability against dynamic variations in the environment. Achieving an average classification accuracy of 88.9% on a challenging topological localization database, consisting of twenty seven outdoor places, demonstrates the advantages of our hierarchical framework for dealing with dynamic variations that cannot be learned during training.     

Classification of primitive shapes using brain–computer interfaces

Brain–computer interfaces (BCIs) are recent developments in alternative technologies of user interaction. The purpose of this paper is to explore the potential of BCIs as user interfaces for CAD systems. The paper describes experiments and algorithms that use the BCI to distinguish between primitive shapes that are imagined by a user. Users wear an electroencephalogram (EEG) headset and imagine the shape of a cube, sphere, cylinder, pyramid or a cone. The EEG headset collects brain activity from 14 locations on the scalp. The data is analyzed with independent component analysis (ICA) and the Hilbert–Huang Transform (HHT). The features of interest are the marginal spectra of different frequency bands (theta, alpha, beta and gamma bands) calculated from the Hilbert spectrum of each independent component. The Mann–Whitney U-test is then applied to rank the EEG electrode channels by relevance in five pair-wise classifications. The features from the highest ranking independent components form the final feature vector which is then used to train a linear discriminant classifier. Results show that this classifier can discriminate between the five basic primitive objects with an average accuracy of about 44.6% (compared to naïve classification rate of 20%) over ten subjects (accuracy range of 36%–54%). The accuracy classification changes to 39.9% when both visual and verbal cues are used. The repeatability of the feature extraction and classification was checked by conducting the experiment on 10 different days with the same participants. This shows that the BCI holds promise in creating geometric shapes in CAD systems and could be used as a novel means of user interaction.     

Influence of Ge addition on the morphology and properties of TiN thin films deposited by magnetron sputtering

Thin films of TM-X-N (TM stands for early transition metal and X = Si, Al, etc.) are used as protective coatings. The most investigated among the ternary composite systems is Ti-Si-N. The system Ti-Ge-N has been chosen to extend the knowledge about the formation of nanocomposite films. Ti-Ge-N thin films were deposited by reactive magnetron sputtering on Si and WC-Co substrates at T_s = 240 °C, from confocal Ti and Ge targets in mixed Ar/N₂ atmosphere. The nitrogen partial pressure and the power on the Ti target were kept constant, while the power on the Ge target was varied in order to obtain various Ge concentrations in the films. No presence of Ge-N bonds was detected, while X-ray photoelectron spectroscopy measurements revealed the presence of Ti-Ge bonds. Transmission Electron Microscopy investigations have shown important changes induced by Ge addition in the morphology and structure of Ti-Ge-N films. Electron Energy-Loss Spectrometry study revealed a significant increase of Ge content at the grain boundaries. The segregation of Ge atoms to the TiN crystallite surface appears to be responsible for limitation of crystal growth and formation of a TiGe_y amorphous phase.     

Failure analysis of unidirectional polymeric matrix composites with two serial pin loaded-holes

The objective of this study is to investigate the effects of geometrical and physical parameters on failure modes and failure loads in unidirectional polymeric matrix composites with two serial pin loaded holes, analytically and experimentally. It is assumed that all of unidirectional fibers in the laminate lie in one direction while loaded by a load p ₀ at infinity, parallel to the direction of the fibers. To derive equilibrium equations based on a Shear-Lag theory, a rectangular arrangement of fibers is considered and with the proper use of boundary and boundness conditions, stress and displacement fields are computed within the laminate, along with the surrounding pinholes. Finally by using the Hashin criterion failure modes and failure loads are estimated. To validate analytical results based on shear-lag theory, an experimental program is carried out. A very good agreement is observed between two procedures. Based on results, in small sizes of two pins, the dominant failure mode is bearing and with the increasing of hole sizes, failure modes are changed to tension and shear modes.     

Wettability alteration and retention of mixed polymer-grafted silica nanoparticles onto oil-wet porous medium

Enhanced oil recovery(EOR)processes are applied to recover trapped or residual oil in the reservoir rocks after primary and secondary recovery methods.Changing ...     

A hybrid metaheuristic approach for the capacitated p-median problem

The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering distances and capacities for the services to be given by each median. This paper presents an efficient hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from the current solution to a neighbor solution, an open median is selected and closed. Then, a linear programming (LP) model is generated by relaxing binary constraints and adding new constraints. The generated LP solution is improved using cutting-plane inequalities. The solution of this strong LP is considered as a new neighbor solution. In order to select an open median to be closed, several strategies are proposed. The neighborhood structure is combined with a tabu search algorithm in the proposed approach. The parameters of the proposed hybrid algorithm are tuned using design of experiments approach. The proposed algorithm is tested on several sets of benchmark instances. The statistical analysis shows efficiency and effectiveness of the hybrid algorithm in comparison with the best approach found in the literature.     

Model-based PI–fuzzy control of four-wheeled omni-directional mobile robots

The purpose of this study is to suggest and examine a PI–fuzzy path planner and associated low-level control system for a linear discrete dynamic model of omni-directional mobile robots to obtain optimal inputs for drivers. Velocity and acceleration filtering is also implemented in the path planner to satisfy planning prerequisites and prevent slippage. Regulated drivers’ rotational velocities and torques greatly affect the ability of these robots to perform trajectory planner tasks. These regulated values are examined in this research by setting up an optimal controller. Introducing optimal controllers such as linear quadratic tracking for multi-input–multi-output control systems in acceleration and deceleration is one of the essential subjects for motion control of omni-directional mobile robots. The main topics presented and discussed in this article are improvements in the presented discrete-time linear quadratic tracking approach such as the low-level controller and combined PI–fuzzy path planner with appropriate speed monitoring algorithm such as the high-level one in conditions both with and without external disturbance. The low-level tracking controller presented in this article provides an optimal solution to minimize the differences between the reference trajectory and the system output. The efficiency of this approach is also compared with that of previous PID controllers which employ kinematic modeling. Utilizing the new approach in trajectory-planning controller design results in more precise and appropriate outputs for the motion of four-wheeled omni-directional mobile robots, and the modeling and experimental results confirm this issue.     

A new rateless code with unequal error protection property

In our previous work, “robust transmission of scalable video stream using modified LT codes”, an LT code with unequal packet protection property was proposed. It was seen that applying the proposed code to any importance-sorted input data, could increase the probability of early decoding of the most important parts when enough number of encoded symbols is available at the decoder’s side. In this work, the performance of the proposed method is assessed in general case for a wide range of loss rate, even when there are not enough encoded symbols at the decoder’s side. Also in this work the degree distribution of input nodes is investigated in more detail. It is illustrated that sorting input nodes in encoding graph, as what we have done in our work, has superior advantage in comparison with unequal input node selection method that is used in traditional rateless code with unequal error protection property.     

Combination of data replication and scheduling algorithm for improving data availability in Data Grids

Data Grid is a geographically distributed environment that deals with large-scale data-intensive applications. Effective scheduling in Grid can reduce the amount of data transferred among nodes by submitting a job to a node, where most of the requested data files are available. Data replication is another key optimization technique for reducing access latency and managing large data by storing data in a wisely manner. In this paper two algorithms are proposed, first a novel job scheduling algorithm called Combined Scheduling Strategy (CSS) that uses hierarchical scheduling to reduce the search time for an appropriate computing node. It considers the number of jobs waiting in queue, the location of required data for the job and the computing capacity of sites. Second a dynamic data replication strategy, called the Modified Dynamic Hierarchical Replication Algorithm (MDHRA) that improves file access time. This strategy is an enhanced version of Dynamic Hierarchical Replication (DHR) strategy. Data replication should be used wisely because the storage capacity of each Grid site is limited. Thus, it is important to design an effective strategy for the replication replacement. MDHRA replaces replicas based on the last time the replica was requested, number of access, and size of replica. It selects the best replica location from among the many replicas based on response time that can be determined by considering the data transfer time, the storage access latency, the replica requests that waiting in the storage queue and the distance between nodes. The simulation results demonstrate the proposed replication and scheduling strategies give better performance compared to the other algorithms.