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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,284 篇 期刊文献
789 篇 会议
14 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

2,087 篇 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,020 篇 英文
49 篇 其他
18 篇 中文
3 篇 德文
3 篇 法文
3 篇 俄文

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

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

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

详细简洁

排序：

Verifying the Output of a distributed algorithm Using Certification 17th

Verifying the Output of a Distributed Algorithm Using Certif...

引用

17th International Conference on Runtime Verification (RV)

作者： Voellinger, Kim Humboldt Univ Berlin Germany

ISBN: (纸本)9783319675312;9783319675305

A certifying algorithm verifies the correctness of its output at runtime by producing a witness in addition to an input-output pair. If a witness predicate holds for the triple, the input-output pair is correct. A checker algorithm decides the witness predicate. While certifying sequential algorithms are well-established, we consider distributed algorithms. In this paper, we investigate certifying distributed algorithms that verify their distributed output. While the witness predicate states a property in the network, for distributed checking, additional predicates are decided for each component. We illustrate the applicability by examples.

关键词： Runtime verification Certifying algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for Reconfiguration of Lattice-based Modular Self-Reconfigurable Robots 24

A Distributed Algorithm for Reconfiguration of Lattice-based...

引用

24th Euromicro International Conference on Parallel, distributed, and Network-Based Processing (PDP)

作者： Piranda, Benoit Bourgeois, Julien UFC UBFC UMR CNRS 6174 FEMTO ST Inst Montbeliard France

ISBN: (纸本)9781467387767

A modular robots is composed of many independent connected modules which are able to achieve common goals through communications. A modular self-reconfigurable robot can move and reorganize its modules to modify its shape. In this paper, we consider a modular self-reconfigurable robot made from cubic modules (blocks) that are able to slide along their faces. Sliding motions imply complex cooperations, for example, crossing an angle needs at least three synchronized blocks. Based on this kind of hardware, we propose a distributed rule-based algorithm which plans and moves the blocks to reach a final configuration. We propose the use of motion rules that drastically simplify the complexity of the sliding movements and we define a special kind of metamodule to fasten the reconfiguration. We evaluate our algorithm in a simulator in order to study its behavior in the case of large modular robots composed of more than 10,000 modules. We test its robustness with more than 120 different kinds reconfigurations scenarii, representing more than 338 millions of movements for the blocks without any problem.

关键词： distributed algorithm modular robots self-reconfiguration

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm of Control Software Processing for a Robotic Laser Welding Complex

A Distributed Algorithm of Control Software Processing for a...

引用

Global Smart Industry Conference (GloSIC)

作者： Sukhorukov, Sergei Bogatenkov, Sergey Cherniy, Sergey Borodin, Igor Bazhenov, Ruslan Chuyko, Olga Komsomolsk Na Amure State Univ Elect Drive & Automat Ind Plants Komsomolsk Na Amure Russia South Ural State Univ Informat Technol Econ Chelyabinsk Russia Primorskaya State Acad Agr Design & Mechanizat Technol Proc Ussuriisk Russia Sholom Aleichem Priamursky State Univ Informat Syst & Math Birobidzhan Russia Khabarovsk State Univ Econ & Law Informat Syst & Technol Khabarovsk Russia

ISBN: (纸本)9781728180755

The paper dwells on the development of a distributed algorithm of the control software for a robotic laser welding complex. The authors compute an algorithm to process the integrated control software containing instructions for controlling all devices in a robotic complex. The article brings out the structure and the hardware included in the software, reports on individual requirements for programming and controlling of each device. The authors observe the structure of the software that controls the operation of the robotic complex and outline the capacities used for coordination of all devices. The authors design the structure of the control software for a definite item welding, elements of analysis algorithm, and the control software processing produced with various devices within the complex. The authors provide the interchangement of the condition and synchronisation signals of algorithm element performance.

关键词： laser welding control software distributed algorithm robotic laser welding complex

来源：评论

学校读者我要写书评

暂无评论

Formal Verification of a distributed algorithm for Task Execution 20th

Formal Verification of a Distributed Algorithm for Task Exec...

引用

