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

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Rudolph, Günter Wagner, Markus Tu Dortmund University Department of Computer Science Dortmund Germany Monash University Department of Data Science and Ai Clayton Australia

ISBN: (纸本)9798350308365

Parameter control refers to the techniques that dynamically adapt the parameter values of the evolutionary algorithm during the optimization process, such as population size, crossover rate, or operator selection. Adaptation can improve the performance and robustness of the algorithm, however, parameter control mechanisms themselves need to be designed and configured carefully. With this article, we contribute a systematic investigation of an adaptive, multi-objective algorithm that is designed for the optimisation of problems in unbounded integer decision spaces. We find that (1) adaptation outperforms the best static configurations by 39-82 %, and (2) performance of the multi-objective algorithm is often independent of the adaptation scheme's initial configuration. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A Review on Blockchain Technology in Health Care Systems 6th

A Review on Blockchain Technology in Health Care Systems

引用

6th International Conference on Communications and Cyber-Physical Engineering, ICCCE 2023

作者： Rajendar, Janga Kishore Kumar, Botcha Verma, Toran Lavanya, Mangalampalli Sasha Sai Lakshmi Department of Computer Science Engineering - Data Science CMR Engineering College Kandlakoya Telangana Hyderabad501401 India

ISBN: (纸本)9789819971367

Blockchain is a distributed database that multiple parties can maintain and share. This new technology is expected to greatly impact the healthcare industry. It can help address various issues related to patient care. Through the use of blockchain technology, data can be moved in real-time without exposing it to various risks such as theft and forgery. This paper aims to introduce the general idea of the Blockchain and its applications in the healthcare industry. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Enhancing User Experience in Games with Large Language Models

Enhancing User Experience in Games with Large Language Model...

引用

19th International Conference on Software Technologies, ICSOFT 2024

作者： Paduraru, Ciprian Cernat, Marina Stefanescu, Alin Department of Computer Science University of Bucharest Romania Institute for Logic and Data Science Romania

ISBN: (纸本)9789897587061

This paper explores the application of state-of-the-art natural language processing (NLP) technologies to improve the user experience in games. Our motivation stems from the realization that a virtual assistant’s input during games or simulation applications can significantly assist the user in real-time problem solving, suggestion generation, and dynamic adjustments. We propose a novel framework that seamlessly integrates large-scale language models (LLMs) into game environments and enables intelligent assistants to take the form of physical 3D characters or virtual background entities within the player narrative. Our evaluation considers computational requirements, latency and quality of results using techniques such as synthetic dataset generation, fine-tuning, Retrieval Augmented Generation (RAG) and security mechanisms. Quantitative and qualitative evaluations, including real user feedback, confirm the effectiveness of our approach. The framework is implemented as an open-source plugin for the Unreal Engine and has already been successfully used in a game demo. The presented methods can be extended to simulation applications and serious games in general. © 2024 by SCITEPRESS – science and Technology Publications, Lda.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Tensor-based forward-backward algorithms in the physics-informed coupled hidden markov model

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第3期5卷 1052-1066页

作者： Zhang, Shunli Yang, Laurence T. Zhang, Yue Lu, Zhixing Cui, Zongmin School of Computer and Big Data Science Jiujiang University Jiujiang332005 China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Computer Science and Technology Hainan University Haikou570228 China Department of Computer Science St. Francis Xavier University AntigonishNSB2G2W5 Canada

Imposing data-driven with physical laws for user activity prediction could effectively solve various physical problems such as smart care, surveillance, and human-robot. In the growing field of artificial intelligence, the application of activity prediction based on the physical coupled hidden Markov model (CHMM) and tensor theory with physical properties has attracted increasing attentions. However, existing CHMMs usually only consider the time-series characteristic of data, while ignoring physical characteristics of user activity such as periodicity, timing, and correlation. Moreover, they are all matrix-based models, which could not holistically analyze the dependencies among physical states. The aforementioned disadvantages lead to lower prediction accuracy of the CHMM. To remove these disadvantages, three physics-informed tensor-based CHMMs are first constructed by incorporating prior physical knowledge. Then, the corresponding forward-backward algorithms are designed for resolving the evaluation problem of the CHMM. These algorithms could overall model multiple physical features by imposing physics and prior knowledge into the CHMM during training to improve the precision of probabilistic computing. The algorithms reduce the dependence of the model on training data by adding physical features. Finally, the comparative experiments show that our algorithms have better performances than existing prediction methods in precision and efficiency. In addition, further self-comparison experiments verify that our algorithms are effective and practical. Impact Statement-Through the analysis of users' behavior habits, consumption habits, preferences, etc., users? potential needs may be discovered. This discovery could help predict users' activities. If a waiter predicts the user's next activity. He gives her/him unexpected services to meet users' next needs. Obviously, it would significantly improve user satisfaction. In addition, connecting the front and rear products co

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

Comparison of the SOLA model and ARIMA for Cloud Computing Resources Allocations 4

Comparison of the SOLA model and ARIMA for Cloud Computing R...

引用

