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

Consumer Communications and networking Conference, CCNC IEEE

作者： Yongfeng Huang Yongqiang Dong Sanfeng Zhang Guoxin Wu Ministry of Education China Key Laboratory of Computer Network and Information Integration (Southeast University) Nanjing China

Social characteristics such as community and centrality have been used as forwarding metrics in literature to predict nodes encounter probability in mobile opportunistic networks. However, the community detection and centrality estimation based on cumulative contact does not take the lifetime of messages into consideration. By investigating the periodicity of social characteristics evolution, this paper presents a novel method to calculate the community and centrality metrics of nodes, in time scales of τ-window and time-to-live (TTL), respectively. Such metrics are then exploited in a proposed social-aware routing algorithm, PerEvo, to predict the encounter probability of nodes during the lifetime of the forwarded message. Extensive trace-driven simulation results show that PerEvo improves the message delivery ratio significantly, while keeping a comparable delivery overhead with the existing social-based routing schemes.

关键词： Communities Routing Mobile computing Mobile communication Measurement Estimation Aging

来源：评论

学校读者我要写书评

暂无评论

Mining semantically consistent patterns for cross-view data

引用

IEEE Transactions on Knowledge and Data Engineering 2014年第11期26卷 2745-2758页

作者： Zhang, Lei Zhao, Yao Zhu, Zhenfeng Wei, Shikui Wu, Xindong State Key Laboratory of Rail Traffic Control and Safety Beijing100044 China Institute of Information Science Beijing Jiaotong University Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China Department of Computer Science University of Vermont 33 Colchester Avenue BurlingtonVT05405 United States

In some real world applications, like information retrieval and data classification, we often are confronted with the situation that the same semantic concept can be expressed using different views with similar information. Thus, how to obtain a certain Semantically Consistent Patterns (SCP) for cross-view data, which embeds the complementary information from different views, is of great importance for those applications. However, the heterogeneity among cross-view representations brings a significant challenge on mining the SCP. In this paper, we propose a general framework to discover the SCP for cross-view data. Specifically, aiming at building a feature-isomorphic space among different views, a novel Isomorphic Relevant Redundant Transformation (IRRT) isfirst proposed. The IRRT linearly maps multiple heterogeneous low-level feature spaces to a high-dimensional redundantfeature-isomorphic one, which we name as mid-level space. Thus, much more complementary information from different views can be captured. Furthermore, to mine the semantic consistency among the isomorphic representations in the mid-level space, we propose a new Correlation-based Joint Feature Learning (CJFL) model to extract a unique high-level semantic subspace shared across the feature-isomorphic data. Consequently, the SCP for cross-view data can be obtained. Comprehensive experiments on three data sets demonstrate the advantages of our framework in classification and retrieval. © 1989-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

The green project of data management for industrial integration

International Journal of Database Theory and Application

引用

International Journal of Database Theory and Application 2015年第6期8卷 333-342页

作者： Tian, Yiming Zhu, keyu Pan, Ruoyu Liang, Changyong School of Computer and Information Hefei University of Technology Anhui Transport Interconnection Management Center Hefei China Institute of Computer Network Systems Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei China Key Technologies and Equipment of IOT of Highway Traffic Anhui Engineering Technology Research Center Hefei China

The green project fulfills the requests of industrial management and application by sharing data rather than isolating. The data center with energy-efficient equipment is correspondingly effective in industrial service, management and construction of information. This study suggests a green data center in the two-level framework as a basic factor in industrial integration with potent procedures. In the case of transportation, it processed validating data to resolve logistics and emergency operations. © 2015 SERSC.

关键词： information management

来源：评论

学校读者我要写书评

暂无评论

Adaptive multilevel meshes for cloth simulation

引用

Journal of information and Computational Science 2014年第11期11卷 3865-3872页

作者： Zhao, Jing Pei, Shanshan Lv, Mengya Li, Ying Tang, Yong Yang, Meiling Zhang, Mingmin Pan, Zhigeng The College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Qinhuangdao China The College of Computer Science and Technology Zhejiang University Hangzhou China Institute of Service Engineering Hangzhou Normal University Hangzhou China

