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

Towards Exploring Large Molecular Space:An Efficient Chemical Genetic Algorithm

Journal of computer Science & Technology 2022年第6期37卷 1464-1477页

作者： Jian-Fu Zhu Zhong-Kai Hao Qi Liu Yu Yin Cheng-Qiang Lu Zhen-Ya Huang En-Hong Chen Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei 230026China

Generating molecules with desired properties is an important task in chemistry and *** efficient method may have a positive impact on finding drugs to treat diseases like *** mining and artificial intelligence may be good ways to find an efficient ***,both the generative models based on deep learning and the work based on genetic algorithms have made some progress in generating molecules and optimizing the molecule’s ***,existing methods have defects in the experimental evaluation *** methods also need to be improved in efficiency and *** solve these problems,we propose a method named the Chemical Genetic Algorithm for Large Molecular Space(CALM).Specifically,CALM employs a scalable and efficient molecular representation called molecular *** we design corresponding crossover,mutation,and mask operators inspired by domain knowledge and previous *** apply our genetic algorithm to several tasks related to molecular property optimization and constraint molecular *** results of these tasks show that our approach outperforms the other state-of-the-art deep learning and genetic algorithm methods,where the z tests performed on the results of several experiments show that our method is more than 99%likely to be *** the same time,based on the experimental results,we point out the defects in the experimental evaluation standard which affects the fair evaluation of all previous *** these defects helps to objectively evaluate the performance of all work.

关键词： data mining molecular generation genetic algorithm drug discovery artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

SketchConf: A Framework for Automatic Sketch Configuration 39

SketchConf: A Framework for Automatic Sketch Configuration

引用

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Miao, Ruijie Dong, Fenghao Zhao, Yikai Zhao, Yiming Wu, Yuhan Yang, Kaicheng Yang, Tong Cui, Bin Peking University School of Computer Science National Engineering Laboratory for Big Data Analysis Technology and Application Beijing China Peng Cheng Laboratory Shenzhen China

ISBN: (纸本)9798350322279

Sketches have risen as promising solutions for frequency estimation, which is one of the most fundamental tasks in approximate data stream processing. In many scenarios, users have a strong demand to apply sketches under the expected error constraints. In this paper, we explore how to configure sketch parameters to satisfy user-defined error constraints. We propose SketchConf, an automatic sketch configuration framework, which efficiently generates memory-optimal configurations for the first time. We show that SketchConf can be applied to order-independent sketches, including CM, Count, Tower, and Nitro sketches. We further discuss how to deal with the unknown and changeable workloads when applying SketchConf to the real scenarios of streaming data processing. Experimental results show that SketchConf can be up to 715.51 times faster than the baseline algorithm, and the outputted configurations save up to 99.99% memory and achieve up to 27.44 times throughput, compared with the theory-based configurations. The code is open sourced at Github. © 2023 IEEE.

关键词： Frequency estimation

来源：评论

学校读者我要写书评

暂无评论

SteadySketch: Finding Steady Flows in data Streams 31

SteadySketch: Finding Steady Flows in Data Streams

引用

31st IEEE/ACM International Symposium on Quality of Service, IWQoS 2023

作者： Li, Xiaodong Fan, Zhuochen Li, Haoyu Zhong, Zheng Guo, Jiarui Long, Sheng Yang, Tong Cui, Bin School of Computer Science Peking University National Engineering Laboratory for Big Data Analysis Technology and Application Beijing China Peng Cheng Laboratory Shenzhen China

ISBN: (纸本)9798350399738

In this paper, we study steady flows in data streams, which refers to those flows whose arrival rate is always non-zero and around a fixed value for several consecutive time windows. To find steady flows in real time, we propose a novel sketch, SteadySketch, aiming to accurately report steady flows with limited memory. To the best of our knowledge, this is the first work to define and find steady flows in data streams. The key novelty of SteadySketch is our proposed reborn technique, which reduces the required memory space by 75%. Experimental results show that SteadySketch improves the Precision Rate (PR) by 81.1% and reduces the Average Relative Error (ARE) by 955.3× compared with the strawman solution. Finally, we provide a concrete case: cache prefetch, and prove that SteadySketch can effectively improve the cache hit ratio. All related codes of SteadySketch are open-source and available at GitHub. © 2023 IEEE.

