Search

In this paper, a robust sliding mode control (SMC) based on backstepping technique is studied for a microgyroscope in the presence of unknown model uncertainties and external disturbances using adaptive fuzzy compensator and fractional calculus. At first, the dynamic of microgyroscope is transformed into analogically cascade system to guarantee the application of backstepping design. Then a novel fractional differential sliding surface is proposed which integrates the capacities of the fractional calculus and SMC. In order to reduce the chattering in SMC, a fuzzy logical system is utilized to approximate the external disturbances. In addition, fractional order adaptive laws are derived to estimate the damping and stiffness coefficients and angular velocity online based on Lyapunov stability theory which also guarantees the stability of the closed loop system. Finally, simulation results signify the robustness and effectiveness of the proposed control schemes and the comparison of root mean square error under different fractional orders and integer order are given to demonstrate the better performance of proposed controller. [ABSTRACT FROM AUTHOR]

Stock trend prediction is a challenging task due to the market’s noise, and machine learning techniques have recently been successful in coping with this challenge. In this research, we create a novel framework for stock prediction, Dynamic Advisor-Based Ensemble (dynABE). dynABE explores domain-specific areas based on the companies of interest, diversifies the feature set by creating different “advisors” that each handles a different area, follows an effective model ensemble procedure for each advisor, and combines the advisors together in a second-level ensemble through an online update strategy we developed. dynABE is able to adapt to price pattern changes of the market during the active trading period robustly, without needing to retrain the entire model. We test dynABE on three cobalt-related companies, and it achieves the best-case misclassification error of 31.12% and an annualized absolute return of 359.55% with zero maximum drawdown. dynABE also consistently outperforms the baseline models of support vector machine, neural network, and random forest in all case studies. [ABSTRACT FROM AUTHOR]

A two year long experimental dataset in which authors of Radin, et al., 2016 claim to find evidence of mind-matter interaction is independently re-analyzed. In this experiment, participants are asked to periodically shift their attention towards or away from a double-slit optical apparatus. Shifts in fringe visibility of the interference pattern are monitored and tested against the common sense null hypothesis that such shifts should not correlate with the participant’s attention state. We propose a deeper analysis of the dataset, identifying all the necessary arbitrary pre-analysis choices one needs to make, and carefully assessing the results’ robustness regarding these choices. Results are twofold. Firstly, even with a conservative correction for the multiple statistical tests the analysis calls for, we confirm the existence of significant although small anomalies in the direction predicted by the mind-matter interaction hypothesis. On the other hand, and unlike Radin, et al., 2016, we also report significant although even smaller anomalies in the control dataset. This leads us to conclude that this particular dataset does not provide strong evidence of mind-matter interaction, yet certainly contains inexplicable anomalies that should motivate replication attempts in highly controlled environments. [ABSTRACT FROM AUTHOR]

In this work we present a methodology able to use harmonized PET/CT imaging in dose painting by number (DPBN) approach by means of a robust and accurate treatment planning system. Image processing and treatment planning were performed by using a Matlab-based platform, called CARMEN, in which a full Monte Carlo simulation is included. Linear programming formulation was developed for a voxel-by-voxel robust optimization and a specific direct aperture optimization was designed for an efficient adaptive radiotherapy implementation. DPBN approach with our methodology was tested to reduce the uncertainties associated with both, the absolute value and the relative value of the information in the functional image. For the same H&N case, a single robust treatment was planned for dose prescription maps corresponding to standardized uptake value distributions from two different image reconstruction protocols: One to fulfill EARL accreditation for harmonization of [18F]FDG PET/CT image, and the other one to use the highest available spatial resolution. Also, a robust treatment was planned to fulfill dose prescription maps corresponding to both approaches, the dose painting by contour based on volumes and our voxel-by-voxel DPBN. Adaptive planning was also carried out to check the suitability of our proposal. Different plans showed robustness to cover a range of scenarios for implementation of harmonizing strategies by using the highest available resolution. Also, robustness associated to discretization level of dose prescription according to the use of contours or numbers was achieved. All plans showed excellent quality index histogram and quality factors below 2%. Efficient solution for adaptive radiotherapy based directly on changes in functional image was obtained. We proved that by using voxel-by-voxel DPBN approach it is possible to overcome typical drawbacks linked to PET/CT images, providing to the clinical specialist confidence enough for routinely implementation of functional imaging for personalized radiotherapy. [ABSTRACT FROM AUTHOR]

The importance of integrating research findings is incontrovertible and procedures for coordinate-based meta-analysis (CBMA) such as Activation Likelihood Estimation (ALE) have become a popular approach to combine results of fMRI studies when only peaks of activation are reported. As meta-analytical findings help building cumulative knowledge and guide future research, not only the quality of such analyses but also the way conclusions are drawn is extremely important. Like classical meta-analyses, coordinate-based meta-analyses can be subject to different forms of publication bias which may impact results and invalidate findings. The file drawer problem refers to the problem where studies fail to get published because they do not obtain anticipated results (e.g. due to lack of statistical significance). To enable assessing the stability of meta-analytical results and determine their robustness against the potential presence of the file drawer problem, we present an algorithm to determine the number of noise studies that can be added to an existing ALE fMRI meta-analysis before spatial convergence of reported activation peaks over studies in specific regions is no longer statistically significant. While methods to gain insight into the validity and limitations of results exist for other coordinate-based meta-analysis toolboxes, such as Galbraith plots for Multilevel Kernel Density Analysis (MKDA) and funnel plots and egger tests for seed-based d mapping, this procedure is the first to assess robustness against potential publication bias for the ALE algorithm. The method assists in interpreting meta-analytical results with the appropriate caution by looking how stable results remain in the presence of unreported information that may differ systematically from the information that is included. At the same time, the procedure provides further insight into the number of studies that drive the meta-analytical results. We illustrate the procedure through an example and test the effect of several parameters through extensive simulations. Code to generate noise studies is made freely available which enables users to easily use the algorithm when interpreting their results. [ABSTRACT FROM AUTHOR]

The accuracy and diversity of recommendation algorithms have always been the research hotspot of recommender systems. A good recommender system should not only have high accuracy and diversity, but also have adequate robustness against spammer attacks. However, the issue of recommendation robustness has received relatively little attention in the literature. In this paper, we systematically study the influences of different spammer behaviors on the recommendation results in various recommendation algorithms. We further propose an improved algorithm by incorporating the inner-similarity of user’s purchased items in the classic KNN approach. The new algorithm effectively enhances the robustness against spammer attacks and thus outperforms traditional algorithms in recommendation accuracy and diversity when spammers exist in the online commercial systems. [ABSTRACT FROM AUTHOR]

