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

8th International Congress on Edge Computing, EDGE 2024, Held as Part of the Services Conference Federation, SCF 2024

作者： Tian, Yun Wu, Bin Shi, Jiaoli Zhang, Caicai Xu, Du School of Computer and Big Data Science Jiujiang University Jiujiang332005 China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005 China School of Modern Information Technology Zhejiang Polytechnic University of Mechanical and Electrical Engineering Hangzhou310053 China

ISBN: (纸本)9783031770685

The development of cloud computing and the widespread application of cloud services have made outsourcing services more convenient. The need for individuals and businesses to store and manipulate the graph data they generate is growing rapidly. The unreliability and insecurity of cloud servers make outsourcing graph data a great risk of information leakage. To effectively protect data security, encrypting outsourced data is a useful method. The adjacent vertex query is a very commonly used and fundamental operation, and similarity search is a widely used and powerful tool to improve the scope and functionality of queries. After outsourcing encrypted sparse graph data to cloud servers, it becomes very inconvenient to use and manipulate the data. In this work, we present a scheme to realize the adjacent vertex query supporting similarity search on sparse graph data in cloud environment (SSAQ), which also protects the security of the information. This work uses edit distance and the searchable encryption principle to construct query index, and next implement the similar adjacent vertex query on cloud server. This work provides a formal security analysis, and also gives the experimental comparison and analysis. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： information leakage

来源：评论

学校读者我要写书评

暂无评论

SSMamba: Superpixel Segmentation With Mamba

引用

IEEE Signal Processing Letters 2025年 32卷 1715-1719页

作者： Jia, Xiaohong Li, Yonghui Jiao, Jianjun Zhao, Yao Xia, Zhiwei Lanzhou Jiaotong University School of Electronic and Information Engineering Lanzhou730070 China Beijing Jiaotong University Key Laboratory of Big Data and Artiffcial Intelligence in Transportation Ministry of Education Beijing100044 China Beijing Jiaotong University Institute of Information Science Beijing100044 China

Deep convolutional networks have achieved remarkable success in superpixel segmentation. However, they only focus on local features ignoring global attributes. The visual Mamba demonstrates an exceptional capability to capture long-range dependencies and offers a lower computational cost compared to the Transformer. Building on this inspiration, we propose a novel superpixel segmentation with Mamba, termed SSMamba. In SSMamba, Mamba is integrated into a global-local architecture, enabling efficient interaction between global attributes and local features to produce high-quality superpixels. The designed activation function further enhances the effectiveness of SSMamba. Extensive experiments on four public datasets demonstrate that SSMamba outperforms existing state-of-the-art methods, achieving competitive average values of ASA = 0.9541, BR = 0.8768, BP = 0.2124, UE = 0.0910, and CO = 0.3698. © 1994-2012 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

PFed-NS: An Adaptive Personalized Federated Learning Scheme Through Neural Network Segmentation

引用

IEEE Transactions on computers 2025年第6期74卷 1936-1948页

作者： Liu, Yuchen He, Ligang Zhang, Zhigao Ren, Shenyuan University of Warwick Department of Computer Science CoventryCV4 7AL United Kingdom Wuhan University School of Computer Science Wuhan430072 China China Hubei Luojia Laboratory Wuhan430072 China Beijing Jiaotong University Key Laboratory of Big Data & Artificial Intelligence in Transportation Ministry of Education School of Computer and Information Technology Beijing100044 China

Federated Learning (FL) is typically deployed in a client-server architecture, which makes the Edge-Cloud architecture an ideal backbone for FL. A significant challenge in this setup arises from the diverse data feature distributions across different edge locations (i.e., non-IID data). In response, Personalized Federated Learning (PFL) approaches have been developed. Network segmentation-based PFL is an important approach to achieving PFL, in which the training network is divided into a global segment for server aggregation and a local segment maintained client-side. Existing methods determine the segmentation before the training, and the segmentation remains fixed throughout the PFL training. However, our investigation reveals that model representations vary as PFL progresses and the fixed segmentation may not deliver best performance across various training settings. To address this, we propose PFed-NS, a PFL framework based on adaptive network segmentation. This adaptive segmentation technique is composed of two elements: a mechanism for assessing divergence of clients’ probability density functions constructed from network layers’ outputs, and a model for dynamically establishing divergence thresholds, beyond which server aggregation is deemed detrimental. Further optimization strategies are proposed to reduce the computation and communication costs incurred by divergence modeling. Moreover, we propose a divergence-based BN strategy to optimize BN performance for network segmentation-based PFL. Extensive experiments have been conducted to compare PFed-NS against recent PFL models. The results demonstrate its superiority in enhancing model accuracy and accelerating convergence. © 1968-2012 IEEE.

关键词： Probability density function

来源：评论

