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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,033 篇 会议
2,063 篇 期刊文献
34 篇 学位论文

馆藏范围

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

日期分布

学科分类号

3,830 篇 工学
- 2,087 篇 计算机科学与技术...
- 1,865 篇 电气工程
- 930 篇 信息与通信工程
- 899 篇 控制科学与工程
- 364 篇 软件工程
- 153 篇 仪器科学与技术
- 146 篇 电子科学与技术（可...
- 134 篇 机械工程
- 70 篇 交通运输工程
- 39 篇 石油与天然气工程
- 21 篇 网络空间安全
- 19 篇 动力工程及工程热...
- 15 篇 土木工程
- 15 篇 测绘科学与技术
- 11 篇 生物医学工程（可授...
- 8 篇 材料科学与工程（可...
- 7 篇 航空宇航科学与技...
652 篇 理学
- 342 篇 数学
- 269 篇 系统科学
- 70 篇 物理学
- 18 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 化学
232 篇 管理学
- 224 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
36 篇 医学
- 31 篇 临床医学
- 11 篇 特种医学
20 篇 文学
- 20 篇 新闻传播学
10 篇 经济学
- 7 篇 理论经济学
6 篇 军事学
- 6 篇 军队指挥学
3 篇 教育学
2 篇 农学
1 篇 艺术学

主题

6,130 篇 distributed algo...
553 篇 convergence
532 篇 wireless sensor ...
528 篇 algorithm design...
409 篇 optimization
382 篇 computer science
368 篇 distributed comp...
363 篇 network topology
331 篇 routing
279 篇 resource managem...
218 篇 computational mo...
218 篇 protocols
207 篇 computer network...
206 篇 costs
198 篇 approximation al...
196 篇 fault tolerance
187 篇 ad hoc networks
182 篇 bandwidth
180 篇 peer to peer com...
180 篇 interference

机构

24 篇 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 篇 northeastern uni...
14 篇 purdue univ sch ...
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 ...
11 篇 univ cyprus dept...

作者

38 篇 hadjicostis chri...
23 篇 kowalski dariusz...
21 篇 hong yiguang
21 篇 notarstefano giu...
20 篇 dagdeviren orhan
20 篇 scutari gesualdo
18 篇 dominguez-garcia...
17 篇 deng zhenhua
17 篇 pandurangan gopa...
17 篇 mosbah mohamed
16 篇 christoforos n. ...
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
15 篇 cortes jorge

语言

6,029 篇 英文
58 篇 其他
38 篇 中文
4 篇 德文
1 篇 法文
1 篇 葡萄牙文
1 篇 俄文
1 篇 土耳其文

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

共 6130 条记录，以下是4871-4880 订阅

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

详细简洁

排序：

Certificate Chain Discovery in Web of Trust for Ad Hoc Networks

Certificate Chain Discovery in Web of Trust for Ad Hoc Netwo...

引用

International Conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Hisashi Mohri Ikuya Yasuda Yoshiaki Takata Hiroyuki Seki Graduate School of Information Science Nara Institute of Science and Technology Ikoma Nara Japan

In an ad hoc network, we cannot assume a trusted certificate authority and a centralized repository that are used in ordinary public-key infrastructure (PKI). Hence a PKI system of the Web-of-trust type in which each node can issue certificates to others in a self-organizing manner has been studied. Although this system is useful for ad hoc networks whose topology can change, it has the problem that for authentication a node needs to find a certificate-chain to the destination node. In this paper, we formally model a web-of-trust-type PKI system, define the certificate-chain discovery problem, and propose a new distributed algorithm and its modifications that solve the problem. Furthermore, we propose a measure of communication cost, and according to the measure, we compare our algorithm with an existing method.

关键词： Ad hoc networks Public key Authentication Information science Network topology distributed algorithms Costs Wireless networks Communication system security Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Optimizing Application Performance through Learning and Cooperation in a Wireless Sensor Network

Optimizing Application Performance through Learning and Coop...

引用

MILCOM, Military Communications Conference

作者： Wai-Leong Yeow Chen-Khong Tham Wai-Choong Wong NUS Graduate School of Integrative Sciences & Engineering National University of Singapore Singapore

A wireless sensor network performing surveillance in time-critical missions involving event or target tracking demands accurate ground information be delivered within a delay guarantee. Present methods solve this by using in-network fusion across all packets to reduce network load in the hope of achieving the delay guarantee. In this paper, we aim to maximize data quality from sensor fusion, while still respecting delay guarantees. The proposed method makes admission control and routing decisions using a fully distributed algorithm based on constrained Markov Decision Processes (MDPs). Cooperation is enforced through well-defined rewards and leading nodes. Assessment of data quality is derived from likelihood ratio, which is a commonly used metric in sensor fusion. We study the performance of the proposed algorithm through extensive simulations, and show that it can achieve soft delay guarantees and good data quality compared to other schemes.

