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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

2,090 篇 distributed algo...
133 篇 distributed algo...
78 篇 wireless sensor ...
74 篇 resource allocat...
73 篇 optimization
62 篇 consensus
55 篇 convergence
55 篇 wireless sensor ...
49 篇 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 篇 tsinghua univ de...
9 篇 univ sci & techn...
9 篇 florida atlantic...
8 篇 zhejiang univ co...
8 篇 northeastern uni...
8 篇 nanyang technol ...
8 篇 shanghai jiao to...

作者

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 篇 meng ziyang
10 篇 cao jiannong
10 篇 lau francis c. m...
10 篇 raynal m
9 篇 mostefaoui achou...

语言

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

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

共 2090 条记录，以下是141-150 订阅

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

详细简洁

排序：

A New distributed algorithm for Parametric Data Modeling in Wireless Sensor Networks

A New Distributed Algorithm for Parametric Data Modeling in ...

引用

10th IEEE Workshop on Signal Processing Advances in Wireless Communications

作者： Marechal, Nicolas Pierrot, Jean-Benoit Gorce, Jean-Marie CEA LETI MINATEC 17 Rue Martyrs F-38054 Grenoble France Univ Lyon 2 Inst Natl Sci Appl Lyon INRIA F-69621 Villeurbanne France

ISBN: (纸本)9781424436958

Sensor networks aim at monitoring events and phenomena occurring in their environment and providing useful information to one or several end users. When a global knowledge of sensed data is needed, techniques from data gathering, statistical estimation and parametric modeling can be used. While the two first methods require respectively a large amount of energy and a knowledge of statistical dependencies between measurements, a new simple algorithm for fitting a parametric model to sensed data is proposed in this article. The novelty and advantages of this approach stands in its intrinsic robustness to packet losses and asynchronous data exchanges. Moreover, this algorithm is intituively efficient as it uses the broadcasting nature of the wireless medium.

关键词： distributed algorithm sensor networks networked systems consensus algorithms data fusion

来源：评论

学校读者我要写书评

暂无评论

Cooperative Search of Multiple Robots with A distributed algorithm 44

Cooperative Search of Multiple Robots with A Distributed Alg...

引用

44th Annual Conference of the IEEE Industrial-Electronics-Society (IECON)

作者： Li, Chun Yang, Chunning Zhejiang Univ Sch Aeronaut & Astronaut Inst Aerosp Informat Technol Hangzhou Peoples R China

ISBN: (纸本)9781509066841

This paper presents a cooperative algorithm for multiple robots that move in 3-D unknown environment performing coverage and search tasks. We assume some significant constraints, i.e., each agent carried an onboard vision-based sensor facing downward to task area and has a limited communication radius. Based on the coverage control and probability map updated model, we proposed a combination method considering the tradeoff between probability information and Euclidean distance to obtain an optimal robots deployment. This algorithm is illustrated by the simulation and effectively make a group of robots searches multiple static targets under the coordination mechanism.

关键词： multirobot cooperative searching distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Efficient distributed algorithm for Multi-Stage Robust Nonlinear Predictive Control

An Efficient Distributed Algorithm for Multi-Stage Robust No...

引用

European Control Conference (ECC)

作者： Marti, Ruben Lucia, Sergio Sarabia, Daniel Paulen, Radoslav Engell, Sebastian de Prada, Cesar Univ Valladolid Dept Syst Engn & Automat Control C Real de Burgos S-N E-47011 Valladolid Spain Tech Univ Dortmund Proc Dynam & Operat Grp D-44221 Dortmund Germany Univ Burgos Dept Electromech Engn Escuela Politecn Super Burgos Spain

ISBN: (纸本)9783952426937

This paper presents an algorithmic development in the framework of computationally efficient robust Nonlinear Model Predictive Control (NMPC) which deals with a parametric plant-model mismatch, where the description of the evolution of the uncertainty is done using a scenario tree, known as multi-stage approach. In order to reduce the computational time and memory requirements of the multistage NMPC, the calculations of the optimal control inputs can be done scenario-wise in parallel. These parallelized calculations must enforce the satisfaction of the non-anticipativity constraints, which is negotiated iteratively among the scenarios using Lagrangean or price-driven decomposition. The main challenge in using such scheme is the determination of the values of the aggregate variables that are used to coordinate the scenario-wise computations for convergence to the feasibility of the non-anticipativity constraints. The proposed approach uses parametric sensitivities of the optimal model states with respect to the control inputs which are used for the iterative determination of the values of aggregated variables. The proposed method achieves good performance and faster convergence compared to traditional decomposition schemes. The potential of the approach is demonstrated in simulation example of an hydrodesulphurisation unit.