学校读者我要写书评

暂无评论

Contribution of Transmembrane Protein 68 to Triglyceride Synthesis and Lipid Droplet Formation Differs From Diacylglycerol Acyltransferase

引用

生物化学与生物物理进展 2025年第3期52卷 705-715页

作者： YU Qing FU Yang-Yang ZENG Fan-Si PANG Hui-Min HUANG Fei-Fei CHANG Ping-An Chongqing Key Laboratory of Big Data for Bio-Intelligence School of Life Health Information Science and EngineeringChongqing University of Posts and TelecommunicationsChongqing 400065China

Objective To characterize transmembrane protein 68(TMEM68)in an alternative triacylglycerol(TAG)biosynthesis pathway,and determine the interplay between TMEM68 and the canonical TAG synthesis enzyme acyl-CoA:diacylglycerol acyltransferase(DGAT).Methods Effects of exogenous fatty acid and monoacylglycerol on TAG synthesis and lipid droplet(LD)formation in TMEM68 overexpression and knockout cells treated with DGAT inhibitor or not were investigated by comparing LD morphology,Oil Red O staining,and measurement of TAG *** were stained with fluorescence dye and observed by confocal fluorescence *** levels were determined with an enzyme-based triglyceride assay *** of TMEM68 and DGAT1 was detected by co-expression and confocal fluorescence microscopy and their interaction was determined by ***-qPCR and immunoblotting assay were used to detect the expression of *** The synthesis of TAG catalyzed by TMEM68 was independent of DGAT *** exogenous fatty acids and monoacylglycerol promoted TAG synthesis mainly through DGAT in human neuroblastoma *** LDs formed by TMEM68 were different in morphology from those by *** addition,TMEM68 and DGAT1 colocalized in the same endoplasmic reticulum(ER)compartment but did not interact ***68 overexpression reduced the expression of DGAT1,the major DGAT enzyme involved in TAG synthesis,while TMEM68 knockout had little *** The TMEM68-mediated TAG synthesis pathway has distinct features from the canonical DGAT pathway,however,TMEM68 and DGAT may coregulate intracellular TAG levels.

关键词： triacylglycerol lipid droplet TMEM68 GAT

来源：评论

学校读者我要写书评

暂无评论

TCMS: A Multi-Sequence Log Parsing Method Based on Token Conversion

引用

IEEE Transactions on Dependable and Secure Computing 2025年第3期22卷 3028-3045页

作者： Wei, Mingkuan Wen, Jigang He, Shiming Xie, Kun Liang, Wei Xie, Gaogang Li, Kenli Zhu, Ziyu Hunan University Ministry of Education Key Laboratory of "Fusion Computing of Supercomputing and Artificial Intelligence" College of Computer Science and Electronics Engineering Changsha410012 China Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan411201 China Changsha University of Science and Technology School of Computer and Communication Engineering Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha410114 China Beijing100045 China Columbia University Electrical Engineering New YorkNY10027 United States

Detailed system operations are recorded in logs. To ensure system reliability, developers can detect system anomalies through log anomaly detection. Log parsing, which converts semi-structured log messages into structured data, is a crucial step in log anomaly detection and advanced program analysis and verification. Despite the availability of various log parsing tools, they generally suffer from low parsing accuracy and slow efficiency due to the ignorance of variable characteristics and the use of costly pairwise comparison methods. In this paper, we propose a TCMS framework to parse logs, consisting of two main technologies. First, by studying 16 public log datasets, we find that most log variable tokens are structured variable tokens. Based on this discovery, we propose a token conversion algorithm to improve parsing accuracy. This algorithm converts the changed parts in structured variable tokens into wildcards (‘’), preventing these tokens from being directly identified as constant tokens. Second, to improve efficiency, we propose the LogMLCS algorithm, which intelligently constructs a graph to facilitate the extraction of common parts from multiple log messages at once, instead of using pairwise comparisons. Comprehensive experiments conducted on 16 log datasets reveal that our TCMS outperforms seven other parsing methods, achieving the highest parsing accuracy at the fastest speed. Furthermore, experimental results from running a log anomaly detection algorithm in conjunction with different log parsing methods demonstrate that TCMS significantly boosts detection accuracy. For instance, on the OpenStack dataset, our TCMS-facilitated log anomaly detection algorithm achieves a perfect F1-score, precision, and recall of 100% each, surpassing the best peer method by 32.2, 0.8, and 19.5 percentage points, respectively. © 2004-2012 IEEE.