A novel method based on multilevel meshes is proposed to simulate the cloth draping process rapidly on a complex model. Considering of the difficulty of computing the realtime collision between cloth and complex models by normally methods, the draping process of cloth is divided into several phases and at each phase the mesh size is smaller than its previous one. The optimized 1-to-4 split is used to drive the rapid changes in the grid hierarchy and to simplify the calculations. We choose the widely used ellipsoid as the bounding cell to enclose the complex models in the environment. The ellipsoid avoids the complex structure of hierarchical bounding box and eliminates the impossible collision model area rapidly. Experiments demonstrate that this method can accelerate the draping process of cloth and decrease the number of iterations and the calculation of collision detection. Further mesh refinement improves the reality of cloth when it reaches the final position and ensures the realism of the simulation in real time. ©2014 Binary information Press

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

ReCBuLC: Reproducing Concurrency Bugs Using Local Clocks 15

ReCBuLC: Reproducing Concurrency Bugs Using Local Clocks

引用

International Conference on Software Engineering (ICSE)

作者： Xiang Yuan Chenggang Wu Zhenjiang Wang Jianjun Li Pen-Chung Yew Jeff Huang Xiaobing Feng Yanyan Lan Yunji Chen Yong Guan University of Chinese Academy of Sciences Beijing China State Key Laboratory of Computer Architecture Chinese Academy of Sciences Beijing China Department of Computer Science and Engineering University of Minnesota at Twin-Cities Minneapolis USA Department of Computer Science and Engineering Texas A&M University Texas USA CAS Key Laboratory of Network Data Science and Technology Chinese Academy of Sciences Beijing China College of Information Engineering Capital Normal University Beijing China

ISBN: (纸本)9781479919345

Multi-threaded programs play an increasingly important role in current multi-core environments. Exposing concurrency bugs and debugging such multi-threaded programs have become quite challenging due to their inherent non-determinism. In order to eliminate such non-determinism, many approaches such as record-and-replay and other similar bug reproducing systems have been proposed. However, those approaches often suffer significant performance degradation because they require a large amount of recorded information and/or long analysis and replay time. In this paper, we propose an effective approach, ReCBuLC, to take advantage of the hardware clocks available on modern processors. The key idea is to reduce the recording overhead and analyzing events' global order by using time stamps recorded in each thread. Those timestamps are used to determine the global orders of shared accesses. To avoid the large overhead incurred in accessing system-wide global clock, we opt to use local per-core clocks that incur much less access overhead. We then propose techniques to resolve differences among local clocks and obtain an accurate global event order. By using per-core clocks, state-of-the-art bug reproducing systems such as PRES and CLAP can reduce the recording overheads by 1% ~ 85%, and the analysis time by 84.66% ~ 99.99%, respectively.

关键词： Clocks Program processors computer bugs Hardware Coherence Concurrent computing Debugging

来源：评论

学校读者我要写书评

暂无评论

An Energy-saving Algorithm for Wireless Sensor networks Based on network Coding and Compressed Sensing

引用

中国通信 2014年第S1期11卷 171-178页

作者： QIN Tuanfa MENG Yunfan LI Liangliang WAN Haibin ZHANG Dongmei School of Computer and Electronic Information Guangxi University Nanning 530004 China Guangxi Key Laboratory of Multimedia Communications and Network Technology Guangxi University Nanning 530004 China Information Security Center Beijing University of Posts and Telecommunications Beijing 100876 China National Engineering Laboratory for Disaster Backup and Recovery Beijing 100876 China

An energy-saving algorithm for wireless sensor networks based on network coding and compressed sensing (CS-NCES) is proposed in this paper. Along with considering the correlations of data spatial and temporal, the algorithm utilizes the similarities between the encoding matrix of network coding and the measurement matrix of compressed sensing. The source node firstly encodes the data, then compresses the coding data by compressed sensing over finite fields. Compared with the network coding scheme, simulation results show that CS-NCES reduces the energy consumption about 25.3%-34.5% and improves the efficiency of data reconstruction about 1.56%-5.98%. The proposed algorithm can not only enhance the usability of network coding in wireless sensor networks, but also improve the network performance.

关键词： wireless sensor networks network coding compressed sensing deterministic matrix network energy-efficiency

来源：评论

学校读者我要写书评

暂无评论

GenBank data management based on Hadoop

GenBank data management based on Hadoop

引用

2014 International Conference on computer, Intelligent Computing and Education Technology, CICET 2014

