微分方程解的存在区间的确定

从六个方面说明了确定一阶微分方程解的存在区间的方法.     

Time and direction of arrival detection and filtering for imaging in strongly scattering random media

We study detection and imaging of small reflectors in heavy clutter, using an array of transducers that emits and receives sound waves. Heavy clutter means that multiple scattering of the waves in the heterogeneous host medium is strong and overwhelms the arrivals from the small reflectors. Building on the adaptive time-frequency filter of [Borcea et al, SIIMS 2011;4(3)], we propose a robust method for detecting the direction of arrival of the direct echoes from the small reflectors, and suppressing the unwanted clutter backscatter. This improves the resolution of imaging. We illustrate the performance of the method with realistic numerical simulations in a non-destructive testing setup.     

关于Schr(o)der函数Borel方向的一个应用

本文应用Borel方向和充满圆的关系得到了方程F(z)=R(f(z))的一个充分必要条件,并给出它关于Schr(o)der方程f(sz)=R(f(z))的-个应用,这里s是一常数且|s|＞,R(w)是次数大于2的有理函数.     

沿法线方向改进非DEA有效DMU

现有的非DEA有效DMU的改进方法造成DMU的投入或产出的波动太大,因而难以进行改进.提出了沿法线方向改进非DEA有效DMU的新方法.可以使非DEA有效DMU尽快到达有效前沿面,成为DEA有效,减小了波动幅度,并结合12所重点理工高校效评价的实际,验证了本方法的优势.     

基于动力系统的线性不等式组的解法

本文提出了一种新的求解线性不等式组可行解的方法-基于动力系统的方法．假设线性不等式组的可行域为非空,在可行域的相对内域上建立一个非线性关系表达式,进而得到一个结构简单的动力系统模型．同时,定义了穿越方向。文章最后的数值实验结果表明此算法是有效的．     

Function S-rough Sets and Their Law Characteristic

Function S-rough sets(Function Singular rough sets) are defined by R-function equivalence class which has dynamic characteristic, and a function is s law, function S-rough sets have law characteristic. Function S-rough sets has these forms: function one direction S-rough sets, function two direction S-rough sets and dual of function one direction S-rough sets. This paper presents the law characteristic of function one direction S-rough sets and puts forward the theorems of law-chain-attribute and law-belt. Function S-rough sets is s new research direction of the rough sets theory.     

广义半无限规划问题的一种可行方向算法

基于Zoutendijk可行方向算法,本文提出了一种求解广义半无限规划问题的可行方向算法,在保证算法收敛的情况下,此算法比以往的算法在假设条件的要求上有着一定的优势,且数值试验表明此法是可行的.     

关于H.Yoshida的一个问题

H.Yoshida曾经提出下述问题:对级小于1/2的整函数f（z）,是否自原点出发的每一条射线,或者为它的Julia方向,或者在包含该射线的某个角域内当|z|→∞时有|f（z）|→∞.本文的结论表明对正则增长的整函数,H.Yoshida问题的答案是肯定的,而且对许多其他的Julia型方向,类似的问题的答案也是肯定的.     

Dual decomposition of a single-machine scheduling problem

We design a fast ascent direction algorithm for the Lagrangian dual problem of the single-machine scheduling problem of minimizing total weighted completion time subject to precedence constraints. We show that designing such an algorithm is relatively simple if a scheduling problem is formulated in terms of the job completion times rather than as an 0–1 linear program. Also, we show that upon termination of such an ascent direction algorithm we get a dual decomposition of the original problem, which can be exploited to develop approximative and enumerative approaches for it. Computational results exhibit that in our application the ascent direction leads to good Lagrangian lower and upper bounds.