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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

113 篇 会议
25 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

66 篇 key laboratory o...
59 篇 school of comput...
26 篇 college of compu...
11 篇 key laboratory o...
7 篇 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 篇 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...
2 篇 harbin research ...

作者

24 篇 li jinbao
18 篇 jun lu
18 篇 lu jun
18 篇 guo longjiang
14 篇 yan yang
14 篇 yang yan
13 篇 jinbao li
10 篇 ren meirui
9 篇 longjiang guo
9 篇 li jin-bao
7 篇 zhu jinghua
6 篇 zhang desheng
6 篇 zhu jing-hua
6 篇 guo long-jiang
6 篇 zhong yingli
6 篇 meirui ren
5 篇 jun li
5 篇 ruiqing jing
4 篇 nan wang
4 篇 jinghua zhu

语言

118 篇 英文
20 篇 中文

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

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

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

详细简洁

排序：

引用

International Conference on Information Science and Technology (ICIST)

作者： Zhongqing Wang Yan Yang Yingli Zhong School of Computer Science Technology Heilongjiang University Harbin China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

Graph similarity search is an important research problem in many applications, such as finding result graphs that have a similar structure to a given entity in biochemistry, data mining, and pattern recognition. Top-k graph similarity search is one of graph similarity search tasks, which aims to find the top-k graphs that are most similar to the query graph in a given graph database. In this paper, the top-k similarity search problem based on the graph edit distance is studied according to the corollary of the partitioned similarity theorem. Firstly, in order to speed up the online search process and avoid scanning each graph in the database one by one, an offline hierarchical inverted index is constructed to satisfy top-k search. Secondly, the offline hierarchical inverted index is used to filter the candidate graphs online and verify them, which reduces the time of searching the graphs. Finally, the good performance of the algorithm in running time and scalability is verified by running the similarity algorithm on real dataset and synthetic dataset.

关键词： Information science databases Scalability Filtering algorithms Search problems Partitioning algorithms Indexes

来源：评论

学校读者我要写书评

暂无评论

Visible-Infrared Image Fusion Based on Double- Density Wavelet and Thermal Exchange Optimization

Visible-Infrared Image Fusion Based on Double- Density Wavel...

引用

IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)

作者： Hao Guo Jingyu Chen Xuan Yang Qingliang Jiao Ming Liu Beijing Institute of Environmental Features Beijing China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

ISBN: (数字)9781728180281

ISBN: (纸本)9781728180298

Infrared and visible image fusion has been a hot issue in image fusion. However, the parameters and result image have many proposed. In this paper, a novel visible infrared image fusion algorithm based on double-density wavelet and thermal exchange optimization is proposed. The pre-processed infrared and visible images are decomposed into detail layers and background layers by double-density wavelet transform. Thermal exchange optimization is used to estimate the number of layers and weight thresholds of decomposition. Experimental shows that both visual effects and quantitative analysis of proposed algorithm can get the best results.

关键词： Wavelet transforms Thermal decomposition Wavelet analysis Visual effects Thermal analysis Image fusion Optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Influence Equilibrium Problem Research Based on Common Interests in Mobile Social Network

Influence Equilibrium Problem Research Based on Common Inter...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Jinbao Li Yue Han Jinghua Zhu School of computer Science and technology Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongj iang Province Harbin China

ISBN: (纸本)9781509056972

Influence maximization refers to the number of influenced nodes reach to maximum by finding a set of seed nodes in social network. Due to peoples' excessive concentration of attention, sometimes, negative effects will appear during the influence propagation. However, the negative effects on influence propagation are not involved in the existing research work. In this paper, we consider the influence equilibrium problem in mobile social network. The goal of influence equilibrium is to balance the influential range of different kinds of seed sets through the way of node scheduling. Our goal is to reduce the negative effects by transforming the status of influence from excessive concentration to relatively balanced. There are two main challenges: (1) which nodes should be scheduled in mobile social network in order to achieve a balanced effect. (2) how to schedule the nodes. To address the two challenges, we estimate the randomness of nodes and then schedule the nodes which have high randomness. The entropy-based random walk select balance algorithm(RS_B) is proposed in this paper. To achieve the balanced effect, random walk procedure is adopted to choose the sets that can receive the scheduled nodes during the scheduling phase. However, new imbalance may arise during this procedure. Thus, the entropy-based max-min balance algorithm(MM_B) is proposed to deal with the new imbalance caused by RS_B algorithm. Theoretical analysis and experimental results show that the RS_B and MM_B algorithm can balance the influence range and MM_B performs better than RS_B.

