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

arXiv 2017年

作者： Zhang, Chenwei Du, Nan Fanz, Wei Li, Yaliang Lu, Chun-Ta Yu, Philip S. Department of Computer Science University of Illinois at Chicago ChicagoIL United States Baidu Research Big Data Lab SunnyvaleCA United States Tencent Medical Ai Lab Palo AltoCA United States Institute for Data Science Tsinghua University Beijing

The Internet has revolutionized healthcare by offering medical information ubiquitously to patients via web search. The healthcare status, complex medical information needs of patients are expressed diversely and implicitly in their medical text queries. Aiming to better capture a focused picture of user's medical-related information search and shed insights on their healthcare information access strategies, it is challenging yet rewarding to detect structured user intentions from their diversely expressed medical text queries. We introduce a graph-based formulation to explore structured concept transitions for effective user intent detection in medical queries, where each node represents a medical concept mention and each directed edge indicates a medical concept transition. A deep model based on multi-task learning is introduced to extract structured semantic transitions from user queries, where the model extracts word-level medical concept mentions as well as sentence-level concept transitions collectively. A customized graph-based mutual transfer loss function is designed to impose explicit constraints and further exploit the contribution of mentioning a medical concept word to the implication of a semantic transition. We observe an 8% relative improvement in AUC and 23% relative reduction in coverage error by comparing the proposed model with the best baseline model for the concept transition inference task on real-world medical text queries. Copyright © 2017, The Authors. All rights reserved.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Core maintenance in dynamic graphs: A parallel approach based on matching

arXiv

引用

arXiv 2017年

作者： Wang, Na Yu, Dongxiao Jin, Hai Hua, Qiang-Sheng Shi, Xuanhua Xie, Xia Services Computing Technology and System Lab Big Data Technology and System Lab Clusters and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

—The core number of a vertex is a basic index depicting cohesiveness of a graph, and has been widely used in large-scale graph analytics. In this paper, we study the update of core numbers of vertices in dynamic graphs with edge insertions/deletions, which is known as the core maintenance problem. Different from previous approaches that just focus on the case of single-edge insertion/deletion and sequentially handle the edges when multiple edges are inserted/deleted, we investigate the parallelism in the core maintenance procedure. Specifically, we show that if the inserted/deleted edges constitute a matching, the core number update with respect to each inserted/deleted edge can be handled in parallel. Based on this key observation, we propose parallel algorithms for core maintenance in both cases of edge insertions and deletions. We conduct extensive experiments to evaluate the efficiency, stability, parallelism and scalability of our algorithms on different types of real-world and synthetic graphs. Comparing with sequential approaches, our algorithms can improve the core maintenance efficiency significantly. Copyright © 2017, The Authors. All rights reserved.

关键词： Maintenance

来源：评论

学校读者我要写书评

暂无评论

Developing a Smart Service System to Enrich Bike Riders' Experience

Developing a Smart Service System to Enrich Bike Riders' Exp...

引用

2017 2nd International Conference on Software, Multimedia and Communication Engineering（SMCE 2017)

作者： Robin G.QIU Youakim Badr Jian-ling WANG Shan LI Big Data Lab Engineering DivisionPenn State University NUAA-IBM Logistics and Service Science Lab NUAA University of Lyon CNRSINSA-LyonLIRIS

Social sensing via mobile apps complements physical sensing(e.g.,Io T) by substantially extending the horizon we know about our daily life in real *** paper discusses how we can integrate physical and social sensing to enable better and smarter services,focusing on enriching riders' experience of using bike sharing services in New York *** show how we real time collect,process,and model data on riders' profiles and mobility needs,and from citibike and social *** the support of big data technologies,we conduct data integration and aggregation to develop a smart service system by focusing on meeting the needs of riders in real *** developed prototype in support of city mobility management and operations reveals the great potential of providing riders enriched user experience.

关键词： Social sensing big data IoT Smart city Citibike Rider biking experience

来源：评论

学校读者我要写书评

暂无评论

A bimodal network approach to model topic dynamics

arXiv

引用

arXiv 2017年

作者： Di Caro, Luigi Guerzoni, Marco Nuccio, Massimiliano Siragusa, Giovanni Despina Big Data Lab Department of Economics and Statistics Cognetti de Martiis University of Turin Italy Department of Computer Science University of Turin Italy

This paper presents an intertemporal bimodal network to analyze the evolution of the semantic content of a scientific field within the framework of topic modeling, namely using the Latent Dirichlet Allocation (LDA). The main contribution is the conceptualization of the topic dynamics and its formalization and codification into an algorithm. To benchmark the effectiveness of this approach, we propose three indexes which track the transformation of topics over time, their rate of birth and death, and the novelty of their content. Applying the LDA, we test the algorithm both on a controlled experiment and on a corpus of several thousands of scientific papers over a period of more than 100 years which account for the history of the economic thought. Copyright © 2017, The Authors. All rights reserved.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Robust frequent directions with application in online learning

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2019年第1期20卷

