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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

314 篇 期刊文献
237 篇 会议
13 篇 学位论文
1 篇 资讯

馆藏范围

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

日期分布

学科分类号

490 篇 工学
- 322 篇 计算机科学与技术...
- 163 篇 电气工程
- 87 篇 信息与通信工程
- 60 篇 控制科学与工程
- 58 篇 软件工程
- 24 篇 机械工程
- 24 篇 仪器科学与技术
- 15 篇 电子科学与技术（可...
- 14 篇 航空宇航科学与技...
- 13 篇 石油与天然气工程
- 11 篇 材料科学与工程（可...
- 8 篇 动力工程及工程热...
- 7 篇 网络空间安全
- 6 篇 力学（可授工学、理...
- 5 篇 土木工程
- 5 篇 测绘科学与技术
107 篇 理学
- 60 篇 数学
- 17 篇 系统科学
- 14 篇 物理学
- 12 篇 化学
- 9 篇 生物学
- 9 篇 统计学（可授理学、...
- 5 篇 地球物理学
64 篇 管理学
- 55 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
14 篇 医学
- 9 篇 临床医学
13 篇 教育学
- 9 篇 教育学
- 6 篇 心理学(可授教育学...
8 篇 经济学
- 6 篇 应用经济学
7 篇 法学
- 6 篇 法学
3 篇 农学
2 篇 军事学
2 篇 艺术学
1 篇 哲学
1 篇 文学

主题

565 篇 algorithm design
24 篇 algorithms
24 篇 optimization
15 篇 machine learning
10 篇 algorithm design...
9 篇 simulation
9 篇 artificial intel...
8 篇 approximation al...
8 篇 data mining
8 篇 cloud computing
7 篇 metaheuristics
7 篇 computational ge...
7 篇 mobile edge comp...
7 篇 evolutionary alg...
7 篇 particle swarm o...
7 篇 resource allocat...
6 篇 genetic algorith...
6 篇 algorithm comple...
6 篇 social networks
6 篇 energy consumpti...

机构

7 篇 southeast univ s...
4 篇 boston univ bost...
3 篇 ohio state univ ...
3 篇 univ chinese aca...
3 篇 nanjing univ sta...
3 篇 northeast petr u...
3 篇 ben gurion univ ...
3 篇 univ maryland de...
3 篇 queen mary univ ...
3 篇 city univ hong k...
3 篇 univ calif santa...
3 篇 isi fdn turin
2 篇 univ houston dep...
2 篇 univ arizona dep...
2 篇 computer science...
2 篇 yunnan coll busi...
2 篇 inra ur math & i...
2 篇 chongqing univ c...
2 篇 univ alicante de...
2 篇 univ versailles ...

作者

5 篇 wu weiwei
5 篇 liu xi
4 篇 prieto javier
4 篇 shan feng
4 篇 casado-vara robe...
4 篇 liu jun
4 篇 shen chih-ya
4 篇 nong ge
4 篇 xie lei
4 篇 day whe
4 篇 tian wenda
3 篇 corchado juan m.
3 篇 chen jingsen
3 篇 bein wolfgang
3 篇 xue jinyun
3 篇 fournier herve
3 篇 yu chang wu
3 篇 liang weifa
3 篇 lu sanglu
3 篇 arasli batuhan

语言

532 篇 英文
27 篇 其他
5 篇 中文
3 篇 德文
2 篇 法文
1 篇 意大利文
1 篇 俄文

检索条件"主题词=Algorithm Design"

共 565 条记录，以下是521-530 订阅

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

详细简洁

排序：

Offset Compensation for Time Synchronization in WSNs with Random Communication Delays

Offset Compensation for Time Synchronization in WSNs with Ra...

引用

Chinese Automation Congress

作者： Gan Chen Yu-Ping Tian Siheng Zong Shao-Heng Chun Bo Wang School of Automation Southeast University Nanjing China

Firstly, we show that in the unified structural model of the consensus-based time synchronization (CBTS) algorithm, the offset estimate is divergent in general while the drift estimate converges in a rate of 1/k, where k is the discrete time. Then, we propose an offset compensation approach to guaranteeing the boundedness of the offset estimate for wireless sensor networks (WSNs) with random bounded communication delays. Two numerical experiments are presented to illustrate the availability of this algorithm and the better synchronization performance.

关键词： Sensor network Time synchronization algorithm design Communication delay

来源：评论

学校读者我要写书评

暂无评论

Joint power and subcarrier allocation for multicarrier full-duplex systems

Joint power and subcarrier allocation for multicarrier full-...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Yan Sun Derrick Wing Kwan Ng Robert Schober Institute for Digital Communications Friedrich-Alexander-University Erlangen-Nurnberg (FAU) Germany School of Electrical Engineering and Telecommunications The University of New South Wales Australia

ISBN: (纸本)9781509041183

In this paper, we investigate resource allocation for multicarrier communication systems employing a full-duplex base station for serving multiple half-duplex downlink and uplink users simultaneously. We study the joint power and subcarrier allocation design for the maximization of the weighted sum throughput of the system. The algorithm design is formulated as a mixed combinatorial non-convex optimization problem and obtaining the globally optimal solution may require prohibitively high computational complexity. Therefore, a low computational complexity suboptimal iterative algorithm exploiting successive convex approximation is proposed to obtain a locally optimal solution. Simulation results confirm that the proposed suboptimal algorithm obtains a substantial improvement in system throughput compared to various existing baseline schemes.

关键词： Configuration design full-duplex system Subcarriers duplex system algorithm design COMMUNICATION SYSTEMS weight sums optimal solution Resource utilization Joints Joints complexity classes

来源：评论

学校读者我要写书评

暂无评论

LSTS: A New Time Synchronization Protocol for Networks with Random Communication Delays

LSTS: A New Time Synchronization Protocol for Networks with ...

引用

IEEE Annual Conference on Decision and Control

作者： Yu-Ping Tian School of Automation Southeast University Nanjing 210096 China

ISBN: (纸本)9781479978878

This paper studies algorithm design and analysis in time synchronization for wireless sensor networks (WSNs) with random bounded communication delays. A least square estimation based time synchronization (LSTS for short) algorithm is proposed. Mathematic modeling of the algorithm is presented. The LSTS algorithm ensures asymptotic convergence of drift estimations and boundedness of global time-synchronization errors under random bounded communication delays, and the global steady-state time synchronization error in the network is affine to the bound of communication delays.

关键词： clock recovery Communication Research Network synchronization error algorithm design and analysis algorithm design delay Random

来源：评论

学校读者我要写书评

暂无评论

designing Interference Alignment algorithms by Algebraic Geometry Analysis

Designing Interference Alignment Algorithms by Algebraic Geo...

引用

IEEE Global Communications Conference

作者： Liangzhong Ruan Moe Z. Win Vincent K. N. Lau Laboratory for Information and Decision Systems (LIDS) Massachusetts Institute of Technology Dept. of Electronic and Computer Engineering Hong Kong University of Science and Technology

ISBN: (纸本)9781479913510

Recent results have shown that interference alignment (IA) achieves the optimal throughput scaling law w.r.t. SNR. However, except for a few special cases, finding transceivers to achieve IA in MIMO interference networks is still an open problem. This problem is challenging due to the non-convex nature of the interference optimization problem. Inspired by recent success in using tools from algebraic geometry to analyze the feasibility conditions of IA, in this work, we adopt algebraic geometry analysis to guide IA algorithm design. Specifically, we first explore the relation between algebraic independence and feasibility of polynomial equation sets, and transform the IA problem into an equivalent polynomial form, whose policy space is convex. Then we reformulate the transformed IA problem into an interference optimization problem. By exploiting the connection between algebraic independence and full rankness of Jacobian matrix, we prove that in the interference optimization problem, there is no performance gap between local and global optimums when IA is feasible. This property enables us to easily design IA algorithms by adopting existing local search algorithms. Combining the propositions obtained in this work and those obtained in the authors' prior work on IA feasibility, we have established a unified algebraic framework for both IA feasibility analysis and algorithm design.

关键词： INFORMATION ASSURANCE Algebraic Geometry SEARCHING algorithm algorithm design Jacobian matrix Transceivers System of equations Non-Convex interference interference

来源：评论

学校读者我要写书评

暂无评论

Multi-User Hybrid Precoding for Millimeter-Wave Communications Based on a Linear Successive Allocation Method

Multi-User Hybrid Precoding for Millimeter-Wave Communicatio...

引用

WSA 2017;21th International ITG Workshop on Smart Antennas

作者： Christoph Stoeckle Wolfgang Utschick Michael Joham Jian Luo

Hybrid analog and digital precoding is one possibility for making the communication in the underutilized millimeter-wave frequency bands viable for future cellular networks. This paper proposes new algorithms for the design of hybrid precoders in the downlink of a multi-user scenario. The algorithms are based on the Linear Successive Allocation (LISA) method developed for the traditional fully digital precoding. It successively allocates data streams to users and suppresses the inter-stream interference in two steps. By a simple approximation, the two steps are mapped to the analog and digital domain to obtain the new multi-user hybrid precoding algorithm Hybrid LISA (H-LISA). Furthermore, a low-complexity version is developed by exploiting the typical structure of mmWave channels. We also present modifications of H-LISA for hybrid analog and digital processing at the users and for the case that the phase shifts of practical phase shifters implementing the analog part of the hybrid processing are quantized. The good performance of the proposed methods is demonstrated by simulation results. In addition, we discuss the impact of channel estimation errors on the achievable sum rate.

关键词： prediction coding Hybrid processes HYBRID data flow Hybrid electric vehicles algorithm design digital domain multi-user Consumers Digital signal processing algorithms Frequency bands Phase shifters Laser Interferometer Space Antenna

来源：评论

学校读者我要写书评

暂无评论

Distributed robust filtering with H_(infinity) consensus of estimates

Distributed robust filtering with H_(infinity) consensus of ...

引用

American Control Conference

作者： Valery A. Ugrinovskii School of Engineering and Information Technology University of New South Wales at the Australian Defence Force Academy Canberra ACT 2600 Australia

ISBN: (纸本)9781424474264

The paper addresses a problem of design of distributed robust filters using the recent vector dissipativity theory. The main result is a sufficient condition which guarantees a suboptimal H_(infinity) level of disagreement of estimates in a network of filters. The condition is formulated in terms of feasibility of certain linear matrix inequalities (LMIs). It provides a tractable algorithm for the design of interconnection gains for a network of distributed robust observers. The proposed approach is applied to the problem of observer-based robust synchronization of a nonlinear network to an isolated node.

关键词： Nonlinear networks Distribute algorithm design robust filter Filtration Robustness

来源：评论

学校读者我要写书评

暂无评论

Investigating Connection algorithms Among Drones in The DRANET System

Investigating Connection Algorithms Among Drones in The DRAN...

引用

International Conference of Computer and Informatics Engineering (IC2IE)

作者： Abdul Aziz Abdullah Bhahrin Bin Sahib Nur Azman Abu Fakulti Teknologi Maklumat dan Komunikasi Politeknik Negeri Jakarta Universiti Teknikal Malaysia Melaka Depok Melaka Indonesia Fakulti Teknologi Maklumat dan Komunikasi Universiti Teknikal Malaysia Melaka Melaka Malaysia

ISBN: (纸本)9781728123851

DRANET is Ad hoc Drone Network, where a Drone system is connected to a Drone peer, the system communicates a consistent manner in collaborative work. The DRANET systems are Drone systems work in equilibrium and with communication sharing. The DRANET system problem is the operational flight balance and service system to the user. The algorithm design of DRANET consists of twenty-two logical functions of the system. The paper is the results of the Drone logic flight investigations in the herd. algorithms provide rules about how DRANET in a system does not collide with each other in forming flight formations, flies equilibrium. DRANET systems are designed to serve communication when people gather for public meetings or support communication links in order to restore an emergency.

关键词： Coalition Collaboration Dranet system Drone Multi-drones drone honey bees Interest groups algorithm design water service reliability Communication Research flight

来源：评论

学校读者我要写书评

暂无评论

An Irregular Approach to Large-Scale Computed Tomography on Multiple Graphics Processors Improves Voxel Processing Throughput

An Irregular Approach to Large-Scale Computed Tomography on ...

引用

High Performance Computing, Networking, Storage and Analysis (SCC), SC Companion:

作者： Edward S. Jimenez Laurel J. Orr Kyle R. Thompson Sandia National Laboratories Albuquerque NM USA

ISBN: (纸本)9781467362184

While much work has been done on applying GPU technology to computed tomography (CT) reconstruction algorithms, many of these implementations focus on smaller datasets that are better suited for medical applications. This paper proposes an irregular approach to the algorithm design which utilizes the GPU hardware's unique cache structure and employs small x-ray image data prefetches on the host to upload to the GPUs while the devices are operating on large contiguous sub-volumes of the reconstruction. This approach will improve the overall cache hit-rates and thus improve the performance of the massively multithreaded environment of the GPU. Overall, utilizing small prefetches of x-ray image data improved the volumetric pixel (voxel) processing rate when compared to utilizing large data prefetches which would minimize data transfers and kernel launches. Additionally, this approach does not sacrifice performance on small datasets and is thus suitable for medical and industrial applications. This work utilizes the CUDA programming environment and Nvidia's Tesla GPUs.

关键词： Graphics Processing Unit algorithm design image data pixel GRAPPER PICK UP Uploading data transmission X-Ray Computed Tomography large sizes graphic images Medical Cache memory PROCESSOR

来源：评论

学校读者我要写书评

暂无评论

Hallucination Helps: Energy Efficient Virtual Circuit Routing 14

Hallucination Helps: Energy Efficient Virtual Circuit Routin...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Antonios Antoniadis Sungjin Im Ravishankar Krishnaswamy Benjamin Moseley Viswanath Nagarajan Kirk Pruhs Cliff Stein University of Pittsburgh Duke University Computer Science Princeton University Toyota Technological Institute at Chicago IBM T.J. Watson Research Center Dept. of IEOR Columbia University

ISBN: (纸本)9781611973389

We consider virtual circuit routing protocols, with an objective of minimizing energy, in a network of components that are speed scalable, and that may be shutdown when idle. We assume that the speed s of a link is proportional to its load, and assume the standard model for component power, namely that the power is some constant static power σ plus s~α, where typically α∈ [1, 1, 3]. We give a polynomial-time offline algorithm for multicommodity routing, that has approximation ratio O(logα k), where k is the number of demand pairs. This is obtained as a combination of three natural combinatorial algorithms. The key step of the algorithm design is a random sampling technique that we call hallucination, which is reminiscent of the Sample-Augment framework for solving Buy-at-Bulk type problems, and sampling in cut-sparsification algorithms. The analysis of the approximation ratio is then a direct consequence of the flow-cut gap for multicommodity flow. The algorithm extends rather naturally to an online algorithm, which we show has competitive ratio O{top}~(log~(3α+1) k). The analysis of the online algorithm introduces a natural "priority" multicommodity flow problem, and bounds the priority multicommodity flow-cut gap-this might also be of independent interest. We also explain how our hallucination technique can be used to achieve an (O(log km), O(log km)) bicriteria approximation result for the problem of buying a minimum cost collection of unit-capacitated edges to support a concurrent multi-commodity flow, where m is the number of links in the network.

关键词： Hallucinations virtual circuits algorithm design algorithms network links Network routing

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for anytime coalition structure generation 10

A distributed algorithm for anytime coalition structure gene...

引用

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

作者： Tomasz Michalak Jacek Sroka Talal Rahwan Michael Wooldridge Peter McBurney Nicholas R. Jennings University of Southampton UK University of Warsaw Poland University of Liverpool UK

ISBN: (纸本)9780982657119

A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system is optimized. This problem is difficult because the search space is very large: the number of possible coalition structures increases exponentially with the number of agents. Although several algorithms have been proposed to tackle this Coalition Structure Generation (CSG) problem, all of them suffer from being inherently centralized, which leads to the existence of a performance bottleneck and a single point of failure. In this paper, we develop the first decentralized algorithm for solving the CSG problem optimally. In our algorithm, the necessary calculations are distributed among the agents, instead of being carried out centrally by a single agent (as is the case in all the available algorithms in the literature). In this way, the search can be carried out in a much faster and more robust way, and the agents can share the burden of the calculations. The algorithm combines, and improves upon, techniques from two existing algorithms in the literature, namely DCVC [5] and IP [9], and applies novel techniques for filtering the input and reducing the inter-agent communication load.

关键词： distributed AI algorithm design coalition formation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 48 49 50 51 52 53 54 55 56 57 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：