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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,286 篇 期刊文献
789 篇 会议
14 篇 学位论文

馆藏范围

2,089 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,940 篇 工学
- 1,147 篇 计算机科学与技术...
- 965 篇 电气工程
- 614 篇 信息与通信工程
- 283 篇 控制科学与工程
- 169 篇 软件工程
- 128 篇 电子科学与技术（可...
- 79 篇 仪器科学与技术
- 69 篇 石油与天然气工程
- 51 篇 交通运输工程
- 34 篇 动力工程及工程热...
- 31 篇 机械工程
- 15 篇 土木工程
- 12 篇 测绘科学与技术
- 11 篇 网络空间安全
- 10 篇 化学工程与技术
- 10 篇 航空宇航科学与技...
- 7 篇 材料科学与工程（可...
282 篇 理学
- 204 篇 数学
- 45 篇 系统科学
- 33 篇 物理学
- 22 篇 生物学
- 20 篇 化学
- 12 篇 统计学（可授理学、...
175 篇 管理学
- 168 篇 管理科学与工程(可...
- 14 篇 工商管理
- 8 篇 图书情报与档案管...
25 篇 经济学
- 18 篇 应用经济学
- 7 篇 理论经济学
24 篇 医学
- 16 篇 临床医学
- 11 篇 基础医学(可授医学...
6 篇 教育学
3 篇 农学
3 篇 军事学
3 篇 艺术学
2 篇 法学

主题

2,089 篇 distributed algo...
132 篇 distributed algo...
77 篇 wireless sensor ...
74 篇 resource allocat...
73 篇 optimization
62 篇 consensus
55 篇 convergence
55 篇 wireless sensor ...
48 篇 game theory
40 篇 fault tolerance
40 篇 self-stabilizati...
38 篇 routing
36 篇 smart grid
35 篇 nash equilibrium
33 篇 convex optimizat...
33 篇 power control
32 篇 economic dispatc...
32 篇 sensor networks
31 篇 multi-agent syst...
31 篇 leader election

机构

16 篇 princeton univ d...
14 篇 univ chinese aca...
13 篇 univ rennes 1 ir...
12 篇 tsinghua univ de...
11 篇 nanyang technol ...
11 篇 chinese acad sci...
10 篇 ohio state univ ...
10 篇 southeast univ s...
10 篇 shanghai jiao to...
9 篇 georgia state un...
9 篇 nanjing univ sta...
9 篇 univ liverpool d...
9 篇 univ houston dep...
9 篇 univ sci & techn...
9 篇 florida atlantic...
8 篇 zhejiang univ co...
8 篇 tsinghua univ de...
8 篇 nanyang technol ...
8 篇 shanghai jiao to...
8 篇 chinese univ hon...

作者

33 篇 raynal michel
20 篇 pandurangan gopa...
17 篇 yu dongxiao
16 篇 molla anisur rah...
15 篇 chiang mung
14 篇 bourgeois julien
13 篇 wu weigang
13 篇 yu jiguo
13 篇 hong yiguang
12 篇 kowalski dariusz...
12 篇 li yushuai
11 篇 masuzawa toshimi...
11 篇 chen guihai
10 篇 sau buddhadeb
10 篇 zhang huaguang
10 篇 cao jiannong
10 篇 lau francis c. m...
10 篇 raynal m
9 篇 mostefaoui achou...
9 篇 kakugawa hirotsu...

语言

2,022 篇 英文
49 篇 其他
18 篇 中文
3 篇 德文
3 篇 法文
3 篇 俄文

检索条件"主题词=Distributed algorithm"

共 2089 条记录，以下是21-30 订阅

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

详细简洁

排序：

distributed algorithm for Seeking Bayesian Nash Equilibrium in Subnetwork Zero-sum Games 41

Distributed Algorithm for Seeking Bayesian Nash Equilibrium ...

引用

第41届中国控制会议

作者： Hanzheng Zhang Guanpu Chen Yiguang Hong Academy of Mathematics and Systems Science Chinese Academy of Sciences University of Chinese Academy of Sciences JD Explore Academy Department of Control Science and Engineering & Shanghai Research Institute for Intelligent Autonomous Systems Tongji University

ISBN: (数字)9789887581536

ISBN: (纸本)9781665482561

In this paper,we consider a Bayesian Nash equilibrium seeking problem in subnetwork zero-sum *** network consists of two subnetworks and agents in the same subnetwork collaborate to compete with other agents in the adversarial *** agent has its own cost function and receives information from neighbors through time-varying *** propose a distributed algorithm for seeking a Bayesian Nash equilibrium and analyze the convergence when the graphs are uniformly jointly strongly connected,and the cost functions are strictly *** illustrate the effectiveness of the proposed algorithm by a numerical example.

关键词： distributed algorithm Bayesian game subnetwork zero-sum game

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Mending Barrier Gaps via Sensor Rotation in Wireless Sensor Networks 9th

Distributed Algorithm for Mending Barrier Gaps via Sensor Ro...

引用

9th Annual International Conference on Combinatorial Optimization and Applications (COCOA)

作者： Wu, Yueshi Cardei, Mihaela Florida Atlantic Univ Dept Comp & Elect Engn & Comp Sci Boca Raton FL 33431 USA

ISBN: (纸本)9783319266268;9783319266251

When deploying sensors to monitor boundaries of battlefields or country borders, sensors are usually dispersed from an aircraft following a predetermined path. In such scenarios sensing gaps are usually unavoidable. We consider a wireless sensor network consisting of directional sensors deployed using the line-based sensor deployment model. In this paper we proposed a distributed algorithm for weak barrier coverage that allows sensors to determine their orientation such that the total number of gaps and the total gap length are minimized. We use simulations to analyze the performance of our algorithm and to compare it with two related work algorithms.

关键词： Wireless sensor networks Weak barrier coverage Directional sensors distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Robust and Interference Free Topology in Cognitive Radio Networks 7

Distributed Algorithm for Robust and Interference Free Topol...

引用

7th ACM Workshop on Mobility, Interference, and MiddleWare Management in HetNets (MobiMWareHN)

作者： Yadav, Ram Narayan Misra, Rajiv Jain, Ayush Indian Inst Technol Patna Bihar India

ISBN: (纸本)9781450350495

The connection between two secondary users (SUs) in cognitive radio networks (CRNs) is not only determined by their transmission power and distance, it also depends on the availability of a common channel for both SUs to open it for communication. Due to dependency on channel availability, communication in CRNs is more challenging than traditional wireless networks. A CRN is said to be connectable if there exists a channel assignment under which all the SUs are connected by either bidirectional link or bidirectional path. In CRN, each SU is equipped with a number of antennas which is the maximum number of channels that it can open simultaneously, known as antenna constraint. As each SU has a limit on the maximum number of channels it can open simultaneously, the network may not be connectable. But, it is desirable to connect the largest subset of SUs when all the SUs of a given CRN can not be connected satisfying antenna constraint while minimizing severe interference introduced due to the nearby transmissions among SUs on the same channel. In this paper, we propose a distributed topology control algorithm with message complexity O(n(2)), which aims to connect the largest subset of SUs with robustness constraint (the network will not be partitioned when any primary user reclaims channel) and ensures conflict free transmissions among SUs, where n is the number of SUs. To address this NP-hard problem, we combine both topology control and channel assignment phase. In topology control phase, a network subgraph with bounded degree is derived with satisfying antenna resource constraint. In channel assignment phase, we utilize graph coloring algorithm to ensure conflict-free property. To the best of our knowledge, this is the first attempt to develop a distributed topology control algorithm when a given CRN is not connectable.

关键词： Cognitive radio networks connectivity distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Solving Sylvester Matrix Equation via Iterative Learning Control 12

Distributed Algorithm for Solving Sylvester Matrix Equation ...

引用

IEEE 12th Data Driven Control and Learning Systems Conference (DDCLS)

作者： Liang, Cong Huo, Xuanmin Xte, Shizhou Wang, Lei Li, Juntao Henan Normal Univ Coll Math & informat Sci Xinxiang 453007 Henan Peoples R China Xinxiang Power Supply Co State Grid Henan Elect Power Co Xinxiang 453007 Henan Peoples R China Henan Normal Univ Coll Elect & Elect Engn Xinxiang 453007 Henan Peoples R China

ISBN: (纸本)9798350321050

As the most fundamental type of matrix equation, the Sylvester equation has been widely applied in control theory, signal processing, and many other scientific fields in recent years. The traditional method for solving the Sylvester equation is to transform it into a linear algebraic equation (LAE). However, this method will lead to an increase in the dimension of the coefficient matrix, which makes it difficult to solve the LAE. To alleviate the above problem, a distributed algorithm for solving the Sylvester equation is presented in this paper. Firstly, we obtain a LAE equivalent to the Sylvester equation by utilizing vectorization operation and Kronecker product. Then, a group of agents in the multi-agent system is considered to implement the distributed solution for LAE, where each agent only solves its local task by constantly exchanging information with its neighbors. By constructing the iterative learning control system, a discrete linear system about the tracking error of the agent is obtained. Based on the average neighbor information and the feedback control design, an updating rule for each agent iteratively updating its state is obtained. It is shown that all agents converge to the vectorization solution of the Sylvester equation when the communication topology between agents is undirected complete graph. Finally, a simulation example is provided to demonstrate the effectiveness of the proposed distributed algorithm.

关键词： Sylvester Equation Linear Algebraic Equation distributed algorithm Iterative Learning Control

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for solving linear algebraic equations: An implicit gradient neural network approach 3

Distributed algorithm for solving linear algebraic equations...

引用

3rd IEEE Conference on Control Technology and Applications (IEEE CCTA)

作者： Wang, Peijun Yu, Wenwu Wen, Guanghui Southeast Univ Sch Math Nanjing 210096 Peoples R China RMIT Univ Sch Engn Melbourne Vic 3000 Australia

ISBN: (纸本)9781728127675

This brief investigates the online solving problem for linear algebraic equation Ax = b by means of the principle of consensus in multi-agent systems, where A is an element of R-mxn and b is an element of R-n. To be specific, we choose m autonomous agents and agent i knows only the i-th row of [A b] under a fixed and connected undirected communication topology. Under local interactions, by designing an implicit gradient neural network based algorithm, it is shown that all the agents' states which starting from any different initial conditions can converge exponentially fast to one of the solutions to Ax = b, if the matrix A has full row rank. It is worth noting that the proposed algorithm is fully distributed. In addition, it is shown that the proposed algorithm is effective in obtaining least square solutions for no-solution cases. Finally, computer simulations verify and demonstrate the efficiency of the proposed methods for solving linear algebraic equations.

关键词： Linear algebraic equation distributed algorithm implicit gradient neural network multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Coverage and Connectivity in Wireless Sensor Networks 5

Distributed Algorithm for Coverage and Connectivity in Wirel...

引用

5th IFIP TC 5 International Conference on Computer Science and Its Applications (CIA)

作者： Khelil, Abdelkader Beghdad, Rachid Univ Abderrahmane Mira Bejaia Fac Sci Bejaia 06000 Algeria

ISBN: (纸本)9783319195780;9783319195773

Even if several algorithms were proposed in the literature to solve the coverage problem in Wireless Sensor Networks (WSNs), they still suffer from some weaknesses. This is the reason why we suggest in this paper, a distributed protocol, called Single Phase Multiple Initiator (SPMI). Its aim is to find Connect Cover Set (CCS) for assuring the coverage and connectivity in WSN. Our idea is based on determining a Connected Dominating Set (CDS) which has a minimum number of necessary and sufficient nodes to guarantee coverage of the area of interested (AI), when WSN model is considered as a graph. The suggested protocol only requires a single phase to construct a CDS in distributed manner without using sensors' location information. Simulation results show that SPMI assures better coverage and connectivity of AI by using fewer active nodes and by inducing very low message overhead, and low energy consumption, when compared with some existing protocols.

关键词： Wireless Sensor Network (WSN) Coverage Connectivity distributed algorithm Connected Dominating Set (CDS)

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Dynamic Logical Topology Reconfiguration in IP over WDM Networks

Distributed Algorithm for Dynamic Logical Topology Reconfigu...

引用

IEEE Symposium on Computers and Communications (ISCC 2009)

作者： Tran, Phuong Nga Killat, Ulrich Tech Univ Hamburg Commun Networks Dept Hamburg Germany

ISBN: (纸本)9781424446728

In this paper, we present a novel distributed algorithm to solve the logical topology reconfiguration problem for IP over WDM networks under dynamic traffic. From the optimization model proposed in ill, we apply the Lagrangian relaxation to eliminate the capacity constraint and form a dual problem whose optimal solution is the lower bound of the original one. The dual problem is then decomposed into sub-problems, which can be solved in a distributed manner. Based on the solution of the dual problem, a heuristic algorithm is proposed to obtain a good feasible solution for the orginal reconfiguration problem. Our distributed algorithm fulfils all requirements of the reconfiguration process, such as no service disruption, load balancing in the new logical topology while allowing to add and to delete multiple lightpaths. Moreover, the distributed approach offers a high scalability. Not limited to small or medium-sized networks as the centralized model in Ill, this distributed algorithm can be applied to large networks with the computation time increasing linearly with the network size. The performance of the proposed distributed algorithm, which lends itself to a protocol implementation, is investigated and compared with the corresponding centralized approach.

关键词： IP over WDM lightpaths logical topology distributed algorithm reconfiguration integer linear programming (ILP) Lagrangian relaxation traffic engineering

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Cooperative Coverage Provisioning in Mobile Cellular Networks

Distributed Algorithm for Cooperative Coverage Provisioning ...

引用

11th IEEE Singapore International Conference on Communication Systems

作者： Jiang, Peng Bigham, John Wu, Jiayi Queen Mary Univ London Dept Elect Engn London England

ISBN: (纸本)9781424424238

Recent developments in mobile networks have looked at placing more autonomy and intelligence at base stations to encourage cooperation between them using a distributed approach in order to try and develop a network more robust to attacks and failures. A real time fully distributed algorithm that would allow base stations in cellular networks to autonomously and cooperatively rind the wireless coverage pattern to optimize network performance is described. The semi-smart antenna system is assumed at each base station. Simulations based on Mobile WiMAX technology show the effectiveness and robustness of the approach.

关键词： distributed algorithm cooperative coverage mobile celluar network semi-smart antenna Mobile WiMAX

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Router-based Management of Replica Server in Next-CDN Infrastructure

Distributed Algorithm for Router-based Management of Replica...

引用

5th International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery (CyberC)

作者： Harahap, Erwin Wijekoon, Janaka Tennekoon, Rajitha Yamaguchi, Fumito Ishida, Shinichi Nishi, Hiroaki Keio Univ Ctr Comp Sci Hiroaki Nishi Lab Tokyo 108 Japan

ISBN: (纸本)9780769551067

Extending Content Delivery Network (CDN) infrastructure that has features of router-based network management system (RNMS) is highly appealing and challenging. It allows developing a CDN architecture based upon standard design to ease interoperability, scalability, performance, and flexibility both on network monitoring and management controlled from a router. To better understand the system model, necessity, and the advantages of RNMS, this paper proposed an algorithm that distributed in to a special router called Service-oriented Router (SoR). The function of algorithm is to manage the effective and efficient number of replica server runs in the network. In CDN, minimizing the number of activated replica servers should be considered in order to reduce the operation cost of the system. We propose a semantic approached algorithm that has function to optimize the selection of active replica servers which managed from SoR. The algorithm has capability to find the best location of replica servers and performs load balancing among replica servers. Our simulation result indicates that the proposed algorithm can efficiently activate the replica servers according to user's request with 33.9% effective compared to other algorithm within about one millisecond RTT increase.

关键词： distributed algorithm content delivery networks load balancing network management bayesian network SoR service-oriented router router-based network management system rnms

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Set k-Cover Problem and its Worst Case Analysis

Distributed Algorithm for Set <i>k</i>-Cover Problem and its...

引用

3rd International Conference on Networking and Computing (ICNC)

作者： Fujita, Satoshi Hiroshima Univ Dept Informat Engn Higashihiroshima 7398527 Japan

ISBN: (纸本)9780769548937;9781467346245

In this paper, we consider the problem of partitioning a given collection of subsets of nodes into.. collections such that the average size of each collection is the largest, where the size of a collection is defined as the size of the union of the subsets contained in the collection. At first, we give an upper bound on the performance ratio of Abrams et al.'s approximation algorithm which is known to have a performance ratio of at least 1 - 1/e where e is Napier's constant. The result of numerical calculations indicates that an upper bound is 3/4 + epsilon for small epsilon > 0. Next, we design a distributed implementation of Abrams et al.'s algorithm, which is based on the idea of arbitration using a spanning tree. Our algorithm can be used for the periodical switching of active subsets in Wireless Sensor Networks.

关键词： Set k-cover problem approximation algorithm performance ratio distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：