Search

Summary Genomic sequences are assembled into a variable, but large number of contigs that should be scaffolded (ordered and oriented) for facilitating comparative or functional analysis. Finding scaffolding is computationally challenging due to misassemblies, inconsistent coverage across the genome and long repeats. An accurate assessment of scaffolding tools should take into account multiple locations of the same contig on the reference scaffolding rather than matching a repeat to a single best location. This makes mapping of inferred scaffoldings onto the reference a computationally challenging problem. This paper formulates the repeat-aware scaffolding evaluation problem, which is to find a mapping of the inferred scaffolding onto the reference maximizing number of correct links and proposes a scalable algorithm capable of handling large whole-genome datasets. Our novel scaffolding validation framework has been applied to assess the most of state-of-the-art scaffolding tools on the representative subset of Genome Assembly Golden-Standard Evaluations (GAGE) datasets and some novel simulated datasets. Availability and implementation The source code of this evaluation framework is available at https://github.com/mandricigor/repeat-aware. The documentation is hosted at https://mandricigor.github.io/repeat-aware. Supplementary information Supplementary data are available at Bioinformatics online. [ABSTRACT FROM AUTHOR]

For railway operators, one of many important goals is to improve the utilization efficiency of electric multiple units (EMUs). When operators design EMU circulation plans, EMU type restrictions are critical factors when assigning EMUs to the correct depots for maintenance. However, existing studies only consider that EMUs are maintained at their home depots. However, targeting that problem, in this paper, an optimization model for the EMU circulation planning problem that allows depots to be selected for EMU maintenance is proposed. This model aims at optimizing the number of used EMUs and the number of EMU maintenance tasks and simultaneously incorporates other important constraints, including type restrictions, on EMU maintenance and night accommodation capacity at depots. In order to solve the model, a branch-and-price algorithm is also developed. A case study of a real-world high-speed railway was conducted to compare and analyze the effects of different maintenance location constraints. The results show that the number of EMUs used will decrease under the maintenance sharing scheme, the number of EMU maintenance tasks can be reduced, and the time occupied in EMU maintenance will be released. In addition, the scheme of maintenance resources sharing and increases to mileage limits can effectively decrease the number of EMU maintenance tasks significantly. The model and algorithm can be used as an effective quantitative analysis tool for railway operators' decision-making processes in the EMU circulation planning problem. [ABSTRACT FROM AUTHOR]

Place descriptions in everyday communication or in online text provide a rich source of spatial knowledge about places. Such descriptions typically consist of references to places and spatial relationships between them. An important step to utilize such knowledge in information systems is georeferencing the referred places. Beside place name disambiguation, another challenge is that a significant proportion of place references in such descriptions are not official place names indexed by gazetteers, thus cannot be resolved easily. This paper presents a novel approach for georeferencing places from collective descriptions using place graphs, regardless of whether they are referred to by gazetteered names or not. The approach leverages spatial relation models for approximate locating and matching. Different models are proposed and evaluated using several metrics. [ABSTRACT FROM AUTHOR]

This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algorithm is proposed by combining the simulated annealing and clonal selection algorithms. The proposed model and the hybrid algorithm are verified and validated using design of experiment and benchmark methods. The results show that the hybrid algorithm has an outstanding performance from both solution quality and computational time points of view. Besides, the proposed model can be used in both of the stochastic and deterministic situations. [ABSTRACT FROM AUTHOR]

Machine learning (ML) and artificial intelligence (AI) algorithms have the potential to derive insights from clinical data and improve patient outcomes. However, these highly complex systems are sensitive to changes in the environment and liable to performance decay. Even after their successful integration into clinical practice, ML/AI algorithms should be continuously monitored and updated to ensure their long-term safety and effectiveness. To bring AI into maturity in clinical care, we advocate for the creation of hospital units responsible for quality assurance and improvement of these algorithms, which we refer to as "AI-QI" units. We discuss how tools that have long been used in hospital quality assurance and quality improvement can be adapted to monitor static ML algorithms. On the other hand, procedures for continual model updating are still nascent. We highlight key considerations when choosing between existing methods and opportunities for methodological innovation. [ABSTRACT FROM AUTHOR]

Background: Recently, we developed a mathematical model for identifying putative competing endogenous RNA (ceRNA) interactions. This methodology has aroused a broad acknowledgment within the scientific community thanks to the encouraging results achieved when applied to breast invasive carcinoma, leading to the identification of PVT1, a long non-coding RNA functioning as ceRNA for the miR-200 family. The main shortcoming of the model is that it is no freely available and implemented in MATLAB®, a proprietary programming platform requiring a paid license for installing, operating, manipulating, and running the software. Results: Breaking through these model limitations demands to distribute it in an open-source, freely accessible environment, such as R, designed for an ordinary audience of users that are not able to afford a proprietary solution. Here, we present SPINNAKER (SPongeINteractionNetworkmAKER), the open-source version of our widely established mathematical model for predicting ceRNAs crosstalk, that is released as an exhaustive collection of R functions. SPINNAKER has been even designed for providing many additional features that facilitate its usability, make it more efficient in terms of further implementation and extension, and less intense in terms of computational execution time. Conclusions: SPINNAKER source code is freely available at https://github.com/sportingCode/SPINNAKER.git together with a thoroughgoing PPT-based guideline. In order to help users get the key points more conveniently, also a practical R-styled plain-text guideline is provided. Finally, a short movie is available to help the user to set the own directory, properly. [ABSTRACT FROM AUTHOR]

