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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,748 篇 会议
29 册 图书
27 篇 期刊文献

馆藏范围

1,804 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,390 篇 工学
- 1,274 篇 计算机科学与技术...
- 598 篇 软件工程
- 238 篇 信息与通信工程
- 218 篇 电气工程
- 87 篇 控制科学与工程
- 53 篇 电子科学与技术（可...
- 44 篇 机械工程
- 41 篇 生物工程
- 33 篇 动力工程及工程热...
- 26 篇 石油与天然气工程
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 17 篇 生物医学工程（可授...
- 17 篇 网络空间安全
- 15 篇 材料科学与工程（可...
- 15 篇 测绘科学与技术
- 14 篇 力学（可授工学、理...
- 14 篇 安全科学与工程
307 篇 理学
- 202 篇 数学
- 48 篇 生物学
- 41 篇 物理学
- 39 篇 系统科学
- 30 篇 统计学（可授理学、...
- 25 篇 化学
198 篇 管理学
- 130 篇 管理科学与工程(可...
- 77 篇 图书情报与档案管...
- 57 篇 工商管理
72 篇 医学
- 64 篇 临床医学
16 篇 法学
15 篇 经济学
- 15 篇 应用经济学
15 篇 教育学
6 篇 农学
3 篇 文学
2 篇 军事学

主题

105 篇 distributed comp...
102 篇 distributed comp...
74 篇 parallel process...
60 篇 cloud computing
44 篇 computational mo...
44 篇 parallel computi...
38 篇 grid computing
38 篇 distributed data...
37 篇 parallel program...
36 篇 parallel algorit...
33 篇 computer archite...
31 篇 big data
31 篇 parallel process...
28 篇 application soft...
26 篇 fault tolerance
26 篇 machine learning
25 篇 resource managem...
24 篇 scalability
24 篇 middleware
23 篇 concurrent compu...

机构

9 篇 laboratory of in...
8 篇 zhejiang univ co...
7 篇 plekhanov russia...
7 篇 chinese acad sci...
7 篇 science and tech...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 department of in...
5 篇 shanghai jiao to...
4 篇 college of compu...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 school of inform...
4 篇 univ otago dept ...
3 篇 huazhong univ sc...
3 篇 fuyang rongda co...
3 篇 key laboratory o...
3 篇 department of co...
3 篇 university of el...
3 篇 school of comput...

作者

13 篇 zomaya albert y.
11 篇 shen hong
8 篇 todorov venelin
8 篇 rothermel kurt
7 篇 li kuan-ching
6 篇 leymann frank
6 篇 li y
6 篇 liu jie
6 篇 kopp oliver
5 篇 dimov ivan
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 gankevich ivan
5 篇 albert y. zomaya
5 篇 breitenbuecher u...
5 篇 yang chao-tung
4 篇 li kenli
4 篇 blochinger wolfg...
4 篇 liu yang
4 篇 leung k.

语言

1,765 篇 英文
21 篇 其他
13 篇 中文
10 篇 俄文

检索条件"任意字段=8th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1804 条记录，以下是931-940 订阅

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

详细简洁

排序：

Exploring non-typical memcache architectures for decreased latency and distributed network usage

Exploring non-typical memcache architectures for decreased l...

引用

8th international conference on Web Information Systems and technologies, WEBIST 2012

作者： Talaga, Paul G. Chapin, Steve J. Syracuse University Syracuse NY United States

ISBN: (纸本)9789898565082

Memcache is a distributed in-memory data store designed to reduce database load for web applications by caching frequently used data across multiple machines. In a distributed web serving environment applications rely on many network services to complete each request. While faster processors have lowered computation time and available network bandwidth has increased, signal propagation delay is a constant and will become a larger proportion of latency in the future. We explore how data-locality with Memcache can be exploited to reduce latency and minimize core network traffic. A model is developed to predict how alternate Memcache configurations would perform for specific applications followed by an evaluation using the MediaWiki open-source web application in a miniature web farm setting. Our results verified our model and we observed a 66% reduction in core network traffic and a 23% reduction in Memcache response time under certain network conditions.

关键词： Caching Latency Memcache Network utilization Web-farm

来源：评论

学校读者我要写书评

暂无评论

MEDI-ADAPT: A distributed architecture for personalized access to heterogeneous semi-structured data

MEDI-ADAPT: A distributed architecture for personalized acce...

引用

8th international conference on Web Information Systems and technologies, WEBIST 2012

作者： Rebaï, Rim Zghal Zayani, Amel Corinne Ammous, Ikram Hamadou, Abdel Majid Ben Institute Multimedia Information Systems and Advanced Computing Laboratory Higher Institute of Computer and Multimedia PO Box 242 Sakiet Ezzit 3021 Sfax Tunisia

ISBN: (纸本)9789898565082

the increased volume of data in digital form has led to a wide variety of syntactic and semantic data. thus, the user may encounter several problems related to the heterogeneity, distribution and volume of returned information. As a matter of fact, systems are needed to solve part or all of these problems. In this paper we propose and illustrate a distributed architecture that enables personalized access to collections of heterogeneous and distributed semi-structured documents (XML, RDF, SMIL). this architecture is based on an extension on the reference architecture of mediation systems DARPA I3 by adding an adaptation layer, based on the reference architecture for adaptive hypermedia systems AHA!, that takes into account the user's request, his context (profile, device, network, etc.) and data sources context (minimum bandwidth, necessary characteristics of the device to display data, etc.).

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

CoNEXT 2012 - Proceedings of the 2012 ACM conference on Emerging Networking Experiments and technologies

CoNEXT 2012 - Proceedings of the 2012 ACM Conference on Emer...

引用

8th ACM international conference on Emerging Networking EXperiments and technologies, CoNEXT 2012

ISBN: (纸本)9781450317757

the proceedings contain 31 papers. the topics discussed include: architecting for edge diversity: supporting rich services over an unbundled transport;tuning ECN for data center networks;Datacast: a scalable and efficient reliable group data delivery service for data centers;VALE, a switched Ethernet for virtual machines;modeling complexity of enterprise routing design;improving fairness, efficiency, and stability in HTTP-based adaptive video streaming with FESTIVE;towards agile and smooth video adaptation in dynamic HTTP streaming;orchestrating massively distributed CDNs;dealer: application-aware request splitting for interactive cloud applications;energy consumption anatomy of 802.11 devices and its implication on modeling and design;computing while charging: building a distributed computing infrastructure using smartphones;and Weeble: enabling low-power nodes to coexist with high-power nodes in white space networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cray Cascade: a Scalable HPC System based on a Dragonfly Network

Cray Cascade: a Scalable HPC System based on a Dragonfly Net...

引用

25th ACM/IEEE international conference for High Performance computing, Networking, Storage and Analysis (SC)

作者： Faanes, Greg Bataineh, Abdulla Roweth, Duncan Court, Tom Froese, Edwin Alverson, Bob Johnson, Tim Kopnick, Joe Higgins, Mike Reinhard, James Cray Inc Chippewa Falls WI 54729 USA

ISBN: (纸本)9781467308052;9781467308045

Higher global bandwidth requirement for many applications and lower network cost have motivated the use of the Dragonfly network topology for high performance computing systems. In this paper we present the architecture of the Cray Cascade system, a distributed memory system based on the Dragonfly [1] network topology. We describe the structure of the system, its Dragonfly network and the routing algorithms. We describe a set of advanced features supporting both mainstream high performance computing applications and emerging global address space programing models. We present a combination of performance results from prototype systems and simulation data for large systems. We demonstrate the value of the Dragonfly topology and the benefits obtained through extensive use of adaptive routing.

关键词： Interconnect technologies parallel and scalable system architectures performance evaluation and measurement of real systems

来源：评论

学校读者我要写书评

暂无评论

Decision Making as Optimization in Multi-robot Teams

Decision Making as Optimization in Multi-robot Teams

引用

8th international conference on distributed computing and Internet technologies (ICDCIT 2012)

作者： Parker, Lynne E. Univ Tennessee Knoxville TN 37996 USA

ISBN: (纸本)9783642280726;9783642280733

A key challenge in multi-robot teaming research is determining how to properly enable robots to make decisions on actions they should take to contribute to the overall system objective. this article discusses how many forms of decision making in multi-robot teams can be formulated as optimization problems. In particular, we examine the common multi-robot capabilities of task allocation, path planning, formation generation, and target tracking/observation, showing how each can be represented as optimization problems. Of course, globally optimal solutions to such formulations are not possible, as it is well-known that such problems are intractable. However, many researchers have successfully built solutions that are approximations to the global problems, which work well in practice. While we do not argue that all decision making in multi-robot systems should be based on optimization formulations, it is instructive to study when this technique is appropriate. Future development of new approximation algorithms to well-known global optimization problems can therefore have an important positive impact for many applications in multi-robot systems.

关键词： distributed robots multi-robot systems decision making

来源：评论

学校读者我要写书评

暂无评论

distributed computing and Internet Technology - 8th international conference, ICDCIT 2012, Proceedings

Distributed Computing and Internet Technology - 8th Internat...

引用

8th international conference on distributed computing and Internet technologies, ICDCIT 2012

ISBN: (纸本)9783642280726

the proceedings contain 32 papers. the topics discussed include: usable mobile security;knowledge as a window into distributed coordination;decision making as optimization in multi-robot teams;an improved scheme for false data filtering in wireless sensor networks;anonymity and security in mobile ad hoc networks;circle formation by asynchronous fat robots with limited visibility;Nash equilibrium in weighted concurrent timed games with reachability objectives;parallelization of pagerank on multicore processors;an algebra of social distance;detecting flaws in dynamic hierarchical key management schemes using specification animation;strong minimum energy minimum interference topology in wireless sensor networks;distributed processing and internet technology to solve challenges of primary healthcare in India;and packet forwarding strategies for cooperation enforcement in mobile ad hoc wireless networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

High Concurrency for Continuously Evolving OODBMS

High Concurrency for Continuously Evolving OODBMS

引用

8th international conference on distributed computing and Internet technologies (ICDCIT 2012)

作者： Geetha, V. Sreenath, N. Pondicherry Engn Coll Dept Informat Technol Dept Comp Sci & Engg Pondicherry 605014 India

ISBN: (纸本)9783642280726;9783642280733

OODBMS is widely favored for mapping domains like CAD, with complex representation requirements. the transactions accessing OODBMS can be categorized into runtime transactions and design time transactions. Runtime transactions are meant for accessing data and design time transactions are meant for accessing schema. parallel execution of transactions is supported to promote concurrency and throughput. In continuously evolving business domains, frequent schema changes are done to reflect the changes of business domain. then it implies that more number of design time transactions arrive parallely with runtime transactions. Concurrency control schemes are employed to maintain the consistency of the database. Several semantic multi-granular lock based concurrency control schemes have been proposed in the literature. they have the drawback of either poor performance or hid maintenance overhead when applied to continuously evolving domains. this paper proposes semantic lock-based concurrency control mechanism with better performance and nil maintenance overhead for continuously evolving OODBMS. It uses lock rippling to improve the performance.

关键词： distributed object oriented databases continuously evolving domains concurrency control multi granular lock model

来源：评论

学校读者我要写书评

暂无评论

Power-efficient algorithms for Fourier analysis over random wireless sensor network

Power-efficient algorithms for Fourier analysis over random ...

引用

8th IEEE international conference on distributed computing in Sensor Systems (DCOSS)/IWSN/WiSARN/PWSN

作者： Xu, Xi Ansari, Rashid Khokhar, Ashfaq Univ Illinois Dept Elect & Comp Engn Chicago IL 60607 USA

ISBN: (纸本)9780769547077

Reduced execution time and increased power efficiency are important objectives in the distributed execution of collaborative signal processing tasks over wireless sensor networks. the power-efficient implementation of the Fourier transform computation is an exemplar of distributed data communication and processing task widely used in the signal processing field. Past work has presented some energy-efficient in-network Fourier transform computation algorithms devised only for uniformly sampled one-dimensional (1D) sensor data. However the circumstance that sensors are randomly distributed over a 2D plane may be more practical, therefore the conventional two-dimensional Fast Fourier Transform (2D FFT) defined for data sampled on uniform grids is not directly applicable in such environments. We address this problem by designing a distributed hybrid structure consisting of local Nonequispaced Discrete Fourier Transform (NDFT) and global FFT computation. Firstly, NDFT method is applied in a suitable choice of clusters to get the initial uniform Fourier coefficients with allowable estimation error bounds. We experiment with classical linear as well as generalized interpolation methods to compute NDFT coefficients within each cluster. A separable 2D FFT is then performed over all these clusters by employing our proposed energy-efficient 1D FFT computation that reduces communication costs using a novel bit index mapping strategy for data exchanges between sensors. the proposed techniques are implemented in a SIDnet-SWANS platform to investigate the communication costs, execution time, and energy consumption. Our results show reduced execution time and improved energy consumption when compared with existing work.

关键词： Nonequispaced FFT distributed Computation Power Efficient Algorithm Wireless Sensor Network

来源：评论

学校读者我要写书评

暂无评论

Power-aware Joint Sensor Selection and Routing for distributed Estimation: a Convex Optimization Approach

Power-aware Joint Sensor Selection and Routing for Distribut...

引用

8th IEEE international conference on distributed computing in Sensor Systems (DCOSS)/IWSN/WiSARN/PWSN

作者： Shah, Santosh Beferull-Lozano, Baltasar Univ Valencia Grp Informat & Commun Syst Inst Robot & Tecnol Informac & Comunicac Paterna 46980 Valencia Spain

ISBN: (纸本)9780769547077

this paper considers the problem of power-efficient distributed estimation of vector parameters related to localized phenomena so that both the subset of sensor selection and the routing structure in a wireless sensor network are optimized jointly in order to obtain the best possible estimation performance at a given querying node, for a given total power budget. We first formulate our problem as an optimization problem and show that it is NP-Hard. then, we design two algorithms: a fixed-tree relaxation-based and a novel and very efficient local distributed optimization to optimize jointly the sensor selection and the routing structure. We also provide a lower bound for our optimization problem and show that our local distributed optimization algorithm provides a performance that is close to this bound. Although there is no guarantee that the gap between this lower bound and the optimal solution of the main problem is always small, our numerical experiments support that this gap is actually very small in many cases. An important result from our work is that because of the interplay between the communication cost over the links and the gains in estimation accuracy obtained by choosing certain sensors, the traditional shortest-path-tree routing structure, widely used in practice, is no longer optimal, that is, our routing structures provide a better trade-off between the overall power efficiency and the final estimation accuracy obtained at the querying node. Comparing to more conventional sensor selection and fixed routing algorithms, our proposed joint sensor selection and routing algorithms yield a significant amount of energy saving.

关键词： Network routing Sensors energy capacity Routing algorithms dynamic efficiency Distribute Convex function

来源：评论

学校读者我要写书评

暂无评论

In-Network Iterative distributed Estimation for Power-constrained Wireless Sensor Networks

In-Network Iterative Distributed Estimation for Power-constr...

引用

8th IEEE international conference on distributed computing in Sensor Systems (DCOSS)/IWSN/WiSARN/PWSN

作者： Shah, Santosh Beferull-Lozano, Baltasar Univ Valencia Grp Informat & Commun Syst Inst Robot & Tecnol Informac & Comunicac Paterna 46980 Valencia Spain

ISBN: (纸本)9780769547077

In this paper, we consider the problem of power-efficient distributed estimation of a localized event in the large-scale Wireless Sensor Networks (WSNs). In order to increase the power efficiency in these networks, we develop a joint optimization problem that involves both selecting a subset of active sensors and the routing structure so that the quality of estimation at a given querying node is the best possible subject to a total imposed communication cost. We first formulate our problem as an optimization problem and show that it is NP-Hard. then, we design two algorithms: a fixed-tree relaxation-based and a novel and very efficient iterative distributed to optimize jointly the sensor selection and the routing structure. We also provide a lower bound for our optimization problem and show that our iterative distributed algorithm provides a performance that is close to this bound. Although there is no guarantee that the gap between this lower bound and the optimal solution of the main problem is always small, our numerical experiments support that this gap is actually very small in many cases. An important result from our work is the fact that because of the interplay between communication cost and gain in estimation when fusing measurements from different sensors, the traditional Shortest Path Tree (SPT) routing structure, widely used in practice, is no longer optimal, that is, our routing structures provide a better trade-off between the overall communication cost and estimation accuracy. Comparing to more conventional sensor selection and fixed routing algorithms, our proposed joint sensor selection and routing algorithms yield a significant amount of energy saving.

关键词： energy capacity Routing algorithms Network routing Sensors Iterative dynamic efficiency Distribute

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共181页 << < 90 91 92 93 94 95 96 97 98 99 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：