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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

MoBility-Assisted Detection Of The Replication attacks in mobile wireless sensor networks

MoBility-Assisted Detection Of The Replication attacks in mo...

引用

IEEE international conference on Wireless and Mobile computing, Networking And Communications (WiMob)

作者： Xiaoming Deng Yan Xiong Depin Chen School of Computer Science University of Science and Technology Hefei China

Wireless sensor networks are often deployed in harsh environments, where the adversary is able to capture certain sensors. Once a sensor is compromised, the adversary can easily replicate it and deploy several replicas back into the network for further malicious activities. Although a number of protocols have been proposed to tackle such node replication attacks, few of these schemes are suitable for mobile wireless sensor networks. In this paper, we propose two novel mobility-assisted distributed solutions to node replication detection in mobile wireless sensor networks. In both protocols, after receiving the time-location claims, witnesses carry these claims around the network instead of transmitting them. That means data are forwarded only when appropriate witnesses encounter each other. Unary-Time-Location Storage & Exchange (UTLSE) detects the replicas by each of the two encountered witnesses which stores only one time-location claim. Multi-Time-Location Storage & Diffusion (MTLSD), by storing more time-location claims for each tracked node and introducing time-location claims diffusion among witnesses, provides excellent resiliency and sub-optimal detection probability with modest communication overhead. Due to the mobility-assisted property, our protocols do not rely on any specific routing protocol, which makes them suitable for various mobile settings. Our theoretical analysis and simulation results show that our protocols are efficient in terms of detection performance, communication overhead and storage overhead.

关键词： Protocols Wireless sensor networks Mobile communication Mobile computing Wireless communication Routing Security

来源：评论

学校读者我要写书评

暂无评论

Properties of 1-D Infrastructure-Based Wireless Multi-Hop networks

Properties of 1-D Infrastructure-Based Wireless Multi-Hop Ne...

引用

IEEE international conference on Communications (ICC)

作者： S. C. Ng G. Mao B. D. Anderson School of Electrical and Information Engineering University of Sydney Australia Research School of Information Sciences and Engineering Australian National University Australia

Many real wireless multi-hop networks are deployed with some infrastructure support, where the results on ad-hoc networks cannot be readily extended to understand the properties of those networks. In this paper, we study those networks in 1-D. Specifically, we consider two types of nodes in the networks: ordinary nodes and powerful nodes, where ordinary nodes are i.i.d and Poissonly distributed in a unit interval and powerful nodes are arbitrarily distributed within the same unit interval. These powerful nodes are inter-connected via some backbone infrastructure. The network is said to be connected, i.e. any two nodes can communicate with each other, if each ordinary node is connected to at least one of the powerful nodes. We call this type of connectivity type-II connectivity. Exact and simplified asymptotic formulas for type-II connectivity probability and the average hop count between two arbitrary nodes are obtained. Further we prove that equi- distant powerful nodes deployment delivers the optimum performance which maximizes the type-II connectivity probability. These results are important for the design and deployment of 1-D infrastructure-based networks and provide useful insights into the analysis of higher dimensional networks.

关键词： Spread spectrum communication Peer to peer computing Ad hoc networks Wireless sensor networks Road vehicles Bridges Communications Society Spine H infinity control Solid modeling

来源：评论

学校读者我要写书评

暂无评论

Two improved GPU acceleration strategies for force-directed graph layout

Two improved GPU acceleration strategies for force-directed ...

引用

international conference on Computer Application and System Modeling (ICCASM)

作者： Yong-Xian Wang Zong-Zhe Li Lu Yao Wei Cao Zheng-Hua Wang National Key Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

Force directed approach is one of the most widely used methods in graph drawing research. However, the running time is increased intolerablely along with the enlargement of the graph size, which restricts the algorithm's practicability. By the aid of GPU (graphics processing unit) computing platform, we can speed-up the graph layout with low cost, but the existing GPU implementation mainly employees an “one-by-one” style to update the vertex' coordination per iteration, which has a lower convergent rate than the “batch” style which is instead used commonly in traditional CPU implementation. As a result, the aesthetics of graph layout would be decreased if the total running time is restricted. It is hard to achieve both a high speedup factor of GPU over CPU and a high convergent rate in existing GPU computing implementation. In order to solve this problem partially, this paper presents two new strategies to implement the large-scale graph layout on CPU+GPU heteromerous platform to accelerate the force directed layout for graph drawing problem. The numerical computation results show that our GPU implementation can dramatically improve the performance of force-direct layout and is 20 times on a NVIDIA GeForce 9800 GT GPU at 1.44 GHz faster than the one on single-CPU core of Intel Pentium 4 PC at 3.0 GHz for the graph layout with moderate size (typically 1000 vertices).

关键词： Graphics processing unit Gallium nitride Heating

来源：评论