The system of nonlinear equations (SNLEs) is one of the eminent problems in science and engineering, and it is still open to research. A new hybrid intelligent algorithm is presented in this research to solve SNLEs. It is a composite of the salp swarm algorithm (SSA) and chaotic search technique (CST). The proposed methodology is named chaotic salp swarm algorithm (CSSA). CSSA is designed as an optimization process, whereby feasible and infeasible solutions are updated to move closer to the optimum value. The use of this hybrid intelligent methodology aims to improve performance, increase solution versatility, avoid the local optima trap, speed up convergence and optimize the search process. Firstly, SNLEs are transformed into an optimization problem. Secondly, CSSA is used to solve this optimization problem: SSA is used to update the feasible solutions, whereas the infeasible solutions are updated by CST. One of the most significant advantages of the suggested technique is that it does not ignore infeasible solutions that are updated, because these solutions are often extremely near to the optimal solution, resulting in increased search effectiveness and effective exploration and exploitation. The algorithm's mathematical model is presented in detail. Finally, the proposed approach is assessed with several benchmark problems and real-world applications. Simulation results show that the proposed CSSA is competitive and better in comparison to others, which illustrates the effectiveness of the proposed algorithm. In addition, a statistical analysis by the Wilcoxon rankings test between CSSA and the other comparison methods shows that all p-values are less than 0.05, and CSSA achieves negative ranks' sum values (R−) much better than the positive ranks' sum values (R+) in all benchmark problems. In addition, the results have high precision and show good agreement in comparison with similar methods, and they further proved the ability of CSSA to solve real-world applications. [ABSTRACT FROM AUTHOR]

Recently, market has witnessed a tremendous growth in E-commerce sales, which bring tons of opportunities as well as challenges. Warehouses have to handle unique characteristics of customer orders in the era of E-commerce which consists of small order scales, large items count, unexpected irregular order arrival patterns, seasonality demand peeks, and high service level expectations. Warehouses are adopting wave-picking as an effective policy composed of item-batching, load-assignment and picker-routing problems. In this research, principle combination of load-assignment and picker-routing problems is studied. A mixed integer mathematical model is established based on features of a wave-picking warehouse. In order to conquer the complexity caused by routing decision of the proposed problem, a set of effective modified Estimation Distribution Algorithms is developed. The set of proposed algorithms is proved to have stable gaps (1% on average and maximum less than 2%) compared with Cplex 12.8, while can be solved in much larger scale within quite short time (100 pickers and 350 items in each wave within less than 2 min). [ABSTRACT FROM AUTHOR]

We study, from a purely quantitative point of view, the quasi-steady-state assumption for the fundamental mathematical model of the general enzymatic reaction. In particular, (i) we introduce a simple, yet generic, algorithm for the proper scaling of the corresponding problem, (ii) we define the two essential parts (the standard and the reverse) of the quasi-steady-state assumption in a quantitative fashion, and (iii) we comment on the dispensable, although widely adopted, third part (the total) of it. [ABSTRACT FROM AUTHOR]

In recent years, the digitization of documents has progressed, and opportunities for handwritten document creation have decreased. However, handwritten notes are still taken for memorizing data, and automated digitalization is needed in some cases, such as making Excel sheets. When digitizing handwritten notes, manual input is required. Therefore, the automatic recognition and input of characters using a character recognition system is useful. However, if the characters are inclined, the recognition rate will be low. Therefore, we focus on the inclination correction problem of characters. The conventional method corrects the inclination and estimates the character line inclination. However, these methods do not work when characters exist in independent positions. Therefore, in this study, we propose a new method for estimating and correcting the tilt of independent handwritten digits by analyzing a circumscribed rectangle and other digital features. The proposed method is not based on an AI-based learning model or a complicated mathematical model. It is developed following a comparatively simple mathematical calculation that can be implemented on a microcontroller. Based on the results of the experiments using digits written in independent positions, the proposed method can correct the inclination with high accuracy. Furthermore, the proposed algorithm is low-computational cost and can be implemented in real-time on a microcontroller. [ABSTRACT FROM AUTHOR]

Among morphological phenomena, cellular patterns in developing sensory epithelia have gained attention in recent years. Although physical models for cellular rearrangements are well-established thanks to a large bulk of experimental work, their computational implementation lacks solid mathematical background and involves experimentally unreachable parameters. Here we introduce a level set-based computational framework as a tool to rigorously investigate evolving cellular patterns, and study its mathematical and computational properties. We illustrate that a compelling feature of the method is its ability to correctly handle complex topology changes, including frequent cell intercalations. Combining this accurate numerical scheme with an established mathematical model, we show that the proposed framework features minimum possible number of parameters and is capable of reproducing a wide range of tissue morphological phenomena, such as cell sorting, engulfment or internalization. In particular, thanks to precise mathematical treatment of cellular intercalations, this method succeeds in simulating experimentally observed development of cellular mosaic patterns in sensory epithelia. A numerical algorithm handles complex cell topology changes and reproduces tissue morphological phenomena without relying on nonphysical parameters. [ABSTRACT FROM AUTHOR]

This paper expresses the constant elasticity of variance option pricing formula in terms of the noncentral chi-square distribution. This allows the application of well-known approximation formulas and the derivation of a whole class of closed-form solutions. In addition, a simple and efficient algorithm for computing this distribution is presented. [ABSTRACT FROM AUTHOR]

The article discusses geometric mean criterion and stochastic dominance decision making models. The author derives the mathematical relationship between the geometric mean and the integrals of the probability density functions used in stochastic dominance testing from a general class of distributions. However, both the models can be justified by the expected utility hypothesis. The geometric mean criterion follows as a result of the assumption that the decision-maker has a logarithmic utility function. The stochastic dominance models require the assumption of the signs of the first few derivatives of the decision-maker's utility function. The author notes that stochastic dominance showed great promise in its early development as a method for constructing a theory of security price forecasting because of its limited set of assumptions regarding investor preferences.