Proximal remote sensing is being used across a very wide range of research fields and by scientists, who are often without deep theoretical knowledge optical physics; the author of this article falls squarely in that category! This article highlights two optical phenomena, which may greatly influence the quality and robustness of proximal remote sensing: penetration and scattering. Penetration implies that acquired reflectance signals are associated with both physical and chemical properties of target objects from both the surface and internal tissues/structures. Scattering implies that reflectance signals acquired from one point or object are influenced by scattered radiometric energy from neighboring points or objects. Based on a series of laboratory experiments, penetration and scattering were discussed in the context of “robustness” (repeatability) of hyperspectral reflectance data. High robustness implies that it is possible to control imaging conditions and therefore: 1) obtain very similar radiometric signals from inert objects (objects that do not change) over time, and 2) be able to consistently distinguish objects that are otherwise highly similar in appearance (size, shape, and color) and in terms of biochemical composition. It was demonstrated that robustness of hyperspectral reflectance data (40 spectral bands from 385 to 1024 nm) were significantly influenced by penetration and scattering of radiometric energy. In addition, it was demonstrated that the influence of penetration and scattering varied across the examined spectrum. Characterization of how optical phenomena may affect the robustness of reflectance data is important when using proximal remote sensing technologies as tools used to classify engineering and biological objects. [ABSTRACT FROM AUTHOR]

Cables play an important role in transmitting energy and information. In this article, in order to obtain the S-parameters of the special twisted pair cable with rectangular connectors, a de-embedding method of the transmission matrix is proposed to deal with the two adapters ends of the cable. According to the frequency-dependent RLGC(f) model, the cable characteristics are extracted in the frequency range of 10 MHz to 200 MHz through conventional and modified methods respectively. The frequency-domain analysis shows that the inherent capacity of modified method can decrease the errors especially due to the discontinuities of hyperbolic functions. This research supplies an advantageous modelling approach for the cable to improve its robustness against disturbances in the S-parameters measurement that cannot be decreased with the calibration procedure. [ABSTRACT FROM AUTHOR]

Numerous benchmark datasets and evaluation toolkits have been designed to facilitate visual object tracking evaluation. However, it is not clear which evaluation protocols are preferred for different tracking objectives. Even worse, different evaluation protocols sometimes yield contradictory conclusions, further hampering reliable evaluation. Therefore, we 1) introduce the new concept of mirror tracking to measure the robustness of a tracker and identify its over-fitting scenarios; 2) measure the robustness of the evaluation ranks produced by different evaluation protocols; and 3) report a detailed analysis of milestone tracking challenges, indicating their application scenarios. Our experiments are based on two state-of-the-art challenges, namely, OTB and VOT, using the same trackers and datasets. Based on the experiments, we conclude that 1) the proposed mirror tracking metrics can identify the over-fitting scenarios of a tracker, 2) the ranks produced by OTB are more robust than those produced by VOT, and 3) the joint ranks produced by OTB and VOT can be used to measure failure recovery. [ABSTRACT FROM AUTHOR]

The robustness and resilience of complex networks have been widely studied and discussed in both research and industry because today, the diversity of system components and the complexity of the connection between units are increasingly influencing the reliability of complex systems. Previous studies have focused on node failure in networks, proposing several performance indicators. However, a single performance indicator cannot comprehensively measure all the performance aspects; thus, the selected performance indicators and recovery strategies lack consistency with respect to the targeted complex systems. This paper introduces a novel stress–strength-balanced weighted network model based on two network transmission hypotheses. Then, with respect to different concerns of the complex network, we propose two modified network performance measurement indicators and compare these indicators in terms of their trends in the attack process. In addition, we introduce several network recovery strategies and compare their efficiencies. Our findings are as follows: (1) The evaluation and judgment of the network performance depend on the performance measurement indicators we use. (2) Different recovery strategies exhibit distinct efficiencies in recovering different aspects of network performance, and no strategy exists that can improve all the network performance aspects simultaneously. (3) The timing of the recovery is proved to have a deep influence on the cost and efficiency of network recovery; thus, the optimal recovery strategy for a damaged network varies with the extent of the damage. From the results of the simulation of the attack-recovery process, we conclude that while defining and analyzing complex network models, we should adjust our network topology, weight assignment, and performance indicators in accordance with the focal characteristics of complex systems so that we can use the network model to build robust complex systems and efficient logistics and maintenance strategies. [ABSTRACT FROM AUTHOR]

This paper proposes a novel robust control method for the control of a 7-DOF exoskeleton robot. The external disturbances and unknown dynamics in the form of friction forces, different upper-limb’s mass, backlash, and input saturation make robot unstable, which prevents the robot from correctly following the defined path. A new fractional sliding mode controller (NFSMC) is designed, which is robust against unknown dynamic and external disturbances. Fractional PID controller (FPID) has high trajectory tracking, but it is not robust against external disturbances. Therefore, by combining NFSMC and FPID controllers, a new compound fractional PID sliding mode controller (NCFPIDSMC) is proposed, which benefits high trajectory tracking of FPID and robustness of NFSMC. The stability of the proposed control method is verified by Lyapunov theory. A random noise is applied in order to confirm the robustness of the proposed control method. [ABSTRACT FROM AUTHOR]

In this paper we compare systematically the most promising neuroevolutionary methods and two new original methods on the double-pole balancing problem with respect to: the ability to discover solutions that are robust to variations of the environment, the speed with which such solutions are found, and the ability to scale-up to more complex versions of the problem. The results indicate that the two original methods introduced in this paper and the Exponential Natural Evolutionary Strategy method largely outperform the other methods with respect to all considered criteria. The results collected in different experimental conditions also reveal the importance of regulating the selective pressure and the importance of exposing evolving agents to variable environmental conditions. The data collected and the results of the comparisons are used to identify the most effective methods and the most promising research directions. [ABSTRACT FROM AUTHOR]

The reconstruction of the topology of gene regulatory networks (GRNs) using high throughput genomic data such as microarray gene expression data is an important problem in systems biology. The main challenge in gene expression data is the high number of genes and low number of samples; also the data are often impregnated with noise. In this paper, in dealing with the noisy data, Kalman filter based method that has the ability to use prior knowledge on learning the network was used. In the proposed method namely (KFLR), in the first phase by using mutual information, the noisy regulations with low correlations were removed. The proposed method utilized a new closed form solution to compute the posterior probabilities of the edges from regulators to the target gene within a hybrid framework of Bayesian model averaging and linear regression methods. In order to show the efficiency, the proposed method was compared with several well know methods. The results of the evaluation indicate that the inference accuracy was improved by the proposed method which also demonstrated better regulatory relations with the noisy data. [ABSTRACT FROM AUTHOR]

Social and economic systems produce complex and nonlinear relationships in the indicator variables that describe them. We present a Bayesian methodology to analyze the dynamical relationships between indicator variables by identifying the nonlinear functions that best describe their interactions. We search for the ‘best’ explicit functions by fitting data using Bayesian linear regression on a vast number of models and then comparing their Bayes factors. The model with the highest Bayes factor, having the best trade-off between explanatory power and interpretability, is chosen as the ‘best’ model. To be able to compare a vast number of models, we use conjugate priors, resulting in fast computation times. We check the robustness of our approach by comparison with more prediction oriented approaches such as model averaging and neural networks. Our modelling approach is illustrated using the classical example of how democracy and economic growth relate to each other. We find that the best dynamical model for democracy suggests that long term democratic increase is only possible if the economic situation gets better. No robust model explaining economic development using these two variables was found. [ABSTRACT FROM AUTHOR]

