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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Bilinear model for ontology mapping

引用

computer Modelling and New Technologies 2014年第8期18卷 368-372页

作者： Wu, Jian-Zhang Xiao, Yu Gao, Wei School of Computer Science and Engineer Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China School of Continuing Education Southeast University Nanjing China School of Information Science and Technology Yunnan Normal University Kunming China

As a model of concept representation, ontology has widely applied to various disciplines. Ontology mapping is used to create the link between different ontologies. In this paper, we present a new ontology mapping algorithm by virtue of bilinear model. The linear mapping pair is given by the iterative procedure. Two strategies are manifested to obtain the finally ontology mapping. The simulation experimental results show that the proposed new technologies have high accuracy and efficiency on ontology mapping in certain applications.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Provable Data Possession Supporting Secure Data Transfer for Cloud Storage

Provable Data Possession Supporting Secure Data Transfer for...

引用

International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA)

作者： Yong Yu Jianbing Ni Wei Wu Yilei Wang School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou China

ISBN: (纸本)9781467383165

Due to the appealing advantages of cloud storage, such as on-demand self-service and ubiquitous network access, an increasing number of users prefer to store their data on remote remote servers. However, outsourced data transfer becomes a critical requirement for users to shift their cloud storage providers because of the emergence of various cloud storage services with different qualities of services. Therefore, the users may not only be anxious about the state of their data on the cloud server, but also concern on whether the data are transferred entirely to the new cloud without corruption and whether the data on original cloud are discarded. To address these problems, we propose a provable data possession scheme for cloud storage services characterized by secure data transfer, provable data erasure, high error detection probability, confidential data storage. Our scheme can guarantee the remote data integrity when the data are maintaining on the cloud servers and are transferring between two clouds, and secure deletion of transferred data on the original cloud.

关键词： Cloud computing Data transfer Servers Cryptography Reliability Distributed databases

来源：评论

学校读者我要写书评

暂无评论

An Improved DV-Hop Positioning Algorithm for Wireless Sensor network

An Improved DV-Hop Positioning Algorithm for Wireless Sensor...

引用

2015 IEEE International Conference on Progress in Informatics and Computing(PIC 2015)

作者： Jiuhu Zheng Huanyan Qian Lie Wang School of Computer Science and Engineering Nanjing University of Science and Technology School of Information Technology Jiangsu Institute of Commerce Key Lab of Broadband Wireless Communication and Sensor Network Technology ( Nanjing University of Posts and Telecommunications) Ministry of Education National Mobile Communications esearch Laboratory Southeast University

In the view of the DV-Hop positioning algorithm which relies on the distance vector and beacon nodes, several aspects are improved: the average hop distance and hop count are corrected;a method to detect the abnormal distribution of beacon nodes is used to avoid the influence of the abnormal distribution on the positioning performance. The proposed algorithm is simple and effective. Simulation results show that compared with the traditional DV-Hop algorithm, the performance of the proposed algorithm is greatly *** performance is even even superior to that of the algorithm mentioned in literature [10]

关键词： Wireless sensor network DV-Hop algorithm node positioning positioning accuracy

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive anonymous communication scheme under SDN architecture

Self-adaptive anonymous communication scheme under SDN archi...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Tingting Zeng Meng Shen Mingzhong Wang Liehuang Zhu Fan Li Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing Institute of Technology P. R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education P. R. China Faculty of Arts and Business University of the Sunshine Coast Queensland Australia

Communication privacy and latency perceived by users have become great concerns for delay-sensitive Internet services. Existing anonymous communication systems either provide high anonymity at an expense of prolonged latency (e.g., mix-net), or offer better real-time performance by sacrificing the ability against traffic analysis attacks (e.g., Onion Routing). The emerging Software-Defined networking (SDN) introduces additional challenges to communication anonymity, due to the existence of a centralized controller that has a global view of the entire network traffic. In this paper, we propose a new anonymous communication scheme for delay-sensitive services under SDN scenarios, which can simultaneously protect communication privacy and reduce the end-to-end latency. A self-adaptive method based on the mix-net framework is designed to dynamically modify the waiting threshold of mix nodes, which helps to reduce the communication latency. In order to preserve the degree of anonymity, the self-adaptive method is incorporated with a random walking strategy for packets forwarding. Both theoretical analysis and experimental results prove that our scheme provides a moderate degree of anonymity and effectively reduces the latency derived from mix-net by up to 50%.

关键词： Real-time systems Relays Entropy Lead Distance measurement Annealing Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Energy Optimization of Air-based information network with Guaranteed Security Protection

Energy Optimization of Air-based Information Network with Gu...

引用

IEEE International Conference on Cyber Security and Cloud Computing

作者： Xiao Liu Meikang Qiu Xiaodong Wang Weiran Liu Kaiquan Cai School of Electronic and Information Engineering Beihang University Beijing Key Laboratory for Network-based Cooperative Air Traffic Management Beijing China Department of Computer Science Pace University New York NY USA Electrical Engineering Department Columbia University New York NY USA

ISBN: (纸本)9781467393010

The air-based information network of the Space-Air-Ground Integrated network has the distinct characteristics of heterogeneous, time-varying, distributed and self-organized, which bring not only new challenges of node mobility model, dynamic network grouping and interconnection and intercommunication of heterogeneous networks, but also higher requirements of network security. Therefore, selecting an efficient and safe communication link is critical when there may not be fixed rules. In this article, we build a model of the air-based information network, and use the method of dynamic programming to select the most efficient communication link by minimizing the energy consumption in the communication model. In the communication model, energy consumption is associated with the security level of the communication link. The experiments show that the presented algorithms can effectively reduce the total cost while satisfying security constraints.

关键词： air-based information network energy efficiency dynamic programming security protection

来源：评论

学校读者我要写书评

暂无评论

Latency-aware routing with bandwidth assignment for Software Defined networks

Latency-aware routing with bandwidth assignment for Software...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Qiongyu Zhang Liehuang Zhu Meng Shen Mingzhong Wang Fan Li Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing Institute of Technology P. R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education P. R. China Faculty of Arts and Business University of the Sunshine Coast Queensland Australia

Reducing the flow latency is of great importance in traffic management, which benefits both service providers and end users. Routing design and flow scheduling are typical ways to improve the flow transmission efficiency. However, existing studies usually consider them separately, due to the complexity of joint consideration. Here, we propose a latency-aware routing scheme with bandwidth assignment in the Software Defined networks, which can efficiently reduce the flow latency with a moderate complexity, to combine the routing and scheduling together.

关键词： Routing Bandwidth Processor scheduling Complexity theory Bismuth Software Mathematical model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：