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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,393 篇 工学
- 1,180 篇 计算机科学与技术...
- 600 篇 软件工程
- 296 篇 信息与通信工程
- 175 篇 电气工程
- 101 篇 控制科学与工程
- 97 篇 电子科学与技术（可...
- 59 篇 动力工程及工程热...
- 55 篇 机械工程
- 41 篇 仪器科学与技术
- 31 篇 生物工程
- 26 篇 网络空间安全
- 25 篇 生物医学工程（可授...
- 21 篇 建筑学
- 16 篇 环境科学与工程（可...
- 16 篇 安全科学与工程
- 15 篇 光学工程
- 15 篇 土木工程
357 篇 管理学
- 290 篇 管理科学与工程(可...
- 99 篇 图书情报与档案管...
- 95 篇 工商管理
327 篇 理学
- 195 篇 数学
- 63 篇 物理学
- 63 篇 系统科学
- 44 篇 生物学
- 30 篇 统计学（可授理学、...
- 15 篇 化学
26 篇 经济学
- 26 篇 应用经济学
23 篇 法学
- 18 篇 社会学
15 篇 农学
- 14 篇 作物学
15 篇 医学
- 14 篇 临床医学
10 篇 文学
2 篇 艺术学
1 篇 军事学

主题

275 篇 peer to peer com...
237 篇 distributed comp...
203 篇 computer network...
176 篇 wireless sensor ...
132 篇 protocols
131 篇 grid computing
120 篇 cloud computing
107 篇 computational mo...
102 篇 routing
91 篇 delay
89 篇 computer archite...
88 篇 mobile computing
87 篇 servers
81 篇 algorithm design...
79 篇 ad hoc networks
78 篇 mobile communica...
77 篇 bandwidth
75 篇 concurrent compu...
75 篇 network topology
68 篇 computer science

机构

22 篇 institute of com...
16 篇 institute of com...
10 篇 national laborat...
8 篇 school of comput...
8 篇 school of comput...
8 篇 graduate univers...
8 篇 school of comput...
8 篇 school of comput...
7 篇 national laborat...
7 篇 seikei universit...
7 篇 key laboratory o...
6 篇 department of co...
6 篇 rissho universit...
6 篇 national laborat...
6 篇 chinese academy ...
5 篇 key laboratory o...
5 篇 graduate univers...
4 篇 inria
4 篇 department of ma...
4 篇 nokia research c...

作者

8 篇 kurt rothermel
7 篇 zhang desheng
7 篇 makoto takizawa
7 篇 valentin cristea
7 篇 rothermel kurt
6 篇 zomaya albert y.
6 篇 li jinbao
6 篇 ailixier aikebai...
6 篇 frank dürr
5 篇 wei liu
5 篇 tang tao
5 篇 lin yisong
5 篇 min geyong
5 篇 tomoya enokido
5 篇 jin hai
5 篇 guo longjiang
5 篇 kai xiang
5 篇 jiannong cao
4 篇 qishi wu
4 篇 zhang lei

语言

2,386 篇 英文
5 篇 中文
2 篇 其他

检索条件"任意字段=2010 International Conference on Parallel and Distributed Computing and Networks, PDCN 2010"

共 2393 条记录，以下是1981-1990 订阅

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

详细简洁

排序：

Grid Resource Discovery over distributed Routers

Grid Resource Discovery over Distributed Routers

引用

international conference on Information Science and Applications (ICISA)

作者： Taskin Kocak Daniel Lacks Department of Computer Engineering Bahcesehir University Istanbul Turkey School of Electrical Engineering and Computer Science University of Central Florida Orlando FL USA

ISBN: (纸本)9781424459421;9781424459438

Computational grids have emerged as a new paradigm for solving large complex problems over the recent years. The problem space and data set are divided into smaller pieces that are processed in parallel over the grid network and reassembled upon completion. Typically, resources are logged into a resource broker that is somewhat aware of all of the participants available on the grid. The resource broker scheme can be a bottleneck because of the amount of computational power and network bandwidth needed to maintain a fresh view of the grid. In this paper, we propose to place the load of managing the network resource discovery on to the network itself: inside of the routers. In the proposed protocol, the routers contain tables for resources similar to routing tables. These resource tables map IP addresses to the available computing resource values, which are provided through a scoring mechanism. Each resource provider is scored based on the attributes they provide such as the number of processors, processor frequency, amount of memory, hard drive space, and the network bandwidth. The resources are discovered on the grid by the protocol's discovery packets, which are encapsulated within the TCP/IP packets. The discovery packet visits the routers and look up in the resource tables until a satisfactory resource is found. The protocol is validated by simulations with five different deployment environments.

关键词： Grid computing Computer networks Bandwidth Load management Resource management Routing protocols Application software Weather forecasting Processor scheduling Computer network management

来源：评论

学校读者我要写书评

暂无评论

Keynote: HPCC with Grids and Clouds

Keynote: HPCC with Grids and Clouds

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： Geoffrey Charles Fox School of Informatics and Computing Community Grids Laboratory Indiana University Bloomington USA

Summary form only given. The paper discuss the impact of clouds and grid technology on HPCC using examples from a variety of fields especially the life sciences. It covers the impact of the growing importance of data analysis and note that it is more suitable for these modern architectures than the large simulations (particle dynamics and partial differential equation solution) that are mainstream use of large scale "massively parallel" supercomputers. The importance of grids is seen in the support of distributed data collection and archiving while clouds should replace grids for the large scale analysis of the data. It discusses the structure of applications that will run on current clouds and use either the basic "ondemand" computing paradigm or higher level frameworks based on MapReduce and its extensions. Current MapReduce implementations run well on algorithms that are a "Map" followed by a "Reduce" but perform poorly on algorithms that iterate over many such phases. Several important algorithms including parallel linear algebra fall into latter class. One can define MapReduce extensions to accommodate iterative map and reduce but these have less fault tolerance than basic MapReduce. Both clouds and exascale computing suggest research into a new generation of run times that lie between MapReduce and MPI and trade-off performance, fault-tolerance and asynchronicity. It concludes with a description of FutureGrid - a TeraGrid system for prototyping new middleware and applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Web service based information integration approach for chemical process system

Web service based information integration approach for chemi...

引用

international conference on Networking and Digital Society, ICNDS

作者： Zhihui Wu Yu Qian State Key Laboratory of Pulp & Paper Engineering South China University of Technology Guangzhou China School of Chemical and Chemical Engineering South China University of Technology Guangzhou China

ISBN: (纸本)9781424451623;9781424451616

In order to integrate chemical process operation system effectively, a web service based system information integration approach is presented in this paper. The application technologies of web service are introduced for chemical process information integration. Besides, the reality steps of information integration are introduced according to the proposed approach functions. Compared to the traditional distributed integration technology, the advances and features of the approach are discussed. A case study of a mini chemical operation platform is used to verify the practicability and validity of proposed information integration approach.

关键词： Web services Chemical processes Chemical technology distributed computing Web and internet services Electronic mail Chemical engineering Application software Computer networks Access protocols

来源：评论

学校读者我要写书评

暂无评论

Kusu Cluster computing Introduction and Deployment of Applications

Kusu Cluster Computing Introduction and Deployment of Applic...

引用

2010 international conference on Bio-inspired Systems and Signal Processing(ICBSSP 2010)

作者： Liang Zhang School of Computer Science and Software Engineering Tianjin Polytechnic University Tianjin,China Zhenkai Wan School of Computer Science and Software Engineering Tianjin Polytechnic University Tianjin,China

Cluster computing is a distributed parallel computing *** a small cloud,cluster is mainly used in high availability,reliability or high performance ***,which is the first open-source software developed by Platform computing,is a tool for the deployment of cluster *** has the advantages of operating and managing the cluster with easy,deploying cluster nodes rapidly and supporting multiple Linux operating *** paper describes the Kusu cluster concepts,benefits,structure and how to deploy nodes in details.

关键词： Kusu Cluster Cluster Deployment Linux

来源：评论

学校读者我要写书评

暂无评论

A consistency algorithm for causal and totally ordered event delivery in DVE

A consistency algorithm for causal and totally ordered event...

引用

international conference on Computer Science and Information Technology (CSIT)

作者： Hangjun Zhou Wei Zhang Yuxing Peng Sikun Li Department of Information Management Hunan College of Finance and Economics Changsha Hunan China Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha Hunan China

How to preserve causal and totally ordered event delivery is an important issue in real-time serverless DVE(distributed Virtual Environment). However, most of the related works are designed to maintain causal order merely or time stamped order with intensive computation and bandwidth overhead. In this paper, we proposed a novel distributed algorithm to maintain the before-and-after relationship between events, both causal and concurrent, of DVE at each individual node. Several simulation experiments are carried out to evaluate the performance of our algorithm and the results demonstrate that the algorithm is effective in preserving causal and totally ordered event delivery and more efficient than the previous algorithms.

关键词： Artificial neural networks Silicon Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A Weighted Sliding-Frame Strategy for distributed Location Management in Wireless Mobile networks

A Weighted Sliding-Frame Strategy for Distributed Location M...

引用

IEEE international conference on Communications (ICC)

作者： H.-C. Lin C.-Y. Ho Department of Computer Science National Tsing Hua University Hsinchu Taiwan

This paper proposes a distributed location management strategy called weighted sliding-frame strategy for wireless mobile networks in which the processing speeds of the location information databases (LIDs) are heterogeneous. In the proposed strategy, a number of consecutively numbered location information databases are arranged into a frame. A frame of location information databases overlaps with the next frame except one database. Each frame is assigned a weight which is used to distribute the location information of the mobile hosts among the frames. The number of mobile hosts whose location information are stored in a frame is proportional to the weight assigned the frame. A nonlinear convex programming problem is formulated and solved numerically in order to find the set of weights that minimize the average database response time. Our numerical results show that the proposed weighted sliding-frame strategy is able to properly distribute the location information of the mobile hosts among the frames such that the average database response time is significantly lower than that of the sliding-frame strategy proposed in our previous work.

关键词： Base stations Delay Hardware distributed databases Land mobile radio cellular systems Radio control Computer network management Mobile computing Costs Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel Subgraph Counting Using G-Tries

Efficient Parallel Subgraph Counting Using G-Tries

引用

IEEE international conference on Cluster computing

作者： Pedro Ribeiro Fernando Silva Luis Lopes CRACS & INESC-Porto LA Faculdade de Ciências Universidade do Porto Porto Portugal

Finding and counting the occurrences of a collection of subgraphs within another larger network is a computationally hard problem, closely related to graph isomorphism. The subgraph count is by itself a very powerful characterization of a network and it is crucial for other important network measurements. G-tries are a specialized data-structure designed to store and search for subgraphs. By taking advantage of subgraph common substructure, g-tries can provide considerable speedups over previously used methods. In this paper we present a parallel algorithm based precisely on g-tries that is able to efficiently find and count subgraphs. The algorithm relies on randomized receiver-initiated dynamic load balancing and is able to stop its computation at any given time, efficiently store its search position, divide what is left to compute in two halfs, and resume from where it left. We apply our algorithm to several representative real complex networks from various domains and examine its scalability. We obtain an almost linear speedup up to 128 processors, thus allowing us to reach previously unfeasible limits. We showcase the multidisciplinary potential of the algorithm by also applying it to network motif discovery.

关键词： Arrays Program processors Load management Heuristic algorithms parallel algorithms Indexes

来源：评论

学校读者我要写书评

暂无评论

chitSMS: Community Health Information Tracking System Using Short Message Service

chitSMS: Community Health Information Tracking System Using ...

引用

international conference on Human-Centric computing (HumanCom)

作者： Reynaldo Manguni Jr. Mel Leandro Navarro Kathleen Rosario Cedric Angelo Festin Networks and Distributed Systems Group Department of Computer Science University of Philippines Quezon Philippines

Community Health Information Tracking System using Short Message Service (chitSMS) is an extension of CHITS which is a system that stores health records of patients in the barangay. Another project incorporated a mobile component in CHITS, enabling the health worker to visit the patient, do routine check-ups and medical services, and update CHITS when the health worker returns to the health center. Without a remote connection, however, the health worker has to return frequently to the usually distant health center to update the CHITS database with the data gathered from the field consult. chitSMS addresses this by using SMS as a mode of remote data transfer. It ensures the reliable transmission of the data by implementing a modified selective repeat protocol. Furthermore, it performs the Deflate algorithm for compression of the data being sent to minimize the cost.

关键词： Databases Protocols Servers Mobile communication Java Receivers Synchronization

来源：评论

学校读者我要写书评

暂无评论

Blue Banana: resilience to avatar mobility in distributed MMOGs

Blue Banana: resilience to avatar mobility in distributed MM...

引用

IEEE/IFIP international conference on Dependable Systems & networks

作者： Sergey Legtchenko Sebastien Monnet Gael Thomas LIP6/UPMC/CNRSIINRIA Paris France

Massively Multiplayer Online Games (MMOGs) recently emerged as a popular class of applications with millions of users. To offer acceptable gaming experience, such applications need to render the virtual world surrounding the player with a very low latency. However, current state-of-the-art MMOGs based on peer-to-peer overlays fail to satisfy these requirements. This happens because avatar mobility implies many data exchanges through the overlay. As state-of-the-art overlays do not anticipate this mobility, the needed data is not delivered on time, which leads to transient failures at the application level. To solve this problem, we propose Blue Banana, a mechanism that models and predicts avatar movement, allowing the overlay to adapt itself by anticipation to the MMOG needs. Our evaluation is based on large-scale traces derived from Second life. It shows that our anticipation mechanism decreases by 20% the number of transient failures with only a network overhead of 2%.

关键词： Resilience Avatars Peer to peer computing Information retrieval Delay Large-scale systems Second Life Degradation Online Communities/Technical Collaboration Scalability

来源：评论

学校读者我要写书评

暂无评论

Improving cluster computing performance based on job futurity prediction

Improving cluster computing performance based on job futurit...

引用

international conference on Advanced Computer Theory and Engineering, ICACTE

作者： Hossein Salami Hamid Saadatfar Farhad Rahmani Fard S. Kazem Shekofteh Hossein Deldari Parallel and Distributed Processing Laboratory Engineering Department Ferdowsi University of Mashhad Mashhad Iran

By recognizing the necessity for preventative and proactive management for today's large scale and fault prone distributed systems, a tendency for these mechanisms has been appeared in recent researchers' efforts. From the birth point of this opinion, event prediction has been known as an effective approach to manage errors preventively. In this work, we attempt to make system performance better by using a job futurity predictor as an advisor for system scheduler. We have a clear sighted vision of failure sources and therefore use a comprehensive data set of system, user and job domains. Using predictor results leads to a significant improvement in performance metrics.

关键词： Computational modeling Measurement Middleware

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 195 196 197 198 199 200 201 202 203 204 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：