Background: Wearable sensors offer the potential to bring new knowledge to inform interventions in patients affected by multiple sclerosis (MS) by thoroughly quantifying gait characteristics and gait deficits from prolonged daily living measurements. The aim of this study was to characterise gait in both laboratory and daily life conditions for a group of patients with moderate to severe ambulatory impairment due to MS. To this purpose, algorithms to detect and characterise gait from wearable inertial sensors data were also validated. Methods: Fourteen patients with MS were divided into two groups according to their disability level (EDSS 6.5–6.0 and EDSS 5.5–5.0, respectively). They performed both intermittent and continuous walking bouts (WBs) in a gait laboratory wearing waist and shank mounted inertial sensors. An algorithm (W-CWT) to estimate gait events and temporal parameters (mean and variability values) using data recorded from the waist mounted sensor (Dynaport, Mc Roberts) was tested against a reference algorithm (S-REF) based on the shank-worn sensors (OPAL, APDM). Subsequently, the accuracy of another algorithm (W-PAM) to detect and classify WBs was also tested. The validated algorithms were then used to quantify gait characteristics during short (sWB, 5–50 steps), intermediate (iWB, 51–100 steps) and long (lWB, >100 steps) daily living WBs and laboratory walking. Group means were compared using a two-way ANOVA. Results: W-CWT compared to S-REF showed good gait event accuracy (0.05–0.10 s absolute error) and was not influenced by disability level. It slightly overestimated stride time in intermittent walking (0.012 s) and overestimated highly variability of temporal parameters in both intermittent (17.5%–58.2%) and continuous walking (11.2%–76.7%). The accuracy of W-PAM was speed-dependent and decreased with increasing disability. The ANOVA analysis showed that patients walked at a slower pace in daily living than in the laboratory. In daily living gait, all mean temporal parameters decreased as the WB duration increased. In the sWB, the patients with a lower disability score showed, on average, lower values of the temporal parameters. Variability decreased as the WB duration increased. Conclusions: This study validated a method to quantify walking in real life in people with MS and showed how gait characteristics estimated from short walking bouts during daily living may be the most informative to quantify level of disability and effects of interventions in patients moderately affected by MS. The study provides a robust approach for the quantification of recognised clinically relevant outcomes and an innovative perspective in the study of real life walking. [ABSTRACT FROM AUTHOR]

Networks in nature rarely function in isolation but instead interact with one another with a form of a network of networks (NoN). A network of networks with interdependency between distinct networks contains instability of abrupt collapse related to the global rule of activation. As a remedy of the collapse instability, here we investigate a model of correlated NoN. We find that the collapse instability can be removed when hubs provide the majority of interconnections and interconnections are convergent between hubs. Thus, our study identifies a stable structure of correlated NoN against catastrophic failures. Our result further suggests a plausible way to enhance network robustness by manipulating connection patterns, along with other methods such as controlling the state of node based on a local rule. [ABSTRACT FROM AUTHOR]

Traffic congestion brings not only delay and inconvenience, but other associated national concerns, such as greenhouse gases, air pollutants, road safety issues and risks. Identification, measurement, tracking, and control of urban recurrent congestion are vital for building a livable and smart community. A considerable amount of works has made contributions to tackle the problem. Several methods, such as time-based approaches and level of service, can be effective for characterizing congestion on urban streets. However, studies with systemic perspectives have been minor in congestion quantification. Resilience, on the other hand, is an emerging concept that focuses on comprehensive systemic performance and characterizes the ability of a system to cope with disturbance and to recover its functionality. In this paper, we symbolized recurrent congestion as internal disturbance and proposed a modified metric inspired by the well-applied “R4” resilience-triangle framework. We constructed the metric with generic dimensions from both resilience engineering and transport science to quantify recurrent congestion based on spatial-temporal traffic patterns and made the comparison with other two approaches in freeway and signal-controlled arterial cases. Results showed that the metric can effectively capture congestion patterns in the study area and provides a quantitative benchmark for comparison. Also, it suggested not only a good comparative performance in measuring strength of proposed metric, but also its capability of considering the discharging process in congestion. The sensitivity tests showed that proposed metric possesses robustness against parameter perturbation in Robustness Range (RR), but the number of identified congestion patterns can be influenced by the existence of ϵ. In addition, the Elasticity Threshold (ET) and the spatial dimension of cell-based platform differ the congestion results significantly on both the detected number and intensity. By tackling this conventional problem with emerging concept, our metric provides a systemic alternative approach and enriches the toolbox for congestion assessment. Future work will be conducted on a larger scale with multiplex scenarios in various traffic conditions. [ABSTRACT FROM AUTHOR]

Controversies in the complexity-stability debate have been attributed to the methodologies used such as topological vs. dynamical approaches or rigid vs. adaptive foraging behaviour of species. Here, we use a bipartite network model that incorporates both topological and population dynamics to investigate the robustness of 60 real ecological networks to the loss of generalist and specialist species. We compare the response in both adaptive and rigid networks. Our results show that the removal of generalists leads to the most secondary extinctions, implying that conservation strategies should aim to protect generalist species in the ecosystem. We also show that adaptive behaviour renders networks vulnerable to species loss at initial stages but enhances long term stability of the system. However, whether adaptive networks are more robust to species loss than rigid ones depends on the structure of the network. Specifically, adaptive networks with modularity < 0.3 are more robust than rigid networks of the same modularity. Interestingly, the more modular a network is, the less robust it is to external perturbations. [ABSTRACT FROM AUTHOR]

There are some practical factors, such as arm position change and donning/doffing, which prevent robust myoelectric control. The objective of this study is to precisely characterize the impacts of the two representative factors on myoelectric controllability in practical control situations, thereby providing useful references that can be potentially used to find better solutions for clinically reliable myoelectric control. To this end, a real-time target acquisition task was performed by fourteen subjects including one individual with congenital upper-limb deficiency, where the impacts of arm position change, donning/doffing and a combination of both factors on control performance was systematically evaluated. The changes in online performance were examined with seven different performance metrics to comprehensively evaluate various aspects of myoelectric controllability. As a result, arm position change significantly affects offline prediction accuracy, but not online control performance due to real-time feedback, thereby showing no significant correlation between offline and online performance. Donning/doffing was still problematic in online control conditions. It was further observed that no benefit was attained when using a control model trained with multiple position data in terms of arm position change, and the degree of electrode shift caused by donning/doffing was not severely associated with the degree of performance loss under practical conditions (around 1 cm electrode shift). Since this study is the first to concurrently investigate the impacts of arm position change and donning/doffing in practical myoelectric control situations, all findings of this study provide new insights into robust myoelectric control with respect to arm position change and donning/doffing. [ABSTRACT FROM AUTHOR]