4th International Multidisciplinary Information Technology and Engineering Conference, IMITEC 2024

作者： Prince Sekwatlakwatla, Sello Malele, Vusumuzi North-West University Unit for Data Science and Computing Department of Computer Science and Information Systems South Africa

ISBN: (纸本)9798350387988

Cloud computing solutions are becoming more and more popular as a way for organizations to improve productivity, save costs, and simplify procedures. The advantage of cloud services is that they enable users to store data remotely and access on-demand applications and services from a shared pool of configurable computing resources. Cloud computing resource allocation faces challenges in load balancing, effective resource management, and compliance with regulatory and legal requirements, requiring complex tools and techniques for optimal use. Most organizations are moving to cloud services and encouraging their clients to access services online. However, effective resource allocation is critical for improving performance and lowering costs in this area. Due to unpredictable network traffic in cloud computing, resource allocation is challenging, which causes customers to complain about application timeouts, delayed system times, and higher bandwidth use during peak hours. This entails allocating resources to various users and programs, such as memory, processing power, storage, and network bandwidth. In this regard, this study compares the ensemble method, which is stepwise Gaussian Linear Autoregressive (SGLA) and the individual method, which is autoregressive integrated moving average (ARIMA). The results show SGLA prediction accuracy increased with an average of 97.9%, and ARIMA prediction showed an accuracy of 71.5%. In this regard the ensemble method performed better than individual methods using the same datasets. The study recommends the ensemble method for the prediction and allocation of resources in cloud computing. © 2024 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

Iterative Methods via Locally Evolving Set Process 38

Iterative Methods via Locally Evolving Set Process

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zhou, Baojian Sun, Yifan Harikandeh, Reza Babanezhad Guo, Xingzhi Yang, Deqing Xiao, Yanghua The School of Data Science Fudan University China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China Department of Computer Science Stony Brook University United States Samsung SAIT AI Lab

Given the damping factor α and precision tolerance ϵ, Andersen et al. [2] introduced Approximate Personalized PageRank (APPR), the de facto local method for approximating the PPR vector, with runtime bounded by Θ(1/(αϵ)) independent of the graph size. Recently, Fountoulakis & Yang [12] asked whether faster local algorithms could be developed using Õ(1/(√αϵ)) operations. By noticing that APPR is a local variant of Gauss-Seidel, this paper explores the question of whether standard iterative solvers can be effectively localized. We propose to use the locally evolving set process, a novel framework to characterize the algorithm locality, and demonstrate that many standard solvers can be effectively localized. Let vol(St) and γt be the running average of volume and the residual ratio of active nodes St during the process. We show vol(St)/γt ≤ 1/ϵ and prove APPR admits a new runtime bound Õ(vol(St)/(αγt)) mirroring the actual performance. Furthermore, when the geometric mean of residual reduction is Θ(√α), then there exists c ∈ (0, 2) such that the local Chebyshev method has runtime Õ(vol(St)/(√α(2 − c))) without the monotonicity assumption. Numerical results confirm the efficiency of this novel framework and show up to a hundredfold speedup over corresponding standard solvers on real-world graphs. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LexC-Gen: Generating data for Extremely Low-Resource Languages with Large Language Models and Bilingual Lexicons

LexC-Gen: Generating Data for Extremely Low-Resource Languag...

引用

2024 Findings of the Association for Computational Linguistics, EMNLP 2024

作者： Yong, Zheng-Xin Menghini, Cristina Bach, Stephen H. Department of Computer Science Brown University United States Data Science Institute Brown University United States

ISBN: (纸本)9798891761681

data scarcity in low-resource languages can be addressed with word-to-word translations from labeled task data in high-resource languages using bilingual lexicons. However, bilingual lexicons often have limited lexical overlap with task data, which results in poor translation coverage and lexicon utilization. We propose lexicon-conditioned data generation (LexC-Gen), a method that generates low-resource-language classification task data at scale. Specifically, LexC-Gen first uses high-resource-language words from bilingual lexicons to generate lexicon-compatible task data, and then it translates them into low-resource languages with bilingual lexicons via word translation. Across 17 extremely low-resource languages, LexC-Gen generated data is competitive with expert-translated gold data, and yields on average 5.6 and 8.9 points improvement over existing lexicon-based word translation methods on sentiment analysis and topic classification tasks respectively. Through ablation study, we show that conditioning on bilingual lexicons is the key component of LexC-Gen. LexC-Gen serves as a potential solution to close the performance gap between open-source multilingual models such as BLOOMZ and state-of-the-art commercial models like GPT-4o on low-resource-language tasks. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

An Artificial Neural Network-Based Model for Effective Software Development Effort Estimation

引用

computer Systems science & Engineering 2023年第2期44卷 1309-1324页

作者： Junaid Rashid Sumera Kanwal Muhammad Wasif Nisar Jungeun Kim Amir Hussain Department of Computer Science and Engineering Kongju National UniversityCheonan31080Korea Department of Computer Science COMSATS University IslamabadWah CampusIslamabad47040Pakistan Centre of AI and Data Science Edinburgh Napier UniversityEdinburghEH114DYUK

