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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

2,099 篇 distributed algo...
133 篇 distributed algo...
78 篇 wireless sensor ...
75 篇 resource allocat...
74 篇 optimization
62 篇 consensus
55 篇 convergence
55 篇 wireless sensor ...
50 篇 game theory
40 篇 fault tolerance
40 篇 self-stabilizati...
38 篇 routing
36 篇 smart grid
36 篇 nash equilibrium
33 篇 convex optimizat...
33 篇 power control
32 篇 economic dispatc...
32 篇 multi-agent syst...
32 篇 sensor networks
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,029 篇 英文
49 篇 其他
18 篇 中文

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

共 2099 条记录，以下是1811-1820 订阅

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

详细简洁

排序：

A cooperative single target tracking algorithm using binary sensor networks

A cooperative single target tracking algorithm using binary ...

引用

International Symposium on Telecommunications

作者： Aghajarian, Danial Berangi, Reza Iran Univ Sci & Technol Dept Comp Engn Tehran Iran

ISBN: (纸本)9781424427505

Sensor networks include large number of low cost sensor nodes with small processing capabilities that are deployed over an area in an attempt to do interest sensing task. In this paper we examine the role of very simple and noisy sensors for distributed tracking problem that is one of these tasks. We use a proposed binary sensor model, where each sensor's value is converted reliably to one bit of information only: whether the object is moving toward the sensor or away from it and propose a cooperative distributed algorithm that can be used in real-time tracking and is efficient in power and bandwidth. We show that how an estimator sensor use information from its neighbors to estimate target location more accurately. Our extensive simulations show low error in low density sensor networks.

关键词： Cooperative target tracking distributed algorithm Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Privacy preserving collaborative business process management

Privacy preserving collaborative business process management

引用

5th International Conference on Business Process Management

作者： Chakraborty, Sumit Pal, Asim Kumar IIM Calcutta MIS Kolkata W Bengal India Indian Inst Management MIS Kolkata W Bengal India

ISBN: (纸本)9783540782377

The basic objective of collaborative supply chain planning (CSCP) is to fulfill the demand of the customers by integrating a network of organizations through mediums such as internet. But, the supply chain (SC) partners are often reluctant to share their strategic information. The exchange of relevant strategic information yet maintaining privacy is a challenging issue for CSCP. It is therefore required to develop privacy preserving coordination mechanisms (PPCM) that can align the business objectives of SC partners. This paper presents a distributed algorithm for PPCM for CSCP based on secure multiparty computation. This requires negotiations for compensation between the buying and the selling firms. We have considered a single buyer and single supplier (SBSS) case along with the process flow logic using a process flow construct for secure computation. We have extended the method to a multiparty negotiation process for a multiple buyer and single supplier (MBSS) case.

关键词： coordination mechanism distributed algorithm multi-party negotiation secure multiparty computation collaborative supply chain planning

来源：评论

学校读者我要写书评

暂无评论

Verification of a hierarchical generic mutual exclusion algorithm

引用

28th International Conference on Formal Techniques for Networked and distributed Systems

作者： Baarir, Souheib Sopena, Julien Legond-Aubry, Fabrice Univ Piemonte Orientale Dept Comp Sci Via Bellini 25G I-15100 Alessandria Italy Univ Paris 06 LIP6 F-75016 Paris France

ISBN: (纸本)9783540688549

In distributed environments, the shared resources access control by mutual exclusion paradigm is a recurrent key problem. To cope with the new constraints implied by recently developed large scale distributed systems like grids, mutual exclusion algorithms become more and more complex and thus much harder to prove and/or verify. In this article, we propose the formal modeling and the verification of a new generic hierarchical approach. This approach is based on the composition of classical already proof checked distributed algorithms. It overcomes some limitations of these classical algorithms by taking into account the network topology latencies and have a high scalability where centralized ones don't. We also have formalized the properties of the mutual exclusion paradigm in order to verify them against our solution. We prove that our compositional approach preserves theses properties under the assumption that all used plain algorithms assert them. This verification by formal method checkers was eased by the efficient use of already proved mutual exclusion algorithms and the reduction of state spaces by exploiting the symmetries.