作者： Zhao, Y.L. Sun, Z.Q. Li, H.J. Xuan Yuan, S.S. Shandong Provincial Key Laboratory of Computer Network Shandong Computer Science Center Shandong Jinan China Shandong Academy of Information and Communication Technology Jinan China

ISBN: (纸本)9781138026391

GenBank is a most popular DNA sequence database founded by National Center for Biotechnology information. It is big and rapid growing. In order to make use of GenBank data efficiently, data management becomes more and more important. With the development of information science and technology, distributed computing plays a key role in many fields. Based on Hadoop (a famous distributed computing framework), we proposed a method of processing Genbank data. First, we divided GenBank sequence file into sequence items. Second, sequence items were analyzed into key/value pairs by BioJava Tools. At last, Hbase table was designed to store key/value pairs. The experiments show it is efficient and accurate. GenBank data stored in Hbase should be applied in data searching, contrasting and managing rapidly and efficiently. © 2014 Taylor & Francis Group, London, UK.

关键词： information management

来源：评论

学校读者我要写书评

暂无评论

Research on a denoising smoothing algorithm for 3D scattered point cloud

引用

ICIC Express Letters 2014年第9期8卷 2403-2409页

作者： Gu, Xiaoying Liu, Yongshan Wu, Qiong Department of Information Science and Engineering China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China Data Industry Research Lab Qinhuangdao 066004 China

In order to effectively eliminate outliers and noise points in 3D scattered point cloud, a denoising smoothing algorithm which is the combination of removing outliers algorithm and trilateral filter is proposed. This is accomplished by rejecting outliers, correcting the normal direction and moving noise points along the modified normal direction within local adaptive neighborhoods. First, the outliers are removed by the method of mathematical statistics, on this basis, estimating normal direction and curvature of point cloud by covariance analysis method. Then, correct the normal direction by combining trilateral filter weighting factor with adaptive optimal neighborhood function. Finally, calculate position offset of data points in the direction of normal amendment by trilateral filter weighting factor in order to smooth the point cloud. Experimental results show that the proposed method is simple and effective, successfully removing noise from point cloud while preserving inherent geometric features. © 2014 ISSN 1881-803X.

关键词： Bandpass filters

来源：评论

学校读者我要写书评

暂无评论

Edge collapse mesh simplification algorithm based on detail features preserving

引用

Journal of Computational information Systems 2014年第7期10卷 2883-2890页

作者： Jia, Qi Liu, Yongshan Gu, Xiaoying College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao 066004 China Data Industry Research Lab. Qinhuangdao 066004 China

The existing model simplification algorithm in simplified speed and quality can't reach a better compromise, so we present an improved quadric error metrics edge collapse mesh simplification algorithm. This algorithm makes the local region unevenness of vertex, the local region average area of vertex and edge length as constraint factors add to the edge collapse cost, by changing the order of the edge collapse to retain the important detail features of the original model. New vertex position is calculated on the different types of edge, keeping the boundary characteristics of the mesh model. Experimental results show that the improved algorithm not only runs faster, but also maintains a higher degree on the model feature region. © 2014 Binary information Press.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Incremental mining of sequential patterns from multiple item set data streams

引用

ICIC Express Letters 2014年第10期8卷 2687-2692页

作者： Hao, Xiaobing Chen, Yuping Ren, Jiadong College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province No. 438 Hebei Ave. Qinhuangdao 066004 China

Sequential pattern mining has a wide range of applications in data streams. The real data involves multiple data streams and each data stream is itemset-sequence. However, most algorithms mine a single item in a single data stream. So IMASP algorithm (incremental mining of across-stream sequential patterns from multiple item set data streams) is presented to mine sequential patterns from multiple data streams and it is an incremental algorithm with single-pass scanning. What is more, the algorithm uses a multi-streams bitmap temporary table to store the sequence information in the current sliding windows. The partial substitution and the real-time counting of the item in old and new windows are adopted to improve the execution efficiency of the algorithm. A multi-streams Lexicographic Sequence Tree is used to store items, extended sequences and the support. Experimental results show that IMASP algorithm reduces time and memory consumption and has the efficiency and accuracy for mining across-stream sequential pattern from itemset sequence streams. © 2014 ICIC International.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：