In this paper, we investigate the use of first-order reliability methods to quantify the uncertainty in the remaining useful life (RUL) estimate of components used in engineering applications. The prediction of RUL is affected by several sources of uncertainty, and it is important to systematically quantify their combined effect on the RUL prediction in order to aid risk assessment, risk mitigation, and decision-making. While sampling-based algorithms have been conventionally used for quantifying the uncertainty in RUL, analytical approaches are computationally cheaper, and sometimes they are better suited for online decision-making. Exact analytical algorithms may not be available for practical engineering applications, but effective approximations can be made using first-order reliability methods. This paper describes three first-order reliability-based methods for RUL uncertainty quantification: first-order second moment method (FOSM), the first-order reliability method (FORM), and the inverse first-order reliability method (inverse-FORM). The inverse-FORM methodology is particularly useful in the context of online health monitoring, and this method is illustrated using the power system of an unmanned aerial vehicle, where the goal is to predict the end of discharge of a lithium-ion battery. [ABSTRACT FROM AUTHOR]

In the past decade the humanitarian supply chain (HSC) has attracted the attention of researchers due to the increasing frequency of disasters. The uncertainty in time, location, and severity of disaster during predisaster phase and poor conditions of available infrastructure during postdisaster phase make HSC operations difficult to handle. In order to overcome the difficulties during these phases, we need to assure that HSC operations are designed in an efficient manner to minimize human and economic losses. In the recent times, several mathematical optimization techniques and algorithms have been developed to increase the efficiency of HSC operations. These techniques and algorithms developed for the field of HSC motivate the need of a systematic literature review. Owing to the importance of mathematical modelling techniques, this paper presents the review of the mathematical contributions made in the last decade in the field of HSC. A systematic literature review methodology is used for this paper due to its transparent procedure. There are two objectives of this study: the first one is to conduct an up-to-date survey of mathematical models developed in HSC area and the second one is to highlight the potential research areas which require attention of the researchers. [ABSTRACT FROM AUTHOR]

The Ground-based Radio Navigation System (GRNS) is an alternative/backup navigation system based on time synchronized pseudolites. It has been studied for some years due to the potential vulnerability issue of satellite navigation systems (e.g., GPS or Galileo). In the framework of our study, a periodic pulsed sequence was used instead of the randomized pulse sequence recommended as the RTCM (radio technical commission for maritime services) SC (special committee)-104 pseudolite signal, as a randomized pulse sequence with a long dwell time is not suitable for applications requiring high dynamics. This paper introduces a mathematical model of the post-correlation output in a navigation sensor, showing that the aliasing caused by the additional frequency term of a periodic pulsed signal leads to a false lock (i.e., Doppler frequency bias) during the signal acquisition process or in the carrier tracking loop of the navigation sensor. We suggest algorithms to resolve the frequency false lock issue in this paper, relying on the use of a multi-correlator. A flight test with an unmanned helicopter was conducted to verify the implemented navigation sensor. The results of this analysis show that there were no false locks during the flight test and that outliers stem from bad dilution of precision (DOP) or fluctuations in the received signal quality. [ABSTRACT FROM AUTHOR]

Background: Prognostic studies of time-to-event data, where researchers aim to develop or validate multivariable prognostic models in order to predict survival, are commonly seen in the medical literature; however, most are performed retrospectively and few consider sample size prior to analysis. Events per variable rules are sometimes cited, but these are based on bias and coverage of confidence intervals for model terms, which are not of primary interest when developing a model to predict outcome. In this paper we aim to develop sample size recommendations for multivariable models of time-to-event data, based on their prognostic ability.Methods: We derive formulae for determining the sample size required for multivariable prognostic models in time-to-event data, based on a measure of discrimination, D, developed by Royston and Sauerbrei. These formulae fall into two categories: either based on the significance of the value of D in a new study compared to a previous estimate, or based on the precision of the estimate of D in a new study in terms of confidence interval width. Using simulation we show that they give the desired power and type I error and are not affected by random censoring. Additionally, we conduct a literature review to collate published values of D in different disease areas.Results: We illustrate our methods using parameters from a published prognostic study in liver cancer. The resulting sample sizes can be large, and we suggest controlling study size by expressing the desired accuracy in the new study as a relative value as well as an absolute value. To improve usability we use the values of D obtained from the literature review to develop an equation to approximately convert the commonly reported Harrell's c-index to D. A flow chart is provided to aid decision making when using these methods.Conclusion: We have developed a suite of sample size calculations based on the prognostic ability of a survival model, rather than the magnitude or significance of model coefficients. We have taken care to develop the practical utility of the calculations and give recommendations for their use in contemporary clinical research. [ABSTRACT FROM AUTHOR]

Slicing is an important step for all layer-based additive manufacturing (AM) processes. This paper proposes an improved and robust slicing algorithm with efficient contour construction to reduce the slicing time and be able to slice a complex STereoLithography (STL) model with millions of triangles (resulting from high-accuracy STL files). Also, another important feature of the proposed method is it can identify outer and inner contours automatically. Test results to demonstrate the improvements in execution time and comparisons with results from published papers have been given to illustrate the algorithm efficiency. The robustness of this slicing algorithm is demonstrated by several complex models with large numbers of nested contours on each slice. [ABSTRACT FROM AUTHOR]