学校读者我要写书评

暂无评论

SPADS: Publisher Anonymization for DHT Storage

SPADS: Publisher Anonymization for DHT Storage

引用

international conference on Peer-to-Peer computing

作者： P. Felber M. Rajman E. Riviere V. Schiavoni J. Valerio University of Neuchâtel Switzerland EPF Lausanne Switzerland

Many distributed applications, such as collaborative Web mapping, collaborative feedback and ranking, or bug reporting systems, rely on the aggregation of privacy-sensitive information gathered from human users. This information is typically aggregated at servers and later used as the basis for some collaborative service. Expecting that clients trust that the user-centric information will not be used for malevolent purposes is not realistic in a fully distributed setting where nodes are not under the control of a single administrative domain. Moreover, most of the time the origin of the data is of small importance when computing the aggregation onto which these services are based. Trust problems can be evinced by ensuring that the identity of the user is dropped before the data can actually be used, a process called publisher anonymization. Such a property shall be guaranteed even if a set of servers is colluding to spy on some user. This also requires that malevolent users cannot harm the service by sending any number of items without being traceable due to publisher anonymization. Rate limitation and decoupled authentication are the two mechanisms that ensure that these cheating users have a limited impact on the system. This paper presents SPADS, a system that interfaces to any DHT and supports the three objectives of publisher anonymization, rate limitation and decoupled authentication. The evaluation of a deployed prototype on a cluster assesses its performance and small footprint.

关键词： Servers Peer to peer computing Authentication IP networks Protocols Registers Book reviews

来源：评论

学校读者我要写书评

暂无评论

Horizontal Addressing by Title in a Next Generation Internet

Horizontal Addressing by Title in a Next Generation Internet

引用

international conference on Networking and Services (ICNS)

作者： João Henrique de Souza Pereira Sergio T. Kofuji Pedro Frosi Rosa Department de Engineering de Sistemas Electrônicos (PSI) USP University of São Paulo Sao Paulo Brazil Faculdade de Computação (FACOM) UFU-Federal University of Uberlândia Uberlandia Minas Gerais Brazil

ISBN: (纸本)9781424459278;9780769539690

In this work in progress, a new proposal is introduced for Internet horizontal addressing through the unification of application, host, and user addresses in entity title. With this unification it is possible the host addressing in Internet without IP use, as well as the routing of applications without the use of TCP, UDP, or SCTP ports. For so, it is proposed to create one Domain Title Service in Internet architecture to enable the addresses unification and that the network structure can receive information about the entities' needs, and then meet them.

关键词： IP networks Proposals TCPIP Web and internet services Next generation networking Scalability Computer architecture Routing protocols Computer networks distributed computing

来源：评论

学校读者我要写书评

暂无评论

Self-Organizing Agents for Service Composition in Cloud computing

Self-Organizing Agents for Service Composition in Cloud Comp...

引用

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

作者： J. Octavio Gutierrez-Garcia Kwang-Mong Sim Department of Information and Communications Gwangju Institute of Science and Technology Gwangju South Korea

In Cloud service composition, collaboration between brokers and service providers is essential to promptly satisfy incoming Cloud consumer requirements. These requirements should be mapped to Cloud resources, which are accessed via web services, in an automated manner. However, distributed and constantly changing Cloud-computing environments pose new challenges to automated service composition such as: (i) dynamically contracting service providers, which set service fees on a supply-and-demand basis, and (ii) dealing with incomplete information regarding Cloud resources (e.g., location and providers). To address these issues, in this work, an agent-based Cloud service composition approach is presented. Cloud participants and resources are implemented and instantiated by agents. These agents sustain a three-layered self-organizing multi-agent system that establishes a Cloud service composition framework and an experimental test bed. The self-organizing agents make use of acquaintance networks and the contract net protocol to evolve and adapt Cloud service compositions. The experimental results indicate that service composition is efficiently achieved despite dealing with incomplete information as well as coping with dynamic service fees.

关键词： Proposals Barium Protocols Contracts Cloud computing Context

来源：评论

学校读者我要写书评

暂无评论

Enriched Cyberspace through Adaptive Multimedia Utilization for Dependable Remote Collaboration

Enriched Cyberspace through Adaptive Multimedia Utilization ...

引用

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

作者： Yoshitaka Sakurai Kinshuk Kouhei Takada Rainer Knauf Setsuo Tsuruta School of Information Environment Tokyo Denki University Japan School of Computing and Information Systems Athabasca University Canada Faculty of Computer Science and Automation University of Ilmenau Ilmenau Germany

