The effects of resource limitation and consensual incentives on cooperation

Exploring the evolution of cooperation has been one of the most challenging topics and attracted increasing attention in various realms. Hereby, we institute an analytic model where the relationship between the common benefits and contributions is the typical saturation nonlinearity. We investigate the evolutionary dynamics of cooperation with and without consensual incentives respectively. The population always evolves to full defection when the incentives are absent. Cooperation, however, can be promoted by consensual incentives when the degree of cooperators' preferences for incentives is great. There exists an intermediate amount of resources at which the positive effect of consensual incentives on cooperation is minimized. Furthermore, there is a U-shape relationship between the degree of cooperators' preference for an incentive and the evolution of cooperation. A greater basin of full cooperation can be induced when the cooperators' preference for reward is more pronounced than that for punishment.     

Approximation algorithms for dynamic resource allocation

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.     

一种新的WDM光网中的共享链路保护策略

研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率.     

花丝内插物强化竖直管内凝结换热的实验研究

1前言大空隙率多孔体管内插物-绕花丝内插物，被认为是强化管内凝结换热的最有效途径之一[1]．但以往的研究，由于实验雷诺数范围较小，蒸汽速度较低，要正确全面评价其性能尚显不够。本文在原有工作的基础上，进一步完善了实验系统，改进了测试手段，扩大了实验雷诺数范围，并测试了其阻力性能，对花丝内插物强化管内凝结换热进行了较深入全面的实验研究，以全面评价花丝内插物对管内凝结换热的强化效果。2实验系统本文实验系统如图1所示。实验段是一个竖直套管冷凝器，如图2所示．本试验研究蒸汽完全凝结时的传热。凝结水流量采用容积法计…     

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…     

Resource allocation model and double-sphere crowding distance for evolutionary multi-objective optimization

Convergence speed and diversity of nondominated solutions are two important performance indicators for Multi-Objective Evolutionary Algorithms (MOEAs). In this paper, we propose a Resource Allocation (RA) model based on Game Theory to accelerate the convergence speed of MOEAs, and a novel Double-Sphere Crowding Distance (DSCD) measure to improve the diversity of nondominated solutions. The mechanism of RA model is that the individuals in each group cooperate with each other to get maximum benefits for their group, and then individuals in the same group compete for private interests. The DSCD measure uses hyper-spheres consisting of nearest neighbors to estimate the crowding degree. Experimental results on convergence speed and diversity of nondominated solutions for benchmark problems and a real-world problem show the efficiency of these two proposed techniques.     

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.     

Resource augmentation for online bounded space bin packing

We study online bounded space bin packing in the resource augmentation model of competitive analysis. In this model, the online bounded space packing algorithm has to pack a list L of items in (0,1] into a small number of bins of size b1. Its performance is measured by comparing the produced packing against the optimal offline packing of the list L into bins of size 1.We present a complete solution to this problem: For every bin size b1, we design online bounded space bin packing algorithms whose worst case ratio in this model comes arbitrarily close to a certain bound ρ(b). Moreover, we prove that no online bounded space algorithm can perform better than ρ(b) in the worst case.