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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

114 篇 会议
34 篇 期刊文献

馆藏范围

148 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

69 篇 工学
- 44 篇 计算机科学与技术...
- 32 篇 软件工程
- 16 篇 控制科学与工程
- 13 篇 电气工程
- 12 篇 信息与通信工程
- 6 篇 机械工程
- 4 篇 动力工程及工程热...
- 4 篇 电子科学与技术（可...
- 2 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 2 篇 冶金工程
- 2 篇 网络空间安全
- 1 篇 力学（可授工学、理...
- 1 篇 化学工程与技术
- 1 篇 矿业工程
- 1 篇 交通运输工程
- 1 篇 航空宇航科学与技...
26 篇 理学
- 17 篇 数学
- 7 篇 系统科学
- 5 篇 化学
- 4 篇 物理学
- 4 篇 统计学（可授理学、...
- 2 篇 生物学
- 1 篇 大气科学
21 篇 管理学
- 13 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
- 5 篇 工商管理
4 篇 法学
- 2 篇 法学
- 2 篇 社会学
3 篇 经济学
- 3 篇 应用经济学

主题

22 篇 distributed comp...
20 篇 laboratories
13 篇 concurrent compu...
9 篇 computer network...
8 篇 scheduling algor...
7 篇 parallel process...
7 篇 application soft...
7 篇 processor schedu...
6 篇 grid computing
6 篇 resource managem...
6 篇 quality of servi...
5 篇 computer science
5 篇 fault tolerance
5 篇 real time system...
5 篇 linear programmi...
5 篇 multimedia syste...
5 篇 algorithm design...
5 篇 hardware
5 篇 delay
4 篇 intrusion detect...

机构

7 篇 department of el...
6 篇 national laborat...
6 篇 parallel and dis...
5 篇 distributed syst...
5 篇 department of el...
5 篇 ieee
5 篇 computer network...
5 篇 g2elab grenoble ...
4 篇 university of fl...
4 篇 center for paral...
4 篇 department of el...
3 篇 school of automa...
3 篇 distributed mult...
3 篇 parallel and dis...
3 篇 laboratory for p...
3 篇 department of el...
3 篇 research center ...
3 篇 distributed syst...
2 篇 beijing huairou ...
2 篇 faculty of engin...

作者

8 篇 arturo bretas
7 篇 v. chaudhary
6 篇 shu-ching chen
6 篇 fei-yue wang
6 篇 bharadwaj veerav...
6 篇 bretas arturo
5 篇 xiaodong wang
5 篇 mei-ling shyu
5 篇 shaohe lv
5 篇 garg vijay k.
4 篇 chen shu-ching
4 篇 sean meyn
4 篇 xingming zhou
4 篇 shyu mei-ling
4 篇 jun jason zhang
3 篇 dennis agnew
3 篇 weihua zhuang
3 篇 janise mcnair
3 篇 rajkumar buyya
3 篇 agnew dennis

语言

141 篇 英文
5 篇 其他
2 篇 中文

检索条件"机构=Parallel and Distributed Systems Laboratory Electrical and Computer Engineering Department"

共 148 条记录，以下是51-60 订阅

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

详细简洁

排序：

Validation of BDI agents

Validation of BDI agents

引用

4th International Workshop on Programming Multi-Agent systems, ProMAS 2006

作者： Sudeikat, Jan Braubach, Lars Pokahr, Alexander Lamersdorf, Winfried Renz, Wolfgang Distributed Systems and Information Systems Computer Science Department University of Hamburg Vogt-Kölln-Str. 30 22527 Hamburg Germany Multimedia Systems Laboratory Department of Information and Electrical Engineering Hamburg University of Applied Sciences Berliner Tor 7 20099 Hamburg Germany

ISBN: (纸本)9783540719557

