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

作者： Xu, Xiaolong Dou, Wanchun Zhang, Xuyun Hu, Chunhua Chen, Jinjun State Key Laboratory for Novel Software Technology Nanjing University China Faculty of Engineering and IT University of Technology Sydney NSW 2007 Australia Department of Computer Science and Technology Nanjing University China Machine Learning Research Group NICTA Victoria Australia School of Computer and Information Engineering Hunan University of Commerce China

Traffic hotline discovery is necessary for rational and scientific urban transportation planning in the new living quarters and economic zones. Cloud of Things (CoT) is a newly emerging concept, involving with two advanced technologies, that is, Cloud Computing and Internet of Things (IoT). CoT provides promising opportunities for traffic hotline discovery. However, it is still a challenge to discover the traffic hotlines over CoT. In view of this challenge, a hotline discovery method over CoT by using big taxi GPS data is proposed in this paper. Specifically, a traffic hotline discovery principle is presented to provide a reference standard for the generalized traffic spots that need planning, and a corresponding hotline discovery method is proposed for traffic hotspot identification and hotline selection. To improve the scalability and efficiency of the proposed method in "Big Data" environment, the SAP HANA cloud is applied to implement the proposed method under two application scenarios. Finally, the experimental results demonstrate that the proposed method is both effective and efficient. software—Practice and Experience. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Taxicabs

来源：评论

学校读者我要写书评

暂无评论

Reverse Furthest Neighbors Query in Road Networks

引用

Journal of computer science & technology 2017年第1期32卷 155-167页

作者： Xiao-Jun Xu Jin-Song Bao Bin Yao Jing-Yu Zhou Fei-Long Tang Min-Yi Guo Jian-Qiu Xu School of Software Beijing Institute of Technology Beijing 100081 China First Research Institute of Ministry of Public Security Beijing 100048 China College of Mechanical Engineering Donghua University Shanghai 200051 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai 200240 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China

Given a road network G = （V, E）, where V（E） denotes the set of vertices（edges） in G, a set of points of interest P and a query point q residing in G, the reverse furthest neighbors （RFNR） query in road networks fetches a set of points p ∈ P that take q as their furthest neighbor compared with all points in P ∪ {q}. This is the monochromatic RFNR （MRFNR） query. Another interesting version of RFNR query is the bichromatic reverse furthest neighbor （BRFNR） query. Given two sets of points P and Q, and a query point q ∈ Q, a BRFNR query fetches a set of points p ∈ P that take q as their furthest neighbor compared with all points in Q. This paper presents efficient algorithms for both MRFNR and BRFNR queries, which utilize landmarks and partitioning-based techniques. Experiments on real datasets confirm the efficiency and scalability of proposed algorithms.

关键词： reverse furthest neighbor road network landmark hierarchical partition

来源：评论

学校读者我要写书评

暂无评论

GRID: A Student Project to Monitor the Transient Gamma-Ray Sky in the Multi-Messenger Astronomy Era

arXiv

引用

arXiv 2019年

