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

Quantum speedup and limitations on matroid property problems

Frontiers of computer science 2024年第4期18卷 189-196页

作者： Xiaowei HUANG Jingquan LUO Lvzhou LI Institute of Quantum Computing and Computer Theory School of Computer Science and EngineeringSun Yat-sen UniversityGuangzhou 510006China

Matroid theory has been developed to be a mature branch of mathematics and has extensive applications in combinatorial optimization,algorithm design and so *** the other hand,quantum computing has attracted much attention and has been shown to surpass classical computing on solving some computational ***,crossover studies of the two fields seem to be missing in the *** paper initiates the study of quantum algorithms for matroid property *** is shown that quadratic quantum speedup is possible for the calculation problem of finding the girth or the number of circuits(bases,flats,hyperplanes)of a matroid,and for the decision problem of deciding whether a matroid is uniform or Eulerian,by giving a uniform lower boundΩ■on the query complexity of all these *** the other hand,for the uniform matroid decision problem,an asymptotically optimal quantum algorithm is proposed which achieves the lower bound,and for the girth problem,an almost optimal quantum algorithm is given with query complexityO■.In addition,for the paving matroid decision problem,a lower boundΩ■on the query complexity is obtained,and an O■ quantum algorithm is presented.

关键词： quantum computing matroid quantum algorithm quantum query complexity

来源：评论

学校读者我要写书评

暂无评论

A Transfer Function Design for Medical Volume Data Using a Knowledge Database Based on Deep Image and Primitive Intensity Profile Features Retrieval

引用

Journal of computer science & Technology 2024年第2期39卷 320-335页

作者： Younhyun Jung Jim Kong 盛斌 Jinman Kim School of Computing Gachon UniversitySeongnam 13120Korea School of Computer Science The University of SydneySydney 2006Australia Department of Computer Science and Engineering Shanghai Jiao Tong UniversityShanghai 200240China

Direct volume rendering(DVR)is a technique that emphasizes structures of interest(SOIs)within a volume visually,while simultaneously depicting adjacent regional information,e.g.,the spatial location of a structure concerning its *** DVR,transfer function(TF)plays a key role by enabling accurate identification of SOIs interactively as well as ensuring appropriate visibility of *** generation typically involves non-intuitive trial-and-error optimization of rendering parameters,which is time-consuming and *** at mitigating this manual process have led to approaches that make use of a knowledge database consisting of pre-designed TFs by domain *** these approaches,a user navigates the knowledge database to find the most suitable pre-designed TF for their input volume to visualize the *** these approaches potentially reduce the workload to generate the TFs,they,however,require manual TF navigation of the knowledge database,as well as the likely fine tuning of the selected TF to suit the *** this work,we propose a TF design approach,CBR-TF,where we introduce a new content-based retrieval(CBR)method to automatically navigate the knowledge *** of pre-designed TFs,our knowledge database contains volumes with SOI *** an input volume,our CBR-TF approach retrieves relevant volumes(with SOI labels)from the knowledge database;the retrieved labels are then used to generate and optimize TFs of the *** approach largely reduces manual TF navigation and fine *** our CBR-TF approach,we introduce a novel volumetric image feature which includes both a local primitive intensity profile along the SOIs and regional spatial semantics available from the co-planar images to the *** the regional spatial semantics,we adopt a convolutional neural network to obtain high-level image feature *** the intensity profile,we extend the dynamic time warping technique to address subtle alignment

关键词： data retrieval direct volume rendering ray analysis transfer function

来源：评论

学校读者我要写书评

暂无评论

Enhanced Acceleration for Generalized Nonconvex Low-Rank Matrix Learning

引用

Chinese Journal of Electronics 2025年第1期34卷 98-113页

作者： Hengmin Zhang Jian Yang Wenli Du Bob Zhang Zhiyuan Zha Bihan Wen School of Electrical and Electronic Engineering Nanyang Technological University School of Computer Science and Engineering Nanjing University of Science and Technology School of Information Science and Engineering East China University of Science and Technology Department of Electrical and Computer Engineering University of Macau

Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.

