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

Ontology-based metadata matching for emergency decision-making using MapReduce

International Journal of Metadata, Semantics and Ontologies 2015年第2期10卷 75-83页

作者： Zhu, Li Hu, Wei School of Economics and Management Nanjing University of Information Science and Technology Nanjing Jiangsu210044 China State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing Jiangsu210023 China

Ontology matching techniques can help improve the accuracy of emergency decisionmaking on heterogeneous data. In this paper, we propose a practical approach to leverage ontology and MapReduce for matching metadata of emergency supplies. We use this approach in the domain of emergency food. Specifically, by extending the AGROVOC ontology developed by the Food and Agriculture Organisation (FAO) of United Nations, ontological descriptions of food metadata are established. Then, based on the classification of emergency functionality, the instances of food metadata within the same category are matched in a two-stage TF-IDF fashion, which is further improved with the MapReduce framework for efficient parallel computation. Our experiments on grain, meat and milk metadata retrieved from several e-commerce websites demonstrate the good performance of the proposed approach. Additionally, case study is provided to illustrate the potential use of our approach. © 2015 Inderscience Enterprises Ltd.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Detection, classification and characterization of android malware using API data dependency 11th

Detection, classification and characterization of android ma...

引用

11th International Conference Security and Privacy in Communication Networks, SecureComm 2015

作者： Li, Yongfeng Shen, Tong Sun, Xin Pan, Xuerui Mao, Bing State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9783319288642

With the popularity of Android devices, more and more Android malware are manufactured every year. How to filter out malicious app is a serious problem for app markets. In this paper, we propose DroidADDMiner, an efficient and precise system to detect, classify and characterize Android malware. DroidADDMiner is a machine learning based system that extracts features based on data dependency between sensitive APIs. It extracts API data dependence paths embedded in app to construct feature vectors for machine learning. While DroidSIFT [13] also attempts automated detection of Android applications according to data flow analysis, DroidADDMiner can not only reduce the run time but also characterize malware’s behaviors automatically. We implement DroidADDMiner based on FlowDroid [14] and evaluate it using 5648 malware samples and 14280 benign apps. Experiments show that, for malware detection, DroidADDMiner achieves a 98% detection rate, with a 0.3% false positive rate. For malware classification, the accuracy of classifying malicious apps under their proper family labels is 96%. Although performing data flow analysis, most of the experimental samples can be examined in 60 seconds. © Institute for computer sciences, Social Informatics and Telecommunications Engineering 2015.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

Parallel surface reconstruction on GPU 15

Parallel surface reconstruction on GPU

引用

7th International Conference on Internet Multimedia Computing and Service, ICIMCS 2015

作者： Gao, Heng Tang, Jie Wu, Gangshan State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9781450335287

Marching Cubes is the most frequently used method to reconstruct isosurface from a point cloud. However, the point clouds are getting denser and denser, thus the efficiency of Marching cubes method has become an obstacle. This paper presents a novel GPU-based parallel surface reconstruction algorithm. The algorithm firstly creates a GPU-based uniform grid structure to manage point cloud. Then directed distances from vertices of cubes to the point cloud are computed in a newly put forwarded parallel way. Finally, after the generation of triangles, a space indexing scheme is adopted to reconstruct the connectivity of the resulted surface. The results show that our algorithm can run more than 10 times faster compared to the CPU-based implementations. © 2015 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Top-k queries for multi-category RFID systems

Top-k queries for multi-category RFID systems

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Xiulong Liu Keqiu Li Jie Wu Alex X. Liu Xin Xie Chunsheng Zhu Weilian Xue School of Computer Science and Technology Dalian University of Technology China Department of Computer and Information Sciences Temple University USA State Key Laboratory for Novel Software Technology Nanjing University China Department of Electrical and Computer Engineering The University of British Columbia Canada School of Management Liaoning Normal University China

ISBN: (纸本)9781467399548

