Solving generalized transportation problems via pure transportation problems

This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034     

基于广义回归神经网络的单位运营状况分类

单位的运营状况会直接影响股东和广大人民的利益,针对运营状况可以使用广义回归神经网络进行分类。由于广义回归神经网络中径向基函数的扩展参数Spread的选取会导致分类的准确率,提出了一种果蝇优化算法优化参数Spread的分类模型。充分利用了果蝇优化算法的寻优能力,将优化后的参数代入到广义回归神经网络中对单位的财务数据进行运营状况的分类。结果表明,与广义回归神经网络做比较,优化后的网络模型对数据的分类可以达到很高的准确率,在相关领域的分类上有非常大的实用性。     

适应低时延业务需求的分布式可穿戴单兵作战信息系统

针对云计算应用在单兵作战系统场景下业务处理时延高、服务质量无法保障的问题,提出一种基于可穿戴计算的分布式单兵作战信息系统。利用士兵身上的可穿戴智能设备构建本地计算层,在作战地点就近处理计算数据,提供给士兵本地的信息处理与融合能力,并采用广义扩散负载均衡算法平衡各设备负载,降低业务处理时延;同时利用分布式计算的容错能力增强系统的可靠性。仿真结果表明,基于可穿戴设备的分布式本地网络架构能有效地降低作战任务的处理时延,同时增强系统的可靠性。     

OFDM系统中深度神经网络指导的IQ不平衡补偿算法

正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)是现代移动通信中一项重要的物理层通信技术,并且OFDM系统要求子载波间严格正交。然而,在实际系统中,振荡器和滤波器等器件的非理想特性会导致同相正交(In-phase and Quadrature-phase,IQ)不平衡,从而破坏子载波的正交性,严重影响OFDM系统的性能。通过研究IQ不平衡对OFDM系统的影响,提出了一种并联深度神经网络架构下的IQ不平衡补偿算法。该算法利用了深度神经网络不依赖于模型的特点,直接从接收到的频域信号恢复原输入信号的二进制序列,并利用干扰信号来自镜像子载波的先验知识来初始化模型驱动的神经网络,加快其网络优化的收敛速度。仿真结果表明,该算法能有效地补偿IQ不平衡失真,并且在幅度和相位失真的补偿上,其性能都优于传统的基于导频的最小二乘补偿算法,证明了深度学习方法解决物理层问题的优越性。     

基于深度神经网络的OFDM系统IQ不平衡补偿技术

正交频分复用(OFDM)是现代移动通信中一项重要的物理层通信技术,并且OFDM系统要求子载波间严格正交。然而在实际系统中,振荡器和滤波器等器件的非理想特性会导致同相正交(In-phase and Quadrature-phase,IQ)不平衡,从而破坏子载波的正交性,严重影响OFDM系统的性能。本文研究了IQ不平衡对OFDM系统的影响,提出了基于并联深度神经网络的IQ不平衡补偿技术。该算法利用了深度神经网络不依赖于模型的特点,直接从接收到的频域信号恢复原输入信号的二进制序列,并利用IQ不平衡的干扰信号来自镜像子载波的先验知识来初始化神经网络,加快其网络优化的收敛速度。仿真结果表明,该算法能有效地补偿IQ不平衡失真,并且在幅度和相位失真的补偿上,其性能都优于传统的导频的最小二乘（LS）估计补偿IQ不平衡的算法,证明了深度学习方法解决物理层问题的优越性。     

干扰抑制类生成式对抗网络

为进一步改善超低频频段的通信质量,在传统改进广义旁瓣抵消算法的基础上,提出新的超低频干扰抑制算法——生成式旁瓣抵消算法。该算法将人工智能研究热点之一的生成式对抗网络模型引入广义旁瓣抵消算法中,通过优化设计生成模型的网络结构及相关超参数,有效地解决了原算法存在的期望信号残留问题,为旁瓣抵消通道中的后级滤波算法提供了与主通道相关性更强的干扰参考信息,从而提高了算法对主通道干扰估计的准确性。为了验证优化后生成模型的有效性以及所提算法对不同类别干扰的抑制能力,在实验室环境下搭建实验平台,设计了多组对照实验。实验结果表明:优化后的生成模型具有较好的生成能力、较好的鲁棒性以及相对较低的运算复杂度;相比于传统改进的广义旁瓣抵消算法,所提算法进一步提高了信号带宽内的信干噪比。     

