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

5th International Conference on information Assurance and Security, IAS 2009

作者： Fan, Kai Li, Hui Wang, Yue Ministry of Edu. Key Lab. of Computer Network and Information Security Xidian University Xi'an Shaanxi China Xi'an Branch of Shaanxi Telecom Ltd. Xi'an Shaanxi China

ISBN: (纸本)9780769537443

Kerberos protocol is a famous identity authentication protocol and it is widely used in the network as a standard. But there is still not a strict proof of it base on the Formal method. That is very nervous for the users. So a security analysis of the Kerberos protocol using BAN logic is proposed in this paper, and the reliability, practicability and security of Kerberos protocol are proved. © 2009 IEEE.

关键词： Formal methods

来源：评论

学校读者我要写书评

暂无评论

Clock Synchronization in Mobile Ad Hoc networks Based on an Iterative Approximate Byzantine Consensus Protocol

Clock Synchronization in Mobile Ad Hoc Networks Based on an ...

引用

International Conference on Advanced information networking and Applications (AINA)

作者： Chuanyou Li Yun Wang Michel Hurfin Ministry of Education Key Lab of Computer Network & Information Integration Nanjing China Inria Rennes France

We consider the clock synchronization problem in wireless mobile ad hoc networks in the presence of Byzantine nodes. The communication topology is dynamic: nodes move randomly within a geographical area. We propose a clock synchronization protocol which is based on the linear approximate consensus method. Periodically each correct node broadcasts its current timestamp and gathers the timestamps provided by its current neighbors. To cope with the malicious nodes (and to improve the performance when the node density is low), each node keeps the collected timestamps in a local log. As a log may contain values received more or less recently, a transformation technique is introduced to refresh the outdated values. The accuracy of the synchronisation depends on the connectivity among the moving nodes. We use a matrix and vector based representation to model the behavior of the synchronization process and to analyze its accuracy. We show that the deviation between the different clock values can converge towards zero when a particular condition is satisfied infinitely often. The frequency at which the condition is satisfied also impacts the synchronization accuracy. Based on a particular mobility scenario, performance simulations are conducted.

关键词： Synchronization Clocks Vectors Ad hoc networks Protocols Accuracy Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Highly Compact Virtual Counters for Per-Flow Traffic Measurement through Register Sharing

Highly Compact Virtual Counters for Per-Flow Traffic Measure...

引用

IEEE Global Communications Conference

作者： You Zhou Yian Zhou Min Chen Qingjun Xiao Shigang Chen Department of Computer & Information Science & Engineering University of Florida Key Lab of Computer Network and Information Integration Southeast University Ministry of Education

ISBN: (纸本)9781509013296

Per-flow traffic measurement is a fundamental problem in the era of big network data, providing critical information for many practical applications including capacity planning, traffic engineering, data accounting, resource management, and scan/intrusion detection in modern computer networks. It is challenging to design highly compact data structures for approximate per-flow measurements. In this paper, we show that a highly compact virtual counter architecture can achieve fast processing speed (slightly more than 1 memory access per packet) and provide accurate measurement results under tight memory allocation. Extensive experiments based on real network trace data demonstrate its superior performance over the best existing work.

关键词： Radiation detectors Registers Estimation Memory management Time measurement Encoding

来源：评论

学校读者我要写书评

暂无评论

On accuracy rate of community detection and pairing in mobile social network

On accuracy rate of community detection and pairing in mobil...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, UIC-ATC

作者： Jinbin Tu Qing Li Yun Wang School of Computer Science and Engineering Southeast University Key Lab of Computer Network and Information Integration Nanjing MOE China

