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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

991 篇 会议
20 篇 期刊文献
9 册 图书

馆藏范围

1,020 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

764 篇 工学
- 736 篇 计算机科学与技术...
- 526 篇 软件工程
- 195 篇 信息与通信工程
- 78 篇 控制科学与工程
- 59 篇 电子科学与技术（可...
- 58 篇 电气工程
- 21 篇 动力工程及工程热...
- 19 篇 机械工程
- 16 篇 生物医学工程（可授...
- 15 篇 生物工程
- 13 篇 建筑学
- 12 篇 环境科学与工程（可...
- 11 篇 安全科学与工程
- 8 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 6 篇 力学（可授工学、理...
- 6 篇 光学工程
- 6 篇 土木工程
256 篇 理学
- 209 篇 数学
- 34 篇 统计学（可授理学、...
- 31 篇 系统科学
- 21 篇 物理学
- 20 篇 生物学
- 12 篇 化学
221 篇 管理学
- 170 篇 管理科学与工程(可...
- 111 篇 工商管理
- 67 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
10 篇 法学
- 7 篇 社会学
6 篇 医学
- 6 篇 基础医学(可授医学...
4 篇 农学
3 篇 文学
2 篇 教育学

主题

95 篇 distributed comp...
71 篇 parallel process...
53 篇 grid computing
50 篇 peer to peer com...
48 篇 distributed comp...
33 篇 parallel process...
32 篇 servers
31 篇 fault tolerance
30 篇 computer archite...
29 篇 computational mo...
27 篇 distributed data...
24 篇 protocols
21 篇 concurrent compu...
21 篇 software enginee...
21 篇 cloud computing
19 篇 parallel program...
18 篇 graphics process...
18 篇 algorithm design...
18 篇 artificial intel...
17 篇 bandwidth

机构

11 篇 institute of com...
10 篇 institute of com...
5 篇 academic center ...
5 篇 department of in...
4 篇 institute of par...
4 篇 national laborat...
4 篇 graduate univers...
4 篇 national laborat...
3 篇 school of comput...
3 篇 chinese academy ...
3 篇 institute of inf...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 computer science...
2 篇 pervasive techno...
2 篇 inria
2 篇 disca univ. poli...
2 篇 state key labora...
2 篇 west bengal univ...
2 篇 dcse college of ...

作者

7 篇 valentin cristea
5 篇 kurt rothermel
5 篇 nakashima hirosh...
5 篇 kondo toshio
5 篇 sasaki takahiro
5 篇 ohno kazuhiko
5 篇 gonzalez teofilo...
4 篇 dongarra jack
4 篇 tang tao
4 篇 wang guibin
4 篇 florin pop
4 篇 matsumoto masaki
4 篇 andresen daniel
3 篇 suter frédéric
3 篇 kawamura takao
3 篇 xhafa fatos
3 篇 alexandru costan
3 篇 lin yisong
3 篇 cristea valentin
3 篇 takata toyoo

语言

1,001 篇 英文
19 篇 其他

检索条件"任意字段=IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010"

共 1020 条记录，以下是521-530 订阅

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

详细简洁

排序：

Towards Building Efficient Content-Based Publish/Subscribe systems over Structured P2P Overlays

Towards Building Efficient Content-Based Publish/Subscribe S...

引用

international conference on parallel Processing (ICPP)

作者： Shengdong Zhang Ji Wang Rui Shen Jie Xu National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China School of Computing University of Leeds Leeds UK

In this paper, we introduce a generic model to deal with the event matching problem of content-based publish/subscribe systems over structured P2P overlays. In this model, we claim that there are three methods (event-oriented, subscription-oriented and hybrid) to make all the matched pairs (event, subscription) meet in a system. By theoretically analyzing the inherent problem of both event-oriented and subscription-oriented methods, we propose PEM (Popularity-based Event Matching), a variant of hybrid method. PEM can achieve better trade-off between event processing load and subscription storage load of a system. PEM has been verified through both mathematical and simulation-based evaluation.

关键词： Subscriptions Decision support systems Publishing Load modeling Mathematical model Bandwidth Routing

来源：评论

学校读者我要写书评

暂无评论

Multi-task Downloading for P2P-VoD: An Empirical Perspective

Multi-task Downloading for P2P-VoD: An Empirical Perspective

引用

international conference on parallel and distributed systems (ICPADS)

作者： Tieying Zhang Zhenhua Li Xueqi Cheng Xianghui Sun Institute of Computing Technology Chinese Academy and Sciences China Department of Computer Science and Technology Peking University China China Telecom Group Corporation China

For current P2P-VoD systems, three fundamental problems exit in user experience: exceedingly large startup delay, long jump latency, and poor playback continuity. These problems primarily stem from lack of media data. In this paper, we propose Multi-Task Downloading with Bandwidth Control (MTD(BC)), an efficient and practical mechanism to prefetch media data. In MTD, a user can download multiple videos in parallel with its current viewing, which significantly decreases video switching delays. However, MTD brings a serious problem: downloading "other" tasks could impede the playback performance of the current viewing, especially in low-bandwidth network. This problem is solved through our design of bandwidth control. To our knowledge, we are the first to propose MTD with bandwidth control for P2P-VoD and conduct empirical evaluations in the real-world system. The running results show that MTD(BC) achieves better streaming quality than the traditional method. In particular, our mechanism reduces 75% of startup delay and 36% of jump latency in low-bandwidth network with high system scalability.

关键词： Bandwidth Videos Delay Upper bound Servers Bit rate Media

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Timeout Strategy for UDP Flows Using SVMs

An Adaptive Timeout Strategy for UDP Flows Using SVMs

引用

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

作者： Jing Cai Zhibin Zhang Peng Zhang Xinbo Song Chinese Academy of Sciences Beijing China Institute of Computing Technology Chinese Academy and Sciences Beijing China

With the increase of network bandwidth, more and more new applications such as audio, video and online games have become the main body in network traffic. Based on real time considerations, these new applications mostly use UDP as transport layer protocol, which directly increase UDP traffic. However, traditional studies believe that TCP dominates the Internet traffic and previous traffic measurements were generally based on it while UDP was ignored. In view of this, we mainly discuss the adaptive timeout strategy of UDP flows in this paper. Firstly, due to the significant differences in flow characteristics between the TCP flows and UDP flows, we expound and prove that the existing adaptive timeout strategies are not appropriate for UDP flows. Secondly, we present our adaptive strategy using Support Vector Machine techniques. We build six classifiers to accurately predict its corresponding maximum packet inter-arrival time and adapt its timeout value within the flow duration. Limited to its accurate rating, we present another concept of adjust accuracy rating which can probability-guaranteed(90%,95%,98%) to avoid long flow to be cut into short flows. The experiment result reveals that our adaptive strategy has the potential to achieve significant performance advantages over other widely used fixed and other adaptive timeout schemes.

关键词： Protocols Throughput Algorithm design and analysis Adaptive systems Support vector machines Accuracy Correlation

来源：评论

学校读者我要写书评

暂无评论

Small-World Social Relationship Awareness in Unstructured Peer-to-Peer Networks

Small-World Social Relationship Awareness in Unstructured Pe...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Hao Liao Kuo-Chan Huang Hung-Chang Hsiao Department of Computer Science and Information Engineering National Cheng Kung University Tainan Taiwan

Unstructured peer-to-peer (P2P) file-sharing networks are popular in the mass market. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest. Empirical measurement studies indicate that the peers in P2P networks have similar preferences, and recently proposed unstructured P2P networks intend to organize the participating peers in a small-world (SW) fashion by exploiting the knowledge of contents stored in peers. As existing algorithms for constructing SW-based unstructured P2P networks may not precisely reveal the object sharing patterns, the resultant networks thus may not perform searches efficiently and effectively by exploiting the common interests among peers. In this paper, we suggest a novel P2P network formation algorithm to construct SW-based unstructured networks. We validate our proposal in simulations with an empirical data set, and the simulation results prove that our proposal greatly outperforms existing algorithms in terms of search efficiency and effectiveness.

关键词： Peer to peer computing Proposals Search problems Measurement Simulation YouTube Joining processes

来源：评论

学校读者我要写书评

暂无评论

ILGT: Group Reputation Aggregation Method for Unstructured Peer-to-Peer Networks

ILGT: Group Reputation Aggregation Method for Unstructured P...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Asaki Matsumoto Yo Mashimo Masanori Yasutomi Hiroshi Shigeno Graduate School of Science and Technology Keio University Yokohama Kanagawa Japan

Reputation aggregation methods in unstructured Peer-to-Peer(P2P) networks are used to evaluate the trustworthiness of participating peers and to combat malicious peer's behaviors. In the reputation aggregation method, each peer calculates global scores by aggregating local scores which are obtained from each peer in P2P networks. In structured P2P networks, each peer exchanges local scores with other peers. Gossip Trust is proposed as a reputation aggregation method for the unstructured P2P networks. However, Gossip Trust has problem that high frequency of communications and long aggregation time increase as the number of peers in the network increase. In this paper, we propose a reputation aggregation method called ”ID-List based Group Trust(ILGT)”. ILGT limits the number of peers that participate in reputation aggregation process and share the global scores by using list of ID. And ILGT improves communication frequency and aggregation time. Through computer simulations, we compare the proposed method ILGT with Gossip Trust.

关键词： Peer to peer computing Aggregates Time frequency analysis Computer simulation History Internet Receivers

来源：评论

学校读者我要写书评

暂无评论

Dual-Path Peer-to-Peer Anonymous Approach

Dual-Path Peer-to-Peer Anonymous Approach

引用

international conference on parallel and distributed systems (ICPADS)

作者： Ehsan Saboori Maghsoud Abbaspour K. N. Toosi University of Technology Tehran Iran Shahid Beheshti University Tehran Iran

There are many approaches proposed to provide anonymous peer-to-peer communications. Data sent via peer-to-peer communications is vulnerable to traffic analysis. Traffic analysis is the process of intercepting and analysing messages in order to compromise information from patterns in communications. An intruder can get information about the content of the data, the requester's and provider's identities. Anonymous approaches are designed with the following three goals: to protect the identity of provider, to protect the identity of requester and to protect the contents of transferred data between them. This article presents a new peer-to-peer approach to achieve anonymity between a requester and a provider in a hybrid peer-to-peer information-sharing environment with trusted servers called supper node so that the provider will not be able to identify the requester and no other peers can identify the two communicating parties with certainty. This article shows that the proposed approaches improved reliability and has more security. This approach, based on onion routing and randomization, protects transferring data against traffic analysis attack. The ultimate goal of this anonymous communications approach is to allow a requester to communicate with a provider in such a manner that nobody can determine the requester's identity and the content of transferred data.

关键词： Peer to peer computing Public key Servers Routing Reliability

来源：评论

学校读者我要写书评

暂无评论

PMSAI: A Novel Peer-to-Peer Multimedia Streaming Architecture over IMS

PMSAI: A Novel Peer-to-Peer Multimedia Streaming Architectur...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Ran Liu Hao Yin Wen Hui Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan China Department of Computer Science and Technology Tsinghua University Beijing China School of Information Engineering University of Science and Technology Beijing Beijing China

Deploying multimedia streaming over IP Multimedia Subsystem (IMS) can enable all kinds of user equipments to enjoy unified streaming service, without considering the differences of heterogeneous accessing methods. The combination of IMS and peer-to-peer (P2P) may help operators (especially telecommunication operators) to provide more scalable multimedia streaming. In this paper, we propose PMSAI, a novel P2P multimedia streaming architecture over IMS, in order to expand the capability of IMS multimedia streaming and reduce server side resource consumption, while restricting P2P traffic within local areas and trying best to keep standard IMS unchanged. To study how PMSAI performs, we also build a experimental system of live multimedia streaming. Carefully measurement study demonstrates the feasibility and effectiveness of PMSAI. To the best of our knowledge, PMSAI is the first P2P multimedia streaming architecture over IMS.

关键词： Multimedia communication Streaming media Peer to peer computing Bandwidth Protocols Media

来源：评论

学校读者我要写书评

暂无评论

Analysis of Integrity Vulnerabilities and a Non-repudiation Protocol for Cloud Data Storage Platforms

Analysis of Integrity Vulnerabilities and a Non-repudiation ...

引用

international conference on parallel Processing Workshops (ICPPW)

作者： Jun Feng Yu Chen Wei-Shinn Ku Pu Liu Department of Electrical & Computer Engineering State University of New York Binghamton Binghamton NY USA Department of Computer Science & Software Engineering Aubum University Auburn AL USA Systems and Technology Group IBM Endicott Endicott NY USA

Data storage technologies have been recognized as one of the major dimensions of information management along with the network infrastructure and applications. The prosperity of cloud computing requires the migration from server-attached storage to network-based distributed storage. Along with variant advantages, distributed storage also poses new challenges in creating a secure and reliable data storage and access facility. The data security in cloud is one of the challenges to be addressed before the novel pay-as-you-go business model can be accepted and applied widely. Concerns are raised from both insecure/unreliable service providers and potential malicious users. In this article, we analyze the integrity vulnerability existing in the current cloud storage platforms and show the problem of repudiation. A novel non-repudiation (NR) protocol specifically designed in the context of cloud computing environment is proposed. We have also discussed the robustness of the NR protocol against typical attacks in the network environments.

关键词： Clouds Cloud computing Protocols Authentication Google

来源：评论

学校读者我要写书评

暂无评论

Achieving Flow-Level Controllability in Network Intrusion Detection System

Achieving Flow-Level Controllability in Network Intrusion De...

引用

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

作者： Bo Song Weibing Yang Mingyu Chen Xiaofang Zhao Jianping Fan Chinese Academy of Sciences Beijing Beijing CN Institute of Computing Technology Chinese Academy and Sciences Beijing China

ISBN: (纸本)9781424474226;9780769540887

Current network intrusion detection systems are lack of controllability, manifested as significant packet loss due to the long-term resources occupation by a single flow. The reasons can be classified into two kinds. The first kind is known as normal reasons, that is, the processing of mass arriving packets of a large flow can not be limited to a determinable period of time and thus makes other flows starved. The second kind, in which the CPU is trapped in a dead-loop like state due to processing some packets with particular content of a flow, is considered as abnormal reasons. In fact, it is a kind of software crashes. In this paper, we discuss the innate defects of traditional packet-driven NIDS, and implement a flow-driven framework which can achieve fine-grained controllability. An Active Two-threshold scheme based on ideal Exit-Point (ATEP) is proposed in order to diminish data preserving overhead during flow switches and to detect crash in time. A quick crash recovery mechanism is also given which can recover the trapped thread from 90% crashes in 0.2 ms. The experimental results show that our flow-driven framework with ATEP scheme can achieve higher throughput and less packet loss ratio than the uncontrollable packet-driven systems with less than 1% of extra CPU overhead. What's more, in the case of crash occurrence, the ATEP scheme is still able to maintain rather steady throughput without sudden decrease.

关键词： Controllability Intrusion detection Computer crashes Vehicle crash testing System testing Software testing Throughput Software engineering Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

On Post-Generation Data Operations in Secure distributed Storage systems with Internal Padding

On Post-Generation Data Operations in Secure Distributed Sto...

引用

international conference on Computer and Information Technology (CIT)

作者： Feng Shen Hai Jiang Zhiqian Xu Department of Computer Science Arkansas State University USA Information Security Group Royal Holloway University of London UK

Secure distributed storage systems can achieve data security and fault resilience by providing encrypted and redundant data segments across multiple computing nodes. However, such systems might face severe performance bottlenecks when frequently tacking data with high consistency demand. This paper proposed a secure distributed storage system based on revised secret sharing scheme with internal padding. Data are saved in multiple coefficients of associated polynomials for high capacity. Shares generated from these polynomials are distributed and can be recollected to retrieve the original data. Post-generation data operations including data insertion, deletion, updating and appending do not require the complete share regeneration. Only affected data portions will be reprocessed and parallel processing is supported if they are interleaved. Performance analyses and experimental results have demonstrated the effectiveness and efficiency of the post-generation data operations.

关键词： Polynomials Cryptography distributed databases Secure storage Performance gain

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 49 50 51 52 53 54 55 56 57 58 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：