检索结果-内蒙古大学图书馆

REFF: REliable and Fast Forwarding in Vehicular Ad-hoc network 1st

学校读者我要写书评

暂无评论

REFF: REliable and Fast Forwarding in Vehicular Ad-hoc Netwo...

1st International Conference on 5G for Future Wireless networks, 5GWN 2017

作者： Tian, Daxin Dai, Ziyi Zheng, Kunxian Zhou, Jianshan Duan, Xuting Guo, Peng Rong, Hui Wang, Wenyang Zhang, Haijun Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University XueYuan Road No. 37 Beijing100191 China China Automotive Technology and Research Center Automotive Engineering Research Institute East Xianfeng Road No. 68 Tianjin300300 China School of Computer and Communication Engineering University of Science and Technology Beijing XueYuan Road No. 30 Beijing100083 China Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University XueYuan Road No. 37 Beijing100191 China Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies Si Pai Lou. 2 Nanjing210096 China Key Lab of Urban ITS Technology Optimization and Integration The Ministry of Public Security of China Hefei230088 China

ISBN: (纸本)9783319728223

Vehicular Ad-Hoc network (VANET) has emerged as an increasingly dominant technology for future connected vehicle and vehicular networks, where the focus of the development of VANET lies in the standardization of message transmission and dissemination via multi-hop broadcasting. However, the current communication protocols concerning VANET face many challenges, including data flooding and collision, transmission delay and other problems. Most of the challenges are closely related to next-hop selection. Therefore, this paper proposes a new routing protocol named REliable and Fast Forwarding (REFF) to optimize the selection of nodes in VANET. In this protocol, node filtering and node evaluation are two main steps. Distance between previous node and candidate node, relative velocity between previous node and candidate nodes, included angle between direction of target node’s velocity and candidate node’s velocity and transmission power of candidate node are adopted as indexes to help select a specific node as the next hop using Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS). By using this technique, the number of candidates as next-hop is largely reduced, avoiding the data flooding and resulting transmission relay. In addition, simulations based on experiments are done to verify the feasibility. The results show that message achieves a faster and more reliable transmission using REFF. © 2018, ICST Institute for Computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Vehicular ad hoc networks

Modeling and Simulation on Cooperative Movement of Vehicle Group Based on the Behavior of Fish 1st

学校读者我要写书评

暂无评论

Modeling and Simulation on Cooperative Movement of Vehicle G...

1st International Conference on 5G for Future Wireless networks, 5GWN 2017

作者： Tian, Daxin Kang, Lu Zheng, Kunxian Duan, Xuting Rong, Hui Guo, Peng Wang, Wenyang Zhang, Haijun Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University XueYuan Road No.37 Beijing100191 China China Automotive Technology and Research Center Automotive Engineering Research Institute East Xianfeng Road No.68 Tianjin300300 China School of Computer and Communication Engineering University of Science and Technology Beijing XueYuan Road No.30 Beijing100083 China Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University XueYuan Road No.37 Beijing100191 China Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies Si Pai Lou. 2 Nanjing210096 China Key Lab of Urban ITS Technology Optimization and Integration The Ministry of Public Security of China Hefei230088 China

ISBN: (纸本)9783319728223

Fatigue driving might affect the traffic safety when the vehicles are on the cruising state in highway. Trying to solve this problem, this paper uses the movement pattern of the fish to the vehicles fleet, and develops a model of vehicle group with realistic restrictions based on the existed fish algorithms, the mobile behavioral model and cluster behavior model, and then demonstrates the feasibility of applying the fish behavior to the cooperative movement of vehicle groups through analyzing the trajectory, velocity and spacing of vehicles. © 2018, ICST Institute for Computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Vehicles

Reconfigurable vortex beam generator based on the Fourier transformation principle

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Liu, Aiping Zou, Chang-Lin Ren, Xifeng He, Wen Wu, Mengze Guo, Guangcan Wang, Qin Affiliation: Institute of Quantum Information and Technology Nanjing University of Posts and Telecommunications Nanjing210003 Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Nanjing210003 Synergetic Innovation Center of Quantum Information and Quantum Physics University of Science and Technology of China Hefei230026 China