In project management,effective cost estimation is one of the most cru-cial activities to efﬁciently manage resources by predicting the required cost to fulﬁll a given ***,ﬁnding the best estimation results in software devel-opment is ***,accurate estimation of software development efforts is always a concern for many *** this paper,we proposed a novel soft-ware development effort estimation model based both on constructive cost model II(COCOMO II)and the artiﬁcial neural network(ANN).An artiﬁcial neural net-work enhances the COCOMO model,and the value of the baseline effort constant A is calibrated to use it in the proposed model *** state-of-the-art publicly available datasets are used for *** backpropagation feed-forward procedure used a training set by iteratively processing and training a neural *** proposed model is tested on the test *** estimated effort is compared with the actual effort *** results show that the effort estimated by the proposed model is very close to the real effort,thus enhanced the reliability and improving the software effort estimation accuracy.

关键词： Software cost estimation neural network backpropagation forward neural networks software effort estimation artiﬁcial neural network

来源：评论

学校读者我要写书评

暂无评论

Customer Segmentation Based on Recency, Frequency, Monetary, Variety and Duration (RFMVD) 2

Customer Segmentation Based on Recency, Frequency, Monetary,...

引用

2nd International Conference on Technology Innovation and Its Applications, ICTIIA 2024

作者： Sundari, Agus Lydia, Maya Silvi Muchtar, Muhammad Anggia Universitas Sumatera Utara Faculty of Computer Science and Information Technology Department of Data Science and Artificial Intelligence Medan Indonesia Universitas Sumatera Utara Faculty of Computer Science and Information Technology Department of Computer Science Medan Indonesia

ISBN: (纸本)9798350351613

In banking, maintaining customer retention and customer satisfaction are important. Effective customer segmentation can be a strategic tool to improve customer loyalty and business performance. This research can assist banks in developing marketing strategies to retain customers and improve services based on bill payment transactions. The data that will be used in this study is bill payment transaction data at regional banks in 2023, as for the types of bill payments made by customers, namely electricity, water, telephone payments, and internet bills. The amount of data used is 702,174 rows. This research uses K-Means clustering to group customers based on recency (the last time the customer made a transaction), frequency (the number of customers making transactions), monetary (the nominal amount of money spent by the customer), variety (the number of types of bills paid) and duration (the average duration of time the customer makes the previous transaction until the next transaction) (RFMVD). The results of customer segmentation based on recency, frequency, monetary, variety and duration using K-Means clustering produce 3 customer groups, namely passive customers, loyal customers, and VIP customers. The silhouette score value on customer segmentation using K-Means clustering is 0.7303, which indicates that the grouping is quite good and the number of clusters is correct. © 2024 IEEE.

关键词： bill payments Customer segmentation K-Means clustering RFMVD Model silhouette score

来源：评论

学校读者我要写书评

暂无评论

Dual VC Dimension Obstructs Sample Compression by Embeddings 37

Dual VC Dimension Obstructs Sample Compression by Embeddings

引用

37th Annual Conference on Learning Theory, COLT 2024

作者： Chase, Zachary Chornomaz, Bogdan Hanneke, Steve Moran, Shay Yehudayoff, Amir Department of Mathematics Technion Israel Department of Computer Science Purdue University United States Departments of Mathematics Computer Science and Data and Decision Sciences Technion Google Research Israel Department of Computer Science Copenhagen University Denmark

This work studies embedding of arbitrary VC classes in well-behaved VC classes, focusing particularly on extremal classes. Our main result expresses an impossibility: such embeddings necessarily require a significant increase in dimension. In particular, we prove that for every d there is a class with VC dimension d that cannot be embedded in any extremal class of VC dimension smaller than exponential in d. In addition to its independent interest, this result has an important implication in learning theory, as it reveals a fundamental limitation of one of the most extensively studied approaches to tackling the long-standing sample compression conjecture (Warmuth, 2003). Concretely, the approach proposed by Floyd and Warmuth (1995) entails embedding any given VC class into an extremal class of a comparable dimension, and then applying an optimal sample compression scheme for extremal classes. However, our results imply that this strategy would in some cases result in a sample compression scheme at least exponentially larger than what is predicted by the sample compression conjecture. The above implications follow from a general result we prove: any extremal class with VC dimension d has dual VC dimension at most 2d + 1. This bound is exponentially smaller than the classical bound 2d+1-1 of Assouad (1983), which applies to general concept classes (and is known to be unimprovable for some classes). We in fact prove a stronger result, establishing that 2d + 1 upper bounds the dual Radon number of extremal classes. This theorem represents an abstraction of the classical Radon theorem for convex sets, extending its applicability to a wider combinatorial framework, without relying on the specifics of Euclidean convexity. The proof utilizes the topological method and is primarily based on variants of the Topological Radon Theorem (Bajmóczy and Bárány, 1979). © 2024 Z. Chase, B. Chornomaz, S. Hanneke, S. Moran & A. Yehudayoff.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：