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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Tight Performance Bounds for distributed Detection

Tight Performance Bounds for Distributed Detection

引用

international conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Gernot Fabeck Rudolf Mathar Institute of Theoretical Information Technology RWTH Aachen University Aachen Germany

Evaluating the performance measures of distributed detection in sensor networks is important for design procedures aiming at optimal configurations. Direct computation of the global error probabilities is a difficult problem and feasible only in some special cases. In this paper, we present an approach that provides closed-form upper bounds on the detection error probabilities in the parallel fusion network which are both computationally simple and numerically tight. The bounds are derived by combining a probability inequality formulated by Hoeffding with a multiplicative form factor which is due to Talagrand. We demonstrate that the bounds apply to sensor networks of varying size, an arbitrary number of local quantization levels, and non-identical sensors.

关键词： Error probability Computer networks Quantization Upper bound Tail Random variables Information technology Concurrent computing Error analysis Optimization methods

来源：评论

学校读者我要写书评

暂无评论

A Triplet-based Computer Architecture Supporting parallel Object computing

A Triplet-based Computer Architecture Supporting Parallel Ob...

引用

international conference on Application Specific Systems (ASAP), Architectures and Processors

作者： Feng Shi Weixing Ji Baojun Qiao Bin Liu Haroon ul Rashid School of Computer Science and Technology Beijing Institute of Technology Beijing China

A real scalable triplet-based computer architecture TriBA is proposed in this paper. TriBA is an object-oriented chip multi-processor that supports truly parallel execution of objects from hardware. Cores on the same chip are connected via triplet-based hierarchical interconnection network (THIN), which has simple topology and computing locality characteristic. A distributed deterministic routing algorithm (DDRA) is elaborated, already proposed for THIN. Runtime objects are mapped to processor cores according to their coupling degree which can also transfer to idle cores if needed. TriBA achieves the unification of software architecture and computer, and also relieves the burden of parallel programming.

关键词： Computer architecture Concurrent computing Hardware Multiprocessor interconnection networks Network topology Computer networks Routing Runtime Software architecture parallel programming

来源：评论

学校读者我要写书评

暂无评论

AModified O(n) Leader Election Algorithm for Complete networks

AModified O(n) Leader Election Algorithm for Complete Networ...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Maria Castillo Federico Farina Alberto Cordoba Jesus Villadangos Department Matemática e Informática Universidad PÙblica de Navarra Pamplona Spain

This paper presents a modified leader election algorithm for complete networks without sense of direction. The original algorithm, introduced by Villadangos et al. in (2005), had the aim of reducing the number of exchanged messages in order to select a leader. However, the original O(n) algorithm fails to choose a leader on several occasions. A modified algorithm, which eliminates the problems that cause the wrong behaviour, is proposed. It is formally proved that the new algorithm verifies the correctness criteria that consist of selecting a unique leader in every case. Additionally, the algorithm maintains the O(n) complexity in both messages and time, where n is the number of nodes in the system

关键词： Nominations and elections Network topology distributed algorithms Automata distributed computing Control systems Load management Joining processes Computational complexity Proposals

来源：评论

学校读者我要写书评

暂无评论

Delay sensitive identity protection in peer-to-peer online gaming environments

Delay sensitive identity protection in peer-to-peer online g...

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Aaron Harwood Santosh Kulkani National ICT Australia Victoria Labs Department of Computer Science & Software Engineering University of Melbourne VIC Australia

Peer-to-peer computing overcomes communication bottleneck problems associated with centralized game servers and provides an alternative mechanism to support massively multi-player online gaming (MMOG) applications. A potential security problem associated with this approach relates to player identity. In an MMOG, users from different parts of the network interact with each other in a virtual world. In a peer-to-peer model, these interactions happen directly between the peers and this leads to the IP addresses of peers being available in the network packets. Malicious users can extract the IP addresses of their opponents and the information can be used to gain unfair advantage by compromising their opponents' computers. The well known approach to this problem is the use of anonymizing networks (onion routing and mixing), that anonymize the sender and the destination IP addresses from the peers along a path. However this approach introduces significant delays which are not desirable in MMOG applications. This paper proposes the use of a secret shared key to reduce computational delay and also provides a theoretical framework for trading off the strength of anonymity for reduced delay with respect to classes of interactions in the MMOG. The results suggest that appropriately low delays can be achieved with small reductions in anonymity strength.

