关于大型线性规划问题鞍点算法的讨论

关于大型线性规划问题鞍点算法的讨论尚毅,张国光,成孟金（沈阳化工学院１１００２１）ＡＤｉｓｃｕｓｓｉｏｎｏｆｔｈｅＳａｄｄｌｅＰｏｉｎｔＡｌｇｏｒｉｔｈｍｆｏｒＬａｒｇｅＳｃａｌｅＬＰＰｒｏｂｌｅｍｓ￥ＳｈａｎｇＹｉ;ＺｈａｎｇＧｕｏｇｕａｎｇ;Ｃｈ...     

高速并行Gardner算法设计与实现

随着空间探测任务逐步增加、空间信道频谱资源日趋紧张,传统Gardner定时同步算法已经无法满足高速数传系统高通量、高可靠性的需求。为了提高Gardner定时同步算法的吞吐率并增大可纠正误差范围,提出一种高速并行Gardner算法。为了保证插值精度同时减少乘法器消耗,设计了一种并行分段抛物线插值滤波器;为了便于并行流水线设计和最佳采样点选取,构建了计数模块和定时缓存调整模块;为了提高等价吞吐率,重构了流水线并行环路滤波器结构和并行数控振荡器结构。结果表明,该算法等价吞吐率可达1 739.13 Msps,数字信号处理器资源消耗可减少44%,可纠正2×10^-3的定时误差。     

一种面向多核处理器的高效并行PCA-SIFT算法

提出一种面向多核处理器的并行PCA-SIFT算法,采用数据级并行方法实现并行的特征提取和特征点匹配,将计算任务分配到各个DSP核并行处理,充分开发多核处理器的多级并行性.实验结果表明,并行PCA-SIFT算法对各种不同图像形变的图像具有良好的适应性,具有接近串行PCA-SIFT算法的图像匹配能力,平均加速比达3.12.     

基于流水线图像处理结构的多层模板相关神经元网络

在自主地面车辆中,视觉系统的重要作用之一是根据路标来定位。本文提出了一种便于流水线图像处理结构实现的多层模板相关神经元网络（ＭＴＣＮＮ）。文中给出了ＭＴＣＮＮ的基本结构及训练算法,并且将其与经典的多层前馈神经元网络（ＭＬＦＮＮ）进行了比较。仿真结果表明,本文提出的算法结构在多层前馈神经元网络的分类能力与采用通用图像处理硬件的可实现性之间,取得了良好的折衷。     

拟带宽 Toeplitz 系统的秩 1 修正算法

本文以带宽Ｔｏｅｐｌｉｔｚ系统的快速并行解法为基础,通过建立秩１的修正格式讨论了拟带宽Ｔｏｅｐｌｉｔｚ系统的一种快速并行算法,其串行运算量为９ｎｈ＋Ｏ（ｈ）．设ｐ为处理机台数,当ｐ≤ｎ时,并行运算量为　;当ｐ＝３ｎ时,运算量为２ｈ￣２ｌｏｇ２ｎ＋Ｏ（１）,其中ｈ表示拟带宽宽度。     

AVS解码中插值算法的硬件实现

在AVS标准中的插值算法采用分像素提高视频解码的清晰度,也是解码端主要的访存和计算瓶颈.为了得到分像素位置的像素值,需要参考其周围相邻的像素值;针对亮度和色度插值设计了一种基于流水线的并行架构,计算出不同位置上的分像素值,提高了解码系统的运算速度,与其他设计完成的解码器模块配合,在FPGA上实现AVS高清实时解码.     

基于随机共振的多频率微弱信号并行检测

强噪声背景下的微弱信号检测是当前信号处理领域的研究热点。基于非线性理论的随机共振能够利用噪声,将噪声的一部分能量转移给信号,从而获得更高的输出信噪比。针对传统随机共振检测算法应用环境受限且无法实现多频率并行检测的现状,文章面向实际超短波环境,在参数补偿法的基础上,重新设计采样频率和补偿系数,提出了新的检测算法,实现了多频率微弱信号的并行检测。     

DOS环境中BMP图的分块分解和显示

本文叙述了一种用ＭｉｃｒｏｓｏｆｔＷｉｎｄｏｗｓ３．１中的工具软件Ｐａｉｎｔｂｒｕｓｈ生成的位图格式图形文件（文件的扩展名为．ＢＭＰ）按位面分块分解,并在ＤＯＳ环境中分块快速显示的方法,这种方法可以方便地实现显示图形的变色,同时也比较容易达到一定的动画效果。     

缓动点目标的流水线检测算法

讨论了复杂背景下缓动点目标的流水线检测算法。通过两个流水线,分割流水线和检测流水线,可以用１５帧图像满意地检测出目标。对算法的性能和实验结果作了分析。     

并行加速网络操作系统的研究与实现

并行计算机是计算机科学发展的必然趋势,当前研究并行计算机在网络系统中实现资源共享,推广并行计算机的应用是一个非常粗意义的课题。本论文介绍并行加速机网络操作系统的研究成果。该操作系统已经成功地实现了基于Ｔｒａｎｓｐｕｔｅｒ的ＰＡ－１００并行加速机的在局网上,支持多用户的作业级并行处理和任务级并行处理。     

Allocation of resources to randomly occurring opportunities

