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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

MBF: A real matrix bloom filter representation method on dynamic set

MBF: A real matrix bloom filter representation method on dyn...

引用

2007 IFIP international conference on Network and parallel computing Workshops, NPC 2007

作者： Jiacong, Wang Mingzhong, Xiao Yafei, Dai Computer Networks and Distributed Systems Laboratory Peking University China

ISBN: (纸本)0769529437

Bloom Filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries, which uses an m-bit array to represent a data set. In order to support representing dynamic set, dynamic bloom filter (DBF) and split bloom filter (SBF) have been developed. Both DBF and SBF can support concisely representation and approximate membership queries of dynamic set instead of static set. SBF declares that it uses an s Xm bit matrix that consists of s bloom filters to represent a dynamic set, so DBF dose. But in fact, both the two bloom filters are not matrix representation method at all. They are just a set of s bloom filters whose length is m, and they have got a departure from the original idea of bloom filter: the constant query time cost. This paper points out the fact, and then introduce a truly matrix representation method of bloom filter to represent a dynamic set. We call it the Matrix Bloom Filter (MBF). Then, we will analysis the algorithm of MBF and study the average time complexity and the false positive probability. © 2007 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient data acquisition using a distributed and self-organizing scheduling algorithm for wireless sensor networks

引用

3rd IEEE international conference on distributed computing in Sensor Systems

作者： Chatterjea, Supriyo Nieberg, Tim Zhang, Yang Havinga, Paul Univ Twente Dept Comp Sci POB 217 NL-7500 AE Enschede Netherlands Univ Bonn Res Inst Discrete Math Bonn 53113 Germany

ISBN: (纸本)9783540730897

Wireless sensor networks are often densely deployed for environmental monitoring applications. Collecting raw data from these networks can lead to excessive energy consumption. Thus using the spatial and temporal correlations that exist between adjacent nodes we appoint a few as representative nodes that perform in-network aggregation. This reduces the total number of transmissions. Our distributed scheduling algorithm autonomously assigns a particular node to perform aggregation and reassigns schedules when network topology changes. These topology changes are detected using cross-layer information from the underlying MAC layer. We also present theoretical performance estimates and upper bounds of our algorithm and evaluate it by implementing the algorithm on actual sensor nodes, demonstrating an energy-saving of up to 80% compared to raw data collection.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Self-organizing services for browsing the world: Challenges and directions

Self-organizing services for browsing the world: Challenges ...

引用

15th Euromicro international conference on parallel, distributed and Network-Based Processing

作者： Zambonelli, Franco Univ Modena Dipartimento Sci & Met Ingn Reggio Emilia Italy

ISBN: (纸本)9780769527840

The imminent mass deployment of pervasive computing technologies such as sensor networks and RFID tags, together with the increasing participation of the Web community in feeding geo-located information within tools such as Google Earth, will soon make available an incredible amount of information about the physical and social worlds and their processes. Overall, both the above trends contribute to the forming of a decentralized infrastructure that, by accumulating and making available in a ubiquitous way detailed digital information about the surrounding world, opens up the possibility of conceiving innovative context-aware services for "browsing the world" around us, as well as of enhancing the quality and effectiveness of current ICT services via context-awareness and dynamic personalization. However, this will also introduce a dramatic complexity increase in data and service management, making impossible for humans to stay in the control loop and directly manage the configuration and functioning of these systems, and compulsory calling for unsupervised self-organizing approaches at both the data and the service level. On the one hand, proper self-organizing approaches must be defined for processing and aggregating large amounts of data into a meaningful and manageable "world model" to be made available to services. On the other hand, proper distributed computing models and infrastructures must be defined to enable services to exploit such information to self-organize their distributed and context-aware activities at the best. In this talk, after having introduced my general vision of future pervasive computing scenarios, I try to identify the key research challenges that should be faced towards the effective provisioning of self-organizing and context-aware services in such scenarios, and will sketch some possibly promising research directions currently being investigated within the "Agents and Pervasive computing Group" of the Universita di Modena e Reggio Emil

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

PDCS 2007 Foreword

Proceedings of the IASTED International Conference on Parall...

引用

Proceedings of the iasted international conference on parallel and distributed computing and Systems 2007年

作者： Zheng, S.Q.

来源：评论

学校读者我要写书评

暂无评论

Performance prediction for mappings of distributed applications on PC clusters

Performance prediction for mappings of distributed applicati...

引用

IFIP international conference on Network and parallel computing

作者： Jubertie, Sylvain Melin, Emmanuel Univ Orleans LIFO F-45067 Orleans France

ISBN: (纸本)9783540747833

distributed applications running on clusters may be composed of several components with very different performance requirements. The FIowVR middleware allows the developer to deploy such applications and to define communication and synchronization schemes between components without modifying the code. While it eases the creation of mappings, FlowVR does not come with a performance model. Consequently the optimization of mappings is left to the developer's skills. But this task becomes difficult as the number of components and cluster nodes grow and even more complex if the cluster is composed of heterogeneous nodes and networks. In this paper we propose an approach to predict performance of FIowVR distributed applications given a mapping and a cluster. We also give some advice to the developer to create efficient mappings and to avoid configurations which may lead to unexpected performance. Since the FlowVR model is very close to underlying models of lots of distributed codes, our approach can be useful for all designers of such applications.

关键词： Personal computers

来源：评论

学校读者我要写书评

暂无评论

Neighbor-aware optimizing routing for wireless ad hoc networks

