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

9th IEEE/ACM International Symposium on Networks-on-Chip, NOCS 2015

作者： Hu, Qi Liu, Peng Huang, Michael C. Xie, Xiang-Hui College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China Dept. of Electrical and Computer Engineering University of Rochester RochesterNY14627 United States State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi214125 China

ISBN: (纸本)9781450333962

Emerging heterogeneous interconnects have shown lower latency and higher throughput, which can improve the efficiency of communication and create new opportunities for memory system designs. In this paper, transmission lines are employed as a latency-optimized network and combined with a packet-switched network to create heterogeneous interconnects improving the efficiencies of on-chip communication and cache coherence. We take advantage of this heterogeneous interconnect design, and keep cache coherence adaptively based on data locality. Different type of messages are adaptively directed through selected medium of the heterogeneous interconnects to enhance cache coherence effectiveness. Compared with a state-of-the-art coherence mechanism, the proposed technique can reduce the coherence overhead by 24%, reduce the network energy consumption by 35%, and improve the system performance by 25% on a 64-core system. Copyright is held by the owner/author(s).

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

A security routing model based on trust for medical sensor networks

A security routing model based on trust for medical sensor n...

引用

International Conference on Communication Software and Networks, ICCSN

作者： Yan Gao Wenfen Liu Zhengzhou Institute of Information Science and Technology State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Zhengzhou Institute of Information Science and Technology State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781479919857

With the development of medical sensor networks, the security has becomes an important issue. In this paper, a security routing model based on trust is proposed for medical sensor networks. To measure the credibility of each path from the source master node to the base station, a calculation method with Tsallis entropy is put forward on the basis of trust values of intermediate master nodes in the path. With the properties of Tsallis entropy, path Tsallis entropy can comprehensively reflect the uncertainty of all the intermediate nodes in each path. Based on this, the trust value of each path is obtained. Therefore the path with the maximum trust value is selected to transfer the data from the multiple paths. Simulation experiments show that the proposed model enables the transfer to effectively avoid such paths containing the low-trust nodes, so that the packet successful delivery rate has a great improvement and the ability against malicious attacks is also enhanced.

关键词： Routing Entropy Base stations Security Medical diagnostic imaging Wireless sensor networks Wireless communication

来源：评论

学校读者我要写书评

暂无评论

An IP geolocation method based on rich-connected sub-networks

An IP geolocation method based on rich-connected sub-network...

引用

International Conference on advanced Communication Technology (ICACT)

作者： Shichang Ding Xiangyang Luo Meijuan Yin Yan Liu Fenlin Liu State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Science and Technology Institute China

ISBN: (纸本)9781467381161

Recent years have seen a rapid growth of location-aware applications such as targeted marketing, restricted content delivery and location-based security check. Although existing delay-based IP geolocation techniques work well in some developed countries, the assumption of a strong delay-distance correlation that they often rely on may fail in many developing countries for poor network connectivity. To obtain more accurate delay-based IP geolocation results in poor-connected networks, an IP geolocation method based on rich-connected sub-networks is presented in this paper. At first, the network connectivity of one particular network is measured. Next, if the network is poor-connected, the method will divide it and search rich-connected sub-networks based on properties such as ISP and location information of probing hosts and landmarks. Then, based on the discovered rich-connected sub-networks, landmarks and probing hosts are deployed and selected to measure data such as delay, distance and topology, etc. At last, the location of the target host is estimated by modifying the processes of existing delay-based IP geolocation techniques based on selected landmarks and probing hosts. The experiments which cover 30 provinces and 3 major ISPs of China show that the proposed method can find corresponding rich-connected sub-networks and significantly improve the performance of existing typical delay-based IP geolocation techniques in an actual poor-connected network.

关键词： Geology IP networks Cities and towns Delays Correlation Internet Databases

来源：评论

学校读者我要写书评

暂无评论

Hidden System APIs Based Code Obfuscation

Hidden System APIs Based Code Obfuscation

引用

2015 International Conference on Mechanical,Electronic and Information Technology engineering

