CONVERGENCE OF CASCADE ALGORITHMS AND SMOOTHNESS OF REFINABLE DISTRIBUTIONS

In this paper, the author at first develops a method to study convergence of the cascade algorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), and then applies the previous result on the convergence to characterizing compactly supported refinable distributions in fractional Sobolev spaces and Holder continuous spaces (see Theorems 3.1, 3.3, and 3.4). Finally the author applies the above characterization to choosing appropriate initial to guarantee the convergence of the cascade algorithm (see Theorem 4.2).     

The polarization property and irradiance distribution of incoherent and coherent Gaussian beam combinations

Based on the beam coherence-polarization (BCP) matrix, the polarization property of coherent and incoherent Gaussian beam combinations is studied in detail. The general expressions for the degree of polarization P of the resulting beam in case of incoherent and coherent combinations are derived. It is shown that P is dependent on the incoherent or coherent combination, propagation distance, separation, azimuth of the polarization plane and numbers of beamlets in general. The irradiance distribution of the resulting beam for the coherent cases depends on the azimuth of the polarization plane of beamlets. However, for the incoherent case it does not.     

An Application of Branch and Cut to Open Pit Mine Scheduling

The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed.     

On the orthogonality of natural modes of vibration

The natural modes of a discrete linear system are orthogonal with respect to the mass and stiffness matrices in a generalized sense. However, these modes are usually not orthogonal to each other in the ordinary sense. The purpose of this paper is to document a number of conditions under which the modes are also orthogonal in an ordinary fashion.     

0.8W/80K直线驱动斯特林制冷机的研制

介绍了一种 0 .8W/ 80 K分置式斯特林制冷机。该制冷机采用当前国外先进的直线电机驱动 ,双活塞对称布置结构。该制冷机已通过军品所要求的环境试验 ,输入功率小于 4 0 W(DC)情况下 ,其 +6 0℃高温环境下制冷量≥ 0 .5 W/ 80 K ,带载 0 .5 W工况下 MTTF已突破 2 0 0 0小时。文中主要论述了其工作原理、结构特点、试验情况。     

Equivalence of two linear programming relaxations for broadcast scheduling

A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.     

Robust linear optimization under general norms

We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients.     

The projective method for solving linear matrix inequalities

Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.     

Some Properties of Quasi-keep-range Operators and Their Applications

ＳｏｍｅＰｒｏｐｅｒｔｉｅｓｏｆＱｕａｓｉ┐ｋｅｅｐ┐ｒａｎｇｅＯｐｅｒａｔｏｒｓａｎｄＴｈｅｉｒＡｐｐｌｉｃａｔｉｏｎｓＬａｉＣｈｕｎｈｕｉ（赖春晖）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＺｈａｎｇｚｈｏｕＴｅａｃｈｅｒｓＣｏｌｅｇｅ，...     

On a Question of Phillips

In [5] Phillips proved that one can obtain the additive group of any nonstandard model *? of the ring ? of integers by using a linear mod 1 function h : F ?, where F is the α-dimensional vector space over ? when α is the cardinality of *?. In this connection it arises the question whether there are linear mod 1 functions which are neither addition nor quasi-linear. We prove that this is the case.