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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

共 134 条记录，以下是31-40 订阅

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

详细简洁

排序：

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

Node classification problem based on potential information a...

引用

7th International Conference on Information Science and Control Engineering, ICISCE 2020

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

ISBN: (纸本)9781728164069

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. © 2020 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

BIVD: Improved Side Adapter Network based on BiFormer 5

BIVD: Improved Side Adapter Network based on BiFormer

引用

5th Asia-Pacific Conference on Image Processing, Electronics and Computers, IPEC 2024

作者： Hu, Liyuan Lu, Jun Heilongjiang University College of Computer Science and Technology Harbin150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin150080 China

ISBN: (纸本)9798350374407

Currently, most open vocabulary models rely on CLIP (Contrastive Language-Image Pre-training) to classify masked regions, but CLIP models still have many drawbacks. The traditional transformer model is context aware through self attention, but this local context based mechanism is limited by the sequence length of information, it can also impact model effect. Inspired by the article BiFormer, This article replaces the traditional transformer model in the Side Adapter Network (SAN) model with a variant module BIVD block based on BiFormer blocks. This model follows the latest transformer model and extracts features using a four layer feature pyramid structure, For the reduced spatial resolution caused by patch merging, add a Visual-Decoder to reshape the visual vector sequence into a spatial feature map, and restore it to the original resolution through convolution and upsampling. This can enhance the extracted feature information through a feature pyramid without affecting the fusion with CLIP layer features. But the cost is increasing the cost of the model. This article was tested on 5 commonly used datasets and showed a stable improvement in accuracy. © 2024 IEEE.

关键词： BiFormer CLIP component side adapter Visual Decoder

来源：评论

学校读者我要写书评

暂无评论

parallel optimization computing in universal combinatorial coding

Parallel optimization computing in universal combinatorial c...

引用

2014 International Conference on Mechatronics, Electronic, Industrial and Control Engineering, MEIC 2014

作者： Gao, Tingting Lu, Jun Key Laboratory of Database and Parallel Computing Heilongjiang Province Harbin150080 China College of Computer Science and Technology East University of Heilongjiang Harbin China

ISBN: (纸本)9789462520424

Universal combinatorial coding derives from the combination principle and its core is ordinal calculation. The solution of ordinal is a process of computing permutation and combination values. But permutation and combination computing is very time-consuming. As a result, adopting optimized methods or parallel techniques to increase ordinal calculation efficiency is very necessary. parallel optimization algorithms of the ordinal in universal combinatorial coding are advanced based on CPU multi-core and multi-thread techniques in this paper, including prime splitting and unequal parallel algorithms. Firstly, the thesis simplifies the multiplication and division calculations of the ordinal parallel computing through prime splitting optimization. Secondly, the thesis analyzes the deficiency of equal parallel that the unbalanced computing time of each part will lead to inefficient parallel computing of the ordinal, and then proposes the unequal parallel algorithm to shorten the ordinal number calculation. The experiment results of prime splitting and unequal parallel algorithm proved that two parallel optimizations are better in improving the efficiency of ordinal computing. © 2014. The authors - Published by Atlantis Press.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Wireless nerve: Invisible anti-theft system in wireless sensor network

Wireless nerve: Invisible anti-theft system in wireless sens...

引用

Int. Workshops on Web-Age Information Management, WAIM 2012: 1st Int. Workshop on GDMM 2012, 2nd Int. Wireless Sensor Networks Workshop, IWSN 2012, 1st Int. Workshop on MDSP 2012, 3rd Int. Workshop on USDM 2012, 4th Int. Workshop on XMLDM 2012

作者： Ren, Meirui Duan, Jinsheng Qu, Hao Wang, Xinjing Du, Lei School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing Heilongjiang Province Harbin 150001 China

ISBN: (纸本)9783642330490

There are limitations in traditional anti-theft technologies. All the technologies have a common ground, that is: the devices are exposed to the space, also easily found and destroyed by adversaries. This paper demonstrates a Hidden Anti-theft System (HAS) based on wireless sensor network. The sensors can be hidden in walls and furniture. The intruder influences the transmitting link, and RSSI of the link changes. According to the changes, the system can detect the movement in monitoring area, and keep invisible. HAS is applied in indoor environment. Experiment results show that HAS achieves very low false positive and no false negative. © 2012 Springer-Verlag.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Research on parallel Algorithms of Uncertain Combinational Coding 10

Research on Parallel Algorithms of Uncertain Combinational C...

引用

10th IEEE Joint International Information Technology and Artificial Intelligence Conference, ITAIC 2022

