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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

608 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

341 篇 工学
- 332 篇 计算机科学与技术...
- 204 篇 软件工程
- 122 篇 信息与通信工程
- 34 篇 电气工程
- 25 篇 控制科学与工程
- 24 篇 电子科学与技术（可...
- 8 篇 动力工程及工程热...
- 8 篇 测绘科学与技术
- 7 篇 机械工程
- 7 篇 建筑学
- 6 篇 生物工程
- 5 篇 光学工程
- 5 篇 安全科学与工程
- 3 篇 力学（可授工学、理...
- 3 篇 土木工程
- 3 篇 生物医学工程（可授...
- 2 篇 仪器科学与技术
109 篇 理学
- 90 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 9 篇 物理学
- 9 篇 生物学
- 5 篇 化学
- 2 篇 大气科学
- 2 篇 地球物理学
76 篇 管理学
- 51 篇 管理科学与工程(可...
- 43 篇 工商管理
- 27 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 医学
- 4 篇 临床医学
2 篇 法学
1 篇 教育学
1 篇 农学

主题

174 篇 distributed comp...
111 篇 computer network...
100 篇 software enginee...
93 篇 artificial intel...
73 篇 concurrent compu...
55 篇 computer science
47 篇 grid computing
47 篇 distributed comp...
45 篇 peer to peer com...
39 篇 application soft...
31 篇 parallel process...
31 篇 wireless sensor ...
30 篇 network topology
29 篇 parallel process...
29 篇 delay
28 篇 costs
25 篇 algorithm design...
25 篇 large-scale syst...
24 篇 protocols
23 篇 resource managem...

机构

3 篇 department of co...
3 篇 department of co...
3 篇 school of inform...
3 篇 national laborat...
3 篇 institute of com...
3 篇 school of comput...
3 篇 school of comput...
2 篇 univ sci & techn...
2 篇 huazhong univ sc...
2 篇 department of co...
2 篇 univ adelaide sc...
2 篇 school of comput...
2 篇 univ technol syd...
2 篇 department of co...
2 篇 school of manage...
2 篇 sharif universit...
2 篇 school of comput...
2 篇 lab. com. phys. ...
2 篇 natl univ def te...
2 篇 school of comput...

作者

4 篇 xicheng lu
4 篇 aaron harwood
4 篇 nong xiao
3 篇 shietung peng
3 篇 hong chen
3 篇 rui chu
3 篇 wenhong wei
3 篇 yongxuan lai
3 篇 huanguo zhang
3 篇 engelmann christ...
3 篇 gerald kunzmann
3 篇 wenjun xiao
2 篇 nandi asoke k.
2 篇 xing-ming li
2 篇 choi k.
2 篇 ling zhang
2 篇 wu cheng
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...

语言

620 篇 英文

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

共 620 条记录，以下是201-210 订阅

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

详细简洁

排序：

A P2P architecture for large-scale VoD service

A P2P architecture for large-scale VoD service

引用

8th ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing/3rd ACIS international Workshop on Self-Assembling Wireless networks

作者： Wu, Ai Yuan, Lianhai Liu, Xinsong Liu, Kejian Univ Elect Sci & Technol China Sch Comp Sci Chengdu 610054 Peoples R China Univ Technol Dept Comp Sci & Technol Engn & Tech Coll Chengdu Leshan 614007 Peoples R China

ISBN: (纸本)0769529097

Scalability and reliability are essential to VoD, a peer-to-peer based VoD architecture (RSVoD) is proposed in this paper. In the proposed architecture, assignable-size user buffer, algorithms of parents selection and subtree migration are employed to ensure the reliability and scalability of system, finis avalanche problem is discussed also. The attributes and performance of RSVoD are analyzed in theory. Performance studies based on simulations are carried out also, and the results show that the presented architecture outperforms recently proposed similar architectures in a number of important performance metrics, such as the server stress, reliability, service capacity, time of failure, and soon.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A visualized parallel network simulator for modeling large-scale distributed applications

A visualized parallel network simulator for modeling large-s...

引用

18th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2007

作者： Siming, Lin Xueqi, Cheng Jianming, Lv Institute of Computing Technology Chinese Academy of Sciences Beijing China Graduate School Chinese Academy of Sciences Beijing China

ISBN: (纸本)0769530494

Large-scale distributed systems, with thousands or even millions of nodes, produce complex and dynamic behaviors. Packet-level simulation is necessary to test and analyze these systems, such as grids, peer-to-peer (P2P) applications as well as worm and DDoS containment systems. However, the current network simulators are not convenient for application layer simulation. We present the NSME, a visualized parallel simulator that allows researchers to simulate their applications in a large virtual network with most details transparent to them. A hierarchical routing is used to enhance the fidelity of simulation and reduce the memory cost of network construction. A variation of CMB algorithm is implemented for parallel synchronization. We show the functions of NSME by three applications: 1) a self-similar background traffic model, 2) a Slammer worm spreading model, and 3) a P2P live streaming system, which demonstrate its effectiveness for simulating any large-scale distributed applications. The performance tests show that the memory cost of NSME is distinctly lower than NS2 and the parallel efficiency can reach about 60% in any of the above applications. © 2007 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Parzen windows estimation using laplace kernel: A novel parametric analysis with information content