This paper studies the practically important problem of top-k queries, which is to find the top k largest categories and their corresponding sizes. In this paper, we propose a Top-k Query (TKQ) protocol and a technique that we call Segmented Perfect Hashing (SPH) for optimizing TKQ. Specifically, TKQ is based on the framed slotted Aloha protocol. Each tag responds to the reader with a Single-One Geometric (SOG) string using the ON-OFF keying modulation. TKQ leverages the length of continuous leading 1s in the combined signal to estimate the corresponding category size. TKQ can quickly eliminate the sufficiently small categories, and only needs to focus on a limited number of large-size categories that require more accurate estimation. We conduct rigorous analysis to guarantee the predefined accuracy constraints. To further improve time-efficiency, we propose the SPH scheme, which improves the average frame utilization of TKQ from 36.8% to nearly 100% by establishing a bijective mapping between tag categories and slots. To minimize the overall time cost, we optimize the key parameter that trades off between communication cost and computation cost. Experimental results show that our TKQ+SPH protocol not only achieves the required accuracy constraints, but also achieves a 2.6~7x faster speed than the existing protocols.

关键词： Protocols Radiofrequency identification Estimation computers Servers Sociology Statistics

来源：评论

学校读者我要写书评

暂无评论

A study on key technologies of unmanned driving

引用

CAAI Transactions on Intelligence technology 2016年第1期1卷 4-13页

作者： Xinyu Zhang Hongbo Gao Mu Guo Guopeng Li Yuchao Liu Deyi Li Department of Computer Science and Technology Tsinghua University Beijing 100084 China Information Technology Center Tsinghua University Beijing 100084 China State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China The Institute of Electronic System Engineering Beijing 100039 China

Although the development of machine intelligence is far from simulating all the cognitive competence of our brains, still it is absolutely possible to peel the driving activity from people＇s cognitive activities and then make the machine finish some low-level, complicated and lasting driving cognition by simulating our brains. The goal of driving is to replace drivers and free them from boring driving activities. Based on some studies on unmanned driving, this paper summarizes and analyzes the background, significance, research status and key technology of unmanned driving and the research group also introduces some research on brain cognition of driving and sensor placement of intelligent vehicles, which offers more meaningful reference to push the study of unmanned driving.

关键词： Unmanned driving Brain cognition of driving Sensor placement Formalization of brain cognition

来源：评论

学校读者我要写书评

暂无评论

Constructing Edge-Colored Graph for Heterogeneous Networks

引用

Journal of computer science & technology 2015年第5期30卷 1154-1160页

作者：侯睿武继刚陈亚文张海波隋秀峰 School of Computer Science and Software Engineering Tianjin Polytechnic University Tianjin 300387 China State Key Laboratory of Computer Architecture~ Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Department of Computer Science University of Otago Dunedin 9054 New Zealand

In order to build a fault-tolerant network, heterogeneous facilities are arranged in the network to prevent homogeneous faults from causing serious damage. This paper uses edge-colored graph to investigate the features of a network topology which is survivable after a set of homogeneous devices malfunction. We propose an approach to designing such networks under arbitrary parameters. We also show that the proposed approach can be used to optimize inter-router connections in network-on-chip to reduce the additional consum!otion of energy and time delay.

关键词： network reliability homogeneous fault fault tolerance reconfigurable system network-on-chip

来源：评论

学校读者我要写书评

暂无评论

A P system for degree-constrained spanning tree

引用

Journal of Computational and Theoretical Nanoscience 2016年第6期13卷 3918-3925页

作者： Guo, Ping Zhong, Yuwen Chen, Haizhu Zhou, Mingqiang College of Computer Science Chongqing University Chongqing400030 China Department of Software Engineering Chongqing College of Electronic Engineering Chongqing401331 China Chongqing Key Laboratory of Software Theory and Technology Chongqing400044 China

Degree-constrained spanning tree problem (DCSTP for short) is a kind of classical NP complete problems, and it is widely used in the fields of distribution network planning, mobile services etc. Finding all spanning trees with the maximum degree is limited to k is called All-DCSTP problem. At present, the algorithms to solve the degree-constrained minimum spanning tree problem are more common, and they can find out all satisfying spanning trees. In this paper, we propose a method to determine a spanning tree and design a P system to solve All-DCSTP problem based on this method. Our work provides a new and effective method to solve All-DCSTP problem in a distributed and parallel manner. Copyright © 2016 American Scientific Publishers. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A system-of-systems architecture-driven modeling method for combat system effectiveness simulation 2

