The paper presents the derivation of the generalized maximum likelihood estimator (GME), using a very flexible distribution. The GME properties are determined from the basic theory of the M-estimator, and its robust r...
详细信息
The paper presents the derivation of the generalized maximum likelihood estimator (GME), using a very flexible distribution. The GME properties are determined from the basic theory of the M-estimator, and its robust recursive algorithm is developed. Good estimation results were obtained in a simulation study. (AIAA)
This Note develops an approximate analytical solution of the two-body orbital boundary-value problem, known as Lambert's problem, using a time-explicit analytical solution of the relative motion problem. Explicitl...
详细信息
This Note develops an approximate analytical solution of the two-body orbital boundary-value problem, known as Lambert's problem, using a time-explicit analytical solution of the relative motion problem. Explicitly stated, the problem is to determine the initial velocity of a satellite, given two position vectors and a time of flight between them. Although the classical origin of the problem related to the determination of planetary orbits, present-day applications are in the area of intercept and rendezvous guidance, where the initial velocity of a maneuvering spacecraft for which its position will coincide with a target position at a specified time must be determined.
A digital design for piecewise-linear (PWL) approximation to the sigmoid function is presented. Circuit operation is based on a recursive algorithm that uses lattice operators max and min to approximating nonlinear fu...
详细信息
A digital design for piecewise-linear (PWL) approximation to the sigmoid function is presented. Circuit operation is based on a recursive algorithm that uses lattice operators max and min to approximating nonlinear functions. The resulting hardware is programmable, allowing for the control of the delay-time/approximation-accuracy rate.
A new technique for estimation of the instantaneous frequency based on simultaneous sampling of three-phase voltage signals is presented. The structure consists of two decoupled modules: the first is for adaptive filt...
详细信息
A new technique for estimation of the instantaneous frequency based on simultaneous sampling of three-phase voltage signals is presented. The structure consists of two decoupled modules: the first is for adaptive filtering of input signals, and the second is for frequency estimation. A suitable and robust algorithm for frequency estimation is obtained. This technique provides better performance, compared with the technique based on a single-phase signal in relation to waveforms with noise. The technique is particularly important when asymmetric sags generate zero voltage in one of the three phases. In addition, it allows the measurement of the instantaneous frequency value of real signals for single- or three-phase systems. To demonstrate the performance of the developed algorithm, computer-simulated data records and calibrator-generated signals are processed. The proposed algorithm has been put to test with distorted three-phase voltage signals.
The main intent of this paper is to represent a systematic algorithm capable of deriving the equations of motion of N-flexible link manipulators with revolute-prismatic joints. The existence of the prismatic joints to...
详细信息
The main intent of this paper is to represent a systematic algorithm capable of deriving the equations of motion of N-flexible link manipulators with revolute-prismatic joints. The existence of the prismatic joints together with the revolute ones makes the derivation of governing equations difficult. Also, the variations of the flexible parts of the links, with respect to time cause the associated mode shapes of the links to vary instantaneously. So, to derive the kinematic and dynamic equations of motion for such a complex system, the recursive Gibbs-Appell formulation is applied. For a comprehensive and accurate modeling of the system, the coupling effects due to the simultaneous rotating and reciprocating motions of the flexible arms as well as the dynamic interactions between large movements and small deflections are also included. In this study, the links are modeled based on the Euler-Bernoulli beam theory and the assumed mode method. Also, the effects of gravity as well as the longitudinal, transversal and torsional vibrations have been considered in the formulations. Moreover, a recursive algorithm based on 3 x 3 rotational matrices has been applied in order to derive the system's dynamic equations of motion, symbolically and systematically. Finally, a numerical simulation has been performed by means of a developed computer program in order to demonstrate the ability of this algorithm in deriving and solving the equations of motion related to such systems.
Reliability analysis of phased-mission systems (PMS) must consider the statistical dependences of element states across different phases as well as changes in system configuration, success criteria, and component beha...
详细信息
Reliability analysis of phased-mission systems (PMS) must consider the statistical dependences of element states across different phases as well as changes in system configuration, success criteria, and component behavior. This paper proposes a recursive method for the exact reliability evaluation of PMS consisting of nonidentical independent nonrepairable multistate elements. The method is based on conditional probabilities and the branch-and-bound principle. It is invariant to changes in system structure, demand, and the elements' state transition rates among phases. The main advantage of this method is that it does not require the composition of decision diagrams and can be fully automated. Both analytical and numerical examples are presented to illustrate the application and advantages of the proposed method. The computational performance of the proposed algorithm is illustrated through comprehensive experimentation on the CPU running time of the algorithm.
For the complete graph K-n, its rupture degree is defined as 1-n;and for a noncomplete connected graph G, its rupture degree is defined by r(G) = max{omega(G-X) - vertical bar X vertical bar - m(G-X) : X subset of V (...
详细信息
For the complete graph K-n, its rupture degree is defined as 1-n;and for a noncomplete connected graph G, its rupture degree is defined by r(G) = max{omega(G-X) - vertical bar X vertical bar - m(G-X) : X subset of V (G), omega(G-X) > 1}, where omega(G-X) is the number of components of G-X and m(G-X) is the order of a largest component of G - X. It is shown that this parameter can be well used to measure the vulnerability of networks. Li and Li proved in 2004 that computing the rupture degree for a general graph is NP-complete. In this paper, we give a recursive algorithm for computing the rupture degree of trees, and determine the maximum and minimum rupture degree of trees with given order and maximum degree.
A general method for reliability evaluation of multistate network is using minimal path vectors. A minimal path (MP) vector to system state d is called a d-MP. Most reported works on generating d-MPs are for a particu...
详细信息
A general method for reliability evaluation of multistate network is using minimal path vectors. A minimal path (MP) vector to system state d is called a d-MP. Most reported works on generating d-MPs are for a particular d value. However, if all d-MPs for all possible integer d values are required, we need to call such methods multiple times with respect to all d values. A more efficient method is desirable to generate all d-MPs. In this paper, we develop a recursive algorithm based on breadth-first search to search for all the d-MPs for all possible d values. The relationships among d-MPs for different d levels are revealed. Each d-MP candidate can be generated by a combination of one (d-1)-MP and the vector form of one binary minimal path. Thus, we can use binary MPs as building blocks to generate 2-MP candidates, and use 2-MPs and binary MPs as building blocks to generate 3-MP candidates ... and so forth. When the d-MPs with respect to the maximum d value have been found, all the d-MPs for all possible d values are obtained. A heuristic for pre-processing the MPs is proposed to improve the efficiency of the algorithm. Through computational experiments, it is found that the proposed algorithm is more efficient than existing algorithms for finding all d-MPs for all possible d values. In addition, we show that the proposed algorithm can also be used to generate a subset of d-MPs for all or some d values given a subset of MPs. The generated subset of d-MPs can be used for lower reliability bound evaluation. (C) 2015 Elsevier Ltd. All rights reserved.
Modified discrete cosine transform (MDCT) is a computationally intensive fundamental processing block for mapping time into frequency in various versions of MPEG audio coding. An efficient algorithm for MDCT computati...
详细信息
Modified discrete cosine transform (MDCT) is a computationally intensive fundamental processing block for mapping time into frequency in various versions of MPEG audio coding. An efficient algorithm for MDCT computation is a basic requirement to realize low-cost audio codec. This paper introduces a new recursive algorithm and architecture for MDCT. The proposed architecture requires minimum hardware and execution time. Folding of the input sequence is performed multiple times in the subsequent groups which results in a significant reduction in real multiplication and real addition operations. Also, fewer number of execution cycles are required to generate the output through this algorithm. The proposed structure is suitable for parallel VLSI implementation as it is simple, regular and modular.
Some factories use the cutting and stamping processes to divide stock plates into circles to make products. A guillotine machine cuts the plate into strips in the cutting process and then a stamping press punches out ...
详细信息
Some factories use the cutting and stamping processes to divide stock plates into circles to make products. A guillotine machine cuts the plate into strips in the cutting process and then a stamping press punches out circles from the strips in the stamping process. The circles in a strip have the same size. The number of rows of circles in each strip is limited. Under these constraints, this paper addresses the following primary objective: to cut a plate by a guillotine method so that the maximal number of circles is obtained. Then the secondary objective should be optimized: the cutting layout should use a minimal number of strips. The problem is formulated as a bi-objective optimization problem and a recursive algorithm is presented for it. The computational results indicate that the algorithm can efficiently simplify the cutting process.
暂无评论