Testing and Debugging multi-agent systems (MAS) - which are inherently concurrent and distributed - is a challenging task. While complex application scenarios demand intelligent entities with autonomous reasoning capabilities, the applied reasoning mechanisms impair current approaches to validate MAS implementations. Reactive planning systems, namely the well-known Belief Desire Intention (BDI) architecture, have been successfully applied to implement these intelligent entities by means of goal directed agents. Despite testing and debugging, used to validate whether implementations behave as intended, are crucial to serious development efforts, only minor attention has been payed to corresponding tool support and testing procedures for BDIbased MAS. In this paper, we examine how the reasoning mechanism inside agent implementations can be checked and how static analysis of agent declarations can be used to visualize and check the overall communication structure in closed MAS. We present corresponding tool support, which relies on the definition of crosscutting concerns in BDI agents and enables both approaches to the Jadex Agent Platform. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Channel resource allocation/reallocation in cellular communication and linear programming

Channel resource allocation/reallocation in cellular communi...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： R. Parra-Hernandez N. Dimopoulos Laboratory for Parallel and Intelligent Systems-LAPIS Department of Electrical and Computer Engineering University of Victoria Canada

An approach aiming to formulate the mobile network resource allocation problem is proposed here. In order to formulate the resource allocation problem, the way network resources are to be counted is defined. Then, the resource allocation problem is expressed as a multidimensional knapsack problem. The knapsack problem is relaxed and a constrained optimisation linear programming problem is obtained. A series of pseudo-utility values is obtained from the solution of the linear programming problem. The pseudo-utility values are used to establish an order by which the calls/terminals/users are to be attended by the network.

关键词： Resource management Linear programming Power control Multidimensional systems Constraint optimization Channel allocation Intelligent networks Laboratories Intelligent systems Land mobile radio cellular systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive admission control of multimedia traffic in high-speed networks

Adaptive admission control of multimedia traffic in high-spe...

引用

IEEE International Symposium on Intelligent Control (ISIC)

作者： S. Jagannathan A. Tohmaz A. Chronopoulos H.G. Cheung Embedded Systems and Networking Laboratory Department of Electrical and Computer Engineering University of Missouri Rolla MO USA Parallel and Distributed Systems Lab Department of Computer Science University of Texas-San Antonio TX USA

This paper proposes a novel real-time adaptive admission control (AAC) scheme with a desired quality of service (QoS) guarantee and high network utilization in high speed networks. The QoS is given in terms of service delay, which is defined as the time it takes for a source to get admitted into the network after it initiates its intended request, packet/cell losses, and transmission delay (time taken to complete transmission from its initiation). AAC uses the following information - the available capacity from a novel adaptive bandwidth estimation scheme, a congestion indicator derived from a congestion controller, peak cell rate estimate from new sources, along with the desired QoS metrics, and outputs an 'admit' or 'reject' decision signal to the new sources while guaranteeing QoS and network utilization. Simulation results are presented by streaming ON/OFF and video data into the network. Results show that the proposed AAC admits significantly more traffic compared to other available admission control schemes thereby guaranteeing high network utilization while maintaining the desired QoS.

关键词： Programmable control Adaptive control Admission control Communication system traffic control High-speed networks Quality of service Delay effects Propagation losses Bandwidth Streaming media

来源：评论

学校读者我要写书评

暂无评论

Virtual Frame Aggregation: Clustered Channel Access in Wireless Networks

Virtual Frame Aggregation: Clustered Channel Access in Wirel...

引用

IEEE International Conference on Communications

作者： Xuan Dong Shaohe Lv Chunsheng Zhu Rukhsana Ruby Xiaodong Wang Xingming Zhou Victor C. M. Leung National Laboratory of Parallel and Distributed Processing National University of Defense Technology Department of Electrical and Computer Engineering The University of British Columbia

ISBN: (纸本)9781467364300

Coordination among users is inevitable in wireless communication for efficient medium access. Even though the data rate of individual user increases significantly, the performance of wireless network does not grow up accordingly due to the high MAC coordination overhead. In this paper, we present VFA, namely virtual frame aggregation, to achieve high coordination efficiency by amortizing the overhead over multiple transmissions. VFA provides a novel way to construct a winner cluster and allow the winners to transmit without interruption. Specifically, in a multicarrier network, every contending node chooses a subcarrier and the nodes are ordered by the index of the chosen subcarrier. When there are some subcarriers chosen by two or more nodes, an additional slot is exploited to reorder the collided nodes. Finally, all ordered nodes form a cluster and the transmissions are issued sequentially and uninterruptedly. Simulation results show that usually two slots are enough to construct a sufficiently large winner cluster. Moreover, VFA achieves a notable throughput gain over IEEE 802.11 as high as 120% with better fairness under various scenarios.