Background: Sepsis is a highly heterogeneous syndrome with stratified severity levels and immune states. Even in patients with similar clinical appearances, the underlying signal transduction pathways are significantly different. To identify the heterogeneities of sepsis from multiple angles, we aimed to establish a combined risk model including the molecular risk score for rapid mortality prediction, pathway risk score for the identification of biological pathway variations, and immunity risk score for guidance with immune-modulation therapy. Methods: We systematically searched and screened the mRNA expression profiles of patients with sepsis in the Gene Expression Omnibus public database. The screened datasets were divided into a training cohort and a validation cohort. In the training cohort, authentic prognostic predictor characteristics (differentially expressed mRNAs, pathway activity variations and immune cells) were screened for model construction through bioinformatics analysis and univariate Cox regression, and a P value less than 0.05 of univariate Cox regression on 28-day mortality was set as the cut-off value. The combined risk model was finally established by the decision tree algorithm. In the validation cohort, the model performance was assessed and validated by C statistics and the area under the receiver operating characteristic curve (AUC). Additionally, the current models were further compared in clinical value with traditional indicators, including procalcitonin (PCT) and interleukin-8 (IL-8). Results: Datasets from two sepsis cohort studies with a total of 585 consecutive sepsis patients admitted to two intensive care units were downloaded as the training cohort (n = 479) and external validation cohort (n = 106). In the training cohort, 15 molecules, 20 pathways and 4 immune cells were eventually enrolled in model construction. These prognostic factors mainly reflected hypoxia, cellular injury, metabolic disorders and immune dysregulation in sepsis patients. In the validation cohort, the AUCs of the molecular model, pathway model, immune model, and combined model were 0.81, 0.82, 0.62 and 0.873, respectively. The AUCs of the traditional biomarkers (PCT and IL-8) were 0.565 and 0.585, respectively. The survival analysis indicated that patients in the high-risk group identified by models in the current study had a poor prognosis (P < 0.05). The above results indicated that the models in this study are all superior to the traditional biomarkers for the predicting the prognosis of sepsis patients. Furthermore, the current study provides some therapeutic recommendations for patients with high risk scores identified by the three submodels. Conclusions: In summary, the present study provides opportunities for bedside tests that could quantitatively and rapidly measure heterogeneous prognosis, underlying biological pathway variations and immune dysfunction in sepsis patients. Further therapeutic recommendations for patients with high risk scores could improve the therapeutic system for sepsis. [ABSTRACT FROM AUTHOR]

We introduce a novel edge tracing algorithm using Gaussian process regression. Our edge-based segmentation algorithm models an edge of interest using Gaussian process regression and iteratively searches the image for edge pixels in a recursive Bayesian scheme. This procedure combines local edge information from the image gradient and global structural information from posterior curves, sampled from the model’s posterior predictive distribution, to sequentially build and refine an observation set of edge pixels. This accumulation of pixels converges the distribution to the edge of interest. Hyperparameters can be tuned by the user at initialisation and optimised given the refined observation set. This tunable approach does not require any prior training and is not restricted to any particular type of imaging domain. Due to the model’s uncertainty quantification, the algorithm is robust to artefacts and occlusions which degrade the quality and continuity of edges in images. Our approach also has the ability to efficiently trace edges in image sequences by using previous-image edge traces as a priori information for consecutive images. Various applications to medical imaging and satellite imaging are used to validate the technique and comparisons are made with two commonly used edge tracing algorithms. [ABSTRACT FROM AUTHOR]

A hybrid ac/dc microgrid (MG) has the advantages of both ac and dc subgrids, and the operator should perform an accurate power flow analysis to ensure the MG's operational economy and reliability. This article proposes a Newton—Raphson (NR)-based sequential power flow algorithm for the hybrid ac/dc MG. First, the MG's islanded operation mode and the three-phase unbalance feature of ac subgrids are considered, and the droop control for distributed generations participating in the voltage and frequency regulation is modeled. Then, a sequential algorithmic framework is proposed to handle the coupling between ac and dc subgrids. Within this framework, the power flow of ac and dc subgrids is solved separately and iteratively with modified NR subalgorithms. The accuracy of the proposed sequential algorithm is validated in comparison with the results from MATLAB/Simulink, and the advantage of employing this algorithm is confirmed compared with an equivalence approach. The case studies demonstrated that the proposed algorithm can significantly improve the result accuracy with acceptable computational time. Finally, the convergence performance of the proposed algorithm is verified in the cases of varying ac and dc subgrid loading. [ABSTRACT FROM AUTHOR]

This paper introduces a neurodynamics optimization model to compute the solution of mathematical programming with equilibrium constraints (MPEC). A smoothing method based on NPC-function is used to obtain a relaxed optimization problem. The optimal solution of the global optimization problem is estimated using a new neurodynamic system, which, infinite time, is convergent with its equilibrium point. Compared to existing models, the proposed model has a simple structure, with low complexity. The new dynamical system is investigated theoretically, and it is proved that the steady state of the proposed neural network is asymptotic stable and global convergence to the optimal solution of MPEC. Numerical simulations of several examples of MPEC are presented, all of which confirm the agreement between the theoretical and numerical aspects of the problem and show the effectiveness of the proposed model. Moreover, an application to resource allocation problem shows that the new method is a simple, but efficient, and practical algorithm for the solution of real-world MPEC problems. [ABSTRACT FROM AUTHOR]

In this paper, a new optimal method for modelling of a 3PRS robot is proposed according to NOC algorithm. An optimal method of selecting the generalized coordinate is presented and a new algorithm of extracting the null space of over and under constrained robots is proposed through which a lower amount of mathematical calculations is required. In this method, using the principal of derivatives of implicit functions, the null space of constraint matrix will be extracted. Afterwards the null space matrix is calculated with orthogonal columns. The proposed method is implemented on a 3PRS robot which is an under constrained robot. This robot is a kind of parallel spatial robot with 6 DOFs which can be controlled using 3 active prismatic joints and 3 passive rotary ones. This robot similar to other parallel robots has heavy, complicated and nonlinear model which needs heavy and time consuming mathematical calculations. The proposed strategy of extracting the null space of the robot, extremely and heavily decreases the volume of required mathematical calculations for modelling the robot and consequently decreases the inevitable consumed time of processing and numerical errors and increases the accuracy of simulations. [ABSTRACT FROM AUTHOR]

Historical aerial imagery plays an important role in providing unique information about evolution of our landscapes. It possesses many positive qualities such as high spatial resolution, stereoscopic configuration and short time interval. Self-calibration reamains a main bottleneck for achieving the intrinsic value of historical imagery, as it involves certain underdeveloped research points such as detecting inter-epoch tie-points. In this research, we present a novel algorithm to detecting inter-epoch tie-points in historical images which do not rely on any auxiliary data. Using SIFT-detected keypoints we perform matching across epochs by interchangeably estimating and imposing that points follow two mathematical models: at first a 2D spatial similarity, then a 3D spatial similarity. We import GCPs to quantitatively evaluate our results with Digital Elevation Models (DEM) of differences (abbreviated as DoD) in absolute reference frame, and compare the results of our method with other 2 methods that use either the traditional SIFT or few virtual GCPs. The experiments show that far more correct inter-epoch tie-points can be extracted with our guided technique. Qualitative and quantitative results are reported. [ABSTRACT FROM AUTHOR]