Multidimensional systems coupled via complex networks are widespread in nature and thus frequently invoked for a large plethora of interesting applications. From ecology to physics, individual entities in mutual interactions are grouped in families, homogeneous in kind. These latter interact selectively, through a sequence of self-consistently regulated steps, whose deeply rooted architecture is stored in the assigned matrix of connections. The asymptotic equilibrium eventually attained by the system, and its associated stability, can be assessed by employing standard nonlinear dynamics tools. For many practical applications, it is however important to externally drive the system towards a desired equilibrium, which is resilient, hence stable, to external perturbations. To this end we here consider a system made up of N interacting populations which evolve according to general rate equations, bearing attributes of universality. One species is added to the pool of interacting families and used as a dynamical controller to induce novel stable equilibria. Use can be made of the root locus method to shape the needed control, in terms of intrinsic reactivity and adopted protocol of injection. The proposed method is tested on both synthetic and real data, thus enabling to demonstrate its robustness and versatility. [ABSTRACT FROM AUTHOR]

The automatic detection and recognition of sound events by computers is a requirement for a number of emerging sensing and human computer interaction technologies. Recent advances in this field have been achieved by machine learning classifiers working in conjunction with time-frequency feature representations. This combination has achieved excellent accuracy for classification of discrete sounds. The ability to recognise sounds under real-world noisy conditions, called robust sound event classification, is an especially challenging task that has attracted recent research attention. Another aspect of real-word conditions is the classification of continuous, occluded or overlapping sounds, rather than classification of short isolated sound recordings. This paper addresses the classification of noise-corrupted, occluded, overlapped, continuous sound recordings. It first proposes a standard evaluation task for such sounds based upon a common existing method for evaluating isolated sound classification. It then benchmarks several high performing isolated sound classifiers to operate with continuous sound data by incorporating an energy-based event detection front end. Results are reported for each tested system using the new task, to provide the first analysis of their performance for continuous sound event detection. In addition it proposes and evaluates a novel Bayesian-inspired front end for the segmentation and detection of continuous sound recordings prior to classification. [ABSTRACT FROM AUTHOR]

Background: Visceral adiposity is a risk factor for many chronic diseases. Existing methods to quantify visceral adipose tissue volume using computed tomographic (CT) images often use a single slice, are manual, and are time consuming, making them impractical for large population studies. We developed and validated a method to accurately, rapidly, and robustly measure visceral adipose tissue volume using CT images. Methods: In-house software, Medical Executable for the Efficient and Robust Quantification of Adipose Tissue (MEERQAT), was developed to calculate visceral adipose tissue volume using a series of CT images within a manually identified region of interest. To distinguish visceral and subcutaneous adipose tissue, ellipses are drawn through the rectus abdominis and transverse abdominis using manual and automatic processes. Visceral and subcutaneous adipose tissue volumes are calculated by counting the numbers of voxels corresponding to adipose tissue in the region of interest. MEERQAT’s ellipse interpolation method was validated by comparing visceral adipose volume from 10 patients’ CT scans with corresponding results from manually delineated scans. Accuracy of visceral adipose quantification was tested using a phantom consisting of animal fat and tissues. Robustness of the method was tested by determining intra-observer and inter-observer coefficients of variation (CV). Results: The mean difference in visceral adipose tissue volume between manual and elliptical delineation methods was -0.54 ± 4.81%. In the phantom, our measurement differed from the known adipose volume by ≤ 7.5% for all scanning parameters. Mean inter-observer CV for visceral adipose tissue volume was 0.085, and mean intra-observer CV for visceral adipose tissue volume was 0.059. Conclusions: We have developed and validated a robust method of accurately and quickly determining visceral adipose tissue volume in any defined region of interest using CT imaging. [ABSTRACT FROM AUTHOR]

Traffic congestion continues to be a persistent problem throughout the world. As vehicle-to-vehicle communication develops, there is an opportunity of using cooperation among close proximity vehicles to tackle the congestion problem. The intuition is that if vehicles could cooperate opportunistically when they come close enough to each other, they could, in effect, spread themselves out among alternative routes so that vehicles do not all jam up on the same roads. Our previous work proposed a decentralized multiagent based vehicular congestion management algorithm entitled Congestion Avoidance and Route Allocation using Virtual Agent Negotiation (CARAVAN), wherein the vehicles acting as intelligent agents perform cooperative route allocation using inter-vehicular communication. This paper focuses on evaluating the practical applicability of this approach by testing its robustness and performance (in terms of travel time reduction), across variations in: (a) environmental parameters such as road network topology and configuration; (b) algorithmic parameters such as vehicle agent preferences and route cost/preference multipliers; and (c) agent-related parameters such as equipped/non-equipped vehicles and compliant/non-compliant agents. Overall, the results demonstrate the adaptability and robustness of the decentralized cooperative vehicles approach to providing global travel time reduction using simple local coordination strategies. [ABSTRACT FROM AUTHOR]

In this study, we address the problem of noisy image super-resolution. Noisy low resolution (LR) image is always obtained in applications, while most of the existing algorithms assume that the LR image is noise-free. As to this situation, we present an algorithm for noisy image super-resolution which can achieve simultaneously image super-resolution and denoising. And in the training stage of our method, LR example images are noise-free. For different input LR images, even if the noise variance varies, the dictionary pair does not need to be retrained. For the input LR image patch, the corresponding high resolution (HR) image patch is reconstructed through weighted average of similar HR example patches. To reduce computational cost, we use the atoms of learned sparse dictionary as the examples instead of original example patches. We proposed a distance penalty model for calculating the weight, which can complete a second selection on similar atoms at the same time. Moreover, LR example patches removed mean pixel value are also used to learn dictionary rather than just their gradient features. Based on this, we can reconstruct initial estimated HR image and denoised LR image. Combined with iterative back projection, the two reconstructed images are applied to obtain final estimated HR image. We validate our algorithm on natural images and compared with the previously reported algorithms. Experimental results show that our proposed method performs better noise robustness. [ABSTRACT FROM AUTHOR]

Vision system plays an important role in the field of indoor robot. Saliency detection methods, capturing regions that are perceived as important, are used to improve the performance of visual perception system. Most of state-of-the-art methods for saliency detection, performing outstandingly in natural images, cannot work in complicated indoor environment. Therefore, we propose a new method comprised of graph-based RGB-D segmentation, primary saliency measure, background distribution measure, and combination. Besides, region roundness is proposed to describe the compactness of a region to measure background distribution more robustly. To validate the proposed approach, eleven influential methods are compared on the DSD and ECSSD dataset. Moreover, we build a mobile robot platform for application in an actual environment, and design three different kinds of experimental constructions that are different viewpoints, illumination variations and partial occlusions. Experimental results demonstrate that our model outperforms existing methods and is useful for indoor mobile robots. [ABSTRACT FROM AUTHOR]

