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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

482 篇 会议
4 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

298 篇 工学
- 289 篇 计算机科学与技术...
- 165 篇 软件工程
- 94 篇 信息与通信工程
- 38 篇 电气工程
- 26 篇 电子科学与技术（可...
- 20 篇 控制科学与工程
- 12 篇 机械工程
- 9 篇 建筑学
- 7 篇 动力工程及工程热...
- 5 篇 土木工程
- 4 篇 力学（可授工学、理...
- 4 篇 测绘科学与技术
- 3 篇 光学工程
- 3 篇 化学工程与技术
- 3 篇 航空宇航科学与技...
- 3 篇 农业工程
- 3 篇 生物工程
112 篇 理学
- 96 篇 数学
- 14 篇 统计学（可授理学、...
- 12 篇 系统科学
- 9 篇 物理学
- 7 篇 生物学
- 5 篇 化学
- 3 篇 地球物理学
62 篇 管理学
- 43 篇 管理科学与工程(可...
- 38 篇 工商管理
- 21 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 3 篇 法学
5 篇 文学
- 5 篇 新闻传播学
3 篇 农学
2 篇 教育学
1 篇 医学
1 篇 军事学

主题

111 篇 distributed comp...
69 篇 computer network...
54 篇 concurrent compu...
43 篇 grid computing
38 篇 distributed comp...
37 篇 peer to peer com...
36 篇 intelligent netw...
36 篇 artificial intel...
35 篇 software enginee...
30 篇 parallel process...
30 篇 computer archite...
27 篇 application soft...
26 篇 computer science
25 篇 parallel process...
24 篇 delay
20 篇 scalability
18 篇 routing
18 篇 bandwidth
17 篇 costs
16 篇 network servers

机构

5 篇 institute of com...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 institute of com...
2 篇 department of co...
2 篇 department of in...
2 篇 school of comput...
2 篇 the leslie and s...
2 篇 school of comput...
2 篇 univ valencia ir...
2 篇 national laborat...
2 篇 graduate univers...
2 篇 college of infor...
2 篇 department of co...
2 篇 national key lab...
2 篇 seikei universit...
2 篇 department of co...
2 篇 chinese academy ...
2 篇 univ catania dep...
2 篇 china mobile com...

作者

5 篇 mikkilineni rao
4 篇 morana giovanni
3 篇 messina fabrizio
3 篇 huaikou miao
3 篇 engelmann christ...
3 篇 sungwon kang
2 篇 choi k.
2 篇 yongquan fu
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...
2 篇 dongsheng li
2 篇 guangyu shi
2 篇 shietung peng
2 篇 satoshi fujita
2 篇 hao gong
2 篇 ming-chien yang
2 篇 pawaskar sachin
2 篇 alias norma
2 篇 yijie wang

语言

488 篇 英文

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

共 488 条记录，以下是421-430 订阅

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

详细简洁

排序：

Data-bandwidth-aware Job Scheduling in Grid and Cluster Environments

Data-bandwidth-aware Job Scheduling in Grid and Cluster Envi...

引用

international conference on parallel and distributed Systems (ICPADS)

作者： De-Yu Chen Jan-Jan Wu Pangfeng Liu Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan Institute of Information Science Research Center of Information Technology Innovation Academia Sinica Nankang Taiwan Department of Computer Science and Information Engineering Graduate Institute of Networking and Multimedia National Taiwan University Taipei Taiwan

This paper introduces techniques in scheduling jobs on a master/workers platform where the bandwidth is shared by all workers. The goal is to minimize the total makespan. The jobs are independent and each job requires a fixed amount of bandwidth to download input data before execution. The master can communicate with multiple workers simultaneously, provided that the bandwidth used by the master and the workers do not exceed their bandwidth limits. We proposed two models for this limited-bandwidth problem. If the data transfer cannot be interrupted, then we prove that the scheduling problem is NP-complete. Nevertheless we propose heuristic algorithms and experimentally test their performance. If the data transfer can be interrupted, we propose an algorithm that produces optimal makespan. The algorithm is based on a binary search on the completion time, and an efficient feasibility verification process for a given completion time.

关键词： Bandwidth Processor scheduling Grid computing Job shop scheduling Wide area networks Biomedical computing Computer networks Computer science Data engineering Load modeling

来源：评论

学校读者我要写书评

暂无评论

Snooping and Ordering Ring - An Efficient Cache Coherence Protocol for Ring Connected CMP

Snooping and Ordering Ring - An Efficient Cache Coherence Pr...

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Fei Cao Zhiyong Liu Institute of Computing Technology Key Laboratory of Computer System and Architecture Chinese Academy and Sciences Beijing China

Ring is a promising on-chip interconnection for CMP. It is more scalable than bus and much simpler than packet-switched networks. The ordering property of ring can be used to optimize cache coherence protocol design. Existing ring protocols, such as the snooping ring protocol and the ring-order protocol need a retry and acknowledgement scheme or use the ordering property of the ring respectively to resolve conflict memory requests. A cache coherence protocol named SOR (Snooping and Ordering Ring) is developed for ring connected CMP in this paper. This protocol is based on the snooping ring protocol. But instead of using the acknowledgement and retry scheme, it uses the ordering property of the ring to resolve conflicts, thus can avoid unnecessary retries to improve performance and power efficiency. The L1 snooping results are sent with the requests instead of being delayed, so that many useless snoops can be avoided. Simulation result shows that the average probe slot transports and snoop operations can be reduced by SOR are 47% and 48.9%. The average and maximum performance improvements by SOR are 3.33% and 6%.

关键词： Broadcasting Bandwidth Delay Multiprocessing systems Energy consumption Access protocols Laboratories Concurrent computing distributed computing Computer architecture

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Audio Watermarking Method Based on Local Audio Feature and Support Vector Regression

An Adaptive Audio Watermarking Method Based on Local Audio F...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Hong Peng Jun Wang Weixing Wang School of Mathematics & Computer Engineering Xihua University Chengdu Sichuan China School of Electronic Engineering University of Electronic Science and Technology Chengdu Sichuan China School of Electrical Information Engineering Xihua University Chengdu Sichuan China

Based on local audio feature and support vector regression (SVR), an adaptive blind audio watermarking algorithm in wavelet domain is proposed in this paper. The audio signal is partitioned into audio frames, and the watermark is embedded in wavelet domain. For each audio frame, the energy and the maximal peaks of its all sub-bands are extracted as the local features, and SVR is used to model the relationship between the local features and the embedding strength of the audio frame in order to adaptively control the embedding strength of the audio frame. Due to the good learning ability of SVR, the watermark can be correctly extracted under several different attacks. The proposed watermarking method doesn't require the use of the original audio signal. The experimental results show the proposed algorithm is robust to signal processing, such as lossy compression (MP3), filtering, re-sampling and re-quantizing, etc.

关键词： Watermarking Support vector machines Signal processing algorithms Wavelet domain Robustness Support vector machine classification Intelligent networks distributed computing Protection Humans

来源：评论

学校读者我要写书评

暂无评论

An Analysis of Brain Waves Characteristic with Acupuncture Feedback Using MFCC

An Analysis of Brain Waves Characteristic with Acupuncture F...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing (SNPD)

作者： Tae-Gu Kwon Jeong-Hoon Shin Department of Computer Information & Communication Engineering Catholic University of Daegu Gyeongsan Gyeongbuk South Korea

Over the centuries, research about oriental medicine has been used widely to heal many patients had diseases, but has the limitations point such as it is difficult to understand a scientific basis for the effects precisely. Recently, in oriental medicine research parts have been actively to establish the scientific basis for the research centers and the demand for medical has increase more and more. Among these researches, one of oriental medicine therapy treatment, the acupuncture does not have side effect limelight by western medicine's surgery and medication. Therefore, in this paper, to solve those problems, we propose an analysis of brain waves MFCC with acupuncture feedback of meridian point. It was quantitative brain wave analysis utilized the BCI technology that it designed for the brain disease care system and analyze brain waves MFCC by acupuncture feedback of meridian point using spectrogram. The quantitative brain wave characteristic analysis utilized BCI technology can show scientific basis for oriental medicine. The brain disease care system using tactile feedback enables to select effective meridian point.

关键词： Mel frequency cepstral coefficient Diseases Medical treatment distributed computing Spectrogram Laser feedback Blood flow Software engineering Artificial intelligence Intelligent networks

来源：评论

学校读者我要写书评

暂无评论

Market-based computational task assignment within autonomous wireless sensor networks

Market-based computational task assignment within autonomous...

引用

IEEE international conference on Electro-Information Technology

作者： Andrew T. Zimmerman Jerome P. Lynch Frank T. Ferrese Department of Civil and Environmental Engineering University of Michigan Ann Arbor MI USA Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA Carderock Division Naval Surface Warfare Center Philadelphia PA USA

In recent years, improved wireless technologies have enabled the low-cost deployment of large numbers of sensors for a variety of applications across different engineering disciplines. Because of the computational resources (processing capability, storage capacity, etc.) distributed throughout these sensing networks, it is often possible to perform advanced data analysis tasks autonomously and in-network, eliminating the need for the post-processing of sensor data. With new parallel algorithms being developed for in-network computation, it has become necessary to create a framework in which the computational resources available throughout a wireless sensing network can be best utilized in the midst of competing computational requirements. In this study, a Pareto-optimal market-based method is developed in order to autonomously distribute various computational tasks with competing objectives and/or resource demands across available network resources. This method is experimentally validated on a network of wireless sensing prototypes.

关键词： Computer networks Wireless sensor networks Data processing Concurrent computing distributed computing Scalability USA Councils Data analysis parallel algorithms Sensor systems

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of DHT Algorithms for Range-Query and Multi-Attribute Resource Discovery in Grids

Performance Analysis of DHT Algorithms for Range-Query and M...

引用

international conference on parallel Processing (ICPP)

作者： Haiying Shen Cheng-Zhong Xu Department of Electrical and Computer Engineering Clemson University Clemson SC USA Department of Electrical & Computer Engineering Wayne State University Detroit MI USA

Resource discovery is critical to the usability and accessibility of grid computing systems. distributed hash table (DHT) has been applied to grid systems as a distributed mechanism for providing scalable range-query and multiattribute resource discovery. Multi-DHT-based approaches depend on multiple DHT networks with each network responsible for a single attribute. Single-DHT-based approaches keep the resource information of all attributes in a single node. Both classes of approaches lead to high overhead. Recently, we proposed a heuristic Low-Overhead Range-query Multiattribute DHT-based resource discovery approach (LORM). It relies on a single hierarchical DHT network and distributes resource information among nodes in balance by taking advantage of the hierarchical structure. We demonstrated its effectiveness and efficiency via simulation. In this paper, we analyze the performance of the LORM approach rigorously by comparing it with other multi-DHT-based and single-DHT-based approaches with respect to their overhead and efficiency. The analytical results are consistent with simulation results. The results prove the superiority of the LORM approach in theory.

关键词： Performance analysis Grid computing Peer to peer computing Concurrent computing Usability Analytical models Central Processing Unit Application software Large-scale systems parallel processing

来源：评论

学校读者我要写书评

暂无评论

A Task-Based Fault-Tolerance Mechanism to Hierarchical Master/Worker with Divisible Tasks

A Task-Based Fault-Tolerance Mechanism to Hierarchical Maste...

引用

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

作者： Zhihui Dai Fabien Viale Xuebin Chi Denis Caromel Zhonghua Lu Chinese Academy and Sciences Beijing China Institut National de Recherche en Informatique Automatique Sophia-Antipolis France Computer Network and Information Center Chinese Academy and Sciences Beijing China

The master/worker API of the ProActive middleware provides with an easy way to use framework for parallelizing embarrassingly parallel applications. However, the traditional master/worker model faces great challenges as the development of the scalability of the distributed computing. A single-layer hierarchical master/worker has been implemented as a solution to the scalability issues of the MW API. In the new framework, the mainmaster only communicates with some submasters, and each submaster manages a set of workers. A ldquobully election algorithmrdquo and an ldquoobject discovery mechanismrdquo are implemented to solve the fault-tolerance problems of the submasters. An automatic load-balancing mechanism is implemented for the hierarchical master/worker to solve divisible tasks. Moreover, an optimization has been done to make the fault-tolerance mechanism more efficient.

关键词： Fault tolerance distributed computing Scalability parallel programming High performance computing Computer networks Middleware Nominations and elections Java Libraries

来源：评论

学校读者我要写书评

暂无评论

Java based architecture for grid applications

Java based architecture for grid applications

引用

IEEE international Symposium on Virtual Environments, Human-Computer Interfaces and Measurement Systems (VECIMS)

作者： Andrea Guerriero Ciriaco C. Pasquale Francesco Ragni Politecnico di Bari Bari Italy

Environments that integrate network computer into global computing resources have been studied since the development of Internet. In order to provide a platform independent approach to high-performance network computing, several Java-based implementations have been developed. Java overcomes the issue of maintaining different binary codes, multiple execution environments, and complex architectures. It offers the basic infrastructure to integrate computers resources connected to Internet into a distributed computational resource and allows parallel applications execution on different O.S. environment. In this paper we discuss the design and implementation of a network computing prototype system based on Java technology. The proposed multi level architecture uses the Agent paradigm to manage resources and to develop a user friendly interface to share resources in the grid.

关键词： Java Computer networks Computer architecture Application software Concurrent computing distributed computing IP networks Binary codes Internet Prototypes

来源：评论

学校读者我要写书评

暂无评论

High Throughput Intra-Node MPI Communication with Open-MX

High Throughput Intra-Node MPI Communication with Open-MX

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Brice Goglin INRIA-Bordeaux-Sud-Ouest-LaBRI Talence France

The increasing number of cores per node in high-performance computing requires an efficient intra-node MPI communication subsystem. Most existing MPI implementations rely on two copies across a shared memory-mapped file. Open-MX offers a single-copy mechanism that is tightly integrated in its regular communication stack, making it transparently available to the MX backend of many MPI layers. We describe this implementation and its offloaded copy backend using I/OAT hardware. Memory pinning requirements are then discussed, and overlapped pinning is introduced to enable the start of Open-MX intra-node data transfer earlier. Performance evaluation shows that this local communication stack performs better than MPICH2 and Open-MPI for large messages, reaching up to 70% better throughput in micro-benchmarks when using I/OAT copy offload. Thanks to a single-copy being involved, the Open-MX intra-node communication throughput also does not heavily depend on cache sharing between processing cores, making these performance improvements easier to observe in real applications.

关键词： Throughput Hardware Multicore processing Delay Collaborative software Computer networks Concurrent computing distributed computing Performance evaluation Computer architecture

来源：评论

学校读者我要写书评

暂无评论

A Replica Placement Algorithm for Hybrid CDN-P2P Architecture

A Replica Placement Algorithm for Hybrid CDN-P2P Architectur...

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Hai Jiang Zhan Wang Albert K. Wong Jun Li Zhongcheng Li Chinese Academy of Sciences Beijing Beijing CN Hong Kong University of Science and Technology Hong Kong China Institute of Computing Technology Chinese Academy and Sciences Beijing China

The Hybrid CDN-P2P architecture, or HCDN, which combines the complementary advantages of CDN and P2P networks, has been proposed to reduce the deployment cost and to improve the quality of service in file sharing and video streaming applications. A replica placement algorithm (RPA) decides where to replicate the specific data. Existing RPAs for pure CDN do not work efficiently in the HCDN architecture because they do not take into consideration the contribution of the peers at the P2P distribution level. In this article, a heuristic RPA that takes into account the effects of P2P distribution is proposed for HCDN. The performance of our proposed algorithm is evaluated and the impact of some key metrics is analyzed. The experimental result shows the clear performance benefits of our approach.

关键词： Costs Delay Quality of service Web server Heuristic algorithms Internet Computer architecture Bandwidth Peer to peer computing Streaming media

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 39 40 41 42 43 44 45 46 47 48 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：