关键词： convergence distributed algorithms iterative methods nonlinear control systems optimal control predictive control robust control trees (mathematics) Lagrangean decomposition algorithmic development computational time computationally efficient robust nonlinear model predictive control distributed algorithm hydrodesulphurisation unit iterative determination memory requirement multistage NMPC multistage approach multistage robust nonlinear predictive control nonanticipativity constraint optimal control input optimal model state parallelized calculation parametric plant-model mismatch parametric sensitivity price-driven decomposition scenario tree scenario-wise computation Computational modeling Convergence Optimization Robustness Stochastic processes Uncertainty

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm to Achieve Transparent Coexistence for a Secondary Multi-Hop MIMO Network

A Distributed Algorithm to Achieve Transparent Coexistence f...

引用

33rd IEEE International Performance, Computing, and Communications Conference (IPCCC)

作者： Yuan, Xu Qin, Xiaoqi Tian, Feng Shi, Yi Hou, Y. Thomas Lou, Wenjing Midkiff, Scott F. Kompella, Sastry Virginia Polytech Inst & State Univ Blacksburg VA 24061 USA Nanjing Univ Posts & Telecommun Nanjing 210003 Jiangsu Peoples R China Intelligent Automat Inc Rockville MD 20855 USA US Naval Res Lab Washington DC 20375 USA

The transparent coexistence (TC) paradigm allows simultaneous activation of the secondary users with the primary users as long as their interference to the primary users can be properly canceled. This paradigm has the potential to offer much more efficient spectrum sharing than the traditional interweave paradigm. In this paper, we design a distributed algorithm to achieve this paradigm for a secondary multi-hop network. For interference cancelation (IC), we employ MIMO at secondary nodes. We present a distributed iterative algorithm to maximize each secondary session's throughput while meeting all IC requirements under TC. By maintaining two local sets for each node, we can keep track of the node's IC responsibility. Although no explicit node ordering is maintained in our distributed algorithm, we prove that our distributed data structure at each node (with the use of two local sets) can be mapped to an explicit global node ordering for IC among all nodes in the network. This guarantees that each active node's degree-of-freedoms allocated for IC is feasible at the physical layer. Our algorithm is iterative in nature and all steps can be accomplished based on local information exchange among the neighboring nodes. We present the simulation results to show that the performance of our distributed algorithm is highly competitive when compared with an upper bound solution from the corresponding centralized problem.

关键词： Primary network secondary network spectrum sharing coexistence distributed algorithm multi-hop network MIMO interference cancelation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Enhanced distributed algorithm for Area Skyline Computation Based on Apache Spark 16th

An Enhanced Distributed Algorithm for Area Skyline Computati...

引用

16th International Conference on Knowledge Science, Engineering and Management (KSEM)

作者： Li, Chen Cao, Yang Zhu, Ye Zhang, Jinli Annisa, Annisa Cheng, Debo Tang, Huidong Jiang, Shuai Maruyama, Kenta Morimoto, Yasuhiko Nagoya Univ Grad Sch Informat Nagoya Aichi Japan Deakin Univ Ctr Cyber Resilience & Trust Geelong Vic Australia Beijing Univ Technol Beijing Peoples R China IPB Univ Dept Comp Sci Bogor Indonesia Univ South Australia STEM Adelaide SA Australia Hiroshima Univ Grad Sch Engn Hiroshima Japan

ISBN: (纸本)9783031402913;9783031402920

Skyline computations are a way of finding the best data points based on multiple criteria for location-based decision-making. However, as the input data grows larger, these computations become slower and more challenging. To address this issue, we propose an efficient algorithm that uses Apache Spark, a platform for distributed processing, to perform area skyline computations faster and more salable. Our algorithm consists of three main phases: calculating distances between data points, generating distance tuples, and computing the skyline. In the second phase, we apply a technique called local partial skyline extraction, which reduces the amount of data that needs to be sent from each executor (a parallel processing unit) to the driver (a central processing unit). The driver then computes the final skyline from the received data and creates filters to eliminate irrelevant points. Our experiments show that our algorithm can significantly reduce the data size and the computation time of the area skyline.

