Applications of the method of partial inverses to convex programming: Decomposition

A primal–dual decomposition method is presented to solve the separable convex programming problem. Convergence to a solution and Lagrange multiplier vector occurs from an arbitrary starting point. The method is equivalent to the proximal point algorithm applied to a certain maximal monotone multifunction. In the nonseparable case, it specializes to a known method, the proximal method of multipliers. Conditions are provided which guarantee linear convergence.This research was sponsored, in part, by the Air Force Office of Scientific Research under grant 80-0195.     

基于SRLG约束和资源共享的交迭段保护机制研究

通过对共享风险链路组约束机制和交迭段保护机制的分析,将两者相结合并根据工作和保护路径分别采用动态链路权重调整,提出了一种基于共享风险链路组不相关的交迭段共享保护算法.交迭段共享保护算法在共享风险链路组不相关的约束条件下,为整个工作路由提供了多个交迭的保护段,并给出了一种能够合理有效选择这些交迭保护段的方法.对交迭段共享保护算法的分析和仿真结果表明,与以往保护算法相比,交迭段共享保护算法不但大大提高了网络连接的可靠性,而且还通过不同交迭保护段间资源的合理共享,有效地提高了网络资源的利用率.     

基于关键路径链和PACGA的网络总线资源调度方法研究

针对传统工业控制网络总线资源调度算法在节点数量逐渐增加时收敛速度慢和搜索精度不高,且准确度及效率低等问题, 提出了一种基于关键路径链和多态蚁群遗传算法(PACGA)的资源调度方法,采用关键路径链的调度算法获取需求调度的节点,不同节点间采用多态蚁群遗传算法进行资源的调度,依据照工业控制网络资源调度的特征,用自适应调整挥发系数增强节点的全局搜索性能,通过候选节点集方法缩小搜索区域提高算法的搜索效率,完成工业控制网络总线资源的高效调度。仿真实验说明,该种方法在工业控制过程中任务数量较多的情况下仍然具备较高的运行效率和精度,并且具有较低的运行时间,具有较强的应用价值。     

A possible human counterpart of the principle of increasing entropy

It is well-known that the principle of increasing entropy holds for isolated natural systems that contain non-adaptive molecules. Here we present, for the first time, an experimental evidence for a possible human counterpart of the principle in an isolated social system that involves adaptive humans. Our work shows that the human counterpart is valid even though interactions among humans in social systems are distinctly different from those among molecules in natural systems. Thus, it becomes possible to understand social systems from this natural principle, at least to some extent.     

Mobile relays for enhanced broadband connectivity in high speed train systems

With the introduction of wireless modems and smart phones, the passenger transport industry is witnessing a high demand to ensure not only the safety of the trains, but also to provide users with Internet access all the time inside the train. When the Mobile Terminal (MT) communicates directly with the Base Station (BS), it will experience a severe degradation in the Quality of Service due to the path loss and shadowing effects as the wireless signal is traveling through the train. In this paper, we study the performance in the case of relays placed on top of each train car. In the proposed approach, these relays communicate with the cellular BS on one hand, and with the MTs inside the train cars on the other hand, using the Long Term Evolution (LTE) cellular technology. A low complexity heuristic LTE radio resource management approach is proposed and compared to the Hungarian algorithm, both in the presence and absence of the relays. The presence of the relays is shown to lead to significant enhancements in the effective data rates of the MTs. In addition, the proposed resource management approach is shown to reach a performance close to the optimal Hungarian algorithm.     

Broad distributions from resource partitioning

We present a model describing a generic process in which a finite resource is partitioned and distributed among agents. Through numerical simulation we show that the model considered is able to originate, within a unifying approach, a variety of broad distributions and provides an interpretation of empirical properties of distributions observed in the real world. In particular it allows to relate the exponent of the power-law part of the distributions to resource abundance and accessibility, while the left-end exponential behavior, observed in many distributions, is related to the presence of dissipative effects.     

REATMENT AND RESOURCE REUSE OF 1,2,4-ACID PRODUCING EFFLUENT WITH MACROPOROUS POLYMERIC ADSORBENT

1. INTRODUCTION 1,2,4-acid (1-Amino-2-naphthol-4-sulfonic acid) is among the most important naphthalene derivatives which are widely used as the intermediates of dyestuffs. In its production process, however, high strength wastewater streams are gene…     

Covering symmetric semi-monotone functions

We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-monotone function is NP-complete if all the values of the function are in {0,1} and we provide a minimax theorem if all the values of the function are different from 1. Our problem is equivalent to the node to area augmentation problem. Our contribution is to provide a significantly simpler and shorter proof.     

Pre-emption in resource-constrained project scheduling

The Resource-Constrained Project Scheduling Project (RCPSP), together with some of its extensions, has been widely studied. A fundamental assumption in this basic problem is that activities in progress are non-preemptable. Very little effort has been made to uncover the potential benefits of discrete activity pre-emption, and the papers dealing with this issue have reached the conclusion that it has little effect on project length when constant resource availability levels are defined. In this paper we show how three basic elements of many heuristics for the RCPSP – codification, serial SGS and double justification – can be adapted to deal with interruption. The paper is mainly focussed on problem 1_PRCPSP, a generalization of the RCPSP where a maximum of one interruption per activity is allowed. However, it is also shown how these three elements can be further adapted to deal with more general pre-emptive problems. Computational experiments on the standard j30 and j120 sets support the conclusion that pre-emption does help to decrease project length when compared to the no-interruption case. They also prove the usefulness of the justification in the presence of pre-emption. The justification is a RCPS technique that can be easily incorporated into a wide range of algorithms for the RCPSP, increasing their solution quality – maintaining the number of schedules calculated.