A fuel-minimization and near-miss avoidance control are developed for clustered satellites. A penalty function of class C2 with respect to the distances between satellites is imposed on the fuel-consumption index. It ...
详细信息
A fuel-minimization and near-miss avoidance control are developed for clustered satellites. A penalty function of class C2 with respect to the distances between satellites is imposed on the fuel-consumption index. It is found enough to solve just the two-point boundary-value problem even if unspecified multiple near misses occur between satellites. The proposed simulation procedure is to repeat shooting searches and to increase the height of the penalty function.
Quantum information bottleneck was proposed by Grimsmo and Still (2016 Phys. Rev. A 94 012338) as a promising method for quantum supervised machine learning. To study this method, we generalize the quantum Arimoto-Bla...
详细信息
Quantum information bottleneck was proposed by Grimsmo and Still (2016 Phys. Rev. A 94 012338) as a promising method for quantum supervised machine learning. To study this method, we generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al (2021 IEEE Trans. Inf. Theory 67 946) to a function defined over a set of density matrices with linear constraints so that our algorithm can be applied to optimizations of quantum operations. This algorithm has wider applicability, and we apply our algorithm to the quantum information bottleneck with three quantum systems. We numerically compare our obtained algorithm with the existing algorithm by Grimsmo and Still. Our numerical analysis shows that our algorithm is better than their algorithm.
The error-in-variable (EIV) model takes the error of all variables into account and has been widely applied to many practical problems arising in environmental study, geology, geographic information science (GIS), and...
详细信息
The error-in-variable (EIV) model takes the error of all variables into account and has been widely applied to many practical problems arising in environmental study, geology, geographic information science (GIS), and geodesy. Coordinate transformations are among the most frequently encountered problems in spatial data processing, and the EIV model can be built based on two sets of coordinates. In some applications, physical parameterssuch as the shift, rotation angle, and scale factorhave constraints. Current implementations of the constrained EIV (CEIV) model do not consider physical constraints explicitly. The purpose of this paper is to convert physical constraints into mathematical forms and to use constrained total least squares (CTLS) to solve the CEIV problem of two-dimensional (2D) affine transformation. The effectiveness of this method is illustrated through a numerical example.
A nondestructive iterative method for uranium-bearing material characterization with HRGS developed earlier in Burdeinyi et al. (2020) is applied to determine matrix densities, uranium mass fraction and uranium isotop...
详细信息
A nondestructive iterative method for uranium-bearing material characterization with HRGS developed earlier in Burdeinyi et al. (2020) is applied to determine matrix densities, uranium mass fraction and uranium isotope masses of uranium ore, UO2 and U3O8 powders, fuel elements in the form of UO2 microspheres, uranium metal and uranium alloys. It is shown that U3O8 powders with uranium mass fraction of about 84% can be distinguished from the powders of UO2 with uranium mass fraction of about 87%;uranium products in the form of liquid or loose powder with matrix density of 0.5-2.0 g/cm(3) can be distinguished from uranium products in the form of compacted fuel elements with matrix density of 6.0-10.0 g/cm(3) and from pure metal uranium and uranium alloys with matrix density of 14.0-19.0 g/cm(3). In fuel microspheres based on UO2 the uranium mass fraction 88.02% measured by HRGS is consistent, within the measurement uncertainties, with the results of isotope dilution mass spectrometry 87.76 +/- 0.64% and also is confirmed by X-ray diffraction technique. The uranium mass fraction of the uranium ore estimated as 0.08% by HRGS is consistent, within the measurement uncertainties, with the value 0.09 +/- 0.01% determined with WDXRF. Densities of two different uranium metal samples, estimated as 18.42 g/cm(3) and 19.33 g/cm(3) by HRGS are consistent with values 18.24 +/- 0.55 g/cm(3) and 18.86 +/- 0.59 g/cm(3), respectively, obtained by the gas pycnometry technique.
The purpose of this paper is to introduce two new algorithms which are based on Mann type steepest-descent methods for solving variational inequality problems over the set of common zeros of a finite family of m-accre...
详细信息
The purpose of this paper is to introduce two new algorithms which are based on Mann type steepest-descent methods for solving variational inequality problems over the set of common zeros of a finite family of m-accretive operators in Banach spaces.
In reliability analysis, the first-order reliability method (FORM) and various optimization algorithms are widely used to locate the most probable point (MPP) and calculate the reliability index. These algorithms gene...
详细信息
In reliability analysis, the first-order reliability method (FORM) and various optimization algorithms are widely used to locate the most probable point (MPP) and calculate the reliability index. These algorithms generally require first-order response sensitivities or gradients of the limit-state function. However, in engineering, the reliability analysis is often merged with finite-element (FE) analysis or other structural/mechanical analyses, and the limit-state function is implicit. The sensitivity analysis may be computationally intensive or cumbersome, and several techniques were developed to deal with this problem. In the present paper, a general iterative algorithm that does not need gradients is proposed. This algorithm produces n series of sequence points iteratively in the n-dimension standard normal space. It is proven that the n series of points will converge to the same point, which is just the MPP, and its distance to the origin is the reliability index. The proposed algorithm also introduces new step lengths to control the convergence of the sequence. These step lengths are new because they may be constant during the iteration or varied using the interim evaluations of the reliability index, which means a self-adjust process in essence. Eighteen examples are given to verify the effectiveness of the proposed algorithm. It is indicated that the proposed algorithm is effective and robust.
The present paper reviews and extends the work done outside the combustion community on adsorption techniques to three-dimensional nonhomogeneous cases. An algorithm suitable to combustion applications will be tested ...
详细信息
The present paper reviews and extends the work done outside the combustion community on adsorption techniques to three-dimensional nonhomogeneous cases. An algorithm suitable to combustion applications will be tested on simulated concentration profiles. The role of the number of scans in the accuracy of the retrieved profiles will be investigated. Finally, these results will be compared to those obtained ina steady jet mixing experiment.
We address in this paper the problem of multi-objective dynamic output-feedback synthesis for continuous linear time-invariant systems. The design objective can be a mix of H 2 performance, H ∞ performance and closed...
详细信息
We address in this paper the problem of multi-objective dynamic output-feedback synthesis for continuous linear time-invariant systems. The design objective can be a mix of H 2 performance, H ∞ performance and closed-loop pole clustering. A new sufficient condition is proposed. This new condition is based on additional variables which allow the use of different Lyapunov functions for each performance criterion. It is shown that the conservatism of the standard method is perceptibly improved. The efficiency of this approach is then illustrated by some academic examples.
In this paper, we propose a kind of reconstruction method of discrete-time random signal by utilizing fixed-point principle. Our method is founded by first turning the reconstruction question into a matrix equation, t...
详细信息
In this paper, we propose a kind of reconstruction method of discrete-time random signal by utilizing fixed-point principle. Our method is founded by first turning the reconstruction question into a matrix equation, then making use of the relation of circulant matrix and convolution product. We describe the principle of the proposed reconstruction method and its performance.
An iterative adaptive pole placement algorithm is presented. The stability and the convergence of the algorithm are respectively established. Since one-step iterative formulation in computing controller's paramete...
详细信息
An iterative adaptive pole placement algorithm is presented. The stability and the convergence of the algorithm are respectively established. Since one-step iterative formulation in computing controller's parameters is used, the on-line computation cost is greatly reduced with respected to the traditional algorithm. The algorithm with the feed-forward can follow arbitrarily bounded output. The algorithm is also extended to multivariate case. Simulation examples show the efficiency and robustness of the algorithm.
暂无评论