关键词： Steady flow

来源：评论

学校读者我要写书评

暂无评论

StoryLLaVA: Enhancing Visual Storytelling with Multi-Modal Large Language Models 31

StoryLLaVA: Enhancing Visual Storytelling with Multi-Modal L...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Yang, Li Xiao, Zhiding Huang, Wenxin Zhong, Xian Hubei Key Laboratory of Big Data Intelligent Analysis and Application School of Computer Science and Information Engineering Hubei University China Hubei Key Laboratory of Transportation Internet of Things School of Computer Science and Artificial Intelligence Wuhan University of Technology China

ISBN: (纸本)9798891761964

The rapid development of multi-modal large language models (MLLMs) has positioned visual storytelling as a crucial area in content creation. However, existing models often struggle to maintain temporal, spatial, and narrative coherence across image sequences and frequently lack the depth and engagement of human-authored stories. To address these challenges, we propose Story with Large Language and Vision Assistant (StoryLLaVA), a novel framework for enhancing visual storytelling. Our approach introduces a Topic-Driven Narrative Optimizer (TDNO) that improves both the training data and MLLM models by integrating image descriptions, topic generation, and GPT-4-based refinements. Furthermore, we employ a preference-based ranked story sampling method that aligns model outputs with human storytelling preferences through positive-negative pairing. These two phases of the framework differ in their training methods: the former uses supervised fine-tuning, while the latter incorporates reinforcement learning with positive and negative sample pairs. Experimental results demonstrate that StoryLLaVA outperforms current models in visual relevance, coherence, and fluency, with LLM-based evaluations confirming the generation of richer and more engaging narratives. The enhanced dataset and model are available at https://***/XxxZzD/StoryLLaVA. © 2025 Association for Computational Linguistics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Accelerating local SGD for non-IID data using variance reduction

引用

Frontiers of computer Science 2023年第2期17卷 73-89页

作者： Xianfeng LIANG Shuheng SHEN Enhong CHEN Jinchang LIU Qi LIU Yifei CHENG Zhen PAN Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of ChinaHefei 230027China Ant Financial Services Group Hangzhou 310000China Department of Computer Science and Engineering Hong Kong University of Science and TechnologyHong Kong 999077China

Distributed stochastic gradient descent and its variants have been widely adopted in the training of machine learning models,which apply multiple workers in *** them,local-based algorithms,including Local SGD and FedAvg,have gained much attention due to their superior properties,such as low communication cost and ***,when the data distribution on workers is non-identical,local-based algorithms would encounter a significant degradation in the convergence *** this paper,we propose Variance Reduced Local SGD(VRL-SGD)to deal with the heterogeneous *** extra communication cost,VRL-SGD can reduce the gradient variance among workers caused by the heterogeneous data,and thus it prevents local-based algorithms from slow convergence ***,we present VRL-SGD-W with an effectivewarm-up mechanism for the scenarios,where the data among workers are quite *** from eliminating the impact of such heterogeneous data,we theoretically prove that VRL-SGD achieves a linear iteration speedup with lower communication complexity even if workers access non-identical *** conduct experiments on three machine learning *** experimental results demonstrate that VRL-SGD performs impressively better than Local SGD for the heterogeneous data and VRL-SGD-W is much robust under high data variance among workers.

关键词： distributed optimization variance reduction local SGD federated learning non-IID data

来源：评论

学校读者我要写书评

暂无评论

HyperCalm Sketch: One-Pass Mining Periodic Batches in data Streams 39

HyperCalm Sketch: One-Pass Mining Periodic Batches in Data S...

