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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Automatic Realignment of Data Structures to Improve MPI Performance

Automatic Realignment of Data Structures to Improve MPI Perf...

引用

international conference on Networking (ICN)

作者： Benjamin Perry Martin Swany University of Delaware Newark DE USA

ISBN: (纸本)9781424460830

Programs that use the Message Passing Interface (MPI) standard to communicate with other processes often use MPI data structures that are modeled after native data structures. In some cases, a subset of the fields in the native data structure do not need to be transmitted. Users will sometimes explicitly omit those fields in the MPI data structure but align the MPI data structure to match the logical layout of the native data structure, leaving gaps in alignment for the missing fields. Because the data is non-contiguous, time is spent analyzing where the data needs to be placed rather than simply sending the received data into an appropriate buffer byte for byte upon data packing. We present a compile-time transformation that recognizes this scenario within Single Program Multiple Data programs; our transformation reorders the fields of the native data structure by placing the non-transmitted fields after the transmitted fields and adjusting the user's logical layout of the MPI data structure accordingly. This transformation makes the transmitted data contiguous, which eliminates both the need to copy data during packing and the need to carefully analyze where to place the data once it has been transmitted. This transformation significantly improves data packing in many performance environments.

关键词： Data structures Payloads Runtime Message passing Communication standards Java Data analysis Program processors Optimizing compilers distributed computing

来源：评论

学校读者我要写书评

暂无评论

Link Selection for Point-to-Point 60GHz networks

Link Selection for Point-to-Point 60GHz Networks

引用

IEEE international conference on Communications (ICC)

作者： C. Yiu S. Singh Department of Computer Science Portland State University Portland OR USA

60GHz is well-suited for device-to-device communication and for general in-home applications due to its huge available bandwidth. However, links at this frequency are easily degraded by environmental conditions. Indeed, the poor multipath makes it necessary to maintain good LoS (Line of Sight) paths between communicating pairs of nodes. In this paper we analyze the problem of link breakage and degradation in point-to-point 60GHz networks. We propose using repeaters to provide alternate paths between communicating nodes when the direct path degrades. The decision on which path to use is driven by the goal of maximizing data rate per connection as well as overall throughput in the network. Using extensive simulations we show that by carefully using repeaters, we can maintain Gbps rates for each pair of communicating nodes in indoor spaces. We develop an efficient distributed algorithm for allocating repeaters to links as needed and explicitly deal with the problem of interference caused by the repeaters themselves. Finally, we study the scalability of the solution with increasing numbers of communicating pairs and show that Gbps rates can be maintained even when there are as many as eight communicating pairs in a small 10m×10m room.

关键词： Repeaters Degradation Interference Peer to peer computing Displays Cameras Computer science Bandwidth Throughput Indoor environments

来源：评论

学校读者我要写书评

暂无评论

Designing Power-Aware Collective Communication Algorithms for InfiniBand Clusters

Designing Power-Aware Collective Communication Algorithms fo...

引用

international conference on parallel Processing (ICPP)

作者： Krishna Kandalla Emilio P. Mancini Sayantan Sur Dhabaleswar K. Panda Department of Computer Science and Engineering Ohio State Uinversity USA

Modern supercomputing systems have witnessed a phenomenal growth in the recent history owing to the advent of multi-core architectures and high speed networks. However, the operational and maintenance costs of these systems have also grown rapidly. Several concepts such as Dynamic Voltage and Frequency Scaling (DVFS) and CPU Throttling have been proposed to conserve the power consumed by the compute nodes during idle periods. However, it is necessary to design software stacks in a power-aware manner to minimize the amount of power drawn by the system during the execution of applications. It is also critical to minimize the performance overheads associated with power-aware algorithms, as the benefits of saving power could be lost if the application runs for a longer time. Modern multi-core architectures such as the Intel “Nehalem” allow for DVFS and CPU throttling operations to be performed with little overheads. In this paper, we explore how these features can be leveraged to design algorithms to deliver fine-grained power savings during the communication phases of parallel applications. We also propose a theoretical model to analyze the power consumption characteristics of communication operations. We use microbenchmarks and application benchmarks such as NAS and CPMD to measure the performance of our proposed algorithms and to demonstrate the potential for saving power with 32 and 64 processes. We observe about 8% improvement in the overall energy consumed by these applications with little performance overheads.

关键词： Algorithm design and analysis Computer architecture Sockets Analytical models Lead Peer to peer computing Power demand

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis and Evaluation of Botnet Command and Control Models

Comparative Analysis and Evaluation of Botnet Command and Co...

引用

international conference on Advanced Information Networking and Applications (AINA)

