检索结果-南通市图书馆

A robust tensor watermarking algorithm for diffusion-tensor images

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic Engineering 2024年第3期25卷 384-397页

作者： Chengmeng LIU Zhi LI Guomei WANG Long ZHENG State key laboratory of Public big data College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China

Watermarking algorithms that use convolution neural networks have exhibited good robustness in studies of deep learning ***,after embedding watermark signals by convolution,the feature fusion eficiency of convolution is relatively low;this can easily lead to distortion in the embedded *** distortion occurs in medical images,especially in diffusion tensor images(DTIs),the clinical value of the DTI is *** address this issue,a robust watermarking algorithm for DTIs implemented by fusing convolution with a Transformer is proposed to ensure the robustness of the watermark and the consistency of sampling distance,which enhances the quality of the reconstructed image of the watermarked DTIs after embedding the watermark *** the watermark-embedding network,Ti-weighted(Tlw)images are used as prior *** correlation between T1w images and the original DTI is proposed to calculate the most significant features from the T1w images by using the Transformer *** maximum of the correlation is used as the most significant feature weight to improve the quality of the reconstructed *** the watermark extraction network,the most significant watermark features from the watermarked DTI are adequately learned by the Transformer to robustly extract the watermark signals from the watermark *** results show that the average peak signal-to-noise ratio of the watermarked DTI reaches 50.47 dB,the diffusion characteristics such as mean diffusivity and fractional anisotropy remain unchanged,and the main axis deflection angleαAc is close to *** proposed algorithm can effectively protect the copyright of the DTI and barely affects the clinical diagnosis.

关键词： Robust watermarking algorithm Transformer Image reconstruction Diffusion tensor images Soft attention Hard attention Tl-weighted images

Blockchain-Based key Management Scheme Using Rational Secret Sharing

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第4期79卷 307-328页

作者： Xingfan Zhao Changgen Peng Weijie Tan Kun Niu State key laboratory of Public big data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China Guizhou big data Academy Guizhou UniversityGuiyang550025China

Traditional blockchain key management schemes store private keys in the same location,which can easily lead to security issues such as a single point of ***,decentralized threshold key management schemes have become a research focus for blockchain private key *** security of private keys for blockchain user wallet is highly related to user identity authentication and digital asset *** threshold blockchain private key management schemes based on verifiable secret sharing have made some progress,but these schemes do not consider participants’self-interested behavior,and require trusted nodes to keep private key fragments,resulting in a narrow application scope and low deployment efficiency,which cannot meet the needs of personal wallet private key escrow and recovery in public *** design a private key management scheme based on rational secret sharing that considers the self-interest of participants in secret sharing protocols,and constrains the behavior of rational participants through reasonable mechanism design,making it more suitable in distributed scenarios such as the public *** proposed scheme achieves the escrow and recovery of personal wallet private keys without the participation of trusted nodes,and simulate its implementation on smart *** to other existing threshold wallet solutions and keymanagement schemes based on password-protected secret sharing(PPSS),the proposed scheme has a wide range of applications,verifiable private key recovery,low communication overhead,higher computational efficiency when users perform one-time multi-key escrow,no need for trusted nodes,and personal rational constraints and anti-collusion attack capabilities.

关键词： Blockchain smart contract rational secret sharing key management

Towards sustainable adversarial training with successive perturbation generation

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic Engineering 2024年第4期25卷 527-539页

作者： Wei LIN Lichuan LIAO College of Computer Science and Mathematics Fujian University of TechnologyFuzhou 350118China College of Economics and Management Xi’an University of TechnologyXi’an 710048China Fujian Provincial key laboratory of big data Mining and applications Fujian University of TechnologyFuzhou 350118China

Adversarial training with online-generated adversarial examples has achieved promising performance in defending adversarial attacks and improving robustness of convolutional neural network ***,most existing adversarial training methods are dedicated to finding strong adversarial examples for forcing the model to learn the adversarial data distribution,which inevitably imposes a large computational overhead and results in a decrease in the generalization performance on clean *** this paper,we show that progressively enhancing the adversarial strength of adversarial examples across training epochs can effectively improve the model robustness,and appropriate model shifting can preserve the generalization performance of models in conjunction with negligible computational *** this end,we propose a successive perturbation generation scheme for adversarial training(SPGAT),which progressively strengthens the adversarial examples by adding the perturbations on adversarial examples transferred from the previous epoch and shifts models across the epochs to improve the efficiency of adversarial *** proposed SPGAT is both efficient and effective;e.g.,the computation time of our method is 900 min as against the 4100 min duration observed in the case of standard adversarial training,and the performance boost is more than 7%and 3%in terms of adversarial accuracy and clean accuracy,*** extensively evaluate the SPGAT on various datasets,including small-scale MNIST,middle-scale CIFAR-10,and large-scale *** experimental results show that our method is more efficient while performing favorably against state-of-the-art methods.