Parzen windows estimation using laplace kernel: A novel para...

引用

8th ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing/3rd ACIS international Workshop on Self-Assembling Wireless networks

作者： He, Jingsong Tang, Jian Fang, QianSheng MOE-Micro Soft Key Laboratory of Multimedia Computing and Communication Department of Electronic Science and Technology University of Science and Technology of China Anhui Institute of Architecture and Industry China

ISBN: (纸本)0769529097

Parzen windows estimation is one of the classical non-parametric methods in the field of machine learning and pattern classification, and usually uses Gaussian density function as the kernel. Although the relation between the kernel density estimation (KDE) and low-pass filtering is well known, it is vary difficult to setting the parameters of the other kinds of density, functions. This paper proposes a novel method to deal with the parameters of Laplace kernel through measuring the degree of exchanged information among interpolating points. Experimental results showed that the proposed method can improve the performance of Parzen windows significantly.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Soft QoS Guarantee in Mobile Ad Hoc networks 20

Efficient Soft QoS Guarantee in Mobile Ad Hoc Networks

引用

20th international conference on parallel and distributed computing Systems, PDCS 2007

作者： Xie, Gaogang Li, Zhenyu Chen, Jianing Issarny, Valerie Conte, Alberto Institute of Computing Technology Chinese Academy of Sciences Beijing100080 China INRIA-Rocquencourt Domaine de Voluceau Le Chesnay78153 France Alcatel Research & Innovation Center Marcoussis France

ISBN: (纸本)9781604233926

More and more Quality of Service (QoS) sensitive applications, such as streaming media, high bandwidth content distribution and VoIP, will be deployed in Mobile Ad hoc networks (MANETs) as part of the pervasive computing realization. However, traditional QoS guarantee technologies cannot be used directly in MANETs due to the dynamic network environment. This paper proposes a QoS management mechanism combining Caching and Backup Service Paths (CBSP) and an Enhanced CBSP (ECBSP) for soft QoS guarantee in MANETs. In CBSP, Service Provider Nodes (SPNs) with distinct Service Paths (SPs) providing the required service are found in the MANET during the service discovery phase. The client node then selects one SP to get the service and the other SPs as Backup Service Paths (BSPs). If the serving SP fails to serve the client node, the client node can handover quickly to a BSP and consume the resource in its cache during the handover operation in order to avoid service interruption. In ECBSP, the required data are further divided into several segments and transmitted concurrently to the client node through different SPs for enhanced availability. Simulation experiments in ns2 show that CBSP/ECBSP can improve the performance of applications in MANETs effectively. © 20th international conference on parallel and distributed computing Systems, PDCS 2007. All rights reserved.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

An efficient hybrid P2P incentive scheme

An efficient hybrid P2P incentive scheme

引用

8th ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing/3rd ACIS international Workshop on Self-Assembling Wireless networks

作者： Guan, Zhitao Durad, Muhammad Hanif Cao, Yuanda Zhu, Liehuang Beijing Inst Technol Sch Comp Sci & Technol Beijing Peoples R China Beijing Inst Technol Sch Software Beijing Peoples R China

ISBN: (纸本)0769529097

P2P systems have suffered a lot from free riding problem i.e. some participants consume more resources than they contribute. In order to deal with this problem efficiently, an incentive model based on peer credit has been proposed Each peer in this model is a credit entity. Through introducing reward method to the model, peers will allocate resources according to the credits of requesting peers to maximize their own credits. A backtracking algorithm has been suggested to solve the issue of maximizing credit rewards. To avoid inflation of the credit, attenuation method is introduced The scheme how to apply the credit model in hybrid P2P networks has also been elaborated in this work. The experimental results show that the model can effectively control free riding and improve efficiency of the system.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed key establishment scheme in wireless sensor network

Distributed key establishment scheme in wireless sensor netw...

引用

SNPD 2007: 8th ACIS international conference on Software Engineering, Artificial Intelligence, Networking, and parallel/distributed computing

作者： Zhao, Hong-Wei Pei, Shi-Hui Liu, Ping-Ping College of Computer Science and Technology Jilin University Qianjin Road 2699 Changchun Jilin China

