检索结果-南通市图书馆

维普期刊数据库

Query Acceleration of Graph Databases by ID Caching Technology

在线全文

学校读者我要写书评

暂无评论

Journal of Electronic Science and Technology 2019年第1期17卷 41-50页

作者： Wei Jiang Hai-Bo Hu Liu-Gen Xu the School of Information and Software Engineering University of Electronic Science and Technology of China

In this paper, we approach the design of ID caching technology(IDCT) for graph databases, with the purpose of accelerating the queries on graph database data and avoiding redundant graph database query operations which will consume great computer resources. Traditional graph database caching technology(GDCT)needs a large memory to store data and has the problems of serious data consistency and low cache utilization. To address these issues, in the paper we propose a new technology which focuses on ID allocation mechanism and high-speed queries of ID on graph databases. Specifically, ID of the query result is cached in memory and data consistency is achieved through the real-time synchronization and cache memory adaptation. In addition, we set up complex queries and simple queries to satisfy all query requirements and design a mechanism of cache replacement based on query action time, query times, and memory capacity, thus improving the performance furthermore.Extensive experiments show the superiority of our techniques compared with the traditional query approach of graph databases.

关键词： Cache graph database query efficiency

维普期刊数据库

A Novel Robust Online Extreme Learning Machine for the Non-Gaussian Noise

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2023年第1期32卷 130-139页

作者： GU Jun ZOU Quanyi DENG Changhui WANG Xiaojun College of information engineering Dalian Ocean University school of software engineering South China University of Technology school of Management Science and engineering Dongbei University of Finance and Economics

Samples collected from most industrial processes have two challenges: one is contaminated by the non-Gaussian noise, and the other is gradually obsolesced.This feature can obviously reduce the accuracy and generalization of models. To handle these challenges, a novel method, named the robust online extreme learning machine(RO-ELM), is proposed in this paper, in which the least mean p-power criterion is employed as the cost function which is to boost the robustness of the ELM, and the forgetting mechanism is introduced to discard the obsolescence samples. To investigate the performance of the ROELM, experiments on artificial and real-world datasets with the non-Gaussian noise are performed, and the datasets are from regression or classification problems. Results show that the RO-ELM is more robust than the ELM, the online sequential ELM(OS-ELM) and the OSELM with forgetting mechanism(FOS-ELM). The accuracy and generalization of the RO-ELM models are better than those of other models for online learning.

关键词： Extreme learning machine (ELM) Online learning Non-Gaussian noise Obsolescence samples Least mean $\boldsymbol{p}$-power (LMP)

Hand Vein Recognition Algorithm Based on NMF with Sparsity and Clustering Property Constraints in Feature Mapping Space

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2019年第6期28卷 1184-1190页

作者： JIA Xu SUN Fuming LI Haojie CAO Yudong school of Electronics and information engineering Liaoning University of Technology school of software Technology Dalian University of Technology

Most of the existed vein features are lack of robustness to light intensity variation, and some algorithms rely on the specified vein data sets, which leads to the limitation of real applications. To solve the problems,we propose a novel vein recognition algorithm based on Nonnegative matrix factorization(NMF) with double regularization terms. The innovations of our algorithm are mainly reflected in the following two aspects: in order to improve feature robustness, a novel feature mapping function is designed to map the initial Histogram of oriented gradient(HOG) feature to a new space; to enhance the recognition performance, an effective NMF model is presented, which not only reduces feature dimension, but also optimizes the feature sparsity and clustering property simultaneously. Experiments show that the proposed algorithm can achieve satisfactory results in terms of False rejection rate(FRR) and False acceptance rate(FAR), which indicates that our algorithm is valuable for other classification problems.

关键词： Vein recognition Nonnegative matrix factorization(NMF) Mapping function Feature sparsity

Causality fields in nonlinear causal effect analysis

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of information Technology & Electronic engineering 2022年第8期23卷 1277-1286页

作者： Aiguo WANG Li LIU Jiaoyun YANG Lian LI school of Electronic information engineering Foshan UniversityFoshan 528225China school of Big Data&software engineering Chongqing UniversityChongqing 400044China school of Computer Science and information engineering Hefei University of TechnologyHefei 230009China

Compared with linear causality,nonlinear causality has more complex characteristics and content.In this paper,we discuss certain issues related to nonlinear causality with an emphasis on the concept of causality field.Based on widely used computation models and methods,we present some viewpoints and opinions on the analysis and computation of nonlinear causality and the identification problem of causality fields.We also reveal the importance and practical significance of nonlinear causality in handling complex causal inference problems via several specific examples.

关键词： field nonlinear viewpoint

维普期刊数据库

Physical-Layer Authentication via a Dynamic Scaling

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2020年第4期29卷 651-659页

