Search

Analysis of the slipstream development around the high-speed trains in tunnels would provide references for assessing the transient gust loads on trackside workers and trackside furniture in tunnels. This paper focuses on the computational analysis of the slipstream caused by high-speed trains passing through double-track tunnels with a cross-sectional area of 100 m2. Three-dimensional unsteady compressible Reynolds-averaged Navier-Stokes equations and a realizable k-ε turbulence model were used to describe the airflow characteristics around a high-speed train in the tunnel. The moving boundary problem was treated using the sliding mesh technology. Three cases were simulated in this paper, including two tunnel lengths and two different configurations of the train. The train speed in these three cases was 250 km/h. The accuracy of the numerical method was validated by the experimental data from full-scale tests, and reasonable consistency was obtained. The results show that the flow field around the high-speed trains can be divided into three distinct regions: the region in front of the train nose, the annular region and the wake region. The slipstream development along the two sides of train is not in balance and offsets to the narrow side in the double-track tunnels. Due to the piston effect, the slipstream has a larger peak value in the tunnel than in open air. The tunnel length, train length and length ratio affect the slipstream velocities; in particular, the velocities increase with longer trains. Moreover, the propagation of pressure waves also induces the slipstream fluctuations: substantial velocity fluctuations mainly occur in front of the train, and weaken with the decrease in amplitude of the pressure wave. [ABSTRACT FROM AUTHOR]

Coordination is essential for improving supply chain performance, and one of the most critical factors in achieving the coordination of a supply chain is the integrated research of production and distribution. In this paper, a novel two-stage hybrid solution methodology is proposed. In the first stage, products are processed on the serial machines of multiple manufacturers located in two industrial parks. A fuzzy multi-objective scheduling optimization is performed using a modified non-dominated sorting genetic algorithm II (NSGA-II). The result obtained in the first stage is used in the second stage to optimize the distribution scheduling problem using a modified genetic annealing algorithm (GAA). Finally, simulation results verify both the feasibility and efficiency of the proposed solution methodology. [ABSTRACT FROM AUTHOR]