作者： Wen, Jiaxing Long, Xiangyun Zheng, Xutao An, Yu Cai, Zhengyang Cang, Jirong Che, Yuepeng Chen, Changyu Chen, Liangjun Chen, Qianjun Chen, Ziyun Cheng, Yingjie Deng, Litao Deng, Wei Ding, Wenqing Du, Hangci Duan, Lian Gan, Quan Gao, Tai Gao, Zhiying Han, Wenbin Han, Yiying He, Xinbo He, Xinhao Hou, Long Hu, Fan Hu, Junling Huang, Bo Huang, Dongyang Huang, Xuefeng Jia, Shihai Jiang, Yuchen Jin, Yifei Li, Ke Li, Siyao Li, Yurong Liang, Jianwei Liang, Yuanyuan Lin, Wei Liu, Chang Liu, Gang Liu, Mengyuan Liu, Rui Liu, Tianyu Liu, Wanqiang Lu, Di'an Lu, Peiyibin Lu, Zhiyong Luo, Xiyu Ma, Sizheng Ma, Yuanhang Mao, Xiaoqing Mo, Yanshan Nie, Qiyuan Qu, Shuiyin Shan, Xiaolong Shi, Gengyuan Song, Weiming Sun, Zhigang Tan, Xuelin Tang, Songsong Tao, Mingrui Wang, Boqin Wang, Yue Wang, Zhiang Wu, Qiaoya Wu, Xuanyi Xia, Yuehan Xiao, Hengyuan Xie, Wenjin Xu, Dacheng Xu, Rui Xu, Weili Yan, Longbiao Yan, Shengyu Yang, Dongxin Yang, Hang Yang, Haoguang Yang, Yi-Si Yang, Yifan Yao, Lei Yu, Huan Yu, Yangyi Zhang, Aiqiang Zhang, Bingtao Zhang, Lixuan Zhang, Maoxing Zhang, Shen Zhang, Tianliang Zhang, Yuchong Zhao, Qianru Zhao, Ruining Zheng, Shiyu Zhou, Xiaolong Zhu, Runyu Zou, Yu An, Peng Cai, Yifu Chen, Hongbing Dai, Zigao Fan, Yizhong Feng, Changqing Feng, Hua Gao, He Huang, Liang Kang, Mingming Li, Lixin Li, Zhuo Liang, Enwei Lin, Lin Lin, Qianqian Liu, Congzhan Liu, Hongbang Liu, Xuewen Liu, Yinong Lu, Xiang Mao, Shude Shen, Rongfeng Shu, Jing Su, Meng Sun, Hui Tam, Pak-Hin Tang, Chi-Pui Tian, Yang Wang, Fayin Wang, Jianjun Wang, Wei Wang, Zhonghai Wu, Jianfeng Wu, Xuefeng Xiong, Shaolin Xu, Can Yu, Jiandong Yu, Wenfei Yu, Yunwei Zeng, Ming Zeng, Zhi Zhang, Bin-Bin Zhang, Bing Zhao, Zongqing Zhou, Rong Zhu, Zonghong Department of Engineering Physics Center for Astrophysics Tsinghua University Beijing100084 China Science and Technology on Plasma Physics Laboratory Laser Fusion Research Center Chinese Academy of Engineering Physics Mianyang621900 China Department of Physics Center for Astrophysics Tsinghua University Beijing100084 China Guangxi Key Laboratory for Relativistic Astrophysics Department of Physics Guangxi University NanningGuangxi530004 China School of Electronic and Information Engineering Ningbo University of Technology NingboZhejiang315211 China Department of Instruments Science & Engineering Shanghai Jiaotong University Shanghai200240 · China School of Materials Science & Chemical Engineering Ningbo University Ningbo315211 China School of Astronomy and Space Science Nanjing University NanjingJiangsu210093 China School of Aerospace Engineering Tsinghua University Beijing100084 China College of Physical Science and Technology Sichuan University Chengdu610065 China School of Physics and Astronomy Sun Yat-Sen University Zhuhai519082 China Department of Astronomy Xiamen University XiamenFujian361005 China School of Mathematics and Physics University of Science and Technology Beijing Beijing100083 China Department of Foreign Languages and Literatures Tsinghua University Beijing100084 China Department of Electrical Engineering Tsinghua University Beijing100084 China School of Software Tsinghua University Beijing100084 China Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo315211 China Department of Modern Physics School of Physical Sciences University of Science and Technology of China HefeiAnhui230026 China Department of Astronomy Beijing Normal University Beijing100875 China Department of Astronomy School of Physical Sciences University of Science and Technology of China HefeiAnhui230026 China Purple Mountain Observatory Chinese Academy of Sciences Nanjing210008 China Department of Astrono

The Gamma-Ray Integrated Detectors (GRID) is a space mission concept dedicated to monitoring the transient gamma-ray sky in the energy range from 10 keV to 2 MeV using scintillation detectors onboard CubeSats in low Earth orbits. The primary targets of GRID are the gamma-ray bursts (GRBs) in the local universe. The scientific goal of GRID is, in synergy with ground-based gravitational wave (GW) detectors such as LIGO and VIRGO, to accumulate a sample of GRBs associated with the merger of two compact stars and study jets and related physics of those objects. It also involves observing and studying other gamma-ray transients such as long GRBs, soft gamma-ray repeaters, terrestrial gamma-ray flashes, and solar flares. With multiple CubeSats in various orbits, GRID is unaffected by the Earth occultation and serves as a full-time and all-sky monitor. Assuming a horizon of 200 Mpc for ground-based GW detectors, we expect to see a few associated GW-GRB events per year. With about 10 CubeSats in operation, GRID is capable of localizing a faint GRB like 170817A with a 90% error radius of about 10 degrees, through triangulation and flux modulation. GRID is proposed and developed by students, with considerable contribution from undergraduate students, and will remain operated as a student project in the future. The current GRID collaboration involves more than 20 institutes and keeps growing. On August 29th, the first GRID detector onboard a CubeSat was launched into a Sun-synchronous orbit and is currently under test. Copyright © 2019, The Authors. All rights reserved.