A method to generate the optical vortex beam with arbitrary superposition of different orders of orbital angular momentum (OAM) on a photonic chip is proposed. The distributed Fourier holographic gratings are proposed to convert the propagating wave in waveguides to a vortex beam in the free space, and the components of different OAMs can be controlled by the amplitude and phases of on-chip incident light based on the principle of Fourier transformation. As an example, we studied a typical device composed of nine Fourier holographic gratings on fan-shaped waveguides. By scalar diffraction calculation, the OAM of the optical beam from the reconfigurable vortex beam generator can be controlled on-demand from ?2nd to 2nd by adjusting the phase of input light fields, which is demonstrated numerically with the fidelity of generated optical vortex beam above 0.69. The working bandwidth of the Fourier holographic grating is about 80 nm with a fidelity above 0.6. Our work provides an feasible method to manipulate the vortex beam or detect arbitrary superposition of OAMs, which can be used in integrated photonics structures for optical trapping, signal processing, and imaging. Copyright © 2018, The Authors. All rights reserved.

关键词： Incident light

A matrix-based implementation of DE algorithm: The compensation and deficiency 30th

学校读者我要写书评

暂无评论

A matrix-based implementation of DE algorithm: The compensat...

30th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, IEA/AIE 2017

作者： Pan, Jeng-Shyang Meng, Zhenyu Xu, Huarong Li, Xiaoqing Fujian Provincial Key Lab of Big Data Mining and Applications Fujian University of Technology Fuzhou China Department of Computer Science and Technology Harbin Institute of Technology Shenzhen Graduate School Shenzhen China Department of Computer Science and Technology Xiamen University of Technology Xiamen China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China

ISBN: (纸本)9783319600413

Differential Evolution has become a very popular continuous optimization algorithm since its inception as its simplicity, easy coding and good performance over kinds of optimization problems. Difference operator in donor vector calculation is the key feature of DE algorithm. Usually, base vector and difference vectors selection in calculating a donor usually cost extra lines of condition judgement. Moreover, these vectors are not equally selected from the individual population. These lead to more perturbation in optimization performance. To tackling this disadvantage of DE implementation, a matrix-based implementation of DE algorithm is advanced herein this paper. Three commonly used DE implementation approaches in literature are also presented and contrasted. CEC2013 test suites for real-parameter optimization are used as the test-beds for these comparison. Experiment results show that the proposed matrix-based implementation of DE algorithm performs better on optimization performance than the common implementation schemes of DE algorithm with similar time complexity. © Springer International Publishing AG 2017.

关键词： Global optimization

HoloScope: Topology-and-Spike Aware Fraud Detection

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Liu, Shenghua Hooi, Bryan Faloutsos, Christos CAS Key Laboratory of Network Data Science & Technology Institute of Computing Technology Chinese Academy of Sciences Carnegie Mellon University

As online fraudsters invest more resources, including purchasing large pools of fake user accounts and dedicated IPs, fraudulent attacks become less obvious and their detection becomes increasingly challenging. Existing approaches such as average degree maximization suffer from the bias of including more nodes than necessary, resulting in lower accuracy and increased need for manual verification. Hence, we propose HoloScope, which uses information from graph topology and temporal spikes to more accurately detect groups of fraudulent users. In terms of graph topology, we introduce "contrast suspiciousness," a dynamic weighting approach, which allows us to more accurately detect fraudulent blocks, particularly low-density blocks. In terms of temporal spikes, HoloScope takes into account the sudden bursts and drops of fraudsters’ attacking patterns. In addition, we provide theoretical bounds for how much this increases the time cost needed for fraudsters to conduct adversarial attacks. Additionally, from the perspective of ratings, HoloScope incorporates the deviation of rating scores in order to catch fraudsters more accurately. Moreover, HoloScope has a concise framework and sub-quadratic time complexity, making the algorithm reproducible and scalable. Extensive experiments showed that HoloScope achieved significant accuracy improvements on synthetic and real data, compared with state-of-the-art fraud detection methods. Copyright © 2017, The Authors. All rights reserved.

关键词： Drops

Marked temporal dynamics modeling based on recurrent neural network

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Wang, Yongqing Liu, Shenghua Shen, Huawei Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

We are now witnessing the increasing availability of event stream data, i.e., a sequence of events with each event typically being denoted by the time it occurs and its mark information (e.g., event type). A fundamental problem is to model and predict such kind of marked temporal dynamics, i.e., when the next event will take place and what its mark will be. Existing methods either predict only the mark or the time of the next event, or predict both of them, yet separately. Indeed, in marked temporal dynamics, the time and the mark of the next event are highly dependent on each other, requiring a method that could simultaneously predict both of them. To tackle this problem, in this paper, we propose to model marked temporal dynamics by using a mark-specific intensity function to explicitly capture the dependency between the mark and the time of the next event. Extensive experiments on two datasets demonstrate that the proposed method outperforms state-of-the-art methods at predicting marked temporal dynamics. Copyright © 2017, The Authors. All rights reserved.