Driving a vehicle with a passive trailer has been the subject of numerous studies. Current control strategies are mostly used by differential geometry, linear algebra, fuzzy regulators, and artificial neural networks. The objective of this study is to design an algorithm for autonomous control of the tractor-trailer system reversing based on an algorithm using a PSD controller and to verify it on a simulated mathematical model. All parameters listed in the models and experiments are performed based on the existing tractor-trailer system. Dynamic models of steering and velocity control were identified and incorporated into the simulation. Result includes a stable operation of the steering without oscillating. The proposed algorithm can be implemented in microcontrollers without the need for high computing power. [ABSTRACT FROM AUTHOR]

The problem of state estimation for unobservable distribution systems is considered. A deep learning approach to Bayesian state estimation is proposed for real-time applications. The proposed technique consists of distribution learning of stochastic power injection, a Monte Carlo technique for the training of a deep neural network for state estimation, and a Bayesian bad-data detection and filtering algorithm. Structural characteristics of the deep neural networks are investigated. Simulations illustrate the accuracy of Bayesian state estimation for unobservable systems and demonstrate the benefit of employing a deep neural network. Numerical results show the robustness of Bayesian state estimation against modeling and estimation errors and the presence of bad and missing data. Comparing with pseudo-measurement techniques, direct Bayesian state estimation via deep learning neural network outperforms existing benchmarks. [ABSTRACT FROM AUTHOR]

The paper proposes a constructive method for solving the stationary Kolmogorov-Feller equation with a nonlinear drift coefficient. The corresponding algorithms are constructed and their convergence is justified. The basis of the proposed method is the application of the Fourier transform. [ABSTRACT FROM AUTHOR]

Purpose: Determination of such an interval of workplace environmental physical factors control, which would ensure high monitoring reliability and the minimum data collection and processing duration (or cost). Design/methodology/approach: To achieve the goal were applied: analysis and synthesis of known scientific results on the topic of research, statistical analysis, mathematical modelling. Statistical data for determining the interval of control was recorded at regular intervals. Findings: A methodology has been developed for determining the interval of workplace environmental physical factors values control. It is based on the identification of patterns of change in the physical factors values. The algorithm of workplace environmental physical factors values control is proposed, which helps to identify cases when the actual values of the factors exceed the limit values. The practical application of theoretical propositions showed that the correlation coefficient between the factual sample and the sample formed using the determined control interval is within 0.74...0.88, which satisfies the condition R > 0.5 as intended. Research limitations/implications: The mechanism for workplace environmental physical factors values monitoring was further developed on the basis of forecasting changes in the physical factors values and determining the duration of the excess of the factors values over the limit. In this study on stationary and conditional stationary processes was the focus. Practical implications: The use of the algorithm that is based on the methodology for determining the interval of workplace environmental physical factors values control contributes to more effective monitoring of working safety. Originality/value: For the first time justified by the choice of the control interval of workplace environmental physical factors values with acceptable accuracy of the forecast that allow to quickly establish working conditions hazard class. [ABSTRACT FROM AUTHOR]

Copyright of Revista Politécnica is the property of Politechnico Colombian Jaime Isaza Cadavid and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Background: Over the past few decades, numerous forecasting methods have been proposed in the field of epidemic forecasting. Such methods can be classified into different categories such as deterministic vs. probabilistic, comparative methods vs. generative methods, and so on. In some of the more popular comparative methods, researchers compare observed epidemiological data from the early stages of an outbreak with the output of proposed models to forecast the future trend and prevalence of the pandemic. A significant problem in this area is the lack of standard well-defined evaluation measures to select the best algorithm among different ones, as well as for selecting the best possible configuration for a particular algorithm.Results: In this paper we present an evaluation framework which allows for combining different features, error measures, and ranking schema to evaluate forecasts. We describe the various epidemic features (Epi-features) included to characterize the output of forecasting methods and provide suitable error measures that could be used to evaluate the accuracy of the methods with respect to these Epi-features. We focus on long-term predictions rather than short-term forecasting and demonstrate the utility of the framework by evaluating six forecasting methods for predicting influenza in the United States. Our results demonstrate that different error measures lead to different rankings even for a single Epi-feature. Further, our experimental analyses show that no single method dominates the rest in predicting all Epi-features when evaluated across error measures. As an alternative, we provide various Consensus Ranking schema that summarize individual rankings, thus accounting for different error measures. Since each Epi-feature presents a different aspect of the epidemic, multiple methods need to be combined to provide a comprehensive forecast. Thus we call for a more nuanced approach while evaluating epidemic forecasts and we believe that a comprehensive evaluation framework, as presented in this paper, will add value to the computational epidemiology community. [ABSTRACT FROM AUTHOR]

This paper investigates the use of a model-predictive control strategy to control a direct matrix converter. The proposed control method combines the features of the classical model-predictive control and the space vector modulation technique into a modulated model-predictive control. This new solution maintains all the characteristics of model-predictive control (such as fast transient response, multiobjective control using only one feedback loop, easy inclusion of nonlinearities and constraints of the system, and the flexibility to include other system requirements in the controller), adding the advantages of working at fixed switching frequency and improving the quality of the controlled waveforms. Simulation and experimental results employing the control method to a direct matrix converter are presented. [ABSTRACT FROM PUBLISHER]