作者： Luo Luo Cheng Chen Zhihua Zhang Wu-Jun Li Tong Zhang Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China National Engineering Lab for Big Data Analysis and Applications School of Mathematical Sciences Peking University Beijing China National Key Laboratory for Novel Software Technology Collaborative Innovation Center of Novel Software Technology and Industrialization Department of Computer Science and Technology Nanjing University Nanjing China Computer Science & Mathematics Hong Kong University of Science and Technology Hong Kong

The frequent directions (FD) technique is a deterministic approach for online sketching that has many applications in machine learning. The conventional FD is a heuristic procedure that often outputs rank deficient matrices. To overcome the rank deficiency problem, we propose a new sketching strategy called robust frequent directions (RFD) by introducing a regularization term. RFD can be derived from an optimization problem. It updates the sketch matrix and the regularization term adaptively and jointly. RFD reduces the approximation error of FD without increasing the computational cost. We also apply RFD to online learning and propose an effective hyperparameter-free online Newton algorithm. We derive a regret bound for our online Newton algorithm based on RFD, which guarantees the robustness of the algorithm. The experimental studies demonstrate that the proposed method outperforms state-of-the-art second order online learning algorithms.

关键词： frequent directions matrix approximation online Newton algorithm online convex optimization sketching

来源：评论

学校读者我要写书评

暂无评论

A Novel Intrusion Detection System Based on Advanced Naive Bayesian Classification 1st

A Novel Intrusion Detection System Based on Advanced Naive B...

引用

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

作者： Wang, Yunpeng Li, Yuzhou Tian, Daxin Wang, Congyu Wang, Wenyang Hui, Rong Guo, Peng 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 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

Intrusion Detection System is a pattern recognition task whose aim is to detect and report the occurrence of abnormal or unknown network behaviors in a given network system being monitored. In this paper, we propose a machine learning model, advanced Naive Bayesian Classification (NBC-A) which is based on NBC and ReliefF algorithm, to be used in the novel IDS. We use ReliefF algorithm to give every attribute of network behavior in KDD’99 dataset a weight that reflects the relationship between attributes and final class for better classification results. The novel IDS has a higher True Positive (TP) rate and a lower False Positive (FP) rate in detection performance. © 2018, ICST Institute for Computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Fine-Grained Control-Flow Integrity Based on Points-to Analysis for CPS”

引用

Security and Communication Networks 2018年第1期2018卷

作者： Weizhong Qiang Shizhen Wang Hai Jin Jiangying Zhong Services Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Security Engineering Research Center School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 ***

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Vehicular Positioning Enhancement with Connected Vehicle Assistance Using Extended Kalman Filtering 1st

A Vehicular Positioning Enhancement with Connected Vehicle A...

引用

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

作者： Tian, Daxin Liu, Wenhao 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

In this paper, we consider the problem of vehicular positioning enhancement with emerging connected vehicles (CV) technologies. In order to actually describe the scenario, the Interacting Multiple Model (IMM) filter is used for depicting varies of observation models. A CV-enhanced IMM filtering approach is proposed to locate a vehicle by data fusion from both coarse GPS data and the Doppler frequency shifts (DFS) measured from dedicated short-range communications (DSRC) radio signals. Simulation results state the effectiveness of the proposed approach called CV-IMM-EKF. © 2018, ICST Institute for Computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Global positioning system

来源：评论

学校读者我要写书评

暂无评论

WISERNet: Wider Separate-then-reunion Network for Steganalysis of Color Images

arXiv

引用

arXiv 2018年

作者： Zeng, Jishen Tan, Shunquan Liu, Guangqing Li, Bin Huang, Jiwu Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Guangdong Key Lab. of Intelligent Info. Processing and Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen518060 China Peng Cheng Laboratory Shenzhen518052 China

Until recently, deep steganalyzers in spatial domain have been all designed for gray-scale images. In this paper, we propose WISERNet (the wider separate-then-reunion network) for steganalysis of color images. We provide theoretical rationale to claim that the summation in normal convolution is one sort of "linear collusion attack" which reserves strong correlated patterns while impairs uncorrelated noises. Therefore in the bottom convolutional layer which aims at suppressing correlated image contents, we adopt separate channel-wise convolution without summation instead. Conversely, in the upper convolutional layers we believe that the summation in normal convolution is beneficial. Therefore we adopt united normal convolution in those layers and make them remarkably wider to reinforce the effect of "linear collusion attack". As a result, our proposed wide-and-shallow, separate-then-reunion network structure is specifically suitable for color image steganalysis. We have conducted extensive experiments on color image datasets generated from BOSSBase raw images and another large-scale dataset which contains 100,000 raw images, with di_erent demosaicking algorithms and downsampling algorithms. The experimental results show that our proposed network outperforms other state-of-the-art color image steganalytic models either hand-crafted or learned using deep networks in the literature by a clear margin. Specifically, it is noted that the detection performance gain is achieved with less than half the complexity compared to the most advanced deeplearning steganalyzer as far as we know, which is scarce in the literature. Copyright © 2018, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：