关键词： Adversarial training Adversarial attack Stochastic weight average Machine learning Model generalization

Uncertain knowledge graph embedding:an effective method combining multi-relation and multi-path

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2024年第3期18卷 73-89页

作者： Qi LIU Qinghua ZHANG Fan ZHAO Guoyin WANG key laboratory of Tourism Multisource data Perception and Decision Ministry of Culture and TourismChongqing University of Posts and TelecommunicationsChongqing 400065China Chongqing key laboratory of Computational Intelligence Chongqing University of Posts and TelecommunicationsChongqing 400065China Chongqing key laboratory of big data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqing 400065China

Uncertain Knowledge Graphs(UKGs)are used to characterize the inherent uncertainty of knowledge and have a richer semantic structure than deterministic knowledge *** research on the embedding of UKG has only recently begun,Uncertain Knowledge Graph Embedding(UKGE)model has a certain effect on solving this ***,there are still unresolved *** the one hand,when reasoning the confidence of unseen relation facts,the introduced probabilistic soft logic cannot be used to combine multi-path and multi-step global information,leading to information *** the other hand,the existing UKG embedding model can only model symmetric relation facts,but the embedding problem of asymmetric relation facts has not be *** address the above issues,a Multiplex Uncertain Knowledge Graph Embedding(MUKGE)model is proposed in this ***,to combine multiple information and achieve more accurate results in confidence reasoning,the Uncertain ResourceRank(URR)reasoning algorithm is ***,the asymmetry in the UKG is *** embed asymmetric relation facts of UKG,a multi-relation embedding model is ***,experiments are carried out on different datasets via 4 tasks to verify the effectiveness of *** results of experiments demonstrate that MUKGE can obtain better overall performance than the baselines,and it helps advance the research on UKG embedding.

关键词： knowledge representation uncertain knowledge graph multi-relation embedding uncertain reasoning

Changes in Spring Snow Cover over the Eastern and Western Tibetan Plateau and Their Associated Mechanism

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Advances in Atmospheric Sciences 2024年第5期41卷 959-973页

作者： Fangchi LIU Xiaojing JIA Wei DONG key laboratory of Geoscience big data and Deep Resource of Zhejiang Province School of Earth SciencesZhejiang UniversityHangzhouZhejiang 310058China

The spring snow cover(SC)over the western Tibetan Plateau(TP)(TPSC)(W_TPSC)and eastern TPSC(E_TPSC)have displayed remarkable decreasing and increasing trends,respectively,during 1985–*** current work investigates the possible mechanisms accounting for these distinct TPSC *** results indicate that the decrease in W_TPSC is primarily attributed to rising temperatures,while the increase in E_TPSC is closely linked to enhanced *** circulation analysis shows that the essential system responsible for the TPSC changes is a significant anticyclonic system centered over the northwestern *** anomalous descending motion and adiabatic heating linked to this anticyclone leads to warmer temperatures and consequent snowmelt over the western ***,anomalous easterly winds along the southern flank of this anticyclone serve to transport additional moisture from the North Pacific,leading to an increase in snowfall over the eastern *** analysis reveals that the anomalous anticyclone is associated with an atmospheric wave pattern that originates from upstream *** warming of the subtropical North Atlantic(NA)sea surface temperature(SST)induces an atmospheric pattern resembling a wave train that travels eastward across the Eurasian continent before reaching the ***,the decline in winter sea ice(SIC)over the Barents Sea exerts a persistent warming influence on the atmosphere,inducing an anomalous atmospheric circulation that propagates southeastward and strengthens the northwest TP anticyclone in ***,an enhancement of subtropical stationary waves has resulted in significant increases in easterly moisture fluxes over the coastal areas of East Asia,which further promotes more snowfall over eastern TP.

关键词： snow cover Tibetan Plateau long-term changes spring

Perpendicular-Cutdepth:Perpendicular Direction Depth Cutting data Augmentation Method

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第4期79卷 927-941页

作者： Le Zou Linsong Hu Yifan Wang Zhize Wu Xiaofeng Wang Anhui Provincial Engineering laboratory of big data Technology Application forUrban Infrastructure School ofArtificial Intelligence and Big DataHefei UniversityHefei230601China Institute of Applied Optimization School of Artificial Intelligence and Big DataHefei UniversityHefei230601China

