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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1961-1970 订阅

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

详细简洁

排序：

parallel spatial matching for object retrieval implemented on GPU

Parallel spatial matching for object retrieval implemented o...

引用

IEEE international conference on Multimedia and Expo (ICME)

作者： Wenying Wang Dongming Zhang Yongdong Zhang Jintao Li Xiaoguang Gu Chinese Academy and Sciences Beijing China Institute of Computing Technology Chinese Academy and Sciences Beijing China

Spatial matching for object retrieval is often time-consuming and susceptible to viewpoint changes. To address this problem, we propose a novel spatial matching method and implement it on modern GPU in parallel. Unlike previous spatial matching methods, in which the affine transformation estimation is based on the gravity vector assumption, our method abandons this strong assumption by matching the ACNs (affine covariant neighbors) of corresponding local regions and estimating affine transformation from a single pair of corresponding local regions. To speed up the process, we implement the method on modern GPU in parallel. Computations are distributed evenly to threads with load balancing, and the memory accesses are optimized and bitmap based parallel scan is exploited. Experimental results demonstrate that our method is more robust and more efficient than previous methods especially when the viewpoints are changed, and the parallel implementation on GPU obtains ten times speedup.

关键词： Graphics processing unit Transforms Instruction sets Feature extraction Shape Matrix decomposition Random access memory

来源：评论

学校读者我要写书评

暂无评论

Applying P2P Strategies to Scheduling in Decentralized Grid computing Infrastructures

Applying P2P Strategies to Scheduling in Decentralized Grid ...

引用

international conference on parallel Processing Workshops (ICPPW)

作者： Christian Grimme Joachim Lepping Jonathan Moreno Picon Alexander Papaspyrou Robotics Research Institute Section Information Technology Technical University Dortmund Dortmund Germany

In this paper, we propose a new algorithm for job interchange in Computational Grids that consist of autonomous and equitable HPC sites, called Shaking-G. Originally developed for balancing the sharing of video files in P2P networks, we conceptually transfer and adapt the algorithm to the domain of job scheduling in Grids, building an integrated, load-adaptive two-tier job exchange strategy. We evaluate the performance of Shaking-G with real workload data in different experimental scenarios and show that it outperforms traditional non-Grid aware algorithms in setups without job interchange, fostering the benefits of collaboration between large HPC centers.

关键词： Scheduling Processor scheduling Program processors Servers Runtime Measurement Schedules

来源：评论

学校读者我要写书评

暂无评论

parallel Link Rendezvous in Ad Hoc Cognitive Radio networks

Parallel Link Rendezvous in Ad Hoc Cognitive Radio Networks

引用

2010 IEEE Global Telecommunications conference GLOBECOM 2010

作者： Majid Altamimi Kshirasagar Naik Xuemin Shen Department of Electrical and Computer Engineering University of Waterloo Waterloo ONT Canada

A Cognitive Radio (CR) network seeks to access and utilize the unused license spectrum portions. These portions have dynamic behavior that introduces challenge for the CR user to allocate and rendezvous on the same portion. In CR Ad-hoc Network (CRAHN), there is difficulty of maintaining a Common Control Channel (CCC); for that, CRAHN requires a protocol able to guarantee users rendezvous without CCC. This paper proposes a distributed Medium Access Control (MAC) protocol using the concept of Balanced Incomplete Block Design (BIBD) to achieve a rendezvous channel without a CCC or synchronization. If the channels of a network are assigned to the BIBD elements and the searching sequence to the BIBD block, there is a guarantee of a rendezvous in at least one channel for each searching sequence. Simulation results confirm that the protocols outperform other protocols with respect to Time to Rendezvous (TTR), channel utilization, network throughput, and percentage of collisions between the SU and the PU network. In addition, the protocols fairly distribute the network load on channels, and share the channels fairly among network nodes.

关键词： Sensors Peer to peer computing Media Access Protocol Analytical models Ad hoc networks Synchronization

来源：评论

学校读者我要写书评

暂无评论

A framework for context-driven end-to-end QoS control in Converged networks

A framework for context-driven end-to-end QoS control in Con...