引用

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Liu, Zirui Kong, Chaozhe Yang, Kaicheng Yang, Tong Miao, Ruijie Chen, Qizhi Zhao, Yikai Tu, Yaofeng Cui, Bin Peking University School of Computer Science National Engineering Laboratory for Big Data Analysis Technology and Application Beijing China Peng Cheng Laboratory Shenzhen China Zte Corporation China

ISBN: (纸本)9798350322279

Batch is an important pattern in data streams, which refers to a group of identical items that arrive closely. We find that some special batches that arrive periodically are of great value. In this paper, we formally define a new pattern, namely periodic batches. A group of periodic batches refers to several batches of the same item, where these batches arrive periodically. Studying periodic batches is important in many applications, such as caches, financial markets, online advertisements, networks, etc. We propose a one-pass sketching algorithm, namely the HyperCalm sketch, which takes two phases to detect periodic batches in real time. In phase 1, we propose a time-aware Bloom filter, namely HyperBloomFilter (HyperBF), to detect the start of batches. In phase 2, we propose an enhanced top-k algorithm, called Calm Space-Saving (CalmSS), to report top-k periodic batches. We theoretically derive the error bounds for HyperBF and CalmSS. Extensive experiments show HyperCalm outperforms the strawman solutions 4× in term of average relative error and 13.2× in term of speed. We also apply HyperCalm to a cache system and integrate HyperCalm into Apache Flink. All related codes are open-sourced. © 2023 IEEE.

关键词： Error analysis

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Intelligent Model SFAHP-ANFIS-PSO for Technical Capability Evaluation of Manufacturing Enterprises 9th

A Hybrid Intelligent Model SFAHP-ANFIS-PSO for Technical Cap...

引用

19th International Conference on Advanced data Mining and applications, ADMA 2023

作者： Liu, Tingting Ding, Xuefeng Jiang, Yuming Hu, Dasha College of Computer Science Sichuan University Chengdu610065 China Big Data Analysis and Fusion Application Technology Engineering Laboratory of Sichuan Province Chengdu610065 China

ISBN: (纸本)9783031466731

In the collaborative production environment of manufacturing tasks, the evaluation of enterprise technical capability in advance has a direct impact on the high-performance collaboration between the supplier and the demander of production tasks. In order to solve the problem of efficiency and accuracy in the past evaluation methods, this paper applies the adaptive neuro fuzzy inference system (ANFIS) to the field of enterprise technical capability evaluation for the first time, and proposes an improved hybrid intelligent model SFAHP-ANFIS-PSO based on fuzzy theory. The model takes the four key indexes which have the deepest impact on enterprise technical capability evaluation as the input variables of the model, and the input data are evaluated by ANFIS with high accuracy. Spherical fuzzy analytic hierarchy process (SFAHP) calculated the weight of each evaluation index to preprocess the ANFIS model. Particle swarm optimization algorithm (PSO) continuously optimized the model parameters in the training process, shortened the model training time, improved the evaluation efficiency, and further improved the accuracy of the evaluation results. The experimental results show that the SFAHP-ANFIS-PSO model has high convergence speed and accuracy of results, and can be used to evaluate the technical capability of enterprises with high efficiency and high accuracy. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Analytic hierarchy process

来源：评论

学校读者我要写书评

暂无评论

A Method for Identifying the Timeliness of Manufacturing data Based on Weighted Timeliness Graph 9th

A Method for Identifying the Timeliness of Manufacturing Dat...

引用

19th International Conference on Advanced data Mining and applications, ADMA 2023

作者： Liu, Zehua Ding, Xuefeng Jiang, Yuming Hu, Dasha College of Computer Science Sichuan University Chengdu610065 China Big Data Analysis and Fusion Application Technology Engineering Laboratory of Sichuan Province Chengdu610065 China

ISBN: (纸本)9783031466601

