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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

An Operator Approach to Popularity-Based Caching in DHTs

An Operator Approach to Popularity-Based Caching in DHTs

引用

IEEE international conference on Communications (ICC)

作者： Z. Despotovic Q. Hofstaetter M. Michel W. Kellerer DoCoMo Conimunications Laboratories Europe GmbH Munich Germany Institute of Communication Networks Technische Universität München Munich Germany

Caching is a long investigated topic in the context of P2P networks and distributed hash tables (DHTs). Most of the proposed caching algorithms are user-centric in the sense that they focus on minimizing the search size or latency as the target metrics. In contrast, we take the network operator-centric view in this paper. We set the total traffic generated by the DHT search as the metric of interest and provide a simple algorithm to achieve a maximum reduction of the traffic. The key of the algorithm is that every node maintains statistics about routed queries and replicates its cached objects only when the popularity of queries for those objects are above a certain threshold. Through extensive simulations, we determine the optimal value of the popularity threshold and show the traffic reduction in comparison with state of the art DHT caching solutions. Our algorithm achieves an average traffic reduction of around 30% as compared to caching along the entire search paths, while maintaining good performance in terms of user-oriented measures such as the number of search hops, or equivalently, the search latency.

关键词： Peer to peer computing Telecommunication traffic Traffic control Delay Communications Society Laboratories Europe Communication networks Electronic mail distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A novel routing technique using route path information in unstructured Peer to Peer network

A novel routing technique using route path information in un...

引用

international conference on Communication and Computational Intelligence (INCOCCI)

作者： U. Kaleelurrahaman M. Kavitha D. Kavinpriya M. Sadishsendil S. Karthik Information Technology Department of Computer Science and Engineering SNS College of Technology India

Peer-to-Peer overlay systems offer a substrate for the construction of large scale and distributed applications. The Peer-to-Peer technique is differentiated in to two major forms, Structured P2P and Unstructured P2P. In structured peer-to-peer networks, connections in the overlay are fixed. They typically use distributed hash table-based (DHT) indexing, such as in the Chord system. Unstructured peer-to-peer networks do not provide any algorithm for organization or optimization of network connections. Hence the functions like searching, querying etc. are mostly flooded. In this paper we propose a novel message passing technique in which each peer maintains the route path of the destination with in itself which uses this route path to send and receive messages. This method minimizes the packet flow in the unstructured P2P which occur during flooding technique.

关键词： Peer to peer computing Routing Floods Computer science Educational institutions Receivers Security

来源：评论

学校读者我要写书评

暂无评论

Improving Efficiency of Peer Network Applications by Formulating distributed Spanning Tree

Improving Efficiency of Peer Network Applications by Formula...

引用

international conference on Emerging Trends in Engineering and Technology, ICETET

作者： P. Victer Paul T. Vengattaraman P. Dhavachelvan Department of Computer Science Pondicherry University Puducherry India

Peer to Peer (P2P) networks are the important part of the next cohort of Internet. But in Peer networks, achieving required efficiency for any application is difficult. This is because efficiency of application evidently depends on the effective communication. For any communication process in peer network very large number of message passes needed because the message may go through a node multiple times. In order to limit the number of message passes needed for effective communication in any peer network, we follow an interconnection structure called distributed Spanning Tree (DST) which defines each node as the root of a spanning tree. DST will make the peer network into a layered structure to improve the effective routing and data availability. In this paper, we propose a technique to formulate DST in peer network and determined efficiency improvement in various P2P applications using DST.

关键词： Peer to peer computing Probes Object oriented modeling Heuristic algorithms Routing Floods Arrays

来源：评论

学校读者我要写书评

暂无评论

Joint Relay Selection and Power Allocation in Cooperative-Diversity System

Joint Relay Selection and Power Allocation in Cooperative-Di...

引用

WRI international conference on Communications and Mobile computing, CMC

作者： Xiao Bai Danpu Liu Guangxin Yue Huarui Wu Key Laboratory of Universal Wireless Communication Ministry of Education Beijing University of Posts and Telecommunications Beijing China Beijing Academy of Agricultural and Forestry Sciences Beijing China

ISBN: (纸本)9781424463275;9780769539898

