2019年5月Lancet Neurol杂志发表了RESTART研究的亚组分析,题目为"Effects of antiplatelet therapy on stroke risk by brain imaging features of intracerebral haemorrhage and cerebral small vessel diseases:subgroup analy...2019年5月Lancet Neurol杂志发表了RESTART研究的亚组分析,题目为"Effects of antiplatelet therapy on stroke risk by brain imaging features of intracerebral haemorrhage and cerebral small vessel diseases:subgroup analyses of the RESTART randomised,open-label trial"。1研究介绍1.1研究背景既往研究提示具有脑出血和脑小血管病的影像学特征与脑出血复发风险增加有关。目前指南及一些学者等建议根据这些影像学特征可用于指导脑出血后是否重启抗血小板治疗。展开更多
The existing LCC-HVDC transmission project adopts the fixed-time delay restarting method.This method has disadvantages such as non-selectivity,long restart process,and high probability of restart failure.These issues ...The existing LCC-HVDC transmission project adopts the fixed-time delay restarting method.This method has disadvantages such as non-selectivity,long restart process,and high probability of restart failure.These issues cause a secondary impact on equipment and system power fluctuation.To solve this problem,an adaptive restarting method based on the principle of fault location by current injection is proposed.First,an additional control strategy is proposed to inject a current detection signal.Second,the propagation law of the current signal in the line is analyzed based on the distributed parameter model of transmission line.Finally,a method for identifying fault properties based on the principle of fault location is proposed.The method fully considers the influence of the long-distance transmission line with earth capacitance and overcomes the influence of the increasing effect of the opposite terminal.Simulation results show that the proposed method can accurately identify the fault properties under various complex fault conditions and subsequently realize the adaptive restarting process.展开更多
In this paper we present a new type of Restarted Krylov methods for calculating peripheral eigenvalues of symmetric matrices. The new framework avoids the Lanczos tridiagonalization process, and the use of polynomial ...In this paper we present a new type of Restarted Krylov methods for calculating peripheral eigenvalues of symmetric matrices. The new framework avoids the Lanczos tridiagonalization process, and the use of polynomial filtering. This simplifies the restarting mechanism and allows the introduction of several modifications. Convergence is assured by a monotonicity property that pushes the eigenvalues toward their limits. The Krylov matrices that we use lead to fast rate of convergence. Numerical experiments illustrate the usefulness of the proposed approach.展开更多
Industry 4.0 and Cyber Physical Production Systems (CPPS) are often discussed and partially already sold. One important feature of CPPS is fault tolerance and as a consequence self-configuration and restart to increas...Industry 4.0 and Cyber Physical Production Systems (CPPS) are often discussed and partially already sold. One important feature of CPPS is fault tolerance and as a consequence self-configuration and restart to increase Overall Equipment Effectiveness. To understand this challenge at first the state of the art of fault handling in industrial automated production systems (aPS) is discussed as a result of a case study analysis in eight companies developing aPS. In the next step, metrics to evaluate the concept of self-configuration and restart for aPS focusing on real-time capabilities, fault coverage and effort to increase fault coverage are proposed. Finally, two different lab size case studies prove the applicability of the concepts of self-configuration, restart and the proposed metrics.展开更多
The main purpose of this paper is to provide a restarting direction for improving on the standard conjugate gradient method.If a drastic non-quadratic behaviour of the objective function is observed in the neighbour o...The main purpose of this paper is to provide a restarting direction for improving on the standard conjugate gradient method.If a drastic non-quadratic behaviour of the objective function is observed in the neighbour of xk,then a restart should be done.The scaling symmetric rank-one update with Davidon’s optimal criterion is applied to generate the restarting direction.It is proved that the conjugate gradient method with this strategy retains the quadratic termination.Numerical experiments show that it is successful.展开更多
Predicting essential proteins is crucial for discovering the process of cellular organization and viability.We propose biased random walk with restart algorithm for essential proteins prediction,called BRWR.Firstly,th...Predicting essential proteins is crucial for discovering the process of cellular organization and viability.We propose biased random walk with restart algorithm for essential proteins prediction,called BRWR.Firstly,the common process of practice walk often sets the probability of particles transferring to adjacent nodes to be equal,neglecting the influence of the similarity structure on the transition probability.To address this problem,we redefine a novel transition probability matrix by integrating the gene express similarity and subcellular location similarity.The particles can obtain biased transferring probabilities to perform random walk so as to further exploit biological properties embedded in the network structure.Secondly,we use gene ontology(GO)terms score and subcellular score to calculate the initial probability vector of the random walk with restart.Finally,when the biased random walk with restart process reaches steady state,the protein importance score is obtained.In order to demonstrate superiority of BRWR,we conduct experiments on the YHQ,BioGRID,Krogan and Gavin PPI networks.The results show that the method BRWR is superior to other state-of-the-art methods in essential proteins recognition performance.Especially,compared with the contrast methods,the improvements of BRWR in terms of the ACC results range in 1.4%–5.7%,1.3%–11.9%,2.4%–8.8%,and 0.8%–14.2%,respectively.Therefore,BRWR is effective and reasonable.展开更多
In this paper, we used an efficient algorithm to obtain an analytic approximation for Volterra’s model for population growth of a species within a closed system, called the Restarted Adomian decomposition method (RAD...In this paper, we used an efficient algorithm to obtain an analytic approximation for Volterra’s model for population growth of a species within a closed system, called the Restarted Adomian decomposition method (RADM) to solve the model. The numerical results illustrate that RADM has the good accuracy.展开更多
The restarted FOM method presented by Simoncini[7]according to the natural collinearity of all residuals is an efficient method for solving shifted systems,which generates the same Krylov subspace when the shifts are ...The restarted FOM method presented by Simoncini[7]according to the natural collinearity of all residuals is an efficient method for solving shifted systems,which generates the same Krylov subspace when the shifts are handled simultaneously.However,restarting slows down the convergence.We present a practical method for solving the shifted systems by adding some Ritz vectors into the Krylov subspace to form an augmented Krylov subspace. Numerical experiments illustrate that the augmented FOM approach(restarted version)can converge more quickly than the restarted FOM method.展开更多
Conjugate gradient optimization algorithms depend on the search directions.with different choices for the parameters in the search directions.In this note,by combining the nice numerical performance of PR and HS metho...Conjugate gradient optimization algorithms depend on the search directions.with different choices for the parameters in the search directions.In this note,by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991),a class of new restarting conjugate gradient methods is presented.Global convergences of the new method with two kinds of common line searches,are proved .Firstly,it is shown that,using reverse modulus of continuity funciton and forcing function,the new method for solving unconstrained optimization can work for a continously differentiable function with Curry-Altman's step size rule and a bounded level set .Secondly,by using comparing technique,some general convergence propecties of the new method with other kind of step size rule are established,Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.展开更多
In this paper, we develop an implicitly restarted block Arnoldi algorithm in a vector-wise fashion. The vector-wise construction greatly simplifies both the detection of necessary deflation and the actual deflation it...In this paper, we develop an implicitly restarted block Arnoldi algorithm in a vector-wise fashion. The vector-wise construction greatly simplifies both the detection of necessary deflation and the actual deflation itself, so it is preferable to the block-wise construction. The numerical experiment shows that our algorithm is effective.展开更多
Many heuristic search methods exhibit a remarkable variability in the time required to solve some particular problem instances. Their cost distributions are often heavy-tailed. It has been demonstrated that, in most c...Many heuristic search methods exhibit a remarkable variability in the time required to solve some particular problem instances. Their cost distributions are often heavy-tailed. It has been demonstrated that, in most cases, rapid restart (RR) method can prominently suppress the heavy-tailed nature of the instances and improve computation efficiency. However, it is usually time-consuming to check whether an algorithm on a specific instance is heavy-tailed or not. Moreover, if the heavy-tailed distribution is confirmed and the RR method is relevant, an optimal RR threshold should be chosen to facilitate the RR mechanism. In this paper, an approximate approach is proposed to quickly check whether an algorithm on a specific instance is heavy-tailed or not. The method is realized by means of calculating the maximal Lyapunov exponent of its generic running trace. Then a statistical formula to estimate the optimal RR threshold is educed. The method is based on common nonparametric estimation, e.g., Kernel estimation. Two heuristic methods are selected to verify our method. The experimental results are consistent with the theoretical consideration perfectly.展开更多
文摘2019年5月Lancet Neurol杂志发表了RESTART研究的亚组分析,题目为"Effects of antiplatelet therapy on stroke risk by brain imaging features of intracerebral haemorrhage and cerebral small vessel diseases:subgroup analyses of the RESTART randomised,open-label trial"。1研究介绍1.1研究背景既往研究提示具有脑出血和脑小血管病的影像学特征与脑出血复发风险增加有关。目前指南及一些学者等建议根据这些影像学特征可用于指导脑出血后是否重启抗血小板治疗。
基金supported by Science and Technology Project of State Grid Corporation of China(52094020006U)National Natural Science Foundation of China(NSFC)(52061635105)China Postdoctoral Science Foundation(2021M692525).
文摘The existing LCC-HVDC transmission project adopts the fixed-time delay restarting method.This method has disadvantages such as non-selectivity,long restart process,and high probability of restart failure.These issues cause a secondary impact on equipment and system power fluctuation.To solve this problem,an adaptive restarting method based on the principle of fault location by current injection is proposed.First,an additional control strategy is proposed to inject a current detection signal.Second,the propagation law of the current signal in the line is analyzed based on the distributed parameter model of transmission line.Finally,a method for identifying fault properties based on the principle of fault location is proposed.The method fully considers the influence of the long-distance transmission line with earth capacitance and overcomes the influence of the increasing effect of the opposite terminal.Simulation results show that the proposed method can accurately identify the fault properties under various complex fault conditions and subsequently realize the adaptive restarting process.
文摘In this paper we present a new type of Restarted Krylov methods for calculating peripheral eigenvalues of symmetric matrices. The new framework avoids the Lanczos tridiagonalization process, and the use of polynomial filtering. This simplifies the restarting mechanism and allows the introduction of several modifications. Convergence is assured by a monotonicity property that pushes the eigenvalues toward their limits. The Krylov matrices that we use lead to fast rate of convergence. Numerical experiments illustrate the usefulness of the proposed approach.
文摘Industry 4.0 and Cyber Physical Production Systems (CPPS) are often discussed and partially already sold. One important feature of CPPS is fault tolerance and as a consequence self-configuration and restart to increase Overall Equipment Effectiveness. To understand this challenge at first the state of the art of fault handling in industrial automated production systems (aPS) is discussed as a result of a case study analysis in eight companies developing aPS. In the next step, metrics to evaluate the concept of self-configuration and restart for aPS focusing on real-time capabilities, fault coverage and effort to increase fault coverage are proposed. Finally, two different lab size case studies prove the applicability of the concepts of self-configuration, restart and the proposed metrics.
基金The Project Supported by National Natural Foundation of China
文摘The main purpose of this paper is to provide a restarting direction for improving on the standard conjugate gradient method.If a drastic non-quadratic behaviour of the objective function is observed in the neighbour of xk,then a restart should be done.The scaling symmetric rank-one update with Davidon’s optimal criterion is applied to generate the restarting direction.It is proved that the conjugate gradient method with this strategy retains the quadratic termination.Numerical experiments show that it is successful.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11861045 and 62162040)。
文摘Predicting essential proteins is crucial for discovering the process of cellular organization and viability.We propose biased random walk with restart algorithm for essential proteins prediction,called BRWR.Firstly,the common process of practice walk often sets the probability of particles transferring to adjacent nodes to be equal,neglecting the influence of the similarity structure on the transition probability.To address this problem,we redefine a novel transition probability matrix by integrating the gene express similarity and subcellular location similarity.The particles can obtain biased transferring probabilities to perform random walk so as to further exploit biological properties embedded in the network structure.Secondly,we use gene ontology(GO)terms score and subcellular score to calculate the initial probability vector of the random walk with restart.Finally,when the biased random walk with restart process reaches steady state,the protein importance score is obtained.In order to demonstrate superiority of BRWR,we conduct experiments on the YHQ,BioGRID,Krogan and Gavin PPI networks.The results show that the method BRWR is superior to other state-of-the-art methods in essential proteins recognition performance.Especially,compared with the contrast methods,the improvements of BRWR in terms of the ACC results range in 1.4%–5.7%,1.3%–11.9%,2.4%–8.8%,and 0.8%–14.2%,respectively.Therefore,BRWR is effective and reasonable.
文摘In this paper, we used an efficient algorithm to obtain an analytic approximation for Volterra’s model for population growth of a species within a closed system, called the Restarted Adomian decomposition method (RADM) to solve the model. The numerical results illustrate that RADM has the good accuracy.
基金Supported-by the National Natural Science Foundation of China(19971057)the Science and Technology Developing Foundation of University in Shanghai of China(02AK41).
文摘The restarted FOM method presented by Simoncini[7]according to the natural collinearity of all residuals is an efficient method for solving shifted systems,which generates the same Krylov subspace when the shifts are handled simultaneously.However,restarting slows down the convergence.We present a practical method for solving the shifted systems by adding some Ritz vectors into the Krylov subspace to form an augmented Krylov subspace. Numerical experiments illustrate that the augmented FOM approach(restarted version)can converge more quickly than the restarted FOM method.
文摘Conjugate gradient optimization algorithms depend on the search directions.with different choices for the parameters in the search directions.In this note,by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991),a class of new restarting conjugate gradient methods is presented.Global convergences of the new method with two kinds of common line searches,are proved .Firstly,it is shown that,using reverse modulus of continuity funciton and forcing function,the new method for solving unconstrained optimization can work for a continously differentiable function with Curry-Altman's step size rule and a bounded level set .Secondly,by using comparing technique,some general convergence propecties of the new method with other kind of step size rule are established,Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.
基金Supported by the National Natural Science Foundation of China(10571106) Supported by the Fundamental Research Funds for the Central Universities(10CX04044A)
基金This work is supported by National Natural Science Foundation of China No. 10531080.
文摘In this paper, we develop an implicitly restarted block Arnoldi algorithm in a vector-wise fashion. The vector-wise construction greatly simplifies both the detection of necessary deflation and the actual deflation itself, so it is preferable to the block-wise construction. The numerical experiment shows that our algorithm is effective.
文摘Many heuristic search methods exhibit a remarkable variability in the time required to solve some particular problem instances. Their cost distributions are often heavy-tailed. It has been demonstrated that, in most cases, rapid restart (RR) method can prominently suppress the heavy-tailed nature of the instances and improve computation efficiency. However, it is usually time-consuming to check whether an algorithm on a specific instance is heavy-tailed or not. Moreover, if the heavy-tailed distribution is confirmed and the RR method is relevant, an optimal RR threshold should be chosen to facilitate the RR mechanism. In this paper, an approximate approach is proposed to quickly check whether an algorithm on a specific instance is heavy-tailed or not. The method is realized by means of calculating the maximal Lyapunov exponent of its generic running trace. Then a statistical formula to estimate the optimal RR threshold is educed. The method is based on common nonparametric estimation, e.g., Kernel estimation. Two heuristic methods are selected to verify our method. The experimental results are consistent with the theoretical consideration perfectly.