引用

international conference on Network and Service Management

作者： S. Y. Yerima G.P. Parr C. Peoples S. McCLean P. J. Morrow School of Computing and Information Engineering University of Ulster UK

This paper presents a framework for context-driven policy-based QoS control and end-to-end resource management in converged next generation networks. The Converged networks QoS Framework (CNQF) is being developed within the IU-ATC project, and comprises distributed functional entities whose instances co-ordinate the converged network infrastructure to facilitate scalable and efficient end-to-end QoS management. The CNQF design leverages aspects of TISPAN, IETF and 3GPP policy-based management architectures whilst also introducing important innovative extensions to support context-aware QoS control in converged networks. The framework architecture is presented and its functionalities and operation in specific application scenarios are described.

关键词： Quality of service Context Monitoring Resource management Next generation networking Multimedia communication Protocols

来源：评论

学校读者我要写书评

暂无评论

A hierarchical parallel algorithm of ant system and local search for TSPs

A hierarchical parallel algorithm of ant system and local se...

引用

international conference on Information Science and Engineering (ICISE)

作者： Gaifang, Dong Xueliang, Fu College of Computer and Information Engineering Inner Mongolia Agricultural University Hohhot China

ISBN: (纸本)9781424480968

Ant colony optimization algorithm is an important swarm intelligence algorithm. It has been applied to many fields of combinatorial optimization because of its parallel, distributed computing and running speed. But, ant colony optimization algorithm has some shortcomings. For example, searching process may stagnate. Local search is a good method when cooperate with other algorithms. But hybrid algorithm of local search and other methods will increase the running time. This paper devises a hierarchical parallel algorithm of ant colony optimization and local search for TSPs and computes the hierarchical parallel algorithm with 4 processors. Computation results show that the hierarchical parallel algorithm can improve the running time about 2.5 times. © 2010 IEEE.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Behaviour and Reliability Evaluation Method for Applications That Are Based on Asynchronous Processing Nodes

A Dynamic Behaviour and Reliability Evaluation Method for Ap...

引用

IEEE international conference on Software Testing Verification and Validation Workshop, ICSTW

作者： Marko Palviainen VTT Technical Research Center of Finland Espoo Finland

Many embedded and distributed applications are based on processing nodes that perform parallel processing tasks. Unfortunately, it is difficult to evaluate the overall behaviour of this kind of applications because the overall behaviour consists of 1) the execution-paths of asynchronous processing nodes and of 2) messages that either activate or deactivate processing nodes to perform parallel processing tasks. In order to facilitate behaviour and reliability evaluation of applications doing parallel processing, we developed a method that: 1) is capable of composing an overall representation for parallel behaviours and recognizing both the defined use cases and undetermined behaviours from this representation and 2) supports calculation of use case-specific reliability values for components. In this paper, we describe the method, present a ComponentBee tool that implements the method and supports behaviour and reliability evaluation of multithreaded Java applications, and finally demonstrate the use of the method with a case study.

关键词： parallel processing Application software Software measurement Java Software systems Software testing Performance evaluation Concurrent computing Predictive models

来源：评论

学校读者我要写书评

暂无评论

parallel Simultaneous Co-clustering and Learning with Map-Reduce

Parallel Simultaneous Co-clustering and Learning with Map-Re...

引用

IEEE international conference on Granular computing (GRC)

作者： Meghana Deodhar Clinton Jones Joydeep Ghosh Electrical and Computer Engineering University of Texas Austin Austin TX USA

Many data mining applications involve predictive modeling of very large, complex datasets. Such applications present a need for innovative algorithms and associated implementations that are not only effective in terms of prediction accuracy, but can also be efficiently run on distributed computational systems to yield results in reasonable time. This paper focuses on predictive modeling of multirelational data such as dyadic data with associated covariates or “side-information”. We first give illustrative examples of applications that involve such data and then describe a general framework based on Simultaneous CO-clustering And Learning (SCOAL), which applies a divide-and-conquer approach to data analysis. We show that the main elements of the SCOAL algorithm can be effectively parallelized using the Map-Reduce framework. Experiments on Amazon's EC2 demonstrate that the proposed parallelizations result in considerable improvements in run time when using a cluster of machines.

