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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

2,092 篇 distributed algo...
134 篇 distributed algo...
77 篇 wireless sensor ...
75 篇 resource allocat...
74 篇 optimization
62 篇 consensus
55 篇 convergence
55 篇 wireless sensor ...
50 篇 game theory
40 篇 fault tolerance
40 篇 self-stabilizati...
37 篇 routing
36 篇 smart grid
36 篇 nash equilibrium
33 篇 convex optimizat...
33 篇 power control
32 篇 economic dispatc...
32 篇 multi-agent syst...
31 篇 leader election
31 篇 games

机构

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,021 篇 英文
50 篇 其他
16 篇 中文

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

共 2092 条记录，以下是1211-1220 订阅

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

详细简洁

排序：

Energy-Efficient algorithm for CDMA Uplink Based on Nash Bargaining Solution 5th

Energy-Efficient Algorithm for CDMA Uplink Based on Nash Bar...

引用

5th International Conference on Electronics, Communications and Networks (CECNet)

作者： Wang, Chuan-Chao Zhou, Jin-He Zhang, Yuan Beijing Informat Sci & Technol Univ Beijing Peoples R China

ISBN: (纸本)9789811007408;9789811007385

To improve wireless terminal energy efficiency, code division multiple access (CDMA)-based systems, which are still widely-used in existing 3G networks, are chosen as the scenario. Through the establishment of the terminal energy efficiency model, a Nash Bargaining Solution (NBS) based on a cooperative game is applied to uplink resource allocation, and a distributed algorithm is designed to obtain the optimal solution. The algorithm satisfies each user's power and rate constraints, reflects fairness of resource allocation, and maximizes the overall energy efficiency in uplink wireless communication systems, so as to realize energy efficiency.

关键词： Energy efficiency Nash bargaining solution Resource allocation Code division multiple access distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Nonnegative Edge Consensus of Networked Linear Systems 35

Nonnegative Edge Consensus of Networked Linear Systems

引用

35th Chinese Control Conference (CCC)

作者： Wang, Xiaoling Su, Housheng Wang, Xiaofan Chen, Guanrong Shanghai Jiao Tong Univ Dept Automat Shanghai 200240 Peoples R China Minist Educ China Key Lab Syst Control & Informat Proc Shanghai 200240 Peoples R China Huazhong Univ Sci & Technol Educ Minist China Sch Automat Image Proc & Intelligent Control Key Lab Luoyu Rd 1037 Wuhan 430074 Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9789881563910

In this paper, nonnegative edge consensus of systems steered by general linear dynamics on directed network is investigated. In the new approach, one first endows dynamics to each directed edge and then designs a distributed edge consensus protocol guiding all edges to reach a common state. With the help of line graph theory, it is proved that strongly connected network can ensure reaching nonnegative edge consensus, if the initial conditions of all edges are nonnegative. Numerical simulations are provided to verify the theoretical results.

关键词： Networked system Nonnegative edge consensus distributed algorithm Line graph

来源：评论

学校读者我要写书评

暂无评论

Scalable Single-source SimRank Computation for Large Graphs 22

Scalable Single-source SimRank Computation for Large Graphs

引用

22nd IEEE International Conference on Parallel and distributed Systems (ICPADS)

作者： Gao, Xingkun Bao, Nianyuan Liu, Jie Tang, Jie Wu, Gangshan Nanjing Univ State Key Lab Novel Software Technol Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781509044573

SimRank is an effective similarity measure between vertices in a graph, which has become a fundamental technique in graph analytics. Despite its popularity, computation of SimRank is often costly in both space and time, especially with the ever growing scale of graph data nowadays. In this paper, we focus on the computation of Single-Source SimRank: given a query vertex, return the similarities between this vertex and any other vertices in the graph. The traditional centralized SimRank algorithms are not efficient for this problem. To fully utilize the computing power of modern distributed systems, we propose sssSimRank, an efficient distributed algorithm based on the random walk model. Our algorithm achieves scalability via minimizing the total number, the space cost, and the matching time of random walks. We implement our approach on the popular distributed processing platform Spark. Experimental results demonstrate the effectiveness, efficiency and scalability of our method.

关键词： graph analytics big data SimRank random walk distributed algorithm Spark

来源：评论

学校读者我要写书评

暂无评论

IN-NETWORK LINEAR REGRESSION WITH ARBITRARILY SPLIT DATA MATRICES

IN-NETWORK LINEAR REGRESSION WITH ARBITRARILY SPLIT DATA MAT...

引用

IEEE Global Conference on Signal and Information Processing (GlobalSIP)

作者： Cote, Francois D. Psaromiligkos, Ioannis N. Gross, Warren J. McGill Univ Dept Elect & Comp Engn Montreal PQ Canada

ISBN: (纸本)9781509045457

