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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

109 篇 会议
25 篇 期刊文献

馆藏范围

134 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

89 篇 工学
- 73 篇 计算机科学与技术...
- 57 篇 软件工程
- 36 篇 信息与通信工程
- 16 篇 动力工程及工程热...
- 12 篇 电子科学与技术（可...
- 8 篇 仪器科学与技术
- 7 篇 控制科学与工程
- 6 篇 电气工程
- 5 篇 生物工程
- 4 篇 机械工程
- 4 篇 光学工程
- 4 篇 化学工程与技术
- 3 篇 生物医学工程（可授...
- 2 篇 建筑学
- 2 篇 农业工程
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 土木工程
42 篇 理学
- 28 篇 数学
- 6 篇 统计学（可授理学、...
- 5 篇 化学
- 5 篇 生物学
- 4 篇 物理学
- 4 篇 系统科学
28 篇 管理学
- 15 篇 管理科学与工程(可...
- 12 篇 图书情报与档案管...
- 4 篇 工商管理
8 篇 法学
- 8 篇 社会学
2 篇 农学
- 2 篇 作物学
1 篇 经济学
- 1 篇 应用经济学
1 篇 医学

主题

9 篇 wireless sensor ...
8 篇 graphics process...
7 篇 sensor nodes
7 篇 parallel algorit...
7 篇 algorithm design...
6 篇 instruction sets
5 篇 semantic segment...
5 篇 deep learning
5 篇 throughput
5 篇 recommender syst...
5 篇 feature extracti...
5 篇 information scie...
5 篇 training
5 篇 adaptation model...
4 篇 collaborative fi...
4 篇 target tracking
4 篇 data mining
4 篇 control engineer...
4 篇 social networkin...
3 篇 indexes

机构

66 篇 key laboratory o...
58 篇 school of comput...
26 篇 college of compu...
11 篇 key laboratory o...
8 篇 key laboratory o...
7 篇 key laboratory o...
6 篇 school of comput...
6 篇 school of inform...
5 篇 jiaxiang industr...
4 篇 heilongjiang uni...
3 篇 key laboratory o...
3 篇 黑龙江大学
3 篇 heilongjiang uni...
3 篇 department of co...
2 篇 shandong artific...
2 篇 beijing institut...
2 篇 jiaxiang industr...
2 篇 heilongjiang key...
2 篇 college of compu...
2 篇 college of compu...

作者

24 篇 li jinbao
17 篇 lu jun
17 篇 guo longjiang
16 篇 jun lu
15 篇 yang yan
13 篇 yan yang
13 篇 jinbao li
9 篇 longjiang guo
9 篇 ren meirui
9 篇 li jin-bao
7 篇 zhu jinghua
6 篇 zhang desheng
6 篇 zhu jing-hua
6 篇 guo long-jiang
6 篇 zhong yingli
6 篇 meirui ren
4 篇 nan wang
4 篇 jinghua zhu
4 篇 jun li
4 篇 liu yong

语言

113 篇 英文
21 篇 中文

检索条件"机构=The Key Laboratory of Database and Parallel Computing"

共 134 条记录，以下是91-100 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

An urban area-oriented traffic information query strategy in VANETs

An urban area-oriented traffic information query strategy in...

引用

8th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2013

作者： Wang, Xinjing Guo, Longjiang Ai, Chunyu Li, Jinbao Cai, Zhipeng School of Computer Science and Technology Heilongjiang University Heilongjiang China Key Laboratory of Database and Parallel Computing Heilongjiang University Heilongjiang China Division of Math and Computer Science University of South Carolina Upstate United States Department of Computer Science Georgia State University Atlanta 30303 United States

ISBN: (纸本)9783642397004

Traffic information query in Vehicular Ad Hoc Network has various significant applications. Real-time traffic information can provide support for users to choose an optimal route according to current traffic situation. In this paper, we propose an urban area-oriented traffic information query processing mechanism, which can acquire the realtime traffic information of multiple paths from source to destination in relatively fast and accurate manner, and help users to determine an optimal route. The proposed mechanism includes two key algorithms - query dissemination and processing, and routing results backward to query requester. The query processing algorithm determines the scope of each query, so that a vehicle can query and collect data within a certain efficient scope to avoid returning overwhelmed large amount results. For queried vehicles, returning results to the moving query requester is a dynamic routing problem. We proposed a position predicting method to estimate the current location of the requester according to the information stored in the query packet. Simulation results show that the proposed strategy can improve the efficiency of data transmission, and the returned query results is effective for choosing an optimal route. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Node classification problem based on potential information and representation learning between nodes

Node classification problem based on potential information a...

引用

International Conference on Information Science and Control Engineering (ICISCE)

作者： Mingming Li Yan Yang School of Computer Science Technology Heilongjiang University Hearbin Province China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin Province China

Representation learning of social network nodes refers to the feature expression of nodes in low-dimensional vector space. Most of the current methods are based on the network topology to achieve node feature learning, but the potential information of the network topology is not fully utilized. To solve this problem, we propose a graph embedding algorithm based on the similarity between nodes. This method obtains a new network topology through the second-order similarity between nodes. This network topology can enhance the correlation between nodes, thereby improving the effect of node classification in the network. We use Macro-F1 and Micro-F1 evaluation indicators to evaluate the benchmark algorithm and the SNE algorithm proposed in this paper on four real data sets. The experimental results show that the SNE algorithm can improve the effect of node classification.

关键词： Information science Electronic publishing Correlation Control engineering Network topology Social networking (online) Information services

来源：评论

学校读者我要写书评

暂无评论

OCO: A Multi-channel MAC Protocol with Opportunistic Cooperation for Wireless Sensor Networks

OCO: A Multi-channel MAC Protocol with Opportunistic Coopera...

引用

IEEE/IFIP International Conference on Embedded and Ubiquitous computing, EUC

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

To handle the triple hidden terminal problems, this paper proposes OCO, an asynchronous multi-channel MAC protocol with opportunistic cooperation for wireless sensor networks. By adopting opportunistic cooperation, OCO effectively alleviates, if not eliminates, the triple hidden terminal problems. More importantly, OCO is fully distributed with no requirements of time synchronization or multi-radio scheme, so it is easy to be implemented on the real sensor nodes. Via the theoretical analysis, the opportunistic probability that a node cooperates with its neighbor is obtained. To validate the effectiveness of opportunistic cooperation, extensive simulations and real test bed experiments were con-ducted. The simulation and experimental results show that when the number of channels is large or the network loads are heavy, OCO improves energy efficiency and throughput significantly compared with other works in the literature.

关键词： Receivers Wireless sensor networks Throughput Ad hoc networks Media Access Protocol Media

来源：评论

学校读者我要写书评

暂无评论

Motif Recognition parallel Algorithm Based on GPU

Motif Recognition Parallel Algorithm Based on GPU

引用

International Conference on Cyber-Enabled Distributed computing and Knowledge Discovery, CyberC

作者： Jinliang Zheng Jun Lu Xinyi Shi Yan Shi Ruiqing Jing College of Computer Science and Technology Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China University of Chinese Academy of Sciences

In this paper, a GPU-based parallel algorithm is proposed to improve the processing efficiency of motif recognition algorithm. The work includes a serial motif recognition algorithm and a parallel algorithm based on GPU. Our GPU parallel algorithm is compared with the serial algorithm by using of 1 KB promoter data of five kinds of plant genes upstream regions. The experimental results show that a factor of 20 speeds can be achieved. It means that there are a lot of advantages by GPU parallel technology on gene motif recognition algorithm. It is significant to the great amount of data analysis work of genetic sequence.

关键词： Graphics processing units Instruction sets Algorithm design and analysis parallel algorithms Bioinformatics Synchronization Biology

来源：评论

学校读者我要写书评

暂无评论

M&M: A Multi-channel MAC Protocol with Multiple Channel Reservation for Wireless Sensor Networks

M&M: A Multi-channel MAC Protocol with Multiple Channel Rese...

引用

International Conference on Cyber-Enabled Distributed computing and Knowledge Discovery, CyberC

作者： Jinbao Li Desheng Zhang School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang China Key Laboratory of Database Parallel Computing of Heilongjiang Province Harbin Heilongjiang China

In this paper, a multi-channel MAC protocol, called M&M, with multiple channel reservation is proposed to tackle the channel conflict problem. M&M is fully distributed with no requirements of time synchronization or multi-radio, so it is very practical to implement M&M in resource-constrained sensor nodes. M&M can make nodes to choose one actually idle channel for communications from all assumed idle channels. Therefore, M&M can greatly alleviate, if not completely eliminate, packet collisions resulted by the channel conflict, and thus conserve more energy to prolong the lifetime of WSNs. To investigate the values of multiple channel reservation, extensive simulation and real test bed experiments are conducted. The results show that when the number of channels becomes larger or loads are heavy, M&M improves energy efficiency and throughput significantly.

关键词： Wireless sensor networks Throughput Receivers Synchronization Media Access Protocol Media

来源：评论

学校读者我要写书评

暂无评论

Implementing the jacobi algorithm for solving eigenvalues of symmetric matrices with CUDA

Implementing the jacobi algorithm for solving eigenvalues of...

引用

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

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm for approximate string matching with K differences

Parallel algorithm for approximate string matching with K di...

引用

2013 IEEE 8th International Conference on Networking, Architecture and Storage, NAS 2013

作者： Guo, Longjiang Du, Shufang Ren, Meirui Liu, Yu Li, Jinbao He, Jing Tian, Ning Li, Keqin Heilongjiang University School of Computer Science and Technology Harbin 150080 China Key Laboratory of Database and Parallel Computing Heilongjiang China Kennesaw State University Department of Computer Science Kennesaw GA 30144 United States State University of New York Department of Computer Science New Paltz NY 12561 United States

ISBN: (纸本)9780769550343

Approximate string matching using the k-difference technique has been widely applied to many fields such as pattern recognition and computational biology. Data dependency exists in the traditional sequential algorithm. Therefore, it is hard to design a parallel algorithm for approximate string matching with k differences. This paper presents a technique to eliminate data dependency. Based on this technique, this paper also presents a parallel algorithm which can calculate the elements in the same row of the edit distance matrix in parallel by eliminating data dependency. The algorithm has high parallelism, but requires synchronization. To validate the proposed algorithm, it is implemented on GPU and multiple-core CPUs. Moreover, the CUDA optimization techniques are also presented in the paper. Finally, experimental results show that, compared with the traditional sequential algorithm on CPU with twenty-four cores, the proposed parallel algorithm achieves speedup of 7-42 on GPU. © 2013 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

DCM: A DUTY CYCLE BASED MULTI-CHANNEL MAC PROTOCOL FOR WIRELESS SENSOR NETWORKS

DCM: A DUTY CYCLE BASED MULTI-CHANNEL MAC PROTOCOL FOR WIREL...

引用

Iet International Conference on Wireless Sensor Network 2010(2010年物联网应用技术国际会议 IET-WSN 2010)

作者： Longjiang Guo Jinbao Li Desheng Zhang School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang China 150 Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin Heilongjiang Ch

ISBN: (纸本)9781617825057

Limitations of current multi-channel MAC protocols include requiring of strict time synchronization, existing large number of multi-channel hidden terminals, and lacking single-hop broadcast support and sleep mechanism, *** *** paper proposes an asynchronous duty cycle based multichannel MAC protocol, called DCM, for wireless sensor *** of requiring time synchronization among nodes, DCM takes advantage of receiver-initiated cross channel handshake mechanism to make a channel reservation for data transmission, and employs receiver adjustment mechanism to tackle the problem of the loss of broadcasting data and to improve broadcast *** to theoretical analysis using Queueing theory, this paper obtains the average number of available *** simulation and testbed experimental results show that DCM reduces the number of multichannel hidden terminals effectively, and achieves significant improvement in network throughput with increasing benefit as traffic loads increase while maintaining higher energy efficiency.

关键词： WSN MAC protocol Hidden Terminals

来源：评论

学校读者我要写书评

暂无评论

Research on max ordinal in universal combinatorics coding based on GPU parallel computing

Research on max ordinal in universal combinatorics coding ba...

引用

International Conference on Measurement, Information and Control (MIC)

作者： Zhuo Zhang Jun Lu Ting Ting Gao Juan Mo Yu Liu Key Laboratory of Database and Parallel Computing Heilongjiang Province KLDPC HLJU College of CS HLJU Harbin China College of Computer Science and Technology Heilongiiang University

The parallel computing method of max ordinal number in universal combinatorics coding based on GPU is advanced in this paper. The core of universal combinatorics coding computing is ordinal number computing while the calculation of ordinal number depends on the value of max ordinal number. The calculation of max ordinal number is divided into two parts, multiplication and division of large numbers. This paper focus on the GPU parallel computing of the multiplication in max ordinal number calculation, the calculation speed of the multiplication part is increased substantially, and thus improves the efficiency of max ordinal number calculation.

关键词： Graphics processing units parallel processing Artificial intelligence Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Bipartite graph-based keyword query results recommendation

Bipartite graph-based keyword query results recommendation

引用

International Conference on Mechatronic Science, Electric Engineering and Computer

作者： Limin Feng Yan Yang School of Computer Science and Technology in Heilongjiang University Harbin China School of Computer Science and Technology in Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

ISBN: (纸本)9781479925667

Relational database is widely used in people's daily life and productions. keyword search in relational database makes people search structured information from database as using search engine. So it has become a research hotspot. In recent years, there are a lot of research works about how to use historical query information to improve query efficiency. The existing works can be divided into two main aspects: query expansion and query recommendation. These two aspects have common feature, that is, they both use the historical words to improve query efficiency. If the results of historical query can be directly recommended to the current query, the query efficiency will be improved. But there are not any works using recommended model of recommended system to help keyword search. We have found that recommended model can be used to improve efficiency. We are the first one to use bipartite graph model, and propose query result recommendation algorithm, namely, Query_base algorithm and Distance_base algorithm. Finally this paper analyzes the factors which affect the efficiency of the algorithms, and verified the performance and higher accuracy of the recommendation algorithms by experiments.

关键词： Filtering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共14页 << < 5 6 7 8 9 10 11 12 13 14 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：