关键词： Delay Protection Peer to peer computing Cryptography Routing Games Application software Relays Web server Computer science

来源：评论

学校读者我要写书评

暂无评论

A forwarding model for Voronoi-based Overlay Network

A forwarding model for Voronoi-based Overlay Network

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Jui-Fa Chen Wei-Chuan Lin Tsu-Han Chen Shun-Yun Hu Department of Computer Science and Information Engineering TamKang University Danshui Taiwan Department of Information Technology Takming University of Science and Technology Taiwan

An approach to build highly scalable and robust networked virtual environments (NVEs) is using the peer-to-peer overlay networks. Voronoi-based overlay network (VON) has been proposed to maintain a highly overlay topology consistency in a bandwidth- efficient manner. However, the related research requires all nodes to connect directly with their relevant neighbors. This limits the number of neighbors should appear within the area of interest (AOI) of a given node. A new forwarding model for VON is proposed to solve this problem by connecting only with the nearest neighbors that is called the enclosing neighbors (EN), and propagating the position updates information to other nodes by message forwarding. In this way, the AOI of a given node may be more flexibly expanded and different bandwidth capacities may be more efficiently utilized.

关键词： Peer to peer computing Virtual environment Network topology Bandwidth Electronic mail Nearest neighbor searches Scalability Network servers Proposals Computer science

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of regional registration based mobile multicast service management

Modeling and analysis of regional registration based mobile ...

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Ing-Ray Chen Ding-Chau Wang Department of Computer Science Virginia Polytechnic Institute and State University USA Department of Information Management Southern Taiwan University of Technology Taiwan

We propose and analyze a regional registration based mobile multicast service management scheme which we call URRMoM for efficiently supporting mobile multicast in mobile IP networks. URRMoM extends the design concept of remote subscription (RS) by using mobile multicast agents (MMAs), each covering a number of MHs in its service area through tunneling multicast packets received from the multicast source to them. URRMoM adopts a user-central design allowing each mobile host to determine its optimal MMA service area dynamically depending on its service and mobility characteristics. We develop an analytical model to describe the behavior of a MH operating under URRMoM and derive the optimal service area of the MMA based on the MH's service and mobility characteristics to minimize the total network traffic generated due to multicast packet delivery and multicast tree maintenance. We demonstrate the benefit of our proposed regional registration based mobile multicast service management scheme over existing schemes including RS and RBMoM.

关键词： IP networks Frequency Tunneling Unicast Telecommunication traffic Character generation Subscriptions Multicast protocols Information analysis Mobile computing

来源：评论

学校读者我要写书评

暂无评论

distributed active element in 10 Gbps network

Distributed active element in 10 Gbps network

引用

IEEE international conference on Telecommunications and Malaysia Communications (ICT-MICC)

作者： Petr Holub Eva Hladka Masaryk University CZECH REPUBLIC

In this paper, we propose a distributed Active Element for tightly coupled cluster environment, suitable for distribution of large bandwidth data that exceed capacity of every single node in the cluster. This approach utilizes the fact that real-time multimedia transmission systems relying on non- guaranteed protocols like UDP need to handle limited packet reordering on their own. We describe the Fast Circulating Token protocol, which enables imposing even stricter bound on the outbound packet reordering. The whole system is examined on 10 GE testbed and shows very good performance. The FCT provides expected improvement, making the packet reordering comparable to long haul networks.

