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

A State-Migration Particle Swarm Optimizer for Adaptive Latent Factor Analysis of High-Dimensional and Incomplete data

引用

IEEE/CAA Journal of Automatica Sinica 2024年第11期11卷 2220-2235页

作者： Jiufang Chen Kechen Liu Xin Luo Ye Yuan Khaled Sedraoui Yusuf Al-Turki MengChu Zhou IEEE the College of Computer Science and Technology Chongqing University of Posts and Telecommunications the Department of Computer Science Columbia University the College of Computer and Information Science Southwest University the Department of Electrical and Computer Engineering Faculty of Engineeringand also with K.A.CARE Energy Research and Innovation CenterKing Abdulaziz University the Center of Research Excellence in Renewable Energy and Power Systems the Department of Electrical and Computer EngineeringFaculty of Engineeringand also with K.A.CARE Energy Research and Innovation CenterKing Abdulaziz University the Department of Electrical and Computer Engineering New Jersey Institute of Technology

High-dimensional and incomplete(HDI) matrices are primarily generated in all kinds of big-data-related practical applications. A latent factor analysis(LFA) model is capable of conducting efficient representation learning to an HDI matrix,whose hyper-parameter adaptation can be implemented through a particle swarm optimizer(PSO) to meet scalable ***, conventional PSO is limited by its premature issues,which leads to the accuracy loss of a resultant LFA model. To address this thorny issue, this study merges the information of each particle's state migration into its evolution process following the principle of a generalized momentum method for improving its search ability, thereby building a state-migration particle swarm optimizer(SPSO), whose theoretical convergence is rigorously proved in this study. It is then incorporated into an LFA model for implementing efficient hyper-parameter adaptation without accuracy loss. Experiments on six HDI matrices indicate that an SPSO-incorporated LFA model outperforms state-of-the-art LFA models in terms of prediction accuracy for missing data of an HDI matrix with competitive computational ***, SPSO's use ensures efficient and reliable hyper-parameter adaptation in an LFA model, thus ensuring practicality and accurate representation learning for HDI matrices.

关键词： data science generalized momentum high-dimensional and incomplete(HDI)data hyper-parameter adaptation latent factor analysis(LFA) particle swarm optimization(PSO)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards High-Performance Graph Processing: From a Hardware/Software Co-Design Perspective

引用

Journal of computer science & Technology 2024年第2期39卷 245-266页

作者：廖小飞赵文举金海姚鹏程黄禹王庆刚赵进郑龙张宇邵志远 National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China

Graph processing has been widely used in many scenarios,from scientific computing to artificial *** processing exhibits irregular computational parallelism and random memory accesses,unlike traditional ***,running graph processing workloads on conventional architectures(e.g.,CPUs and GPUs)often shows a significantly low compute-memory ratio with few performance benefits,which can be,in many cases,even slower than a specialized single-thread graph *** domain-specific hardware designs are essential for graph processing,it is still challenging to transform the hardware capability to performance boost without coupled software *** article presents a graph processing ecosystem from hardware to *** start by introducing a series of hardware accelerators as the foundation of this ***,the codesigned parallel graph systems and their distributed techniques are presented to support graph ***,we introduce our efforts on novel graph applications and hardware *** results show that various graph applications can be efficiently accelerated in this graph processing ecosystem.

关键词： graph processing hardware accelerator software system high performance ecosystem

来源：评论

学校读者我要写书评

暂无评论

Precise control of page cache for containers

引用

Frontiers of computer science 2024年第2期18卷 17-30页

作者： Kun WANG Song WU Shengbang LI Zhuo HUANG Hao FAN Chen YU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Container-based virtualization isbecoming increasingly popular in cloud computing due to its efficiency and *** isolation is a fundamental property of *** works have indicated weak resource isolation could cause significant performance degradation for containerized applications and enhanced resource ***,current studies have almost not discussed the isolation problems of page cache which is a key resource for *** leverage memory cgroup to control page cache ***,existing policy introduces two major problems in a container-based ***,containers can utilize more memory than limited by their cgroup,effectively breaking memory ***,the Os kernel has to evict page cache to make space for newly-arrived memory requests,slowing down containerized *** paper performs an empirical study of these problems and demonstrates the performance impacts on containerized *** we propose pCache(precise control of page cache)to address the problems by dividing page cache into private and shared and controlling both kinds of page cache separately and *** do so,pCache leverages two new technologies:fair account(f-account)and evict on demand(EoD).F-account splits the shared page cache charging based on per-container share to prevent containers from using memory for free,enhancing memory *** EoD reduces unnecessary page cache evictions to avoid the performance *** evaluation results demonstrate that our system can effectively enhance memory isolation for containers and achieve substantial performance improvement over the original page cache management policy.

