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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,698 篇 会议
32 篇 期刊文献
25 册 图书

馆藏范围

2,755 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,681 篇 工学
- 1,476 篇 计算机科学与技术...
- 671 篇 软件工程
- 489 篇 信息与通信工程
- 354 篇 电气工程
- 93 篇 控制科学与工程
- 82 篇 网络空间安全
- 65 篇 生物工程
- 56 篇 电子科学与技术（可...
- 42 篇 动力工程及工程热...
- 39 篇 仪器科学与技术
- 33 篇 机械工程
- 28 篇 建筑学
- 26 篇 交通运输工程
- 26 篇 安全科学与工程
- 25 篇 环境科学与工程（可...
- 24 篇 光学工程
- 20 篇 生物医学工程（可授...
- 17 篇 材料科学与工程（可...
322 篇 理学
- 191 篇 数学
- 67 篇 生物学
- 46 篇 系统科学
- 45 篇 统计学（可授理学、...
- 44 篇 物理学
216 篇 管理学
- 143 篇 管理科学与工程(可...
- 85 篇 图书情报与档案管...
- 73 篇 工商管理
50 篇 法学
- 34 篇 社会学
28 篇 医学
- 21 篇 临床医学
- 17 篇 基础医学(可授医学...
23 篇 经济学
- 20 篇 应用经济学
14 篇 教育学
11 篇 农学
6 篇 文学
3 篇 军事学
2 篇 艺术学

主题

285 篇 distributed comp...
267 篇 cloud computing
135 篇 social networkin...
103 篇 computer archite...
93 篇 protocols
91 篇 computer network...
88 篇 computer science
87 篇 peer to peer com...
82 篇 computational mo...
75 篇 security
69 篇 mobile computing
66 篇 routing
66 篇 servers
61 篇 resource managem...
60 篇 peer-to-peer com...
59 篇 internet of thin...
59 篇 grid computing
57 篇 application soft...
56 篇 quality of servi...
51 篇 software enginee...

机构

29 篇 daffodil interna...
21 篇 beijing univ pos...
13 篇 state key labora...
12 篇 daffodil interna...
10 篇 daffodil interna...
10 篇 shandong provinc...
8 篇 institute of com...
8 篇 school of inform...
5 篇 shenyang institu...
5 篇 tokyo denki univ...
5 篇 rissho universit...
5 篇 department of co...
4 篇 univ chinese aca...
4 篇 nokia research c...
4 篇 beijing univ pos...
4 篇 center for compu...
4 篇 university of ch...
4 篇 hosei univ
4 篇 department of co...
4 篇 department of co...

作者

12 篇 abujar sheikh
12 篇 hossain syed akh...
12 篇 sheikh abujar
11 篇 syed akhter hoss...
8 篇 masum abu kaisar...
8 篇 abu kaisar moham...
7 篇 wehrle klaus
7 篇 dustdar schahram
7 篇 kao odej
7 篇 buyya rajkumar
6 篇 m. takizawa
6 篇 yang yang
6 篇 t. enokido
6 篇 wang ying
6 篇 rothermel kurt
5 篇 wu budan
5 篇 wirtz hanno
5 篇 truong hong-linh
5 篇 ramachandran k.i...
5 篇 bhuiyan md. rafi...

语言

2,731 篇 英文
17 篇 其他
5 篇 中文
2 篇 法文

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

共 2755 条记录，以下是2481-2490 订阅

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

详细简洁

排序：

Minimizing Energy via Loop Scheduling and DVS for Multi-Core Embedded Systems

Minimizing Energy via Loop Scheduling and DVS for Multi-Core...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Ying Chen Zili Shao Q. Zhuge Chun Xue Bin Xiao E.H.-M. Sha Department of CSET Shanghai Jiaotong University Shanghai China Department of CS University of Texas Dallas Richardson TX USA Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China

Low energy consumptions are extremely important in real-time embedded systems, and scheduling is one of the techniques used to obtain lower energy consumptions. In this paper, we propose loop scheduling algorithms for minimizing energy based on rotation scheduling and DVS (dynamic voltage and frequency scaling) for real-time multi-core embedded systems. the experimental results show that our algorithms have better performances than list scheduling and pure ILP (integer linear programming) scheduling with DVS

关键词： Voltage control Embedded system Processor scheduling Energy consumption Scheduling algorithm Real time systems Dynamic voltage scaling Signal processing algorithms Delay threshold voltage

来源：评论

学校读者我要写书评

暂无评论

Consistency management for partial replication in a high performance database cluster

Consistency management for partial replication in a high per...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： C. Coulon E. Pacitti P. Valduriez INRIA and LINA University of Nantes France

In a database cluster, preventive replication can provide strong consistency without the limitations of synchronous replication. However, the original proposal (E. Pacitti et al., 2003) assumes full replication and has performance limitations. In this paper, we address these two limitations in order to scale up to large cluster configurations. Our first contribution is a refreshment algorithm that reduces the delay introduced by the algorithm and prevents inconsistencies for partially replicated databases. Our second contribution is an optimization that improves transaction throughput. We describe the implementation of our algorithm in our RepDB* prototype over a cluster of 64 nodes running PostgreSQL. Our experimental results using the TPC-C benchmark show that our algorithm has excellent scale up and speed up.

关键词： Clustering algorithms Transaction databases Delay effects Proposals throughput Prototypes Database systems Application specific processors Concurrent computing Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Byzantine agreement protocol using hierarchical groups

Byzantine agreement protocol using hierarchical groups

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： H. Yoshino N. Hayashibara T. Enokido Tokyo Denki University Rissho University

Peer-to-peer (P2P) systems are composed of large number and various types of peer processes interconnected in networks. Peers may not only stop by fault but also be arbitrarily faulty by attacks like hacking. We have to discuss how to make a system tolerant of Byzantine faults of processes. Byzantine agreement protocols imply large communication overhead. In order to reduce the overhead, we consider a hierarchical group composed of subgroups. Each subgroup shares at least one of correct processes named gateway ones with other subgroups. Even if a leader process of a subgroup is faulty, all the correct processes can make an agreement on the correct value in a whole group because correct gateway processes forward correct values to the subgroup. We evaluate the protocol compared with traditional protocols in terms of number of messages and rounds.

关键词： Protocols Peer to peer computing Computer crime Fault detection

来源：评论

学校读者我要写书评

暂无评论

Towards Autonomic Management of NASA Missions

Towards Autonomic Management of NASA Missions

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： C.A. Rouff M.G. Hinchey J.L. Rash W.F. Truszkowski R. Sterritt SAIC Advanced Concepts B. U. McLean VA USA NASA Goddard Space Flight Center Greenbelt MD USA School of Computing University of Ulster Northern Ireland

Increasingly, NASA relies on autonomous systems concepts, not only in the mission control centers on the ground, but also on spacecraft and on rovers and other assets on extraterrestrial bodies to achieve the full range of advanced mission objectives. While autonomy cost-effectively supports mission goals, autonomicity supports survivability of remote missions, especially when human tending is not feasible. Analysis of two prototype NASA agent-based systems and of a proposed mission involving numerous cooperating spacecraft illustrates how autonomous and autonomic system concepts may be brought to bear on future space missions

关键词： NASA Humans Space vehicles Space missions Control systems Automatic control Satellites Costs Lighting control Software prototyping

来源：评论

学校读者我要写书评

暂无评论

GBR: Grid Based Random Key Predistribution for Wireless Sensor Network

GBR: Grid Based Random Key Predistribution for Wireless Sens...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： M.G. Sadi Dong Seong Kim Jong Sou Park Computer Engineering Department Hankuk Aviation University South Korea

Resource constraints of sensor nodes make infeasible to use traditional key management techniques such as public key cryptography for security service of distributed sensor network. Pairwise key establishment is one of the efficient ways to achieve security service. To alleviate the study of novel pairwise key predistribution techniques, this paper presents an efficient framework for establishing pairwise keys based on polynomial key pre-distribution adopting the idea of random key predistribution scheme and grid based scheme. We named our scheme as grid based random (GBR) scheme. the concept and analysis of this scheme explains its better improved resilience to node capture than the existing schemes along with a very high probability to establish pairwise keys between nodes in an efficient way

关键词： Wireless sensor networks Polynomials Public key cryptography Computer networks distributed computing Computer network management Resource management Engineering management Computer security Resilience

来源：评论

学校读者我要写书评

暂无评论

Dynamic dispersion framework for router load balancing

Dynamic dispersion framework for router load balancing

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Yunhuai Liu L.M. Ni Department of Computer Science Hong Kong University of Science and Technology Kowloon China

Load balancing is a key technology to achieve high performance as well as high reliability. Most of traditional approaches are based on a critical assumption that the service qualities of channels are already known. With such information, they attempted to preventively disperse workloads to attain fairness and therefore high efficiency. However, in practice, such information is difficult to obtain, especially when dispersion is performed at high-level layers. In this paper, we propose a novel scheme Dynamic dispersion frAMework (DAM), to adoptively disperse the traffic. Based on collected statistics, DAM dynamically adjusts the dispersion strategy to achieve fairness in terms of real capabilities of channels. Our experimental results show that DAM provides an accurate dispersion strategy compared with an offline optimal solution. the other advantage of DAM is that it is transparent to both the user and the server.

关键词： Load management Bandwidth Internet Availability Home computing Joining processes Delay Computer science Statistics Web server

来源：评论

学校读者我要写书评

暂无评论

Modeling e-marketplaces with multi-agents Web services

Modeling e-marketplaces with multi-agents Web services

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Yinsheng Li Kuo-Ming Chao M. Younas Ying Huang Xiaohua Lu Software School Fudan University Shanghai China School of Mathematical and Information Sciences Coventry University Coventry UK School of Computing Oxford Brookes University Oxford UK T.J. Watson Research Center IBM Yorktown Heights NY USA

this paper proposes a multi-agent Web Services framework for e-marketplaces in which templates are defined as generic processes so as to enable seamless integration and collaboration amongst services within and across e-marketplaces. the proposed framework is based on a novel generic trading model of e-marketplaces. the significance of the proposed framework is to facilitate interactions with e-marketplaces. the framework is implemented using multi-agent and Web service technologies. the evaluation is performed through a case study of auction-supported mutual fund e-marketplace.

关键词： Web services Collaboration Consumer electronics Manufacturing Collaborative software Business Protocols Aerodynamics Software agents Environmental economics

来源：评论

学校读者我要写书评

暂无评论

POERS: a performance-oriented energy reduction scheduling technique for a high-performance MPSoC architecture

POERS: a performance-oriented energy reduction scheduling te...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Slo-Li Chu Department of Information and Computer Engineering Chung Yuan Christian University Chungli Taiwan

Continuous improvements in semiconductor technology are supporting new classes of multi-processor system-on-a-chip (MPSoC) architectures that combine extensive processing logic with high-density memory. Such architectures are generally colled processor-in-memory (PIM) or intelligent memory (I-RAM) and can support high-performance computing by reducing the performance gap between the processor and the memory. the PIM architecture combines various processors in a single chip. these processors are characterized by their computation, memory-access, and power consumption capabilities. therefore, a novel parallelizing system, SAGE II, has be developed to identify their capabilities and dispatch the most appropriate jobs to them in order to exploit the advantages of PIM architectures. this paper provides a new low-power transformation mechanism, called performance-oriented energy reduction scheduling (POERS), to extend the capability of SAGE II system. It can reduce the energy consumption for the processor-in-memory system without losing execution performance. the detailed POERS transformation technique is presented later. the experimental results of several benchmarks are also discussed.

关键词： Computer architecture Processor scheduling Random access memory Energy consumption High performance computing System-on-a-chip Logic Memory architecture Delay Embedded computing

来源：评论

学校读者我要写书评

暂无评论

An optimized algorithm of high spatial-temporal efficiency for Megablast

An optimized algorithm of high spatial-temporal efficiency f...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Guangming Tan Lin Xu Yishan Jiao Shengzhong Feng Dongbo Bu Ninghui Sun Graduate School of Chinese Academy of Sciences Institute of Computing Technology Chinese Academy of Sciences Institute of Computing Technology Chinese Academy and Sciences

BLAST (basic local alignment search tool), as a heuristic algorithm, is one of the most widely used sequence similarity search tools. MegaBlast, as an improved version of BLAST, speeds up the searches and improves the total throughput owing to greedy algorithm and batch processing. However, MegaBlast consumes a great deal of memory, which is proportional to the product of the size of the query file and database file. this paper proposes an optimized MegaBlast algorithm based on MegaBlast. the new algorithm exchanges the query and subject sequences, and builds a hash table based on new subject sequences. the optimized algorithm overlaps I/O with computation, further decreases the overall time and the cost of memory, which is only proportional to the size of the database file. the optimized algorithm is suitable to be parallelized on cluster systems. As our experiments shown, the parallel program, which is implemented with MPI, achieves high speedup.

关键词： Databases Greedy algorithms Heuristic algorithms throughput Clustering algorithms Parallel algorithms Sun Computers Cost function Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Interoperability and Multimedia Archives

Interoperability and Multimedia Archives

引用

international conference on Multimedia Modeling (MMM)

作者： D. Kambur D. Becarevic M. Roantree Interoperable Systems Group University of Dublin Dublin Ireland

In distributed computing systems, it is unwise to move data to the point of program code, but instead process data at the point of storage. this concept is even more appropriate to multimedia repositories where large files must be processed as a result of each retrieval operation. Two problems with multimedia databases are that they require a large volume of disk storage and processing power and that it is generally difficult to query video content or optimise the retrieval process. In the EGTV project, both of these issues are addressed. In the first case, the data server is distributed across multiple autonomous sites where users are permitted to modify schemas and in some cases the data model. In the second case, a mechanism for storing behaviour has been devised which allows functions such as retrieve_frame, retrieve_segment and retrieve_context to be implemented and stored at individual servers. this provides selective retrieval and thus, large data items can be processed locally to filter unwanted data before the transfer process must begin. In this way, storage of operations forms the basis for optimisation of retrieval content and volumes.

关键词： Multimedia databases Object oriented modeling Streaming media Information retrieval Software libraries Content based retrieval Multimedia systems distributed computing Data models Filters

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共276页 << < 245 246 247 248 249 250 251 252 253 254 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：