作者： Fei Xiang Fenlin Liu Bin Lu Daofu Gong Zhengzhou Information Science and Technology Institute State Key Laboratory of Mathematical Engineering and Advanced Computing

For the problem that static disassembly can expose system API calls in programs, this paper proposes a kind of code obfuscation aimed at hiding system API calls from reverse analysis. The algorithm is implemented by creating a system API address table and constructing secret index variables. During execution, the program looks up the table for the correct API to call, thus keeping the semantic unchanged. Analysis and experiments show that the algorithm can effectively protect system API calls from static reverse analysis.

关键词： static disassembly reverse analysis code obfuscation system API address table

来源：评论

学校读者我要写书评

暂无评论

Real-time rendering for sea water based on height field model and light interaction

引用

ICIC Express Letters, Part B: Applications 2016年第9期7卷 1975-1981页

作者： Xu, Jie Zhang, Yang Fu, Jinhua School of Software Zhengzhou University of Light Industry No. 5 Dongfeng Road Zhengzhou450002 China College of Mathematics and Information Science Zhengzhou University of Light Industry No. 5 Dongfeng Road Zhengzhou450002 China State Key-Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute Zhengzhou450000 China School of Computer and Communication Engineering Zhengzhou University of Light Industry No. 5 Dongfeng Road Zhengzhou450002 China

Real-time simulation of liquids like sea water is an important task nowadays in the field of computer graphics. In this paper, combined with simulation of light interaction, rendering of sea water at interactive rates is implemented based on the height field model. The focus of the sea rendering is a real-time and graphically realistic simulation, capable of handling different types of illumination such as refraction and reflection. In order to improve the realism of sea water, surface details are efficiently acquired by normal mapping. The effects of lighting and shading via our method are more obvious and clear in such as reflection, refraction, foam and soft shadow, which are in accord with physical interaction between light and water. © 2016 ICIC International.

关键词： Refraction

来源：评论

学校读者我要写书评

暂无评论

A multi-agent coordinated planning approach for deadline required emergency response tasks

引用

IET Control Theory and Applications 2015年第3期9卷 447-455页

作者： Zhou, Chao Wang, Hongwei Zhuo, Hankz Hankui Key Laboratory of Image Processing and Intelligent Control of Education Ministry Institute of Systems Engineering Huazhong University of Science and Technology Wuhan430074 China School of Advanced Computing SunYat-sen University Guangzhou510006 China

This study investigates the emergency decision-making problem in a multi-agent system. Departments are modeled as agents to perform coordinated planning to obtain a global action plan with a short execution time constrained by a prescribed deadline. A novel multi-agent planning approach is proposed to coordinate for the solution among agents in the system. The approach consists of two stages. For the first stage, a coordinated planning and scheduling method is designed to generate a candidate global action plan. In this plan, durative actions are assigned to proper time intervals with the consideration of temporal relationships among agents. For the second stage, a coordination mechanism based on local heuristics is proposed to reduce the global time cost of the candidate plan to satisfy the deadline. An experimental study of emergency evacuation problem is conducted to demonstrate the effectiveness and efficiency of the proposed approach. © 2015 The Institution of engineering and Technology.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

An automatic reassembly model and algorithm of log file fragments based on graph theory

An automatic reassembly model and algorithm of log file frag...

引用

IEEE International Conference on Software engineering and Service Sciences (ICSESS)

作者： Shuai Yi Xueli Hu Hao Wu State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Information Engineering University Zhengzhou China

ISBN: (纸本)9781479983544

Automatic reassembly of log file fragments from a collection of mixed fragments is one of the most important process during log file carving. In this paper we propose a general process model and design an algorithm based on graph theory for automatic reassembly of log file fragments. Finally, an experiment is designed and explored and results demonstrated the validity of the proposed model and algorithm.

关键词： Algorithm design and analysis Finite element analysis Graph theory File systems Semantics Probability Manganese

来源：评论

学校读者我要写书评

暂无评论

3D Ear Shape Matching Using Joint -Entropy

引用

Journal of Computer Science & Technology 2015年第3期30卷 565-577页