关键词： Wireless communication Antennas Wires

来源：评论

学校读者我要写书评

暂无评论

On the resource allocation and pricing strategies in Compute Clouds using bargaining approaches

On the resource allocation and pricing strategies in Compute...

引用

IEEE International Conference on Networks

作者： Ganesh Neelakanta Iyer Bharadwaj Veeravalli Computer Networks and Distributed Systems (CNDS) Laboratory Department of Electrical and Computer Engineering National University of Singapore Singapore

In this paper, we consider addressing the resource allocation and pricing strategies in a Compute Cloud for both independent tasks and tasks from workflow schemes. Workflow scheduling of tasks is an important problem due to the fact that individual sub-tasks constituting the workflow may demand additional resources and hence may stall the entire process. We employ two axiomatic bargaining approaches (Nash Bargaining Solution (NBS) and Raiffa Bargaining Solution (RBS)) proposed in the literature to formulate the problem and derive an optimal solution for allocating virtual CPU instances in a Compute Cloud for both independent tasks and workflow tasks. We also analyze the effectiveness of our strategies via rigorous simulation experiments and we show that our strategies are adaptable to the requirements by the Cloud service providers (CSPs) in estimating the resource requirements. Further, we show that NBS ensures proportional fairness whereas RBS can handle real-time task arrivals and task dynamics. Finally we introduce the concept of asymmetric pricing scheme in which a user can specify his budget constraints and CSPs can attempt to maximize the revenue without sacrificing the performance. This asymmetric bargaining approach is an important contribution in this work which allows the CSP to choose different parameters such as deadline and/or budget requirements for deriving optimal resource allocation. The deadline based resource allocation is particularly useful for workflow-based applications which have tasks waiting for the completion of other tasks.

关键词： NIST Resource management Pricing Real time systems Equations Quality of service Games

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Scheduling of Independent Tasks in Computational Grid

Fault-Tolerant Scheduling of Independent Tasks in Computatio...

引用

International Conference on Communication systems

作者： Qin Zheng Bharadwaj Veeravalli Chen-khong Tham Computer Networks and Distributed Systems Laboratory (CNDS) Department of Electrical and Computer Engineering National University of Singapore Singapore

Primary-backup approach is a common approach used for fault tolerance wherein each task has a primary copy and a backup copy on two different processors. The backup copy can overlap with other backup copies on the same processor, as long as their corresponding primary copies are scheduled on different processors. In this paper, we consider the problem of fault-tolerant scheduling of independent tasks using primary-backup approach with backup overlapping in computational grid. A fault-tolerant scheduling algorithm is developed which minimizes replication cost for backup copy by taking into account backup overlapping in cost function. A centralized scheme and a distributed scheme are developed for the proposed algorithm and their performance are studied through simulation experiments

关键词： Fault tolerance Processor scheduling Grid computing Fault tolerant systems Cost function distributed computing Scheduling algorithm computer networks Hardware Intelligent networks

来源：评论

学校读者我要写书评

暂无评论

Resource Unaware Computing - A distributed Strategy for Divisible Load Processing on Linear Daisy Chain Networks

Resource Unaware Computing - A Distributed Strategy for Divi...

引用

IEEE International Conference on Networks

作者： Jingxi Jia Bharadwaj Veeravalli Computer Networks and Distributed Systems Laboratory (CNDS) Department of Electrical and Computer Engineering National University of Singapore Singapore

ISBN: (纸本)0780397460

In this paper we present a novel load distribution strategy for scheduling divisible loads on linear networks, when the speeds of the computing nodes and the speeds of the communication links are unknown. This practical assumption is captured in our problem formulation and we present a novel strategy, referred to as early start strategy (ESS), to generate a load distribution. Our strategy estimates the speed parameters and takes distinct advantage in utilizing a processor that responds earliest in the computation and including other fast processors in a progressive manner in phases to minimize the overall processing time. We analyze the strategy under several influencing parameters such as, load size, network size, and probe load size. We present simulation studies to validate all the theoretical findings and quantify the performance of our strategy