In this paper, an anti-jamming method, which turns the single objective optimization problem into a multi-objective optimization problem by utilizing 2-norm, is proposed. The proposed jamming suppression method can reduce the wide nulls and wrong nulls problems, which are generated by the common adaptive nulling methods. Therefore a better signal-noise-ratio (SNR) can be achieved, especially when the jammers are close to satellite signals. It can also improve the robustness of the algorithm. The effectiveness of the proposed method is evaluated by simulation and practical outdoor experiments with the GPS L1 band C/A signals. The experimental results show that with the dedicated method, the nulls targeting at the corresponding jammers become narrower and the wrong nulls can be eliminated. [ABSTRACT FROM AUTHOR]

Localization of the wireless sensor network is a vital area acquiring an impressive research concern and called upon to expand more with the rising of its applications. As localization is gaining prominence in wireless sensor network, it is vulnerable to jamming attacks. Jamming attacks disrupt communication opportunity among the sender and receiver and deeply impact the localization process, leading to a huge error of the estimated sensor node position. Therefore, detection and elimination of jamming influence are absolutely indispensable. Range-based techniques especially Received Signal Strength (RSS) is facing severe impact of these attacks. This paper proposes algorithms based on Combination Multiple Frequency Multiple Power Localization (C-MFMPL) and Step Function Multiple Frequency Multiple Power Localization (SF-MFMPL). The algorithms have been tested in the presence of multiple types of jamming attacks including capture and replay, random and constant jammers over a log normal shadow fading propagation model. In order to overcome the impact of random and constant jammers, the proposed method uses two sets of frequencies shared by the implemented anchor nodes to obtain the averaged RSS readings all over the transmitted frequencies successfully. In addition, three stages of filters have been used to cope with the replayed beacons caused by the capture and replay jammers. In this paper the localization performance of the proposed algorithms for the ideal case which is defined by without the existence of the jamming attack are compared with the case of jamming attacks. The main contribution of this paper is to achieve robust localization performance in the presence of multiple jamming attacks under log normal shadow fading environment with a different simulation conditions and scenarios. [ABSTRACT FROM AUTHOR]

Nearly all living systems feature a temperature-independent oscillation period in circadian clocks. This ubiquitous property occurs at the system level and is rooted in the network architecture of the clock machinery. To investigate the mechanism of this prominent property of the circadian clock and provide general guidance for generating robust genetic oscillators with temperature-compensated oscillations, we theoretically explored the design principle and core network topologies preferred by oscillations with a temperature-independent period. By enumerating all topologies of genetic regulatory circuits with three genes, we obtained four network motifs, namely, a delayed negative feedback oscillator, repressilator, activator-inhibitor oscillator and substrate-depletion oscillator; hybrids of these motifs constitute the vast majority of target network topologies. These motifs are biased in their capacities for achieving oscillations and the temperature sensitivity of the period. The delayed negative feedback oscillator and repressilator are more robust for oscillations, whereas the activator-inhibitor and substrate-depletion oscillators are superior for maintaining a temperature-independent oscillation period. These results suggest that thermally robust oscillation can be more plausibly achieved by hybridizing these two categories of network motifs. Antagonistic balance and temperature insulation mechanisms for achieving temperature compensation are typically found in these topologies with temperature robustness. In the temperature insulation approach, the oscillation period relies on very few parameters, and these parameters are influenced only slightly by temperature. This approach prevents the temperature from affecting the oscillation period and generates circadian rhythms that are robust against environmental perturbations. [ABSTRACT FROM AUTHOR]

Data compression and encryption are key components of commonly deployed platforms such as Hadoop. Numerous data compression and encryption tools are presently available on such platforms and the tools are characteristically applied in sequence, i.e., compression followed by encryption or encryption followed by compression. This paper focuses on the open-source Hadoop framework and proposes a data storage method that efficiently couples data compression with encryption. A simultaneous compression and encryption scheme is introduced that addresses an important implementation issue of source coding based on Tent Map and Piece-wise Linear Chaotic Map (PWLM), which is the infinite precision of real numbers that result from their long products. The approach proposed here solves the implementation issue by removing fractional components that are generated by the long products of real numbers. Moreover, it incorporates a stealth key that performs a cyclic shift in PWLM without compromising compression capabilities. In addition, the proposed approach implements a masking pseudorandom keystream that enhances encryption quality. The proposed algorithm demonstrated a congruent fit within the Hadoop framework, providing robust encryption security and compression. [ABSTRACT FROM AUTHOR]

Background: The point of phase singularity (PS) is considered to represent a spiral wave core or a rotor in cardiac fibrillation. Computational efficiency is important for detection of PS in clinical electrophysiology. We developed a novel algorithm for highly efficient and robust detection of PS. Methods: In contrast to the conventional method, which calculates PS based on the line integral of the phase around a PS point equal to ±2π (the Iyer-Gray method), the proposed algorithm (the location-centric method) looks for the phase discontinuity point at which PS actually occurs. We tested the efficiency and robustness of these two methods in a two-dimensional mathematical model of atrial fibrillation (AF), with and without remodeling of ionic currents. Results: 1. There was a significant association, in terms of the Hausdorff distance (3.30 ± 0.0 mm), between the PS points measured using the Iyer-Gray and location-centric methods, with almost identical PS trajectories generated by the two methods. 2. For the condition of electrical remodeling of AF (0.3 × ICaL), the PS points calculated by the two methods were satisfactorily co-localized (with the Hausdorff distance of 1.64 ± 0.09 mm). 3. The proposed location-centric method was substantially more efficient than the Iyer-Gray method, with a 28.6-fold and 28.2-fold shorter run times for the control and remodeling scenarios, respectively. Conclusion: We propose a new location-centric method for calculating PS, which is robust and more efficient compared with the conventionally used method. [ABSTRACT FROM AUTHOR]

Passive content fingerprinting is widely used for video content identification and monitoring. However, many challenges remain unsolved especially for partial-copies detection. The main challenge is to find the right balance between the computational cost of fingerprint extraction and fingerprint dimension, without compromising detection performance against various attacks (robustness). Fast video detection performance is desirable in several modern applications, for instance, in those where video detection involves the use of large video databases or in applications requiring real-time video detection of partial copies, a process whose difficulty increases when videos suffer severe transformations. In this context, conventional fingerprinting methods are not fully suitable to cope with the attacks and transformations mentioned before, either because the robustness of these methods is not enough or because their execution time is very high, where the time bottleneck is commonly found in the fingerprint extraction and matching operations. Motivated by these issues, in this work we propose a content fingerprinting method based on the extraction of a set of independent binary global and local fingerprints. Although these features are robust against common video transformations, their combination is more discriminant against severe video transformations such as signal processing attacks, geometric transformations and temporal and spatial desynchronization. Additionally, we use an efficient multilevel filtering system accelerating the processes of fingerprint extraction and matching. This multilevel filtering system helps to rapidly identify potential similar video copies upon which the fingerprint process is carried out only, thus saving computational time. We tested with datasets of real copied videos, and the results show how our method outperforms state-of-the-art methods regarding detection scores. Furthermore, the granularity of our method makes it suitable for partial-copy detection; that is, by processing only short segments of 1 second length. [ABSTRACT FROM AUTHOR]