关键词： page cache memory cgroup container isolation cloud computing

来源：评论

学校读者我要写书评

暂无评论

Recent metaheuristic algorithms for medical object localization using MSER detector in computer-aided diagnosis system

引用

Multimedia Tools and Applications 2025年第15期84卷 14433-14487页

作者： Ait Mehdi, Mohamed Belattar, Khadidja Souami, Feryel Faculty of Computer Science Data Science and Artificial Intelligence Department Laboratory for Research in Artificial Intelligence University of Science and Technology Houari Boumediene BP 32 El-Alia Algiers Bab-Ezzouar16111 Algeria Department of Computer Science University of Algiers Benyoucef Benkhedda Algiers16000 Algeria

Object localization is a critical task in image analysis, often facilitated by artificial intelligence techniques. While the Maximally Stable Extremal Regions (MSER) detection algorithm is a popular choice for local detection, its exhaustive approaches can be algorithmically complex and prone to suboptimal results with improper parameter selection. Various metaheuristic algorithms have been proposed for medical object localization to address this. In this context, four contributions are presented. Firstly, recent metaheuristics, including the Slime Mould Algorithm (SMA), Marine Predators Algorithm (MPA), Heap-based Optimizer (HBO), and Gradient-based Optimizer (GBO), are adapted to tackle the MSER localization problem. These algorithms are rigorously evaluated across diverse medical image datasets using multiple metrics, with their performance statistically validated through the Friedman mean rank test. The second contribution introduces a novel objective function to improve the localization process. The third contribution involves a comparative analysis of the recent algorithms against seven standard metaheuristics specifically designed for MSER localization. Lastly, we present an improved computer-aided diagnosis system that integrates an SVM-based model with Local Binary Patterns (LBP) descriptors extracted from each MSER alongside DenseNet-121 features. Experimental results demonstrate that the HBO and SMA optimizers outperform conventional algorithms, showing a higher diversity, improved exploitation and exploration capabilities, a well-balanced exploration-exploitation trade-off, elevated fitness values, faster convergence speeds, and enhanced computational efficiency. Additionally, we integrate these findings into an improved computer-aided diagnosis system, yielding classification results surpassing state-of-the-art models. These findings highlight the potential advantages of this approach, especially in object detection applications. © The Author(s), under

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Virtual Reality Based Shading Pattern Recognition and Interactive Global Maximum Power Point Tracking in Photovoltaic Systems

引用

Journal of Modern Power Systems and Clean Energy 2024年第6期12卷 1849-1858页

作者： Kangshi Wang Jieming Ma Xiao Lu Jingyi Wang Ka Lok Man Kaizhu Huang Xiaowei Huang School of Advanced Technology Xi'an Jiaotong-Liverpool UniversitySuzhou 215123China Data Science Research Center Duke Kunshan UniversitySuzhou 215316China School of Computer Science the University of LiverpoolLiverpoolU.K

The performance of photovoltaic(PV)systems is in-fluenced by various factors,including atmospheric conditions,geographical locations,and spatial and temporal ***,the optimization of PV systems relies heavily on the global maximum power point tracking(GMPPT)*** this paper,we adopt virtual reality(VR)technology to visual-ize PV entities and simulate their *** integra-tion of VR technology introduces a novel spatial and temporal dimension to the shading pattern recognition(SPR)of PV sys-tems,thereby enhancing their descriptive ***-more,we introduce an interactive GMPPT(IGMPPT)method based on VR *** method leverages interactive search techniques to narrow down search regions,thereby en-hancing the search *** results demonstrate the effectiveness of the proposed IGMPPT in representing the spatial and temporal characteristics of PV systems and improv-ing the efficiency of GMPPT.

关键词： Photovoltaic(PV)system virtual reality(VR) shading pattern recognition(SPR) global maximum power point tracking(GMPPT)

来源：评论

学校读者我要写书评

暂无评论

Answering reachability queries with ordered label constraints over labeled graphs

引用

Frontiers of computer science 2024年第1期18卷 105-117页

作者： Daoliang HE Pingpeng YUAN 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&TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Reachability query plays a vital role in many graph analysis *** researches proposed many methods to efficiently answer reachability queries between vertex *** many real graphs are labeled graph,it highly demands Label-Constrained Reachability(LCR)query inwhich constraint includes a set of labels besides vertex *** researches proposed several methods for answering some LCR queries which require appearance of some labels specified in constraints in the *** that constraint may be a label set,query constraint may be ordered labels,namely OLCR(Ordered-Label-Constrained Reachability)queries which retrieve paths matching a sequence of ***,no solutions are available for ***,we propose DHL,a novel bloom filter based indexing technique for answering OLCR *** can be used to check reachability between vertex *** the answers are not no,then constrained DFS is ***,we employ DHL followed by performing constrained DFS to answer OLCR *** show that DHL has a bounded false positive rate,and it's powerful in saving indexing time and *** experiments on 10 real-life graphs and 12 synthetic graphs demonstrate that DHL achieves about 4.8-22.5 times smaller index space and 4.6-114 times less index construction time than two state-of-art techniques for LCR queries,while achieving comparable query response *** results also show that our algorithm can answer OLCR queries effectively.