20th International Conference on Computational Science and Its Applications (ICCSA)

作者： Nath, Amar Niyogi, Rajdeep Indian Inst Technol Roorkee Roorkee 247667 Uttar Pradesh India

ISBN: (纸本)9783030588144;9783030588137

In a dynamic environment, the accomplishment of a mission composed of multi-robot tasks is quite a challenging problem. To execute collaborative tasks successfully, robots may need to be present at the location of the task. However, the required robots may not be present at the location of the task. A distributed algorithm has been proposed recently for such task execution. A model checker can analyze the behavior of the algorithm. In this paper, we formally model the algorithm using the PRISM model checker. We identify some interesting safety and liveness properties of the algorithm and perform extensive simulations of the algorithm. The results validate that the behavior of the algorithm is as expected.

关键词： Task execution distributed algorithm Formal verification PRISM model checker

来源：评论

学校读者我要写书评

暂无评论

JA-BE-JA: A distributed algorithm for Balanced Graph Partitioning

JA-BE-JA: A Distributed Algorithm for Balanced Graph Partiti...

引用

IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)

作者： Rahimian, Fatemeh Payberah, Amir H. Girdzijauskas, Sarunas Jelasity, Mark Haridi, Seif KTH Royal Inst Technol Stockholm Sweden Univ Szeged Hungarian Acad Sci Szeged Hungary

ISBN: (纸本)9780769551296

Balanced graph partitioning is a well known NP-complete problem with a wide range of applications. These applications include many large-scale distributed problems including the optimal storage of large sets of graph-structured data over several hosts-a key problem in today's Cloud infrastructure. However, in very large-scale distributed scenarios, state-of-the-art algorithms are not directly applicable, because they typically involve frequent global operations over the entire graph. In this paper, we propose a fully distributed algorithm, called JA-BE-JA, that uses local search and simulated annealing techniques for graph partitioning. The algorithm is massively parallel: there is no central coordination, each node is processed independently, and only the direct neighbors of the node, and a small subset of random nodes in the graph need to be known locally. Strict synchronization is not required. These features allow JA-BE-JA to be easily adapted to any distributed graph-processing system from data centers to fully distributed networks. We perform a thorough experimental analysis, which shows that the minimal edge-cut value achieved by JA-BE-JA is comparable to state-of-the-art centralized algorithms such as METIS. In particular, on large social networks JA-BE-JA outperforms METIS, which makes JA-BE-JA-a bottom-up, self-organizing algorithm-a highly competitive practical solution for graph partitioning.

关键词： graph partitioning distributed algorithm load balancing simulated annealing

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm Combining Power Control and Scheduling for Femtocell Networks

A Distributed Algorithm Combining Power Control and Scheduli...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Cao, Gen Yang, Dacheng Zhang, Xin Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Wireless Theories & Technol Lab WT&T Beijing 100876 Peoples R China

ISBN: (纸本)9781467304375;9781467304368

In this paper, we present a distributed algorithm combining power control and scheduling for densely deployed femtocells networks. The strong interference in the downlink from the femtocells should be well mitigated to satisfy the quality of service (QoS) requirement of femtocell users. The considered optimization problem is formulated as minimizing the total power consumption, while the QoS requirements of femtocell users are guaranteed. An optimal scheme requires global information of channel qualities, which is very difficult to put into practice. This paper proposed a suboptimal algorithm joining power control with scheduling policy, which is operated in distributed manner. The distributed algorithm provides a suboptimal solution using local information including the channel quality of users and the iterative power values. Simulation results prove that our proposed algorithm can effectively allocate power and frequency resource to the femtocell users, while achieve superior system performance in terms of outage ratio and scheduling fairness.

关键词： Joint power control and scheduling distributed algorithm QoS LTE systems

来源：评论

学校读者我要写书评

暂无评论

On Constructing 2-Connected2-Dominating Set using distributed algorithm

On Constructing 2-Connected2-Dominating Set using Distribute...

引用

International Forum on Materials Analysis and Testing Technology (IFMATT 2013)

作者： Wang, Xue Yu Qingdao Univ Dept Automat Qingdao Peoples R China