This paper presents a robust satisficing decision-making method for Unmanned Aerial Vehicles (UAVs) executing complex missions in an uncertain environment. Motivated by the info-gap decision theory, we formulate this problem as a novel robust satisficing optimization problem, of which the objective is to maximize the robustness while satisfying some desired mission requirements. Specifically, a new info-gap based Markov Decision Process (IMDP) is constructed to abstract the uncertain UAV system and specify the complex mission requirements with the Linear Temporal Logic (LTL). A robust satisficing policy is obtained to maximize the robustness to the uncertain IMDP while ensuring a desired probability of satisfying the LTL specifications. To this end, we propose a two-stage robust satisficing solution strategy which consists of the construction of a product IMDP and the generation of a robust satisficing policy. In the first stage, a product IMDP is constructed by combining the IMDP with an automaton representing the LTL specifications. In the second, an algorithm based on robust dynamic programming is proposed to generate a robust satisficing policy, while an associated robustness evaluation algorithm is presented to evaluate the robustness. Finally, through Monte Carlo simulation, the effectiveness of our algorithms is demonstrated on an UAV search mission under severe uncertainty so that the resulting policy can maximize the robustness while reaching the desired performance level. Furthermore, by comparing the proposed method with other robust decision-making methods, it can be concluded that our policy can tolerate higher uncertainty so that the desired performance level can be guaranteed, which indicates that the proposed method is much more effective in real applications. [ABSTRACT FROM AUTHOR]

Some level of uncertainty is unavoidable in acquiring the mass, geometry parameters and stability derivatives of an aerial vehicle. In certain instances tiny perturbations of these could potentially cause considerable variations in flight characteristics. This research considers the impact of varying these parameters altogether. This is a generalization of examining the effects of particular parameters on selected modes present in existing literature. Conventional autopilot designs commonly assume that each flight channel is independent and develop single-input single-output (SISO) controllers for every one, that are utilized in parallel for actual flight. It is demonstrated that an attitude controller built like this can function flawlessly on separate nominal cases, but can become unstable with a perturbation no more than 2%. Two robust multi-input multi-output (MIMO) design strategies, specifically loop-shaping and μ-synthesis are outlined as potential substitutes and are observed to handle large parametric changes of 30% while preserving decent performance. Duplicating the loop-shaping procedure for the outer loop, a complete flight control system is formed. It is confirmed through software-in-the-loop (SIL) verifications utilizing blade element theory (BET) that the autopilot is capable of navigation and landing exposed to high parametric variations and powerful winds. [ABSTRACT FROM AUTHOR]

Purpose: To identify the impact of reconstruction algorithms on CT radiomic features of pulmonary tumors and to reveal and compare the intra- and inter-reader and inter-reconstruction algorithm variability of each feature. Methods: Forty-two patients (M:F = 19:23; mean age, 60.43±10.56 years) with 42 pulmonary tumors (22.56±8.51mm) underwent contrast-enhanced CT scans, which were reconstructed with filtered back projection and commercial iterative reconstruction algorithm (level 3 and 5). Two readers independently segmented the whole tumor volume. Fifteen radiomic features were extracted and compared among reconstruction algorithms. Intra- and inter-reader variability and inter-reconstruction algorithm variability were calculated using coefficients of variation (CVs) and then compared. Results: Among the 15 features, 5 first-order tumor intensity features and 4 gray level co-occurrence matrix (GLCM)-based features showed significant differences (p<0.05) among reconstruction algorithms. As for the variability, effective diameter, sphericity, entropy, and GLCM entropy were the most robust features (CV≤5%). Inter-reader variability was larger than intra-reader or inter-reconstruction algorithm variability in 9 features. However, for entropy, homogeneity, and 4 GLCM-based features, inter-reconstruction algorithm variability was significantly greater than inter-reader variability (p<0.013). Conclusions: Most of the radiomic features were significantly affected by the reconstruction algorithms. Inter-reconstruction algorithm variability was greater than inter-reader variability for entropy, homogeneity, and GLCM-based features. [ABSTRACT FROM AUTHOR]

This paper proposes an efficient frequency estimator based on Chinese Remainder Theorem for undersampled waveforms. Due to the emphasis on frequency offset recognition (i.e., frequency shift and compensation) of small-point DFT remainders, compared to estimators using large-point DFT remainders, it can achieve higher noise robustness in low signal-to-noise ratio (SNR) cases and higher accuracy in high SNR cases. Numerical results show that, by incorporating a remainder screening method and the Tsui spectrum corrector, the proposed estimator not only lowers the SNR threshold of detection, but also provides a higher accuracy than the large-point DFT estimator when the DFT size decreases to 1/90 of the latter case. [ABSTRACT FROM AUTHOR]

In human sperm motility analysis, sperm segmentation plays an important role to determine the location of multiple sperms. To ensure an improved segmentation result, the Laplacian of Gaussian filter is implemented as a kernel in a pre-processing step before applying the image segmentation process to automatically segment and detect human spermatozoa. This study proposes an intersecting cortical model (ICM), which was derived from several visual cortex models, to segment the sperm head region. However, the proposed method suffered from parameter selection; thus, the ICM network is optimised using particle swarm optimization where feature mutual information is introduced as the new fitness function. The final results showed that the proposed method is more accurate and robust than four state-of-the-art segmentation methods. The proposed method resulted in rates of 98.14%, 98.82%, 86.46% and 99.81% in accuracy, sensitivity, specificity and precision, respectively, after testing with 1200 sperms. The proposed algorithm is expected to be implemented in analysing sperm motility because of the robustness and capability of this algorithm. [ABSTRACT FROM AUTHOR]

Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges. The attack strategies are selected based on degree and betweenness centralities calculated for either the initial network or the current network during the removal, among which random failure is as a comparison. It is found that the node-based strategies are often more harmful to the network controllability than the edge-based ones, and so are the recalculated strategies than their counterparts. The Barabási-Albert scale-free model, which has a highly biased structure, proves to be the most vulnerable of the tested model networks. In contrast, the Erdős-Rényi random model, which lacks structural bias, exhibits much better robustness to both node-based and edge-based attacks. We also survey the control robustness of 25 real-world networks, and the numerical results show that most real networks are control robust to random node failures, which has not been observed in the model networks. And the recalculated betweenness-based strategy is the most efficient way to harm the controllability of real-world networks. Besides, we find that the edge degree is not a good quantity to measure the importance of an edge in terms of network controllability. [ABSTRACT FROM AUTHOR]

