基于边缘智能的大路网协同运营服务平台

截至2018年底,我国公路里程达486万公里,机动车保有量已超3.27亿辆。公路路网规模与机动车保有量快速增长引发主要道路交通量呈现出爆发性增长态势。其中,由于高速公路与普通国省干线路网拥堵路段急剧增加,高速公路省界站已成为锁喉式节点。随着信息技术的发展,引入'大路网协同运营、大数据智慧分析'理念,通过'互联网+',开发大路网运营管理服务平台,成为新时代路网管理的必然趋势。大路网协同运营是指通过建立覆盖高速公路和普通国省干线实时管控机制,实现跨省界、跨区域、跨部门、跨路段的大路网协同运营。该平台具有全天候运行状态监控与预警、跨部门多层面协同管控、大数据智慧分析与决策等大路网运营管理服务功能。

Effects of Forest Roads on Habitat Pattern for Sables in Da Hinggan Mountains, Northeasten China

The anthropogenic managements of forest have created a network of roads resulting in the loss and alternation of habitat. To better understand road′s impact on animal habitats, we assessed the habitat pattern of sables(Martes zibellina), one of rodents within national first-class protected species, when roads are considered in Huzhong area in Da Hinggan Mountains, northeastern China. Employing published literatures about behavior ecology, aerial photographs and forest stand maps, we classified the study area into three habitat types including best-suitable, suitable and unsuitable habitats based on sable habitat requirements at the landscape scale including four variables derived from forest source map with attribute database. Results indicated the loss and significant fragmentation of best-suitable habitat and home range habitat when roads, especially 150 m avoidance distance of roads, were considered. The roads reduced and fragmented highly suitable habitats more significantly during earlier development period than the later development period. Additionally, the suitable area percentage increased with increasing distance to roads. This study helped to identify the suitable area for sables and location of sable population. Also, this study suggested the passage construction and road management involving road closure and removal will reduce the fragmentation functionally and benefit the sable population.

Improving Centralized Path Calculation Based on Graph Compression

Shortest-path calculation on weighted graphs are an essential operation in computer networks. The performance of such algorithms has become a critical challenge in emerging software-defined networks(SDN),since SDN controllers need to centralizedly perform a shortest-path query for every flow,usually on large-scale network. Unfortunately,one of the challenges is that current algorithms will become incalculable as the network size increases. Therefore, inspired by the compression graph in the field of compute visualization,we propose an efficient shortest path algorithm by compressing the original big network graph into a small one, but the important graph properties used to calculate path is reserved. We implement a centralized version of our approach in SDN-enabled network,and the evaluations validate the improvement compared with the well-known algorithms.

A self-organized locator obtaining method driven by local minima

The scalability of routing architectures for large networks is one of the biggest challenges that the Internet faces today.Greedy routing,in which each node is assigned a locator used as a distance metric,recently received increased attention from researchers and is considered as a potential solution for scalable routing.In this paper,LMD—a local minimum driven method is proposed to compute the topology-based locator.To eliminate the negative effect of the " quasi" greedy property—transfer routes longer than the shortest routes,a two-stage routing strategy is introduced,which combines the greedy routing with source routing.The greedy routing path discovered and compressed in the first stage is then used by the following source-routing stage.Through extensive evaluations,based on synthetic topologies as well as on a snapshot of the real Internet AS(autonomous system)topology,it is shown that LMD guarantees 100%delivery rate on large networks with low stretch.

An Integrated Tool for Power/Ground Network Design, Optimization,and Verification for Cell Based VLSIs

A CAD tool based on a group of efficient algorithms to verify,design,and optimize power/ground networks for standard cell model is presented.Nonlinear programming techniques,branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work.Users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed.The experimental results prove that the algorithms can run very fast with lower wiring resources consumption.As a result,the CAD tool based on these algorithms is able to cope with large-scale circuits.

A dynamic logistic regression for network link prediction

In social network analysis, link prediction is a problem of fundamental importance. How to conduct a comprehensive and principled link prediction, by taking various network structure information into consideration,is of great interest. To this end, we propose here a dynamic logistic regression method. Specifically, we assume that one has observed a time series of network structure. Then the proposed model dynamically predicts future links by studying the network structure in the past. To estimate the model, we find that the standard maximum likelihood estimation(MLE) is computationally forbidden. To solve the problem, we introduce a novel conditional maximum likelihood estimation(CMLE) method, which is computationally feasible for large-scale networks. We demonstrate the performance of the proposed method by extensive numerical studies.

Highly uniform carbon nanotube nanomesh network transistors

A new type of single-walled carbon nanotube （SWNT） thin-film transistor （TFT） structure with a nanomesh network channel has been fabricated from a pre- separated semiconducting nanotube solution and simultaneously achieved both high uniformity and a high on/off ratio for application in large-scale integrated circuits. The nanomesh structure is prepared on a high-density SWNT network channel and enables a high on/off ratio while maintaining the excellent uniformity of the electrical properties of the SWNT TFTs. These effects are attributed to the effective elimination of metallic paths across the source/drain electrodes by forming the nanomesh structure in the high-density SWNT network channel. Therefore, our approach can serve as a critical foundation for future nanotube-based thin- film display electronics.