关键词： Forecasting

Locally smoothed neural networks

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Pang, Liang Lan, Yanyan Xu, Jun Guo, Jiafeng Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Convolutional Neural networks (CNN) and the locally connected layer are limited in capturing the importance and relations of different local receptive fields, which are often crucial for tasks such as face verification, visual question answering, and word sequence prediction. To tackle the issue, we propose a novel locally smoothed neural network (LSNN) in this paper. The main idea is to represent the weight matrix of the locally connected layer as the product of the kernel and the smoother, where the kernel is shared over different local receptive fields, and the smoother is for determining the importance and relations of different local receptive fields. Specifically, a multi-variate Gaussian function is utilized to generate the smoother, for modeling the location relations among different local receptive fields. Furthermore, the content information can also be leveraged by setting the mean and precision of the Gaussian function according to the content. Experiments on some variant of MNIST clearly show our advantages over CNN and locally connected layer. Copyright © 2017, The Authors. All rights reserved.

关键词： Convolution

Rectangle transformation problem

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Wang, Shaojiang He, Kun Pan, Yicheng Xia, Mingji State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences

In this paper, we propose the rectangle transformation problem (RTP) and its variants. RTP asks for a transformation by a rectangle partition between two rectangles of the same area. We are interested in the minimum RTP which requires to minimize the partition size. We mainly focus on the strict rectangle transformation problem (SRTP) in which rotation is not allowed in transforming. We show that SRTP has no finite solution if the ratio of the two parallel side lengths of input rectangles is irrational. So we turn to its complement denoted by SIRTP, in which case all side lengths can be assumed integral. We give a polynomial time algorithm ALGSIRTP which gives a solution at most q/p + O(√p) to SIRTP(p,q)(q ≥ p), where p and q are two integer side lengths of input rectangles p×q and q×p, and so ALGSIRTP is a O(√p)-approximation algorithm for minimum SIRTP(p,q). On the other hand, we show that there is not constant solution to SIRTP(p,q) for all integers p and q (q > p) even though the ratio q/p is within any constant range. We also raise a series of open questions for the research along this line. Copyright © 2017, The Authors. All rights reserved.

关键词： Polynomial approximation

Frequency synchronization for uplink massive MIMO with adaptive MUI suppression in angle-domain

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Ge, Yinghao Zhang, Weile Gao, Feifei Li, Geoffrey Ye MOE Key Lab for Intelligent Networks and Network Security School of Electronic and Information Engineering Xi'an Jiaotong University Xi'an Shaanxi710049 China State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Automation Tsinghua University Beijing100084 China Department of Electrical and Computer Engineering Georgia Institute of Technology AtlantaGA30332 United States

In this paper, we develop a novel angle-domain adaptive filtering (ADAF)-based frequency synchronization method for the uplink of a massive multiple-input multiple-output (MIMO) multiuser network, which is applicable for users with either separate or overlapped angle-of-arrival (AoA) regions. For each user, we first introduce the angle-constraining matrix (ACM), which consists of a set of selected match-filter (MF) beamformers pointing to the AoAs of the interested user. Then, the adaptive beamformer can be acquired by appropriately designing the ADAF vectors. Such beamformer can achieve two-stage adaptive multiuser interference (MUI) suppression, i.e., inherently suppressing the MUI from non-overlapping users by ACM in the first stage and substantially mitigating the MUI from adjacent overlapping users by ADAF vector in the second stage. For both separate and mutually overlapping users, the carrier frequency offset (CFO) estimation and subsequent data detection can be performed independently for each user, which significantly reduces computational complexity. Moreover, ADAF is rather robust to imperfect AoA knowledge and side cluster of scatterers, making itself promising for multiuser uplink transmission. We also analyze the performance of CFO estimation and obtain an approximated closed-form expression of mean-squared error (MSE). The effectiveness of the proposed method and its superiority over the existing methods are demonstrated by numerical results. Copyright © 2018, The Authors. All rights reserved.

关键词： Adaptive filters