Due to the geographical distribution, different cognitive capacity, and different domain competency of workers or learners, many misunderstandings can occur during distributed remote collaboration, leading to inefficient discussions and undesired results. To make remote collaboration more efficient and dependable, enriching cyberspace through adaptively utilizing is proposed and evaluated. This assesses situations of remote users through information fusion of multiple biological sensors and the related contexts such as user profiles. Transmitting and using such information, the system adaptively supports the distributed remote collaboration by stressing, warning, and presenting keywords/summaries in multimedia. Effects of presenting keywords/summaries adaptively depending on situations and cognitive profiles of remote members are evaluated as to the decrease of not-/misunderstanding possibilities during the explanation on the Cyberspace. The evaluation demonstrates the feasibility and usefulness of the proposed method.

关键词： Collaborative work Collaborative tools Multimedia systems international collaboration Guidelines Humans Application software conferences Multimedia computing Computer networks

来源：评论

学校读者我要写书评

暂无评论

Dynamic composition of Peer-to-Peer Web Service using WCF

Dynamic composition of Peer-to-Peer Web Service using WCF

引用

international conference on Computer Science and Information Technology (CSIT)

作者： E. Anupriya N.Ch.S.N. Iyengar School of Computing Science and Engineering Vellore of Institute of Technology Vellore Tamil Nadu India

The enormous growth of Peer-to-Peer networks have evolved new breed of applications. A Web Service is a middleware technology which supports interoperability among the heterogeneous systems. The power of Web Service when coupled with Peer-to-Peer networks can make Web Services accessible by any small group of users to a very larger group of peers constructed over Internet. This approach enables peer-to-peer distributed Web Service discovery within the peer group of common interest. Every peer is allowed to publish and discover Web Service without central coordination. The information on Web services will be available to all the peers within the common interest peer group. When an end-user connects to the network via one peer, he/she will be able to view the list of Web Services and access them across all the peers relevant to his/her request. The objective of our work is to implement a distributed peer-to-peer Web Service discovery system for student community which would enable the students to chat, share, access materials of common interest and group documents in peer student's system. Moreover, we have proposed distributed Hash Table (DHT) to search Web Services available in the peer group. This would increase the search efficiency of the system. Our System is implemented in. Net on Window XP service pack 3 platform with Windows Communication Foundation (WCF) which supports easy construction of peer-to-peer applications.

关键词： Computational modeling Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

Near-Optimum Power Allocation for BER Restricted Multihop Cooperative networks

Near-Optimum Power Allocation for BER Restricted Multihop Co...

引用

IEEE international conference on Communications (ICC)

作者： B. Maham A. Hjorungnes Department of Electrical Engineering University of Stanford Stanford USA UNIK University Graduate Center University of Oslo Norway

Due to the limited energy supplies of nodes, in many applications like wireless sensor networks, energy-efficiency is crucial for extending the networks lifetime. We study the routing problem for multihop wireless ad hoc networks based on cooperative transmission. The source node wants to transmit messages to a single destination. Other nodes in the network may operate as relay nodes. In this paper, we propose a cooperative multihop routing for the purpose of power savings, constrained on a required bit error rate (BER) at the destination. Two efficient power allocation schemes are proposed, which depend only on the statistics of the channels. In the first scheme, each node needs to know only the local channel statistics, and can be implemented in a distributed manner. The second scheme is a centralized power control strategy, which has a higher energy efficiency, at the expense of more complexity and signaling overhead. It is shown that energy savings of 75% are achievable in line networks with 3 relays for BER = 10 -4 constraint at the destination.

关键词： Bit error rate Spread spectrum communication Routing Relays Peer to peer computing Wireless sensor networks Wireless networks Receivers Quality of service Radio transmitters

来源：评论

学校读者我要写书评

暂无评论

distributed Radio Coverage Optimization in Enterprise Femtocell networks

Distributed Radio Coverage Optimization in Enterprise Femtoc...

引用

IEEE international conference on Communications (ICC)

作者： I. Ashraf H. Claussen L. T. W. Ho Bell Laboratories Alcatel-Lucent USA

Radio coverage optimization is a key element in improving the overall performance of femtocell cellular networks. Owing to the increased size and complexity of femtocell networks, there is an imperative need to develop decentralized coverage optimization algorithms, which is a highly challenging task as these algorithms have to work without global information and coordinated central control of network nodes. In this paper, we consider a deployment scenario of a group of N femtocells in an enterprise environment and propose a decentralized algorithm for joint femtocell coverage area optimization. The algorithm updates the femtocell's pilot Tx power only and serves to balance the user load amongst the collocated femtocells as well as minimizing the coverage holes and pilot Tx power. Compared to the fixed pilot Tx power allocation, the algorithm introduces an improvement of approximately 18% in terms of supported user traffic, in addition to a significant reduction of pilot leakage to neighboring cells.

关键词： Femtocell networks Land mobile radio cellular systems Bit error rate Radio transmitters 3G mobile communication Communications Society Centralized control Size control Peer to peer computing Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 201 202 203 204 205 206 207 208 209 210 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：