To achieve effective visual tracking, a robust feature representation composed of two separate components (i.e., feature learning and selection) for an object is one of the key issues. Typically, a common assumption used in visual tracking is that the raw video sequences are clear, while real-world data is with significant noise and irrelevant patterns. Consequently, the learned features may be not all relevant and noisy. To address this problem, we propose a novel visual tracking method via a point-wise gated convolutional deep network (CPGDN) that jointly performs the feature learning and feature selection in a unified framework. The proposed method performs dynamic feature selection on raw features through a gating mechanism. Therefore, the proposed method can adaptively focus on the task-relevant patterns (i.e., a target object), while ignoring the task-irrelevant patterns (i.e., the surrounding background of a target object). Specifically, inspired by transfer learning, we firstly pre-train an object appearance model offline to learn generic image features and then transfer rich feature hierarchies from an offline pre-trained CPGDN into online tracking. In online tracking, the pre-trained CPGDN model is fine-tuned to adapt to the tracking specific objects. Finally, to alleviate the tracker drifting problem, inspired by an observation that a visual target should be an object rather than not, we combine an edge box-based object proposal method to further improve the tracking accuracy. Extensive evaluation on the widely used CVPR2013 tracking benchmark validates the robustness and effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, a scheme for chaotic modulation secure communication is proposed based on chaotic synchronization of an improved Lorenz system. For the first time, the intensity limit and stability of the transmitted signal, the characteristics of broadband and the requirements for accuracy of electronic components are presented by Multisim simulation. In addition, some improvements are made on the measurement method and the proposed experimental circuit in order to facilitate the experiments of chaotic synchronization, chaotic non-synchronization, experiment without signal and experiment with signal. To illustrate the effectiveness of the proposed scheme, some numerical simulations are presented. Then, the proposed chaotic secure communication circuit is implemented through analog electronic circuit, which is characterized by its high accuracy and good robustness. [ABSTRACT FROM AUTHOR]

In many real-world applications such as smart card solutions, law enforcement, surveillance and access control, the limited training sample size is the most fundamental problem. By making use of the low-rank structural information of the reconstructed error image, the so-called nuclear norm-based matrix regression has been demonstrated to be effective for robust face recognition with continuous occlusions. However, the recognition performance of nuclear norm-based matrix regression degrades greatly in the face of the small sample size problem. An alternative solution to tackle this problem is performing matrix regression on each patch and then integrating the outputs from all patches. However, it is difficult to set an optimal patch size across different databases. To fully utilize the complementary information from different patch scales for the final decision, we propose a multi-scale patch-based matrix regression scheme based on which the ensemble of multi-scale outputs can be achieved optimally. Extensive experiments on benchmark face databases validate the effectiveness and robustness of our method, which outperforms several state-of-the-art patch-based face recognition algorithms. [ABSTRACT FROM AUTHOR]

There are quite a number of different metrics of network robustness. This paper addresses the rationality of four metrics of network robustness (the algebraic connectivity, the effective resistance, the average edge betweenness, and the efficiency) by investigating the robust growth of generalized meshes (GMs). First, a heuristic growth algorithm (the Proximity-Growth algorithm) is proposed. The resulting proximity-optimal GMs are intuitively robust and hence are adopted as the benchmark. Then, a generalized mesh (GM) is grown up by stepwise optimizing a given measure of network robustness. The following findings are presented: (1) The algebraic connectivity-optimal GMs deviate quickly from the proximity-optimal GMs, yielding a number of less robust GMs. This hints that the rationality of the algebraic connectivity as a measure of network robustness is still in doubt. (2) The effective resistace-optimal GMs and the average edge betweenness-optimal GMs are in line with the proximity-optimal GMs. This partly justifies the two quantities as metrics of network robustness. (3) The efficiency-optimal GMs deviate gradually from the proximity-optimal GMs, yielding some less robust GMs. This suggests the limited utility of the efficiency as a measure of network robustness. [ABSTRACT FROM AUTHOR]

Purpose: This study aimed to investigate the variability of textural features (TF) as a function of acquisition and reconstruction parameters within the context of multi-centric trials. Methods: The robustness of 15 selected TFs were studied as a function of the number of iterations, the post-filtering level, input data noise, the reconstruction algorithm and the matrix size. A combination of several reconstruction and acquisition settings was devised to mimic multi-centric conditions. We retrospectively studied data from 26 patients enrolled in a diagnostic study that aimed to evaluate the performance of PET/CT 68Ga-DOTANOC in gastro-entero-pancreatic neuroendocrine tumors. Forty-one tumors were extracted and served as the database. The coefficient of variation (COV) or the absolute deviation (for the noise study) was derived and compared statistically with SUVmax and SUVmean results. Results: The majority of investigated TFs can be used in a multi-centric context when each parameter is considered individually. The impact of voxel size and noise in the input data were predominant as only 4 TFs presented a high/intermediate robustness against SUV-based metrics (Entropy, Homogeneity, RP and ZP). When combining several reconstruction settings to mimic multi-centric conditions, most of the investigated TFs were robust enough against SUVmax except Correlation, Contrast, LGRE, LGZE and LZLGE. Conclusion: Considering previously published results on either reproducibility or sensitivity against delineation approach and our findings, it is feasible to consider Homogeneity, Entropy, Dissimilarity, HGRE, HGZE and ZP as relevant for being used in multi-centric trials. [ABSTRACT FROM AUTHOR]

Bioimpedance spectroscopy (BIS) measurement errors may be caused by parasitic stray capacitance, impedance mismatch, cross-talking or their very likely combination. An accurate detection and identification is of extreme importance for further analysis because in some cases and for some applications, certain measurement artifacts can be corrected, minimized or even avoided. In this paper we present a robust method to detect the presence of measurement artifacts and identify what kind of measurement error is present in BIS measurements. The method is based on supervised machine learning and uses a novel set of generalist features for measurement characterization in different immittance planes. Experimental validation has been carried out using a database of complex spectra BIS measurements obtained from different BIS applications and containing six different types of errors, as well as error-free measurements. The method obtained a low classification error (0.33%) and has shown good generalization. Since both the features and the classification schema are relatively simple, the implementation of this pre-processing task in the current hardware of bioimpedance spectrometers is possible. [ABSTRACT FROM AUTHOR]

Reliably estimating wildlife abundance is fundamental to effective management. Aerial surveys are one of the only spatially robust tools for estimating large mammal populations, but statistical sampling methods are required to address detection biases that affect accuracy and precision of the estimates. Although various methods for correcting aerial survey bias are employed on large mammal species around the world, these have rarely been rigorously validated. Several populations of feral horses (Equus caballus) in the western United States have been intensively studied, resulting in identification of all unique individuals. This provided a rare opportunity to test aerial survey bias correction on populations of known abundance. We hypothesized that a hybrid method combining simultaneous double-observer and sightability bias correction techniques would accurately estimate abundance. We validated this integrated technique on populations of known size and also on a pair of surveys before and after a known number was removed. Our analysis identified several covariates across the surveys that explained and corrected biases in the estimates. All six tests on known populations produced estimates with deviations from the known value ranging from -8.5% to +13.7% and <0.7 standard errors. Precision varied widely, from 6.1% CV to 25.0% CV. In contrast, the pair of surveys conducted around a known management removal produced an estimated change in population between the surveys that was significantly larger than the known reduction. Although the deviation between was only 9.1%, the precision estimate (CV = 1.6%) may have been artificially low. It was apparent that use of a helicopter in those surveys perturbed the horses, introducing detection error and heterogeneity in a manner that could not be corrected by our statistical models. Our results validate the hybrid method, highlight its potentially broad applicability, identify some limitations, and provide insight and guidance for improving survey designs. [ABSTRACT FROM AUTHOR]

