检索结果-南通市图书馆

维普期刊数据库

Further ideal multipartite access structures from integer polymatroids

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2015年第7期58卷 159-171页

作者： WANG YuJue WU QianHong WONG Duncan S. QIN Bo MU Yi LIU JianWei school of computer Science Wuhan University school of computer Science and software Engineering University of Wollongong school of Electronics and Information Engineering Beihang University school of Information Renmin University of China Department of computer Science City University of Hong Kong

Ideal access structures admit ideal secret sharing schemes where the shares have the minimal *** multipartite access structures can well mirror the real social organizations, of which the participants are partitioned into disjoint groups according to their properties, it is desirable to find expressive ideal multipartite access structures. Integer polymatroids, due to their close relationship with ideal multipartite access structures,have been shown as a powerful tool to study the ideality of some multipartite access structures. In this paper, to cater for flexible applications, we consider several ideal multipartite access structures that further extend some known results. We first explore a type of compartmented access structures with strictly lower bounds, which provide fairness among all the participant groups when recovering the secret. Then, we investigate ideal bench access structures where the participant set is divided into two parts, that is, line-up section and bench *** participants in line-up section can delegate their capabilities to the participants in bench section in such a way that the participants in bench section can take over the role of their delegators in line-up section, which is applicable to emergency situations when there are no enough participants in line-up section for recovering the secret. Finally, we propose two types of ideal partially hierarchical access structures which are suitable to more realistic hierarchical social organizations than existing results.

关键词： secret sharing access structure multipartite secret sharing polymatroids matroids linear programming

Discriminative fine-grained network for vehicle re-identification using two-stage re-ranking

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2020年第11期63卷 147-158页

作者： Qi WANG Weidong MIN Daojing HE Song ZOU Tiemei HUANG Yu ZHANG Ruikang LIU school of Information Engineering Nanchang University school of software Nanchang University Jiangxi Key Laboratory of Smart City Nanchang University school of computer Science and software Engineering East China Normal University

Research on the application of vehicle re-identification to video surveillance has attracted increasingly growing attention. Existing methods are associated with the difficulties of distinguishing different instances of the same car model owing to the incapability of recognizing subtle differences among these instances and the possibility that a subtle difference may lead to incorrect results of ranking. In this paper, a discriminative fine-grained network for vehicle re-identification based on a two-stage re-ranking framework is proposed to address these issues. This discriminative fine-grained network(DFN) is composed of fine-grained and Siamese networks. The proposed hybrid network can extract discriminative features of the vehicle instances with subtle differences. The Siamese network is rather suitable for general object re-identification using two streams of the network, while the fine-grained network is capable of detecting subtle *** proposed two-stage re-ranking method allows obtaining a more reliable ranking list by using the Jaccard metric and merging the first and second re-ranking lists, where the latter list is formed using the sample mean feature. Experimental results on the VeR i-776 and VehicleID datasets show that the proposed method achieves the superior performance compared to the state-of-the-art methods used in vehicle re-identification.

关键词： vehicle re-identification DFN two-stage re-ranking fine-grained Jaccard metric

Intelligent Agent-Based System for Digital Library Information Retrieval

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Beijing Institute of Technology 2003年第4期12卷 450-454页

作者：师雪霖牛振东宋瀚涛宋丽哲 Department of computer Science and Engineering school of software

A new information search model is reported and the design and implementation of a system based on intelligent agent is presented. The system is an assistant information retrieval system which helps users to search what they need. The system consists of four main components: interface agent, information retrieval agent, broker agent and learning agent. They collaborate to implement system functions. The agents apply learning mechanisms based on an improved ID3 algorithm.

关键词： intelligent agent information retrieval agent cooperation machine learning

维普期刊数据库

An index-split Bloom filter for deep packet inspection

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2011年第1期54卷 23-37页

作者： HUANG Kun1 & ZHANG DaFang1,2 1school of computer and Communication,Hunan University,Changsha 410082,China 2 school of software,Hunan University,Changsha 410082,China school of computer and Communication Hunan University Changsha China school of software Hunan University Changsha China

Deep packet inspection(DPI)scans both packet headers and payloads to search for predefined *** link rates and traffc volumes of Internet are constantly growing,DPI is facing the high performance challenge of how to achieve line-speed packet processing with limited embedded *** recent trie bitmap content analyzer(TriBiCa)suffers from high update overhead and many false positive memory accesses,while the shared-node fast hash table(SFHT)suffers from high update overhead and large memory *** paper presents an index-split Bloom filter(ISBF)to overcome these *** a set of off-chip items,an index of each item is split apart into several groups of constant bits,and each group of bits uses an array of on-chip parallel counting Bloom filters(CBFs)to represent the overall off-chip *** an item is queried,several groups of on-chip parallel CBFs constitute an index of an off-chip item candidate for a ***, we propose a lazy deletion algorithm and vacant insertion algorithm to reduce the update overhead of ISBF, where an on-chip deletion bitmap is used to update on-chip parallel CBFs,not adjusting other related off-chip *** ISBF is a time/space-effcient data structure,which not only achieves O(1)average memory accesses of insertion,deletion,and query,but also reduces the memory *** results demonstrate that compared with the TriBiCa and SFHT,the ISBF significantly reduces the off-chip memory accesses and processing time of primitive operations,as well as both the on-chip and off-chip memory sizes.