作者： LI Min JIANG Shaoquan LIAO Yongjian Institute of information Security Mianyang Normal University School of Information and Software Engineering University of Electronic Science and Technology of China

Message authentication is a process that allows sender Alice to transmit a source state to receiver Bob such that the latter is assured of the authenticity.We study this problem in the physical-layer where the channel is degraded by a Rayleigh fading and a Gaussian noise.We propose an efficient construction for our problem.Our idea is to amplify a basic codeword of the source state with a small but dynamic scaling factor.This scaling factor is asymptotically 1.It thus essentially incurs no power expansion.Our authentication is achieved through a statistical test.Our scheme is provably secure and performs better than the related existing schemes.Further,our error analysis allows it to be realized with very practical parameters.

关键词： Physical-layer authentication information security Message authentication code

Repeated Inter-Session Network Coding Games with an Average Cost Share Pricing Mechanism in Congested Networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2015年第2期24卷 398-401页

作者： WANG Gang LENG Jie YUAN Cangzhou school of Electronic and information engineering Beihang University school of software Beihang University

It is important to analyze the efficiency of resource allocation with game theory in congested networks in which the users are selfish. The results are often obtained from a one-shot game, while in reality, the transmission is frequent and occurs more than once. We develop a repeated inter-session network coding game that is based on a novel Average cost share(ACS) pricing mechanism. The users choose repeated transmission rates and transmission modes between network coding and routing to maximize their own payoffs. The Price of anarchy(Po A)is adopted to analyze the efficiency of the resource allocation. Through considering different strategies for the multiusers at the next stage, we find that network coding can improve the efficiency of resource allocation in the congested networks. We discuss trigger strategies that keep players from routing at new stages.

关键词： Network coding(NC) Average cost sharing(ACS) Repeated games PoA

A multi-point collaborative DDoS defense mechanism for IIoT environment

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Digital Communications and Networks 2023年第2期9卷 590-601页

作者： Hongcheng Huang Peixin Ye Min Hu Jun Wu school of Communication and information engineering Chongqing University of Posts and TelecommunicationsChongqing400065China Chongqing engineering Research Center of Communication software Chongqing400065China

Nowadays,a large number of intelligent devices involved in the Industrial Internet of Things(IIoT)environment are posing unprecedented cybersecurity challenges.Due to the limited budget for security protection,the IIoT devices are vulnerable and easily compromised to launch Distributed Denial-of-Service(DDoS)attacks,resulting in disastrous results.Unfortunately,considering the particularity of the IIoT environment,most of the defense solutions in traditional networks cannot be directly applied to IIoT with acceptable security performance.Therefore,in this work,we propose a multi-point collaborative defense mechanism against DDoS attacks for IIoT.Specifically,for the single point DDoS defense,we design an edge-centric mechanism termed EdgeDefense for the detection,identification,classification,and mitigation of DDoS attacks and the generation of defense information.For the practical multi-point scenario,we propose a collaborative defense model against DDoS attacks to securely share the defense information across the network through the blockchain.Besides,a fast defense information sharing mechanism is designed to reduce the delay of defense information sharing and provide a responsive cybersecurity guarantee.The simulation results indicate that the identification and classification performance of the two machine learning models designed for EdgeDefense are better than those of the state-of-the-art baseline models,and therefore EdgeDefense can defend against DDoS attacks effectively.The results also verify that the proposed fast sharing mechanism can reduce the propagation delay of the defense information blocks effectively,thereby improving the responsiveness of the multi-point collaborative DDoS defense.

关键词： Industrial internet of things(IIoT) DDoS Deep learning Blockchain Edge computing

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 differences.The 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

Efficient and Secure Authentication Scheme with Conditional Privacy-Preserving for VANETs

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2016年第5期25卷 950-956页

作者： XIE Yong WU Libing ZHANG Yubo SHEN Jian school of Computer Science Wuhan University school of information and engineering Jingdezhen Ceramic Institute State Key Laboratory of software engineering Wuhan University school of Computer and software Nanjing University of Information Science and Technology

The goal of authentication scheme for Vehicular ad hoc networks(VANETs) is to ensure reliability and integrity of message. Due to the timeliness of traffic-related messages and the highly dynamic nature of VANETs, it still is a challenge to solve the three key issues simultaneously, i.e. security, efficiency and conditional privacy-preserving, on the design of authentication scheme for VANETs. To address this challenge, an efficient Conditional privacy-preserving authentication(CPPA) scheme is proposed in this paper. Compared with the most recent proposed CPPA schemes, our proposed scheme markedly decreases the computation costs of the message-signing phase and the message verification phase, while satisfies all security requirements of VANETs and provides conditional privacy-preserving.

关键词： VANETs Authentication scheme Security Conditional privacy-preservation Efficiency