Current models of bilateral trade neglect the effects of income distribution. This paper addresses the issue by accounting for non-homothetic consumer preferences and hence investigating the role of income distribution in the context of the gravity model of trade. A theoretically justified gravity model is estimated for disaggregated trade data (Dollar volume is used as dependent variable) using a sample of 104 exporters and 108 importers for 1980–2003 to achieve two main goals. We define and calculate new measures of income distribution similarity and empirically confirm that greater similarity of income distribution between countries implies more trade. Using distribution-based measures as a proxy for demand similarities in gravity models, we find consistent and robust support for the hypothesis that countries with more similar income-distributions trade more with each other. The hypothesis is also confirmed at disaggregated level for differentiated product categories. [ABSTRACT FROM AUTHOR]

Cellular phenotypes underpinned by regulatory networks need to respond to evolutionary pressures to allow adaptation, but at the same time be robust to perturbations. This creates a conflict in which mutations affecting regulatory networks must both generate variance but also be tolerated at the phenotype level. Here, we perform mathematical analyses and simulations of regulatory networks to better understand the potential trade-off between robustness and evolvability. Examining the phenotypic effects of mutations, we find an inverse correlation between robustness and evolvability that breaks only with nonlinearity in the network dynamics, through the creation of regions presenting sudden changes in phenotype with small changes in genotype. For genotypes embedding low levels of nonlinearity, robustness and evolvability correlate negatively and almost perfectly. By contrast, genotypes embedding nonlinear dynamics allow expression levels to be robust to small perturbations, while generating high diversity (evolvability) under larger perturbations. Thus, nonlinearity breaks the robustness-evolvability trade-off in gene expression levels by allowing disparate responses to different mutations. Using analytical derivations of robustness and system sensitivity, we show that these findings extend to a large class of gene regulatory network architectures and also hold for experimentally observed parameter regimes. Further, the effect of nonlinearity on the robustness-evolvability trade-off is ensured as long as key parameters of the system display specific relations irrespective of their absolute values. We find that within this parameter regime genotypes display low and noisy expression levels. Examining the phenotypic effects of mutations, we find an inverse correlation between robustness and evolvability that breaks only with nonlinearity in the network dynamics. Our results provide a possible solution to the robustness-evolvability trade-off, suggest an explanation for the ubiquity of nonlinear dynamics in gene expression networks, and generate useful guidelines for the design of synthetic gene circuits. [ABSTRACT FROM AUTHOR]

Image registration is a key component of computer assistance in image guided surgery, and it is a challenging topic in endoscopic environments. In this study, we present a method for image registration named Homographic Patch Feature Transform (HPFT) to match gastroscopic images. HPFT can be used for tracking lesions and augmenting reality applications during gastroscopy. Furthermore, an overall evaluation scheme is proposed to validate the precision, robustness and uniformity of the registration results, which provides a standard for rejection of false matching pairs from corresponding results. Finally, HPFT is applied for processing in vivo gastroscopic data. The experimental results show that HPFT has stable performance in gastroscopic applications. [ABSTRACT FROM AUTHOR]

Swarm robotics is a promising approach for the coordination of large numbers of robots. While previous studies have shown that evolutionary robotics techniques can be applied to obtain robust and efficient self-organized behaviors for robot swarms, most studies have been conducted in simulation, and the few that have been conducted on real robots have been confined to laboratory environments. In this paper, we demonstrate for the first time a swarm robotics system with evolved control successfully operating in a real and uncontrolled environment. We evolve neural network-based controllers in simulation for canonical swarm robotics tasks, namely homing, dispersion, clustering, and monitoring. We then assess the performance of the controllers on a real swarm of up to ten aquatic surface robots. Our results show that the evolved controllers transfer successfully to real robots and achieve a performance similar to the performance obtained in simulation. We validate that the evolved controllers display key properties of swarm intelligence-based control, namely scalability, flexibility, and robustness on the real swarm. We conclude with a proof-of-concept experiment in which the swarm performs a complete environmental monitoring task by combining multiple evolved controllers. [ABSTRACT FROM AUTHOR]

This paper presents a novel secure and robust steganographic technique in the compressed video domain namely embedding-based byte differencing (EBBD). Unlike most of the current video steganographic techniques which take into account only the intra frames for data embedding, the proposed EBBD technique aims to hide information in both intra and inter frames. The information is embedded into a compressed video by simultaneously manipulating the quantized AC coefficients (AC-QTCs) of luminance components of the frames during MPEG-2 encoding process. Later, during the decoding process, the embedded information can be detected and extracted completely. Furthermore, the EBBD basically deals with two security concepts: data encryption and data concealing. Hence, during the embedding process, secret data is encrypted using the simplified data encryption standard (S-DES) algorithm to provide better security to the implemented system. The security of the method lies in selecting candidate AC-QTCs within each non-overlapping 8 × 8 sub-block using a pseudo random key. Basic performance of this steganographic technique verified through experiments on various existing MPEG-2 encoded videos over a wide range of embedded payload rates. Overall, the experimental results verify the excellent performance of the proposed EBBD with a better trade-off in terms of imperceptibility and payload, as compared with previous techniques while at the same time ensuring minimal bitrate increase and negligible degradation of PSNR values. [ABSTRACT FROM AUTHOR]

The purpose of this research is to develop an intuitive and robust realtime QRS detection algorithm based on the physiological characteristics of the electrocardiogram waveform. The proposed algorithm finds the QRS complex based on the dual criteria of the amplitude and duration of QRS complex. It consists of simple operations, such as a finite impulse response filter, differentiation or thresholding without complex and computational operations like a wavelet transformation. The QRS detection performance is evaluated by using both an MIT-BIH arrhythmia database and an AHA ECG database (a total of 435,700 beats). The sensitivity (SE) and positive predictivity value (PPV) were 99.85% and 99.86%, respectively. According to the database, the SE and PPV were 99.90% and 99.91% in the MIT-BIH database and 99.84% and 99.84% in the AHA database, respectively. The result of the noisy environment test using record 119 from the MIT-BIH database indicated that the proposed method was scarcely affected by noise above 5 dB SNR (SE = 100%, PPV > 98%) without the need for an additional de-noising or back searching process. [ABSTRACT FROM AUTHOR]