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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

2,094 篇 distributed algo...
134 篇 distributed algo...
77 篇 wireless sensor ...
75 篇 optimization
75 篇 resource allocat...
62 篇 consensus
56 篇 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 篇 shanghai jiao to...
11 篇 nanyang technol ...
11 篇 chinese acad sci...
10 篇 ohio state univ ...
10 篇 southeast univ s...
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 篇 xi an jiao tong ...
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 篇 cao jiannong
10 篇 lau francis c. m...
10 篇 raynal m
9 篇 mostefaoui achou...
9 篇 kakugawa hirotsu...

语言

2,025 篇 英文
53 篇 其他
16 篇 中文

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

共 2094 条记录，以下是1401-1410 订阅

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

详细简洁

排序：

An Infrastructure-less Vehicle Counting without Disruption 43

An Infrastructure-less Vehicle Counting without Disruption

引用

43rd Annual International Conference on Parallel Processing (ICPP)

作者： Wu, Jie Sabatino, Paul Tsan, Jennifer Jiang, Zhen Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA West Chester Univ Dept Comp Sci W Chester PA 19382 USA

ISBN: (纸本)9781479956180

This paper presents a solution to count all moving vehicles in a target region. This is a large-scale counting that cannot be easily solved without a global view. However, there is no single force that can provide such a global view. To achieve an accurate result without either double-or miscounting, the local counting at each checkpoint is synchronized in our wireless communication by using the information carried by vehicles along the traffic flow. Our analytical and experimental results illustrate the correctness of the proposed scheme in both closed and open road systems - even when the wireless signal is affected by many factors. In this way, we provide an essential support for the resource management in VANETs.

关键词： distributed algorithm inter-vehicle wireless communication resource management traffic surveillance

来源：评论

学校读者我要写书评

暂无评论

DEX: Self-healing Expanders

DEX: Self-healing Expanders

引用

IEEE 28th International Parallel & distributed Processing Symposium (IPDPS)

作者： Pandurangan, Gopal Robinson, Peter Trehan, Amitabh Nanyang Technol Univ Div Math Sci Singapore 637371 Singapore Queens Univ Belfast Sch Elect Elect Engn & Comp Sci Belfast BT7 1NN Antrim North Ireland

ISBN: (纸本)9780769552071

We present a fully-distributed self-healing algorithm DEX that maintains a constant degree expander network in a dynamic setting. To the best of our knowledge, our algorithm provides the first efficient distributed construction of expanders - whose expansion properties hold deterministically - that works even under an all-powerful adaptive adversary that controls the dynamic changes to the network (the adversary has unlimited computational power and knowledge of the entire network state, can decide which nodes join and leave and at what time, and knows the past random choices made by the algorithm). Previous distributed expander constructions typically provide only probabilistic guarantees on the network expansion which rapidly degrade in a dynamic setting;in particular, the expansion properties can degrade even more rapidly under adversarial insertions and deletions. Our algorithm provides efficient maintenance and incurs a low overhead per insertion/deletion by an adaptive adversary: only O(logn) rounds and O(logn) messages are needed with high probability (n is the number of nodes currently in the network). The algorithm requires only a constant number of topology changes. Moreover, our algorithm allows for an efficient implementation and maintenance of a distributed hash table (DHT) on top of DEX with only a constant additional overhead. Our results are a step towards implementing efficient selfhealing networks that have guaranteed properties (constant bounded degree and expansion) despite dynamic changes.

关键词： distributed algorithm dynamic network expansion reconfiguration self-healing dynamic network Expander Device Component distributed algorithms Reconfiguration Prunella vulgaris Expansion algorithms computational power

来源：评论

学校读者我要写书评

暂无评论

Network Utility Maximization with Random Link Failures

Network Utility Maximization with Random Link Failures

引用

International Conference on Advances in Materials Science and Information Technologies in Industry (AMSITI)

作者： Liao, Shengbin Zhu, Cuitao Huazhong Normal Univ Engn & Res Ctr Informat & Technol Educ Wuhan 430079 Peoples R China

