电阻抗图像重建中Jacobi矩阵的快速算法

Jacobi矩阵是电阻抗图像重建中计算量最大的部份。利用摄动法导出该矩阵的快速算法,可以大幅度地减少计算量。算例表明,这种方法是有效的。     

New general guidance method in constrained optimal control,part 2: Application to space shuttle guidance

The application and the performance of the neighboring optimal feedback scheme presented in Part 1 of this paper is demonstrated for the heating-constrained cross-range maximization problem of a space-shuttle-orbiter-type vehicle. This problem contains five state variables, two control variables, and a state variable inequality constraint of order zero.This research was supported in part by the Deutsche Forschungsgemeinschaft under the Schwerpunktprogramm Anwendungsbezogene Optimierung und Steuerung.The authors wish to express their sincere and grateful appreciation to Professor Roland Bulirsch who encouraged this work.     

平面波超声成像中的波束合成方法研究进展

平面波成像通过单次全孔径发射-接收即可获取整幅图像,将成像帧频显著地提升至1000帧/秒以上.然而,平面波成像过程中发射的非聚焦波束将导致回波信号信噪比降低,进而使图像的分辨率和对比度变差.通过多角度相干复合成像技术可以改善平面波成像的图像质量,但是会以牺牲帧频为代价.因此研究人员们开始将新型波束合成技术引入平面波成像...     

Problems, Models and Complexity. Part II: Application to the DLSP

In Part I of this study, we suggest to identify an operations research (OR) problem with the equivalence class of models describing the problem and enhance the standard computer-science theory of computational complexity to be applicable to this situation of an often model-based OR context. The Discrete Lot-sizing and Scheduling Problem (DLSP) is analysed here in detail to demonstrate the difficulties which can arise if these aspects are neglected and to illustrate the new theoretical concept. In addition, a new minimal model is introduced for the DLSP which makes this problem eventually amenable to a rigorous analysis of its computational complexity.     

Heuristic Methods for Large Centroid Clustering Problems

This article presents new heuristic methods for solving a class of hard centroid clustering problems including the p-median, the sum-of-squares clustering and the multi-source Weber problems. Centroid clustering is to partition a set of entities into a given number of subsets and to find the location of a centre for each subset in such a way that a dissimilarity measure between the entities and the centres is minimized. The first method proposed is a candidate list search that produces good solutions in a short amount of time if the number of centres in the problem is not too large. The second method is a general local optimization approach that finds very good solutions. The third method is designed for problems with a large number of centres; it decomposes the problem into subproblems that are solved independently. Numerical results show that these methods are efficient—dozens of best solutions known to problem instances of the literature have been improved—and fast, handling problem instances with more than 85,000 entities and 15,000 centres—much larger than those solved in the literature. The expected complexity of these new procedures is discussed and shown to be comparable to that of an existing method which is known to be very fast.     

On the polynomial-space completeness of intuitionistic propositional logic

We present an alternative, purely semantical and relatively simple, proof of the Statman's result that both intuitionistic propositional logic and its implicational fragment are PSPACE-complete.This paper was supported by grant 401/01/0218 of the Grant Agency of the Czech Republic. % Mathematics Subject Classification (2000):     

Hypothesis testing for the generalized multivariate modified Bessel model

In this paper, we consider hypothesis testing problems in which the involved samples are drawn from generalized multivariate modified Bessel populations. This is a much more general distribution that includes both the multivariate normal and multivariate-t distributions as special cases. We derive the distribution of the Hotelling's T²-statistic for both the one- and two-sample problems, as well as the distribution of the Scheffe's T²-statistic for the Behrens–Fisher problem. In all cases, the non-null distribution of the corresponding F-statistic follows a new distribution which we introduce as the non-central F-Bessel distribution. Some statistical properties of this distribution are studied. Furthermore, this distribution was utilized to perform some power calculations for tests of means for different models which are special cases of the generalized multivariate modified Bessel distribution, and the results compared with those obtained under the multivariate normal case. Under the null hypothesis, however, the non-central F-Bessel distribution reduces to the central F-distribution obtained under the classical normal model.     

On Solvability of Functional Equations Relating to Dynamical Systems with Two Generators

In this paper, some solvability problems for functional equations of the form

Boltzmann-Poisson方程组初边值问题的整体弱解

§ 1.　Introduction　　LetΩ R3beasmoothboundedopenset,f(t,x ,v)bethedistributionfunctionofcar riersattimet >0 ,positionvectorx∈Ωandvelocityvectorv∈R3.Theforcefieldactingonthecarriersisdenotedbythe3 dimensionalvectorfunctionE(t,x) ,thepotentialcorespondingtoE(t,x)isdenotedbyu(t,x) ,then (f,E)satisfythefollowingBoltzmann Poissonsystem tf +v· xf +E· vf =Q(f) ,　 (t,x ,v)∈R+ ×Ω×R3,(1 .1 )E =- xu ,-Δxu =ρ ,　 (t,x) ∈R+ ×Ω ,(1 .2 )whereρ(t,x) =∫R3 f(t,x ,v)dvisthecarriernum…