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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

608 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

341 篇 工学
- 332 篇 计算机科学与技术...
- 204 篇 软件工程
- 122 篇 信息与通信工程
- 34 篇 电气工程
- 25 篇 控制科学与工程
- 24 篇 电子科学与技术（可...
- 8 篇 动力工程及工程热...
- 8 篇 测绘科学与技术
- 7 篇 机械工程
- 7 篇 建筑学
- 6 篇 生物工程
- 5 篇 光学工程
- 5 篇 安全科学与工程
- 3 篇 力学（可授工学、理...
- 3 篇 土木工程
- 3 篇 生物医学工程（可授...
- 2 篇 仪器科学与技术
109 篇 理学
- 90 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 9 篇 物理学
- 9 篇 生物学
- 5 篇 化学
- 2 篇 大气科学
- 2 篇 地球物理学
76 篇 管理学
- 51 篇 管理科学与工程(可...
- 43 篇 工商管理
- 27 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 医学
- 4 篇 临床医学
2 篇 法学
1 篇 教育学
1 篇 农学

主题

174 篇 distributed comp...
111 篇 computer network...
100 篇 software enginee...
93 篇 artificial intel...
73 篇 concurrent compu...
55 篇 computer science
47 篇 grid computing
47 篇 distributed comp...
45 篇 peer to peer com...
39 篇 application soft...
31 篇 parallel process...
31 篇 wireless sensor ...
30 篇 network topology
29 篇 parallel process...
29 篇 delay
28 篇 costs
25 篇 algorithm design...
25 篇 large-scale syst...
24 篇 protocols
23 篇 resource managem...

机构

3 篇 department of co...
3 篇 department of co...
3 篇 school of inform...
3 篇 national laborat...
3 篇 institute of com...
3 篇 school of comput...
3 篇 school of comput...
2 篇 univ sci & techn...
2 篇 huazhong univ sc...
2 篇 department of co...
2 篇 univ adelaide sc...
2 篇 school of comput...
2 篇 univ technol syd...
2 篇 department of co...
2 篇 school of manage...
2 篇 sharif universit...
2 篇 school of comput...
2 篇 lab. com. phys. ...
2 篇 natl univ def te...
2 篇 school of comput...

作者

4 篇 xicheng lu
4 篇 aaron harwood
4 篇 nong xiao
3 篇 shietung peng
3 篇 hong chen
3 篇 rui chu
3 篇 wenhong wei
3 篇 yongxuan lai
3 篇 huanguo zhang
3 篇 engelmann christ...
3 篇 gerald kunzmann
3 篇 wenjun xiao
2 篇 nandi asoke k.
2 篇 xing-ming li
2 篇 choi k.
2 篇 ling zhang
2 篇 wu cheng
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...

语言

620 篇 英文

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

共 620 条记录，以下是601-610 订阅

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

详细简洁

排序：

e-Science in the Cloud with CARMEN

e-Science in the Cloud with CARMEN

引用

IEEE international conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Paul Watson School of Computing Science North East Regional e-Science Centre University of Newcastle UK

Summary form only given. Understanding how the brain works is a major scientific challenge which will benefit medicine, biology and computer science. It requires knowledge of how information is encoded, accessed, analysed, archived and decoded by networks of neurons. Globally, over 100,000 neuroscientists are working on this problem. However, the data that forms the basis for their work is rarely shared even though it is difficult and expensive to produce. One of the main reasons for this is that vast amounts of data are produced in a variety of formats; this is then locally described and curated. One consequence is a shortage of analysis techniques that can be applied across neuronal systems. Further, there is only a limited amount of interaction between research centres with complementary expertise. The CARMEN project (***) is addressing these challenges. It enables data sharing, integration, and analysis supported by metadata. An expandable range of services are provided to extract value from raw and transformed data. The project's approach is to design and build a generic e-science platform in the cloud. This provides functionality to neuroscientists, who access it over the web. Scientists upload the data they generate into the system (called a CAIRN) and describe it with metadata. Internally, the CAIRN is built as a set of Web Services. These include a workflow enactment service which allows scientists to analyze data by running workflows that utilise the analysis services also held in the CAIRN. Users can browse the catalogue of existing workflows to select one that is appropriate for the task they are trying to accomplish. More expert users can build their own workflows from the available services. Even more sophisticated users can create their own services to use in workflows. A novel feature of the architecture is that the services are stored in a repository in the CAIRN and scheduled on a grid as required by the execution of workflows. This p

关键词： Clouds Biology Computer science Information analysis Decoding Neurons Data mining Web services Data analysis Marine vehicles

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant solutions for a MPI compute intensive application

Fault-tolerant solutions for a MPI compute intensive applica...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： J.C. Mourino M.J. Martin P. Gonzalez R. Doallo CESGA (Supercomputing Center of Galicia) Santiago de Compostela Spain Dept. of Electronics and Systems Facultad de Informática A Coruña Spain

The running times of large-scale computational science and engineering parallel applications, executed on clusters or grid platforms, are usually longer than the mean-time-between-failures (MTBF). Hardware failures must be tolerated by the parallel applications to ensure that no all computation done is lost on machine failures. Checkpointing and rollback recovery is a very useful technique to implement fault-tolerant applications. Although extensive research has been carried out in this field, there are few available tools to help parallel programmers to enhance with fault tolerant capability their applications. This work presents two different approaches to endow with fault tolerance the MPI version of an air quality simulation. A segment-level solution has been implemented by means of the extension of a checkpointing library for sequential codes. A variable-level solution has been implemented manually in the code. The main differences between both approaches are portability, transparency-level and checkpointing overheads. Experimental results comparing both strategies on a cluster of PCs are shown in the paper

关键词： Fault tolerance Computer applications Checkpointing Concurrent computing Large-scale systems Grid computing Hardware Programming profession Libraries Personal communication networks

来源：评论

学校读者我要写书评

暂无评论

Defending P2Ps from Overlay Flooding-based DDoS

Defending P2Ps from Overlay Flooding-based DDoS

引用

international conference on parallel Processing (ICPP)

作者： Yunhao Liu Xiaomei Liu Chen Wang Li Xiao Department of Computer Science Hong Kong University of Science and Technology Kowloon Hong Kong China Department of Computer Science and Engineering Michigan State University East Lansing MI USA

A flooding-based search mechanism is often used in unstructured P2P systems. Although a flooding-based search mechanism is simple and easy to implement, it is vulnerable to overlay distributed denial-of-service (DDoS) attacks. Most previous security techniques protect networks from network-layer DDoS attacks, but cannot be applied to overlay DDoS attacks. Overlay flooding-based DDoS attacks can be more damaging in that a small number of messages are inherently propagated to consume a large amount of bandwidth and computation resources. We propose a distributed and scalable method, DD-POLICE, to detect malicious nodes in order to defend P2P systems from overlay flooding-based DDoS attacks. We show the effectiveness of DD-POLICE by comprehensive simulation studies. We believe that deploying DD-POLICE will make P2P systems more scalable and robust.

关键词： Computer crime Peer to peer computing Floods Protection Internet Computer science Bandwidth Computational modeling Robustness Monitoring

来源：评论

学校读者我要写书评

暂无评论

Difficulty-aware Hybrid Search in Peer-to-Peer networks

Difficulty-aware Hybrid Search in Peer-to-Peer Networks

引用

international conference on parallel Processing (ICPP)

作者： Hanhua Chen Hai Jin Yunhao Liu Lionel M. Ni School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China

By combining an unstructured protocol with a DHT-based global index, hybrid peer-to-peer (P2P) improves search efficiency in terms of query recall and response time. The key challenge in hybrid search is to estimate the number of peers that can answer a given query. Existing approaches assume that such a number can be directly obtained by computing item popularity. In this work, we show that such an assumption is not always valid, and previous designs cannot distinguish whether items related to a query are distributed in many peers or are in a few peers. To address this issue, we propose QRank, a difficulty-aware hybrid search, which ranks queries by weighting keywords based on term frequency. Using rank values, QRank selects proper search strategies for queries. We conduct comprehensive trace-driven simulations to evaluate this design. Results show that QRank significantly improves the search quality as well as reducing system traffic cost compared with existing approaches.

关键词： Peer to peer computing Delay Costs Floods Computer science Frequency Traffic control Bandwidth Protocols Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Scaling up Genome Similarity Search Services through Content Distribution

Scaling up Genome Similarity Search Services through Content...

引用

international conference on parallel Processing (ICPP)

作者： Chen Wang Bing Bing Zhou Albert Y. Zomaya School of Information Technologies University of Sydney Australia

As the increase of genome database size, there are increasing number of methods for detecting sequence similarity and increasing demands for genome sequence search and alignment services. It is a challenge to scale up the computer systems for serving these demands in a timely manner. This paper tackles this problem from a novel perspective, which treats the sequence search requests as content requests to both genome databases and similarity detection methods; therefore, scaling up the computer systems that serve these contents is a process of constructing content distribution network. The paper gives a decentralized method to construct content distribution network for a variety of genome sequence similarity detection services. It also gives a scheduling algorithm for efficiently using content nodes. Our simulation results show that scalability and high content node utilization can be achieved in such a system while the costs of achieving these are controllable.

关键词： Genomics Bioinformatics Databases Sequences Scalability Scheduling algorithm distributed computing Hidden Markov models Costs Storage area networks

来源：评论

学校读者我要写书评

暂无评论

Allocating Resources to parallel Query Plans in Data Grids

Allocating Resources to Parallel Query Plans in Data Grids

引用

第六届网格与协同计算国际会议(The Sixth international conference on Grid and Cooperative computing GCC 2007)

作者： Sumit Kumar Bose Srikumar Krishnamoorthy Nilesh Ranade SETLabs Infosys Technologies Limited

In this paper we present a heuristic algorithm for solving the parallel query plan scheduling problem in data grids. The algorithm exploits the binary tree structure of the query plan to determine profitable allocations. It takes care of multiple forms of parallelism while allocating resources to the subplans. Previous approaches towards solving the problem either ignores partitioned parallelism by focusing solely on pipelined parallelism wherein the communication cost is minimized or lays more emphasis on partitioned parallelism at the cost of pipelined parallelism. The work in this paper attempts to take care of both pipelining and partitioning mechanisms while optimizing the allocation of resources to the query sub-plans. The algorithm is particularly well suited for allocation of resources to sub-plans in a bushy query plan-which is the most profitable form of query plan in distributed database query optimization.

关键词： Resource management parallel processing Costs Partitioning algorithms distributed databases Processor scheduling Scheduling algorithm distributed computing Concurrent computing Computer networks

来源：评论

学校读者我要写书评

暂无评论

Pretenuring in Java by Object Lifetime and Reference Density Using Scratch-Pad Memory

Pretenuring in Java by Object Lifetime and Reference Density...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： K. F. Chong C. Y. Ho Anthony S. Fong City University of Hong Kong Hong Kong China

Java has become a popular paradigm in software development. It is widely used in embedded systems and network computing because of its excellent robustness, modularity and security. Its built-in garbage collection automatically reclaims unused memory space. Current generational garbage collector works well with programs containing massive shortlived objects. However, the existence of hot-mature (i.e. frequently-accessed and long-lived) objects inhibits object reclamation. In this paper, we present two methodologies to exploit the locality for these objects. Firstly, we employ an on-chip scratchpad memory in memory hierarchy to preserve young and hot-mature objects. This reduces energy consumption and data accessing cycles for Java execution. Secondly, we introduce a pretenuring technique to segregate objects into separated memory regions based on the object lifetimes and reference densities, which minimizes the amount of object copying during garbage collections

关键词： Java Embedded system Computer networks Embedded computing Memory management Programming Robustness Energy consumption Virtual machining Software performance

来源：评论

学校读者我要写书评

暂无评论

Dynamic Overlay networks for Image Processing Grids

Dynamic Overlay Networks for Image Processing Grids

引用

international conference on Hybrid Intelligent Systems (HIS)

作者： Andreas Dinges Bjoern Wagner Paul Mueller Fraunhofer Institut Technound Wirtschaftsmathematik Kaiserslautern Germany TU Kaiserslautern Integrated Communication Systems Group Kaiserslautern Germany

During the development and parametrization of 2D image-processing algorithms for surface inspection uses, you need to test a huge amount of image-data for each modification of the algorithms or parameters. For algorithm runtimes up to several seconds, this will take a long time. To speed up this process it is recommended to distribute the computation in a parallel computation environment. Compute Grids, which use the unused resources of existing hardware are the most cost efficient way to solve this problem. The most existing Grid-Concepts are based on flat connection structures with a scheduler on the top; for high job-rates the scheduler becomes the bottleneck of the whole system. Concepts to solve this problem organize the nodes in tree-structures to discharge the central scheduler. In heterogeneous Desktop-Grids where the different nodes are widely distributed the usually used random arrangement of the nodes in the tree-structure can be counterproductive, because the bandwidthes and latencies in a Grid can be varying. In this paper we will show a solution to arrange the nodes of the grid optimized by bandwidth and latency, using modified spanning-tree algorithms, so that the average response time is reduced and in result of this the job-throughput of the Compute-Grid is increased.

关键词： Image processing Delay Concurrent computing distributed computing Grid computing Processor scheduling Bandwidth Inspection Testing Runtime

来源：评论

学校读者我要写书评

暂无评论

Towards Location-aware Topology in both Unstructured and Structured P2P Systems

Towards Location-aware Topology in both Unstructured and Str...

引用

international conference on parallel Processing (ICPP)

作者： Tongqing Qiu Guihai Chen Mao Ye Edward Chan Ben Y. Zhao State Key Laboratory of Novel Software Nanjing University China Department of Computer Science City University of Hong Kong Hong Kong China Department of Computer Science University of California슠Santa Barbara USA

A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of underlying physical network. A well-routed message path in such systems may result in a long delay and excessive traffic due to the mismatch between logical and physical networks. In order to solve this problem, we present a family of Peer-exchange Routing Optimization Protocols (PROP) to reconstruct the overlay. It includes two policies: PROP- G for generic condition and PROP-0 for optimized one. Both theoretical analysis and simulation experiments show that these two protocols greatly reduce the average latency of the overlay and achieve a location-aware topology with low overhead. Their overall performance can be further improved if combined with other recent approaches. Specifically, PROP-G can be easily applied to both structured and unstructured systems without the loss of their primary characteristics, such as efficient routing and anonymity. PROP- O, on the other hand, is more efficient, especially in a heterogeneous environment where nodes have different processing capabilities.

关键词： Peer to peer computing Computer science Network topology Routing protocols Delay Application software Telecommunication traffic Traffic control Analytical models distributed computing

来源：评论

学校读者我要写书评

暂无评论

Performance of Internet Services over the UMTS Enhanced Uplink

Performance of Internet Services over the UMTS Enhanced Upli...

引用

international conference on Next Generation Mobile Applications, Services and Technologies (NGMAST)

作者： Andreas Mader Dirk Staehle Christian Gosswein Department of Distributed Systems Am Hubland University of Wuerzburg W??rzburg Germany University of Wuerzburg

The Enhanced Uplink or High Speed Uplink Packet Access (HSUPA) is designed to enable Internet applications in the uplink in UMTS networks. Its specification includes several new features which on the one hand increases throughput and decreases delay for the users, and on the other hand enables a better resource utilization on the network side. In this work, we explain the most prominent new features of the Enhanced Uplink and investigate their impact on the system and end-to-end performance with a special focus on different scheduling strategies. For the numerical results, a full-featured packet-level simulator has been implemented which enables the evaluation of UMTS networks with Rel. 99 users and Enhanced Uplink users in parallel.

关键词： Web and internet services 3G mobile communication Throughput Bit rate Resource management Downlink Peer to peer computing Delay Traffic control Streaming media

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：