关键词： Learning systems Image recognition Minimization Computational efficiency Complexity theory Matrix decomposition Optimization Image reconstruction Singular value decomposition Convergence

来源：评论

学校读者我要写书评

暂无评论

Manhattan-based k-member clustering and enhanced rabbit optimization algorithm for k-anonymization in social network

引用

Multimedia Tools and Applications 2024年第30期83卷 74739-74756页

作者： Sivasankari, K. Maheswari, K. M. Uma Department of computer science and engineering SRM Institute of Science and Technology Ramapuram Chennai India Department of computing technologies School of Computing College of Engineering and Technology SRM Institute of Science and Technology Kattankulathur India

Online social networks are becoming more and more popular, according to recent trends. The user's primary concern is the secure preservation of their data and privacy. A well-known method for preventing individual identity in publicly accessible datasets is K-anonymization. Existing anonymity techniques' primary drawback is that they're susceptible to similarity and attribute disclosure attacks. Furthermore, a large amount of data has been lost in the given database. To address this limitation, the proposed model integrated an anonymizing algorithm with Manhattan-based k-member clustering and an enhanced rabbit optimization algorithm (MKCAEROA). The Manhattan distance-based k member (MKCA) clustering algorithm is employed in this case to cluster the initial database. The resulting clusters are then further optimized, and the original database is made anonymous, using the enhanced rabbit optimization algorithm (EROA). In the suggested model, EROA is included to satisfy the specified anonymity constraints while concurrently minimizing the clustering error rate and the generated information loss. When compared to existing approaches, the experimental results demonstrate that the suggested method provides the highest clustering accuracy with the least amount of information loss. The MATLAB workbench will be used to implement the suggested model. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Filtering With Sample-Based Approximation Under Constrained Communication:Progress, Insights and Trends

引用

IEEE/CAA Journal of Automatica Sinica 2024年第7期11卷 1539-1556页

作者： Weihao Song Zidong Wang Zhongkui Li Jianan Wang Qing-Long Han IEEE the State Key Laboratory for Turbulence and Complex Systems Department of Mechanics and Engineering ScienceCollege of Engineering Peking University the Department of Computer Science Brunel University London the School of Aerospace Engineering Beijing Institute of Technology the School of Science Computing and Engineering Technologies Swinburne University of Technology

The nonlinear filtering problem has enduringly been an active research topic in both academia and industry due to its ever-growing theoretical importance and practical *** main objective of nonlinear filtering is to infer the states of a nonlinear dynamical system of interest based on the available noisy measurements. In recent years, the advance of network communication technology has not only popularized the networked systems with apparent advantages in terms of installation,cost and maintenance, but also brought about a series of challenges to the design of nonlinear filtering algorithms, among which the communication constraint has been recognized as a dominating concern. In this context, a great number of investigations have been launched towards the networked nonlinear filtering problem with communication constraints, and many samplebased nonlinear filters have been developed to deal with the highly nonlinear and/or non-Gaussian scenarios. The aim of this paper is to provide a timely survey about the recent advances on the sample-based networked nonlinear filtering problem from the perspective of communication constraints. More specifically, we first review three important families of sample-based filtering methods known as the unscented Kalman filter, particle filter,and maximum correntropy filter. Then, the latest developments are surveyed with stress on the topics regarding incomplete/imperfect information, limited resources and cyber ***, several challenges and open problems are highlighted to shed some lights on the possible trends of future research in this realm.

关键词： Communication constraints maximum correntropy filter networked nonlinear filtering particle filter sample-based approximation unscented Kalman filter

来源：评论

学校读者我要写书评

暂无评论

Robust federated contrastive recommender system against targeted model poisoning attack

引用

science China(Information sciences) 2025年第4期68卷 50-65页

作者： Wei YUAN Chaoqun YANG Liang QU Guanhua YE Quoc Viet Hung NGUYEN Hongzhi YIN School of Electrical Engineering and Computer Science The University of Queensland School of Information and Communication Technology Griffith University Deep Neural Computing Company Limited