Research: The body composition model is closely related to the physiological characteristics of the human body. At the same time there can be a large number of physiological characteristics, many of which may be redundant or irrelevant. In existing human physiological feature selection algorithms, it is difficult to overcome the impact that redundancy and irrelevancy may have on human body composition modeling. This suggests a role for selection algorithms, where human physiological characteristics are identified using a combination of filtering and improved clustering. To do this, a feature filtering method based on Hilbert-Schmidt dependency criteria is first of all used to eliminate irrelevant features. After this, it is possible to use improved Chameleon clustering to increase the combination of sub-clusters amongst the characteristics, thereby removing any redundant features to obtain a candidate feature set for human body composition modeling. Method We report here on the use of an algorithm to filter the characteristic parameters in INBODY770 (this paper used INBODY 770 as body composition analyzer.) measurement data, which has three commonly-used impedance bands (1 kHZ, 250 kHZ, 500 kHZ). This algorithm is able to filter out parameters that have a low correlation with body composition BFM. The algorithm is also able to draw upon improved clustering techniques to reduce the initial feature set from 29 parameters to 10 parameters for any parameters of the 250 kHZ band that remain after filtering. In addition, we also examined the impact of different sample sizes on feature selection. Result: The proposed algorithm is able to remove irrelevant and redundant features and the resulting correlation between the model and the body composition (BFM which is a whole body fat evaluation can better assess the body's overall fat and muscle composition.) is 0.978, thereby providing an improved model for prediction with a relative error of less than 0.12. [ABSTRACT FROM AUTHOR]

Data mining and search-based algorithms have been applied to various problems due to their power and performance. There have been several studies on the use of these algorithms for refactoring. In this paper, we show how search based algorithms can be used for sequence diagram refactoring. We also show how a hybridized algorithm of Kmeans and Simulated Annealing (SA) algorithms can aid each other in solving sequence diagram refactoring. Results show that search based algorithms can be used successfully in refactoring sequence diagram on small and large case studies. In addition, the hybridized algorithm obtains good results using selected quality metrics. Detailed insights on the experiments on sequence diagram refactoring reveal that the limitations of SA can be addressed by hybridizing the Kmeans algorithm to the SA algorithm. [ABSTRACT FROM AUTHOR]

An end-to-end network traffic matrix is significantly helpful for network management and for Software Defined Networks (SDN). However, the end-to-end network traffic matrix's inferences and estimations are a challenging problem. Moreover, attaining the traffic matrix in high-speed networks for SDN is a prohibitive challenge. This paper investigates how to estimate and recover the end-to-end network traffic matrix in fine time granularity from the sampled traffic traces, which is a hard inverse problem. Different from previous methods, the fractal interpolation is used to reconstruct the finer-granularity network traffic. Then, the cubic spline interpolation method is used to obtain the smooth reconstruction values. To attain an accurate the end-to-end network traffic in fine time granularity, we perform a weighted-geometric-average process for two interpolation results that are obtained. The simulation results show that our approaches are feasible and effective. [ABSTRACT FROM AUTHOR]

This work presents optimal linear quadratic regulator (LQR) based on genetic algorithm (GA) to solve the two degrees of freedom (2 DoF) motion control problem in head seas for wave piercing catamarans (WPC). The proposed LQR based GA control strategy is to select optimal weighting matrices (Q and R). The seakeeping performance of WPC based on proposed algorithm is challenged because of multi-input multi-output (MIMO) system of uncertain coefficient problems. Besides the kinematical constraint problems of WPC, the external conditions must be considered, like the sea disturbance and the actuators (a T-foil and two flaps) control. Moreover, this paper describes the MATLAB and LabVIEW software plats to simulate the reduction effects of WPC. Finally, the real-time (RT) NI CompactRIO embedded controller is selected to test the effectiveness of the actuators based on proposed techniques. In conclusion, simulation and experimental results prove the correctness of the proposed algorithm. The percentage of heave and pitch reductions are more than 18% in different high speeds and bad sea conditions. And the results also verify the feasibility of NI CompactRIO embedded controller. [ABSTRACT FROM AUTHOR]

A wide variety of methods have been proposed in protein subnuclear localization to improve the prediction accuracy. However, one important trend of these means is to treat fusion representation by fusing multiple feature representations, of which, the fusion process takes a lot of time. In view of this, this paper novelly proposed a method by combining a new single feature representation and a new algorithm to obtain good recognition rate. Specifically, based on the position-specific scoring matrix (PSSM), we proposed a new expression, correlation position-specific scoring matrix (CoPSSM) as the protein feature representation. Based on the classic nonlinear dimension reduction algorithm, kernel linear discriminant analysis (KLDA), we added a new discriminant criterion and proposed a dichotomous greedy genetic algorithm (DGGA) to intelligently select its kernel bandwidth parameter. Two public datasets with Jackknife test and KNN classifier were used for the numerical experiments. The results showed that the overall success rate (OSR) with single representation CoPSSM is larger than that with many relevant representations. The OSR of the proposed method can reach as high as 87.444% and 90.3361% for these two datasets, respectively, outperforming many current methods. To show the generalization of the proposed algorithm, two extra standard datasets of protein subcellular were chosen to conduct the expending experiment, and the prediction accuracy by Jackknife test and Independent test is still considerable. [ABSTRACT FROM AUTHOR]

Using convenient stratification criteria such as geographical regions or other natural conditions like age, gender, etc., is not beneficial in order to maximize the precision of the estimates of variables of interest. Thus, one has to look for an efficient stratification design to divide the whole population into homogeneous strata that achieves higher precision in the estimation. In this paper, a procedure for determining Optimum Stratum Boundaries (OSB) and Optimum Sample Sizes (OSS) for each stratum of a variable of interest in health surveys is developed. The determination of OSB and OSS based on the study variable is not feasible in practice since the study variable is not available prior to the survey. Since many variables in health surveys are generally skewed, the proposed technique considers the readily-available auxiliary variables to determine the OSB and OSS. This stratification problem is formulated into a Mathematical Programming Problem (MPP) that seeks minimization of the variance of the estimated population parameter under Neyman allocation. It is then solved for the OSB by using a dynamic programming (DP) technique. A numerical example with a real data set of a population, aiming to estimate the Haemoglobin content in women in a national Iron Deficiency Anaemia survey, is presented to illustrate the procedure developed in this paper. Upon comparisons with other methods available in literature, results reveal that the proposed approach yields a substantial gain in efficiency over the other methods. A simulation study also reveals similar results. [ABSTRACT FROM AUTHOR]

The interaction radius r plays an important role in the collective behavior of many multi-agent systems because it defines the interaction network among agents. For the topic of intervention on collective behavior of multi-agent systems, does r also affect the intervention performance? In this paper we study whether it is easier to change the convergent heading of the group by adding some special agents (called shills) into the Vicsek model when r is larger (or smaller). Two kinds of shills are considered: fixed-heading shills (like leaders that never change their headings) and evolvable-heading shills (like normal agents but with carefully designed initial headings). We know that with the increase of r, two contradictory effects exist simultaneously: the influential area of a single shill is enlarged, but its influence strength is weakened. Which factor dominates? Through simulations and theoretical analysis we surprisingly find that r affects the intervention performance differently in different cases: when fixed-heading shills are placed together at the center of the group, larger r gives a better intervention performance; when evolvable-heading shills are placed together at the center, smaller r is better; when shills (either fixed-heading or evolvable-heading) are distributed evenly inside the group, the effect of r on the intervention performance is not significant. We believe these results will inspire the design of intervention strategies for many other multi-agent systems. [ABSTRACT FROM AUTHOR]

This paper presents an adaption of the fractional order terminal sliding mode control (AFTSMC) strategy for DC-DC Buck converter. The following strategy aims to design a novel nonlinear sliding surface function, with a double closed-loop structure of voltage and current. This strategy is a fusion of two characteristics: terminal sliding mode control (TSMC) and fractional order calculation (FOC). In addition, the influence of “the controller parameters” on the “performance of double closed-loop system” is investigated. It is observed that the value of terminal power has to be chosen to make a compromise between start-up and transient response of the converter. Therefore the AFTSMC strategy chooses the value of the terminal power adaptively, and this strategy can lead to the appropriate number of fractional order as well. Furthermore, through the fractional order analysis, the system can reach the sliding mode surface in a finite time. And the theoretical considerations are verified by numerical simulation. The performance of the AFTSMC and TSMC strategies is tested by computer simulations. And the comparison simulation results show that the AFTSMC exhibits a considerable improvement in terms of a faster output voltage response during load changes. Moreover, AFTSMC obtains a faster dynamical response, smaller steady-state error rate and lower overshoot. [ABSTRACT FROM AUTHOR]

A recent paper in this journal by Chen and Chen has used computer simulations to examine a number of approaches to analysing sets of n-of-1 trials. We have examined such designs using a more theoretical approach based on considering the purpose of analysis and the structure as regards randomisation that the design uses. We show that different purposes require different analyses and that these in turn may produce quite different results. Our approach to incorporating the randomisation employed when the purpose is to test a null hypothesis of strict equality of the treatment makes use of Nelder’s theory of general balance. However, where the purpose is to make inferences about the effects for individual patients, we show that a mixed model is needed. There are strong parallels to the difference between fixed and random effects meta-analyses and these are discussed. [ABSTRACT FROM AUTHOR]

Combinatorial test design is a plan of test that aims to reduce the amount of test cases systematically by choosing a subset of the test cases based on the combination of input variables. The subset covers all possible combinations of a given strength and hence tries to match the effectiveness of the exhaustive set. This mechanism of reduction has been used successfully in software testing research with t-way testing (where t indicates the interaction strength of combinations). Potentially, other systems may exhibit many similarities with this approach. Hence, it could form an emerging application in different areas of research due to its usefulness. To this end, more recently it has been applied in a few research areas successfully. In this paper, we explore the applicability of combinatorial test design technique for Fractional Order (FO), Proportional-Integral-Derivative (PID) parameter design controller, named as FOPID, for an automatic voltage regulator (AVR) system. Throughout the paper, we justify this new application theoretically and practically through simulations. In addition, we report on first experiments indicating its practical use in this field. We design different algorithms and adapted other strategies to cover all the combinations with an optimum and effective test set. Our findings indicate that combinatorial test design can find the combinations that lead to optimum design. Besides this, we also found that by increasing the strength of combination, we can approach to the optimum design in a way that with only 4-way combinatorial set, we can get the effectiveness of an exhaustive test set. This significantly reduced the number of tests needed and thus leads to an approach that optimizes design of parameters quickly. [ABSTRACT FROM AUTHOR]

In this paper, control of uncertain fractional-order financial chaotic system with input saturation and external disturbance is investigated. The unknown part of the input saturation as well as the system’s unknown nonlinear function is approximated by a fuzzy logic system. To handle the fuzzy approximation error and the estimation error of the unknown upper bound of the external disturbance, fractional-order adaptation laws are constructed. Based on fractional Lyapunov stability theorem, an adaptive fuzzy controller is designed, and the asymptotical stability can be guaranteed. Finally, simulation studies are given to indicate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

The development of a new drug is an extremely high-risk enterprise. The attrition rates of development projects and the average costs for each launched product are daunting, and the completion of a development program requires a very long time horizon. These facts imply that there are huge potential gains, should one be able to improve efficiency and enhance decision-making capabilities. In this paper, we argue that substantial gains can be achieved by adapting a holistic view of drug development. Historically, too much planning, design and decision-making in the pharmaceutical development has been based on locally optimising separate parts of the development program, and too often important sources of uncertainty are ignored. We propose instead a model-based approach built on two essential pillars; (1) an integrated holistic view of the development program, including post-launch marketing and sales, with all parts evaluated simultaneously; (2) an explicit appreciation of all relevant sources of uncertainty. Computer simulations are utilised to evaluate the properties of the program options at hand, and to provide valuable quantitative decision support. Applications of this modelling approach have proven to add large value to development projects in terms of better program options being generated and more value-adding decisions taken. [ABSTRACT FROM AUTHOR]

As a result of the greatly increased use of mobile devices, the disadvantages of portable devices have gradually begun to emerge. To solve these problems, the use of mobile cloud computing assisted by cloud data centers has been proposed. However, cloud data centers are always very far from the mobile requesters. In this paper, we propose an improved multi-objective local mobile cloud model: Compounded Local Mobile Cloud Architecture with Dynamic Priority Queues (LMCpri). This new architecture could briefly store jobs that arrive simultaneously at the cloudlet in different priority positions according to the result of auction processing, and then execute partitioning tasks on capable helpers. In the Scheduling Module, NSGA-II is employed as the scheduling algorithm to shorten processing time and decrease requester cost relative to PSO and sequential scheduling. The simulation results show that the number of iteration times that is defined to 30 is the best choice of the system. In addition, comparing with LMCque, LMCpri is able to effectively accommodate a requester who would like his job to be executed in advance and shorten execution time. Finally, we make a comparing experiment between LMCpri and cloud assisting architecture, and the results reveal that LMCpri presents a better performance advantage than cloud assisting architecture. [ABSTRACT FROM AUTHOR]

Orienteering problem (OP) is a routing problem, where the aim is to generate a path through set of nodes, which would maximize total score and would not exceed the budget. In this paper, we present an extension of classic OP—Orienteering Problem with Functional Profits (OPFP), where the score of a specific point depends on its characteristics, position in the route, and other points in the route. For solving OPFP, we developed an open-source framework for solving orienteering problems, which utilizes four core components of OP in its modular architecture. Fully-written in Go programming language our framework can be extended for solving different types of tasks with different algorithms; this was demonstrated by implementation of two popular algorithms for OP solving—Ant Colony Optimization and Recursive Greedy Algorithm. Computational efficiency of the framework was shown through solving four well-known OP types: classic Orienteering Problem (OP), Orienteering Problem with Compulsory Vertices (OPCV), Orienteering Problem with Time Windows (OPTW), and Time Dependent Orienteering Problem (TDOP) along with OPFP. Experiments were conducted on a large multi-source dataset for Saint Petersburg, Russia, containing data from Instagram, TripAdvisor, Foursquare and official touristic website. Our framework is able to construct touristic paths for different OP types within few seconds using dataset with thousands of points of interest. [ABSTRACT FROM AUTHOR]

When assessing the short-term effect of air pollution on health outcomes, it is common practice to consider one pollutant at a time, due to their high correlation. Multi pollutant methods have been recently proposed, mainly consisting of collapsing the different pollutants into air quality indexes or clustering the pollutants and then evaluating the effect of each cluster on the health outcome. A major drawback of such approaches is that it is not possible to evaluate the health impact of each pollutant. In this paper we propose the use of the Bayesian hierarchical framework to deal with multi pollutant concentrations in a two-component model: a pollutant model is specified to estimate the ‘true’ concentration values for each pollutant and then such concentration is linked to the health outcomes in a time-series perspective. Through a simulation study we evaluate the model performance and we apply the modelling framework to investigate the effect of six pollutants on cardiovascular mortality in Greater London in 2011-2012. [ABSTRACT FROM AUTHOR]

Zero-speed fin stabilizer is applied to reduce the roll motion of ships at zero speed. This paper aims to explore the control strategy of zero-speed fin stabilizer through a composite method of theoretical analysis, simulations and tank tests. The hydrodynamic force model is established using analytical approach and a simplified model is obtained by fitting the CFD simulation data. The control strategy of zero-speed fin stabilizer is obtained based on disturbance and compensation by analyzing the phase matching relationship between the wave disturbance, the roll motion of the ship, the movement of the fin and the fin-induced hydrodynamic force. Simulations and water tank tests are performed to verify the effectiveness and feasibility of the obtained control strategies. The results of simulations and tank tests show that the obtained control strategies of zero-speed fin stabilizer based on disturbance and compensation are effective and practical. The proposed method provides theoretical and experimental support for engineering application, and can also be a reference for the controller design of zero-speed fin stabilizers. [ABSTRACT FROM AUTHOR]

This paper focuses on the effects of vehicle gap changes on fuel and emission performance of the simulated traffic flow in the adaptive cruise control (ACC) strategy. Firstly, the close correlation of vehicle gap changes and the host car's behaviors was explored with the measured car-following data. Secondly, the correlation between the host car's velocity and vehicle gap changes with different memory steps was also explored to develop the nth car’s optimal velocity function. Thirdly, a microscopic traffic simulation program was created for analyzing the traffic flow evolution process and approximately estimating the fuel consumptions and exhaust emissions. As a result, it was seen that vehicle gap changes with memory significantly affect fuel economy and emission performance of the simulated traffic flow in the ACC strategy, which can result in low fuel consumptions and exhaust emissions. This study is an incremental step forward for designing the control strategy of the ACC system. [ABSTRACT FROM AUTHOR]

Identifying influential nodes is an important topic in many diverse applications, such as accelerating information propagation, controlling rumors and diseases. Many methods have been put forward to identify influential nodes in complex networks, ranging from node centrality to diffusion-based processes. However, most of the previous studies do not take into account overlapping communities in networks. In this paper, we propose an effective method based on network representation learning. The method considers not only the overlapping communities in networks, but also the network structure. Experiments on real-world networks show that the proposed method outperforms many benchmark algorithms and can be used in large-scale networks. [ABSTRACT FROM AUTHOR]

Most of real-world image distortions are multiply distortion rather than single distortion. To address this issue, in this paper we propose a quaternion wavelet transform (QWT) based full reference image quality assessment (FR IQA) metric for multiply distorted images, which jointly considers the local similarity of phase and magnitude of each subband via QWT. Firstly, the reference images and distorted images are decomposed by QWT, and then the similarity of amplitude and phase are calculated on each subband, thirdly the IQA metric is constructed by the weighting method considering human visual system (HVS) characteristics, and lastly the scores of each subband are averaged to get the quality score of test image. Experimental results show that the proposed method outperforms the state of art in multiply distorted IQA. [ABSTRACT FROM AUTHOR]

Plants use many strategies to move efficiently in soil, such as growth from the tip, tropic movements, and morphological changes. In this paper, we propose a method to translate morphological features of Zea mays roots into a new design of soft robots that will be able to move in soil. The method relies on image processing and curve fitting techniques to extract the profile of Z. mays primary root. We implemented an analytic translation of the root profile in a 3D model (CAD) to fabricate root-like probes by means of 3D printing technology. Then, we carried out a comparative analysis among the artificial root-like probe and probes with different tip shapes (cylindrical, conical, elliptical, and parabolic) and diameters (11, 9, 7, 5, and 3 mm). The results showed that the energy consumption and the penetration force of the bioinspired probe are better with respect to the other shapes for all the diameters of the developed probes. For 100 mm of penetration depth and 7 mm of probe diameter, the energy consumption of the bioinspired probe is 89% lesser with respect to the cylindrical probe and 26% lesser with respect to the conical probe. The penetration performance of the considered tip shapes was evaluated also by means of numerical simulations, obtaining a good agreement with the experimental results. Additional investigations on plant root morphology, movement strategies, and material properties can allow the development of innovative bioinspired solutions exploitable in challenging environments. This research can bring to breakthrough scenarios in different fields, such as exploration tasks, environmental monitoring, geotechnical studies, and medical applications. [ABSTRACT FROM AUTHOR]

Revocation functionality and hierarchy key delegation are two necessary and crucial requirements to identity-based cryptosystems. Revocable hierarchical identity-based encryption (RHIBE) has attracted a lot of attention in recent years, many RHIBE schemes have been proposed but shown to be either insecure or bounded where they have to fix the maximum hierarchical depth of RHIBE at setup. In this paper, we propose a new unbounded RHIBE scheme with decryption key exposure resilience and with short public system parameters, and prove our RHIBE scheme to be adaptively secure. Our system model is scalable inherently to accommodate more levels of user adaptively with no adding workload or restarting the system. By carefully designing the hybrid games, we overcome the subtle obstacle in applying the dual system encryption methodology for the unbounded and revocable HIBE. To the best of our knowledge, this is the first construction of adaptively secure unbounded RHIBE scheme. [ABSTRACT FROM AUTHOR]

With the exploitation of offshore oil and gas gradually moving to deep water, higher temperature differences and pressure differences are applied to the pipeline system, making the global buckling of the pipeline more serious. For unburied deep-water pipelines, the lateral buckling is the major buckling form. The initial imperfections widely exist in the pipeline system due to manufacture defects or the influence of uneven seabed, and the distribution and geometry features of initial imperfections are random. They can be divided into two kinds based on shape: single-arch imperfections and double-arch imperfections. This paper analyzed the global buckling process of a pipeline with 2 initial imperfections by using a numerical simulation method and revealed how the ratio of the initial imperfection’s space length to the imperfection’s wavelength and the combination of imperfections affects the buckling process. The results show that a pipeline with 2 initial imperfections may suffer the superposition of global buckling. The growth ratios of buckling displacement, axial force and bending moment in the superposition zone are several times larger than no buckling superposition pipeline. The ratio of the initial imperfection’s space length to the imperfection’s wavelength decides whether a pipeline suffers buckling superposition. The potential failure point of pipeline exhibiting buckling superposition is as same as the no buckling superposition pipeline, but the failure risk of pipeline exhibiting buckling superposition is much higher. The shape and direction of two nearby imperfections also affects the failure risk of pipeline exhibiting global buckling superposition. The failure risk of pipeline with two double-arch imperfections is higher than pipeline with two single-arch imperfections. [ABSTRACT FROM AUTHOR]

Reactive navigation is a well-known paradigm for controlling an autonomous mobile robot, which suggests making all control decisions through some light processing of the current/recent sensor data. Among the many advantages of this paradigm are: 1) the possibility to apply it to robots with limited and low-priced hardware resources, and 2) the fact of being able to safely navigate a robot in completely unknown environments containing unpredictable moving obstacles. As a major disadvantage, nevertheless, the reactive paradigm may occasionally cause robots to get trapped in certain areas of the environment—typically, these conflicting areas have a large concave shape and/or are full of closely-spaced obstacles. In this last respect, an enormous effort has been devoted to overcome such a serious drawback during the last two decades. As a result of this effort, a substantial number of new approaches for reactive navigation have been put forward. Some of these approaches have clearly improved the way how a reactively-controlled robot can move among densely cluttered obstacles; some other approaches have essentially focused on increasing the variety of obstacle shapes and sizes that could be successfully circumnavigated; etc. In this paper, as a starting point, we choose the best existing reactive approach to move in densely cluttered environments, and we also choose the existing reactive approach with the greatest ability to circumvent large intricate-shaped obstacles. Then, we combine these two approaches in a way that makes the most of them. From the experimental point of view, we use both simulated and real scenarios of challenging complexity for testing purposes. In such scenarios, we demonstrate that the combined approach herein proposed clearly outperforms the two individual approaches on which it is built. [ABSTRACT FROM AUTHOR]