We address for the first time the question of how networked agents can collaboratively fit a Morozov-regularized linear model when each agent knows a summand of the regression data. This question generalizes previously studied data-splitting scenarios, which require that the data be partitioned among the agents. To answer the question, we introduce a class of network-structured problems, which contains the regularization problem, and by using the Douglas-Rachford splitting algorithm, we develop a distributed algorithm to solve these problems. We illustrate through simulations that our approach is an effective strategy for fully distributed linear regression.

关键词： distributed algorithm regression splitting

来源：评论

学校读者我要写书评

暂无评论

NoStop: An Open Source Framework for Design and Test of Coordination Protocol for Asymmetric Threats Protection in Marine Environment 3rd

<i>NoStop</i>: An Open Source Framework for Design and Test ...

引用

3rd International Workshop on Modelling and Simulation for Autonomous Systems (MESAS)

作者： Nardi, Simone Pallottino, Lucia Univ Pisa Res Ctr E Piaggio Pisa Italy

ISBN: (纸本)9783319476056;9783319476049

NoStop is an open source simulator dedicated to distributed and cooperative mobile robotics systems. It has been designed as a framework to design and test multi-agent collaborative algorithms in terms of performance and robustness. The particular application scenario of a team of autonomous guards that coordinate to protect an area from asymmetric threat is considered. NoStop system is an integrated tool able to both evaluate the coordination protocol performance and to design the team of guards involved in the asymmetric threat protection. Moreover, NoStop is designed to validate robustness of coordination protocol through the use of a remote pilot that control the intruder motion to escape from the guards that monitor the area and accomplish its mission. The project core is a simulation server with a dynamic engine and a synchronization facility. Different coordination protocol can be designed and easily integrated in NoStop. The framework is fully integrated with the Robot Operating System (ROS) and it is completed by a control station where the remote pilot moves the intruder following the guards evolution in a 3D viewer.

关键词： Asymmetric threat Multi-agent Simulation Game theory distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model 16

Brief Announcement: An Exponential Separation Between Random...

引用

35th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Chang, Yi-Jun Kopelowitz, Tsvi Pettie, Seth Univ Michigan Ann Arbor MI 48109 USA

ISBN: (纸本)9781450339643

Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially faster than the best deterministic algorithm. In this paper we prove that these exponential gaps are necessary and establish numerous connections between the deterministic and randomized complexities in the LOCAL model. Each of our results has a very compelling take-away message: 1. Fast Delta-coloring of trees requires random bits. Building on the recent randomized lower bounds of Brandt et al. [6], we prove that the randomized complexity of Delta-coloring a tree with maximum degree Delta is Theta(log(Delta) log n), for any Delta >= 55, whereas its deterministic complexity is Theta(log(Delta) n) for any Delta >= 3.(1) This also establishes a large separation between the deterministic complexity of Delta-coloring and (Delta +1)-coloring trees. 2. Randomized lower bounds imply deterministic lower bounds. We prove that any deterministic algorithm for a natural class of problems that runs in O(1) + o(log(Delta) n) rounds can be transformed to run in O(log* n - log* Delta + 1) rounds. If the transformed algorithm violates a lower bound (even allowing randomization), then one can conclude that the problem requires Omega(log(Delta) n) time deterministically. (This gives an alternate proof that deterministically Delta-coloring a tree with small Delta takes Omega(log(Delta) n) rounds.) 3. Deterministic lower bounds imply randomized lower bounds. We prove that the randomized complexity of any natural problem on instances of size n is at least its deterministic complexity on instances of size root log n. This shows that a deterministic Omega(log(Delta) n) lower bound for any problem (Delta-coloring a tree, for example) implies a randomized Omega(log(Delta) log n) lower bound. It also illustrates that the graph shattering techn

关键词： Coloring distributed algorithm symmetry breaking

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Asynchronous Coordination with Constraints and Preferences 16

Brief Announcement: Asynchronous Coordination with Constrain...

引用

35th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Castaneda, Armando Fraigniaud, Pierre Gafni, Eli Rajsbaum, Sergio Roy, Matthieu Univ Nacl Autonoma Mexico Inst Matemat Mexico City DF Mexico Univ Paris Diderot CNRS IRIF Paris France Univ Calif Los Angeles CS Dept Los Angeles CA USA Univ Toulouse CNRS LAAS Toulouse France

ISBN: (纸本)9781450339643

Adaptive renaming can be viewed as a coordination task involving a set of asynchronous agents, each aiming at grabbing a single resource out of a set of resources totally ordered by their desirability. We consider a generalization of adaptive renaming to take into account scenarios in which resources are not independent. We model constraints between resources as an undirected graph: nodes represent the ressources, and an edge between two ressources indicates that these two ressources cannot be used simultaneously. In such a setting, the sets of resources that processes may use simultaneously form independent sets. In this note, we focus on this task in a model where such independent sets are computed by wait-free processes.