An allocation problem is considered in lvhich different kinds of resources must be allocated to various activities, within a given time period. The opportunities for allo'cation appear randomly during this period. Certain assumptions about the values of possible allocations and the distribution of occurrences of opportunities lead to a dynamic programming formulation of the problem. This leads to a system of ordinary differential equations which are (in theory) solvable recursively, and can be solved numerically to any desired degree of precision. An example is given for the allocation of aircraft-carried weapons to targets of opportunity.     

A model of supply-chain decisions for resource sharing with an application to ventilator allocation to combat COVID-19

We present a stochastic optimization model for allocating and sharing a critical resource in the case of a pandemic. The demand for different entities peaks at different times, and an initial inventory for a central agency are to be allocated. The entities (states) may share the critical resource with a different state under a risk-averse condition. The model is applied to study the allocation of ventilator inventory in the COVID-19 pandemic by FEMA to different U.S. states. Findings suggest that if less than 60% of the ventilator inventory is available for non-COVID-19 patients, FEMA's stockpile of 20 000 ventilators (as of March 23, 2020) would be nearly adequate to meet the projected needs in slightly above average demand scenarios. However, when more than 75% of the available ventilator inventory must be reserved for non-COVID-19 patients, various degrees of shortfall are expected. In a severe case, where the demand is concentrated in the top-most quartile of the forecast confidence interval and states are not willing to share their stockpile of ventilators, the total shortfall over the planning horizon (until May 31, 2020) is about 232 000 ventilator days, with a peak shortfall of 17 200 ventilators on April 19, 2020. Results are also reported for a worst-case where the demand is at the upper limit of the 95% confidence interval. An important finding of this study is that a central agency (FEMA) can act as a coordinator for sharing critical resources that are in short supply over time to add efficiency in the system. Moreover, through properly managing risk-aversion of different entities (states) additional efficiency can be gained. An additional implication is that ramping up production early in the planning cycle allows to reduce shortfall significantly. An optimal timing of this production ramp-up consideration can be based on a cost-benefit analysis.     

A combined approach to solve binary multicriteria problems

An implicit enumeration algorithm is developed to determine the set of efficient points in zero-one multiple criteria problems. The algorithm is specialized for the solution of a particular class of facility location problems. The procedure is complemented with the use of the utility function of the decision maker to identify a subset of efficient point candidates for the final selection. Computational results are provided and discussed.     

A maximum utility solution to a vehicle constrained tanker scheduling problem

A modification to the Dantzig and Fulkerson Tanker Scheduling Problem is described. An insufficient number of vehicles and a utility associated with each vehicle delivery are assumed. The new problem is shown to be equivalent to a Transshipment Problem, the solution of which is the same as the maximal utility solution of the modified Tanker Scheduling Problem. An example is given.     

Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time

The problem of scheduling n jobs on m parallel machines is considered when the machines are subject to random breakdowns and job processing times are random variables. An objective function of mean flow time is developed for a general parallel machine system, and an expression of its expected value is derived. The problem is transformed into a deterministic unrelated parallel machine scheduling model with modified processing times when the number of breakdowns is modeled as a generalized Poisson process. © 1994 John Wiley & Sons, Inc.     

Duality for quasi-concave programs with application to economics

A duality theory is developed for mathematical programs with strictly quasi-concave objective functions to be maximized over a convex set. This work broadens the duality theory of Rockafellar and Peterson from concave (convex) functions to quasi-concave (quasi-convex) functions. The theory is closely related to the utility theory in economics. An example from economic planning is examined and the solution to the dual program is shown to have the properties normally associated with market prices.     

Scheduling jobs to two machines subject to batch arrival ordering

The problem considered is to assign n jobs to two processors so as to minimize the total flow time, with the constraint that a predetermined partial ordering (induced by batch arrivals) must be preserved within the subset of jobs assigned to each processor. An efficient algorithm of time 0(n⁵) is developed, and computational experience is reported.     

Systems approach to the multistage manufacturing connected-unit situation

This paper investigates the relationships among incoming quality limit (AIQL), manufacturing quality level in each stage of production, and outgoing quality limit (AOQL), for a multistage manufacturing connected-unit situation from the systems cost-effectiveness point of view. An objective function is developed and the formulated problem is solved using discrete optimization technique. The study is restricted to the development of single sampling plans where inspection is by attribute. Lot size and sample size are fixed for incoming and outgoing inspection for each stage of manufacturing.     

图像配准技术在DPCA动目标检测中的应用

杂波相消是运用DPCA方法进行地面动目标检测的一个关键问题,如果能将两幅图像精确配准将会得到很好的杂波相消图.基于傅氏变换及最大频谱法,采用了一种新的配准方法对真实的机载SAR图像进行了粗配准与精配准,得到了较好的杂波相消图,并有效准确地检测出地面动目标.     

Scheduling customer arrivals to a stochastic service system

An efficient algorithm for determining the optimal arrival schedule for customers in a stochastic service system is developed. All customers arrive exactly when scheduled, and service times are modeled as iid Erlang random variables. Costs are incurred at a fixed rate per unit of time each customer waits for service, and an additional cost is incurred for every unit of time the server operates beyond a scheduled closing time. The objective is to minimize total operating cost. This type of problem arises in many operational contexts including transportation, manufacturing, and appointment‐based services. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 549–559, 1999