城市交通多类型随机用户出行决策模型研究

考虑城市交通中有多类出行者的一般情况,在ATIS等交通信息系统的影响下,不同类型的出行者对路径出行时间有不同理解,用不同的参数来反映.在此基础上,给出考虑路径选择、方式选择、讫点选择及是否出行的多类型随机用户出行决策模型,证明了模型的一阶条件满足路径选择、方式选择、讫点选择及是否出行的条件,最后给出模型算法.     

工程项目主体在风险管理合作中的演化博弈分析

运用演化博弈分析方法,以业主及承包商在项目风险管理中的合作为例,建立项目主体在风险管理中合作的演化博弈模型,通过模型分析了模型中各参数对演变系统的影响、业主及承包商合作策略的演变规律,指出影响工程项目各方实现风险管理合作的主要影响因素是风险管理合作的成本及风险损失或收益的分配机制.     

How happy is your web browsing? A model to quantify satisfaction of an Internet user searching for desired information

We feel happy when web browsing operations provide us with necessary information; otherwise, we feel bitter. How to measure this happiness (or bitterness)? How does the profile of happiness grow and decay during the course of web browsing? We propose a probabilistic framework that models the evolution of user satisfaction, on top of his/her continuous frustration at not finding the required information. It is found that the cumulative satisfaction profile of a web-searching individual can be modeled effectively as the sum of a random number of random terms, where each term is a mutually independent random variable, originating from ‘memoryless’ Poisson flow. Evolution of satisfaction over the entire time interval of a user’s browsing was modeled using auto-correlation analysis. A utilitarian marker, a magnitude of greater than unity of which describes happy web-searching operations, and an empirical limit that connects user’s satisfaction with his frustration level—are proposed too. The presence of pertinent information in the very first page of a website and magnitude of the decay parameter of user satisfaction (frustration, irritation etc.) are found to be two key aspects that dominate the web user’s psychology. The proposed model employed different combinations of decay parameter, searching time and number of helpful websites. The obtained results are found to match the results from three real-life case studies.     

The Polarization of the Coupling Strength of Interdependent Networks Stimulates Cooperation

We introduce a mixed network coupling mechanism and study its effects on how cooperation evolves in interdependent networks. This mechanism allows some players (conservative-driven) to establish a fixed-strength coupling, while other players (radical-driven) adjust their coupling strength through the evolution of strategy. By means of numerical simulation, a hump-like relationship between the level of cooperation and conservative participant density is revealed. Interestingly, interspecies interactions stimulate polarization of the coupling strength of radical-driven players, promoting cooperation between two types of players. We thus demonstrate that a simple mixed network coupling mechanism substantially expands the scope of cooperation among structured populations.     

Cache-assisted relay selection algorithm based on incentive cooperation

An unrealistic preset condition exists in the cache-assisted relay system, namely that the social attributes of all nodes are highly overlapping and similar. In practice, however, this prerequisite is frequently not fulfilled because nodes exhibit a certain degree of selfishness. This paper, therefore, proposes a cache-assisted relay selection algorithm based on incentive cooperation to resolve the problem of system performance degradation precipitated by differences in the social attributes of nodes in cache-assisted networks. By incorporating the contribution of nodes to the system, nodes with poor social attributes are encouraged to participate in optimizing feedback effects actively. Nodes with high competition function values have a higher priority for information storage and transmission, improve the participation of low-attribute nodes, and attenuate the impact of channel changes, thereby enhancing network sustainability and system efficiency.