The sampling of scale-free networks in Molecular Biology is usually achieved by growing networks from a seed using recursive algorithms with elementary moves which include the addition and deletion of nodes and bonds. These algorithms include the Barabási-Albert algorithm. Later algorithms, such as the Duplication-Divergence algorithm, the Solé algorithm and the iSite algorithm, were inspired by biological processes underlying the evolution of protein networks, and the networks they produce differ essentially from networks grown by the Barabási-Albert algorithm. In this paper the mean field analysis of these algorithms is reconsidered, and extended to variant and modified implementations of the algorithms. The degree sequences of scale-free networks decay according to a powerlaw distribution, namely P(k) ∼ k− γ, where γ is a scaling exponent. We derive mean field expressions for γ, and test these by numerical simulations. Generally, good agreement is obtained. We also found that some algorithms do not produce scale-free networks (for example some variant Barabási-Albert and Solé networks). [ABSTRACT FROM AUTHOR]

This paper proposes the correction of faulty sensors using a synthesis of the greedy sparse constrained optimization GSCO) technique. The failure of sensors can damage the radiation power pattern in terms of sidelobes and nulls. The synthesis problem can recover the wanted power pattern with reduced number of sensors into the background of greedy algorithm and solved with orthogonal matching pursuit (OMP) technique. Numerical simulation examples of linear arrays are offered to demonstrate the effectiveness of getting the wanted power pattern with a reduced number of antenna sensors which is compared with the available techniques in terms of sidelobes level and number of nulls. [ABSTRACT FROM AUTHOR]