This paper investigates the data-based optimal control for a class of networked industrial processes with a double-layer architecture. Without knowing the dynamics of subsystems at the device layer, the index prediction function is constructed via the input/output signals, and radial basis function neural networks. The tuning laws for the index prediction function are obtained through the optimal control strategy. Then, by treating the network-induced phenomenon as random round-trip time delay and introducing the predictive algorithm, the compensation scheme is designed at the operation layer to dynamically decompose the setpoints. Finally, two simulation examples are given to further illustrate the effectiveness of the proposed compensation strategy. [ABSTRACT FROM AUTHOR]

This paper proposes an effective multiobjective estimation of distribution algorithm (MoEDA) which solves the bi-criteria stochastic job-shop scheduling problem with the uncertainty of processing time. The MoEDA proposal minimizes the expected average makespan and the expected total tardiness within a reasonable amount of computational time. With the framework of proposed MoEDA, the probability model of the operation sequence is estimated firstly. For sampling the processing time of each operation with the Monte Carlo methods, allocation method is used to decide the operation sequence, and then the expected makespan and total tardiness of each sampling are evaluated. Subsequently, updating mechanism of the probability models is proposed according to the best solutions to obtain. Finally, for comparing with some existing algorithms by numerical experiments on the benchmark problems, we demonstrate the proposed effective estimation of distribution algorithm can obtain an acceptable solution in the aspects of schedule quality and computational efficiency. [ABSTRACT FROM AUTHOR]

Background: Systems Biology continues to produce increasingly large models of complex biochemical reaction networks. In applications requiring, for example, parameter estimation, the use of agent-based modelling approaches, or real-time simulation, this growing model complexity can present a significant hurdle. Often, however, not all portions of a model are of equal interest in a given setting. In such situations methods of model reduction offer one possible approach for addressing the issue of complexity by seeking to eliminate those portions of a pathway that can be shown to have the least effect upon the properties of interest. Methods: In this paper a model reduction algorithm bringing together the complementary aspects of proper lumping and empirical balanced truncation is presented. Additional contributions include the development of a criterion for the selection of state-variable elimination via conservation analysis and use of an 'averaged' lumping inverse. This combined algorithm is highly automatable and of particular applicability in the context of 'controlled' biochemical networks. Results: The algorithm is demonstrated here via application to two examples; an 11 dimensional model of bacterial chemotaxis in Escherichia coli and a 99 dimensional model of extracellular regulatory kinase activation (ERK) mediated via the epidermal growth factor (EGF) and nerve growth factor (NGF) receptor pathways. In the case of the chemotaxis model the algorithm was able to reduce the model to 2 state-variables producing a maximal relative error between the dynamics of the original and reduced models of only 2.8% whilst yielding a 26 fold speed up in simulation time. For the ERK activation model the algorithm was able to reduce the system to 7 state-variables, incurring a maximal relative error of 4.8%, and producing an approximately 10 fold speed up in the rate of simulation. Indices of controllability and observability are additionally developed and demonstrated throughout the paper. These provide insight into the relative importance of individual reactants in mediating a biochemical system's input-output response even for highly complex networks. Conclusions: Through application, this paper demonstrates that combined model reduction methods can produce a significant simplification of complex Systems Biology models whilst retaining a high degree of predictive accuracy. In particular, it is shown that by combining the methods of proper lumping and empirical balanced truncation it is often possible to produce more accurate reductions than can be obtained by the use of either method in isolation [ABSTRACT FROM AUTHOR]

In this paper; we introduce an enhanced electromyography (EMG) pattern recognition algorithm based on a split-and-merge deep belief network (SM-DBN). Generally, it is difficult to classify the EMG features because the EMG signal has nonlinear and time-varying characteristics. Therefore, various machine-learning methods have been applied in several previously published studies. A DBN is a fast greedy learning algorithm that can identify a fairly good set of weights rapidly--even in deep networks with a large number of parameters and many hidden layers. To reduce overfitting and to enhance performance, the adopted optimization method was based on genetic algorithms (GA). As a result, the performance of the SM-DBN was 12.06% higher than conventional DBN. Additionally, SM-DBN results in a short convergence time, thereby reducing the training epoch. It is thus efficient in reducing the risk of overfitting. It is verified that the optimization was improved using GA. [ABSTRACT FROM AUTHOR]

An energy storage system (ESS) in a power system facilitates tasks such as renewable integration, peak shaving, and the use of ancillary services. Among the various functions of an ESS, this study focused on frequency regulation (or secondary reserve). This paper presents an optimal scheduling algorithm for frequency regulation by an ESS. This algorithm determines the bidding capacity and base point of an ESS in each operational period to achieve the maximum profit within a stable state-of-charge (SOC) range. However, the charging/discharging efficiency of an ESS causes SOC errors whenever the ESS performs frequency regulation. With an increase in SOC errors, the ESS cannot respond to an automatic generation control (AGC) signal. This situation results in low ESS performance scores, and finally, the ESS is disqualified from performing frequency regulation. This paper also presents a real-time SOC management algorithm aimed at solving the SOC error problem in real-time operations. This algorithm compensates for SOC errors by changing the base point of the ESS. The optimal scheduling algorithm is implemented in MATLAB by using the particle swarm optimization (PSO) method. In addition, changes in the SOC when the ESS performs frequency regulation in a real-time operation are confirmed using the PSCAD/EMTDC tool. The simulation results show that the optimal scheduling algorithm manages the SOC more efficiently than a commonly employed planning method. In addition, the proposed real-time SOC management algorithm is confirmed to be capable of performing SOC recovery. [ABSTRACT FROM AUTHOR]