Federated recommender systems(FedRecs) have garnered increasing attention recently, thanks to their privacypreserving benefits. However, the decentralized and open characteristics of current FedRecs present at least two ***, the performance of FedRecs is compromised due to highly sparse on-device data for each client. Second, the system's robustness is undermined by the vulnerability to model poisoning attacks launched by malicious users. In this paper, we introduce a novel contrastive learning framework designed to fully leverage the client's sparse data through embedding augmentation, referred to as CL4FedRec. Unlike previous contrastive learning approaches in FedRecs that necessitate clients to share their private parameters, our CL4FedRec aligns with the basic FedRec learning protocol, ensuring compatibility with most existing FedRec implementations. We then evaluate the robustness of FedRecs equipped with CL4FedRec by subjecting it to several state-of-the-art model poisoning attacks. Surprisingly, our observations reveal that contrastive learning tends to exacerbate the vulnerability of FedRecs to these attacks. This is attributed to the enhanced embedding uniformity, making the polluted target item embedding easily proximate to popular items. Based on this insight, we propose an enhanced and robust version of CL4FedRec(rCL4FedRec) by introducing a regularizer to maintain the distance among item embeddings with different popularity levels. Extensive experiments conducted on four commonly used recommendation datasets demonstrate that rCL4FedRec significantly enhances both the model's performance and the robustness of FedRecs.

关键词： federated recommender system contrastive learning model poisoning attack and defense

来源：评论

学校读者我要写书评

暂无评论

CLIP-Flow:Decoding images encoded in CLIP space

引用

Computational Visual Media 2024年第6期10卷 1157-1168页

作者： Hao Ma Ming Li Jingyuan Yang Or Patashnik Dani Lischinski Daniel Cohen-Or Hui Huang Visual Computing Research Center College of Computer Science and Software EngineeringShenzhen UniversityShenzhen 518060China Department of Computer Science Tel Aviv UniversityTel Aviv 6997801Israel School of Computer Science and Engineering the Hebrew University of JerusalemJerusalem 91904Israel

This study introduces CLIP-Flow,a novel network for generating images from a given image or *** effectively utilize the rich semantics contained in both modalities,we designed a semantics-guided methodology for image-and text-to-image *** particular,we adopted Contrastive Language-Image Pretraining(CLIP)as an encoder to extract semantics and StyleGAN as a decoder to generate images from such ***,to bridge the embedding space of CLIP and latent space of StyleGAN,real NVP is employed and modified with activation normalization and invertible *** the images and text in CLIP share the same representation space,text prompts can be fed directly into CLIP-Flow to achieve text-to-image *** conducted extensive experiments on several datasets to validate the effectiveness of the proposed image-to-image synthesis *** addition,we tested on the public dataset Multi-Modal CelebA-HQ,for text-to-image *** validated that our approach can generate high-quality text-matching images,and is comparable with state-of-the-art methods,both qualitatively and quantitatively.

关键词： image-to-image text-to-image contrastive language-image pretraining(CLIP) flow StyleGAN

来源：评论

学校读者我要写书评

暂无评论

Real-Time Speech Enhancement Based on Convolutional Recurrent Neural Network

引用

Intelligent Automation & Soft computing 2023年第2期35卷 1987-2001页

作者： S.Girirajan A.Pandian Department of Computer Science and Engineering School of ComputingSRM Institute of Science and EngineeringKattankulathurTamil NaduIndia

Speech enhancement is the task of taking a noisy speech input and pro-ducing an enhanced speech *** recent years,the need for speech enhance-ment has been increased due to challenges that occurred in various applications such as hearing aids,Automatic Speech Recognition(ASR),and mobile speech communication *** of the Speech Enhancement research work has been carried out for English,Chinese,and other European *** a few research works involve speech enhancement in Indian regional *** this paper,we propose a two-fold architecture to perform speech enhancement for Tamil speech signal based on convolutional recurrent neural network(CRN)that addresses the speech enhancement in a real-time single channel or track of sound created by the *** theﬁrst stage mask based long short-term mem-ory(LSTM)is used for noise suppression along with loss function and in the sec-ond stage,Convolutional Encoder-Decoder(CED)is used for speech *** proposed model is evaluated on various speaker and noisy environments like Babble noise,car noise,and white Gaussian *** proposed CRN model improves speech quality by 0.1 points when compared with the LSTM base model and also CRN requires fewer parameters for *** performance of the pro-posed model is outstanding even in low Signal to Noise Ratio(SNR).