Investigation of the driven mechanism of the price dynamics in complex financial systems is important and challenging. In this paper, we propose an investment strategy to study how dynamic fluctuations drive the price movements. The strategy is successfully applied to different stock markets in the world, and the result indicates that the driving effect of the dynamic fluctuations is rather robust. We investigate how the strategy performance is influenced by the market states and optimize the strategy performance by introducing two parameters. The strategy is also compared with several typical technical trading rules. Our findings not only provide an investment strategy which extends investors’ profits, but also offer a useful method to look into the dynamic properties of complex financial systems. [ABSTRACT FROM AUTHOR]

This paper demonstrates a framework of processes for identifying potential witnesses of events from evidence they post to social media. The research defines original evidence models for micro-blog content sources, the relative uncertainty of different evidence types, and models for testing evidence by combination. Methods to filter and extract evidence using automated and semi-automated means are demonstrated using a Twitter case study event. Further, an implementation to test extracted evidence using Dempster Shafer Theory of Evidence are presented. The results indicate that the inclusion of evidence from micro-blog text and linked image content can increase the number of micro-bloggers identified at events, in comparison to the number of micro-bloggers identified from geotags alone. Additionally, the number of micro-bloggers that can be tested for evidence corroboration or conflict, is increased by incorporating evidence identified in their posting history. [ABSTRACT FROM AUTHOR]