Network utility maximization model with random link failures was presented in this paper. We provide a distributed algorithm based on the dual decomposition and investigate the impacts of link failures on the network ... 详细信息

ISBN: (纸本)9783038350125

关键词： Network utility maximization Random Link failures distributed algorithm Dual decomposition

来源：评论

学校读者我要写书评

暂无评论

Fair Resource Allocation for OFDMA Multi-cell Networks

Fair Resource Allocation for OFDMA Multi-cell Networks

引用

Information Theory and Applications Workshop (ITA)

作者： Li, Wuwen Pottie, Greg Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA

ISBN: (纸本)9781479935901

Fair resource allocation in OFDMA networks is studied in this paper. We propose a distributed algorithm requiring minimum inter-cell information that embodies the principle of balancing advantaged and disadvantaged user traffic flows. A simple interference deterministic channel model assuming zero queuing delay is used. We propose a hybrid power and bandwidth allocation algorithm. A two-dimensional simulation conducted on both uniform and random-sized-cells shows the benefits are significant when fair allocations are desired.

关键词： dynamic bandwidth allocation power control OFDMA fair resource allocation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A Simple Broadcast algorithm for Recurrent Dynamic Systems

A Simple Broadcast Algorithm for Recurrent Dynamic Systems

引用

28th IEEE International Conference on Advanced Information Networking and Applications Workshops (IEEE WAINA)

作者： Raynal, Michel Stainer, Julien Cao, Jiannong Wu, Weigang Inst Univ France Rennes France Univ Rennes IRISA F-35042 Rennes France Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China Sun Yat Sen Univ Dept Comp Sci Guangzhou 510006 Guangdong Peoples R China

ISBN: (纸本)9781479936298

This paper presents a simple broadcast algorithm suited to dynamic systems where links can repeatedly appear and disappear. The algorithm is proved correct and a simple improvement is introduced, that reduces the number and the size of control messages. As it extends in a simple way a classical network traversal algorithm to the dynamic context, the proposed algorithm has also pedagogical flavor.

关键词： Bounded delay Broadcast distributed algorithm Dynamic network Mobile entity Unbounded recurrence Recurrent link

来源：评论

学校读者我要写书评

暂无评论

Using Reconfigurable Radios to Increase Throughput in Wireless Sensor Networks 10

Using Reconfigurable Radios to Increase Throughput in Wirele...

引用

10th International Conference on Mobile Ad-hoc and Sensor Networks MSN

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

ISBN: (纸本)9781479973941

In traditional wireless sensor networks communicating on a single channel the data throughput measured at the sink is constrained by the radio capability, contentions, and collisions, which increase in the region closer to the sink. Using SDR technology, different levels of configuration within a transceiver are allowed. In this paper we assume that the sink and sensor nodes are equipped with reconfigurable radios. We design a distributed algorithm used by sensor nodes to reconfigure their radio according to some predefined radio-modes, such that the resulting topology is connected to the sink. Collecting sensor data using this topology reduces the interference and increases the network throughput and the data delivery rate. We analyze the performance of our algorithm using ns-3 simulations.

关键词： wireless sensor network radio-mode assignment multi-radio sink distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Parallel Community Detection For Cross-Document Coreference

Parallel Community Detection For Cross-Document Coreference

引用

IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (WI-IAT)

作者： Rahimian, Fatemeh Girdzijauskas, Sarunas Haridi, Seif KTH Royal Inst Technol Swedish Inst Comp Sci Stockholm Sweden KTH Royal Inst Technol Stockholm Sweden

ISBN: (纸本)9781479941438

This paper presents a highly parallel solution for cross-document coreference resolution, which can deal with billions of documents that exist in the current web. At the core of our solution lies a novel algorithm for community detection in large scale graphs. We operate on graphs which we construct by representing documents' keywords as nodes and the co-location of those keywords in a document as edges. We then exploit the particular nature of such graphs where coreferent words are topologically clustered and can be efficiently discovered by our community detection algorithm. The accuracy of our technique is considerably higher than that of the state of the art, while the convergence time is by far shorter. In particular, we increase the accuracy for a baseline dataset by more than 15% compared to the best reported result so far. Moreover, we outperform the best reported result for a dataset provided for the Word Sense Induction task in SemEval 2010.

