Asymmetric flow networks

This paper provides a new model of network formation that bridges the gap between the two benchmark game-theoretic models by Bala and Goyal (2000a) – the one-way flow model, and the two-way flow model – and includes both as limiting cases. As in both the said models, a link can be initiated unilaterally by any player with any other in what we call an “asymmetric flow” network, and the flow through a link towards the player who supports it is perfect. Unlike those models, there is friction or decay in the opposite direction. When this decay is complete there is no flow and this corresponds to the one-way flow model. The limit case when the decay in the opposite direction (and asymmetry) disappears corresponds to the two-way flow model. We characterize stable and strictly stable architectures for the whole range of parameters of this “intermediate” and more general model. A study of the efficiency of these architectures shows that in general stability and efficiency do not go together. We also prove the convergence of Bala and Goyal’s dynamic model in this context.     

Adaptive multimedia streaming using a simulation test bed

The major purpose of this paper is to transmit an existing video above a complete simulated video streaming architecture based on Network Simulator (NS2). Thanks to our architecture, the visual quality evaluation of the distributed streaming platform under various conditions is simplified. Indeed, the received video can be easily visualized using a classic video client or be compared using the Peak Signal-Noise Ratio (PSNR) value and the Structural SIMilarity (SSIM) value. In the case study, we compare adaptive video congestion strategies using a transcoder, Datagram Congestion Control Protocol (DCCP) and TCP-Friendly Rate Control (TFRC).     

基于混合密度网络模型拟合收益统计分布与计算Expected Shortfall

基于混合密度网络模型估计金融时间序列的时变条件密件,提出数值模拟方法计算ExpectedShortfall。对香港恒生指数的实证研究表明,混合密度网络可以有效地描述收益的经验分布统计特征和波动规律,模型评估指标反映出预测效果良好,Value-at-R isk的预测精度在高端分位点表现较好,且可有效计算Expected shortfall指标,是金融市场风险测量的有效方法。     

求解无线传感器网络路由问题的蚁群最优化算法及其收敛性

首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明．最后对找到最优解后信息素值的变化进行了分析．即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值．     

Perovskite-type proton conductor for novel direct ionic thermoelectric hydrogen sensor

It was investigated whether a perovskite-type proton conductor, here BaCe_0.95Y_0.05O_3 − δ (BCY), is suitable as sensing material for a novel type of thermoelectric hydrogen sensor. Therefore, the hydrogen and oxygen concentration dependence of the thermopower of BaCe_0.95Y_0.05O_3 − δ was determined and was found to be in the same range as the value derived from theory. The hydrogen dependence was also measured at different temperatures, and only a comparatively small temperature dependence of the thermopower was observed.     

空地激光通信系统中捕获子系统仿真

针对空地激光通信系统,推导了复合光栅螺旋扫描捕获方法所需的最大捕获时间、平均捕获时间和捕获概率的计算公式,建立了捕获性能仿真模型,分析了捕获时间和捕获概率的关系,以及空中平台的相对速度对捕获系统的影响和抑制方法.仿真结果表明,当通信终端的捕获不确定区域为50mrad,扫描重叠因子为0.12时,捕获探测器的信噪比大于6时,空地激光通信系统总的捕获概率优于95%,最大捕获时间约为36s,平均捕获时间约为12s.     

On network form and function

Moving from the observation that drainage network configurations minimizing total energy dissipation are stationary solutions of the general equation describing landscape evolution, we review theoretical and observational evidence on river patterns and their scale-invariant structure. Exact results complemented by numerical annealing of the basic equation in the presence of additive noise suggest that configurations at (or very close to) the global minimum of energy dissipation differ from dynamically accessible states, which have rather different scaling properties and conform much better to natural forms. Thus we argue that, at least in the fluvial landscape, Nature works through imperfect searches for dynamically accessible optimal configurations. We also show that optimal networks are spanning loopless configurations only under precise physical requirements. This is stated in a form applicable to generic networks, suggesting that other branching structures occurring in Nature (e.g. scale-free and looping) may possibly arise through optimality to selective pressures. Indeed, we show that this is the case.     

Recursive weighted treelike networks

We propose a geometric growth model for weighted scale-free networks, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks, which are partially determined by the parameters. Analytical results indicate that the resulting networks have power-law distributions of degree, strength, weight and betweenness, a scale-free behavior for degree correlations, logarithmic small average path length and diameter with network size. The obtained properties are in agreement with empirical data observed in many real-life networks, which shows that the presented model may provide valuable insight into the real systems.     

Delay optimization and energy balancing algorithm for improving network lifetime in fixed wireless sensor networks

Since wireless in terms of energy-restricted processes, dispersion radii, processing power limitations, buffers, bandwidth-limited connections, active network topologies, and network stream of traffic outlines, sensor networks provide difficult design issues. The number of hops and latency are decreased if there is a relay mote because it interacts directly with relay motes that are closer to the destination mote. The tremendous intensive research in the area of Wireless Sensor Networks (WSN) has gained a lot of significance among the technical community and research. The job of WSN is to sense the data using sensor motes, pass on the data to the destination detection mote which is associated with a processing center and can be used in multiple spans of Internet of Things (IoT) applications. Wireless sensor network has a set of sensor motes. By making use of sensor mote placement strategy all the sensor motes are spread in an area with each mote having its own exceptional location. Internet of things applications are delay sensitive those applications have a challenge of forming the complete path at a lower delay constraint. The proposal is to modify the game theory energy balancing algorithm by making use of relay motes so that overall network lifetime is increased. It has been proved that modified GTEB is better with respect to existing algorithms in terms of delay, figure of hops, energy depletion, figure of alive motes, figure of dead motes, lifespan ratio, routing overhead and throughput.