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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

984 篇 会议
221 篇 期刊文献

馆藏范围

1,205 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

726 篇 工学
- 419 篇 信息与通信工程
- 365 篇 计算机科学与技术...
- 254 篇 软件工程
- 215 篇 电子科学与技术（可...
- 116 篇 仪器科学与技术
- 80 篇 电气工程
- 66 篇 控制科学与工程
- 53 篇 生物工程
- 46 篇 动力工程及工程热...
- 45 篇 机械工程
- 42 篇 光学工程
- 36 篇 交通运输工程
- 23 篇 网络空间安全
- 21 篇 生物医学工程（可授...
- 17 篇 航空宇航科学与技...
- 13 篇 化学工程与技术
- 10 篇 土木工程
- 9 篇 材料科学与工程（可...
248 篇 理学
- 145 篇 数学
- 74 篇 物理学
- 59 篇 统计学（可授理学、...
- 55 篇 生物学
- 26 篇 系统科学
- 14 篇 化学
152 篇 管理学
- 123 篇 管理科学与工程(可...
- 48 篇 工商管理
- 33 篇 图书情报与档案管...
14 篇 法学
- 13 篇 社会学
13 篇 经济学
- 13 篇 应用经济学
10 篇 医学
- 10 篇 临床医学
6 篇 农学
5 篇 文学
2 篇 军事学
2 篇 艺术学
1 篇 教育学

主题

65 篇 wireless communi...
61 篇 interference
49 篇 simulation
44 篇 resource managem...
41 篇 quality of servi...
38 篇 delays
37 篇 signal to noise ...
37 篇 energy efficienc...
36 篇 throughput
36 篇 optimization
34 篇 bandwidth
32 篇 mobile communica...
30 篇 algorithm design...
28 篇 wireless network...
27 篇 conferences
27 篇 internet
26 篇 receivers
25 篇 energy consumpti...
23 篇 wireless sensor ...
23 篇 training

机构

485 篇 beijing key labo...
115 篇 beijing key labo...
73 篇 beijing key labo...
48 篇 beijing universi...
46 篇 beijing laborato...
42 篇 beijing laborato...
41 篇 college of elect...
39 篇 laboratory of ne...
38 篇 beijing laborato...
29 篇 school of inform...
28 篇 beijing key labo...
21 篇 beijing laborato...
17 篇 beijing laborato...
16 篇 beijing laborato...
14 篇 beijing universi...
12 篇 beijing universi...
11 篇 beijing universi...
10 篇 technology resea...
10 篇 the beijing key ...
10 篇 beijing key labo...

作者

102 篇 xiangming wen
89 篇 zhaoming lu
71 篇 wen xiangming
65 篇 lu zhaoming
62 篇 guo caili
61 篇 yang yang
57 篇 wu muqing
56 篇 caili guo
55 篇 chunyan feng
48 篇 zhimin zeng
46 篇 guochu shou
45 篇 tiankui zhang
44 篇 muqing wu
42 篇 yihong hu
36 篇 changchuan yin
35 篇 luhan wang
33 篇 li deng
33 篇 deng li
31 篇 yin changchuan
30 篇 feng botao

语言

1,152 篇 英文
44 篇 中文
9 篇 其他

检索条件"机构=Beijing Laboratory of Network System Architecture and Convergence"

共 1205 条记录，以下是131-140 订阅

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

详细简洁

排序：

Multi-Task Semantic Communications: An Extended Rate-Distortion Theory Based Scheme

Multi-Task Semantic Communications: An Extended Rate-Distort...

引用

IEEE International Conference on Communications Workshops, ICC

作者： Zhengfen Sun Fangfang Liu Yang Yang Wanjie Tong Caili Guo Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China

Semantic communication is a new communication paradigm, which aims at transmitting semantic symbols for artificial intelligence (AI) tasks. When there are multiple target AI tasks, existing studies typically require extracting and transmitting dedicated semantics for each AI task. Considering the fact that each AI task may share common semantics, this paper proposes a joint source-channel coding scheme for multi-task semantic communication systems, which can extract the common semantics required by multiple AI tasks, so that the overall transmitted semantics can be reduced. To this end, we first formulate the multi-task semantic communication problem as an rate-distortion problem, which simultaneously takes the rate of the extracted semantics and the distortion of multiple AI tasks into consideration. Then, we derive a new form of rate-distortion, coined as extended rate-distortion, which can guide the extraction of the compact semantics of multiple AI tasks simultaneously. To guarantee the appropriate trade-off between the rate and distortion of multiple AI tasks, we further propose a rate adjustment module that can dynamically adjust the rate according to channel conditions. Experimental results show that the proposed method can achieve 7.6% multi-task performance gain with 40% reduction in transmission overhead compared with existing single-task oriented communication systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhanced Precision Time Synchronization with Measurement and Compensation in TSN

Enhanced Precision Time Synchronization with Measurement and...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Chenlong Yao Guochu Shou Boyang Niu Xiaodong Zhang Hongxing Li Yaqiong Liu Yihong Hu Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China

Time synchronization is a key technology in time-sensitive networking (TSN) to support deterministic data transmission with bounded latency, low delay jitter, and zero congestion loss guarantee. TSN uses IEEE 802. IAS protocol to achieve time synchronization. The asymmetry of the propagation link, clock drift, and limited node clock frequency resolution limit the TSN time synchronization performance improvement. In this paper, we propose a scheme for enhancing the time synchronization performance of TSN and design a method to enhance the TSN time synchronization accuracy by precisely measuring the deviation of the start frame delimiter (SFD) identification signal of the frame initiator from the local received clock signal, and taking the measured value as the compensation amount. Furthermore, we introduce a time correction algorithm in the compensation process. The corresponding development implementation is completed in FPGA, and a test environment is constructed for experimental verification. The experimental results obtain a time synchronization accuracy of 7.5ns, and the synchronization accuracy is even better than 5ns after introducing the time correction algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Delay-bounded Topology Construction and Routing Integration for Time-critical Services

Delay-bounded Topology Construction and Routing Integration ...

引用

IEEE Symposium on network Operations and Management

作者： Xiaofu Huang Guochu Shou Yaqiong Liu Zehua Gao Yihong Hu Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China

Applications such as virtual/augmented reality, autonomous systems, and telemedicine require delay-bounded transmission. This paper combines the software-defined network (SDN) paradigm and proposes an integrated solution for topology construction and routing (TCR). First, the solution gives a delaybounded constraint for adding valid links, which can be adapted to various topology construction methods. Then, topology discovery, resource management, flow management, and route selection are performed in the orchestration and configuration plane. TCR enables time-sensitive network management and configuration with flexibility. The performance of the TCR is evaluated in a typical industrial network topology. The experimental results show that the TCR can effectively reduce the average path length (APL), guarantee bounded delay, and is beneficial for load balancing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An edge caching strategy based on separated learning of user preference and content popularity

An edge caching strategy based on separated learning of user...

引用

2021 IEEE/CIC International Conference on Communications in China, ICCC 2021

作者： Chen, Guanpeng Jing, Wenpeng Wen, Xiangming Lu, Zhaoming Zhao, Shuyue Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence Beijing Laboratory of Advanced Information Networks Beijing China

ISBN: (纸本)9781665443852

Mobile edge caching has recently been proposed as a promising technique to efficiently relieve traffic burden by storing contents in the mobile edge server, or even the base station (BS). However, it remains a challenging problem that how to select the appropriate content considering the limited users and cache capacity of a BS. Motivated by the advance for mining the preference of users in the recommendation system, we propose a proactive edge caching strategy which is based on a novel user preference prediction model called Neural Collaborative Filtering without Content Popularity (N CFCP). Since content popularity and personal preference have different laws of change, our proposed strategy attempts to separate them to improve the accuracy of prediction for user preference. An optimization problem is formulated to maximize the cache hit ratio and is decomposed into two subproblems, i.e., the individual preference prediction and content placement. For individual preference prediction, we design the novel NCFCP method, which can model the relationship between users and contents more precisely. For content placement, we develop a caching mechanism based on the group preference where user activity is considered. Performance evaluation over a real-world dataset shows that the proposed algorithm outperforms baseline algorithms in terms of the cache hit ratio and users' satisfaction by 18% and 20% on average, respectively. © 2021 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Genetic-Based Cluster Routing Algorithm for Wireless Sensor networks 7

Genetic-Based Cluster Routing Algorithm for Wireless Sensor ...

引用

7th International Conference on Computer and Communications, ICCC 2021

作者： Guo, Jin Wu, Muqing Beijing University of Posts and Telecommunication Beijing Laboratory of Advanced Information Networks Beijing Key Laboratory of Network System Architecture and Convergence Beijing China

ISBN: (纸本)9781665409506

Wireless sensor networks consist of numerous sensor nodes with limited energy. Since wireless sensor networks are primarily deployed in complex environments, it is difficult to charge or replace nodes. So, a primary concern of wireless sensor networks is the efficient use of node energy. In this research, we propose a genetic-based cluster routing algorithm. The algorithm uses the distance to the base station and the remaining energy to select the appropriate cluster heads. Besides, it uses the genetic algorithm to find the optimal transmission paths with load balance and low total energy consumption. Simulation results show that our algorithm is superior to LEACH in terms of the network lifetime, the variance of the energy, and residual energy. © 2021 IEEE.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Unequal Clustering Protocol based on Fuzzy Logic and Entropy Weight Method 7

Research on Unequal Clustering Protocol based on Fuzzy Logic...

引用

7th International Conference on Computer and Communications, ICCC 2021

作者： An, Quanbiao Wu, Muqing Lu, Sixu Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks Beijing Key Laboratory of Network System Architecture and Convergence Beijing China

ISBN: (纸本)9781665409506

Clustering is an effective strategy to minimize the energy consumption of nodes in energy-constrained wireless sensor networks. In clustered wireless sensor networks, the network is divided into multiple clusters, and each cluster has a coordinator called cluster head, which collects data from its cluster members and forwards it to the base station through other cluster heads. Cluster wireless sensor networks often have hot spot problems. Due to high energy consumption caused by data forwarding load, cluster heads near the base station die earlier. This kind of node death leads to the coverage loophole of the network early and reduces the life cycle of the network. Unequal clustering is a technology to solve this problem. In non-uniform clustering wireless sensor networks, the size of clusters near the base station is smaller than that far away from the base station. In the process of cluster formation, non-cluster-head nodes are generally added to nearby cluster-head nodes. In this paper, an unequal clustering protocol based on fuzzy logic and entropy weight method (FEUC) is proposed to extend the life cycle of the network. This protocol makes the network form clusters of different sizes. Fuzzy logic method is used to select cluster heads and non-cluster heads join cluster heads to form clusters. The objective entropy weight method is used to select relay cluster heads to implement multi-hop routing strategy. Mamdani method is used for fuzzy reasoning. The proposed protocol is compared with the low-energy adaptive clustering hierarchy (LEACH) protocol, the energy-aware unequal clustering fuzzy protocol (EAUCF), and the fuzzy-based unequal clustering protocol (FUCA), in all scenarios, the proposed protocol has better performance. © 2021 IEEE.

关键词： Base stations

来源：评论

学校读者我要写书评

暂无评论

Beam-Based Secure Physical Layer Key Generation for mmWave Massive MIMO system 15th

Beam-Based Secure Physical Layer Key Generation for mmWave M...

引用

15th EAI International Conference on Communications and networking, ChinaCom 2020

作者： Gao, Hao Huang, Yanling Liu, Danpu Beijing Laboratory of Advanced Information Networks Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9783030677190

Massive MIMO system greatly enriches the randomness of the secret keys in the physical layer and increases the rate of key generation. However, it is not practical to obtain full channel state information for key generation in actual communication scenarios due to a large number of additional signaling overhead. In this paper, we proposed a feasible physical layer key generation scheme by using the beam information as a random source. The procedure for key generation is designed based on the current beam management mechanism in 5G NR. Therefore, the secret key is synchronously generated in the process of two-stage beam search between the gNB and the UE before data transmission, and the additional signaling overhead for key generation is little. Furthermore, to cope with the non-uniform distributed characteristics of the beams, we adopt Huffman code in the encoding of the beam index, thereby improving the efficiency of the key generation. Simulation results show that the proposed scheme can achieve mutual information per bit as high as 0.97, which is 2% to 3% better than that of equal length coding. Furthermore, the bit disagreement rate can be less than 1% in a harsh communication environment with a signal-to-noise ratio of −10 dB. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： MIMO systems

来源：评论

学校读者我要写书评

暂无评论

Weighted Voronoi Sensing Partition Algorithm for Multi-layer Wireless Sensor network 7

Weighted Voronoi Sensing Partition Algorithm for Multi-layer...

引用

7th International Conference on Computer and Communications, ICCC 2021

作者： Xing, Zehui Wu, Muqing Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks Beijing China

ISBN: (纸本)9781665409506

Wireless sensor networks have been widely implemented in plenty of areas such as environmental observation, agricultural industry, military programs, etc. These sensors are usually deployed in places that are inconvenient or hostile to people, and thus, they cannot be charged and will be abandoned once their energy runs out. In this article, a novel algorithm, WVSP (Weighted Voronoi Sensing Partition Algorithm), is proposed. It is based on hierarchical architecture, which improves the scalability of networks when there are plenty of nodes within the networks. WVSP divides the sensing area into several concentric fan-like rings whose center is the sink node. In each fan-like layer, WVSP computes an optimal number of cluster heads by a correction factor and uses weighted Voronoi polygons to set up clusters. Compared to the LEACH (Low Energy Adaptive Clustering Hierarchy algorithm) and OHILEACH (Optimized Heuristic algorithm of Improved Low Energy Adaptive Clustering Hierarchy), the proposed WVSP algorithm improves the performance of network lifetime and energy efficiency. The simulation demonstrates that in the first scenario, WVSP can save 46.7% and 20.2% more energy than LEACH and OHILEACH, with 75.5% and 35.5% more nodes still alive than LEACH and OHILEACH. In the second scenario, WVSP can save 26.7% and 10.3% more energy than LEACH and OHILEACH, with 65.5% and 40.0% more nodes still alive than LEACH and OHILEACH. © 2021 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Identification of Key Nodes in Complex networks 7

Identification of Key Nodes in Complex Networks

引用

7th International Conference on Computer and Communications, ICCC 2021

作者： Qiao, Lilin Wu, Muqing Zhao, Min Beijing Laboratory of Advanced Information Networks Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781665409506

Identification of key nodes in network is of great significance in practical application. Some of the existing importance evaluation indexes have the defects of limited scope of application and incomplete evaluation results. Considering that the importance of nodes in complex networks is not only affected by a single factor, this paper proposes a key node identification algorithm based on multi-attribute weighted fusion (KNIA-MWF). We quantitatively analyze the influence of different attributes on nodes and assign the index weights by the combination of objective entropy weight method (EWM) and subjective analytic hierarchy process (AHP) to obtain the final topological importance (FTI) of each node which represents its structural importance. This algorithm can not only be used to identify the key nodes of different types of complex networks, but also be easy to be extended. Experimental results of removing key nodes in five kinds of networks show that KNIA-MWF can accurately identify the critical nodes in complex networks. © 2021 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Reliability and Latency of MmWave Communications Based on Blockage Avoidance in Internet of Vehicles 13

Reliability and Latency of MmWave Communications Based on Bl...

引用

13th International Conference on Wireless Communications and Signal Processing, WCSP 2021

作者： Cao, Yongxu He, Xinxin Yu, Congqing Yin, Changchuan Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks Beijing Key Laboratory of Network System Architecture and Convergence Beijing100876 China

ISBN: (纸本)9781665407854

The millimeter wave(mmWave) communication is a viable approach to support the Gbps data rates that would be required for raw sensor data exchange among autonomous vehicles. However, there is a main challenges resulting from the use of high-frequency bands: the mmWave blockage effect. In this paper, we propose a blockage avoidance based mmWave relay scheme for the Internet of Vehicles. Specifically, we first propose a mmWave link availability identification method based on the vehicle geometric relationship and the spatial correlation between sub-6 GHz signals and mmWave signals. Secondly, in order to improve the reliability of all vehicle sensor data transmission and reduce the overall transmission delay, a resource allocation scheme based on the real-time blocking relationship graph among multilane vehicles is proposed. The simulation show that compared with the baseline, the packet loss rate of proposed scheme is increased by 20%, and the transmission delay is reduced by 80%, which can realize stable, reliable and efficient transmission. © 2021 IEEE.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共121页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：