关键词： distributed algorithm composition mutual exclusion grid computing colored Petri nets model checking

来源：评论

学校读者我要写书评

暂无评论

Congestion avoiding mechanism based on inter-domain hierarchy

Congestion avoiding mechanism based on inter-domain hierarch...

引用

7th International IFIP-TC6 Networking Conference

作者： Weisser, Marc-Antoine Tomasik, Joanna Barth, Dominique Supelec 3 Rue Joliot Curie F-91192 Gif Sur Yvette France Univ Versailles PRISM F-78035 Versailles France

ISBN: (纸本)9783540795483

Inter-domain routing is ensured by BGP. BGP messages carry no information concerning quality parameters of routes. Our goal is to provide domains with information regarding the congestion state of other domains without any changes in BGP. A domain, which is aware of congested domains, can choose a bypass instead of a route exhibiting possible QoS problems. We propose a distributed mechanism sending alert messages in order to notify domains about other domains congestion state. Our solution avoids flooding the Internet with signaling messages. It limits the number of alerts by taking advantage of the hierarchical structure of the Internet set by P2C and P2P relationships. Our algorithm is heuristic because it is a solution to an NP-complete and inapproximable problem. We prove these properties using the Steiner problem in directed acyclic graphs. The simulation runs show that our mechanism significantly diminishes the number of unavailable domains and routes compared to those obtained with "pure" BGP routing and with a theoretical centralised mechanism.

关键词： inter-domain QoS distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Data Aggregation in Wireless Sensor Networks

Data Aggregation in Wireless Sensor Networks

引用

3rd International Conference on Information and Communication Technologies

作者： Massad, Y. E. Goyeneche, M. Astrain, J. J. Villadangos, J. Bethlehem Univ Rues Freres Bethlehem PA USA

ISBN: (纸本)9781424417513

Serial data aggregation ensures minimal energy consumption since only one sensor initiates the algorithm and each sensor communicates only once with its successor. But it is difficult in a real scenario (essentially distributed) to synchronize all sensors to collaborate. In this paper we propose a linear distributed algorithm to aggregate data and we simulate it for different scenarios using the ns2 network simulator. We conclude that the proposed algorithm consume energy in a uniform way.

关键词： wireless sensor networks data aggregation distributed algorithm energy consumption

来源：评论

学校读者我要写书评

暂无评论

Fine synchronization for wireless sensor networks using gossip averaging algorithms

Fine synchronization for wireless sensor networks using goss...

引用

IEEE International Conference on Communications (ICC 2008)

作者： Marechal, Nicolas Pierrot, Jean-Benoit Gorce, Jean-Marie CEA LETI MINATEC Grenoble France INSA Lyon Lyon France

ISBN: (纸本)9781424420742

As synchronization preambles represent a great overhead on wireless data packets, it could be interesting to powerful them. Fine synchronization solves this problem by homogenizing clock drift values on network regions. When coupled with any clock bias consensus method (coarse synchronization), fine synchronization allows the setup of time based medium multiplexing schemes (TDMA, Slotted ALOHA,...). This paper deals with a lightweight method able to perform the computation of local clock drift corrections using simple interaction rules between neighbor nodes. The solution proposed in this work has the main advantage to be robust to measurement noise while having the technologically interesting ability to drive clock drifts towards an average consensus.

关键词： distributed algorithm time synchronization networked systems consensus algorithms information fusion

来源：评论

学校读者我要写书评

暂无评论

Directed Transmission Method, a Fully Asynchronous Approach to Solve Sparse Linear Systems in Parallel 08

Directed Transmission Method, a Fully Asynchronous Approach ...

引用

20th ACM Symposium on Parallelism in algorithms and Architectures

作者： Wei, Fei Yang, Huazhong Tsinghua Univ Dept Elect Engn Beijing Peoples R China

ISBN: (纸本)9781595939739