ISBN: (纸本)9783037859537

This paper proposes a distributed algorithm to construct a 2-connected 2-dominating set. The main ingredient of this algorithm is that the nodes in the loop are 2-vertex connected. It starts from any node, and forms a localized loop made by dominating nodes. The nodes in the loop are 2-vertex connected. Basing on this loop, the algorithm continue to construct other loops formed by dominating nodes until the nodes out loops are 2-dominated.

关键词： Wireless sensor network connected dominating set distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Simple distributed algorithm for Cluster Organization of Wireless Sensor Networks

A Novel Simple Distributed Algorithm for Cluster Organizatio...

引用

International Seminar on Future BioMedical Information Engineering

作者： Hua, Nan Guo, Yi AF Engn Univ Inst Telecommun Engn Xian Peoples R China East China Univ Sci & Technol Dept Comp Sci & Engn Shanghai Peoples R China

ISBN: (纸本)9780769535616

This paper proposes an innovative distributed algorithm for cluster organization of Wireless Sensor Networks (WSN), named DSCO. Simple logic, connectionless information exchange and asynchronism are prominent features of the algorithm. DSCO involves three correlative processes: cluster organization, cluster reorganization and cluster self-healing. The process of cluster organization is the basic process of DSCO, which adopts random backoff strategy;the cluster reorganization and cluster self-healing processes are recursion of the former, which effectively simplifies the design of the algorithm. Furthermore, DSCO furthest isolates nodes and clusters, and reduces the reliance of global information to minimum, which is useful to reduce the pressure of data storage and processing in nodes, lessen the network traffic and enhance the anti-destroy ability of WSN. The algorithm simulation illustrates that DSCO can get fast clustering speed and uniform distribution of cluster nodes, proves its good performance on clustering rate and topology control, and shows good adaptability to large-scale WSN.

关键词： wireless sensor networks (WSN) distributed algorithm cluster organization cluster reorganization self-healing mechanism

来源：评论

学校读者我要写书评

暂无评论

A fully dynamic distributed algorithm for a b-coloring of graphs

A fully dynamic distributed algorithm for a b-coloring of gr...

引用

IEEE International Symposium on Parallel and distributed Processing with Applications

作者： Liu, Shuang Effantin, Brice Kheddouci, Harnamache Univ Lyon 1 Lab LIESP F-69622 Villeurbanne France

ISBN: (纸本)9780769534718

A b-coloring of a graph G is a proper coloring of the nodes of G such that each color class contains a node that has a neighbor in all other color classes. A fully dynamic algorithm is an algorithm used to support modifications (insertion or deletion) of nodes and edges in a network. Thus, in this paper we propose a fully dynamic distributed algorithm to maintain a b-coloring of a graph when its topology evolves. This method determines a b-coloring in time O(Delta(2)) and needs O(n Delta) changes of colors to maintain a b-coloring of a graph, where n is the number of nodes and A is the maximum degree in the graph.

关键词： coloring distributed algorithm dynamic algorithm graph distributed algorithms Dynamic algorithms Color Ganglia

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm of fault recovery for stateful failover

A distributed algorithm of fault recovery for stateful failo...

引用

4th International Conference on Theory and Applications of Models of Computation

作者： Saha, Indranil Mukhopadhyay, Debapriyay Honeywell Technol Solut Lab 151-1 Doraisanipalya Bannerghatta Rd Bangalore 560076 Karnataka India

ISBN: (纸本)9783540725039

In [8], a high availability framework based on Harary graph as network topology has been proposed for stateful failover. Framework proposed therein exhibits an interesting property that an uniform load can be given to each non-faulty node while maintaining fault tolerance. A challenging problem in this context, which has not been addressed in 181 is to be able to come tip with a distributed algorithm of automated fault recovery which can exploit the properties exhibited by the framework. In this work, we propose a distributed algorithm with low message and round complexity for automated fault recovery in case of stateful failover. We then prove the correctness of the algorithm using techniques from formal verification. The safety, liveness and the timeliness properties of the algorithm have been verified by the model checker SPIN.

关键词： distributed algorithm stateful failover verification of programs SPIN model checker

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：