Penetration attacks are one of the most serious network security threats. However, existing network defense technologies do not have the ability to entirely block the penetration behavior of intruders. Therefore, the network needs additional defenses. In this paper, a decoy chain deployment (DCD) method based on SDN+NFV is proposed to address this problem. This method considers about the security status of networks, and deploys decoy chains with the resource constraints. DCD changes the attack surface of the network and makes it difficult for intruders to discern the current state of the network. Simulation experiments and analyses show that DCD can effectively resist penetration attacks by increasing the time cost and complexity of a penetration attack. [ABSTRACT FROM AUTHOR]

Based on the traditional Fast Retina Keypoint (FREAK) feature description algorithm, this paper proposed a Gravity-FREAK feature description algorithm based on Micro-electromechanical Systems (MEMS) sensor to overcome the limited computing performance and memory resources of mobile devices and further improve the reality interaction experience of clients through digital information added to the real world by augmented reality technology. The algorithm takes the gravity projection vector corresponding to the feature point as its feature orientation, which saved the time of calculating the neighborhood gray gradient of each feature point, reduced the cost of calculation and improved the accuracy of feature extraction. In the case of registration method of matching and tracking natural features, the adaptive and generic corner detection based on the Gravity-FREAK matching purification algorithm was used to eliminate abnormal matches, and Gravity Kaneda-Lucas Tracking (KLT) algorithm based on MEMS sensor can be used for the tracking registration of the targets and robustness improvement of tracking registration algorithm under mobile environment. [ABSTRACT FROM AUTHOR]

The objective of this paper is to evaluate a panel of statistical algorithms for temporal outbreak detection. Based on a large dataset of simulated weekly surveillance time series, we performed a systematic assessment of 21 statistical algorithms, 19 implemented in the R package and two other methods. We estimated false positive rate (FPR), probability of detection (POD), probability of detection during the first week, sensitivity, specificity, negative and positive predictive values and F1-measure for each detection method. Then, to identify the factors associated with these performance measures, we ran multivariate Poisson regression models adjusted for the characteristics of the simulated time series (trend, seasonality, dispersion, outbreak sizes, etc.). The FPR ranged from 0.7% to 59.9% and the POD from 43.3% to 88.7%. Some methods had a very high specificity, up to 99.4%, but a low sensitivity. Methods with a high sensitivity (up to 79.5%) had a low specificity. All methods had a high negative predictive value, over 94%, while positive predictive values ranged from 6.5% to 68.4%. Multivariate Poisson regression models showed that performance measures were strongly influenced by the characteristics of time series. Past or current outbreak size and duration strongly influenced detection performances. [ABSTRACT FROM AUTHOR]