关键词： computer networks distributed computing Processor scheduling Electronic switching systems Probes Delay effects Laboratories Drives Distribution strategy Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Minimum dependence distance tiling of nested loops with non-uniform dependences

Minimum dependence distance tiling of nested loops with non-...

引用

International Symposium on parallel and distributed Processing (IPDPS)

作者： S. Punyamurtula V. Chaudhary Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA Wayne State University

We address the problem of partitioning nested loops with non-uniform (irregular) dependence vectors. Although many methods exist for nested loop partitioning, most of these perform poorly when parallelizing nested loops with irregular dependencies. We apply the results of classical convex theory and principles of linear programming to iteration spaces and show the correspondence between minimum dependence distance computation and iteration space tiling. The cross-iteration dependencies are analyzed by forming an Integer Dependence Convex Hull (IDCH). A simple way to compute minimum dependence distances from the dependence distance vectors of the extreme points of the IDCH is presented. Using these minimum dependence distances the iteration space can be tiled. Iterations in a tile can be executed in parallel and the tiles can be executed with proper synchronization. We demonstrate that our technique gives much better speedup and extracts more parallelism than the existing techniques.< >

关键词： Tiles distributed computing Concurrent computing Vectors Linear programming parallel processing Laboratories Sequential analysis Data analysis Data mining

来源：评论

学校读者我要写书评

暂无评论

distributed mining of partial periodic patterns in sequences

Distributed mining of partial periodic patterns in sequences

引用

作者： Hsiao, Han-Wen Tsai, Meng-Shu Tsai, Jeffrey J. P. Department of Computer Science and Information Engineering Asia University Taiwan Taiwan Institute of Information Technology Asia University Taiwan Taiwan Department of Computer Science University of Illinois Chicago United States Taichung Healthcare and Management University Department of Computer Science and Information Engineering Department of Biotechnology and Bioinformatics Department of Electrical Engineering and Computer Science University of Illinois Chicago Distributed Real-Time Intelligent Systems Laboratory

It has been an important task of discovering frequent fragments as particular patterns from large sequence databases generated from a variety of applications. In general, the patterns to be discovered may partially and asynchronously exist in sequences, and even contain gaps. In addition, it is necessary to collect the information regarding the locations and frequencies of the patterns. How to enumerate candidate patterns for evaluation without exponentially increasing the computation is another problem. In this paper, the modified periodicity transform is proposed to meet the requirements mentioned above. Also, a distributed computing framework is implemented to perform the mining task more efficiently. Both synthetic and biological sequences are utilized to examine the approach. The experimental results demonstrate the efficiency and effectiveness the system.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Music2Share - Copyright-compliant music sharing in P2P systems

Music2Share - Copyright-compliant music sharing in P2P syste...

引用

作者： Kalker, Ton Epema, Dick H. J. Hartel, Pieter H. Lagendijk, R.L. Van Steen, Maarten Philips Research Eindhoven Eindhoven 5656 AA Netherlands Technical University Eindhoven Eindhoven 5612 AZ Netherlands Parallel and Distributed Systems Group Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft 2600 GA Netherlands Distributed and Embedded Systems Group Department of Computer Science University of Twente Enschede 7500 AE Netherlands Delft University of Technology Delft 2628 CD Netherlands Department of Computer Science Vrije Universiteit Amsterdam 1081 HV Netherlands

Peer-to-peer (P2P) networks are generally considered to be free havens for pirated content, in particular with respect to music. We describe a solution for the problem of copyright infringement in P2P networks for music sharing. In particular, we propose a P2P protocol that integrates the functions of identification, tracking, and sharing of music with those of licensing, monitoring, and payment. This highly decentralized music-aware P2P protocol will allow access to large amounts of music of guaranteed quality;it merges in a natural way the policing functions for copyright protection·and an efficient music-management infrastructure for the benefit of the user. © 2004 IEEE.

关键词： Copyrights

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共15页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：