关键词： network security packet processing deep packet inspection hash table Bloom filter

An Active Defense Solution for ARP Spoofing in OpenFlow Network

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2019年第1期28卷 172-178页

作者： XIA Jing CAI Zhiping HU Gang XU Ming College of computer National University of Defense Technology school of computer and software Nanjing University of Information Science & Technology

As an emerging network technology,software-defined network(SDN), has been rapidly developing for recent years due to its advantage in network management and updating. There are still a lot of open problems while applying this novel technology in reality,especially for meeting security demands. The Address resolution protocol(ARP) spoofing, a representative network attack in traditional networks is *** implement the ARP spoofing in SDN network firstly and find that the threat of ARP attack still exists and has big impact on the network. We propose a novel mechanism as defense solution for ARP spoofing oriented to OpenFlow platform. Theoretical analyzation is given, and the mechanism is implemented as a module of POX controller. Experiment results and performance evaluations show that our solution can reduce the security threat of ARP spoofing remarkably on OpenFlow platform and related SDN platforms.

关键词： software-defined network(SDN) Address resolution protocol(ARP) spoofing OpenFlow

Efficient Quantum Secure Direct Communication with Authentication

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Physics Letters 2008年第7期25卷 2354-2357页

作者：刘文杰陈汉武李志强刘志昊 school of computer Science and Engineering Southeast University Nanjing 210096 school of computer and software Nanjing University of Information Science and Technology Nanjing 210044

Two protocols of quantum direct communication with authentication [Phys. Rev. A 73 （2006） 042305] were recently indicated to be insecure against the authenticator Trent attacks [Phys. Rev. A 75 （2007） 026301]. We present two efficient protocols by using four Panli operations, which are secure against inner Trent attacks as well as outer Eve attacks. Finally, we generalize them to multiparty quantum direction communication.

关键词： KEY DISTRIBUTION ENTANGLEMENT PHOTONS STATES

A novel mapping algorithm for three-dimensional network on chip based on quantum-behaved particle swarm optimization

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of computer Science 2017年第4期11卷 622-631页

作者： Cui HUANG Dakun ZHANG Guozhi SONG school of computer Science and software Engineering Tianjin Polytechnic University Tianjin 300387 China

Mapping of three-dimensional network on chip is a key problem in the research of three-dimensional network on chip. The quality of the mapping algorithm used di- rectly affects the communication efficiency between IP cores and plays an important role in the optimization of power consumption and throughput of the whole chip. In this paper, ba- sic concepts and related work of three-dimensional network on chip are introduced. Quantum-behaved particle swarm op- timization algorithm is applied to the mapping problem of three-dimensional network on chip for the first time. Sim- ulation results show that the mapping algorithm based on quantum-behaved particle swarm algorithm has faster con- vergence speed with much better optimization performance compared with the mapping algorithm based on particle swarm algorithm. It also can effectively reduce the power consumption of mapping of three-dimensional network on chip.

关键词： three-dimensional network on chip mapping al-gorithm quantum-behaved particle swarm optimization al-gorithm particle swarm optimization algorithm low powerconsumption

Weakly supervised 2D human pose transfer

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2021年第11期64卷 36-51页

作者： Qian ZHENG Yajie LIU Zhizhao LIN Dani LISCHINSKI Daniel COHEN-OR Hui HUANG College of computer Science and software Engineering Shenzhen University school of computer Science and Engineering The Hebrew University of Jerusalem

We present a novel method for pose transfer between two 2 D human skeletons. When the bone lengths and proportions between the two skeletons are significantly different, pose transfer becomes a challenging task, which cannot be accomplished by simply copying the joint positions or the bone *** data-driven approach utilizes a deep neural network trained, in a weakly supervised fashion, to encode a skeleton into two separate latent codes, one representing its pose, and another representing the skeleton’s proportions(skeleton-ID). The network is given two skeletons, and learns to combine the pose of one with the skeleton-ID of the other. Lacking supervision on the poses, we develop a novel loss that qualitatively compares poses of different skeletons. We evaluate the performance of our method on a large set of *** advantages of avoiding supervision are demonstrated by showing transfer of extreme poses, as well as between uncommon skeleton proportions.

关键词： pose transfer weak supervision human skeleton

LTL Formulae to Bchi Automata Translation Using on-the-Fly De-generalization

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2015年第4期24卷 674-678页

作者： SHAN Laixiang QIN Zheng Department of computer Science and Technology Tsinghua University school of software Tsinghua University

In this paper, we present a conversion algorithm to translate a Linear temporal logic(LTL) formula to a Bu¨chi automaton(BA) directly. Acceptance degree(AD) is presented to record acceptance conditions satisfied in each state and transition of the BA. According to AD, on-the-fly de-generalization algorithm, which is different from the standard de-generalization algorithm, is conceived and implemented. On-the-fly de-generalization algorithm is performed in the case of the given LTL formula containing U-subformulae or F-subformulae, that is,it is performed as required during the expansion of the given LTL formula. We compare the conversion algorithm presented in this paper to previous works, and show that it is more efficient for a series of LTL formulae in common use.

关键词： Formal method Model checking Linear temporal logic On-the-fly de-generalization