关键词： Accuracy Anomaly Detection Clustering Algorithms Peer To Peer Computing Electronic Mail Source Coding Particle Separators Codes Tokenization Itemsets Log Parsing Log Analysis Token Conversion Log MLCS Log Parsing Pairwise Comparisons Low Accuracy Public datasets Anomaly Detection Common Part Multiple Messages Long Short Term Memory Point Source Target Domain Logarithm Of The Number Captive Animals Multi Objective Optimization Problem Regular Expressions Biological Sequences Rule Based Methods Point In The Graph Kinds Of datasets Template Generation Number Of Templates Similar Template Parse Tree Syntax Errors Harmonic Average Of Precision Log Length Earliest Methods Common Subsequence Precision And Recall Leaf Node Part Of The Message

来源：评论

学校读者我要写书评

暂无评论

MoreGCN: Distributed IoT Service Recommendation Considering Temporal User Interest Dynamics

引用

IEEE Internet of Things Journal 2025年第10期12卷 13657-13670页

作者： Zhou, Yu Hu, Chunqiang Liu, Zewei Xing, Xiaoshuang Li, Xingwang Chongqing University School of Big Data and Software Engineering Chongqing401331 China China Southern Power Grid Joint Laboratory on Cyberspace Security Guangdong510663 China Changshu Institute of Technology School of Computer Science and Engineering Suzhou215556 China Henan Polytechnic University College of Physics and Electronic Information Engineering Jiaozuo454000 China

With the continuous development of Internet of Things (IoT), significant value has been generated, but numerous challenges remain. Recommender systems, as an effective tool to optimize IoT services, can significantly enhance user experience. However, the IoT’s demands for low latency and high-computational load make it difficult for traditional recommender systems to adapt. Moreover, traditional approaches often overlook the dynamic nature of user preferences, which are crucial for determining user satisfaction with IoT services. To address these issues, we propose a novel method called MoreGCN, which quantifies the temporal evolution of user preferences and integrates user interest modeling to accurately match similar users. This approach guides the learning of convolutional networks during the recommendation process. Deployed within a distributed computing framework and combined with meta computing, MoreGCN significantly improves computational efficiency and recommendation accuracy. Experimental results demonstrate that, across three benchmark datasets, MoreGCN consistently outperforms several existing state-of-the-art methods in terms of performance. © 2014 IEEE.

关键词： Internet of Things Recommender systems Computational modeling Accuracy Load modeling Edge computing Feature extraction Collaborative filtering Vectors Servers

来源：评论

学校读者我要写书评

暂无评论

Listen With Seeing: Cross-Modal Contrastive Learning for Audio-Visual Event Localization

引用

IEEE Transactions on Multimedia 2025年 27卷 2650-2665页

作者： Sun, Chao Chen, Min Zhu, Chuanbo Zhang, Sheng Lu, Ping Chen, Jincai Huazhong University of Science and Technology Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China School of Computer Science and Technology Wuhan430074 China South China University of Technology School of Computer Science and Engineering Guangzhou510640 China Pazhou Laboratory Guangzhou510640 China

In real-world physiological and psychological scenarios, there often exists a robust complementary correlation between audio and visual signals. Audio-Visual Event Localization (AVEL) aims to identify segments with Audio-Visual Events (AVEs) that contain both audio and visual tracks in unconstrained videos. Prior studies have predominantly focused on audio-visual cross-modal fusion methods, overlooking the fine-grained exploration of the cross-modal information fusion mechanism. Moreover, due to the inherent heterogeneity of multi-modal data, inevitable new noise is introduced during the audio-visual fusion process. To address these challenges, we propose a novel Cross-modal Contrastive Learning Network (CCLN) for AVEL, comprising a backbone network and a branch network. In the backbone network, drawing inspiration from physiological theories of sensory integration, we elucidate the process of audio-visual information fusion, interaction, and integration from an information-flow perspective. Notably, the Self-constrained Bi-modal Interaction (SBI) module is a bi-modal attention structure integrated with audio-visual fusion information, and through gated processing of the audio-visual correlation matrix, it effectively captures inter-modal correlation. The Foreground Event Enhancement (FEE) module emphasizes the significance of event-level boundaries by elongating the distance between scene events during training through adaptive weights. Furthermore, we introduce weak video-level labels to constrain the cross-modal semantic alignment of audio-visual events and design a weakly supervised cross-modal contrastive learning loss (WCCL Loss) function, which enhances the quality of fusion representation in the dual-branch contrastive learning framework. Extensive experiments conducted on the AVE dataset for both fully supervised and weakly supervised event localization, as well as Cross-Modal Localization (CML) tasks, demonstrate the superior performance of our model compa

关键词： information fusion

来源：评论

学校读者我要写书评

暂无评论

Disentangled Noisy Correspondence Learning

引用

IEEE Transactions on Image Processing 2025年 34卷 2602-2615页

