Abstract

Purpose: To model the modifiable risk factors by using the logistic regression (LR) and artificial neural network (ANN) models for prediction of progression of Age-related Macular Degeneration (AMD) and cross-validate these models for their predictive accuracies in a population in South India. Methods: The data (N= 3,723) were analyzed from Andhra Pradesh Eye Disease Study (APEDS) on participants aged≥ 40 years. Sub-population data from this sample were drawn by using Random under Sampling (RUS)(n= 213) and combination of RUS and Random over Sampling (ROS)(n= 1420) techniques. The modifiable and non-modifiable risk factors which were elicited as part of the study were used to derive the LR based risk score models and the model fit was assessed using bootstrap method for internal validity. The ANN model was built for three sets of data using the multi-layer feed-forward back propagation …

Abstract

Extreme learning machine (ELM) as a new learning approach has shown its good generalization performance in regression and classification applications. Clustering analysis is an important tool to explore the structure of data and has been employed in many disciplines and applications. In this paper, we present a method that builds on ELM projection of input data into a high-dimensional feature space and followed by unsupervised clustering using artificial bee colony (ABC) algorithm. While ELM projection facilitates separability of clusters, a metaheuristic technique such as ABC algorithm overcomes problems of dependence on initialization of cluster centers and convergence to local minima suffered by conventional algorithms such as K-means. The proposed ELM-ABC algorithm is tested on 12 benchmark data sets. The experimental results show that the ELM-ABC algorithm can effectively improve the …

Abstract

Voltage noise can lead to various errors such as dynamic and permanent, which are directly associated to circuit-level reliability issues. Variability in process parameters directly affects the probability of failures associated to voltage noise. Yet, the evaluation of the probability of failures by SPICE level Monte Carlo simulation is prohibitively time-consuming. This work proposes a technique to characterize the input noise and process variations in order to estimate failure probability in a logic circuit path composed of combinational cells and registers. The method allows to correctly estimate the order of magnitude of the probability of failures and to evidence the influence of process variations, while reaching >104 speedup versus SPICE.

Abstract

Aging phenomena, on top of process variations along with temperature and supply voltage variations, translate into complex degradation effects on the required performance and yield of nanoscale circuits. The proposed paper focuses on the development of mathematically optimal circuit sizing for yield maximization on the case study of a CMOS full adder circuit. The final cell design is robust against NBTI aging effects, impact of statistical (global and mismatch) and operating variation of temperature and supply voltage. Monte Carlo analysis has been carried out to verify the estimated yields. The demonstrated technique can be extended to a library of optimally designed digital cells

Abstract

Perception of temporal duration is subjective and is influenced by factors such as attention and context. For example, unexpected or emotional events are often experienced as if time subjectively expands, suggesting that the amount of information processed in a unit of time can be increased. Time dilation effects have been measured with an oddball paradigm in which an infrequent stimulus is perceived to last longer than standard stimuli in the rest of the sequence. Likewise, time compression for the oddball occurs when the duration of the standard items is relatively brief. Here, we investigated whether the amount of information processing changes when time is perceived as distorted. On each trial, an oddball stimulus of varying numerosity (1–14 items) and duration was presented along with standard items that were either short (70 ms) or long (1050 ms). Observers were instructed to count the number of dots within the oddball stimulus and to judge its relative duration with respect to the standards on that trial. Consistent with previous results, oddballs were reliably perceived as temporally distorted: expanded for longer standard stimuli blocks and compressed for shorter standards. The occurrence of these distortions of time perception correlated with perceptual processing; i.e. enumeration accuracy increased when time was perceived as expanded and decreased with temporal compression. These results suggest that subjective time distortions are not epiphenomenal, but reflect real changes in sensory processing. Such short-term plasticity in information processing rate could be evolutionarily advantageous in optimizing perception and action …

Abstract

Promoters are DNA sequences containing regulatory elements required to guide and modulate the transcription initiation of the gene. Predicting promoter sequences in genomic sequences is a significant task in genome annotation and understanding transcriptional regulation. In the past decade many methods with many feature extraction schemes have been proposed for the prediction of eukaryotic and prokaryotic promoters. Still there is great need for more accurate and faster methods. In this paper we employed extreme learning machine algorithm (ELM), for promoter prediction in DNA sequences of H. sapiens, D. melanogaster, A. thaliana, C. elegans and E. coli. We extracted dinucleotide and CpG island features, and achieved accuracy above 90 % for all the five species. Performance is compared with the feed forward back propagation algorithm (BP) and support vector machines (SVM) and the …

Abstract

Task: The task is a probabilistic learning task as described in Pasquereau et al., 2007 where four visual cues are associated with different reward probabilities (0.00, 0.33, 0.66 & 1.00). A trial is made of the simultaneous presentation of two random cues with equal salience at two random positions. Some time after the presentation, a switch in the cortex activities is observed, representing the decision taken. After the model has chosen one cue or the other, a reward is given according to the probability associated with the chosen cue. Connections between the cortex and the striatum are then modified using a reinforcement learning rule based on the reward signal. The model is trained over 120 trials such that each combination of cues is presented equal number of times at uniformly sampled positions and the model performance reaches at least 0.9 measuring the ration of optimal choices. The decision switch and the performance are identical to the results when primates are tested with same task. Learning is then disabled and the model is tested using always the same pair of cues A (P (R)= 1) and B (P (R)= 0.33) in the presence of external factors. We study how, despite reward based learning, visual salience of the stimuli and the temporal difference between stimulus presentations affect the model to take a sub-optimal decision.

Abstract

This paper presents a novel approach for algorithmic singularity avoidance for reactionless visual servoing of a satellite mounted space robot. Task priority approach is used to perform visual servoing while reactionless manipulation of the space robot. Algorithmic singularity is prominent in such cases of prioritizing two tasks. The algorithmic singularity is different from the kinematic and dynamic singularities as the former is an artefact of the tasks at hand, and difficult to predict. In this paper, we present a geometric interpretation of its occurrence, and propose a method to avoid it. The method involves path planning in image space, and generates a sequence of images that guides the robot towards goal avoiding algorithmic singularity. The method is illustrated through numerical studies on a 6-DOF planar dual-arm robot mounted on a service satellite.

Abstract

This paper presents a new hierarchical architecture for parallelizing the computation intensive rapidly exploring random tree problem. The architecture resembles a tree like structure that agglutinates minimal inter-module communication of a shared memory with data integrity of a distributed memory. Another novelty of this research has been in quantitatively analysing the performance metrics of the RRT algorithm across numerous embedded hardware solutions and ultimately implementing this algorithm on an FPGA to achieve hardware level optimization that offers real time performance and economical power consumption levels. We then analyse our implementation against hardware implementation of other scalable parallel RRT methods for motion planning.

Abstract

In this paper, we propose a better planning technique of the standard walking gaits for a quadruped robot than the conventional successive gait transition method to realize omnidirectional static walking. The technique involved planning the sequence as well as motion of the swinging and supporting legs. The relationship between the stability margin, the stride length and the duty factor are also formulated mathematically. The proposed modified crawl gait is compared to the conventional method with respect to the above parameters geometrically as well as mathematically and is shown to have positive stability margin at all times. The successive gait transition is demonstrated on the modified crawl and rotation gaits. Computer simulations of a model quadruped robot were performed to validate the theory proposed. Experiments were performed on an actual quadruped robot to realize the omnidirectional static walking with increased stability margin.