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

2012 IEEE 7th International Conference on Networking, Architecture and Storage, NAS 2012

作者： Wang, Tao Guo, Longjiang Li, Guilin Li, Jinbao Wang, Renda Ren, Meirui He, Jing School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 China Software School of Xiamen University Xiamen Fujian 361005 China Department of Computer Science Kennesaw State University Kennesaw GA 30144 United States

ISBN: (纸本)9780769547220

Solving the eigenvalues of matrices is an open problem which is often related to scientific computation. With the increasing of the order of matrices, traditional sequential algorithms are unable to meet the needs for the calculation time. Although people can use cluster systems in a short time to solve the eigenvalues of large-scale matrices, it will bring an increase in equipment costs and power consumption. This paper proposes a parallel algorithm named Jacobi on gpu which is implemented by CUDA (Computer Unified Device Architecture) on GPU (Graphic Process Unit) to solve the eigenvalues of symmetric matrices. In our experimental environment, we have Intel Core i5-760 quad-core CPU, NVIDIA GeForce GTX460 card, and Win7 64-bit operating system. When the size of matrix is 10240×10240, the number of iterations is 10000 times, the speedup ratio is 13.71. As the size of matrices increase, the speedup ratio increases correspondingly. Moreover, as the number of iterations increases, the speedup ratio is very stable. When the size of matrix is 8192×8192, the number of iterations are 1000, 2000, 4000, 8000 and 16000 respectively, the standard deviation of the speedup ratio is 0.1161. The experimental results show that the Jacobi on gpu algorithm can save more running time than traditional sequential algorithms and the speedup ratio is 3.02∼13.71. Therefore, the computing time of traditional sequential algorithms to solve the eigenvalues of matrices is reduced significantly. © 2012 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Improvement on simulating TCP connection establishment in NS2

引用

Tongxin Xuebao/Journal on Communications 2012年第SUPPL.2期33卷 15-19页

作者： Jiang, Yu Ren, Jian Zhou, Li-Ming School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 China School of Information Science and Technology Heilongjiang University Harbin 150080 China

In the procedure of three-way handshake of transmission control protocol connection establishment, it involves the management of half-connection and connection tables. However, in the famous networks simulator NS2, there is only a formal description instead of a concrete and complete implementation for the procedure of TCP connection establishment. An improvement was beed made on the point. Table structures for half-connections and connections are added, and the way of managing half-connection table in Linux kernel is also imported into NS2. Simulation results show that it is clear to monitor the change in half-connection table in the TCP connection establishment procedure, and thus the requirement of simulating the connection establishment procedure in studies such as protection from TCP SYN flooding attack can be met.

关键词： Transmission control protocol

来源：评论

学校读者我要写书评

暂无评论

Analysis on the impact of router alias resolution

引用

Tongxin Xuebao/Journal on Communications 2012年第SUPPL.2期33卷 160-166页

作者： Ren, Jian Jiang, Yu Gao, Ge School of Information Science and Technology Heilongjiang University Harbin 150080 China School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 China

Router alias resolution is one of hard problems and important steps for router level Internet topology measurement based on traceroute mechanism, and the topology characteristic of the generated router level topology graph has close relationship with the completeness of alias resolution. The graph with its degrees following power-law distribution was taken as the base-graph, and the shortest paths from one source to others were computed for simulating topology measurement. Experiment results show that it is very probable to see different topology characteristics between the derived graph and the base-graph due to incomplete alias resolution. Most importantly, for large-scale router level topology measurement, the completeness of alias resolution must be improved with the increasing number of probe sources, and in this way the derived topology graph could be approximate to the real topology graph.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Joint routing, scheduling and channel assignment in multi-power multi-radio wireless sensor networks

Joint routing, scheduling and channel assignment in multi-po...

引用

30th IEEE International Performance, computing and Communications Conference, IPCCC 2011

作者： Li, Jinbao Guo, Xiaohang Guo, Longjiang School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin Heilongjiang 150080 China

ISBN: (纸本)9781467300100

Power control is a complex issue in routing since the increase of transmission power supplies more opportunities to select optimal routes due to the fact that more links are available. However, conversely, it also implies higher interference and hence decreases the performance of routing. Since multi-radio multi-channel schemes can efficiently mitigate interferences through allowing more concurrent transmissions, therefore, it is worth to investigate the routing scheme in Multi-Power Multi-Radio (MPMR) wireless sensor networks (WSNs). In this paper, we study the joint routing, scheduling, channel assignment and power control problem in MPMR WSNs, which is proven a NP-Hard problem. We first formulate the optimal routing problem as a linear programming problem. Subsequently, we develop a distributed routing protocol based on the random walk method which can efficiently decrease the computational complexity in large-scale WSNs by avoiding solving the linear programming problem. Theoretical analysis and simulations show that the routing based on MPMR can improve the data transmission efficiency and the proposed cross-layer routing scheme significantly reduces the energy consumption and the end-to-end transmission delay. © 2011 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Improving rating estimation in recommender using demographic data and expert opinions

Improving rating estimation in recommender using demographic...

引用

2011 IEEE 2nd International Conference on Software Engineering and Service Science, ICSESS 2011

作者： Yun, Long Yang, Yan Wang, Jing Zhu, Ge Dept. of Computer Science and Technology Heilongjiang University Key Lab. of Database and Parallel Computing Heilongjiang Province Harbin China

ISBN: (纸本)9781424496969