The use of RFID technology in complex and distributed environments often leads to a multi-domain RFID system, in which trust establishment among entities from heterogeneous domains without past interaction or prior agreed policy, is a challenge. The current trust management mechanisms in the literature do not meet the specific requirements in multi-domain RFID systems. Therefore, this paper analyzes the special challenges on trust management in multi-domain RFID systems, and identifies the implications and the requirements of the challenges on the solutions to the trust management of multi-domain RFID systems. A multi-domain trust management model is proposed, which provides a hierarchical trust management framework include a diversity of trust evaluation and establishment approaches. The simulation results and analysis show that the proposed method has excellent ability to deal with the trust relationships, better security, and higher accuracy rate. [ABSTRACT FROM AUTHOR]

To further improve the fuel economy of series hybrid electric tracked vehicles, a reinforcement learning (RL)-based real-time energy management strategy is developed in this paper. In order to utilize the statistical characteristics of online driving schedule effectively, a recursive algorithm for the transition probability matrix (TPM) of power-request is derived. The reinforcement learning (RL) is applied to calculate and update the control policy at regular time, adapting to the varying driving conditions. A facing-forward powertrain model is built in detail, including the engine-generator model, battery model and vehicle dynamical model. The robustness and adaptability of real-time energy management strategy are validated through the comparison with the stationary control strategy based on initial transition probability matrix (TPM) generated from a long naturalistic driving cycle in the simulation. Results indicate that proposed method has better fuel economy than stationary one and is more effective in real-time control. [ABSTRACT FROM AUTHOR]

A subset of neurons in the posterior parietal and premotor areas of the primate brain respond to the locations of visual targets in a hand-centred frame of reference. Such hand-centred visual representations are thought to play an important role in visually-guided reaching to target locations in space. In this paper we show how a biologically plausible, Hebbian learning mechanism may account for the development of localized hand-centred representations in a hierarchical neural network model of the primate visual system, VisNet. The hand-centered neurons developed in the model use an invariance learning mechanism known as continuous transformation (CT) learning. In contrast to previous theoretical proposals for the development of hand-centered visual representations, CT learning does not need a memory trace of recent neuronal activity to be incorporated in the synaptic learning rule. Instead, CT learning relies solely on a Hebbian learning rule, which is able to exploit the spatial overlap that naturally occurs between successive images of a hand-object configuration as it is shifted across different retinal locations due to saccades. Our simulations show how individual neurons in the network model can learn to respond selectively to target objects in particular locations with respect to the hand, irrespective of where the hand-object configuration occurs on the retina. The response properties of these hand-centred neurons further generalise to localised receptive fields in the hand-centred space when tested on novel hand-object configurations that have not been explored during training. Indeed, even when the network is trained with target objects presented across a near continuum of locations around the hand during training, the model continues to develop hand-centred neurons with localised receptive fields in hand-centred space. With the help of principal component analysis, we provide the first theoretical framework that explains the behavior of Hebbian learning in VisNet. [ABSTRACT FROM AUTHOR]

Network address shuffling is a novel moving target defense (MTD) that invalidates the address information collected by the attacker by dynamically changing or remapping the host’s network addresses. However, most network address shuffling methods are limited by the limited address space and rely on the host’s static domain name to map to its dynamic address; therefore these methods cannot effectively defend against random scanning attacks, and cannot defend against an attacker who knows the target’s domain name. In this paper, we propose a network defense method based on random domain name and address mutation (RDAM), which increases the scanning space of the attacker through a dynamic domain name method and reduces the probability that a host will be hit by an attacker scanning IP addresses using the domain name system (DNS) query list and the time window methods. Theoretical analysis and experimental results show that RDAM can defend against scanning attacks and worm propagation more effectively than general network address shuffling methods, while introducing an acceptable operational overhead. [ABSTRACT FROM AUTHOR]

The assessment of gait variability using stochastic signal processing techniques such as detrended fluctuation analysis (DFA) has been shown to be a sensitive tool for evaluation of gait alterations due to aging and neuromuscular disease. However, previous studies have suggested that the application of DFA requires relatively long recordings (600 strides), which is difficult when working with clinical populations or older adults. In this paper we propose a model for predicting DFA variance in experimental data and conduct a Monte Carlo simulation to estimate the sample size and number of trials required to detect a change in DFA scaling exponent. We illustrate the model in a simulation to detect a difference of 0.1 (medium effect) between two groups of subjects when using short gait time series (100 to 200 strides) in the context of between- and within-subject designs. We assumed that the variance of DFA scaling exponent arises due to individual differences, time series length, and experimental error. Results showed that sample sizes required to achieve acceptable power of 80% are practically feasible, especially when using within-subject designs. For example, to detect a group difference in the DFA scaling exponent of 0.1, it would require either 25 subjects and 2 trials per subject or 12 subjects and 4 trials per subject using a within-subject design. We then compared plausibility of such power predictions to the empirically observed power from a study that required subjects to synchronize with a persistent fractal metronome. The results showed that the model adequately predicted the empirical pattern of results. Our power simulations could be used in conjunction with previous design guidelines in the literature when planning new gait variability experiments. [ABSTRACT FROM AUTHOR]

As the quality of crucial entities can directly affect that of software, their identification and protection become an important premise for effective software development, management, maintenance and testing, which thus contribute to improving the software quality and its attack-defending ability. Most analysis and evaluation on important entities like codes-based static structure analysis are on the destruction of the actual software running. In this paper, from the perspective of software execution process, we proposed an approach to mine dynamic noteworthy functions (DNFM)in software execution sequences. First, according to software decompiling and tracking stack changes, the execution traces composed of a series of function addresses were acquired. Then these traces were modeled as execution sequences and then simplified so as to get simplified sequences (SFS), followed by the extraction of patterns through pattern extraction (PE) algorithm from SFS. After that, evaluating indicators inner-importance and inter-importance were designed to measure the noteworthiness of functions in DNFM algorithm. Finally, these functions were sorted by their noteworthiness. Comparison and contrast were conducted on the experiment results from two traditional complex network-based node mining methods, namely PageRank and DegreeRank. The results show that the DNFM method can mine noteworthy functions in software effectively and precisely. [ABSTRACT FROM AUTHOR]