ISBN: (纸本)0769529097

Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Overhead imbalance of sensor nodes make it infeasible to use traditional key distribution center scheme for security service of distributed sensor network. In this paper we propose a distributed key establishment scheme. In the phase of key pre-distribution, every sensor node is preloaded the same size key pre-distribution information;in the phase of key establishment, the overhead every sensor node used to distribute key is the same. So, the overhead imbalance problem of traditional key distribution center scheme can be solved. A distinguishing property of this framework is that it does not require the knowledge of sensor's expected location and greatly simplifies the deployment of sensor networks. In security, the relationship between the ratio of compromised links to non-compromised sensors and the number of compromised nodes is linear. © 2007 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Smart carpet: A footstep tracking interface

Smart carpet: A footstep tracking interface

引用

21st international conference on Advanced Networking and Applications

作者： Savio, Domnic Ludwig, Thomas Infineon Technol AG Neubiberg Germany Heidelberg Univ Dept Parallel Distributed Syst D-69115 Heidelberg Germany

ISBN: (纸本)9780769528472

distributed computing infrastructures provided by sensor networks supports new ways of observing human motion. In this paper, we discuss algorithms that use data from sensor networks for tracking the gait of human walk. Three methods for identifying footsteps and footstep patterns that describe a walk of a subject are discussed. The methods interpret the data into a set of coordinates that represent a trajectory of the subject's walk. The results show that the proposed methods are more accurate and cost less than existing methods.

关键词： Interfaces (computer)

来源：评论

学校读者我要写书评

暂无评论

A distributed deadlock detection and resolution algorithm for process networks

A distributed deadlock detection and resolution algorithm fo...

引用

32nd IEEE international conference on Acoustics, Speech and Signal Processing

作者： Allen, Gregory E. Zucknick, Paul E. Evans, Brian L. Univ Texas Appl Res Labs Dept Elect & Comp Engn POB 8029 Austin TX 78713 USA

ISBN: (纸本)1424407281

In the Process Network (PN) model, multiple concurrent processes communicate over unidirectional FIFO queues. PN is useful for modeling signal processing systems of streaming data, and naturally captures parallelism in these systems. PN provides formal execution properties to alleviate the difficulties of threaded and distributed programming, and naturally maps onto parallel and distributed targets. For a large class of PN, clever run-time scheduling can permit execution in bounded memory. In general, PN termination and boundedness cannot be statically determined, so correct bounded scheduling of PN requires run-time deadlock detection. We present the first algorithm that correctly performs dynamic deadlock detection and resolution for bounded scheduling of PN. The proposed algorithm is a modification of a distributed deadlock detection algorithm by Mitchell and Merritt.

关键词： Kahn process networks deadlock resolution dynamic scheduling distributed computing signal processing

来源：评论

学校读者我要写书评

暂无评论

A study about the mapping of process-processor based on Petri nets

A study about the mapping of process-processor based on Petr...

引用

8th ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing/3rd ACIS international Workshop on Self-Assembling Wireless networks

作者： Fang Xianwen Xu Zhicai Yin Zhixiang Anhui Univ Sci & Technol Dept Math & Phys Huainan 232001 Peoples R China Chuzhou Univ Chuzhou 239012 Peoples R China

ISBN: (纸本)9780769529097

In the design and analysis of discrete event systems, the validation of their models is often addressed via simulation. Petri nets have been applied widely Lookahead computation is a good method that improves the distributed simulation performance of Timed Transition Petri Nets (TTPN). The approach is based on a part of optimism computed on the prediction time each logical process can determine for its advancement. Timed Petri nets meet these requirements, and use the lookahead to analyze the TTPN model for finding the concurrency and blocking structure, thereby making certain the logical process (LP). Based on the specialties of lookahead, the lookahead was applied in parallel simulation, and acquire the sufficient condition about the TTPN model existing concurrency According to the condition parallel program can be partitioned into several logical processes, and the partition algorithm that can decide quickly the mapping project on the mapping process-processor is presented.

关键词： timed Petri nets lookahead distributed processing logical process mapping

来源：评论

学校读者我要写书评

暂无评论

Peer Clustering-based Cache Sharing for multi-attribute range queries in grid environments

Peer Clustering-based Cache Sharing for multi-attribute rang...

引用

18th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2007

作者： Mo, Hai Zhiwei, Xu Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)0769530494

Multi-attribute range queries on top of P2P networks have attracted much attention. Such research has direct application in grid resource monitoring and discovery. In existing research, the overheads (number of hops and number of messages required) of query algorithms depend on both the size of range to be queried and the number of peers, and a high update cost is incurred when resource information changes. We propose a Peer Clustering-based Cache Sharing scheme, in the context of grid computing environments. Peers issuing similar queries are dynamically clustered together, and cached query results are shared among peers. Simulation results show that our scheme improves both query efficiency and update cost. The average number of routing hops and number of messages needed converge to slightly larger than 1, independent of the number of attributes, the size of the range, and the total number of peers. The number of messages needed for attribute update is reduced. The maintenance cost is low. © 2007 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：