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

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

Positive solutions of singular boundary value problem of negative exponent Emden—Fowler equation

This paper investigates the existence of positive solutions of a singular boundary value problem with negative exponent similar to standard Emden-Fowler equation. A necessary and sufficient condition for the existence of C[0, 1] positive solutions as well as C¹[0, 1] positive solutions is given by means of the method of lower and upper solutions with the Schauder fixed point theorem.     

Near-optimal design of Global Positioning System (GPS) networks using the Tabu Search technique

This paper describes an optimization technique based on an heuristic procedure which is applied to analyse and improve the efficiency of the design of Global Positioning System (GPS) surveying networks. GPS is a valuable survey tool because of its ability to increase the accuracy, speed and flexibility of a survey. A GPS network can be defined as a number of stations, which are co-ordinated by a series of sessions, formed by placing receivers on stations. The goal is to select the best order in which these sessions can be organised to give the best possible schedule. Generally, solving large networks to optimality requires impractical computational time. This paper proposes a Tabu Search technique which provides optimal or near-optimal solutions for large networks with an acceptable amount of computational effort. Computational results for several case studies with known and unknown optimal schedules have been presented to assess the performance of the proposed technique.     

Detecting Incompressibility of Boundary in 3-Manifolds

A construction is presented which can be utilized to prove incompressibility of boundary in a 3-manifold W. One constructs a new 3-manifold DW by doubling W along a subsurface in its boundary. If DW is hyperbolic, and if W has compressible boundary, then DW must have a longitude of 'length' less than 4. This can be applied to show that an arc that is a candidate for an unknotting tunnel in a 3-manifold cannot be an unknotting tunnel. It can also be used to show that a 'tubed surface' is incompressible. For knot and link complements in S ³, and an unknotting tunnel, DW is almost always hyperbolic. Empirically, this construction appears to provide a surprisingly effective procedure for demonstrating that specific arcs are not unknotting tunnels.     

Some Properties for the Euclidean Distance Matrix and Positive Semidefinite Matrix Completion Problems

The Euclidean distance matrix (EDM) completion problem and the positive semidefinite (PSD) matrix completion problem are considered in this paper. Approaches to determine the location of a point in a linear manifold are studied, which are based on a referential coordinate set and a distance vector whose components indicate the distances from the point to other points in the set. For a given referential coordinate set and a corresponding distance vector, sufficient and necessary conditions are presented for the existence of such a point that the distance vector can be realized. The location of the point (if it exists) given by the approaches in a linear manifold is independent of the coordinate system, and is only related to the referential coordinate set and the corresponding distance vector. An interesting phenomenon about the complexity of the EDM completion problem is described. Some properties about the uniqueness and the rigidity of the conformation for solutions to the EDM and PSD completion problems are presented.     

On Fučik Spectra and Periodic Solutions

In this paper, we continue extending the theory of boundary-value problems to ordinary differential equations and inclusions with discontinuous right-hand side. To this end, we construct a new version of the method of shifts along trajectories. We compare the results obtained by the new approach and those obtained by the method of Fuik spectra.     

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.     

Constructing Solutions of an Ill-Posed Nonlinear Singularly Perturbed Problem for an Equation of Elliptic Type

Mathematical Notes -     

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.