Mobile Social network(MSN) is an opportunity network that considers the social attributes of nodes, and also uses the ”store-carry-forward” model to carry out data transfer between nodes. The community nature of nodes is an important reference in MSN to select messaging path. In this paper, a new community cluster problem based on our observed pickup strategies for car-hailing is proposed, which is involving community detection and community pairing. Then we formulate it by using T-Sorokin mobility model. The Cluster-First algorithm and Pair-First algorithm are proposed based on the defined community dependency metric to maximize the accuracy rate. Simulation experimental results show that both CFA and PFA can effectively solve this problem with an accuracy rate of over 70%. And it is concluded that cluster-first is superior to pair-first for this considered problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of UAV Deployment and Task Computation Offloading Decision in UAV-assisted Edge Computing network

Joint Optimization of UAV Deployment and Task Computation Of...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Yichuan Liu Jinbin Tu Yun Wang Key Lab of Computer Network and Information Integration MOE School of Computer Science and Engineering Southeast University Nanjing China

The UAVs' deployment decision and task computation offloading decision in the UAV-assisted edge computing network significantly impact the operating efficiency of edge network. On the basis of this, the Optimization Model for UAV Cluster Deployment and Computation Offloading Decision (OMUCDCOD) is established. The model jointly optimizes the number, location of UAV s, and task computation offloading decision. Different from previous studies, this model regards the terminal devices in the edge network as virtual MEC servers, and introduces the collab.rative computing mode. The task computation offloading decision made can effectively utilize the computing capabilities offered by the edge network. Considering that the two problems of UAV deployment decision and task computation offloading decision are intricately interconnected, we propose a two-layer optimization algorithm combining K-Means and ant colony algorithm (ToKmAc) to solve OMUCDCOD. ToKmAc is divided into upper and lower layers to solve this optimization problem. The upper layer uses K-Means to solve the UAV deployment decision, that is, the number and location of UAVS; the lower layer employs ant colony algorithm to solve computation offloading decision. Finally, extensive experiments verify the effectiveness of OMUCDCOD and ToKmAc.

关键词：

来源：评论

学校读者我要写书评

暂无评论

New construction of single-and multi-output Boolean functions with high algebraic immunity

New construction of single-and multi-output Boolean function...

引用

作者： He, Yefeng Ma, Wenping Ministry of Education Key Lab. of Computer Network and Information Security Xidian University Xi'an 710071 China School of Communication and Information Engineering Xi'an Institute of Post and Telecommunications Xi'an 710121 China

ISBN: (纸本)9789881701282

In order to respond to algebraic attacks, it is important to construct Boolean functions with high algebraic immunity of the graphs. In this paper, the complicated problem of algebraic immunity of the graph is converted to the simpler problem of annihilators of the single-output assistant function. Based on this, we propose a new method for constructing single-and multi-output Boolean functions with high algebraic immunity of the graphs. This method can also give many more general single-output Boolean functions with maximum algebraic immunity.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

T-Sorokin: A General Mobility Model in Opportunistic networks

T-Sorokin: A General Mobility Model in Opportunistic Network...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Jinbin Tu Qing Li Yun Wang School of Computer Science and Engineering Southeast University Key Lab of Computer Network and Information Integration MOE Nanjing China

The opportunistic networks are a kind of ad hoc networks that rely on the chance of nodes meeting to transmit messages. Acting as an effective supplement to 4G and 5G networks in some special scenarios where hardware devices are limited, the opportunistic networks have a significant application in health monitoring, warning broadcasting, disaster relief, and so on. The mobility model is one of the research focuses on the opportunistic networks. On the basis of the social mobility theory proposed by Sorokin, a general mobility model, which is suited for various scenarios, called T-Sorokin is proposed. This model is described as a seven-tuple and implemented on the Opportunistic network Environment simulator and fits both Infocom06 and Rome taxi data set, which includes different areas ranging from hotel to city and different mobile units ranging from person to taxi. The results of experiments demonstrate that the T-Sorokin model has the advantage of generality, simplicity, and accuracy. It can simply establish movement tracks close to real data under different scenarios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Non-Intrusive and Real-Time Data Provenance Method for DDS Systems