In this paper, we study the problem of mining frequent sequences under the rigorous differential privacy model. We explore the possibility of designing a differentially private frequent sequence mining (FSM) algorithm which can achieve both high data utility and a high degree of privacy. We found, in differentially private FSM, the amount of required noise is proportionate to the number of candidate sequences. If we could effectively prune those unpromising candidate sequences, the utility and privacy tradeoff can be significantly improved. To this end, by leveraging a sampling-based candidate pruning technique, we propose PFS $^2$, a novel differentially private FSM algorithm. It is the first algorithm that supports the general gap-constrained FSM in the context of differential privacy. The gap constraints in FSM can be used to limit the mining results to a controlled set of frequent sequences. In our PFS$^2$ algorithm, the core is to utilize sample databases to prune the candidate sequences generated based on the downward closure property. In particular, we use the noisy local support of candidate sequences in the sample databases to estimate which candidate sequences are potentially frequent. To improve the accuracy of such private estimations, a gap-aware sequence shrinking method is proposed to enforce the length constraint on the sample databases. Moreover, to calibrate the amount of noise required by differential privacy, a gap-aware sensitivity computation method is proposed to obtain the sensitivity of the local support computations with different gap constraints. Furthermore, to decrease the probability of misestimating frequent sequences as infrequent, a threshold relaxation method is proposed to relax the user-specified threshold for the sample databases. Through formal privacy analysis, we show that our PFS $^2$ algorithm is $\epsilon$ -differentially private. Extensive experiments on real datasets illustrate that our PFS$^2$ algorithm can privately find frequent sequences with high accuracy. [ABSTRACT FROM PUBLISHER]

This paper presents a review of the most relevant current techniques that deal with hole-filling in 3D models. Contrary to earlier reports, which approach mesh repairing in a sparse and global manner, the objective of this review is twofold. First, a specific and comprehensive review of hole-filling techniques (as a relevant part in the field of mesh repairing) is carried out. We present a brief summary of each technique with attention paid to its algorithmic essence, main contributions and limitations. Second, a solid comparison between 34 methods is established. To do this, we define 19 possible meaningful features and properties that can be found in a generic hole-filling process. Then, we use these features to assess the virtues and deficiencies of the method and to build comparative tables. The purpose of this review is to make a comparative hole-filling state-of-the-art available to researchers, showing pros and cons in a common framework. [ABSTRACT FROM AUTHOR]

The procedure of Linear Incremental Model (LIM) identification requires input and output signal deviations as opposed to their actual values. When considering a vessel as a plant, the sequence of input signals determines the traceability of the estimated LIM. The manual input signals selection procedure is a demanding and time consuming empirical procedure. In order to increase the speed of object identification and to eliminate input-output signal sequences which give unreliable data, an incremental linear model identification algorithm was developed and is presented. Moreover, the method of parameter selection for input signal pseudo-random sequences is described in this paper. Emphasis is placed on the practical aspect of astatic objects - ship's LIM creation and input-output signal deviations selection method. [ABSTRACT FROM AUTHOR]

In this paper we propose a modified Elliptic Net algorithm to compute pairings. By reducing the number of the intermediate variables which should be updated in the iteration loop of the Elliptic Net algorithm, we speed up the computation of pairings. Experimental results show that the proposed method is more efficient than the original Elliptic Net algorithm on Barreto-Naehrig (BN) curves which are the best choice for implementing pairings at 128-bit security level. [ABSTRACT FROM PUBLISHER]

Based on the backstepping method, this paper proposes a robust control algorithm for nonlinear plants under parametric uncertainty and external bounded disturbances. The algorithm ensures tracking of the plant output to a smooth reference signal with a required accuracy in the steady-state mode. In comparison with the existing analogs, control system implementation requires only one filter of dimension coinciding with the plant relative degree and observers used for calculation of the stabilizing and basic control laws. This feature considerably simplifies the control scheme and calculation of its parameters. And finally, simulation results illustrating the performance of this scheme are given. [ABSTRACT FROM AUTHOR]

In this paper, an improved algorithm of wavelet packet-chaos model for life prediction of space relays based on volterra series is proposed. In the proposed method, the high and low frequency time sequence components of performance parameters are obtained by employing the improved wavelet packet transform to decompose the performance parameters of the relay into multiple scales. Then the optimization algorithm of parameters in volterra series is improved, and is used to construct a chaotic forecasting model for the high and low frequency time sequence components gained by the wavelet packet transform. At last, the chaotic forecasting results of the high and low frequency components are combined by taking the wavelet packet reconstruction approach, so as to predict the lifetime of the studied space relay. The algorithm can predict the life curve of the relay accurately and reflect the characteristics of the relay performance with sufficient accuracy. The proposed method is validated via a case study of a space relay. [ABSTRACT FROM AUTHOR]

In this paper, we establish an iterative algorithm and estimation of solutions for a fractional turbulent flow model in a porous medium under a suitable growth condition. Our main tool is the monotone iterative technique. [ABSTRACT FROM AUTHOR]

In this paper, we propose a procedure for detecting multiple change-points in a mean-shift model, where the number of change-points is allowed to increase with the sample size. A theoretic justification for our new method is also given. We first convert the change-point problem into a variable selection problem by partitioning the data sequence into several segments. Then, we apply a modified variance inflation factor regression algorithm to each segment in sequential order. When a segment that is suspected of containing a change-point is found, we use a weighted cumulative sum to test if there is indeed a change-point in this segment. The proposed procedure is implemented in an algorithm which, compared to two popular methods via simulation studies, demonstrates satisfactory performance in terms of accuracy, stability and computation time. Finally, we apply our new algorithm to analyze two real data examples. [ABSTRACT FROM AUTHOR]

IC3 is one of the most successful algorithms for hardware model checking. Since its invention in 2010, several variants of the original algorithm have been published, proposing optimizations and/or alternative procedures for many different steps of the algorithm. In this paper, we present a thorough empirical comparison of a large set of optimizations and procedures for the steps of IC3, considering “high-level” variants/extensions to the basic algorithm, as well as “low-level” optimizations/configuration settings. We implemented each of them in the same tool, optimizing the implementations to the best of our knowledge. This enabled for a flexible experimentation in a controlled environment, and to gain new insights about their most important differences and commonalities, as well as about their performance characteristics. We conducted the experiments using as benchmarks the problems used in the last four editions of the hardware model checking competition. The analysis helped us to identify several settings leading to significant improvements with respect to a basic implementation of IC3. [ABSTRACT FROM AUTHOR]

