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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,983 篇 会议
280 册 图书
87 篇 期刊文献

馆藏范围

5,350 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,872 篇 工学
- 2,564 篇 计算机科学与技术...
- 1,719 篇 软件工程
- 966 篇 信息与通信工程
- 369 篇 电气工程
- 301 篇 控制科学与工程
- 180 篇 网络空间安全
- 125 篇 动力工程及工程热...
- 124 篇 电子科学与技术（可...
- 120 篇 安全科学与工程
- 110 篇 机械工程
- 102 篇 生物工程
- 70 篇 建筑学
- 69 篇 仪器科学与技术
- 54 篇 生物医学工程（可授...
- 45 篇 土木工程
- 43 篇 交通运输工程
613 篇 理学
- 367 篇 数学
- 118 篇 生物学
- 104 篇 系统科学
- 100 篇 统计学（可授理学、...
- 84 篇 物理学
484 篇 管理学
- 334 篇 管理科学与工程(可...
- 187 篇 图书情报与档案管...
- 159 篇 工商管理
241 篇 法学
- 165 篇 法学
- 82 篇 社会学
78 篇 医学
- 65 篇 临床医学
- 63 篇 基础医学(可授医学...
- 51 篇 公共卫生与预防医...
62 篇 经济学
- 62 篇 应用经济学
41 篇 军事学
17 篇 农学
14 篇 教育学
12 篇 文学
1 篇 艺术学

主题

499 篇 security
355 篇 wireless sensor ...
309 篇 computer network...
253 篇 protocols
247 篇 computer archite...
216 篇 intrusion detect...
213 篇 authentication
210 篇 computer communi...
200 篇 ip networks
188 篇 computer crime
171 篇 servers
165 篇 computer securit...
158 篇 information secu...
155 篇 network security
151 篇 distributed comp...
150 篇 internet of thin...
147 篇 computer science
147 篇 cryptography
142 篇 computational mo...
142 篇 internet

机构

25 篇 shandong provinc...
21 篇 key laboratory o...
13 篇 shandong fundame...
12 篇 chitkara univers...
10 篇 information syst...
9 篇 shandong enginee...
9 篇 king saud univer...
9 篇 school of comput...
9 篇 institute of inf...
8 篇 school of comput...
8 篇 department of co...
8 篇 department of co...
8 篇 department of co...
7 篇 key laboratory o...
7 篇 school of comput...
7 篇 department of la...
7 篇 hannam universit...
6 篇 shandong enginee...
6 篇 chinese acad sci...
6 篇 department of el...

作者

17 篇 eyas el-qawasmeh
11 篇 tai-hoon kim
9 篇 hammoudeh mohamm...
9 篇 dominik ślęzak
9 篇 obaidat mohammad...
9 篇 igor kotenko
8 篇 isaac woungang
8 篇 azizah abd manaf
8 篇 mukaddim pathan
7 篇 osvaldo gervasi
7 篇 yanmin zhu
7 篇 mohammad s. obai...
7 篇 barolli leonard
7 篇 lin zhang
7 篇 jasni mohamad za...
7 篇 wei wang
6 篇 klaus wehrle
6 篇 zarai faouzi
6 篇 yunhao liu
6 篇 shahid raza

语言

5,233 篇 英文
86 篇 其他
38 篇 中文
1 篇 葡萄牙文

检索条件"任意字段=International Conference on Security in Computer Networks and Distributed Systems, SNDS 2012"

共 5350 条记录，以下是4851-4860 订阅

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

详细简洁

排序：

CBRBrain: provide content based routing service over Internet backbone

CBRBrain: provide content based routing service over Interne...

引用

international conference on computer Communications and networks (ICCCN)

作者： Wen-Zhan Song Xiang-Yang Li Department of Computer Science Illinois Institute of Technology Chicago IL USA

Peer-to-peer (P2P) networking came from a family of technologies and techniques for organizing distributed applications that takes advantage of the resources available at the Internet edges. In this paper, we propose an innovative P2P system architecture, called CBRBrain, to implement the content based routing (CBR) service over the backbone routers instead of at the terminal hosts. Hence CBRBrain avoids some drawbacks in previous P2P systems and significantly improves the efficiency and security. Data locating process is easily implemented on CBRBrain by associating a hashed key with each data item and storing the (key, address) pair in routers. The cost for topology update is neglectful since the routers is almost static in the Internet and is not affected by the frequent joining and leaving of hosts at all. The traffic generated by CBRBrain system over the Internet is also expected to be significantly smaller as compared with the other P2P systems. The logical topology of CBRBrain backbone can be any self-routing structure to enable the content based routing service. In the paper, we recommend to construct the underlying logical topology based on the pseudo-balanced de Bruijn graph, since it has many nice properties such as bounded degrees, low diameters and fault tolerance. As an illustration, we describe the mechanism of P2P file sharing application under CBRBrain architecture. Our work is a first step in building an intelligent backbone of the next generation Internet and facilitates the emergence of various intelligent applications over the Internet besides P2P file sharing

关键词： Routing Web and internet services Spine Peer to peer computing Topology Intelligent structures Organizing IP networks Data security Costs

来源：评论

学校读者我要写书评

暂无评论

GKMPAN: an efficient group rekeying scheme for secure multicast in ad-hoc networks

GKMPAN: an efficient group rekeying scheme for secure multic...

引用

international conference on Mobile and Ubiquitous systems: Networking and Services (MobiQuitous)

作者： S. Zhu S. Setia S. Xu S. Jajodia Center for Secure Information Systems George Mason University Fairfax VA USA Department of Computer Science University of Texas San Antonio San Antonio TX USA

We present GKMPAN, an efficient and scalable group rekeying protocol for secure multicast in ad hoc networks. Our protocol exploits the property of ad hoc networks that each member of a group is both a host and a router, and distributes the group key to member nodes via a secure hop-by-hop propagation scheme. A probabilistic scheme based on predeployed symmetric keys is used for implementing secure channels between members for group key distribution. GKMPAN also includes a novel distributed scheme for efficiently updating the predeployed keys. GKMPAN has three attractive properties. First, it is significantly more efficient than group rekeying schemes that were adapted from those proposed for wired networks. Second, GKMPAN has the property of partial statelessness; that is, a node can decode the current group key even if it has missed a certain number of previous group rekeying operations. This makes it very attractive for ad hoc networks where nodes may lose packets due to transmission link errors or temporary network partitions. Third, in GKMPAN the key server does not need any information about the topology of the ad hoc network or the geographic location of the members of the group. We study the security and performance of GKMPAN through detailed analysis and simulation.

关键词： Intelligent networks Ad hoc networks Multicast protocols Network servers Cryptography Public key Information systems computer science Electronic mail Decoding

来源：评论

学校读者我要写书评

暂无评论

Towards integrating key distribution with entity authentication for efficient, scalable and secure group communication in MANETs

Towards integrating key distribution with entity authenticat...

引用

IEEE international conference on Communications (ICC)

作者： M. Striki J.S. Baras Electrical and Computer Engineering and the Institute for Systems Research University of Maryland College Park MD USA

We focus on the design of key management (KM) schemes tailored for the environment of Mobile Ad Hoc networks (MANETs). A MANET is a collection of wireless mobile nodes, communicating among themselves over possibly multi-hop paths, without the help of any infrastructure such as base stations or access points. The fact that no central authorization entity is assumed at all times for all nodes makes the task of network operations more difficult and indicates the need for distributed algorithms to provide the functions of centralized entities. KM ensures communication security among nodes and the capability of their cooperation as a secure group. It consists of key generation, user authentication and key distribution services. In this work we address key distribution, group key generation, entity authentication: we emphasize that entity authentication should be designed with key distribution algorithms in mind and vice versa, to achieve efficient and scalable KM schemes for MANETs. We present an entity authentication scheme based on the Merkle Tree algorithm, applied on a key generation protocol recently developed - MOT- to produce an efficient, scalable and secure KM scheme.

关键词： Authentication Mobile ad hoc networks Mobile communication Environmental management Communication system security Wireless communication Femtocell networks Authorization distributed algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Threshold and identity-based key management and authentication for wireless ad hoc networks

Threshold and identity-based key management and authenticati...

引用

international conference on Information Technology: Coding and Computing (ITCC)

作者： Hongmei Deng A. Mukherjee D.P. Agrawal OBR Center for Distributed and Mobile Computing Department of ECECS University of Cincinnati Cincinnati OH USA

As various applications of wireless ad hoc network have been proposed, security has become one of the big research challenges and is receiving increasing attention. In this paper, we propose a distributed key management and authentication approach by deploying the recently developed concepts of identity-based cryptography and threshold secret sharing. Without any assumption of prefixed trust relationship between nodes, the ad hoc network works in a self-organizing way to provide the key generation and key management service, which effectively solves the problem of single point of failure in the traditional public key infrastructure (PKI)-supported system. The identity-based cryptography mechanism is applied here not only to provide end-to-end authenticity and confidentiality, but also to save network bandwidth and computational power of wireless nodes.

关键词： Identity management systems Authentication Mobile ad hoc networks Identity-based encryption Cryptography Ad hoc networks computer network management Power system management Public key Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Reliability of intelligent power routers

Reliability of intelligent power routers

引用

international conference on Probabilistic Methods Applied to Power systems (PMAPS)

作者： C.M. Torres-Ortolaza A.A. Irizarry-Rivera University of Puerto Rico-Mayagüez Mayagüez Puerto Rico

In this work we seek to determine the reliability of intelligent power routers (IPR). The IPR is our building block to provide scalable coordination in a distributed model for the next generation power network. Our goal in the IPR project is to show that by distributing network intelligence and control functions using the IPR, we will be capable of achieving improved survivability, security, reliability, and re-configurability. In order to calculate the change in reliability of a system operated with and without IPR, the IPR failure mechanisms and failure probabilities must be determined. Since there is no actual data on IPR reliability, none has been built; its failure mechanisms and failure probability will be established by analogy to data routers. In this paper we consider a basic IPR structure consisting of: power hardware (breakers or other power switching elements), computer hardware (communication between IPR and CPU functions), and software. We establish the failure modes for each element of the selected IPR structure to estimate the IPR reliability. This estimate of failure probability will be used in our future work to measure the change in reliability of a power system operated with and without IPR.

关键词： Intellectual property Power system reliability Failure analysis Hardware Power system modeling Next generation networking Intelligent control Intelligent networks Data security Power system security

来源：评论

学校读者我要写书评

暂无评论

CKDS: an efficient combinatorial key distribution scheme for wireless ad-hoc networks

CKDS: an efficient combinatorial key distribution scheme for...

引用

IEEE international conference on Performance, Computing and Communications (IPCCC)

作者： M. Moharrum R. Mukkamala M. Eltoweissy Department of Computer Science Old Dominion University Spain Department of Computer Science Virginia Tech

Computing and communications in wireless ad hoc networks (WAHNs) generally require collaboration among groups of peers. This, in addition to a growing number of group applications over WAHNs, have motivated research in secure group communication services as a means for efficient and secure communications in WAHNs. Key distribution is at the heart of secure group communications. Existing key distribution schemes, designed for infrastructure networks, tend to be inappropriate for the infrastructure-less WAHNs. Also, most of these schemes assume network-level multicast which is difficult to implement in WAHNs. We propose a new efficient and scalable combinatorial key distribution scheme (CKDS) to support secure group communications in WAHNs. CKDS partitions nodes over a virtual Cartesian key space and uses combinatorial exclusion basis systems for key distribution over application-level multicast. We employ a fully distributed unicast key distribution underlying a virtual application-level multicast infrastructure. Two variants of CKDS are proposed, namely, m-dimensional multicast and 2D multicast. Performance analysis shows that these schemes achieve lower network traffic overhead as well as lower computational overhead per node compared to other unicast key distribution schemes in WAHNs. We also show our scheme to be scalable with respect to both computational and storage needs.

关键词： Ad hoc networks Peer to peer computing computer networks Unicast Communication system security Mobile ad hoc networks Collaboration Heart Performance analysis Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Parameterized specification and verification of the Chilean electronic invoices system

Parameterized specification and verification of the Chilean ...

引用

computer Science Society (SCCC) international conference Chilean FLAGGED

作者： I. Attali T. Barros E. Madelaine I.N.R.I.A. Sophia Antipolis France

We present the complete process of a formal specification and verification of the Chilean electronic invoice system which has been defined by the tax agency. We use this case study as a real-world and real-size example to illustrate our methodology for specification and verification of distributed applications. Our approach is based on a new hierarchical and parameterized model for synchronised networks of labelled transition systems. In this case study, we use a subset of the model as a graphical specification language. We check this formal specification of the invoice system against its informal requirements, described in terms of parameterized temporal logic formulas. Their satisfiability cannot be checked directly on the parameterized model: we introduce a method and a tool to instantiate the parameterized models and properties, allowing to use standard (finite-state, bisimulation-based) model-checkers for the verification. We also illustrate the use of different methods to avoid the state explosion problem by taking advantage of the parameterized structure and instantiations.

关键词： Formal specifications Protocols Application software Communication system security Specification languages Logic Explosions Marketing and sales Authentication Testing

来源：评论

学校读者我要写书评

暂无评论

Data management over the GRID: heaven or hell?

Data management over the GRID: heaven or hell?

引用

international Working conference on Scientific and Statistical Database Management

作者： Y. Ioannidis Department of Informatics and Telecommunications University of Athens (NKUA) Greece

The last decade has seen unprecedented advances in network and distributed-system technologies, which have opened up the way for the construction of global-scale systems based on completely new conceptions of computation and sharing of resources. The dream of integrating unlimited levels of processing power, unlimited amounts of information, and an unlimited variety of services, and offering the entire package in a reliable and seamless fashion to widely distributed users is quickly becoming reality. Scientific applications will be among the first to take advantage of such environments, as the demands of current and future experimental studies for intensive computation and processing of very large amounts of information are pressing. GRID technologies are at the forefront of these developments. While much has been written about computation in the GRID environment, data management has received less attention in the literature. Nevertheless, the GRID offers tremendous opportunities for large-scale distributed data management and at the same time poses major technical challenges in the area as well. The goal of this panel discussion is to identify these opportunities and challenges and examine whether the positive aspects of the GRID outweigh the negative ones or vice versa. In this direction, the panelists are called to answer some of the following questions: Is there new research to be done on data management over the GRID? Are there any new problems that arise from managing data over the GRID? For example, are there new problems with respect to security or heterogeneous information integration? Do classical problems require new solutions or do conventional approaches work well in the GRID environment? For example, how does one address issues of concurrency control, recovery, query processing and optimization? How does the GRID compare with other architectures, e.g., peer-to-peer, with respect to data management? Is the existing distributed computing infrastructure d

关键词： distributed computing Power system management computer networks Packaging Power system reliability Pressing Grid computing Environmental management Large-scale systems Data security

来源：评论

学校读者我要写书评

暂无评论

Probabilistic inference strategy in distributed intrusion detection systems 04

引用

Proceedings of the Second international conference on Parallel and distributed Processing and Applications

作者： Jianguo Ding Shihao Xu Bernd Krämer Yingcai Bai Hansheng Chen Jun Zhang Shanghai Jiao Tong University Shanghai P.R. China FernUniversität Hagen Hagen Germany East-china Institute of Computer Technology P.R. China

ISBN: (纸本)9783540241287

The level of seriousness and sophistication of recent cyber-attacks has risen dramatically over the past decade. This brings great challenges for network protection and the automatic security management. Quick and exact localization of intruder by an efficient intrusion detection system (IDS) will be great helpful to network manager. In this paper, Bayesian networks (BNs) are proposed to model the distributed intrusion detection based on the characteristic of intruders' behaviors. An inference strategy based on BNs are developed, which can be used to track the strongest causes (attack source) and trace the strongest dependency routes among the behavior sequences of intruders. This proposed algorithm can be the foundation for further intelligent decision in distributed intrusion detection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Trellis-SDP: A simple data-parallel programming interface

Trellis-SDP: A simple data-parallel programming interface

引用

international conference on Parallel Processing Workshops (ICPPW)

作者： Meng Ding P. Lu Department of Computing Science University of Alberta Edmonton AB Canada

Some datasets and computing environments are inherently distributed. For example, image data may be gathered and stored at different locations. Although data parallelism is a well-known computational model, there are few programming systems that are both easy to program (for simple applications) and can work across administrative domains. We have designed and implemented a simple programming system, called Trellis-SDP, that facilitates the rapid development of data-intensive applications. Trellis-SDP is layered on top of the Trellis infrastructure, a software system for creating overlay metacomputers: user-level aggregations of computer systems. Trellis-SDP provides a master-worker programming framework where the worker components can run self-contained, new or existing binary applications. We describe two interface functions, namely trellis scan() and trellis gather(), and show how easy it is to get reasonable performance with simple data-parallel applications, such as Content Based Image Retrieval (CBIR) and Parallel Sorting by Regular Sampling (PSRS).

关键词： Application software distributed computing Parallel processing Parallel programming Information retrieval Content based retrieval Sorting Workstations Wide area networks Communication system security

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 482 483 484 485 486 487 488 489 490 491 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：