Depth estimation is an important task in computer *** data at scale for monocular depth estimation is challenging,as this task requires simultaneously capturing RGB images and depth ***,data augmentation is crucial for this *** data augmentationmethods often employ pixel-wise transformations,whichmay inadvertently disrupt edge *** this paper,we propose a data augmentationmethod formonocular depth estimation,which we refer to as the Perpendicular-Cutdepth *** method involves cutting realworld depth maps along perpendicular directions and pasting them onto input images,thereby diversifying the data without compromising edge *** validate the effectiveness of the algorithm,we compared it with existing convolutional neural network(CNN)against the current mainstream data augmentation ***,to verify the algorithm’s applicability to Transformer networks,we designed an encoder-decoder network structure based on Transformer to assess the generalization of our proposed *** results demonstrate that,in the field of monocular depth estimation,our proposed method,Perpendicular-Cutdepth,outperforms traditional data *** the indoor dataset NYU,our method increases accuracy from0.900 to 0.907 and reduces the error rate from0.357 to *** the outdoor dataset KITTI,our method improves accuracy from 0.9638 to 0.9642 and decreases the error rate from 0.060 to 0.0598.

关键词： Perpendicular depth estimation data augmentation

Unsupervised social network embedding via adaptive specific mappings

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2024年第3期18卷 61-71页

作者： Youming GE Cong HUANG Yubao LIU Sen ZHANG Weiyang KONG School of Computer Science and Engineering Sun Yat-Sen UniversityGuangzhou 510275China Guangdong key laboratory of big data Analysis and Processing Guangzhou 510006China

In this paper,we address the problem of unsuperised social network embedding,which aims to embed network nodes,including node attributes,into a latent low dimensional *** recent methods,the fusion mechanism of node attributes and network structure has been proposed for the problem and achieved impressive prediction ***,the non-linear property of node attributes and network structure is not efficiently fused in existing methods,which is potentially helpful in learning a better network *** this end,in this paper,we propose a novel model called ASM(Adaptive Specific Mapping)based on encoder-decoder *** encoder,we use the kernel mapping to capture the non-linear property of both node attributes and network *** particular,we adopt two feature mapping functions,namely an untrainable function for node attributes and a trainable function for network *** the mapping functions,we obtain the low dimensional feature vectors for node attributes and network structure,***,we design an attention layer to combine the learning of both feature vectors and adaptively learn the node *** encoder,we adopt the component of reconstruction for the training process of learning node attributes and network *** conducted a set of experiments on seven real-world social network *** experimental results verify the effectiveness and efficiency of our method in comparison with state-of-the-art baselines.

关键词： network embedding specific kernel mapping attention mechanism

An Optimal Node Localization in WSN Based on Siege Whale Optimization Algorithm

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computer Modeling in Engineering & Sciences 2024年第3期138卷 2201-2237页

作者： Thi-Kien Dao Trong-The Nguyen Fujian Provincial key laboratory of big data Mining and applications Fujian University of TechnologyFuzhou350118China Multimedia Communication Lab University of Information TechnologyHo Chi Minh CityVietnam

Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand allocates the acquired location information to unknown devices. The metaheuristic approach is one of themost advantageous ways to deal with this challenging issue and overcome the disadvantages of the traditionalmethods that often suffer from computational time problems and small network deployment scale. This studyproposes an enhanced whale optimization algorithm that is an advanced metaheuristic algorithm based on thesiege mechanism (SWOA) for node localization inWSN. The objective function is modeled while communicatingon localized nodes, considering variables like delay, path loss, energy, and received signal strength. The localizationapproach also assigns the discovered location data to unidentified devices with the modeled objective functionby applying the SWOA algorithm. The experimental analysis is carried out to demonstrate the efficiency of thedesigned localization scheme in terms of various metrics, e.g., localization errors rate, converges rate, and executedtime. Compared experimental-result shows that theSWOA offers the applicability of the developed model forWSNto perform the localization scheme with excellent quality. Significantly, the error and convergence values achievedby the SWOA are less location error, faster in convergence and executed time than the others compared to at least areduced 1.5% to 4.7% error rate, and quicker by at least 4%and 2% in convergence and executed time, respectivelyfor the experimental scenarios.

关键词： Node localization whale optimization algorithm wireless sensor networks siege whale optimization algorithm optimization

Large-Scale Multi-Objective Optimization Algorithm Based on Weighted Overlapping Grouping of Decision Variables

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computer Modeling in Engineering & Sciences 2024年第7期140卷 363-383页

作者： Liang Chen Jingbo Zhang Linjie Wu Xingjuan Cai Yubin Xu Shanxi key laboratory of big data Analysis and Parallel Computing Taiyuan University of Science and TechnologyTaiyuan030024China School of State key laboratory of Novel Software Technology Nanjing UniversityNanjing210008China

The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision ***,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this ***,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision *** the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping ***,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision *** decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into ***,the decision variable with the strongest interaction is added to each *** minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different *** was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our *** with the other algorithms,our method is still at an advantage.

关键词： Decision variable grouping large-scale multi-objective optimization algorithms weighted overlapping grouping direction-guided evolution