Wireless Sensor Networks (WSNs) are becoming an integral part of our lives. There are not widespread applications of WSNs without ensuring WSNs security. Due to the limited capabilities of sensor nodes in terms of com...
详细信息
Though many hierarchical structures have been proposed to analyze the finer or coarser relationships between two granulation spaces, these structures can only be used to compare the single granulation spaces. However,...
详细信息
Though many hierarchical structures have been proposed to analyze the finer or coarser relationships between two granulation spaces, these structures can only be used to compare the single granulation spaces. However, it should be noticed that the concept of multigranulation plays a fundamental role in the development of granular computing. Therefore, the comparison between two multigranulation spaces has become a necessity. To solve such problem, two types of the multigranulation spaces are considered: one is the partition-based multigranulation space, the other is the covering-based multigranulation space. Three different hierarchical structures are then proposed on such two multigranulation spaces, respectively. Not only the properties about these hierarchical structures are discussed, but also the relationships between these hierarchical structures and the multigranulation rough sets are deeply investigated. It is shown that the first hierarchical structure is consistent with the monotonic varieties of optimistic multigranulation rough set, and the second hierarchical structure is consistent to the monotonic varieties of pessimistic multigranulation rough set, the third hierarchical structure is consistent to the monotonic varieties of both optimistic and pessimistic multigranulation rough sets.
As non-cooperation behaviors such as free-riding do not seems to have been checked according to a recent survey of Gnutella network [3], it hereby calls for more attention to this issue and more efforts in our future ...
详细信息
As security is becoming a significant obstacle to wider deployment of wireless LANs, IEEE 802.1x and EAPoW has been put forward to enhance authentication in WLAN. At present, some existing client solution such as Xsup...
详细信息
An improved volumetric compression algorithm is presented in this paper. Histogram technique is used for analyzing the trait of volume data. The volume data is then partitioned into volume bricks which will be classif...
详细信息
In rice production,the prevention and management of pests and diseases have always received special *** methods require human experts,which is costly and *** to the complexity of the structure of rice diseases and pes...
详细信息
In rice production,the prevention and management of pests and diseases have always received special *** methods require human experts,which is costly and *** to the complexity of the structure of rice diseases and pests,quickly and reliably recognizing and locating them is ***,deep learning technology has been employed to detect and identify rice diseases and *** paper introduces common publicly available datasets;summarizes the applications on rice diseases and pests from the aspects of image recognition,object detection,image segmentation,attention mechanism,and few-shot learning methods according to the network structure differences;and compares the performances of existing ***,the current issues and challenges are explored fromthe perspective of data acquisition,data processing,and application,providing possible solutions and *** study aims to review various DL models and provide improved insight into DL techniques and their cutting-edge progress in the prevention and management of rice diseases and pests.
The Inner Product Masking(IPM)scheme has been shown to provide higher theoretical security guarantees than the BooleanMasking(BM).This scheme aims to increase the algebraic complexity of the coding to achieve a higher...
详细信息
The Inner Product Masking(IPM)scheme has been shown to provide higher theoretical security guarantees than the BooleanMasking(BM).This scheme aims to increase the algebraic complexity of the coding to achieve a higher level of *** previous work unfolds when certain(adversarial and implementation)conditions are met,and we seek to complement these investigations by understanding what happens when these conditions deviate from their expected *** this paper,we investigate the security characteristics of IPM under different *** adversarial condition,the security properties of first-order IPMs obtained through parametric characterization are preserved in the face of univariate and bivariate *** implementation condition,we construct two new polynomial leakage functions to observe the nonlinear leakage of the IPM and connect the security order amplification to the nonlinear *** observe that the security of IPMis affected by the degree and the linear component in the leakage *** addition,the comparison experiments from the coefficients,signal-to-noise ratio(SNR)and the public parameter show that the security properties of the IPM are highly implementation-dependent.
The main challenges in face swapping are the preservation and adaptive superimposition of attributes of two *** this study,the Face Swapping Attention Network(FSA-Net)is proposed to generate photoreal-istic face *** e...
详细信息
The main challenges in face swapping are the preservation and adaptive superimposition of attributes of two *** this study,the Face Swapping Attention Network(FSA-Net)is proposed to generate photoreal-istic face *** existing face-swapping methods ignore the blending attributes or mismatch the facial keypoint(cheek,mouth,eye,nose,etc.),which causes artifacts and makes the generated face silhouette *** address this problem,a novel reinforced multi-aware attention module,referred to as RMAA,is proposed for handling facial fusion and expression occlusion *** framework includes two *** the first stage,a novel attribute encoder is proposed to extract multiple levels of target face attributes and integrate identities and attributes when synthesizing swapped *** the second stage,a novel Stochastic Error Refinement(SRE)module is designed to solve the problem of facial occlusion,which is used to repair occlusion regions in a semi-supervised way without any *** proposed method is then compared with the current state-of-the-art *** obtained results demonstrate the qualitative and quantitative outperformance of the proposed *** details are provided at the footnote link and at https://***/view/fsa-net-official.
Correlation power analysis(CPA)combined with genetic algorithms(GA)now achieves greater attack efficiency and can recover all subkeys ***,two issues in GA-based CPA still need to be addressed:key degeneration and slow...
详细信息
Correlation power analysis(CPA)combined with genetic algorithms(GA)now achieves greater attack efficiency and can recover all subkeys ***,two issues in GA-based CPA still need to be addressed:key degeneration and slow evolution within *** challenges significantly hinder key recovery *** paper proposes a screening correlation power analysis framework combined with a genetic algorithm,named SFGA-CPA,to address these ***-CPA introduces three operations designed to exploit CPA characteris-tics:propagative operation,constrained crossover,and constrained ***,the propagative operation accelerates population evolution by maximizing the number of correct bytes in each ***,the constrained crossover and mutation operations effectively address key degeneration by preventing the compromise of correct ***,an intelligent search method is proposed to identify optimal parameters,further improving attack *** were conducted on both simulated environments and real power traces collected from the SAKURA-G *** the case of simulation,SFGA-CPA reduces the number of traces by 27.3%and 60%compared to CPA based on multiple screening methods(MS-CPA)and CPA based on simple GA method(SGA-CPA)when the success rate reaches 90%.Moreover,real experimental results on the SAKURA-G platform demonstrate that our approach outperforms other methods.
Both preference logics and preference representation in logic programming are concerned with reasoning about preferences on combinatorial domains, yet little research has been published using preference axioms in logi...
详细信息
暂无评论