关键词： Wireless sensor networks Delay Admission control Routing Sensor fusion Time factors distributed algorithms Application software Computer networks Surveillance

来源：评论

学校读者我要写书评

暂无评论

Local Conditioning on undirected graphs

Local Conditioning on undirected graphs

引用

Information Theory and Applications Workshop, ITA

作者： Matthew G. Reyes David L. Neuhoff EECS Department University of Michigan

ISBN: (纸本)9781509052943

This paper proposes Local Conditioning as a truly distributed exact version of Belief Propagation for cyclic undirected graphical models. It is shown how to derive explicit recursive updates for messages and beliefs that are truly distributed in the sense that messages are passed between individual nodes of the graph rather than between clustered nodes. Such a distributed algorithm is especially relevant for problems that require a distributed implementation, for example sensor networks. In order to compare its complexity and ease of implementation with a clustered version of Belief Propagation, we illustrate both in a Min-Sum block interpolation problem within the context of an Ising model.

关键词： Belief propagation Clustering algorithms Complexity theory Graphical models Interpolation distributed algorithms Standards

来源：评论

学校读者我要写书评

暂无评论

algorithms for Large, Sparse Network Alignment Problems

Algorithms for Large, Sparse Network Alignment Problems

引用

IEEE International Conference on Data Mining (ICDM)

作者： Mohsen Bayati Margot Gerritsen David F. Gleich Amin Saberi Ying Wang Electrical Engineering Department University of Stanford USA Energy Resources Engineering Department University of Stanford USA ICME University of Stanford USA MS&E Department University of Stanford USA

We propose a new distributed algorithm for sparse variants of the network alignment problem, which occurs in a variety of data mining areas including systems biology, database matching, and computer vision. Our algorithm uses a belief propagation heuristic and provides near optimal solutions for this NP-hard combinatorial optimization problem. We show that our algorithm is faster and outperforms or ties existing algorithms on synthetic problems, a problem in bioinformatics, and a problem in ontology matching. We also provide a unified framework for studying and comparing all network alignment solvers.

关键词： Belief propagation Bipartite graph Data mining Computer vision Bioinformatics Ontologies Energy resources Data engineering Power engineering and energy distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Towards a fair non-convex resource allocation in Wireless Networks

Towards a fair non-convex resource allocation in Wireless Ne...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： G. Tychogiorgos A. Gkelias K. K. Leung Electrical and Electronic Engineering Imperial College London London UK

This paper presents a non-convex optimization framework for the Network Utility Maximization problem in Wireless Networks, which incorporates the interference among links and introduces a power penalty term in the objective function to assure both convergence and energy efficiency of the method. Moreover, a distributed gradient based algorithm is proposed that converges to the optimal solution for problems with zero duality gap and a fair-allocation heuristic is presented to resolve user oscillations when they occur. Finally, numerical results regarding the performance of the heuristic and the distributed approach are presented.

关键词： Optimization Oscillators Resource management Convergence Wireless communication distributed algorithms Vectors

来源：评论

学校读者我要写书评

暂无评论

Rotating consensus of the multi-agent system under a directed graph

Rotating consensus of the multi-agent system under a directe...

引用

Chinese Control Conference (CCC)

作者： Qiaoyun Li Jie Mei School of Mechanical Engineering and Automation Harbin Institute of Technology Shenzhen PR China

This paper investigates the problems of the rotating consensus for a first-order multi-agent system under a directed graph. We propose the distributed algorithms for the agents so that agents can revolve around a common center by using local relative information. Two kinds of rotating consensus problems are considered, namely, the rotating radius consensus probelm and the rotating displacement consensus problem. With the help of the graph theory and the Lyapunov theory, it is proved that the multi-agent system reaches relevant desired rotating consensus. Finally, simulation examples are provided to illustrate the correctness and effectiveness of proposed algorithms.

关键词： Multi-agent systems distributed algorithms Laplace equations Topology Symmetric matrices Graph theory Decentralized control

来源：评论

学校读者我要写书评

暂无评论

Rate maximization for wireless ad hoc networks

Rate maximization for wireless ad hoc networks

引用

IEEE Region 10 International Conference TENCON

作者： Jui Teng Wang Graduate Institute of Communication Engineering National Chi Nan University Nantou Taiwan

We propose in this paper the centralized and distributed algorithms for rate maximization in wireless ad hoc networks with cochannel interference. The goal of the proposed algorithms is maximizing the data rate while minimizing the transmitting power on each hop. The distributed algorithm simulates the operation of the centralized algorithm in a distributed fashion and need not measure the link gains for all transmission links and interference links. We show that the distributed algorithm can find the maximal transmitting rate and the minimal transmitting power as the centralized algorithm does. Simulation results also show that the proposed distributed algorithm outperforms the previous distributed algorithm in the data rate achieved.