关键词： Social network services Mobile communication Mobile computing Minimization Silicon Probability Software

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Human Pose Estimation Network Based On MultiHeatmap Fusion

Human Pose Estimation Network Based On MultiHeatmap Fusion

引用

Image Processing, Electronics and Computers (IPEC), Asia-Pacific Conference on

作者： Yangguang Zhao Jun Lu Key Laboratory of Database and Parallel Computingof Heilongjiang Province College of Computer Science and Technology Heilongjiang University Haerbin China

ISBN: (数字)9798350374407

ISBN: (纸本)9798350374414

Estimating human pose in complex multi-frame situations is a challenging task and has attracted intensive research by many researchers. Although 3D human pose estimation methods have achieved remarkable results in scenes based on single images, their performance often fails once these model transformations are applied to video sequences. Common problems with these models include inability to cope with motion blur, out-of-focus videos, and occlusion of human poses. In order to solve the above problems, this paper proposes a feature extraction and representation model MHMF, which is used in the feature extraction stage of the model. The initial features extracted by the backbone network HRNet-w32 are guided by the heat map to the attention layer, which improves the network’s attention to important areas for predicting key points of human posture. At the same time, the integration of the aggregation heat map and the backbone network heat map improves the spatiotemporal consistency of the key points. In addition, to improve the accuracy of mesh pose estimation under occlusion, this paper proposes a transformer-based NewDSTformer model. By adjusting the structure of the Transformer encoder, increasing the encoder level and combining it with the dynamic progressive attention masking method. The model can adapt to different input situations, handle the positional relationship of local key points, and be able to perform accurate detection even under occlusion. It was evaluated on the 3DPW data set and improved the accuracy by $0.3 \%$, indicating that this paper effectively improved the performance of 3D human mesh reconstruction.

关键词： Adaptation models Accuracy Three-dimensional displays Pose estimation Video sequences Feature extraction Transformers Spatiotemporal phenomena Heat maps Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

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.

关键词： Recommendation Collaborative Filtering Data Sparsity Expert Demography

来源：评论

学校读者我要写书评

暂无评论

Data Dissemination Protocols Based on Opportunistic Sharing for Data Offloading in Mobile Social Networks

Data Dissemination Protocols Based on Opportunistic Sharing ...

引用

International Conference on parallel and Distributed Systems (ICPADS)

作者： Na Jiang Longjiang Guo Jinbao Li Meirui Ren Sisi Cheng Xiaodan Guo School of Computer Science and Technology Heilongjiang University Harbin China Key Laboratory of Database and Parallel Computing Heilongjiang China

ISBN: (纸本)9781509053827

Due to the increasing popularity of smart mobile devices, the amount of mobile data communications has led to explosive growth of data traffic in cellular networks. Cellular networks have to face the challenge of huge communication traffic. Offloading data traffic through opportunistic communication among smart mobile devices is a promising solution to partially solve this problem since there is almost no monetary cost for it. Large amount of smart mobile devices can communicate each other using Bluetooth or WIFI Direct in short communication range and they can form an opportunistic mobile social network. The opportunistic communications among smart mobile devices can effectively reduce the amount of cellular data traffic. However, mobile users take a long time to obtain useful data. In order to reduce data communication latency, this paper proposes three data dissemination protocols named RRDP(Request-Reply Dissemination Protocol), RDP(Random Dissemination Protocol) and LDP(LRU Dissemination Protocol) respectively. The three proposed protocols are based on opportunistic sharing policy. Extensive NS-2 simulation results show that (1) on the campus situation, the user's access delay of RDP is 56.4% less than the RRDP and LDP is 44.8% less than RRDP. (2) in the vehicular environment, the user's access delay of RDP is 32.5% less than the RRDP and LDP is 28.1% less than RRDP. RDP is the best protocol.

关键词： Protocols Mobile nodes Data dissemination Cellular networks Delays

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：