关键词： Area skyline query distributed algorithm Apache Spark

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for data collection in low-duty-cycled WSNs 3

A distributed algorithm for data collection in low-duty-cycl...

引用

3rd Asian Pacific Conference on Mechanical Components and Control Engineering (ICMCCE)

作者： Liu, Feng Wang, Yufei Lin, Mu Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China

ISBN: (纸本)9783038353126

In order to prolong the lifetime of WSNs, low-duty-cycled scheduling is a widely used strategy. However, there exists high latency with traditional routing algorithms. In this paper, we model the data collection scheme of WSNs to be a delay optimization problem and propose a distributed algorithm based on Network Utility Maximization. The proposed algorithm can distributed find an optimal routing to achieve minimal average end-to-end delay. The simulation results show that our algorithm performs better than the traditional shortest path algorithm on end-to-end delay with less control message.

关键词： low-duty-cycled data collection distributed algorithm wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Analysis of Ground Anchor Stations' Influence on Autonomous Orbit Determination with distributed algorithm 7th

Analysis of Ground Anchor Stations' Influence on Autonomous ...

引用

7th China Satellite Navigation Conference (CSNC)

作者： Huang, Fanghong Huang, Wende Wang, Yueke Zhou, Yifan Lin, Kui Natl Univ Def Technol Coll Mechatron Engn & Automat Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9789811009402;9789811009396

The orbit determination of the navigation constellation is the premise for navigation satellite system to realize navigation and position. Autonomous orbit determination based on ground anchor stations can improve the accuracy and survivability of the navigation system, but it has the rotation error. The addition of the ground anchor stations is a valid way to solve the problem. Because of the limited calculation resources on the satellite boards, the algorithm should be a distributed one which, however, is not the optimal. So, it is meaningful to study the influence of the ground anchor stations on the distributed orbit determination algorithm. According to the requirement, first, this article describes the principle of distributed orbit determination algorithm. Second, it analyses the characteristics of it. Third, it studies the effect of ground anchor stations. In the last, it designs a work way in period and tests the feasibility of it. The simulation result shows that ground anchor stations can control the rotation error well, but the simple EKF algorithm used to fuse the data of inter-satellite and satellite-to-ground range measurements constricts slow. In the last an improving algorithm is raised.

关键词： Autonomous orbit determination distributed algorithm Anchor stations Navigation constellation

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for Constructing an Independent Dominating Set 18th

A Distributed Algorithm for Constructing an Independent Domi...

引用

18th International Conference on distributed Computing and Intelligent Technology (ICDCIT)

作者： Banerjee, Suman Dogra, Abhishek Singh, Anurag Kumar Bhattacharjee, Subhasis Indian Inst Technol Jammu Dept Comp Sci & Engn Jammu 181201 Jammu & Kashmir India

ISBN: (纸本)9783030948764;9783030948757

Given a simple finite undirected graph, finding a minimum INDEPENDENT DOMINATING SET is a fundamental graph algorithmic problem. In this paper, we propose a distributed algorithm for constructing an independent dominating set (IDS) in the CONGEST model of distributed computing. Our algorithm requires only 2-hop partial information at each node for computations, and hence each node takes various decisions without having any global knowledge of the graph. The algorithm consists of mainly three steps. First, we construct a dominating set using a node estimation and voting mechanism. Then each dominating node finds out a vertex cover of its 2-hop graph by an incremental greedy algorithm along with a few optimizations and tie breaking. We prove that the union of the vertex covers computed by each dominating node is a vertex cover of the original graph. Finally, we construct an independent set by complementing the vertex cover. Considering this independent set as an IDS (of the induced graph by the closed neighborhood of the independent set), its closed neighborhood is deleted from the original graph to construct the reduced graph. We repeat the above three-step process until the reduced graph is null. To the best of our knowledge, this is the first distributed algorithm for constructing an IDS. We experimented on eight real-world networks and synthetic networks from well-known Erdos-Renyi graph generators. We observe that in most of the cases our algorithm takes only a few (approx 5) iterations and returns an IDS whose size is fractionally higher than the size of IDS computed by a sequential greedy algorithm.

关键词： distributed algorithm Vertex cover Voting Independent Dominating Set

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：