关键词： graph ordered-label-constrained reachability partial index bloom filter query processing

来源：评论

学校读者我要写书评

暂无评论

Learning continuous network emerging dynamics from scarce observations via data-adaptive stochastic processes

引用

science China(Information sciences) 2024年第12期67卷 240-255页

作者： Jiaxu CUI Qipeng WANG Bingyi SUN Jiming LIU Bo YANG College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Public Computer Education and Research Center Jilin University Department of Computer Science Hong Kong Baptist University

Learning network dynamics from the empirical structure and spatio-temporal observation data is crucial to revealing the interaction mechanisms of complex networks in a wide range of domains. However,most existing methods only aim at learning network dynamic behaviors generated by a specific ordinary differential equation instance, resulting in ineffectiveness for new ones, and generally require dense *** observed data, especially from network emerging dynamics, are usually difficult to obtain, which brings trouble to model learning. Therefore, learning accurate network dynamics with sparse, irregularly-sampled,partial, and noisy observations remains a fundamental challenge. We introduce a new concept of the stochastic skeleton and its neural implementation, i.e., neural ODE processes for network dynamics(NDP4ND), a new class of stochastic processes governed by stochastic data-adaptive network dynamics, to overcome the challenge and learn continuous network dynamics from scarce observations. Intensive experiments conducted on various network dynamics in ecological population evolution, phototaxis movement, brain activity, epidemic spreading, and real-world empirical systems, demonstrate that the proposed method has excellent data adaptability and computational efficiency, and can adapt to unseen network emerging dynamics, producing accurate interpolation and extrapolation with reducing the ratio of required observation data to only about 6% and improving the learning speed for new dynamics by three orders of magnitude.

关键词： complex networks network dynamics emerging spatio-temporal dynamics neural processes

来源：评论

学校读者我要写书评

暂无评论

Leveraging XGBoost and Clinical Attributes for Heart Disease Prediction 5

Leveraging XGBoost and Clinical Attributes for Heart Disease...

引用

5th International Conference on Sustainable Communication Networks and Application, ICSCNA 2024

作者： Susmitha, Kota Bhargavi, Maridu Sri, Achyuta Mohitha Sai Reddy, Bogala Devi Prasaad Satyanarayana, Paladugu Siva Rao, K V Ranga Vignan's Foundation for Science Technology and Research Department of Computer Science and Engineering Guntur India Department of Computer Science and Engineering-Data Science Hyderabad India

ISBN: (纸本)9798331530013

Despite the various advances in medical technology, heart disease continues to rank among the leading causes of mortality in the world, killing millions each year. There is hope that the risks involved with heart disease can be reversed in time and the outcomes of patients improved with earlier prediction and diagnosis. However, the use of conventional methods of diagnostic techniques tends to be very resource-intensive and inaccessible to other more disadvantaged areas. The present work defines a model for machine learning in predicting heart disease and illustrates a more efficient and accessible solution. There is a risk for heart disease that is determined using a set of various clinical features. The algorithm used in the prediction of heart disease is XG Boost that are applied to the dataset. The method provides a reliable tool for the early detection of heart disease, thus helping healthcare providers to improve preventive care and treatment strategies. The results of this study will be helpful in advancing research to identify other avenues for prediction of heart disease. © 2024 IEEE.

关键词： early diagnosis Heart disease UCI (University California Irvine) Heart Disease dataset XG Boost

来源：评论

学校读者我要写书评

暂无评论

Max-difference maximization criterion: a feature selection method for text categorization

引用

Frontiers of computer science 2023年第1期17卷 237-239页

作者： Lingbin JIN Li ZHANG Lei ZHAO School of Computer Science and Technology&Advanced Data Analysis Research Center Soochow UniversitySuzhou 215006China

1 IntroductionText categorization methods based on machine learning always encounter the curse of dimensionality. Therefore, it is crucial to perform feature selection to reduce dimensionality of text vectors. Methods based on the difference between document rate of a term in the positive class and that in the negative class have been widely studied in recent years, which is originated from balanced accuracy measures (ACC2) [1].

关键词： dimensionality difference criterion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：