一种用浮点除实现整除的方法

本文提出一种用浮点除法来实现整数除法的方法。对这种方法可能带来的误差进行估计井给出了商的修正方法。最后研究一个实例并对该方法进行了评价。     

主动声纳宽带信号的一种高效参数估计算法

讨论在宽带信号体制下,对水中高速目标的检测与估计问题,给出了高斯包络线性调频信号必须采用宽带模糊函数进行检测时的带宽和目标速度范围。在仿真分析了信号宽带、窄带模糊函数主峰特性的基础上,提出了一种联合利用宽带模糊函数和窄带模糊函数的高效目标参数估计算法,该算法可以将二维相关运算简化到一维相关运算,降低了运算量,同时具有良好的估计精度。     

关于不定方程x3=Dy2+1

本文对方程x3=Dy2+1中一般情形的D进行了讨论,对0相似文献   

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

信号采样及频谱分析在线信道测试中的应用

用AD采集卡对指控系统有线信道中的连续时间信号进行采样,得到离散的时间信号,再运用一种离散傅立叶变换——CZT进行频谱分析。详细介绍了在给定测量范围和精度的要求下,采集卡工作参数的配置方法,以及CZT变换实现频域细化的原理和计算参数的选定,还提出了一种快速算法,以增强测试系统的实时性。     

基于改进整型遗传算法的稀疏矩形平面阵列优化

为了降低固定稀疏率、固定孔径的稀疏矩形阵列的峰值旁瓣电平,提出一种改进整型遗传算法。该算法在整型遗传算法的基础上,提出了等间隔采样的交叉策略、多点变异策略以及优良基因重组的策略。采取等间隔采样的基因交叉方式,可以有效发挥整型编码的优势,从而提高算法的运行效率;为了提高种群的多样性,防止算法陷入局部最优,采用了多点变异策略;采用优良基因重组技术,加快了算法的收敛速度。仿真结果表明,相比传统的二进制和实数编码,整型编码更为直接高效;与用于稀疏矩形阵列优化的相关算法相比,本文所提算法获得了更优的旁瓣电平,证实了算法的有效性和优越性。     

Modeling and solution for the ship stowage planning problem of coils in the steel industry

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.     

基于蒙特卡洛法的无人机飞行冲突解脱安全评估

冲突解脱技术是无人机与有人机共域飞行的前提保障。针对目前缺少对冲突解脱技术安全评估的方法,提出运用蒙特卡洛法对飞行冲突进行仿真模拟,得出冲突解脱算法的安全效率。提出基于改进蚁群算法的冲突解脱技术,实现无人机的飞行冲突解脱;利用蒙特卡洛法,对飞行冲突过程进行大规模仿真,计算冲突解脱效率,与基本蚁群算法进行对比,并从安全角度对结果进行分析。提出的思路可为未来无人机空域运行安全评估体系的构建提供一种理论参考。     

Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017