作者： Song, Xuanting Lu, Jun College of Computer Science and Technology Heilongjiang University Harbin China Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

ISBN: (数字)9781665422079

ISBN: (纸本)9781665422079

In this era of rapid development of information science and technology, data coding technology has been widely used in multimedia, computer, communication and other fields. Non-deterministic combined coding is further explored in deterministic combined coding. It is a kind of lossless coding. In combinatorial mathematics, the operation of the combination number calculates the ordinal number of the sequence to be coded. On the basis of the deterministic combination coding, the adjacent identical elements are eliminated and processed separately, which reduces the length of the ordinal number. At the same time, the reference sequence is encoded to further save space. However, the ordinal calculation of the non-deterministic combination coding is still a complicated process, and the coding speed is still slow. This article uses openMP technology to parallelize the ordinal calculation part of the non-deterministic combination coding. The running time of coded ordinal on the eight-core CPU is 23.38% of the original, which is 4.28 times optimized, and the overall coding time efficiency of the 17 segmented file instances has been improved about 2.94 times. It indicates the effectiveness of the parallel strategy in this article. Finally, this article analyzes the experimental results. © 2022 IEEE.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

An effective top-k keyword search algorithm based on classified Steiner tree

An effective top-k keyword search algorithm based on classif...

引用

作者： Yang, Yan Tang, Mingzhu Zhong, Yingli Zhang, Zhaogong Guo, Longjiang School of Computer Science and Technology Heilongjiang University 150080 Harbin China Key Laboratory of Database and Parallel Computing Heilongjiang University 150080 Harbin China

ISBN: (纸本)9783642330490

keyword search has become one of hot topics in the field of information retrieval. It can provide users a simple and friendly interface. But the efficiency of some existing keyword search algorithms is low and there are some draws in sorting results. Most algorithms are suited for either unstructured data or structured data. This paper proposes a new kind of top-k keyword search algorithm. No matter the data is unstructured, semi-structured or structured, the algorithm is always effective. It introduces the concept of neighbor sets of nodes and uses set join algorithm to narrow the search space. We also propose the definition of classified Steiner tree, which can reduce the draw phenomenon in results. In addition, the algorithms can output the results of the classified Steiner tree at the same time of computing them. So it can reduce the waiting time of the users and improve the efficiency of keywords search. © 2012 Springer-Verlag.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Community Search in Spatial Uncertain Network

Community Search in Spatial Uncertain Network

引用

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

作者： Zhang, Wenqian Zhong, Yingli Yang, Yan School of Computer Science Technology Heilongjiang University Harbin150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin150080 China

Community search is to explore valuable target community structure from a large social network. In real community, every point has a geographic location information, and many edges are uncertain. Such a network is called spatial uncertain network. In order to meet the existing needs, this paper studies the community search in the spatial uncertain network so that the searched communities can be relatively close in the geographical location and the relationship between each other is also very close. Based on the spatial uncertain graph, this paper proposes K-R-τ community, and proposes a linear algorithm and a two-dimensional algorithm for community search in the spatial uncertain network. A large number of experiments are carried out on several real datasets, and the results show that the algorithm proposed in this paper is effective and accurate. © Published under licence by IOP Publishing Ltd.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

OMA: A multi-channel MAC protocol with opportunistic media access in wireless sensor networks

OMA: A multi-channel MAC protocol with opportunistic media a...

引用

International Conference on Mobile Ad-hoc and Sensor Networks

作者： Li, Jinbao Zhang, Desheng 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: (纸本)9780769543154

To tackle control channel saturation problems, this paper proposes OMA, an asynchronous duty cycle based multi-channel MAC protocol with opportunistic media access for wireless sensor networks. By adopting opportunistic media access, OMA effectively alleviates, if not completely eliminates, control channel saturation problems. More importantly, OMA is fully distributed with no requirements of time synchronization or multi-radio. Therefore, OMA is very easy to be implemented in resource-constrained sensor nodes. Via the theoretical analysis, the opportunistic probability with which a node opportunistically access the control channel is obtained. To validate the effectiveness of opportunistic media access, extensive simulations and real testbed experiments were conducted. The simulation and experimental results show that when the number of channels is large or the network loads are heavy, OMA improves energy efficiency and throughput significantly compared with other works in the literature. © 2010 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

OCO: A multi-channel MAC protocol with opportunistic cooperation for wireless sensor networks

OCO: A multi-channel MAC protocol with opportunistic coopera...

引用

International Workshop on Wireless Network Algorithm and Theory

ISBN: (纸本)9780769543222

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 testbed experiments were conducted. 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. © 2010 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：