作者：孙晓鹏李思慧韩枫魏小鹏 Institute of Computer Systems School of Computer and Information Technology Liaoning Normal University Dalian 116029 China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing 100876 China School of Mechanical and Engineering Dalian University of Technology Dalian 116024 China Key Laboratory of Advanced Design and Intelligent Computing Dalian University Dalian 116622 China

In this article, we investigate the use of joint a-entropy for 3D ear matching by incorporating the local shape feature of 3D ears into the joint a-entropy. First, we extract a sut^cient number of key points from the 3D ear point cloud, and fit the neighborhood of each key point to a single-value quadric surface on product parameter regions. Second, we define the local shape feature vector of each key point as the sampling depth set on the parametric node of the quadric surface. Third, for every pair of gallery ear and probe ear, we construct the minimum spanning tree （MST） on their matched key points. Finally, we minimize the total edge weight of MST to estimate its joint a-entropy the smaller the entropy is, the more similar the ear pair is. We present several examples to demonstrate the advantages of our algorithm, including low time complexity, high recognition rate, and high robustness. To the best of our knowledge, it is the first time that, in computer graphics, the classical information theory of joint a-entropy is used to deal with 3D ear shape recognition.

关键词： joint a-entropy minimum spanning tree local shape feature ear matching ear recognition

来源：评论

学校读者我要写书评

暂无评论

Exploiting Pure Superword Level Parallelism for Array Indirections

Exploiting Pure Superword Level Parallelism for Array Indire...

引用

International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)

作者： Huihui Sun Rongcai Zhao Wei Gao Yi Gong Gang Li State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Information Engineering University Zhengzhou China

SIMD (Single Instruction Multiple Data) extension units are ubiquitous in modern processors. Array indirections raise several challenges for SIMD vectorization including disjoint memory access, unknown alignment and dependence cycle. Existing SIMD automatic vectorization methods fail to handle these challenges very well. This paper presents a new method exploiting Pure SLP (Superword Level Parallelism) to address these problems. Dependence equation is rewritten to work out the dependence testing for index array. To address the problem of non-aligned and disjoint challenges, data alignment in recombinant registers and redundant statements are employed respectively. In addition, a precise cost model is proposed to guarantee positive benefits. Experiments on three typical array indirection applications extracted from SPEC2006 benchmarks verified the validity of this method.

关键词： Arrays Testing Indexes Parallel processing mathematical model Registers Program processors

来源：评论

学校读者我要写书评

暂无评论

An Embedded FPGA Operating System Optimized for Vision computing (Abstract Only) 15

An Embedded FPGA Operating System Optimized for Vision Compu...

引用

Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays

作者： Zhilei Chai Jin Yu Zhibin Wang Jie Zhang Haojie Zhou Jiangnan University Wuxi China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China

ISBN: (纸本)9781450333153

Although FPGA's power and performance advantages were recognized widely, designing applications on FPGA-based systems is traditionally a task undertaken by hardware experts. It is significant to allow application-level programmers with less system-level but more algorithm knowledge to realize their applications conveniently on FPGAs. In this paper, an embedded FPGA operating system is proposed to facilitate application-level programmers to use FPGAs. Firstly, it builds specific I/Os and optimizes bus interconnection among I/Os, DDR memory, user IPs etc within the FPGA for vision computing. Secondly, it manages resources of the FPGA such as I/Os, DDR memory, communication etc, frees users from low-level details. Thirdly, it schedules tasks (IPs) executed on the FPGA dynamically in runtime, which makes the FPGA multiplexed when necessary. After porting the FPGA operating system to different FPGA platforms and implementing vision algorithms based on that, it shows the FPGA operating system is able to simplify algorithm development on FPGA platforms and improve portability of user applications. Furthermore, implementation results of several popular vision algorithms show the FPGA operating system is efficient and effective for vision computing. Finally, experimental results shows that for multiple algorithms requiring more FPGA resources, runtime task scheduling of multiple IPs is more efficient than a fixed IP when the SoC of FPGA is considered.

关键词： vision computing operating systems portability of applications application programmers fpgas

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：