Color image compression is a commonly used process to represent image data as few bits as possible, which removes redundancy in the data while maintaining an appropriate level of quality for the user. Color image compression algorithms based on quaternion are very common in recent years. In this paper, we propose a color image compression scheme, based on the real SVD, named real compression scheme. First, we form a new real rectangular matrix C according to the red, green and blue components of the original color image and perform the real SVD for C. Then we select several largest singular values and the corresponding vectors in the left and right unitary matrices to compress the color image. We compare the real compression scheme with quaternion compression scheme by performing quaternion SVD using the real structure-preserving algorithm. We compare the two schemes in terms of operation amount, assignment number, operation speed, PSNR and CR. The experimental results show that with the same numbers of selected singular values, the real compression scheme offers higher CR, much less operation time, but a little bit smaller PSNR than the quaternion compression scheme. When these two schemes have the same CR, the real compression scheme shows more prominent advantages both on the operation time and PSNR. [ABSTRACT FROM AUTHOR]

There are various fantastic biological phenomena in biological pattern formation. Mathematical modeling using reaction-diffusion partial differential equation systems is employed to study the mechanism of pattern formation. However, model parameter selection is both difficult and time consuming. In this paper, a visual feedback simulation framework is proposed to calculate the parameters of a mathematical model automatically based on the basic principle of feedback control. In the simulation framework, the simulation results are visualized, and the image features are extracted as the system feedback. Then, the unknown model parameters are obtained by comparing the image features of the simulation image and the target biological pattern. Considering two typical applications, the visual feedback simulation framework is applied to fulfill pattern formation simulations for vascular mesenchymal cells and lung development. In the simulation framework, the spot, stripe, labyrinthine patterns of vascular mesenchymal cells, the normal branching pattern and the branching pattern lacking side branching for lung branching are obtained in a finite number of iterations. The simulation results indicate that it is easy to achieve the simulation targets, especially when the simulation patterns are sensitive to the model parameters. Moreover, this simulation framework can expand to other types of biological pattern formation. [ABSTRACT FROM AUTHOR]

Human motion models are finding an increasing number of novel applications in many different fields, such as building design, computer graphics and robot motion planning. The Social Force Model is one of the most popular alternatives to describe the motion of pedestrians. By resorting to a physical analogy, individuals are assimilated to point-wise particles subject to social forces which drive their dynamics. Such a model implicitly assumes that humans move isotropically. On the contrary, empirical evidence shows that people do have a preferred direction of motion, walking forward most of the time. Lateral motions are observed only in specific circumstances, such as when navigating in overcrowded environments or avoiding unexpected obstacles. In this paper, the Headed Social Force Model is introduced in order to improve the realism of the trajectories generated by the classical Social Force Model. The key feature of the proposed approach is the inclusion of the pedestrians’ heading into the dynamic model used to describe the motion of each individual. The force and torque representing the model inputs are computed as suitable functions of the force terms resulting from the traditional Social Force Model. Moreover, a new force contribution is introduced in order to model the behavior of people walking together as a single group. The proposed model features high versatility, being able to reproduce both the unicycle-like trajectories typical of people moving in open spaces and the point-wise motion patterns occurring in high density scenarios. Extensive numerical simulations show an increased regularity of the resulting trajectories and confirm a general improvement of the model realism. [ABSTRACT FROM AUTHOR]

Background: Non-coding RNAs perform a wide range of functions inside the living cells that are related to their structures. Several algorithms have been proposed to predict RNA secondary structure based on minimum free energy. Low prediction accuracy of these algorithms indicates that free energy alone is not sufficient to predict the functional secondary structure. Recently, the obtained information from the SHAPE experiment greatly improves the accuracy of RNA secondary structure prediction by adding this information to the thermodynamic free energy as pseudo-free energy. Method: In this paper, a new method is proposed to predict RNA secondary structure based on both free energy and SHAPE pseudo-free energy. For each RNA sequence, a population of secondary structures is constructed and their SHAPE data are simulated. Then, an evolutionary algorithm is used to improve each structure based on both free and pseudo-free energies. Finally, a structure with minimum summation of free and pseudo-free energies is considered as the predicted RNA secondary structure. Results and Conclusions: Computationally simulating the SHAPE data for a given RNA sequence requires its secondary structure. Here, we overcome this limitation by employing a population of secondary structures. This helps us to simulate the SHAPE data for any RNA sequence and consequently improves the accuracy of RNA secondary structure prediction as it is confirmed by our experiments. The source code and web server of our proposed method are freely available at . [ABSTRACT FROM AUTHOR]

Melioration learning is an empirically well-grounded model of reinforcement learning. By means of computer simulations, this paper derives predictions for several repeatedly played two-person games from this model. The results indicate a likely convergence to a pure Nash equilibrium of the game. If no pure equilibrium exists, the relative frequencies of choice may approach the predictions of the mixed Nash equilibrium. Yet in some games, no stable state is reached. [ABSTRACT FROM AUTHOR]

Anonymity, which is more and more important to multi-receiver schemes, has been taken into consideration by many researchers recently. To protect the receiver anonymity, in 2010, the first multi-receiver scheme based on the Lagrange interpolating polynomial was proposed. To ensure the sender’s anonymity, the concept of the ring signature was proposed in 2005, but afterwards, this scheme was proven to has some weakness and at the same time, a completely anonymous multi-receiver signcryption scheme is proposed. In this completely anonymous scheme, the sender anonymity is achieved by improving the ring signature, and the receiver anonymity is achieved by also using the Lagrange interpolating polynomial. Unfortunately, the Lagrange interpolation method was proven a failure to protect the anonymity of receivers, because each authorized receiver could judge whether anyone else is authorized or not. Therefore, the completely anonymous multi-receiver signcryption mentioned above can only protect the sender anonymity. In this paper, we propose a new completely anonymous multi-receiver signcryption scheme with a new polynomial technology used to replace the Lagrange interpolating polynomial, which can mix the identity information of receivers to save it as a ciphertext element and prevent the authorized receivers from verifying others. With the receiver anonymity, the proposed scheme also owns the anonymity of the sender at the same time. Meanwhile, the decryption fairness and public verification are also provided. [ABSTRACT FROM AUTHOR]