关键词： Gravity waves

来源：评论

学校读者我要写书评

暂无评论

Outlier Detection for Distributed Services using Multi-Frequency Patterns

Outlier Detection for Distributed Services using Multi-Frequ...

引用

International Conference on Network and Service Management

作者： Lu Xu Zhongzhi Luan Carol J Fung Guang Wei Depei Quian Sino-German Joint Software Institute Beihang University Beijing China Computer Science Department Virginia Commonwealth University Richmond USA Beijing municipal key laboratory of network technology Beihang University Beihang University Beijing China

ISBN: (纸本)9781538691939;9783903176140

Outlier detection has been commonly used in large scale distributed systems to detect abnormalities and service failures. Traditional abnormality detection methods are mostly based on statistical analysis or simple thresholds to detect outliers. However, those solutions do not consider the periodic patterns of data which is a common feature in many systems due to users' repetitive activities on a daily basis. In our work, we investigate a method that can significantly improve the effectiveness of outliers detection through utilizing periodic patterns in the system data. To this purpose we use state-Frequency-Memory (SFM) Recurrent Neural Networks (RNN) to analyze the cyclical patterns of monitoring data and use cumulative sum (CUMSUM) to identify outliers. Our real data evaluation shows that our detection method can achieve 99% accuracy. Finally, our method also applies to many other fields, such as network traffic security monitoring, bank fraud detection, etc.

关键词： Machine-to-machine communications Voltage control

来源：评论

学校读者我要写书评

暂无评论

Applying H-index within 5-year Citations Window

Applying H-index within 5-year Citations Window

引用

2017 IEEE 8th International Conference on software Engineering and Service science

作者： Chuanqi Wang Yanhui Li State Key Laboratory for Novel Software Technology Nanjing University Department of Computer Science and Technology Nanjing University

There are a number of indexes proposed in many studies to evaluate the quality of journals. Among them, H-index is a recently proposed index as a useful supplement to journal impact ***, current H-index is based on long journal *** changes of citations of journals are often ignored by H-index. In this paper, we propose 5-year H-index to solve this problem. 5-year H-index evaluates the immediate citation performance(in this year) of a journal's papers published in the last 5 years. We can measure journals by the recent citations with 5-year H-index, which can be a new way to determine the value of journals.

关键词： Applying H-index within 5-year Citations Window

来源：评论

学校读者我要写书评

暂无评论

Does manual delineation only provide the side information in CT prostate segmentation? 20th

Does manual delineation only provide the side information in...

引用

20th International Conference on Medical Image Computing and computer-Assisted Intervention, MICCAI 2017

作者： Shi, Yinghuan Yang, Wanqi Gao, Yang Shen, Dinggang State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Computer Science Nanjing Normal University Nanjing China Department of Radiology and BRIC UNC Chapel Hill Chapel Hill United States

ISBN: (纸本)9783319661780

Prostate segmentation, for accurate prostate localization in CT images, is regarded as a crucial yet challenging task. Nevertheless, due to the inevitable factors (e.g., low contrast, large appearance and shape changes), the most important problem is how to learn the informative feature representation to distinguish the prostate from non-prostate regions. We address this challenging feature learning by leveraging the manual delineation as guidance: the manual delineation does not only indicate the category of patches, but also helps enhance the appearance of prostate. This is realized by the proposed cascaded deep domain adaptation (CDDA) model. Specifically, CDDA constructs several consecutive source domains by employing a mask of manual delineation to overlay on the original CT images with different mask ratios. Upon these source domains, convnet will guide better transferrable feature learning until to the target domain. Particularly, we implement two typical methods: patch-to-scalar (CDDA-CNN) and patch-to-patch (CDDA-FCN). Also, we theoretically analyze the generalization error bound of CDDA. Experimental results show the promising results of our method. © Springer International Publishing AG 2017.

关键词： computerized tomography

来源：评论

学校读者我要写书评

暂无评论

Notice of Removal: An Internet Application-Driven Cache Placement Algorithm for software-Defined Information-Centric Networking

