recursive algorithms for the estimation of mixtures of densities have attracted a lot of attention in the last 10 years. Here an algorithm for recursive estimation is studied. It complements existing approaches in the...
详细信息
recursive algorithms for the estimation of mixtures of densities have attracted a lot of attention in the last 10 years. Here an algorithm for recursive estimation is studied. It complements existing approaches in the literature, as it is based on conditions that are usually very weak. For example, the parameter space over which the mixture is taken does not need to be necessarily bounded. The essence of the procedure is to combine density estimation via empirical characteristic function together with an iterative Hilbert space approximation algorithm. The conditions for consistency of the estimator are verified for three important statistical problems. A simulation study is also included.
This article deals with the implementation of the P-Class PMU compliant with IEC/IEEE Standard 60255-118-1:2018 by usage of a multiple-resonator (MR)-based approach for harmonic analysis having been proposed recently....
详细信息
This article deals with the implementation of the P-Class PMU compliant with IEC/IEEE Standard 60255-118-1:2018 by usage of a multiple-resonator (MR)-based approach for harmonic analysis having been proposed recently. In previously published articles, it has been shown that a trade-off between opposite requirements is possible by shifting a measurement time stamp along the filter window. Positioning the time stamp in a proximity of the time window center assures flat-top frequency responses. In this article, through simulation tests carried out under various conditions, it is shown that requirements of the IEC/IEEE Standard 60255-118-1:2018 can be satisfied by the second and third order MR structure for particular conditions of the time stamp location.
In this paper, we propose a recursive and a parallel algorithms, respectively, for constructing independent spanning trees in alternating group networks. The recursive algorithm is BFS-based, while the parallel algori...
详细信息
ISBN:
(纸本)9781728189154
In this paper, we propose a recursive and a parallel algorithms, respectively, for constructing independent spanning trees in alternating group networks. The recursive algorithm is BFS-based, while the parallel algorithm is BFS-based and rule-based. Both algorithms are accurate, and furthermore, the parallel algorithm is more efficient than the recursive one.
In this paper, we propose an optimized GO-FLOW algorithm for time-dependent system reliability analysis. The optimized GO-FLOW algorithm is implemented based on recursive calculation of the complete set of minimum pat...
详细信息
In this paper, we propose an optimized GO-FLOW algorithm for time-dependent system reliability analysis. The optimized GO-FLOW algorithm is implemented based on recursive calculation of the complete set of minimum path sets. The algorithm is augmented with a cut-off criterion for probabilistic models to offer a much more flexible approach to achieve the trade-off between computational complexity and accuracy. The optimization method and algorithm are tested with an example case study of reliability analysis of auxiliary feedwater system in nuclear power plants. The verification results show that the retrofitting GO-FLOW method is capable of efficient processing of the shared signals and providing accuracy solutions at high speed. (C) 2021 Elsevier Ltd. All rights reserved.
This paper considers the parameter identification of bilinear systems with unknown states, which are disturbed by an autoregressive moving average noise. The hierarchial identification principle is employed to derive ...
详细信息
ISBN:
(纸本)9789811504747;9789811504730
This paper considers the parameter identification of bilinear systems with unknown states, which are disturbed by an autoregressive moving average noise. The hierarchial identification principle is employed to derive new algorithms for interactively estimating the states and parameters via a bilinear state observer. However, the general bilinear state-space model involves many parameters, which causes heavy computational burden. Motivated by this fact, we propose a hierarchical generalized extended least squares (HGELS) algorithm by decomposing the original system into a series of subsystems with small dimensions for enhancing computational efficiency. The performance of the proposed algorithms is illustrated through a numerical example.
Based on the image method and addition theorem of spherical vector wave functions, a solution to the multiple scattering by a buried concentric spheres is *** iterative process to obtain the scattered field is discuss...
详细信息
ISBN:
(纸本)9781728181813
Based on the image method and addition theorem of spherical vector wave functions, a solution to the multiple scattering by a buried concentric spheres is *** iterative process to obtain the scattered field is discussed in this paper by using boundary conditions on the boundary between the free space and the buried area, inner and outer spheres of the concentric spheres, respectively.
Water vapor plumes emanating from the geyser vents at Enceladus's south pole area invite the possibility of direct access to the subsurface liquid reservoir to acquire pristine biological material if it exists. An...
详细信息
Water vapor plumes emanating from the geyser vents at Enceladus's south pole area invite the possibility of direct access to the subsurface liquid reservoir to acquire pristine biological material if it exists. Any descending lander adapted for plume localization is required to not only explore the icy plume environment during its descent, but it must also infer the location of the landing target-the plume source-autonomously. Compared with existing scenarios of terrestrial plume source localization methods, the source likelihood map (SLIM) method for an Enceladus mission offers a more extensive search area, a higher maneuver velocity, and a shorter search time. This paper investigates a particle-based odor source localization (pOSL) approach that offers the prospect of targeting one of the plume sources by autonomously measuring the concentration field. Reasons for the negative likelihood and overfitting issues associated with Bayesian SLIM are analyzed to build a novel probabilistic model. By implementing this model, the proposed pOSL algorithm evaluates the observation likelihood via posterior maximization method and estimates the source location via the sequential Monte Carlo method. The pOSL algorithm resolves difficulties associated with other methods while reducing the time complexity from O(N tau) to O(N). The numerical simulations illustrate that the proposed approach is feasible and permits accurate targeting of Enceladus's geyser vents.
Purpose This paper employs new methods to evaluate the availability of multistate series-parallel systems, in which a number of similar components are available in each subsystem. Design/methodology/approach In this p...
详细信息
Purpose This paper employs new methods to evaluate the availability of multistate series-parallel systems, in which a number of similar components are available in each subsystem. Design/methodology/approach In this paper, polynomial distribution function (PDF) is combined with universal generating function (UGF) and recursive algorithm (RA) methods to evaluate the availability of multistate series-parallel systems. To achieve this goal, the PDF is initially used to determine the performance rates and the probabilities corresponding to the performance states of the similar components in a subsystem. The obtained results are used to evaluate the system availability via the UGF and RA methods. Findings It is shown that the combined UGF and PDF (UGF-PDF) and also the combined RA and PDF (RA-PDF) methods require less computational time than did the UGF and RA methods, respectively. Originality/value In the UGF and RA methods, there is no difference in system availability evaluation time when considering similar or different components in each subsystem. But the proposed methods in this article do not have this restrictions;therefore, these methods can be used to evaluate system availability in optimal redundancy allocation problems. As a result, using these methods reduces the optimization time of those problems.
In this paper, we propose a recursive algorithm and a parallel algorithm for constructing independent spanning trees in ANn. The main ideas of the recursive algorithm are to construct large trees from small trees, use...
详细信息
In this paper, we propose a recursive algorithm and a parallel algorithm for constructing independent spanning trees in ANn. The main ideas of the recursive algorithm are to construct large trees from small trees, use triangle breadth-first search (TBFS) to build a frame of an IST, and use breadth-first search (BFS) to link the rest of the nodes. The main ideas of the parallel algorithm are to build frames through TBFS in parallel, and to use the specific rules to link the rest of the nodes in parallel. We prove the correctness of both algorithms for constructing ISTs in AN(n) . Both algorithms are accurate;furthermore, the parallel algorithm is more ecient than the recursive algorithm. (An extended abstract of this paper appeared in: Jie-Fu Huang and Sun-Yuan Hsieh 'Two methods for constructing independent spanning trees in alternating group networks' Proceedings of International Conference on Creative Lifestyle Computing (ICCLC), 2020.)
In this paper, the distributed state estimation problem is studied for a class of state-saturated power systems subject to Denial-of-Service (DoS) attacks. The randomly occurring DoS attacks is modeled by a series of ...
详细信息
ISBN:
(纸本)9781728177090
In this paper, the distributed state estimation problem is studied for a class of state-saturated power systems subject to Denial-of-Service (DoS) attacks. The randomly occurring DoS attacks is modeled by a series of Bernoulli distributed stochastic variables with known probability distributions. The aim of this paper is to design a distributed estimator ensure, in the presence of both cyber-attacks and state saturations, the desired estimation performance is satisfied. By virtue of some typical matrix inequalities, a tight upper bound of estimation error covariance is derived. The estimation parameters are obtained with the help of the solution of a set of Riccatilike difference equations. The developed recursive algorithm is independent of the global information and thus satisfies the requirements of scalability and online application. Finally, a practical example is developed to verify the validity of the designed estimator.
暂无评论