Traffic identification of the target category is currently a significant challenge for network monitoring and management. To identify the target category with pertinence, a feature extraction algorithm based on the subset with highest proportion is presented in this paper. The method is proposed to be applied to the identification of any category that is assigned as the target one, but not restricted to certain specific category. We divide the process of feature extraction into two stages. In the stage of primary feature extraction, the feature subset is extracted from the dataset which has the highest proportion of the target category. In the stage of secondary feature extraction, the features that can distinguish the target and interfering categories are added to the feature subset. Our theoretical analysis and experimental observations reveal that the proposed algorithm is able to extract fewer features with greater identification ability of the target category. Moreover, the universality of the proposed algorithm proves to be available with the experiment that every category is set to be the target one. [ABSTRACT FROM AUTHOR]

As one of data mining techniques, outlier detection aims to discover outlying observations that deviate substantially from the reminder of the data. Recently, the Local Outlier Factor (LOF) algorithm has been successfully applied to outlier detection. However, due to the computational complexity of the LOF algorithm, its application to large data with high dimension has been limited. The aim of this paper is to propose grid-based algorithm that reduces the computation time required by the LOF algorithm to determine the k-nearest neighbors. The algorithm divides the data spaces in to a smaller number of regions, called as a “grid”, and calculates the LOF value of each grid. To examine the effectiveness of the proposed method, several experiments incorporating different parameters were conducted. The proposed method demonstrated a significant computation time reduction with predictable and acceptable trade-off errors. Then, the proposed methodology was successfully applied to real database transaction logs of Korea Atomic Energy Research Institute. As a result, we show that for a very large dataset, the grid-LOF can be considered as an acceptable approximation for the original LOF. Moreover, it can also be effectively used for real-time outlier detection. [ABSTRACT FROM AUTHOR]

Data analysis and model-data comparisons in the environmental sciences require diagnostic measures that quantify time series dynamics and structure, and are robust to noise in observational data. This paper investigates the temporal dynamics of environmental time series using measures quantifying their information content and complexity. The measures are used to classify natural processes on one hand, and to compare models with observations on the other. The present analysis focuses on the global carbon cycle as an area of research in which model-data integration and comparisons are key to improving our understanding of natural phenomena. We investigate the dynamics of observed and simulated time series of Gross Primary Productivity (GPP), a key variable in terrestrial ecosystems that quantifies ecosystem carbon uptake. However, the dynamics, patterns and magnitudes of GPP time series, both observed and simulated, vary substantially on different temporal and spatial scales. We demonstrate here that information content and complexity, or Information Theory Quantifiers (ITQ) for short, serve as robust and efficient data-analytical and model benchmarking tools for evaluating the temporal structure and dynamical properties of simulated or observed time series at various spatial scales. At continental scale, we compare GPP time series simulated with two models and an observations-based product. This analysis reveals qualitative differences between model evaluation based on ITQ compared to traditional model performance metrics, indicating that good model performance in terms of absolute or relative error does not imply that the dynamics of the observations is captured well. Furthermore, we show, using an ensemble of site-scale measurements obtained from the FLUXNET archive in the Mediterranean, that model-data or model-model mismatches as indicated by ITQ can be attributed to and interpreted as differences in the temporal structure of the respective ecological time series. At global scale, our understanding of C fluxes relies on the use of consistently applied land models. Here, we use ITQ to evaluate model structure: The measures are largely insensitive to climatic scenarios, land use and atmospheric gas concentrations used to drive them, but clearly separate the structure of 13 different land models taken from the CMIP5 archive and an observations-based product. In conclusion, diagnostic measures of this kind provide data-analytical tools that distinguish different types of natural processes based solely on their dynamics, and are thus highly suitable for environmental science applications such as model structural diagnostics. [ABSTRACT FROM AUTHOR]

Source number estimation methods for single channel signal have been investigated and the improvements for each method are suggested in this work. Firstly, the single channel data is converted to multi-channel form by delay process. Then, algorithms used in the array signal processing, such as Gerschgorin’s disk estimation (GDE) and minimum description length (MDL), are introduced to estimate the source number of the received signal. The previous results have shown that the MDL based on information theoretic criteria (ITC) obtains a superior performance than GDE at low SNR. However it has no ability to handle the signals containing colored noise. On the contrary, the GDE method can eliminate the influence of colored noise. Nevertheless, its performance at low SNR is not satisfactory. In order to solve these problems and contradictions, the work makes remarkable improvements on these two methods on account of the above consideration. A diagonal loading technique is employed to ameliorate the MDL method and a jackknife technique is referenced to optimize the data covariance matrix in order to improve the performance of the GDE method. The results of simulation have illustrated that the performance of original methods have been promoted largely. [ABSTRACT FROM AUTHOR]

Due to a set of constant initial values, the performance of conventional TCP drops significantly encountering heterogeneous network, showing low throughput and unfairness. This paper firstly demonstrates the chaotic character of TCP congestion control in heterogeneous network, especially the sensitivity to initial value. Inspired by merit of nature-inspired algorithm, a novel structure of TCP congestion control (IPPM, Internet Prey-Predator Model) is proposed. Parameters such as available link capacity(C), congestion window (W) and queue length (Q) are collected by IPPM, which calculates the max value of C according to the interacting relationship existing in C, W and Q, and IPPM initiates the TCP ssthresh with the calculated value. Plenty of simulation results show that the modified TCP can effectively avoid network congestion and packet loss. Besides, it holds high resource utilization, convergence speeds, fairness and stability. [ABSTRACT FROM AUTHOR]

It has recently been suggested that movement variability directly increases the speed of motor learning. Here we use computational modeling of motor adaptation to show that variability can have a broad range of effects on learning, both negative and positive. Experimentally, we also find contributing and decelerating effects. Lastly, through a meta-analysis of published papers, we verify that across a wide range of experiments, movement variability has no statistical relation with learning rate. While motor learning is a complex process that can be modeled, further research is needed to understand the relative importance of the involved factors. [ABSTRACT FROM AUTHOR]