A system-of-systems architecture-driven modeling method for ...

引用

2nd Annual IEEE International Symposium on Systems Engineering, ISSE 2016

作者： Li, Xiaobo Wang, Weiping Shu, Zhe Zhu, Ning He, Hua Liao, Tianjun College of Information Systems and Management National University of Defense Technology Changsha Hunan410073 China Department of Mathematics and Computer Science University of Antwerp Antwerp2020 Belgium State Key Laboratory of Complex System Simulation Beijing Institute of Systems Engineering Beijing China

ISBN: (纸本)9781509007936

Under the background of system-of-systems (SoS) counterwork, it is more apparent that the simulation modeling of the equipment should be domain-specific, formal, automatic and composable. Current equipment effectiveness simulation modeling approaches are mainly based on the methods and techniques from the modeling and simulation (M&S) community and software engineering community, and they are not capable to satisfy these four requirements systematically. Thus the systems engineering architecture model and domain knowledge should be used to support effectiveness simulation modeling more effectively. In this research, we propose an architecture-driven modeling method which conforms to the principle of architecture-driven development, uses ontology techniques to build equipment SoS architecture model and sub-domain ontology. This method performs architecture driven simulation modeling to realize the transformation from architecture models to simulation model frameworks;employs ontological metamodeling to design domain-specific modeling languages (DSML) based on the comprehensive usage of architecture models, sub-domain ontologies and M&S formalisms;integrates domain-specific simulation models from various domains using the model framework, and supports the composable development of simulation applications. © 2016 IEEE.

关键词： System of systems

来源：评论

学校读者我要写书评

暂无评论

Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient 33

Tracking slowly moving clairvoyant: Optimal dynamic regret o...

引用

33rd International Conference on Machine Learning, ICML 2016

作者： Yang, Tianbao Zhang, Lijun Jin, Rong Yi, Jinfeng Department of Computer Science University of Iowa Iowa CityIA52242 United States National Key Laboratory for Novel Software Technology Nanjing University Nanjing China Institute of Data Science and Technologies Alibaba Group Seattle United States IBM Thomas J. Watson Research Center Yorktown HeightsNY10598 United States

ISBN: (纸本)9781510829008

This work focuses on dynamic regret of online convex optimization that compares the performance of online learning to a clairvoyant who knows the sequence of loss functions in advance and hence selects the minimizer of the loss function at each step. By assuming that the clairvoyant moves slowly (i.e., the minimizers change slowly), we present several improved variationbased upper bounds of the dynamic regret under the true and noisy gradient feedback, which are optimal in light of the presented lower bounds. The key to our analysis is to explore a regularity metric that measures the temporal changes in the clairvoyant's minimizers, to which we refer as path variation. Firstly, we present a general lower bound in terms of the path variation, and then show that under full information or gradient feedback we are able to achieve an optimal dynamic regret. Secondly, we present a lower bound with noisy gradient feedback and then show that we can achieve optimal dynamic regrets under a stochastic gradient feedback and two-point bandit feedback. Moreover, for a sequence of smooth loss functions that admit a small variation in the gradients, our dynamic regret under the two-point bandit feedback matches what is achieved with full information.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

A sample weighted sparse representation approach to image classification

引用

ICIC Express Letters, Part B: Applications 2016年第11期7卷 2283-2290页

作者： Wang, Yongxin Zhang, Huaxiang Department of Computer Science Shandong Normal University China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology No. 88 Wenhua East Road Lixia District Jinan250014 China

Sparse representation for classification (SRC) has achieved a big success for face recognition. It utilizes a sparsely linear combination of the training samples to construct a test sample, and classifies the test sample based on the reconstruction error associated with each class. Since SRC weights each training sample equally important, which may not hold for real applications, we propose a novel sample weighted sparse representation classification approach (SWSRC) by weighting each training sample differently. We first employ the representation ability of each training sample to construct a weight matrix and then solve a weighted l1minimization problem to obtain the sparse reconstruction coefficients. Experimental results on AR, YaleB and USPS image datasets demonstrate its effectiveness. © 2016 ICIC International.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：