作者： Pavan Roy Marupally Vamsi Paruchuri Department of Computer Science University of Central Arkansas Conway USA

ISBN: (纸本)9781424466955;9780769540184

Global Internet threats have undergone a profound transformation from attacks designed solely to disable infrastructure to those that also target people and organizations. At the center of many of these attacks are collections of compromised computers, or Botnets, remotely controlled by the attackers, and whose members are located in homes, schools, businesses, and governments around the world. This paper provides a brief look at how existing botnet research, the evolution and future of botnets, as well as a comparative analysis of the various bot communication methods and investigate their associated benefits and weaknesses. We propose a contemporary Multi Server Cnc topology in which only bots with static global IP addresses are eligible as candidates for being in the peer list. This design ensures that the peer list in each bot has long life time making it geographically optimized.

关键词： Command and control systems Protocols Internet distributed computing Computer science USA Councils IP networks Network topology Relays Information security

来源：评论

学校读者我要写书评

暂无评论

An Optimal Server Selection Algorithm for P2P IPTV over Fiber to the Node (FTTN) networks

An Optimal Server Selection Algorithm for P2P IPTV over Fibe...

引用

IEEE international conference on Communications (ICC)

作者： S. C. Han Y. Xia Department of Computer Engineering Myongji University Seoul South Korea Department of Computer and Information Science and Engineering University of Florida Gainesville FL USA

In this paper, we investigate the issue of server selection for P2P IPTV system on fiber to the node networks. To achieve high performance and resilience to failures, a peer can make connections with multiple peers simultaneously and receive different portions of the data in parallel. Prior work mostly focuses on user-centric performance objectives, such as reducing the round-trip time or the completion time of individual download, but tend to ignore the congestion caused by the concurrent connections or the network load balance. The latter performance concerns are important for the network operators who provide and manage IPTV services. In this paper, we consider two performance metrics, the worst-case link stress (WLS) and the degree of interference (DOI), and present a server selection scheme that generates the optimal server set with respect to the WLS criterion. Through experiments on PlanetLab, we show that the proposed scheme has the advantages over the random scheme and the closest scheme in the following aspects. First, it minimizes the level of congestion at the bottleneck link. Second, it consumes less network resources in terms of the total bandwidth usage. Third, the network load is well balanced.

关键词： Network servers IPTV Peer to peer computing Optical fiber cables Computer networks Measurement Bandwidth Video on demand Service oriented architecture Optical fiber devices

来源：评论

学校读者我要写书评

暂无评论

Cluster-based replication for P2P-based video-on-demand service

Cluster-based replication for P2P-based video-on-demand serv...

引用

international conference on Electronics And Information Engineering (ICEIE)

作者： Chien-Peng Ho Suh-Yin Lee Jen-Yu Yu Department of Computer Science National Chiao Tung University Hsinchu Taiwan Information and Communication Research Laboratories Industrial Technology and Research Institute Hsinchu Taiwan

This paper discusses how to apply a clustering technique for a video-on-demand (VoD) service to optimize the media-data replication strategies over unstructured peer-to-peer (P2P) overlay networks. In particular, the failure recovery of high popularity video can be accomplished with distributing high quality impact and popular replicas to the regions of low peers density or discontinuous area. The simulation results demonstrate that replicas of the popular and high video-distortion data are more significant and reflect the physical demands than those of uniformly distributed replication scheme for media-resource sharing P2P applications. In addition, the workload of VoD server can be reduced, and the averaged visual quality can be improved in the overall system.

关键词： Streaming media Peer to peer computing Media Video recording Multimedia communication Availability

来源：评论

学校读者我要写书评

暂无评论

distributed, Scalable Clustering for Detecting Halos in Terascale Astronomy Datasets

Distributed, Scalable Clustering for Detecting Halos in Tera...

引用

IEEE international conference on Data Mining Workshops (ICDM Workshops)

作者： Srivatsava Daruru Sankari Dhandapani Gunjan Gupta Ilian Iliev Weijia Xu Paul Navratil Nena Marin Joydeep Ghosh Department of Computer Sciences University of Texas Austin Austin USA Department of Electrical and Computer Engineering University of Texas Austin Austin USA Department of Electrical and Computer Engineering University of Technology Austin USA Department of Physics and Astronomy University of Sussex Brighton UK Texas Advanced Computing Center University of Texas Austin Austin USA Innovations Laboratory Pervasive Software Austin USA