Memory-based collaborative filtering algorithms have been widely adopted in many popular recommender systems, however the rating data are very sparse, which affects prediction accuracy greatly. To solve this problem, we use expert opinions to improve prediction accuracy. Firstly, we propose a novel similarity measure in order to highlight users' background. Then, combining users' ratings with expert opinions, the prediction get a right balance in both expert professional opinions and similar users. Finally, since SVD-based collaborative filtering algorithms shows good performance on the prevention of noise, we use it to smooth the prediction. Experiments of MovieLens have shown that our proposed method improves recommendation quality obviously. © 2011 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Multi-Radio无线传感器网络中基于缓存和信道切换的数据查询算法的研究

Multi-Radio无线传感器网络中基于缓存和信道切换的数据查询算法...

引用

第29届中国数据库学术会议

作者： ZHANG Yan-Qing 张艳卿 LI Jin-Bao 李金宝 GUO Long-Jiang 郭龙江 ZHU Jing-Hua 朱敬华 School of Computer Science and Technology Heilongjiang University Harbin 150080 黑龙江大学计算机科学技术学院哈尔滨 150080 Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 黑龙江省数据库与并行计算重点实验室哈尔滨 150080

针对Multi-Radio Multi-Channel传感器网络中链路服务质量和信道冲突等问题，提出并证明了基于缓存和信道切换的数据查询问题是一个NP完全问题。根据数据流守恒和链路-信道等约束条件，建立线性规划方程，得到该问题的最优解模型，并提... 详细信息

针对Multi-Radio Multi-Channel传感器网络中链路服务质量和信道冲突等问题，提出并证明了基于缓存和信道切换的数据查询问题是一个NP完全问题。根据数据流守恒和链路-信道等约束条件，建立线性规划方程，得到该问题的最优解模型，并提出了一个多项式时间的近似算法——贪心新覆盖数据算法。该算法采用动态规划策略最小化缓存节点将单位数据包传输到查询节点所需要的路径时延，再贪心选择其具有最小路径时延的缓存节点，收集其新覆盖数据。理论分析和实验结果表明，提出的方案能有效地减少数据收集时延，提高数据查询效率。

关键词：无线传感器网络数据查询算法信道切换数据缓存技术

来源：评论

学校读者我要写书评

暂无评论

WSNs中实现数据机密性的数据聚集协议研究

WSNs中实现数据机密性的数据聚集协议研究

引用

第29届中国数据库学术会议

作者： Wang Meng 王蒙 Li Jinbao 李金宝 School of Computer Science and Technology Heilongjiang University Harbin 150080 黑龙江大学计算机科学技术学院哈尔滨 150080 Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 黑龙江省数据库与并行计算重点实验室哈尔滨 150080

针对无线传感器网络容易受到攻击、数据机密性差等问题,提出一个实现数据机密性的数据聚集协议HCDA.该协议使用端到端密钥对数据加密,确保数据的机密性,中间节点在不解密的情况下将收到的多个加密数据压缩为一个值,并将其映射成唯一的... 详细信息

针对无线传感器网络容易受到攻击、数据机密性差等问题,提出一个实现数据机密性的数据聚集协议HCDA.该协议使用端到端密钥对数据加密,确保数据的机密性,中间节点在不解密的情况下将收到的多个加密数据压缩为一个值,并将其映射成唯一的较小正整数继续传输以节约节点的能量消耗.sink通过对接收到的数据解压和解密,获得相关节点的真实数据,从而能够计算任意聚集函数,如MAX,MIN,SUM、查询区间值、第k大数值等.模拟实验显示,HCDA协议在能量消耗和延迟方面都具有良好的性能.

关键词：无线传感器网络安全机制数据聚集协议优化设计

来源：评论

学校读者我要写书评

暂无评论

Improving Rating Estimation in Recommender Using Demographic Data and Expert Opinions

Improving Rating Estimation in Recommender Using Demographic...

引用

2011 2nd IEEE International Conference on Software Engineering and Service Science(2011年第二届 IEEE 软件工程与服务科学国际会议 ICSESS 2011)

作者： Long Yun Yan Yang Jing Wang Ge Zhu Dept. of Computer Science and Technology Heilongjiang University Key Lab. of Database and Parallel Computing Heilongjiang Province Harbin China

关键词： Recommendation Collaborative Filtering Data Sparsity Expert Demography

来源：评论

学校读者我要写书评

暂无评论

H-cluster: A novel efficient algorithm for data clustering in sensor networks

引用

Journal of Communications 2011年第2期6卷 168-178页

作者： Guo, Longjiang Ren, Meirui Li, Jinbao Liu, Yong Ai, Chunyu School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing Heilongjiang Province Harbin 150080 China Computer Science Troy University Troy AL 36082 United States

This paper focuses on the problem of data clustering in wireless sensor networks (WSNs). The data time window is a landmark window, from the time WSN starts working up to the current time. The objective is to group sensory data generated by sensor nodes deployed in a two-dimensional physical space by the similarity of sensory data in the multi-dimensional sensory data space. To perform in-network data clustering efficiently, we propose HilbertMap, a novel dimensionality reduction technique based on the Hilbert Curves, to map a multi-dimensional data space to a two-dimensional physical space. Through this mapping, the communications for clustering mostly occur between geographically nearby sensor nodes. We have conducted simulation experiments on both real-world and synthetic datasets. Our results show that HilbertMap improves the communication efficiency while maintaining a good clustering quality. © 2011 ACADEMY PUBLISHER.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Cross-layer design for multi-power multi-radio wireless sensor networks

引用

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice 2011年第SUPPL. 2期31卷 114-118页

作者： Guo, Xiao-Hang Li, Jin-Bao School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 China

In this paper, we investigate on the optimal routing jointly scheduling, channel and power assignment in multi-power multi-radio WSNs. We first formulate the optimal routing as a linear programming problem, and then design a polynomial time heuristic algorithm. Experiments show that the proposed cross-layer routing significantly reduce the energy consumption and the end-to-end transmission delay.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：