引用

4th international conference on Ubiquitous Intelligence and computing

作者： Jiao, Xianlong Wang, Xiaodong Zhou, Xingming Natl Univ Def Technol Natl Lab Parallel & Distributed Proc Changsha 410073 Peoples R China

ISBN: (纸本)9783540735489

Wireless ad hoc networks are consisted of mobile nodes with limited bandwidth, computing ability and energy, which is different from the traditional wired networks. On demand routing protocols are proposed for this type of network, and they scale well with the topology of ad hoc network. But due to lack of knowledge of global topology and the mobility of nodes, they may be not optimal. We propose a Neighbor-Aware Optimizing Routing algorithm (called NAOR) based on SHORT [1] which uses hop comparison array to optimize the routing protocol. Our NAOR algorithm solves those special cases which SHORT fails to handle. Finally, we use ns-2 simulator to evaluate the performance of AODV, AODV using SHORT and AODV using NAOR. The results show that NAOR gets better improvement on performance such as delivery rate and latency than SHORT.

关键词： Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

A collaborative service discovery and service sharing framework for mobile ad hoc networks

A collaborative service discovery and service sharing framew...

引用

IFIP international conference on Network and parallel computing

作者： Safa, Haidar Artail, Hassan Hamze, Hicham Mershad, Khaleel Amer Univ Beirut Dept Comp Sci Beirut Lebanon Amer Univ Beirut Dept Elect & Comp Engn Beirut Lebanon

ISBN: (纸本)9783540747833

Service sharing and discovery play a relevant role in mobile ad hoc environments. Upon joining a self-organizing network, mobile nodes should be able to explore the environment to learn about, locate, and share the available services. In this paper, we propose a distributed and scalable service discovery and sharing framework for ad hoc networks. The proposed framework defines three types of nodes: service directories, service providers and requesting nodes. Service directory nodes act as mediators for lookup requests from requesting nodes. Joining service provider nodes register their services with the nearest service directory. A requesting node discovers the available services by submitting requests to its nearest service directory which determines the node providing the requesting service. The performance of the proposed model is evaluated and compared to the broadcast-based model that has been extensively studied in the literature.

关键词： service discovery mobile ad hoc networks cooperative computing ns2

来源：评论

学校读者我要写书评

暂无评论

Algorithms and Architectures for parallel Processing - 7th international conference, ICA3PP 2007, Proceedings

Algorithms and Architectures for Parallel Processing - 7th I...

引用

7th international conference on Algorithms and Architectures for parallel Processing, ICA3PP 2007

ISBN: (纸本)9783540729044

The proceedings contain 44 papers. The discussed topics include: performance analysis of interconnection networks under bursty and batch arrival traffic;a lazy EDF interrupt scheduling algorithm for multiprocessor in parallel computing environment;a time and interaction model for open distributed timing computation;efficient linkable ring signatures and threshold signatures from linear feedback shift register;an improved algorithm for Alhusaini's algorithm in heterogeneous distributed systems;a framework of software component adaptation;data interoperation between ChinaGrid ad SRB;method for computational grids resources allocate based on auction and utility analyses;automatic conceptual indexing of web services and its application to service retrieval;on-demand capacity framework;implementing digital right management in P2P content sharing system;and a generalized critical task anticipation technique for DAG scheduling.

关键词： Interconnection networks

来源：评论

学校读者我要写书评

暂无评论

distributed coalition formation in visual sensor networks: A virtual vision approach

引用

3rd IEEE international conference on distributed computing in Sensor Systems

作者： Qureshi, Faisal Terzopoulos, Demetri Univ Toronto Dept Comp Sci Toronto ON Canada Univ Calif Los Angeles Dept Comp Sci Los Angeles CA USA

ISBN: (纸本)9783540730897

We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports task-dependent node selection and aggregation through an announcement/bidding/ selection strategy. It resolves node assignment conflicts by solving an equivalent constraint satisfaction problem. Our technique is scalable, as it lacks any central controller, and it is robust to node failures and imperfect communication. Another unique aspect of our work is that we advocate visually and behaviorally realistic virtual environments as a simulation tool in support of research on large-scale camera sensor networks. Specifically, our visual sensor network comprises uncalibrated static and active simulated video surveillance cameras deployed in a virtual train station populated by autonomously self-animating pedestrians. The readily reconfigurable virtual cameras generate synthetic video feeds that emulate those generated by real surveillance cameras monitoring public spaces. Our simulation approach, which runs on high-end commodity PCs, has proven to be beneficial because this type of research would be difficult to carry out in the real world in view of the impediments to deploying and experimenting with an appropriately complex camera network in extensive public spaces.

关键词： camera sensor networks Sensor coordination and control distributed coalition formation video surveillance

来源：评论

学校读者我要写书评

暂无评论

Streaming networks for coordinating data-parallel programs

引用

6th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics

作者： Grelck, Clemens Scholz, Sven-Bodo Shafarenko, Alex Med Univ Lubeck Inst Software Technol & Programming Languages D-23538 Lubeck Germany Univ Hertfordshire Compiler Technol & Comp Architecture Grp Hereford England

ISBN: (纸本)9783540708803

A new coordination language for distributed data-parallel programs is presented, call SNet. The intention of SNet is to introduce advanced structuring techniques into a coordination language: stream processing and various forms of subtyping. The talk will present the organisation of SNet, its major type inferencing algorithms and will briefly discuss the current state of implementation and possible applications.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：