关键词： document handling graph theory natural language processing SemEval 2010 cross-document coreference resolution large scale graph parallel community detection word sense induction task Accuracy Clustering algorithms Color Communities Context Force Measurement community detection coreference resolution cross-document coreference distributed algorithm electronic document handling Coreference Resolution Clustering algorithms distributed algorithms Communities Natural Language Processing Graph theory Force KEYWORD state of the art Co-location

来源：评论

学校读者我要写书评

暂无评论

SCAPE: Safe Charging with Adjustable PowEr 34

SCAPE: Safe Charging with Adjustable PowEr

引用

34th IEEE International Conference on distributed Computing Systems (ICDCS)

作者： Dai, Haipeng Liu, Yunhuai Chen, Guihai Wu, Xiaobing He, Tian Nanjing Univ State Key Lab Novel Software Technol Nanjing 210023 Jiangsu Peoples R China Third Res Inst Minist Publ Secur Shanghai Peoples R China Shanghai Jiao Tong Univ Shanghai Key Lab Scalable Comp & Syst Shanghai 200240 Peoples R China Univ Minnesota Comp Sci & Engn Minneapolis MN 55455 USA

ISBN: (纸本)9781479951680

Wireless power transfer technology is considered as one of the promising solutions to address the energy limitation problems for end-devices, but its incurred potential risk of electromagnetic radiation (EMR) exposure is largely overlooked by most existing works. In this paper, we consider the Safe Charging with Adjustable PowEr (SCAPE) problem, namely, how to adjust the power of chargers to maximize the charging utility of devices, while assuring that EMR intensity at any location in the field does not exceed a given threshold R-t. We present novel techniques to reformulate SCAPE into a traditional linear programming problem, and then remove its redundant constraints as much as possible to reduce computational effort. Next, we propose a distributed algorithm with provable approximation ratio (1 - epsilon). Through extensive simulation and testbed experiments, we demonstrate that our (1 - epsilon)-approximation algorithm outperforms the Set-Cover algorithm by up to 23%, and has an average performance gain of 41.1% over the SCP algorithm in terms of the overall charging utility.

关键词： adjustable power distributed algorithm safe charging wireless power transfer

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Linial's Lower Bound Made Easy 14

Brief Announcement: Linial's Lower Bound Made Easy

引用

ACM Symposium on Principles of distributed Computing (PODC)

作者： Laurinharju, Juhana Suomela, Jukka Univ Helsinki Helsinki Inst Informat Technol HIIT Dept Comp Sci Helsinki Finland Aalto Univ Helsinki Inst Informat Technol HIIT Dept Informat & Comp Sci Espoo Finland

Linial's seminal result shows that any deterministic distributed algorithm that finds a 3-colouring of an n-cycle requires at least log* (n)/2-1 communication rounds. We give a new simpler proof of this theorem.

ISBN: (纸本)9781450329446

关键词： Cycle distributed algorithm graph coloring iterated logarithm LOCAL model lower bound

来源：评论

学校读者我要写书评

暂无评论

Robust Topology using Reconfigurable Radios in Wireless Sensor Networks 10

Robust Topology using Reconfigurable Radios in Wireless Sens...

引用

10th International Conference on Mobile Ad-hoc and Sensor Networks MSN

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

ISBN: (纸本)9781479973941

Using SDR technology, the distributed algorithm RMA is used by sensor nodes to reconfigure their radio according to some predefined radio-modes, such that the resulting topology is connected to the sink. This mechanism reduces interference and increases data delivery rate. In this paper we extend RMA by adding a low overhead mechanism to be used in the presence of a primary user. Sensor nodes operating on the same frequency as the primary user will reassign their radio mode such that the resulting topology does not interfere with the primary user. We analyze the performance of our distributed algorithm using ns-3 simulations.

关键词： wireless sensor network radio mode assignment multi-radio sink distributed algorithm primary user robust topology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共210页 << < 137 138 139 140 141 142 143 144 145 146 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：