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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

7,022 篇 会议
92 篇 期刊文献
52 册 图书

馆藏范围

7,166 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,954 篇 工学
- 3,402 篇 计算机科学与技术...
- 1,562 篇 信息与通信工程
- 1,421 篇 软件工程
- 1,051 篇 电气工程
- 241 篇 控制科学与工程
- 123 篇 电子科学与技术（可...
- 91 篇 网络空间安全
- 76 篇 动力工程及工程热...
- 74 篇 仪器科学与技术
- 64 篇 生物工程
- 52 篇 机械工程
- 35 篇 安全科学与工程
- 34 篇 建筑学
- 34 篇 土木工程
- 33 篇 测绘科学与技术
- 31 篇 生物医学工程（可授...
- 30 篇 交通运输工程
560 篇 管理学
- 412 篇 管理科学与工程(可...
- 186 篇 图书情报与档案管...
- 141 篇 工商管理
517 篇 理学
- 314 篇 数学
- 94 篇 物理学
- 73 篇 生物学
- 71 篇 系统科学
- 66 篇 统计学（可授理学、...
100 篇 法学
- 52 篇 社会学
- 49 篇 法学
63 篇 医学
- 37 篇 基础医学(可授医学...
- 31 篇 公共卫生与预防医...
42 篇 经济学
- 41 篇 应用经济学
26 篇 文学
23 篇 教育学
12 篇 农学
6 篇 军事学
2 篇 艺术学

主题

1,159 篇 distributed comp...
419 篇 software enginee...
363 篇 cloud computing
361 篇 artificial intel...
312 篇 computer archite...
306 篇 computer network...
274 篇 social networkin...
270 篇 protocols
247 篇 computer science
232 篇 computational mo...
221 篇 wireless sensor ...
210 篇 scalability
205 篇 peer to peer com...
204 篇 resource managem...
195 篇 routing
190 篇 bandwidth
189 篇 servers
188 篇 application soft...
181 篇 distributed data...
166 篇 grid computing

机构

110 篇 beijing univ pos...
88 篇 state key labora...
12 篇 department of co...
11 篇 college of compu...
10 篇 tsinghua univers...
10 篇 poznan supercomp...
10 篇 school of comput...
10 篇 department of co...
10 篇 beijing universi...
9 篇 inria
9 篇 beijing universi...
9 篇 research institu...
9 篇 rissho universit...
9 篇 tsinghua univ pe...
9 篇 institute of net...
9 篇 school of cyber ...
9 篇 institute of com...
8 篇 georgia inst tec...
8 篇 department of co...
8 篇 institute of net...

作者

25 篇 yang yang
16 篇 huang lican
16 篇 lican huang
14 篇 wehrle klaus
13 篇 gao zhipeng
12 篇 dustdar schahram
12 篇 buyya rajkumar
12 篇 rothermel kurt
11 篇 duerr frank
11 篇 wu jan-jan
11 篇 rajkumar buyya
11 篇 wang wei
11 篇 liu pangfeng
11 篇 teruhisa hochin
11 篇 qi qi
10 篇 ming chen
10 篇 hoefler torsten
10 篇 m. takizawa
10 篇 cheng shiduan
10 篇 schahram dustdar

语言

7,087 篇 英文
47 篇 中文
35 篇 其他

检索条件"任意字段=International Conference on Networking and Distributed Computing"

共 7166 条记录，以下是4661-4670 订阅

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

详细简洁

排序：

Adapting distributed real-time and embedded pub/sub middleware for cloud computing environments 10

Adapting distributed real-time and embedded pub/sub middlewa...

引用

Proceedings of the ACM/IFIP/USENIX 11th international conference on Middleware

作者： Joe Hoffert Douglas C. Schmidt Aniruddha Gokhale Vanderbilt University VU Nashville TN

ISBN: (纸本)9783642169540

Enterprise distributed real-time and embedded (DRE) publish/subscribe (pub/sub) systems manage resources and data that are vital to users. Cloud computing---where computing resources are provisioned elastically and leased as a service---is an increasingly popular deployment paradigm. Enterprise DRE pub/sub systems can leverage cloud computing provisioning services to execute needed functionality when on-site computing resources are not available. Although cloud computing provides flexible on-demand computing and networking resources, enterprise DRE pub/sub systems often cannot accurately characterize their behavior a priori for the variety of resource configurations cloud computing supplies (e.g., CPU and network bandwidth), which makes it hard for DRE systems to leverage conventional cloud computing *** paper provides two contributions to the study of how autonomic configuration of DRE pub/sub middleware can provision and use on-demand cloud resources effectively. We first describe how supervised machine learning can configure DRE pub/sub middleware services and transport protocols autonomically to support end-to-end quality-of-service (QoS) requirements based on cloud computing resources. We then present results that empirically validate how computing and networking resources affect enterprise DRE pub/sub system QoS. These results show how supervised machine learning can configure DRE pub/sub middleware adaptively in < 10 μsec with bounded time complexity to support key QoS reliability and latency requirements.

关键词： cloud computing autonomic configuration pub/sub middleware DRE systems

来源：评论

学校读者我要写书评

暂无评论

A semi-distributed localization protocol for wireless sensor and actor networks

A semi-distributed localization protocol for wireless sensor...

引用

IEEE Annual conference on Pervasive computing and Communications Workshops (PerCom)

作者： Giacomo Ghidini Cristina M. Pinotti Sajal K. Das Center of Research in Wireless Mobility and Networking Department of Computer Science and Engineering University of Technology Arlington USA Department of Computer Science and Mathematics University of Perugia Italy

We consider a wireless sensor and actor network (WSAN) consisting of a large number of tiny, low-cost sensors uniformly and independently distributed in a two-dimensional geographical region around a few powerful entities, called actors. To save energy, the sensors operate according to sleep/awake schedules in an asynchronous manner. In this setting, we propose a semi-distributed, actor-centric localization algorithm which organizes the sensors in the vicinity of each actor by means of a discrete polar coordinate system. Specifically, each sensor is localized when it acquires the corona and sector coordinates of the region it resides in. To accomplish the localization task, each actor first trains a subset of sensors in its vicinity, which in turn train their neighbors. By modeling the deployed sensors as a two-dimensional Poisson point process and applying well-known results from the Coupon Collector's problem and Chernoff bounds, we derive bounds on the sensor density required to localize with high probability all sensors in the actor's vicinity. Finally, we verify the analytical bounds with results from our simulation experiments.

关键词： Wireless sensor networks Wireless application protocol Scheduling Computer science Hardware Power engineering and energy Mathematics Sensor systems Corona Analytical models

来源：评论

学校读者我要写书评

暂无评论

Resource Provisioning for Enriched Services in Cloud Environment

Resource Provisioning for Enriched Services in Cloud Environ...

引用

IEEE international conference on Cloud computing Technology and Science (CloudCom)

作者： Rosy Aoun Elias A. Doumith Maurice Gagnaire Networks and Computer Science Department Institut TELECOM-TELECOM ParisTech-LTCI-UMR 5141 CNRS Paris France

Cloud services are based on the provisioning of computing, storage, and networking resources in order to satisfy requests generated by remote end-users. High speed Internet access and multi-core Virtual Machines (VMs) enable today the provisioning of diversified and enriched types of services in Cloud environment. In this paper, we consider several types of basic services and show how their orchestration may lead to the provisioning of more sophisticated services. For this purpose, we define four types of requests that cover the wide spectrum of possible services. We then formulate the resource provisioning problem as a Mixed Integer Linear Program (MILP). We assume that the underlying infrastructure is based on a set of end-to-end connections with guaranteed sustainable bandwidth such as Carrier-Grade Ethernet (CGE) circuits. We investigate the impact of two innovative services on resource allocation carried out by a Cloud Service Provider (CSP). These services correspond to distributed data storage and to multicast data transfer. For the former service, we consider the possibility of splitting a storage request onto different remote storage nodes. The latter service aims to distribute a same data sequence from one server towards multiple remote nodes assuming a limited number of network nodes have multicast capacities. These two innovative services provide a gain of 7% in terms of accepted requests when applied to the 18-node NSFnet backbone network.

关键词： Bandwidth Cloud computing Tunneling magnetoresistance distributed databases Argon Equations Software

来源：评论

学校读者我要写书评

暂无评论

Sky computing: When Multiple Clouds Become One 10

Sky Computing: When Multiple Clouds Become One

引用

IEEE/ACM international Symposium on Cluster computing and the Grid (CCGRID)

作者： José A.B. Fortes NSF Center of Autonomic Computing University of Florida Gainesville USA

ISBN: (纸本)9780769540399

Summary form only given. The growing number of announced commercial and scientific clouds strongly suggests that in the near future these providers will be differentiated according to the types of their services, their cost, availability and quality. Users will be able to use these and other criteria to determine which clouds best suit their needs, a plausible scenario being the case when users need to aggregate capabilities provided by different clouds. In such scenarios it will be essential to provide virtual networking technologies that enable providers to support cross-cloud communication and users to deploy cross-cloud applications. This talk will describe one such technology, its salient features and remaining challenges. It will also put forward the idea of virtual clouds, i.e. providers of computing services overlaid on more than one cloud. A virtual cloud spans across multiple cloud providers and presents the view of a single logical cloud. Virtual clouds would enable high-level computing services to be provided by third parties who do not own physical resources, could be short or long-lived and highly dynamic. Enabling technologies, challenges and examples of sky computing will be presented.

关键词： Cloud computing distributed computing Grid computing Concurrent computing USA Councils Costs Availability Aggregates Physics computing Biographies

来源：评论

学校读者我要写书评

暂无评论

Dynamic Composition of Services in Sensor Networks

Dynamic Composition of Services in Sensor Networks

引用

IEEE international conference on Services computing (SCC)

作者： Sahin Cem Geyik Boleslaw K. Szymanski Petros Zerfos Dinesh Verma Department of Computer Science Rensselaer Polytechnic Institute Troy NY USA Wireless Networking Laboratory IBM Thomas J. Watson Research Center Hawthorne NY USA

Service modeling and composition is a fundamental method for offering advanced functionality by combining a set of primitive services provided by the system. Unlike in the case of web services for which there is an abundance of reliable resources, in sensor networks, the resources are constrained and communication among nodes is error-prone and unreliable. Such a dynamic environment requires a continuous adaptation of the composition of services. In this paper, we first propose a graph-based model of sensor services that maps to the operational model of sensor networks and is amenable to analysis. Based on this model, we formulate the process of sensor service composition as a cost-optimization problem, which is NP-complete. We then propose two heuristic methods for its solution, the top-down and the bottom-up, and discuss their centralized and distributed implementations. Using simulations, we evaluate their performance.

关键词： Heuristic algorithms Adaptation model Reliability Algorithm design and analysis Analytical models Network topology Data models

来源：评论

学校读者我要写书评

暂无评论

Efficient Data Delivery in Wireless Sensor Networks with Ubiquitous Mobile Data Collectors

Efficient Data Delivery in Wireless Sensor Networks with Ubi...

引用

IEEE/IFIP international conference on Embedded and Ubiquitous computing, EUC

作者： Weiwei Jiao Long Cheng Min Chen Canfeng Chen Jian Ma State Key Laboratory of Networking & Switching Tech Beijing University of Posts and Telecommunications China Computer Science and Engineering Seoul National University Seoul South Korea Nokia Research Center Beijing China

Usually, sensor data needs to be disseminated from the source sensors to data collectors (e.g., sink nodes), making those spatially distributed sensor data available for applications to access. The widespread and ubiquitous nature of mobile devices, e.g., PDAs and cell phones around the world, makes them attractive to be used as mobile data collectors (MDCs) to collect and deliver the sensor data. The goal of this work is to design a dissemination protocol that leads to efficient data delivery from the source sensors to ubiquitous MDCs. We propose the Wait-Focus-Spray (WFS) scheme for wireless sensor networks with ubiquitous MDCs. The main objective of WFS is to balance the data delivery latency and transmission overhead when considering the existence of ubiquitous MDCs. In WFS, we also propose a corresponding mechanism-probabilistic scattered binary spraying (PSBS), to reduce the spatial redundancy when spraying data copies, which can increase the probability of meeting a MDC. Through extensive simulations, we demonstrate that our WFS scheme reduces the transmission cost per message while provides comparable delivery delay compared with the existing work.

关键词： Spraying Wireless sensor networks Mobile handsets Mobile communication Robot sensing systems Energy consumption distributed databases

来源：评论

学校读者我要写书评

暂无评论

DFLS: A new distributed and fault tolerant location service method for mobile ad hoc networks

DFLS: A new distributed and fault tolerant location service ...

引用

international conference on Advanced Communication Technology (ICACT)

作者： Nader Ebrahimpour Masoud Sabaei Manouchehr Zadahmad Jaafarloo Islamic Azad University Bonab Iran Faculty of Computer Department of Computer Industrial Amir Kabir University Tehran Iran Department of Computer Islamic Azad University Ilkhchi Iran

ISBN: (纸本)9781424454273;9788955191455

Location-based routing intends to send packets toward geographic direction of destination. For this, source nodes needs to known about destination position via a location service. Whereas the main concept of ad hoc networking is being independent from an infrastructure, applying a distribution algorithm has been a key design principle for a location service. Destruction of single nodes shouldn't lead to disruption of location service. Moreover, scalability is a desirable characteristic for large networks. So, we offered a distributed and fault tolerant location service method (DFLS) for ad hoc networks in this paper. This method is a hierarchical and explicit Quorum-based location service method. In this method, location servers in each cluster have abstract information about other clusters. So, this method will have response time similar to flat methods. But, it is similar to hierarchical methods in terms of implementation complexity. Evaluation show that this method (DFLS), compared to the previous methods, decreased the response time to location queries and control overheads, also it increased fault tolerance and packet delivery rate.

关键词： Fault tolerance Mobile ad hoc networks Routing Network servers Scalability Delay Computer networks distributed computing Optical computing Computer industry

来源：评论

学校读者我要写书评

暂无评论

On Achieving Maximum Secure Throughput Using Network Coding Against Wiretap Attack

On Achieving Maximum Secure Throughput Using Network Coding ...

引用

IEEE international conference on distributed computing Systems

作者： Xiangmao Chang Jin Wang Jianping Wang Victor Lee Kejie Lu Yixian Yang Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Department of Computer Science University of Science and Technology of China Department of Computer Science City University of Hong Kong Department of Electrical and Computer Engineering University of Puerto Rico at Mayaguez

ISBN: (纸本)9781424472611;9780769540597

In recent years network coding has attracted significant attention in telecommunication. The benefits of network coding to a communication network include the increased throughput as well as secure data transmission. The purpose of this work is to design secure linear network coding against wiretap attack. The problem is to maximize the transmission data rate of multiple unicast streams between a pair of source and destination nodes, under the condition of satisfying the weakly secure requirements. Different from most existing research on network coding that designs the network coding scheme based on a given network topology, we will consider the integrated network topology design and network coding design. Such an integrated approach has not been reported by other researchers. In this paper, we formally introduce the problem, prove the problem is computational intractable, and then develop efficient heuristic algorithms. We first try to find the transmission topology that is suitable for network coding. Based on the topology, we design linear network coding scheme that is weakly secure. We conduct simulations to show that the proposed algorithms can achieve good performance.

关键词： Network coding Network topology Data transfer rates Secure networks(communications) topology labeling scheme Heuristic algorithms Linear networks Hierarchical Network coding(HNC) data transmission

来源：评论

学校读者我要写书评

暂无评论

distributed Storage Allocation for High Reliability

Distributed Storage Allocation for High Reliability

引用

IEEE international conference on Communications (ICC)

作者： D. Leong A. G. Dimakis T. Ho Department of Electrical Engineering California Institute of Technology Pasadena CA USA Department of Electrical Engineering University of Southern California Los Angeles CA USA

We consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of storage nodes; it is allowed to store any amount of data in each storage node, subject to a given total storage budget constraint. A data collector subsequently attempts to recover the original data object by accessing a random fixed-size subset of these storage nodes. Successful recovery of the data object occurs when the total amount of coded data in this subset of storage nodes is at least the size of the original data object. The goal is to determine the amount of data to store in each storage node so that the probability of successful recovery is maximized. We solve this problem in the high recovery probability regime. Our results can be applied to a variety of distributed storage systems, including delay tolerant networks (DTNs), content delivery networks (CDNs), and sensor networks.

关键词： Peer to peer computing USA Councils Paper technology Disruption tolerant networking Communications Society Delay systems Sensor systems Bandwidth Mirrors Subcontracting

来源：评论

学校读者我要写书评

暂无评论

An Implementation and Its Evaluation of a Framework for Managing States of Nodes among Structured Overlay Networks

An Implementation and Its Evaluation of a Framework for Mana...

引用

international conference on networking and Services (ICNS)

作者： Kimihiro Mizutani Satoshi Matsuura Shinichi Doi Kazutoshi Fujikawa Hideki Sunahara Graduate School of Information Science Nara Institute of Science and Technology Japan National Institute of Information and Communications Technology Japan Graduate School of Information Science Osaka University Japan Graduate School of Media Design Keio University Japan

ISBN: (纸本)9781424459278

Structured overlay networks are widely used as platforms for distributed systems. However, in a high churn situation, it is highly costly to maintain the structure and service availability of an overlay network because there is a limitation in churn handling. Several cooperation mechanisms among overlay networks are proposed to improve service availability of overlay networks in a high-churn situation. Several cooperation mechanisms are proposed among overlay networks. The cooperation mechanisms can group structured overlay networks to simplify routing functions. However, the existing mechanisms do not consider managing churn information among overlay networks. In this paper, we propose a new framework that can share states of the nodes and spread churn information to neighbor nodes among different overlay networks. Using our framework, we are able to maintain each overlay network effectively and improve the reachability of messages under churn. We evaluate our framework with Chord, Kademlia, and Pastry. Our framework improves the detection time of churn by about 30% and decreases the stabilization messages by about 30-40%. We discuss combinatorial effects of the sharing state of the nodes among different overlay networks.

关键词： Peer to peer computing Availability Information science Routing Information management Telecommunication traffic Protocols Intrusion detection conference management Technology management

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 463 464 465 466 467 468 469 470 471 472 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：