There are many algorithms to solve large sparse linear systems in parallel;however, most of them acquire synchronization and thus are lack of scalability. In this paper, we propose a new distributed numerical algorithm, called Directed Transmission Method (DTM). DTM is a fully asynchronous, scalable and continuous-time iterative algorithm to solve the arbitrarily-large sparse linear system whose coefficient matrix is symmetric-positive-definite (SPD). DTM is able to be freely running on the heterogeneous parallel computer with arbitrary number of processors, which might be manycore microprocessors, clusters, grids, clouds, and the Internet. We proved that DTM is convergent by making use of the final value theorem of Laplacian Transformation. Numerical experiments show that DTM is efficient.

关键词： Asynchronous algorithm Convergence Theory Directed Transmission Method (DTM) distributed algorithm Sparse Linear System Virtual Transmission Method (VTM)

来源：评论

学校读者我要写书评

暂无评论

Fast radio broadcasting with advice

Fast radio broadcasting with advice

引用

15th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2008)

作者： Ilcinkas, David Kowalski, Dariusz R. Pelc, Andrzej Univ Bordeaux 1 CNRS LaBRI F-33405 Talence France Univ Liverpool Dept Comp Sci Liverpool L69 3BX Merseyside England Univ Quebec Ste Foy PQ G1V 2M3 Canada

ISBN: (纸本)9783540693260

We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be available to nodes of the network, in order to broadcast very fast. For networks in which constant time broadcast is possible under complete knowledge of the network we give a tight answer to the above question: O(n) bits of advice are sufficient but o(n) bits are not, in order to achieve constant;broadcasting time in all these networks. This is in sharp contrast with geometric radio networks of constant broadcasting time: we show that in these networks a constant number of bits suffices to broadcast in constant time. For arbitrary radio networks we present a broadcasting algorithm whose time is inverse-proportional to the size of advice.

关键词： radio network distributed algorithm deterministic broadcasting advice

来源：评论

学校读者我要写书评

暂无评论

Detecting wormhole attacks in wireless sensor networks

Detecting wormhole attacks in wireless sensor networks

引用

1st Annual IFIP International Conference on Critical Infrastructure Protection

作者： Xu, Yurong Chen, Guanling Ford, James Makedon, Fillia Dartmouth Coll Hanover NH 03755 USA

ISBN: (纸本)9780387754611

Wormhole attacks can destabilize or disable wireless sensor networks. In a typical wormhole attack, the attacker receives packets at one point in the network, forwards them through a wired or wireless link with less latency than the network links, and relays them to another point in the network. This paper describes a distributed wormhole detection algorithm for wireless sensor networks, which detects wormholes based on the distortions they create in a network. Since wormhole attacks are passive in nature, the algorithm uses a hop counting technique as a probe procedure, reconstructs local maps for cacti node, and then uses a "diameter" feature to detect abnormalities caused by wormholes. The main advantage of the algorithm is that it provides the locations of wormholes, which is useful for implementing countermeasures. Simulation results show that the algorithm has low false detection and false toleration rates.

关键词： wireless sensor networks wormhole detection distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A combined localization and geographic routing algorithm for rapidly-deployed wireless sensor networks

A combined localization and geographic routing algorithm for...

引用

International Conference on Innovations and Commercial Application of Distributive Sensor Networks

作者： Qu, Hui Wicker, Stephen B. Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

We consider a network of randomly-deployed, low-cost sensors and a single powerful sink node. A partition-based localization algorithm is proposed in which the sink node imparts sector-based location information through the phased-array transmission of a series of beacons. One-hop neighbor information is used by each sensor in a series of sector-partitioning routines to identify the sub-sector in which it resides. A geographic routing algorithm is then proposed which uses the sector-based localization results as the basis for a routing algorithm. Simulation results indicate that the performance of our localization algorithm improves with node density, and that the performance of the combined localization and routing algorithm in the presence of severe measurement noise is comparable with that provided by the same routing algorithm using perfect location information.

关键词： partition-based localization geographical routing energy-preserving distributed algorithm wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共210页 << < 178 179 180 181 182 183 184 185 186 187 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：