作者： Dang, Zhuohang Luo, Minnan Wang, Jihong Jia, Chengyou Han, Haochen Wan, Herun Dai, Guang Chang, Xiaojun Wang, Jingdong Xi’an Jiaotong University School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Shaanxi Xi’an710049 China SGIT AI Laboratory Xi’an710048 China State Grid Corporation of China State Grid Shaanxi Electric Power Company Ltd. Xi’an710048 China University of Science and Technology of China School of Information Science and Technology Hefei230026 China Abu Dhabi United Arab Emirates Baidu Inc. Beijing100085 China

Cross-modal retrieval is crucial in understanding latent correspondences across modalities. However, existing methods implicitly assume well-matched training data, which is impractical as real-world data inevitably involves imperfect alignments, i.e., noisy correspondences. Although some works explore similarity-based strategies to address such noise, they suffer from sub-optimal similarity predictions influenced by modality-exclusive information (MEI), e.g., background noise in images and abstract definitions in texts. This issue arises as MEI is not shared across modalities, thus aligning it in training can markedly mislead similarity predictions. Moreover, although intuitive, directly applying previous cross-modal disentanglement methods suffers from limited noise tolerance and disentanglement efficacy. Inspired by the robustness of information bottlenecks against noise, we introduce DisNCL, a novel information-theoretic framework for feature Disentanglement in Noisy Correspondence Learning, to adaptively balance the extraction of modality-invariant information (MII) and MEI with certifiable optimal cross-modal disentanglement efficacy. DisNCL then enhances similarity predictions in modality-invariant subspace, thereby greatly boosting similarity-based alleviation strategy for noisy correspondences. Furthermore, DisNCL introduces soft matching targets to model noisy many-to-many relationships inherent in multi-modal inputs for noise-robust and accurate cross-modal alignment. Extensive experiments confirm DisNCL’s efficacy by 2% average recall improvement. Mutual information estimation and visualization results show that DisNCL learns meaningful MII/MEI subspaces, validating our theoretical analyses. © 1992-2012 IEEE.

关键词： information theory

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective Particle Swarm Optimization Algorithm Based on Decomposition and Multi-Selection Strategy

引用

computers, Materials & Continua 2025年第1期82卷 997-1026页

作者： Li Ma Cai Dai Xingsi Xue Cheng Peng School of Computer Science Shaanxi Normal UniversityXi’an710119China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of TechnologyFuzhou350118China Information Construction and Management Center and Institute of Artificial Intelligence and Educational New Productivity Ningxia Normal UniversityGuyuan756099China

The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization *** the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search ***,two update strategies based on decomposition are used to update the evolving population and external archive,***,a multiselection strategy is *** first strategy is for the subspace without a non-dominated *** the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global *** second strategy is for the subspace with a non-dominated *** the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local *** third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated *** the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to ***,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search ***,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test *** results show that the proposed algorithm has better performance.

关键词： Multi-objective optimization multi-objective particle swarm optimization decomposition multi-selection strategy

来源：评论

学校读者我要写书评

暂无评论

Phasmatodea Population Evolution Algorithm Based on Spiral Mechanism and Its Application to data Clustering

引用

computers, Materials & Continua 2025年第4期83卷 475-496页

作者： Jeng-Shyang Pan Mengfei Zhang Shu-Chuan Chu Xingsi Xue Václav Snášel College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao266590China School of Artificial Intelligence Nanjing University of Information Science and TechnologyNanjing210044China Department of Information Management Chaoyang University of TechnologyTaichung41349TaiwanChina Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of TechnologyFuzhou350118China Faculty of Electrical Engineering and Computer Science VŠB-Technical University of OstravaOstrava70833Czech Republic

data clustering is an essential technique for analyzing complex datasets and continues to be a central research topic in data *** clustering algorithms,such as K-means,are widely used due to their simplicity and *** paper proposes a novel Spiral Mechanism-Optimized Phasmatodea Population Evolution Algorithm(SPPE)to improve clustering *** SPPE algorithm introduces several enhancements to the standard Phasmatodea Population Evolution(PPE)***,a Variable Neighborhood Search(VNS)factor is incorporated to strengthen the local search capability and foster population ***,a position update model,incorporating a spiral mechanism,is designed to improve the algorithm’s global exploration and convergence ***,a dynamic balancing factor,guided by fitness values,adjusts the search process to balance exploration and exploitation *** performance of SPPE is first validated on CEC2013 benchmark functions,where it demonstrates excellent convergence speed and superior optimization results compared to several state-of-the-art metaheuristic *** further verify its practical applicability,SPPE is combined with the K-means algorithm for data clustering and tested on seven *** results show that SPPE-K-means improves clustering accuracy,reduces dependency on initialization,and outperforms other clustering *** study highlights SPPE’s robustness and efficiency in solving both optimization and clustering challenges,making it a promising tool for complex data analysis tasks.

关键词： Phasmatodea population evolution algorithm data clustering meta-heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：