Terascale astronomical datasets have the potential to provide unprecedented insights into the origins of our universe. However, automated techniques for determining regions of interest are a must if domain experts are to cope with the intractable amounts of simulation data. This paper addresses the important problem of locating and tracking high density regions in space that generally correspond to halos and sub-halos and host galaxies. A density based, mode following clustering method called Automated Hierarchical Density Shaving (Auto-HDS) is adapted for this application. Auto-HDS can detect clusters of different densities while discarding the vast majority of background data. Two alternative parallel implementations of the algorithm, based respectively on the dataflow computational model and on Hadoop/ MapReduce functional programming constructs, are realized and compared. Based on runtime performance, scalability across compute cores and across increasing data volumes, we demonstrate the benefits of fine grain parallelism. The proposed distributed and multithreaded AutoHDS clustering algorithm is shown to produce high quality clusters, be computationally efficient, and scalable from 1 through 1024 compute-cores.

关键词： Clustering algorithms parallel processing Data models Computational modeling Algorithm design and analysis Heuristic algorithms Astronomy

来源：评论

学校读者我要写书评

暂无评论

Framework for Simulation of Quantized Virtual Society Based on Semantic P2P Network

Framework for Simulation of Quantized Virtual Society Based ...

引用

The Third international Joint conference on Computational Science and Optimization(第三届计算科学与优化国际大会 CSO 2010)

作者： Lican Huang Institute of Networking & Distributed Computing Zhejiang Sci-Tech University HangZhou P.R.China 310018

This paper presents a semantic P2P framework for simulation of quantized virtual society. The quantized virtual society is the virtual society in which things are quantized and the actions to be taken are chosen by scores among the candidate actions. The virtual social persons, which simulate human's actions and responses by computer algorithms, join virtual organizations as similar as real organizations. The nodes which host virtual social persons construct n-tuple overlay virtual hierarchical overlay network(VIRGO) according to the domains of their joined virtual organizations. In this paper, we present the definitions of quantized virtual society and protocols on the top of semantic P2P VIRGO network.

关键词： social simulation quantized society semantic P2P networks social agent

来源：评论

学校读者我要写书评

暂无评论

Towards peer-to-peer-based cryptanalysis

Towards peer-to-peer-based cryptanalysis

引用

conference on Local Computer networks (LCN)

作者： Matthäus Wander Arno Wacker Torben Weis Distributed Systems Group University of Duisburg-Essen Duisburg Germany

Modern cryptanalytic algorithms require a large amount of computational power. An approach to cope with this requirement is to distribute these algorithms among many computers and to perform the computation massively parallel. However, existing approaches for distributing cryptanalytic algorithms are based on a client/server or a grid architecture. In this paper we propose the usage of peer-to-peer (P2P) technology for distributed cryptanalytic calculations. Our contribution in this paper is three-fold: We first identify the challenges resulting from this approach and provide a classification of algorithms suited for P2P-based computation. Secondly, we discuss and classify some specific cryptanalytic algorithms and their suitability for such an approach. Finally we provide a new, fully decentralized approach for distributing such computationally intensive jobs. Our design takes special care about scalability and the possible untrustworthy nature of the participating peers.

关键词： Peer to peer computing Cryptography Servers Plugs Algorithm design and analysis Rotors

来源：评论

学校读者我要写书评

暂无评论

A software design based on distributed architecture for seismic exploration system

A software design based on distributed architecture for seis...

引用

IITA international conference on Geoscience and Remote Sensing (IITA-GRS)

作者： Lin Yao Ping Cao Kezhu Song Fuming Ruan Anhui Key Laboratory of Physical Electronics Department of Modern Physics University of Science and Technology Hefei Anhui China Key Laboratory of Technologies of Particle Detection & Electronics Chinese Academy and Sciences Hefei Anhui China Geophysical Technology Laboratory R&D Centre China Oilfield Services Limited Beijing China

A software design based on distributed architecture for seismic exploration system is introduced in this paper. With the development of seismic exploration system which is an important kind of remote sensing system, the demands of equipment software increase rapidly. The increasing demands focus on more seismic data volume, more devices to manage and more information to display to users. To meet these new challenges, the software is designed in distributed architecture instead of centralized architecture. Hybrid programming technique in different languages is adopted to design different modules in different programming languages. The modules can run in different operating system environments such as Linux or UNIX etc. Ethernet network sockets are used for communication between these modules. Network attached storage model is used to manage the massive seismic data, and parallel programming technique is used to improve data accessing and processing performance. This design has some outstanding advantages than other designs: it is easier to realize, more efficient, more scalable, and it makes better use of system resources. With little modification, this software design can be ported to other similar remote sensing systems. This design has a strong reference meaning for other related similar designs.

关键词： Software Decision support systems Sockets Graphics Ethernet networks Computer architecture Java

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 226 227 228 229 230 231 232 233 234 235 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：