In this paper, we propose two novel algorithms where relay selection and power allocation are jointly considered in order to optimize ergodic capacity in AF (Amplify-and-forward) cooperative diversity communication. In S-AR algorithm, joint power allocation and relay selection is performed to maximize the received SNR at the destination node. In S-OR algorithm, the best relay with maximal instantaneous channel gain is selected at first, and then power is allocated between source and the relay in an optimized way to maximize ergodic capacity. Through Monte Carlo simulation, a conclusion can be drawn that such selective-relay scenarios with joint power allocation have better throughput performance than that of parallel-relay scenario. Furthermore, S-AR algorithm is better than S-OR algorithm when throughput of the cooperative-diversity system is considered.

关键词： Power system relaying Relays Decoding Throughput Wireless networks Forward contracts Mobile communication Mobile computing Telecommunication computing Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Automatic synthesis of processor arrays with local memories on FPGAs

Automatic synthesis of processor arrays with local memories ...

引用

IEEE international conference on Field-Programmable Technology (FPT)

作者： Guiming Wu Yong Dou Miao Wang National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China Jiangnan Institute of Computing Technology Wuxi China

In this paper, we present an automatic synthesis framework to map loop nests to processor arrays with local memories on FPGAs. An affine transformation approach is firstly proposed to address space-time mapping problem. Then a data-driven architecture model is introduced to enable automatic generation of processor arrays by extracting this data-driven architecture model from transformed loop nests. Some techniques including memory allocation, communication generation and control generation are presented. Synthesizable RTL codes can be easily generated from the architecture model built by these techniques. A preliminary synthesis tool is implemented based on PLUTO, an automatic polyhedral source-to-source transformation and parallelization framework.

关键词： parallel processing Registers Field programmable gate arrays Radiation detectors Arrays Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Multimedia Data Analysis on a Massively distributed parallelization Network of Anonymous Web Clients

Multimedia Data Analysis on a Massively Distributed Parallel...

引用

international conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Jeremy K. Hall Shuichi Kurabayashi Yasushi Kiyoki Graduate School of Media and Governance Keio University Fujisawa Kanagawa Japan

This paper proposes an architecture for forming a parallelization network composed of anonymous web clients - those users anonymously browsing a website. This architecture is layered on conventional HTTP-based web applications to organize their clients as computing nodes in a massively distributed computation. The key technology of this architecture is a dynamic installation mechanism for a media analysis module, and a dual-channel communications protocol established between Anonymous Web Clients and servers in order to distribute work, and to retrieve the computing results. The important feature of this architecture is that the clients are kept anonymous to the server, so the server does not have to keep track of clients' status. This stateless communication architecture enables scalable expansion of the parallelization network's computing power without relying upon a centralized data center. In effect, this allows a web-based video sharing service to offload some of its analysis onto users browsing the sie, in the background, without interrupting a user's browsing experience. This paper also demonstrates an important optimization for performing media analysis within the parallelization network, which takes advantage of video inter and intra-frame pixel color homogeneity. This paper shows several experimental results for clarifying the system's feasibility and effectiveness, by using a prototype system implementation.

关键词： Data analysis Computer architecture Service oriented architecture distributed computing Network servers Video sharing Protocols Web server Computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Flow-Level Modeling of parallel Download in distributed Systems

Flow-Level Modeling of Parallel Download in Distributed Syst...

引用

international conference on Communication Theory, Reliability, and Quality of Service, CTRQ

作者： Abdulhalim Dandoush Alain Jean-Marie INRIA Sophia-Antipolis France INRIA and LIRMM CNRS Université Montpellier 2 Montpellier France

Response time is the primary Quality of Service metric for parallel download systems, where pieces of large files can be simultaneously downloaded from several servers. Determining response times in such systems is still a difficult issue, because the way the network bandwidth is shared between flows is as yet not well understood. We address the issue by exploring the practical relevance of the hypothesis that flows share the network bandwidth according to the max-min fairness paradigm. We have implemented into a flow-level simulator a version of the algorithm, which calculates such a bandwidth allocation, which we have called the ``progressive-filling flow-level algorithm'' (PFFLA). We have programmed a similar model over NS2 and compared the empirical distributions resulting from both simulations. Our results indicate that flow-level predictions are very accurate in symmetric networks and good in asymmetric networks. Therefore, PFFLA would be extremely useful to build flow-level simulators and, possibly, to perform probabilistic QoS calculations in general P2P networks.