Timeliness is one of the important indicators of data quality. In industrial production processes, a large amount of dependent data is generated, often resulting in unclear timestamps. Therefore, this article combines the conclusion dependency graph into a process dependency graph to determine the identification order of the timeliness of each process data;By constructing a weighted timeliness graph (WTG) and path single flux, a data timeliness identification method that does not completely rely on timestamps is proposed. Finally, a time-effectiveness identification method based on weighted time-effectiveness graph was discussed through an example and 9 dependency rules, and the effectiveness of the method was verified through a set of experiments. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Continuous and generalized visual odometry based on FLANN_PSC-RANSAC_LSTM

引用

Journal of Intelligent and Fuzzy Systems 2024年第1-2期47卷 15-28页

作者： Li, Dengao Feng, Ran Wu, Fanming Zhao, Jinhua Zhao, Jumin College of Computer Science and Technology College of Data Science Taiyuan University of Technology Shanxi Taiyuan China College of Electronic Information and Optical Engineering Taiyuan University of Technology Shanxi Taiyuan China Key Laboratory of Big Data Fusion Analysis and Application of Shanxi Province Taiyuan University of Technology Shanxi Taiyuan China Intelligent Perception Engineering Technology Center of Shanxi Taiyuan China

In the field of simultaneous localization and mapping (SLAM), visual odometry (VO) always has great application prospects. In recent years, with the progress in the field of machine learning, methods based on neural networks are constantly being updated and applied. In this paper, we propose a continuous and generalized monocular visual odometry method based on features and neural networks. First, the feature information of adjacent image sequences is extracted by matching and troubleshooting algorithm (FLANN_PSC-RANSAC), then it and the corresponding six-degree-of-freedom information are simultaneously input into the long short-term memory artificial neural network (LSTM) for model construction, which not only ensures the reliability of the mode but also eliminates the influence of illumination on the data. In the real environment test, it has been effectively proved in terms of trajectory recovery accuracy and generalization ability to different environments and different illuminations. © 2024 - IOS Press. All rights reserved.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Understanding and improving fairness in cognitive diagnosis

引用

Science China(Information Sciences) 2024年第5期67卷 99-114页

作者： Zheng ZHANG Le WU Qi LIU Jiayu LIU Zhenya HUANG Yu YIN Yan ZHUANG Weibo GAO Enhong CHEN Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology& School of Data Science University of Science and Technology of China State Key Laboratory of Cognitive Intelligence School of Computer Science and Information Engineering Hefei University of Technology

Intelligent education is a significant application of artificial intelligence. One of the key research topics in intelligence education is cognitive diagnosis, which aims to gauge the level of proficiency among students on specific knowledge concepts(e.g., Geometry). To the best of our knowledge, most of the existing cognitive models primarily focus on improving diagnostic accuracy while rarely considering fairness issues; for instance, the diagnosis of students may be affected by various sensitive attributes(e.g., region). In this paper,we aim to explore fairness in cognitive diagnosis and answer two questions:(1) Are the results of existing cognitive diagnosis models affected by sensitive attributes?(2) If yes, how can we mitigate the impact of sensitive attributes to ensure fair diagnosis results? To this end, we first empirically reveal that several wellknown cognitive diagnosis methods usually lead to unfair performances, and the trend of unfairness varies among different cognitive diagnosis models. Then, we make a theoretical analysis to explain the reasons behind this phenomenon. To resolve the unfairness problem in existing cognitive diagnosis models, we propose a general fairness-aware cognitive diagnosis framework, FairCD. Our fundamental principle involves eliminating the effect of sensitive attributes on student proficiency. To achieve this, we divide student proficiency in existing cognitive diagnosis models into two components: bias proficiency and fair *** design two orthogonal tasks for each of them to ensure that fairness in proficiency remains independent of sensitive attributes and take it as the final diagnosed result. Extensive experiments on the Program for International Student Assessment(PISA) dataset clearly show the effectiveness of our framework.

关键词： fairness intelligent education cognitive diagnosis psychometrics adversarial learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：