关键词： Speech enhancement convolutional encoder-decoder long short-term memory noise suppression speech restoration

来源：评论

学校读者我要写书评

暂无评论

RE-SEGNN:recurrent semantic evidence-aware graph neural network for temporal knowledge graph forecasting

引用

science China(Information sciences) 2025年第2期68卷 103-119页

作者： Wenyu CAI Mengfan LI Xuanhua SHI Yuanxin FAN Quntao ZHU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and Technology

Temporal knowledge graph(TKG) reasoning, has seen widespread use for modeling real-world events, particularly in extrapolation settings. Nevertheless, most previous studies are embedded models, which require both entity and relation embedding to make predictions, ignoring the semantic correlations among different entities and relations within the same timestamp. This can lead to random and nonsensical predictions when unseen entities or relations occur. Furthermore, many existing models exhibit limitations in handling highly correlated historical facts with extensive temporal depth. They often either overlook such facts or overly accentuate the relationships between recurring past occurrences and their current counterparts. Due to the dynamic nature of TKG, effectively capturing the evolving semantics between different timestamps can be *** address these shortcomings, we propose the recurrent semantic evidenceaware graph neural network(RE-SEGNN), a novel graph neural network that can learn the semantics of entities and relations simultaneously. For the former challenge, our model can predict a possible answer to missing quadruples based on semantics when facing unseen entities or relations. For the latter problem, based on an obvious established force, both the recency and frequency of semantic history tend to confer a higher reference value for the current. We use the Hawkes process to compute the semantic trend, which allows the semantics of recent facts to gain more attention than those of distant facts. Experimental results show that RE-SEGNN outperforms all SOTA models in entity prediction on 6 widely used datasets, and 5 datasets in relation prediction. Furthermore, the case study shows how our model can deal with unseen entities and relations.

关键词： knowledge graph reasoning temporal knowledge graph Hawkes process semantic evidence

来源：评论

学校读者我要写书评

暂无评论

Fuzzy knowledge based intelligent decision support system for ground based air defence

引用

Journal of Ambient Intelligence and Humanized computing 2024年第4期15卷 2317-2340页

作者： Ahmad, Adnan Amjad, Rawan Basharat, Amna Farhan, Asma Ahmad Abbas, Ali Ezad Department of Computer Science School of Computing National University of Computer and Emerging Sciences Islamabad Pakistan Department of Data Science School of Computing National University of Computer and Emerging Sciences Lahore Pakistan Islamabad Pakistan

This research proposes an Intelligent Decision Support System for Ground-Based Air Defense (GBAD) environments, which consist of Defended Assets (DA) on the ground that require protection from enemy aerial threats. A Fire Control Officer is responsible for assessing threats and assigning the most appropriate weapon to neutralize them. However, the decision-making process can be prone to errors, risking resource wastage and endangering DA protection. To address this problem, this research proposes a hybrid approach that combines a knowledge-driven fuzzy inference system with machine learning models to optimize resource allocation while incorporating expert knowledge in the decision-making process. Since sensory data obtained from multiple radars may be incomplete or incorrect, a fuzzy knowledge graph-based system is used for data fusion and providing it to the connected modules. Feature selection is optimized by including the most important parameters, such as the vitality of defended assets and threat score, in the threat evaluation. The results from these subsystems are visualized using a Geographical Information System, allowing for real-time mapping of the GBAD environment and displaying the results in a user-friendly web interface. The proposed system has undergone rigorous testing and evaluation, resulting in an efficient and accurate weapon assignment model with a low RMSE value of 0.037. Overall, this Intelligent Decision Support System provides an effective solution for optimizing decision-making processes in GBAD environments and can significantly improve DA protection. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：