关键词： Multimedia systems Bandwidth Protocols High definition video Streaming media Hardware Switches Real time systems parallel processing distributed computing

来源：评论

学校读者我要写书评

暂无评论

Processing the v-KNN Queries inWireless Sensor networks

Processing the v-KNN Queries inWireless Sensor Networks

引用

international conference on parallel Processing (ICPP)

作者： Yongxuan Lai Hong Chen Cuiping Li School of Information Renmin University of China China

Recently there have been growing interests in the applications of wireless sensor networks. Given a query point, which is a value, find a set of K nodes whose values are nearest to this point. We call this query the value-based KNN (v-KNN) query. v-KNN is a challenging query in wireless sensor networks because the network is highly distributed and global knowledge of the values are needed before the result set could be constructed. In this paper, we propose a new algorithm called KVC (v-KNN queries based on value clustering ) to process the v-KNN queries in wireless sensor networks in an energy efficient way. KVC takes advantage of the rich resources in the base station to do some optimizations to filter the irrelevant nodes and push down the v-KNN query into the network. The aim of KVC is to reduce the total communication cost as much as possible while processing the v-KNN queries correctly and efficiently. Simulation results on both realistic and synthetical data sets show that KVC outperforms the central processing in both average and hotspot energy consumption in wireless sensor networks.

关键词： Wireless sensor networks Base stations Monitoring Energy efficiency Energy consumption Military computing Nearest neighbor searches Laboratories Data engineering Knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

Implementation and Performance Evaluation of Socket and RMI based Java Message Passing Systems

Implementation and Performance Evaluation of Socket and RMI ...

引用

international conference on Software Engineering Research, Management and Applications (SERA)

作者： SeungJun Bang JinHo Ahn Kyonggi University Suwonsi Kyonggido Korea

Recently, as speeds of computer processors and networks are rapidly increasing, a lot of researches are actively progressing to develop efficient and lightweight parallel computing platforms using heterogeneous and networked computers. According to this technical trend, this paper designs and implements a message passing library called JMPI(Java Message Passing Interface) which complies with MP], the MPI standard specification for Java language. This library provides some graphic user interface tools to enable parallel computing environments to be configured very simply by their administrators and JMPI applications to be executed very conveniently. Especially, it is implemented as two versions based on two typical distributed system communication mechanisms, Socket and RMI. According to these communication mechanisms, the performance of each message passing system is evaluated by measuring its processing speed with respect to the increasing number of computers by executing three well-known applications. Experimental results show that the most efficient processing speedup can be obtained by increasing the number of the computers in consideration of network traffics generated by applications.

关键词： Sockets Java Message passing Computer networks Application software Concurrent computing parallel processing Libraries Computer graphics User interfaces

来源：评论

学校读者我要写书评

暂无评论

Social Peer-to-Peer for Resource Discovery

Social Peer-to-Peer for Resource Discovery

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Lu Liu Nick Antonopoulos Stephen Mackin Surrey Space Centre University of Surrey Guildford UK Department of Computing University of Surrey Guildford UK Surrey Satellite Technology Limited Guildford UK

For resource discovery in social networks, people can directly contact some acquaintances that have knowledge about the resources they are looking for. However, in current peer-to-peer networks, peer nodes lack capabilities similar to social networks, making it difficult to route queries efficiently. In this paper, we present a social-like system (Social-P2P) for resource discovery by mimicking human behaviours in social networks. Different from most informed search algorithms, peer nodes learn knowledge from the results of previous searches and no additional overhead is required to obtain extra information from neighbouring nodes. Unlike community-based P2P information sharing systems, we do not intend to create and maintain peer groups or communities consciously. Peer nodes with the same interests will be highly connected to each other spontaneously. Social-P2P has been simulated in a dynamic environment. From the simulation results and analysis, Social-P2P achieved better performance than current methods

关键词： Peer to peer computing Social network services Humans Network topology Space technology Costs Network servers Satellites Analytical models Performance analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：