Notice of Removal: An Internet Application-Driven Cache Plac...

引用

International computers, Signals and Systems Conference (ICOMSSC)

作者： Jing Liu Ziwei Hu Jinghong Guo Hanyong Hao Department of Computer Science Tsinghua University Beijing China State Key Laboratory of Networking and Switching Technology Beijing University of Post and Telecommunication Beijing China Global Energy Interconnection Research Institute Beijing China State Grid Laboratory of Electric Power Communication Network Technology Beijing China State Grid Corporation of China Beijing China

Removed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An approach to the bio-inspired control of self-reconfigurable robots 1

引用

12th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2017

作者： Bie, Dongyang Gutiérrez-Naranjo, Miguel A. Zhao, Jie Zhu, Yanhe State Key Laboratory of Robotics and System Harbin Institute of Technology HarbinHeilongjiang China Department of Computer Science and Artificial Intelligence University of Seville Seville Spain

ISBN: (数字)9789811071799

ISBN: (纸本)9789811071782

Self-reconfigurable robots are robots built by modules which can move in relationship to each other. This ability of changing its physical form provides the robots a high level of adaptability and robustness. Given an initial configuration and a goal configuration of the robot, the problem of self-regulation consists on finding a sequence of module moves that will reconfigure the robot from the initial configuration to the goal configuration. In this paper, we use a bio-inspired method for studying this problem which combines a cluster-flow locomotion based on cellular automata together with a decentralized local representation of the spatial geometry based on membrane computing ideas. A promising 3D software simulation and a 2D hardware experiment are also presented. © Springer Nature Singapore Pte Ltd 2017.

关键词： Modular robots

来源：评论

学校读者我要写书评

暂无评论

Multiobjective optimization differential evolution enhanced with principle component analysis for constrained optimization

arXiv

引用

arXiv 2018年

作者： Huang, Wei Xu, Tao He, Jun Li, Kangshun Tianjin Key Laboratory of Intelligent and Novel Software Technology School of Computer Science and Engineering Tianjin University of Technology China Department of Computer Science Aberystwyth University AberystwythSY23 3DB United Kingdom School of Science and Technology Nottingham Trent University NottinghamNG11 8NS United Kingdom College of Mathematics and Informatics South China Agricultural University Guangzhou510642 China

Multiobjective optimization evolutionary algorithms have been successfully applied to solving constrained optimization problems. This paper proposes a new multiobjective optimization differential evolution algorithm for constrained optimization. Through a study of fitness landscapes using principle component analysis, we discover a statistic method of identifying the valley direction in a valley landscape. Based on this discovery, a new search operator called PCA-projection is constructed which projects an individual to a position along the valley direction. Then multiobjective optimization differential evolution using this projection operator is designed for constrained optimization. A comparative experiment has been implemented between the proposed algorithm and a state-of-the-art multiobjective differential evolution algorithm on a standard set of 24 benchmarks. Experimental results show that the new algorithm makes a significant improvement in terms of solution accuracy. The proposed algorithm is also competitive with ten evolutionary algorithms participated in an IEEE CEC 2006 competition and is ranked third in terms of the final rank. Copyright © 2018, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Advancing tabu and restart in local search for maximum weight cliques

arXiv

引用

arXiv 2018年

作者： Fan, Yi Li, Nan Li, Chengqian Ma, Zongjie Latecki, Longin Jan Su, Kaile Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China Department of Computer Science Jinan University Guangzhou China Institute for Integrated and Intelligent Systems Griffith University BrisbaneQLD Australia Department of Computer and Information Sciences Temple University PhiladelphiaPA United States Department of Computer Science Sun Yat-sen University Guangzhou China

The tabu and restart are two fundamental strategies for local search. In this paper, we improve the local search algorithms for solving the Maximum Weight Clique (MWC) problem by introducing new tabu and restart strategies. Both the tabu and restart strategies proposed are based on the notion of a local search scenario, which involves not only a candidate solution but also the tabu status and unlocking relationship. Compared to the strategy of configuration checking, our tabu mechanism discourages forming a cycle of unlocking operations. Our new restart strategy is based on the re-occurrence of a local search scenario instead of that of a candidate solution. Experimental results show that the resulting MWC solver outperforms several state-of-theart solvers on the DIMACS, BHOSLIB, and two benchmarks from practical applications. Copyright © 2018, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：