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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

8,424 篇 会议
50 篇 期刊文献
29 册 图书

馆藏范围

8,503 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,426 篇 工学
- 3,376 篇 计算机科学与技术...
- 2,256 篇 软件工程
- 1,099 篇 信息与通信工程
- 818 篇 控制科学与工程
- 769 篇 电气工程
- 357 篇 生物工程
- 334 篇 电子科学与技术（可...
- 255 篇 机械工程
- 251 篇 动力工程及工程热...
- 195 篇 生物医学工程（可授...
- 185 篇 网络空间安全
- 178 篇 仪器科学与技术
- 148 篇 交通运输工程
- 140 篇 安全科学与工程
- 139 篇 光学工程
- 115 篇 化学工程与技术
2,204 篇 理学
- 1,653 篇 数学
- 392 篇 生物学
- 367 篇 统计学（可授理学、...
- 331 篇 物理学
- 305 篇 系统科学
- 118 篇 化学
1,107 篇 管理学
- 804 篇 管理科学与工程(可...
- 366 篇 图书情报与档案管...
- 335 篇 工商管理
174 篇 医学
- 151 篇 临床医学
- 145 篇 基础医学(可授医学...
146 篇 法学
- 121 篇 社会学
132 篇 文学
- 128 篇 新闻传播学
114 篇 经济学
- 112 篇 应用经济学
58 篇 教育学
43 篇 农学
16 篇 军事学
9 篇 艺术学

主题

1,132 篇 convergence
442 篇 cloud computing
411 篇 optimization
342 篇 computational mo...
293 篇 genetic algorith...
230 篇 information tech...
200 篇 algorithm design...
196 篇 particle swarm o...
195 篇 neural networks
182 篇 resource managem...
178 篇 servers
175 篇 training
170 篇 internet of thin...
162 篇 computer archite...
143 篇 mobile computing
142 篇 real-time system...
141 篇 wireless sensor ...
137 篇 educational inst...
136 篇 costs
129 篇 deep learning

机构

37 篇 university of ch...
28 篇 state key labora...
25 篇 college of compu...
25 篇 chitkara univers...
22 篇 amrita vishwa vi...
18 篇 beijing key labo...
17 篇 school of comput...
15 篇 university of sc...
15 篇 shenyang institu...
15 篇 college of compu...
15 篇 school of inform...
14 篇 school of comput...
14 篇 department of co...
14 篇 college of infor...
13 篇 faculty of infor...
13 篇 college of compu...
13 篇 national univers...
13 篇 institute of com...
12 篇 communication un...
12 篇 state key labora...

作者

40 篇 jeong jongpil
24 篇 kim dong-seong
20 篇 lee jae-min
19 篇 yang yang
14 篇 wang hui
14 篇 pan jeng-shyang
13 篇 wang lei
12 篇 zhiwei ye
12 篇 dong-seong kim
11 篇 sampedro gabriel...
11 篇 peeta basa pati
11 篇 younghan kim
11 篇 jongpil jeong
10 篇 jongwon kim
10 篇 rajagopal shinu ...
10 篇 lee jae min
9 篇 jie yang
9 篇 li li
9 篇 liu yang
9 篇 jae-min lee

语言

8,333 篇 英文
143 篇 其他
38 篇 中文
1 篇 法文

检索条件"任意字段=International Conference on Computing and Convergence Technology"

共 8503 条记录，以下是51-60 订阅

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

详细简洁

排序：

HQC-Bend: A Python Package of Hybrid Quantum-Classical Multi-cuts Benders’ Decomposition Algorithm

HQC-Bend: A Python Package of Hybrid Quantum-Classical Multi...

引用

Quantum Communications, Networking, and computing (QCNC), international conference on

作者： Zhongqi Zhao Mingze Li Lei Fan Zhu Han Department of Electrical and Computer Engineering University of Houston Houston TX USA Department of Engineering Technology University of Houston Houston TX USA

ISBN: (数字)9798331531591

ISBN: (纸本)9798331531607

This article introduces the Hybrid Quantum-Classical Multi-Cut Benders’ Decomposition (HQC-Bend) algorithm, an efficient, open-source Python script designed to tackle complex Mixed-Binary Linear Programming (MBLP) problems with a block structure by integrating quantum and classical computing methods. HQC-Bend decomposes large MBLP models into a master problem and smaller, manageable subproblems, iteratively refining solutions to accelerate convergence. By leveraging quantum computing for specific computational tasks and classical methods for others, the algorithm significantly enhances efficiency. Supported by D-Wave for quantum solving and Gurobi for classical solving, the demonstration includes two primary modes of problem solving: a purely classical iteration and a hybrid quantum-classical approach. Experimental validations on real-world cases demonstrate the algorithm’s effectiveness and offer practical insights, highlighting its potential for broad adoption across various topics and fields.

关键词： Knowledge engineering Quantum computing Computational modeling Refining Linear programming Problem-solving Optimization Python Quantum communication convergence

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Swarm Intelligence Model for Efficient Query Optimization in Distributed Databases Using Genetic and Ant Colony Algorithms

A Hybrid Swarm Intelligence Model for Efficient Query Optimi...

引用

2025 international conference on Intelligent Control, computing and Communications, IC3 2025

作者： Jayasri, Nemala Santosh Kumar, B. Singh, Navdeep Singh, Ajeet Al-Rubaye, Taqi Mohammed Khattab Rao, Mallikarjuna Mlr Institute of Technology Department of CSE-AI&ML Telangana Hyderabad India New Horizon College of Engineering Department of Computer Science Engineering Bangalore India Lovely Professional University Phagwara India Galgotias university Department of Electrical Electronics & Communication Engineering Uttar Pradesh Gerater Noida203201 India College of Medical Technologies The Islamic University Department of Medical Laboratory Technology Najaf Iraq Griet Department of Cse Bachupally Telangana Hyderabad India

ISBN: (纸本)9798331527495

Optimisation of queries in distributed databases is more imperative to enhance the processing rate and use of resources with limited computational abilities. This work presents a novel GA-ACO hybrid swarm intelligence model to address the query optimization problem. The optimization effort of the proposed model starts with GA for an initial population of probable paths for query execution which uses the concept of evolution to select diverse solutions. After that, ACO strengthens this set by the application of pheromone-based reinforcement that allows adjusting of a query paths toward the best solution or its approximation with the following number values. In this way the enhancement of the convergence rates and the scalability of the proposed solution when distributed databases are used can be explained. The model was tested with artificial query logs with DEAP being used for the implementation of the genetic algorithm while ant colony operations were implemented using Python built ACO libraries. Performance analysis shows the success of the developed model in decreasing query response time as follows: This essentially complex hybrid mechanism shows potential for future use in other areas with large data sets and efficient query handling. © 2025 IEEE.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Adaptive Self-healing Routing for Heterogeneous Ambient Backscatter Wireless Sensor Networks 18th

Adaptive Self-healing Routing for Heterogeneous Ambient Bac...

引用

18th international conference on Wireless Artificial Intelligent computing Systems and Applications, WASA 2024

作者： Guo, Huanyu Gao, Hong Yang, Donghua Harbin Institute of Technology Harbin China Zhejiang Normal University Jinhua China

ISBN: (纸本)9783031714665

This paper investigates the adaptive and self-healing routing problem in heterogeneous ambient backscatter wireless sensor networks (AB-WSNs). In such networks, battery-less nodes harvest energy only from ambient RF signals generated by dedicated RF sources and communicate with each other by backscattering these signals, leading to nodes having different communication ranges, referred to as heterogeneous links. Consequently, routing in heterogeneous AB-WSNs suffers from intermittent and irregular connections, dynamic topology, heterogeneous links and ultra-low-power designs of battery-less nodes. To address these issues, we first introduce a multi-agent network model, and concurrently, we present a heterogeneous multi-hop channel competition mechanism to avoid collisions under heterogeneous links. We then model the routing problem as a Markov decision process, enabling battery-less nodes to employ reinforcement learning approaches. Finally, we propose a policy-based learning algorithm that allows each node to learn the optimal routing policy and perform adaptive and self-healing routing. Furthermore, to solve sparse reward issues arising from collision avoidance efforts, we simultaneously integrate the learning from demonstration and prioritized experience replay mechanisms into our proposed learning algorithms. We analyze the convergence of proposed learning algorithm and evaluate its convergence and efficiency through extensive experiments. The experiment results also validate the efficiency of the proposed mechanisms. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Emerging 5G, IoT and WSN: Opportunities, Challenges and Remedies

Emerging 5G, IoT and WSN: Opportunities, Challenges and Reme...

引用

international conference on Web Research (ICWR)

作者： Mohammad Reza Saadatmand Mohsen Ghotbi Technical & Network Operation Department Information Technology Business Intelligence MCI Tehran Iran Research & Development Department MCI Tehran Iran

ISBN: (数字)9798331508913

ISBN: (纸本)9798331508920

The convergence of 5th generation (5G) technology with the Internet of Things (IoT) and Wireless Sensor Networks (WSNs) will be investigated in this paper. This convergence of these concepts will bring many benefits to the quality of life in communities by increasing the number of connected devices more safely and resulting in higher data rates. However, like any other uprising, it will have challenges, concerns, and bottlenecks. We offer resolutions and remedies to make applying the above three elements more feasible, accessible, and tangible. Future research directions for industries, academia, and policymakers will also be suggested.

关键词： Wireless communication Industries Wireless sensor networks Quantum computing 5G mobile communication Merging Ultra reliable low latency communication Internet of Things Sustainable development convergence

来源：评论

学校读者我要写书评

暂无评论

Optimizing Network Routing: Performance Analysis of OSPF in FABRIC Testbed

Optimizing Network Routing: Performance Analysis of OSPF in ...

引用

Advancements in Electrical, Electronics, Communication, computing and Automation (ICAECA), international conference on

作者： Cynthia Jayapal Pranava Yohita P Shifana Shirin Shreeja D K Computer Science Engineering Kumaraguru College of Technology Coimbatore India

ISBN: (数字)9798331525439

ISBN: (纸本)9798331525446

Networking research needs testbeds that are flexible, fast, and efficient. FABRIC is a modern platform built for advanced experiments, offering better customization and performance. This paper compares FABRIC and GENI, focusing on how well they handle routing protocols, especially Open Shortest Path First (OSPF), a widely used method for finding the best network paths. The study looks at control overhead, which is the extra data used for routing, and convergence time, which shows how quickly the network adapts to changes. By testing OSPF on FABRIC, we see how it compares to GENI in handling network updates. The results show that FABRIC lowers overhead and speeds up convergence, making it a better choice for research and real-world use. Its flexible design also makes it future-ready, supporting faster and more efficient networking in evolving systems. FABRIC’s ability to adapt to changing network conditions makes it a reliable choice for future innovations.

关键词： Technological innovation Scalability Routing Fabrics Routing protocols Telecommunication computing Virtualization Software defined networking convergence Testing

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Systems for Autonomous IoT Network Management Using Distributed Reinforcement Learning 3

Multi-Agent Systems for Autonomous IoT Network Management Us...

引用

3rd international conference on Intelligent Systems, Advanced computing, and Communication, ISACC 2025

作者： Neelamegam, G. Venkatesan, Rajaram Ramya, S.R. Ramya, R.S. Akshya, J. Sundarrajan, M. Choudhry, Mani Deepak VSB College of Engineering and Technology Department of Computer Science and Engineering Tamil Nadu Coimbatore India Builders Engineering College Department of Artificial Intelligence and Data Science Tamil Nadu Tirupur India Dr NGP Institute of Technology Department of Computer Science and Engineering Tamil Nadu Coimbatore India Sri Ramakrishna Engineering College Department of Computer Science and Engineering Tamil Nadu Coimbatore India SRM Institute of Science and Technology Department of Computational Intelligence Tamil Nadu Chennai India SRM Institute of Science and Technology Department of Networking and Communications Tamil Nadu Chennai India SRM Institute of Science and Technology Department of Computing Technologies Tamil Nadu Chennai India

ISBN: (纸本)9798331523893

The ever-growing complexity of IoT networks ignited by their wide scale adoption in applications such as smart cities, the industrial automation, and health care, compelled to develop sophisticated yet resource efficient and scalable network management solution. Centralized systems are traditional in architecture, which leads to higher latency and bottlenecks, while decentralized systems can distribute workloads however the lack of adaptability to real time, along with the difficulty of extracting maximum resource usage, are limitations. In recent years, reinforcement learning (RL) based approaches have taken shape as a promising alternative to facilitate the automated learning and optimisation of task management. However, there are two challenges for existing RL based methods: slow convergence, inefficient priority assignment of tasks, and poor coordination amongst agents in the case of dynamic, large scale IoT environment. To solve these challenges, in this research we propose a distributed reinforcement learning based multi agent framework for managing IoT network. The framework also integrates a task prioritization mechanism to dynamically choose an optimal task allocation solution. Further validation was performed in a simulated IoT environment where real world inspired datasets were used. The proposed framework demonstrated 30% more task throughput than centralized, 25% less latency than decentralized, and 40% more energy efficiency than current RL based systems. The system was further validated using advanced visualizations such as anomaly detection maps and resource allocation efficiency graphs, demonstrating its capacity to manage dynamic load of tasks and resource allocation. The proposed framework addresses the critical limitations of current methods, through scalable, adaptive, and energy efficient framework for managing IoT network, and accordingly helps advancing the intelligent and autonomous IoT systems. © 2025 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Modified Grey Wolf Optimization using Refraction Learning and Differential Evolution Mutation

Modified Grey Wolf Optimization using Refraction Learning an...

引用

Emerging Systems and Intelligent computing (ESIC), international conference on

作者： Pranshu Bajaj Siddharth Dhingra Karan Aggarwal Preeti Kaur Netaji Subhas University of Technology New Delhi India

ISBN: (数字)9798331522100

ISBN: (纸本)9798331522117

An enhanced variant of the Grey Wolf Optimisation (GWO) technique is presented in this paper, addressing a number of issues, including reduced population diversity, slow convergence and vulnerability to local optima. The proposed variant incorporates innovative techniques, including Opposition Learning, Refraction Learning (RL), Differential Evolution Mutation and a non-linear time-varying hyperparameter tuning mechanism. Combining these strategies greatly enhances the standard GWO’s performance, leading to a more streamlined and effective search procedure. This enhancement leads to better performance in multi-modal landscapes, facilitates escaping local optima and allows the search space to be explored more extensively. Extensive testing across 23 benchmark functions demonstrates that the new variant outperforms the original GWO as well as other contemporary optimization methods. The results indicate substantial improvements in convergence speed, global search capability and solution accuracy, demonstrating how effective this method can be as an optimisation tool for solving challenging real-world issues.

关键词： Metaheuristics Diversity reception Optimization methods Benchmark testing Space exploration Particle swarm optimization Optimization Tuning Standards convergence

来源：评论

学校读者我要写书评

暂无评论

Incentivizing Crowdsensing for DT-Enabled Metaverse 20th

Incentivizing Crowdsensing for DT-Enabled Metaverse

引用

20th IFIP WG 10.3 international conference on Network and Parallel computing, NPC 2024

作者： Ye, Dongdong Huang, Xumin Wu, Yuan Kang, Jiawen Zhong, Weifeng Niyato, Dusit School of Automation Guangdong University of Technology Guangzhou China State Key Laboratory of Internet of Things for Smart City University of Macau Taipa China Department of Computer and Information Science University of Macau Taipa China Collge of Computing and Data Science Nanyang Technological University Singapore Singapore

ISBN: (纸本)9789819628292

Digital Twin (DT) has been proposed as a key enabling technology to produce a digital clone of the physical world and facilitate the convergence of the physical and virtual worlds for building a real-world Metaverse. For physical-virtual synchronization, crowdsensing is applied to employ Internet of Things (IoT) devices to sense physical objects and collect status information for timely updating the associated DTs. However, an incentive mechanism is necessitated to stimulate the devices to perform sensing tasks while meeting task requirements such as Age of Information (AoI) requirements. Thus, we adopt a contract theoretic approach to design an incentive mechanism for the devices that are classified into several types and the type parameters are unknown to others. The contract consists of a set of contract items with each contract item representing a device type, which specifies the required data updating frequency and monetary reward. We formulate an optimal contract design problem subject to feasible constraints including the average AoI requirement for each device type. Furthermore, we solve the problem by transforming it into a convex optimization problem that can be directly tackled by the existing methods. Finally, we provide numerical results to demonstrate the effectiveness and efficiency of our scheme. © IFIP international Federation for Information Processing 2025.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Genetic Algorithm Modeling and Analysis of Acyclic Coloring in High Chromatic Graphs

Genetic Algorithm Modeling and Analysis of Acyclic Coloring ...

引用

Device Intelligence, computing and Communication Technologies, (DICCT), international conference on

作者： V. Vinitha Navis Raja Marappan School of Advanced Sciences Vellore Institute of Technology Chennai India School of Computer Science and Engineering Vellore Institute of Technology Chennai India

ISBN: (数字)9798331543358

ISBN: (纸本)9798331543365

The acyclic coloring problem, a specialized area within graph coloring, has numerous applications across diverse fields. It involves assigning colors to the vertices of a graph such that no two adjacent vertices share the same color and no bichromatic cycles exist. This problem becomes particularly challenging in high chromatic graphs. In this paper, we introduce a genetic algorithm (GA) with structure-aware selection, crossover, and mutation operators to enhance performance on some benchmark graphs having high chromatic numbers. Compared to the state-of-the-art methods, the proposed GA achieves a 5% to 12.5% reduction in the acyclic chromatic number. Success rates remain high, exceeding 90% for queen graphs, 80% to 90% for Leighton graphs, and 70% to 80% for random graphs. High crossover rates, approximately 17000 to 20000 on an average, maintain diversity, while adaptive mutation strategies enhance convergence. These findings highlight the advantage of integrating structural awareness into evolutionary algorithms for efficient acyclic coloring solutions.

关键词： Analytical models Color Evolutionary computation Benchmark testing Communications technology Approximation methods Standards Optimization Genetic algorithms convergence

来源：评论

学校读者我要写书评

暂无评论

A Satellite-Ground Link Handover Strategy in LEO Networks Using Advantage Actor-Critic Algorithm 20th

A Satellite-Ground Link Handover Strategy in LEO Networks U...

引用

20th IFIP WG 10.3 international conference on Network and Parallel computing, NPC 2024

作者： Chen, Chen Tong, Chenqiang Cong, Li Wang, Zhiyi Jin, Fan Zhou, Xiaobo Pei, Qingqi School of Telecommunication Engineering Xidian University Xi’an710071 China Xidian Guangzhou Institute of Technology Xidian University Guangzhou China Xidian Hangzhou Institute of Technology Xidian University Hangzhou China The State Grid Jilin Province Electric Power Company Changchun130000 China National Key Laboratory of Science and Technology on Space Microwave CAST Xi’an710100 China College of Intelligence and Computing Tianjin University Tianjin300350 China

ISBN: (纸本)9789819628636

Low Earth Orbit (LEO) satellite network is a crucial component of the Space-Air-Ground Integrated Network (SAGIN) architecture and Non-Terrestrial Networks (NTN). It can provide global, real-time, and seamless broadband data services to many users, playing a critical role in emergencies such as disaster relief. This paper proposes an LEO satellite networks satellite-ground link handover strategy based on Advantage Actor-Critic (A2C) to tackle challenges associated with high handover frequency among ground users, data transmission blocking, and access selection post-handover due to the high-speed cyclic motion of satellites. The strategy considers three handover factors: signal reception strength, satellite potential service time, and service quality. At first, the handover problem is modeled as a combinatorial optimization problem, subsequently transformed into a Markovian Action-Value Function (MAVF) based Multi-Agent Markov Decision Process (MAMDP), and solved in the framework of the A2C algorithm proposed in this paper. The results of simulations illustrate the superior performance of the proposed handover strategy compared to three alternative strategies, namely, Random Handover (RH), Maximum number of Free Channels (MFC), and Maximum Service Time (MST), in terms of both convergence and practicality. The average number of handover occurrences can be reduced by up to 58%, consequently lowering the probability of blocking data transmission. Moreover, signal quality exhibits more excellent stability and can be enhanced by up to 39%, thereby ensuring user communication quality. © IFIP international Federation for Information Processing 2025.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：