关键词： Mobile ad hoc networks Power control Ad hoc networks Interchannel interference Routing distributed algorithms Time division multiple access Gain measurement Interference constraints Multiaccess communication

来源：评论

学校读者我要写书评

暂无评论

Reverse Link Rate Control algorithms with Utility Function Model for CDMA2000 1x EV-DO Systems

Reverse Link Rate Control Algorithms with Utility Function M...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Liu Bingzhang Zhang Yong Xin Zhang Dacheng Yang Wireless Theories and Technologies (WT&T) Beijing University of Posts and Telecommunications Beijing China Beijing University of Posts and Telecommunications Beijing Beijing CN

This paper focuses on the research of distributed rate control algorithms for the reverse link of 1times EV-DO systems. First, following the basic idea proposed by Kelly (1997), a utility maximization system model is formulated. The objective of the rate control algorithms is to make the system converge to the optimal state of the system model. We investigate the performance of two distributed rate control algorithms: the conventional distributed rate control (CDRC) algorithm and the modified distributed rate control (MDRC) algorithm. The CDRC is based on the MAC algorithm in CDMA2000 1times EV-DO Standard (2005). With the CDRC, we give our conclusions as how to design the specific functions of the algorithm according to the utility functions to ensure the objective mentioned above. The MDRC is a new proposed algorithm based on the optimal solution of the system problem which can also ensure the objective. Our numerical simulation results give the performance comparisons between them and validate our deduction.

关键词： distributed control Resource management Telecommunication control Algorithm design and analysis Numerical simulation Convergence Student members Paper technology Optimal control distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Autonomous end to end QoS monitoring

Autonomous end to end QoS monitoring

引用

Workshop on End-to-End Monitoring Techniques and Services

作者： C. Elster D. Raz R. Wolff Computer Science Department Technion-Israel Institute of Technology Haifa Israel CSEE Department University of Maryland Baltimore County USA

Verifying that each flow in the network satisfies its QoS requirements is one of the biggest scalability challenges in the current DiffServ architecture. This task is usually performed by a centralized allocation entity that monitors the flows' QoS parameters. Efficient detection of problematic flows is even more challenging when considering aggregated information such as the end to end delay suffered by packets belonging to a specific flow. Known oblivious and reactive monitoring techniques do not scale well when the number of flows and the length of their paths increase, and when the network load increases. This is due both to load on the centralized bandwidth allocation entity and to the excessive number of monitoring and control messages needed. We propose a new monitoring paradigm termed autonomous monitoring, in which the network itself (i.e. the routers along the flow path) is responsible to discover when a violation of the SLA occurs (or is soon to occur). Only in such cases the centralized allocation entity is notified, and can take the required actions. We study the performance of this new distributed algorithm through theoretical analysis and extensive simulations. Our results indicate that in addition to dramatically reducing the load from the centralized allocation entity, the amount of network traffic needed is relatively small and thus the new monitoring scheme scales well.

关键词： Monitoring Scalability Diffserv networks Delay Channel allocation Centralized control distributed algorithms Performance analysis Algorithm design and analysis Analytical models

来源：评论

学校读者我要写书评

暂无评论

A New Profile-QoS Aware User Association Scheme for 5G Ultra-dense mmW-μW HetNets

A New Profile-QoS Aware User Association Scheme for 5G Ultra...

引用

IEEE Global Communications Conference

作者： Salma Brihi Abdellaziz Walid Jalel Ben-Othman Mohammed El Koutbi ENSIAS Mohammed V University of Rabat Morocco ENSA Ibn Zohr University Agadir Morocco Centrale SUPELEC 3 Rue Joliot Curie Gif-sur-Yvette France

ISBN: (纸本)9781538647288;9781538647271

5G Network architecture based on the ultra-dense deployment of millimeter-micro wave (mmW-μW) HetNets is a promising solution to maximize revenue and business potential of mobile network operators (MNOs). However, in the near future, MNOs are urged to manage these network architectures that will serve a large number of mobile subscribes with distinctive user profiles (Gold, Silver, Bronze or Best effort), and individual quality of service (QoS) requirements. In this paper, we provide a new user association scheme that take into consideration the profile and QoS requirements of each mobile user. Our association problem is formulated as a one-to-many matching game inspired from matching theory. Then, we propose two distributed differed acceptance algorithms executed successively to achieve two stables matching. The first one consists of assigning each gold mobile users to the most suitable mmW-μW base stations (BSs). Next, based on the first stable matching results, the second one consists of assigning each best effort user to the most suitable mmW-μW BSs without degrading the QoS of gold users. Simulation results corroborate our solution, and show its effectiveness by enhancing the average sum rate performance, while respecting the profile and QoS requirements of mobile users compared to the conventional Max-SINR and Max-RSSI association schemes.

关键词： Games Quality of service Gold Network architecture distributed algorithms Gain Quality of experience

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 484 485 486 487 488 489 490 491 492 493 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：