关键词： Bandwidth Throughput Quality of service Network servers Delay Computational modeling Protocols Filling Reliability theory File servers

来源：评论

学校读者我要写书评

暂无评论

Abnormal pattern detection based on visualization

Abnormal pattern detection based on visualization

引用

international conference on Computer and Automation Engineering, ICCAE

作者： Ai-shu Jin Dae-dong Hwang Gye-young Kim Hoon Chang Sangjun Lee Hyung-il Choi School of Media Soongsil University Seoul South Korea School of Computing Soongsil University Seoul South Korea

ISBN: (纸本)9781424455690

Malicious traffics on the internet are difficult to detect among massive network traffic flow. In most existing method about network attack visualization systems, normally, the attacks cannot be automatically detected by the system. In the paper, a new network traffic visualization based on artificial neural network is proposed. The proposed method is capable of detecting attack traffic pattern more easily. In the proposed method, image is firstly made using the source IP, source port, destination IP and destination port, and then patterns are detected by Hough transform. Pattern features are evaluated by artificial neural network, through which abnormal patterns are classified. The performance of the proposed method proved through experiment results.

关键词： Telecommunication traffic IP networks Computer crime Artificial neural networks Data visualization Flowcharts distributed computing Information security Web and internet services Government

来源：评论

学校读者我要写书评

暂无评论

Intercloud Security Considerations

Intercloud Security Considerations

引用

IEEE international conference on Cloud computing Technology and Science (CloudCom)

作者： David Bernstein Deepak Vij Huawei Technologies Company Limited China

Cloud computing is a new design pattern for large, distributed data centers. Service providers offering applications including search, email, and social networks have pioneered this specific to their application. Recently they have expanded offerings to include compute-related capabilities such as virtual machines, storage, and complete operating system services. The cloud computing design yields breakthroughs in geographical distribution, resource utilization efficiency, and infrastructure automation. These “public clouds” have been replicated by IT vendors for corporations to build “private clouds” of their own. Public and private clouds offer their end consumers a “pay as you go” model - a powerful shift for computing, towards a utility model like the electricity system, the telephone system, or more recently the Internet. However, unlike those utilities, clouds cannot yet federate and interoperate. Such federation is called the “Intercloud”. Building the Intercloud is more than technical protocols. Ablueprint for an Intercloud economy must bearchitected with a technically sound foundation and topology. As part of the overall Intercloud Topology, this paper builds on the technology foundation emerging for the Intercloud and specifically delves into details of Intercloud security considerations such as Trust Model, Identity and Access Management, governance considerations and so on.

关键词： Cloud computing Computational modeling Security Topology Peer to peer computing Protocols

来源：评论

学校读者我要写书评

暂无评论

Agent placement in wireless embedded systems: Memory space and energy optimizations

Agent placement in wireless embedded systems: Memory space a...

引用

IEEE international Symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Nikos Tziritas Thanasis Loukopoulos Spyros Lalis Petros Lampsas Computer & Communication Engineering Department University of Thessally Volos Greece Centre for Research and Technology슠Thessaly Volos Greece Department of Informatics & Computer Technology Technological Educational Institute of Lamia Lamia Greece

ISBN: (纸本)9781424465330

Embedded applications can be structured in terms of mobile agents that are flexibly installed on available nodes. In wireless systems, such nodes typically have limited battery and memory resources; therefore it is important to place agents judiciously. In this paper we tackle the problem of placing a newcomer agent in such a system. The problem has two main components. First, enough memory space must be found or created at some node to place the agent. Second, the placement should be energy efficient. We present heuristics for tackling these two goals in a stepwise fashion, as well as a branch and bound method for achieving both goals at the same time. Our algorithms are centralized assuming a single entry point through which agents are injected into the system, with adequate knowledge of the system state and enough resources to run the proposed algorithms. The algorithms are evaluated under different simulated scenarios, and the tradeoffs across the two metrics (space, energy) are identified.

关键词： Embedded system Application software Space technology Batteries Educational technology Embedded computing Home automation Wireless networks Dynamic programming Mobile communication

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 197 198 199 200 201 202 203 204 205 206 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：