关键词： Data models Computational modeling Predictive models Clustering algorithms Motion pictures Data mining Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed concurrent downloading of common content in a BitTorrent peer group

Distributed concurrent downloading of common content in a Bi...

引用

international conference on Signal Processing and Communications, SPCOM

作者： Sukhbir Singh Piyush Gambhir R.B.I.E.B.T PEC University of Technology India

In the BitTorrent peer-to-peer file sharing protocol, it is observed that when a group of peers known to each other (due to geographical proximity or otherwise) are aiming for the same file, it is downloaded by a single peer and then shared within the group or it is downloaded individually. This is an inefficient approach as the fidelity rests on one peer or all peers (promoting redundancy), thus resulting in wastage of bandwidth and time. In this paper, we propose a solution to counter these problems by encouraging equal participation of the peer group in the download process. We show how the bandwidth of each peer is utilized to the maximum (thus reducing download time) by segregating a file into smaller sized parts with each peer downloading a part of the file in parallel and then merging the individual parts to form the complete data. We also add to the above proposition how one peer can effectively resume the interrupted download of another peer, remotely. Using simulation, we validate and demonstrate the effectiveness of the proposed strategy by taking real world examples showing large amounts of data being transferred at massive speeds and in a very short period of time.

关键词： Peer to peer computing Protocols Bandwidth Merging Local area networks Internet Scalability

来源：评论

学校读者我要写书评

暂无评论

A distributed storage system allowing application users to reserve I/O performance in advance for achieving SLA

A distributed storage system allowing application users to r...

引用

international Workshop on Grid computing

作者： Yusuke Tanimura Koie Hidetaka Tomohiro Kudoh Isao Kojima Yoshio Tanaka National Institute for Advanced Industrial Science and Technology Tsukuba Japan

Performance assurance has become an important aspect in grid and cloud computing which provide services over the Internet, and Service Level Agreements (SLA) are frequently contracted between users and the service providers. However, the I/O performance of the storage or data access service is still provided on a best effort basis. Some distributed storage systems implement performance reservation, but the reservation is implemented inside of the storage and works in an adaptive manner. In order to promise performance guarantees to users, we propose a distributed storage system allowing application users to explicitly make an advanced and time-based reservation for I/O access and storage space. Thus the requested performance is guaranteed during the reserved time. This paper describes our proposed concept and the design architecture of the storage system, including the reservation interface, resource management and I/O control frameworks. Then it explains our prototype which implements a simple resource allocation strategy and I/O control of the storage network along the design. The experiment results using the prototype are also shown. They indicate that the reservation cost entailed only a low performance impact on users, and that the requested performance was achieved by the reservation feature.

关键词： Resource management Throughput Servers Prototypes Aerospace electronics Protocols Ethernet networks

来源：评论

学校读者我要写书评

暂无评论

RAVE: Replicated antivirus engine

RAVE: Replicated antivirus engine

引用

international conference on Dependable Systems and networks Workshops (DSN-W)

作者： Carlos Silva Paulo Sousa Paulo Veríssimo Portugal Telecom Portugal Faculty of Sciences University of Lisbon Portugal

Antivirus is a fundamental presence in every computer infrastructure nowadays. The exponential growth of Internet usage with increasing higher bandwidth led to situations where virus (as well as worms and other type of malicious content) had constant outbreaks with impressive amounts of infected computers across the entire world. Email has been the preferred choice for several of these malicious content outbreaks. This paper describes the design, implementation, and evaluation of RAVE, a Replicated AntiVirus Engine for email infrastructures. Based on fault/intrusion tolerance concepts, this system allows to increase the detection capability of anti-malware solutions for email infrastructures by having different engines working in parallel, allowing at the same time arbitrary faults in a predefined number of replicas.

关键词： Search engines Computer worms Computer networks Internet Bandwidth Fault detection Telecommunication computing Testing Data security Computer viruses

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 193 194 195 196 197 198 199 200 201 202 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：