关键词： graph algorithm task wait-free computing coordination distributed algorithm renaming adaptive algorithms

来源：评论

学校读者我要写书评

暂无评论

Scalable Betweenness Centrality on Multi-GPU systems 16

Scalable Betweenness Centrality on Multi-GPU systems

引用

ACM International Conference on Computing Frontiers (CF)

作者： Bernaschi, Massimo Carbone, Giancarlo Vella, Flavio IAC CNR Ist Applicaz Calcolo Rome Italy Sapienza Univ Rome Rome Italy

ISBN: (纸本)9781450341288

Betweenness Centrality (BC) is steadily growing in popularity as a metrics of the influence of a vertex in a graph. The BC score of a vertex is proportional to the number of all-pairs-shortest-paths passing through it. However, complete and exact BC computation for a large-scale graph is an extraordinary challenge that requires high performance computing techniques to provide results in a reasonable amount of time. Our approach combines bi-dimensional (2-D) decomposition of the graph and multi-level parallelism together with a suitable data-thread mapping that overcomes most of the difficulties caused by the irregularity of the computation on GPUs. In order to reduce time and space requirements of BC computation, a heuristics based on 1-degree reduction technique is developed as well. Experimental results on synthetic and real-world graphs show that the proposed techniques are well suited to compute BC scores in graphs which are too large to fit in the memory of a single computational node.

关键词： GPU CUDA Betweenness Centrality distributed algorithm Large Scale Graphs

来源：评论

学校读者我要写书评

暂无评论

An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model 57

An Exponential Separation Between Randomized and Determinist...

引用

57th IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Chang, Yi-Jun Kopelowitz, Tsvi Pettie, Seth Univ Michigan Ann Arbor MI 48109 USA

ISBN: (纸本)9781509039333

Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge coloring. For most problems the best randomized algorithm is at least exponentially faster than the best deterministic algorithm. We prove that these exponential gaps are necessary and establish numerous connections between the deterministic and randomized complexities in the LOCAL model. Each of our results has a very compelling take-away message: 1) Building on the recent randomized lower bounds of Brandt et al. [1], we prove that the randomized complexity of Delta-coloring a tree with maximum degree Delta is O(log(Delta)log n + log* n), for any Delta >= 55, whereas its deterministic complexity is Omega(log(Delta) n) for any Delta >= 3. This also establishes a large separation between the deterministic complexity of Delta-coloring and (Delta + 1)-coloring trees. 2) We prove that any deterministic algorithm for a natural class of problems that runs in O(1) + o(log(Delta)n) rounds can be transformed to run in O(log* n - log* Delta + 1) rounds. If the transformed algorithm violates a lower bound (even allowing randomization), then one can conclude that the problem requires Omega(log(Delta)n) time deterministically. This gives an alternate proof that deterministically Delta-coloring a tree with small Delta takes O(log(Delta)n) rounds. 3) We prove that the randomized complexity of any natural problem on instances of size n is at least its deterministic complexity on instances of size root log n. This shows that a deterministic O(log(Delta)n) lower bound for any problem (Delta-coloring a tree, for example) implies a randomized Delta(log(Delta)log n) lower bound. It also illustrates that the graph shattering technique employed in recent randomized symmetry breaking algorithms is absolutely essential to the LOCAL model. For example, it is provably impossible to improve the 2(O(root log log n)) term in the

关键词： coloring distributed algorithm local model symmetry breaking

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation in Cellular Systems for Applications with Random Parameters

Resource Allocation in Cellular Systems for Applications wit...

引用

International Conference on Computing, Networking and Communications (ICNC)

作者： Kbah, Zaid Abdelhadi, Ahmed Univ New Haven West Haven CT 06516 USA Virginia Tech Hume Ctr Blacksburg VA USA

ISBN: (纸本)9781467385794

In this paper, we conduct a study to optimize resource allocation for adaptive real-time and delay-tolerant applications in cellular systems. To represent the user applications via several devices and equipment, sigmoidal-like and logarithmic utility functions are used. A fairness proportional utility functions policy approach is used to allocate the resources among the user equipment (UE)s in a utility percentage form in order to ensure a minimum level of customer satisfaction for all the subscribers. Meanwhile, the priority of resources allocation is given to the real-time applications. We measure the effect of the stochastic variations of the adaptive real-time applications on the optimal rate allocation process and compare the results of the deterministic and stochastic systems. Our work is distinct from the other resource allocation optimization works in that we use the bisection method besides convex optimization techniques to optimally allocate rates, and we present the adaptive realtime applications in a stochastic form. We use Microsoft Visual Basic for Applications with Arena Simulation Software interface to simulate the optimization problem. Finally, we present our optimization algorithm results.

关键词： resource allocation QoS robustness real-time applications distributed algorithm stochastic modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共210页 << < 118 119 120 121 122 123 124 125 126 127 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：