This paper presents a closed-form noniterative transformation of the Maxwell-Garnett mixing rule for biphased mixtures to the triple-pole Debye relaxation formula. For the first time, it is formally proven that such a transformation is complete for conductive constituent materials. In other words, the Maxwell-Garnett representation of any biphased mixture of any conductive materials always has its formal equivalent in the Debye form with three poles at most. For specific aspect ratios of ellipsoidal inclusions, the number of poles reduces to one or two, which is formally proven herein, while in previous studies, a single-pole Debye model was arbitrarily assumed. The proposed transformation provides Debye parameters as an explicit function of a mixture composition, which is competitive to alternative techniques based on laborious curve-fitting algorithms. The newly proposed approach is of particular importance to time-domain modeling of dilute mixtures, where the Maxwell-Garnett mixing rule is usually approximated with available dispersive models. Computational examples given in this paper show advantages of the presented method over previous Maxwell-Garnett to Debye conversion algorithms, in terms of accuracy, robustness, and computational cost. [ABSTRACT FROM AUTHOR]

The Moran process, as studied by Lieberman, Hauert, and Nowak, is a randomised algorithm modelling the spread of genetic mutations in populations. The algorithm runs on an underlying graph where individuals correspond to vertices. Initially, one vertex (chosen uniformly at random) possesses a mutation, with fitness r > 1. All other individuals have fitness 1. During each step of the algorithm, an individual is chosen with probability proportional to its fitness, and its state (mutant or nonmutant) is passed on to an out-neighbour which is chosen uniformly at random. If the underlying graph is strongly connected, then the algorithm will eventually reach fixation, in which all individuals are mutants, or extinction, in which no individuals are mutants. An infinite family of directed graphs is said to be strongly amplifying if, for every r > 1, the extinction probability tends to 0 as the number of vertices increases. A formal definition is provided in the article. Strong amplification is a rather surprising property--it means that in such graphs, the fixation probability of a uniformly placed initial mutant tends to 1 even though the initial mutant only has a fixed selective advantage of r > 1 (independently of n). The name "strongly amplifying" comes from the fact that this selective advantage is "amplified." Strong amplifiers have received quite a bit of attention, and Lieberman et al. proposed two potentially strongly amplifying families--superstars and metafunnels. Heuristic arguments have been published, arguing that there are infinite families of superstars that are strongly amplifying. The same has been claimed for metafunnels. In this article, we give the first rigorous proof that there is an infinite family of directed graphs that is strongly amplifying. We call the graphs in the family "megastars." When the algorithm is run on an n-vertex graph in this family, starting with a uniformly chosen mutant, the extinction probability is roughly n-1/2 (up to logarithmic factors). We prove that all infinite families of superstars and metafunnels have larger extinction probabilities (as a function of n). Finally, we prove that our analysis of megastars is fairly tight--there is no infinite family of megastars such that the Moran algorithm gives a smaller extinction probability (up to logarithmic factors). Also, we provide a counterexample which clarifies the literature concerning the isothermal theorem of Lieberman et al. [ABSTRACT FROM AUTHOR]

Considering the influence of the alternating current side resistor, this paper completes the mathematical model for the three-phase four-leg active power filter and deduces the discrete model of the deadbeat control. A novel delay compensation method is proposed to improve the deadbeat control algorithm. Comparing with the algorithm without delay compensation, the proposed algorithm can effectively reduce the delays caused by digital computing and pulse width modulation output. This is achieved by increasing the sampling and processing frequency without estimating the actual values. The predictive algorithms are also analysed in this paper. For the improved algorithm, the simulation and experimental results show that the total harmonic distortion values of three-phase source currents become lower and the neutral current becomes smaller than the algorithm without delay compensation. Therefore the proposed algorithm can solve the harmonic and unbalancing problems effectively. [ABSTRACT FROM AUTHOR]

The Warp code (and its framework of associated tools) was initially developed for particle-in-cell simulations of space-charge-dominated ion beams in accelerators, for heavy-ion-driven inertial fusion energy, and related experiments. It has found a broad range of applications, including nonneutral plasmas in traps, stray electron clouds in accelerators, laser-based acceleration, and the focusing of ion beams produced when short-pulse lasers irradiate foil targets. We summarize novel methods used in Warp, including: time-stepping conducive to diagnosis and particle injection; an interactive Python-Fortran-C structure that enables scripted and interactive user steering of runs; a variety of geometries (3-D $x$ , $y$ , $z$ ; 2-D $r$ , $z$ ; 2-D $x$ , $y$ ); electrostatic and electromagnetic field solvers; a cut-cell representation for internal boundaries; the use of warped coordinates for bent beam lines; adaptive mesh refinement, including a capability for time-dependent space-charge-limited flow from curved surfaces; models for accelerator lattice elements (magnetic or electrostatic quadrupole lenses, accelerating gaps, etc.) at user-selectable levels of detail; models for particle interactions with gas and walls; moment/envelope models that support sophisticated particle loading; a drift-Lorentz mover for rapid tracking through regions of strong and weak magnetic field; a Lorentz-boosted frame formulation with a Lorentz-invariant modification of the Boris mover; an electromagnetic solver with tunable dispersion and stride-based digital filtering; and a pseudospectral electromagnetic solver. Warp has proven useful for a wide range of applications, described very briefly herein. It is available as an open-source code under a BSD license. This paper describes material presented during the Prof. Charles K. (Ned) Birdsall Memorial Session of the 2013 IEEE Pulsed Power and Plasma Science Conference. In addition to our overview of the computational methods used in Warp, we summarize a few aspects of Ned's contributions to plasma simulation and to the careers of those he mentored. [ABSTRACT FROM PUBLISHER]