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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,046 篇 会议
2,180 篇 期刊文献
26 篇 学位论文

馆藏范围

6,252 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,943 篇 工学
- 2,164 篇 计算机科学与技术...
- 1,886 篇 电气工程
- 962 篇 信息与通信工程
- 917 篇 控制科学与工程
- 411 篇 软件工程
- 156 篇 仪器科学与技术
- 156 篇 电子科学与技术（可...
- 135 篇 机械工程
- 71 篇 交通运输工程
- 41 篇 石油与天然气工程
- 23 篇 网络空间安全
- 22 篇 动力工程及工程热...
- 17 篇 测绘科学与技术
- 16 篇 土木工程
- 11 篇 生物医学工程（可授...
- 9 篇 材料科学与工程（可...
- 8 篇 航空宇航科学与技...
692 篇 理学
- 372 篇 数学
- 274 篇 系统科学
- 77 篇 物理学
- 18 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 化学
237 篇 管理学
- 229 篇 管理科学与工程(可...
- 10 篇 图书情报与档案管...
37 篇 医学
- 32 篇 临床医学
- 11 篇 特种医学
20 篇 文学
- 20 篇 新闻传播学
10 篇 经济学
- 7 篇 理论经济学
6 篇 军事学
- 6 篇 军队指挥学
3 篇 教育学
3 篇 农学
2 篇 艺术学
1 篇 法学

主题

6,252 篇 distributed algo...
546 篇 convergence
545 篇 wireless sensor ...
523 篇 algorithm design...
415 篇 optimization
381 篇 computer science
372 篇 distributed comp...
363 篇 network topology
329 篇 routing
279 篇 resource managem...
218 篇 protocols
212 篇 computational mo...
207 篇 computer network...
203 篇 costs
202 篇 approximation al...
200 篇 fault tolerance
185 篇 ad hoc networks
183 篇 bandwidth
179 篇 peer to peer com...
178 篇 interference

机构

25 篇 carnegie mellon ...
19 篇 univ illinois de...
19 篇 cent south univ ...
19 篇 nanyang technol ...
19 篇 univ cyprus dept...
16 篇 ege univ int com...
16 篇 univ minnesota d...
16 篇 mit cambridge ma...
15 篇 univ liverpool d...
14 篇 suny stony brook...
14 篇 swiss fed inst t...
14 篇 purdue univ sch ...
13 篇 northeastern uni...
12 篇 shanghai jiao to...
12 篇 univ penn dept e...
12 篇 department of el...
12 篇 weizmann inst sc...
11 篇 department of in...
11 篇 georgia state un...
11 篇 purdue univ sch ...

作者

35 篇 hadjicostis chri...
23 篇 kowalski dariusz...
22 篇 notarstefano giu...
21 篇 hong yiguang
21 篇 scutari gesualdo
20 篇 dagdeviren orhan
18 篇 dominguez-garcia...
17 篇 deng zhenhua
17 篇 pandurangan gopa...
17 篇 mosbah mohamed
16 篇 christoforos n. ...
16 篇 cortes jorge
16 篇 khan usman a.
16 篇 schmid stefan
16 篇 sharma gokarna
15 篇 peleg david
15 篇 korman amos
15 篇 navarra alfredo
15 篇 mou shaoshuai
15 篇 zeng xianlin

语言

6,145 篇 英文
64 篇 其他
38 篇 中文
3 篇 德文
1 篇 葡萄牙文
1 篇 土耳其文

检索条件"主题词=distributed algorithms"

共 6252 条记录，以下是4811-4820 订阅

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

详细简洁

排序：

Interplay of ISPs: distributed Resource Allocation and Revenue Maximization

Interplay of ISPs: Distributed Resource Allocation and Reven...

引用

International Conference on distributed Computing Systems

作者： S.C.M. Lee J.W.J. Jiang J.C.S. Lui Dah-Ming Chiu Department of Computer Science & Engineering Chinese University of Hong Kong New Territories Hong Kong China Department of Information Engineering Chinese University of Hong Kong Hong Kong China

The Internet is a hierarchical architecture comprising heterogeneous entities of privately owned infrastructures, where higher level Internet service providers (ISPs) supply connectivity to the local ISPs and charge the local ISPs for the transit services. One of the challenging problems facing service providers today is how to increase the profitability while maintaining good service qualities. In this work, we seek to understand the fundamental issues on the "interplay" (or interaction) between ISPs at different tiers. While the local ISPs (which we term peers) can communicate with each other by purchasing the connectivity from transit ISPs, there stands an opportunity for them to set up private peering relationships. Under this competitive framework, we explore the issues on (a) impact of peering relationship, (b) resource distribution and (c) revenue maximization. Firstly, a generalized model is presented to characterize the behaviors of peers and the transit ISP, in which their economic interests are reflected. We study how a peer can distributively determine its optimal peering strategy. Furthermore, we show how a transit ISP is able to utilize the available information to infer its optimal pricing strategy, under which a revenue maximization is achieved. A distributed algorithm is proposed to help ISPs to provide a fair and efficient bandwidth allocation to peers, avoiding a resource monopolization of the market. Extensive simulations are carried out to support our claims.

关键词： Resource management Pricing Web and internet services Profitability Service oriented architecture distributed algorithms Channel allocation Computer science Computer architecture Bandwidth

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for a color assignment on asynchronous rings 06

Distributed algorithm for a color assignment on asynchronous...

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： G. De Marco M. Leoncini M. Montangero Dipartimento di Informatica e Applicazioni Universitá di Salerno Baronissi Salerno Italy Istituto di Informatica e Telematica Consiglio Nazionale delle Ricerche Pisa Italy Dipartimento di Ingegneria dellInformazione Universitá di Modena e Reggio Emilia Modena Italy

ISBN: (纸本)9781424400546

We study a version of the beta-assignment problem (Chang and Lee, 1988) on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also n computational agents connected by an asynchronous ring. Each agent holds a subset of the items, where initially different agents might hold items associated to the same color. We analyze the problem of distributively assigning colors to agents in such a way that (a) each color is assigned to one agent and (b) the number of different colors assigned to each agent is minimum. Since any color assignment requires that the items be distributed according to it (e.g. all items of the same color are to be held by only one agent), we define the cost of a color assignment as the amount of items that need to be moved, given an initial allocation. We first show that any distributed algorithm for this problem on the ring requires a communication complexity of Omega(n middot m) and then we exhibit a polynomial time distributed algorithm with message complexity matching the bound, that determines a color assignment with cost at most (2 + epsi) times the optimal cost, for any 0 < epsi < 1

关键词： distributed algorithms Cost function Color Complexity theory Polynomials Contracts Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

An adaptive distributed algorithm for the maximum flow problem in the underlying asynchronous network

An adaptive distributed algorithm for the maximum flow probl...

引用

IEEE International Conference on Research, Innovation and Vision for the Future

作者： Thuy Lien Pham M. Bui I. Lavallee Si Hoang Do Laboratoire d'Informatique et des Systémes Complexes Paris France

来源：评论

学校读者我要写书评

暂无评论

Constant-Time distributed Scheduling Policies for Ad Hoc Wireless Networks

Constant-Time Distributed Scheduling Policies for Ad Hoc Wir...

引用

IEEE Conference on Decision and Control

作者： Xiaojun Lin Shahzada B. Rasool School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

ISBN: (纸本)1424401704

We propose two new distributed scheduling policies for ad hoc wireless networks that can achieve provable capacity regions. Known scheduling policies that guarantee comparable capacity regions are either centralized or need computation time that increases with the size of the network. In contrast, the unique feature of the proposed distributed scheduling policies is that they are constant-time policies, i.e., the time needed for computing a schedule is independent of the network size. Hence, they can be easily deployed in large networks

关键词： Wireless networks Processor scheduling Computer networks distributed computing Interference Ad hoc networks Transmitters distributed algorithms USA Councils Intelligent networks

来源：评论

学校读者我要写书评

暂无评论

A distributed Clustering Technique for Intrinsic Cluster Detection

A Distributed Clustering Technique for Intrinsic Cluster Det...

引用

International Conference on Advanced Computing and Communications (ADCOM)

作者： R. Das S. Sarmah D. K. Bhattacharyya Department of Computer Science & Engineering Tezpur University India

This paper presents an efficient distributed clustering technique capable of identifying embedded clusters over very large spatial datasets. The technique is based upon a client server approach, where the huge dataset stored in the server are partitioned into almost k equal partitions which are used by k clients to identify the embedded clusters in parallel for each partition sent by the server. Finally, the embedded clusters obtained from the k clients are merged at the Server for the ultimate results. Experimental results establish the superiority of the technique in terms of scale-up, speedup as well as cluster quality, in comparison to its other counterparts ([3], [6]).

关键词： Clustering algorithms Partitioning algorithms Computer science Data mining Optical sensors Shape Degradation Computational complexity distributed algorithms Spatial databases

来源：评论

学校读者我要写书评

暂无评论

distributed Groups Mutual Exclusion Based on Clients/Servers Model

Distributed Groups Mutual Exclusion Based on Clients/Servers...

引用

IEEE International Conference on Parallel and distributed Computing, Applications and Technologies (PDCAT)

作者： Ousmane Thiare Mourad Gueroui Mohamed NAIMI Department of Computer Science University of Cergy-Pontoise France PRISM Lab Versailles France

In this paper we present a new distributed group mutual exclusion (DGME) based on clients/servers model, and uses a dynamic data structures. Several processes (clients) can access simultaneously to a same opened session (server). The algorithm ensures that, at any time, at most one session is opened, and any requested session will be opened in a finite time. The number of messages is between 0 and m, where m is the number of session in the network. In the average case, O(Log(m)) messages are necessary to open a session. The maximum concurrency is n, where n is the number of processes in the network

关键词： Concurrent computing Delay Computer science Clocks Permission Synchronization Data structures Network servers distributed algorithms Message passing

来源：评论

学校读者我要写书评

暂无评论

An O(n) distributed deadlock resolution algorithm

An O(n) distributed deadlock resolution algorithm

引用

Euromicro Conference on Parallel, distributed and Network-Based Processing

作者： M. Prieto J. Villadangos F. Farina A. Cordoba Department de Matemática e Informática Universidad PÙblica de Navarra Pamplona Spain

This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of previous proposals. The algorithm has a communication cost of 2n - 1 messages and a latency of n /spl middot/ T for a deadlock cycle of n processes, where T is the inter-site communication delay. The algorithm achieves this improvement even verifying the strongest correctness criteria considered in previous works: it resolves all deadlocks in finite time and does not resolve false deadlocks.

关键词： System recovery Abortion Delay Proposals Strontium distributed algorithms Costs Throughput Safety Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed Mining of Constrained Patterns from Wireless Sensor Data

Distributed Mining of Constrained Patterns from Wireless Sen...

引用

Web Intelligence and Intelligent Agent Technology Workshops (WI-IAT)

作者： Carson Kai-sang Leung Quamrul I. Khan Boyu Hao University of Manitoba Canada

With the advance in technology, wireless sensor networks have been widely used in many application areas such as agricultural and environmental monitoring. Sensors distributed in these networks serve as good sources for data. This calls for distributed data mining, which searches for implicit, previously unknown, and potentially useful patterns that might be embedded in the distributed data. Many existing distributed data mining algorithms do not allow users to express the patterns to be mined according to their intension via the use of constraints. Consequently, these unconstrained mining algorithms can yield numerous patterns that are not interesting to users. In this paper, we propose an efficient tree-based system for mining patterns that satisfy user-defined constraints from a distributed environment such as a wireless sensor network. Experimental results show effectiveness of our proposed system

关键词： Wireless sensor networks Data mining Monitoring Frequency Bandwidth distributed algorithms Algorithm design and analysis Computational modeling Temperature Transaction databases

来源：评论

学校读者我要写书评

暂无评论

distributed localization of networked cameras

Distributed localization of networked cameras

引用

International Symposium on Information Processing in Sensor Networks (IPSN)

作者： S. Funiak C. Guestrin M. Paskin R. Sukthankar Carnegie Mellon USA University of Stanford USA Intel Research USA

Camera networks are perhaps the most common type of sensor network and are deployed in a variety of real-world applications including surveillance, intelligent environments and scientific remote monitoring. A key problem in deploying a network of cameras is calibration, i.e., determining the location and orientation of each sensor so that observations in an image can be mapped to locations in the real world. This paper proposes a fully distributed approach for camera network calibration. The cameras collaborate to track an object that moves through the environment and reason probabilistically about which camera poses are consistent with the observed images. This reasoning employs sophisticated techniques for handling the difficult nonlinearities imposed by projective transformations, as well as the dense correlations that arise between distant cameras. Our method requires minimal overlap of the cameras' fields of view and makes very few assumptions about the motion of the object. In contrast to existing approaches, which are centralized, our distributed algorithm scales easily to very large camera networks. We evaluate the system on a real camera network with 25 nodes as well as simulated camera networks of up to 50 cameras and demonstrate that our approach performs well even when communication is lossy

关键词： Intelligent sensors Calibration Smart cameras Surveillance Intelligent networks Remote monitoring Image sensors Collaboration distributed algorithms Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

distributed Allocation of Identical Resources in Mobile Ad Hoc Networks

Distributed Allocation of Identical Resources in Mobile Ad H...

引用

International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

作者： S.M. Masum A.A. Ali Faculty of Science and Information Technology Daffodil International University Dhaka Bangladesh Department of Computer Science and Engineering University of Dhaka Dhaka Bangladesh Daffodil International University Dhaka Bangladesh

This paper addresses the l—Exclusion problem for mobile ad hoc networks. The l—Exclusion problem, a generalization of distributed mutual exclusion problem, involves a group of processes, each of which intermittently requires access to one of l identical resources or pieces of code called the critical section (CS). In literature, few token—based solutions to this l—Exclusion problem are available. Nevertheless, these solutions suffer from poor failure resiliency, as these do not consider failures associated with mobile ad hoc networks, such as loss or regeneration of tokens, crash or sudden recovery of nodes. This paper presents a consensus—based mobility—aware l—exclusion (LE) algorithm that operates asynchronously and copes explicitly with arbitrary (possibly concurrent) topology changes associated with such networks. The algorithm can tolerate link changes or failures, sudden crashes or recoveries of at most l—1 mobile nodes. The algorithm is based on collection enough consensuses for a mobile node intending to enter CS, and uses diffusing computations for this purpose. The algorithm requires nodes to communicate only with their current neighbors, making it well—suited for use in mobile ad hoc networks. This paper presents a simulation study to demonstrate that the proposed algorithm, as compared to the k—Reverse Link (KRL) algorithm, is quite effective to variety of operating conditions, and is highly adaptive to frequent and unpredictable topology changes due to link changes or failures or formations, sudden crashes or recoveries of at most l—1 mobile nodes, under different mobility settings.

关键词： Resource management Intelligent networks Mobile ad hoc networks Computer crashes Network topology Mobile computing distributed computing Computational modeling Computer networks distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 478 479 480 481 482 483 484 485 486 487 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：