A Non-Intrusive and Real-Time Data Provenance Method for DDS...

引用

International Conference on Mobile Ad-hoc and Sensor networks, MSN

作者： Siyi Wei Jinbin Tu Yun Wang School of Computer Science and Engineering Southeast University Key Lab of Computer Network and Information Integration MOE Nanjing China

ISBN: (数字)9798350358261

ISBN: (纸本)9798350358278

In the era of big data, because of the escalating data security threats, the importance of data provenance is widely recognized. It facilitates the tracking of data origins and evolution, improving the ability to diagnose errors and detect potential malicious attacks within large-scale software systems. However, conventional log-based provenance methods usually collect data intrusively, leading to strong coupling with the system. Meanwhile, although there are some log-based provenance systems that support runtime analysis, they exhibit inadequate real-time analysis performance. This paper proposes a non-intrusive and real-time approach to data provenance in DDS systems. The data capture is achieved with the help of the Data-Centric Publisher-Subscriber model of DDS, thus avoiding source code modification to the existing system. The collected data is then described in PROV-DDS model to generate RDF data. RDF datasets inherently form a directed and lab.led graph. The query over RDF datasets is decomposed into start subqueries to speed up processing with star subgraph signature. The experimental results show that our method provenances effectively with less than 1% time overhead and a lower query response time than RDF-3X and Redland.

关键词： Runtime Source coding Data security Stars Software systems Resource description framework Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Walsh spectrum of cryptographically concatenating functions and its applications in constructing resilient Boolean functions

引用

Journal of Computational information Systems 2011年第4期7卷 1074-1081页

作者： Gao, Sheng Ma, Wenping Zhao, Yongbin Zhuo, Zepeng Key Lab. of Computer Network and Information Security Ministry of Education Xidian University Xi'an 710071 China

Resilient Boolean functions have many applications in fault-tolerant distributed computing and quantum cryptographic key. Construction of this class functions with more cryptographic criteria such as high nonlinearity and high algebraic degree is an important problem in design of the stream cipher systems. As is known to all, the Walsh spectrum is the fundamental tool in analysis of cryptographic Boolean functions. In this paper, we use the Walsh transform as a basic tool to investigate cryptographic functions. Firstly, the exact Walsh spectrum relationship between a Boolean function and its subfunctions is obtained. Then by using this result, we propose a novel method of constructing new disjoint spectra functions from the old ones. Furthermore, an algorithm for recursively constructing highly nonlinear resilient functions is presented, which is suitable for parallel processing. The experimental results show the correctness and efficiency of the proposed algorithm. Copyright © 2011 Binary information Press.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Analysis of the paragraph vector model for information retrieval 16

Analysis of the paragraph vector model for information retri...

引用

2016 ACM International Conference on the Theory of information Retrieval, ICTIR 2016

作者： Ai, Qingyao Yang, Liu Guo, Jiafeng Croft, W. Bruce College of Information and Computer Sciences University of Massachusetts Amherst AmherstMA United States CAS Key Lab. of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9781450344975

Previous studies have shown that semantically meaningful representations of words and text can be acquired through neural embedding models. In particular, paragraph vector (PV) models have shown impressive performance in some natural language processing tasks by estimating a document (topic) level language model. Integrating the PV models with traditional language model approaches to retrieval, however, produces unstable performance and limited improvements. In this paper, we formally discuss three intrinsic problems of the original PV model that restrict its performance in retrieval tasks. We also describe modifications to the model that make it more suitable for the IR task, and show their impact through experiments and case studies. The three issues we address are (1) the unregulated training process of PV is vulnerable to short document overfitting that produces length bias in the final retrieval model;(2) the corpus-based negative sampling of PV leads to a weighting scheme for words that overly suppresses the importance of frequent words;and (3) the lack of word-context information makes PV unable to capture word substitution relationships. © 2016 ACM.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：