Reliability of a two-dimensional demand-based networked system with multistate components

Existing research on multistate system reliability has mainly focused on one-dimensional systems such as parallel systems, linear sliding window systems, and linearly consecutively connected systems. However, two-dimensional networked systems widely exist in real-world applications such as lighting systems, monitoring systems, and computer network systems. This research considers a two-dimensional networked system consisting of multistate components. The system fails if the cumulative performance of any row or any column cannot meet a predetermined demand. A novel reliability evaluation algorithm is proposed for the considered two-dimensional networked system by extending the universal generating function technique. Furthermore, the proposed model and reliability evaluation algorithm are extended to a two-dimensional networked system with phased missions. The proposed models and algorithms are illustrated by a matrix heating system in a thermoforming machine.     

模糊匈牙利算法在舰艇抢修人员指派问题中的研究

分析了舰艇在执行任务或作战等紧急情况下的抢修人员指派问题,并对此建立了多目标广义指派问题的数学模型。在任务数少于工作人数的情况下,采用虚拟“工作”和“人员”的方法,得到适合经典匈牙利算法的拓展效益矩阵,并对此矩阵采用匈牙利算法求得最优指派。     

一种基于Euler Spiral的缺失边界修复算法

在总结分析相关工作的基础上,提出了一种基于Euler Spiral修复认知轮廓中缺失边界的算法。该算法首先通过活动轮廓模型进行认知轮廓的初始定位,将视觉的预测性插值问题转化为中间插值问题,然后结合取向估计和Euler Spiral修复缺失的轮廓边界,取代了活动轮廓模型的迭代优化过程。对典型认知轮廓图形和遥感图像的实验结果验证了算法的有效性。     

Machine sequencing: Disjunctive graphs and degree-constrained subgraphs

In two earlier papers, we proposed algorithms for finding an optimal sequence of processing m items on q machines, by finding a minimaximal path in a disjunctive network. In a third paper, this latter model was generalized (from 2-state to 3-state disjunctive graphs) so as to accommodate project scheduling with resource constraints. In this paper, we discuss another algorithm for the (2-state) disjunctive network problem, closely related to those mentioned above. To make the paper self-contained, section 2 briefly describes the problem. Section 3 introduces a class of constraints which forms the basis of the algorithm discussed in section 4. The constraints have only 1, ?1, or 0 as coefficients on the left-hand side, integers on the right-hand side. The whole procedure of generating these constraints and finding a feasible solution whenever a new constraint is added, can be interpreted (section 5) as a process of generating a graph with degree-constraints on its nodes, and then finding a subgraph satisfying the degree-constraints. The nodes of the graph are generated by solving a critical-path-problem, the feasible subgraphs are found by implicit enumeration.     

非线性系统的神经网络广义预测控制

研究了神经网络广义预测控制方法在非线性系统中的应用,基于BP网络构造神经网络预测器,利用非线性系统的开环输入输出数据离线训练神经网络,根据拟牛顿BFGS优化算法使得二次型性能指标函数达到最小,得到了最优的控制序列。同时给出了神经网络广义预测控制算法的步骤,讨论了提高系统鲁棒性的措施。仿真结果表明,这种神经网络预测控制算法具有响应速度快、控制效果好和跟踪精度高等特点。     

粗集理论在目标识别信息处理中的应用

为提取传感器获得的较粗糙的原始信息,运用粗集理论进行目标识别信息的处理,提出了一种采用关系表存储原始信息,通过简化关系表删去冗余信息,从而达到提取有用信息的处理方法.根据此方法,实例中通过对生成的规则进行优选,得到了简单准确的目标识别规则.此理论在信息处理中的应用,较好地满足了目标识别中原始信息处理的需求.     

Ripples,complements, and substitutes in generalized networks

We extend the qualitative theory of sensitivity analysis for minimum-cost pure network flows of Granot and Veinott [17] to generalized network flow problems, that is, network flow problems where the amount of flow picked up by an arc is multiplied by a (positive) gain while traversing the arc. Three main results are presented. The ripple theorem gives upper bounds on the absolute value of optimal-flow variations as a function of variations in the problem parameter(s). The theory of substitutes and complements provides necessary and sufficient conditions for optimal-flow changes to consistently have the same (or the opposite) sign(s) in two given arcs, whereas the monotonicity theorem links changes in the value of the parameters to changes in optimal arc flows. Bounds on the rates of changes are also discussed. Compared with pure networks, the presence of gains makes qualitative sensitivity analysis here a much harder task. We show the profound effect on computational issues caused by the departure from the pure network structure. © 1996 John Wiley & Sons, Inc.     

基于节点剩余能量的分时分簇LEACH改进算法

针对无线传感网络中高效路由协议的设计问题,基于传感器节点的剩余能量提出一种分时分簇的改进LEACH算法。算法通过分时分簇方式,有效克服了传统LEACH算法中簇首数目不稳定的缺陷,且不会额外增加网络的能耗,使得簇首在整个网络中的分布以及网络的能量消耗更加均衡,有效延长了传感器网络的正常工作时间。仿真实验验证了改进算法的有效性。     

战术移动Ad Hoc网络下的分布式位置辅助功率控制算法

针对战术移动自组(AdHoc)网络提出一种分布式位置辅助的功率控制算法(LAPCA),它通过位置预测来推算节点的邻节点数目,进而调整信号发射功率,以保持最佳的网络连通性,由此提高整个网络的有效流量。该算法作为一个独立模块可以方便地与已有的移动自组网络路由协议相结合。采用较为适合战术环境的参考点群组移动(RPGM)模型来产生网络仿真场景,从仿真实验结果来看,几乎在所有的RPGM场景下采用该算法后的网络有效流量相对于纯粹的AODV路由协议都得到了提高。     

改进BP网络的舰船装备保障资源保障能力评估

针对单独运用BP网络评估舰船装备保障资源保障能力时存在的不足,提出了一种基于改进BP网络的舰船装备保障资源保障能力评估模型。首先构建了保障能力评估的指标体系,在此基础上,采用主成分分析法对原始输入变量进行预处理,选择输入变量的主成分作为神经网络输入,一方面减少了输入变量的维数,消除了各输入变量的相关性;另一方面提高了网络的收敛性和稳定性,同时也简化了网络的结构。然后将遗传优化算法与BP网络结合,利用GA的全局搜索能力优化BP网络的结构参数。最后进行实例计算,结果表明该方法有效克服了纯BP算法局部收敛、泛化能力弱等问题,新模型采用的算法具有收敛速度快,结果精度高的优点,适用于对保障资源保障能力的分析和评估。     

Vector processing approach to constrained network problems

Modification of algorithms designed for scalar computing, to take advantage of vector processing, raises several challenges. This article presents the vectorization of the primal simplex based network algorithm and results in a 50% improvement in computational time. One of the major contributors to this improvement is the matching of the size of the pricing candidate list to the vector register size. The side constraints are relaxed into a single surrogate constraint. The single constraint network algorithm is vectorized and used as the basis for solving large-scale constrained network problems. Computational experiments are presented which illustrate the vectorization of the network code as well as the ability of the surrogate constraint approach to deal with large constrained network problems.     

并行系统可扩性分析研究

分析了几种已有的可扩性分析模型 ,并对传统的时间受限与存储受限加速比定律作了新的解释。在此基础上 ,概括出了可扩性分析的本质 ,定义了一类一般意义下同构机器与并行算法组成的并行系统的可扩性模型 ,并由此出发 ,提出了三种新的可扩性模型 :等平均I/O需求模型 ,等平均通信需求模型和等利用率模型。最后探讨了工作站机群与并行算法组成的并行系统的可扩性分析。     

靶场外测数据实时处理软件设计

根据靶场飞行试验任务需求,对外测数据实时处理软件所用到的测元参数、关键数学模型、算法、装订参数等进行了分析,综合运用了数据检择、滤波与平滑等技术,避免了＂台阶跳＂、＂死码＂等野值干扰,形成了实用、可靠的外测数据实时处理方法。软件设计采用多进程、多线程体系结构,合理地分解了系统的功能,建立了一套实时、高效、可靠的软件程序框架,并在该程序框架下设计了各软件功能模块。     

多目标广义指派问题的模糊匈牙利算法求解

提出和讨论了两类多目标的广义指派决策问题,分别给出了它们的多目标整数线性规划数学模型,并结合模糊理论与解决传统指派问题的匈牙利方法提出了一种新的求解算法:模糊匈牙利法.最后给出了一个数值例子.