Open Access. Powered by Scholars. Published by Universities.®

Artificial Intelligence and Robotics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1081 - 1110 of 11187

Full-Text Articles in Artificial Intelligence and Robotics

Iostom: Offline Imitation Learning From Observations Via State Transition Occupancy Matching, Quang Anh Pham, Brahmanage Janaka Chathuranga Thilakarathna, Tien Mai, Akshat Kumar Dec 2025

Iostom: Offline Imitation Learning From Observations Via State Transition Occupancy Matching, Quang Anh Pham, Brahmanage Janaka Chathuranga Thilakarathna, Tien Mai, Akshat Kumar

Research Collection School Of Computing and Information Systems

Offline Learning from Observations (LfO) focuses on enabling agents to imitate expert behavior using datasets that contain only expert state trajectories and separate transition data with suboptimal actions. This setting is both practical and critical in real-world scenarios where direct environment interaction or access to expert action labels is costly, risky, or infeasible. Most existing LfO methods attempt to solve this problem through state or state-action occupancy matching. They typically rely on pretraining a discriminator to differentiate between expert and non-expert states, which could introduce errors and instability—especially when the discriminator is poorly trained. While recent discriminator-free methods have emerged, …

Go to article

No Experts, No Problem: Avoidance Learning From Bad Demonstrations, Minh Huy Hoang, Tien Mai, Pradeep Varakantham Dec 2025

No Experts, No Problem: Avoidance Learning From Bad Demonstrations, Minh Huy Hoang, Tien Mai, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

This paper addresses the problem of learning avoidance behavior within the context of offline imitation learning. In contrast to conventional methodologies that prioritize the replication of expert or near-expert demonstrations, our work investigates a setting where expert (or desirable) data is absent, and the objective is to learn to eschew undesirable actions by leveraging demonstrations of such behavior (i.e., learning from negative examples).To address this challenge, we propose a novel training objective grounded in the maximum entropy principle. We further characterize the fundamental properties of this objective function, reformulating the learning process as a cooperative inverse Q-learning task. Moreover, we …

Go to article

Rising From Ashes: Generalized Federated Learning Via Dynamic Parameter Reset, Jiahao Wu, Ming Hu, Yanxin Yang, Xiaofei Xie, Zekai Chen, Chenyu Song, Mingsong Chen Dec 2025

Rising From Ashes: Generalized Federated Learning Via Dynamic Parameter Reset, Jiahao Wu, Ming Hu, Yanxin Yang, Xiaofei Xie, Zekai Chen, Chenyu Song, Mingsong Chen

Research Collection School Of Computing and Information Systems

Although Federated Learning (FL) is promising for privacy-preserving collaborative model training, it suffers from low inference performance due to heterogeneous client data. Due to heterogeneous data across clients, FL training easily learns client-specific overfitting features. Existing FL methods adopt coarsegrained averaging, which can easily cause the global model to get stuck in local optima, leading to poor generalization. Specifically, this paper presents a novel FL framework, FedPhoenix, to address this issue. It stochastically resets partial parameters in each round to destroy some features of the global model, guiding FL training to learn multiple generalized features for inference rather than specific …

Go to article

When Less Language Is More: Language-Reasoning Disentanglement Makes Llms Better Multilingual Reasoners, Weixiang Zhao, Jiahe Guo, Yang Deng, Tongtong Wu, Wenxuan Zhang, Yulin Hu, Xingyu Sui, Yanyan Zhao, Wanxiang Che, Bing Qin, Tat-Seng Chua, Ting Liu Dec 2025

When Less Language Is More: Language-Reasoning Disentanglement Makes Llms Better Multilingual Reasoners, Weixiang Zhao, Jiahe Guo, Yang Deng, Tongtong Wu, Wenxuan Zhang, Yulin Hu, Xingyu Sui, Yanyan Zhao, Wanxiang Che, Bing Qin, Tat-Seng Chua, Ting Liu

Research Collection School Of Computing and Information Systems

Multilingual reasoning remains a significant challenge for large language models (LLMs), with performance disproportionately favoring high-resource languages. Drawing inspiration from cognitive neuroscience, which suggests that human reasoning functions largely independently of language processing, we hypothesize that LLMs similarly encode reasoning and language as separable components that can be disentangled to enhance multilingual reasoning. To evaluate this, we perform a causal intervention by ablating language-specific representations at inference time. Experiments on 10 open-weight LLMs spanning 11 typologically diverse languages show that this language-specific ablation consistently boosts multilingual reasoning performance. Layer-wise analyses further confirm that language and reasoning representations can be effectively …

Go to article

Sheetpedia: A 300k-Spreadsheet Corpus For Spreadsheet Intelligence And Llm Fine-Tuning, Zailong Tian, Zhuoheng Han, Houfeng Wang, Lizi Liao Dec 2025

Sheetpedia: A 300k-Spreadsheet Corpus For Spreadsheet Intelligence And Llm Fine-Tuning, Zailong Tian, Zhuoheng Han, Houfeng Wang, Lizi Liao

Research Collection School Of Computing and Information Systems

Spreadsheets are widely used for data analysis and reporting, yet their complex structure and formula logic pose significant challenges for AI systems. We introduce Sheetpedia, a large-scale corpus of over 290,000 diverse spreadsheets (from 324,000+ workbooks) compiled from enterprise email archives and online forums. We detail a rigorous collection and preprocessing pipeline (integrating the Enron email spreadsheet archive and the Fuse web corpus, plus a new crawl of Excel forums) to standardize formats, filter languages, and remove duplicates. Sheetpedia provides extensive coverage of real formulas and annotations – addressing a gap left by prior table datasets (e.g. web tables used …

Go to article

Instance-Level Video Depth In Groups Beyond Occlusions, Yuan Liang, Yang Zhou, Ziming Sun, Tianyi Xiang, Guiqing Li, Shengfeng He Dec 2025

Instance-Level Video Depth In Groups Beyond Occlusions, Yuan Liang, Yang Zhou, Ziming Sun, Tianyi Xiang, Guiqing Li, Shengfeng He

Research Collection School Of Computing and Information Systems

Depth estimation in dynamic, multi-object scenes remains a major challenge, especially under severe occlusions. Existing monocular models, including foundation models, struggle with instance-wise depth consistency due to their reliance on global regression. We tackle this problem from two key aspects: data and methodology. First, we introduce the Group Instance Depth (GID) dataset, the first large-scale video depth dataset with instance-level annotations, featuring 101,500 frames from real-world activity scenes. GID bridges the gap between synthetic and real-world depth data by providing high-fidelity depth supervision for multi-object interactions. Second, we propose InstanceDepth, the first occlusion-aware depth estimation framework for multi-object environments. Our …

Go to article

Robust Hallucination Detection In Llms Via Adaptive Token Selection, Mengjia Niu, Hamed Haddadi, Guansong Pang Dec 2025

Robust Hallucination Detection In Llms Via Adaptive Token Selection, Mengjia Niu, Hamed Haddadi, Guansong Pang

Research Collection School Of Computing and Information Systems

Hallucinations in large language models (LLMs) pose significant safety concerns that impede their broader deployment. Recent research in hallucination detection has demonstrated that LLMs’ internal representations contain truthfulness hints, which can be harnessed for detector training. However, the performance of these detectors is heavily dependent on the internal representations of predetermined tokens, fluctuating considerably when working on free-form generations with varying lengths and sparse distributions of hallucinated entities. To address this, we propose HaMI, a novel approach that enables robust detection of hallucinations through adaptive selection and learning of critical tokens that are most indicative of hallucinations. We achieve this …

Go to article

Semi‑Supervised Graph Anomaly Detection Via Robust Homophily Learning, Guoguo Ai, Hezhe Qiao, Hui Yan, Guansong Pang Dec 2025

Semi‑Supervised Graph Anomaly Detection Via Robust Homophily Learning, Guoguo Ai, Hezhe Qiao, Hui Yan, Guansong Pang

Research Collection School Of Computing and Information Systems

Current semi-supervised graph anomaly detection (GAD) methods utilizes a small set of labeled normal nodes to identify abnormal nodes from a large set of unlabeled nodes in a graph. These methods posit that 1) normal nodes share a similar level of homophily and 2) the labeled normal nodes can well represent the homophily patterns in the entire normal class. However, this assumption often does not hold well since normal nodes in a graph can exhibit diverse homophily in real-world GAD datasets. In this paper, we propose RHO, namely Robust Homophily Learning, to adaptively learn such homophily patterns. RHO consists of …

Go to article

Efskip: A New Error Feedback With Linear Speedup For Compressed Federated Learning With Arbitrary Data Heterogeneity, Hongyan Bao, Pengwen Chen, Ying Sun, Zhize Li Dec 2025

Efskip: A New Error Feedback With Linear Speedup For Compressed Federated Learning With Arbitrary Data Heterogeneity, Hongyan Bao, Pengwen Chen, Ying Sun, Zhize Li

Research Collection School Of Computing and Information Systems

Due to the communication bottleneck in distributed and decentralized federated learning applications, algorithms using compressed communication have attracted significant attention. The Error Feedback (EF) is a widely-studied compression framework for convergence with biased compressors such as top-k sparsification. Although various improvements have been obtained in recent years, the theoretical guarantee for EF-type framework is still limited. Previous works either 1) rely on strong assumptions such as bounded gradient/dissimilarity assumptions, thus can not deal with arbitrary data heterogeneity and also slow the convergence speed, or 2) can not enjoy linear speedup in the number of clients. In this work, we propose …

Go to article

Coresets For Clustering Under Stochastic Noise, Lingxiao Huang, Zhize Li, Nisheeth K. Vishnoi, Runkai Yang, Haoyu Zhao Dec 2025

Coresets For Clustering Under Stochastic Noise, Lingxiao Huang, Zhize Li, Nisheeth K. Vishnoi, Runkai Yang, Haoyu Zhao

Research Collection School Of Computing and Information Systems

We study the problem of constructing coresets for $(k, z)$-clustering when the input dataset is corrupted by stochastic noise drawn from a known distribution. In this setting, evaluating the quality of a coreset is inherently challenging, as the true underlying dataset is unobserved. To address this, we investigate coreset construction using surrogate error metrics that are tractable and provably related to the true clustering cost. We analyze a traditional metric from prior work and introduce a new error metric that more closely aligns with the true cost. Although our metric is defined independently of the noise distribution, it enables approximation …

Go to article

Generalization Bounds For Rank‑Sparse Neural Networks, Antoine Ledent, Rodrigo Alves, Yunwen Lei Dec 2025

Generalization Bounds For Rank‑Sparse Neural Networks, Antoine Ledent, Rodrigo Alves, Yunwen Lei

Research Collection School Of Computing and Information Systems

It has been recently observed in much of the literature that neural networks exhibit a bottleneck rank property: for larger depths, the activation and weights of neural networks trained with gradient-based methods tend to be of approximately low rank. In fact, the rank of the activations of each layer converges to a fixed value referred to as the “bottleneck rank”, which is the minimum rank required to represent the training data. This perspective is in line with the observation that regularizing linear networks (without activations) with weight decay is equivalent to minimizing the Schatten p quasi norm of the neural …

Go to article

Copyright Ownership And Duration Of Ai-Authored Works, Cheng Lim Saw Dec 2025

Copyright Ownership And Duration Of Ai-Authored Works, Cheng Lim Saw

Research Collection Yong Pung How School Of Law

On the assumption that Parliament has endorsed the notion of AI authorship and the prospect that copyright may well subsist in works created autonomously by the AI itself, this essay further explores allied issues surrounding the ownership and duration of copyright in AI-authored works.

Go to article

Navigating Ai-Nature Frictions: Autonomous Vehicle Testing And Nature-Based Constraints, Prerona Das, Orlando Woods, Lily Kong Dec 2025

Navigating Ai-Nature Frictions: Autonomous Vehicle Testing And Nature-Based Constraints, Prerona Das, Orlando Woods, Lily Kong

Research Collection College of Integrative Studies

In cities, the application of Artificial Intelligence (AI) is being directed towards transforming different aspects of urban life. These applications take material form in urban spaces, with autonomous vehicles (AVs) providing a prominent example. AI systems rely on large volumes of data on their surroundings to refine the algorithms and enhance the accuracy of prediction for operational efficiency and safety. However, such algorithmic learning and execution can present challenges when dealing with the unpredictable, complex, and dynamic aspects of urban spaces. Nature is a paradigmatic example of such unpredictability, because natural phenomena usually defy consistent patterns and precise data-based modelling. …

Go to article

From Digital Divide To Equity-Enhancing Diffusion: Generative Ai And Writing Quality, Rebecca Tukachinsky Forster, Kerk Kee, Gabriel Miao Li Nov 2025

From Digital Divide To Equity-Enhancing Diffusion: Generative Ai And Writing Quality, Rebecca Tukachinsky Forster, Kerk Kee, Gabriel Miao Li

Communication Faculty Articles and Research

This study investigates whether generative AI can narrow the gap between stronger and developing writers and explores the mechanisms underlying these effects. In a within-subject experiment, students wrote two essays, with and without AI assistance. Computer-aided analysis of the writing quality confirmed that while all students benefited from AI, that less skillful writers gained more. There was also no evidence of skillful writers using AI in more sophisticated and beneficial ways. The study contributes to theorizing the digital divide and offers insights into maximizing the benefits of AI tools. Theoretically, we situate generative-AI use within Diffusion of Innovations, treating ChatGPT …

Go to article

Ai-Based Mapping Of Offshore Wind Energy Around The Korean Peninsula Using Sentinel-1 Sar And Numerical Weather Prediction Data, Jason Sung-Uk Joh, Son V. Nghiem, Menas Kafatos, Jay Liu, Jinsoo Kim, Seung Hee Kim Nov 2025

Ai-Based Mapping Of Offshore Wind Energy Around The Korean Peninsula Using Sentinel-1 Sar And Numerical Weather Prediction Data, Jason Sung-Uk Joh, Son V. Nghiem, Menas Kafatos, Jay Liu, Jinsoo Kim, Seung Hee Kim

Institute for ECHO Articles and Research

Offshore wind farm projects are being promoted in the seas surrounding the Korean Peninsula to secure renewable energy. To support site selection, offshore wind resource maps were generated using deep neural networks trained on Sentinel-1 SAR imagery, numerical weather prediction data, offshore wind observations, sea surface temperature, and bathymetry. The deep neural network (DNN) framework consisted of six sub-models targeting eastward and northward wind components across three regions—the Yellow Sea, Korea Strait, and East Sea—to account for spatial heterogeneity. The proposed models outperformed existing approaches, achieving mean absolute errors (MAE) ranging from 1.31 to 1.69 m/s and correlation coefficients (CC) …

Go to article

Benchmarking Dna Foundation Models For Genomic And Genetic Tasks, Haonan Feng, Lang Wu, Bingxin Zhao, Chad Huff, Jianjun Zhang, Jia Wu, Lifeng Lin, Peng Wei, Chong Wu Nov 2025

Benchmarking Dna Foundation Models For Genomic And Genetic Tasks, Haonan Feng, Lang Wu, Bingxin Zhao, Chad Huff, Jianjun Zhang, Jia Wu, Lifeng Lin, Peng Wei, Chong Wu

School of Medicine Faculty Publications

The rapid evolution of DNA foundation models promises to revolutionize genomics, yet comprehensive evaluations are lacking. Here, we present a comprehensive, unbiased benchmark of five models (DNABERT-2, Nucleotide Transformer V2, HyenaDNA, Caduceus-Ph, and GROVER) across diverse genomic and genetic tasks including sequence classification, gene expression prediction, variant effect quantification, and topologically associating domain (TAD) region recognition, using zero-shot embeddings. Our analysis reveals that mean token embedding consistently and significantly improves sequence classification performance, outperforming other pooling strategies. Model performance varies among tasks and datasets; while general purpose DNA foundation models showed competitive performance in pathogenic variant identification, they were less …

Go to article

Introduction To Machine Learning And Machine Learning Systems, Raffi T. Khatchadourian Ph.D. Nov 2025

Introduction To Machine Learning And Machine Learning Systems, Raffi T. Khatchadourian Ph.D.

Open Educational Resources

Lecture slides introducing machine learning and machine learning systems for an undergraduate software engineering course. Topics include what machine learning is and how it differs from traditional programming, foundation models, the major types of learning (supervised, unsupervised, reinforcement, and others), and applications across domains. Using a food-delivery time-prediction case study, the deck walks through a typical ML pipeline—data collection and cleaning, feature engineering, model training, and evaluation—and covers evaluation methods (precision and recall, confusion matrices, error measures) along with underfitting versus overfitting and the realities of learning and evaluation in production. Based on "Machine Learning in Production/AI Engineering" by Christian …

Go to article

Ai-Driven Optimization Of Wind Energy Distribution In Texas Using Multi-Agent Reinforcement Learning, Waleed Amer, Owolabi Oluwadamilola, Bassey Ogbonnaya Nov 2025

Ai-Driven Optimization Of Wind Energy Distribution In Texas Using Multi-Agent Reinforcement Learning, Waleed Amer, Owolabi Oluwadamilola, Bassey Ogbonnaya

SMU Data Science Review

Abstract. The integration of large-scale wind power into modern electrical grids presents persistent challenges due to variability, curtailment, and compliance with operational constraints. This study proposes a multi-agent reinforcement learning (MARL) framework for optimizing wind energy distribution within the Texas power grid. The system employs three specialized agents—managing wind curtailment, storage utilization, and load adjustments—to collaboratively balance supply and demand under dynamic grid conditions. Using historical operational data from the Electric Reliability Council of Texas (ERCOT), the framework was trained and evaluated on a range of scenarios encompassing both typical and extreme operating conditions. Results demonstrate substantial performance improvements compared …

Go to article

Archaeological Predictive Meta-Modeling In Pre-Columbian Mexico, Peter Stamm Nov 2025

Archaeological Predictive Meta-Modeling In Pre-Columbian Mexico, Peter Stamm

Electronic Theses and Dissertations

Archaeological Predictive Modeling stands firmly as an important tool for Archaeologists to predict undiscovered sites from civilizations all across the globe. While powerful, this methodology is not without its own set of qualms. Striking a balance between pure a data-driven approach while also observing leading expert theories can be a complicated task. Going further, deciding on the specific domain of features to emphasize or overlook can be a challenge within itself, as one misstep can drastically change the output of model, sometimes for the worst. In addition, creating models that can expose their reasoning process can be rather difficult to …

Go to article

Unless Ai Washes The Dishes, Can We Really Call It Intelligent?, Essraa Nawar Nov 2025

Unless Ai Washes The Dishes, Can We Really Call It Intelligent?, Essraa Nawar

Library Articles and Research

"A few weeks ago, I found myself sitting with a question that keeps resurfacing as AI becomes louder, faster, and everywhere. What happens when the models know everything about our lives except the one thing that matters most in the moment. It is remarkable how much of human decision making is driven not by external information but by internal states. A tightening in the chest. A sudden clarity. A quiet discomfort that redirects us before we can explain why. These signals guide our choices in ways computation cannot replicate."

Go to article

Fair Use In The Age Of Generative Ai: Navigating Copyright Challenges In Educational Contexts, Wendy Wallberg Nov 2025

Fair Use In The Age Of Generative Ai: Navigating Copyright Challenges In Educational Contexts, Wendy Wallberg

Faculty and Staff Publications & Presentations

Generative AI tools are everywhere, but what’s actually allowed when it comes to copyright and teaching? This session breaks down what fair use means in the age of AI, covers current legal cases, and offers practical tools to help educators and institutions use AI responsibly and confidently.

Go to article

A Usv Path Planning Algorithm Under Special Environment Based On Td3-Rrt, Jitong Chen, Jiajia Zhou, Di Wu, Hailong Jiang Nov 2025

A Usv Path Planning Algorithm Under Special Environment Based On Td3-Rrt, Jitong Chen, Jiajia Zhou, Di Wu, Hailong Jiang

Journal of System Simulation

Abstract: In view of USV path planning in special environments such as multiple obstacles, large-size obstacles, and narrow passages, the rapidly-exploring random tree (RRT) algorithm suffers from drawbacks such as a large sampling base, low success rate, and zigzagging planned path. To address these problems, a global path planning algorithm (TD3-RRT) was proposed based on the twin delayed deep deterministic policy gradient (TD3). The USV path search model was established by combining the RRT algorithm with deep reinforcement learning. Forward looking detection was used to sense the environment to adaptively adjust the step size. The path search direction was exported …

Go to article

Twin Modeling Of Gearbox Fault Early Warning System Based On Spatio-Temporal Characteristics, Yuanxing Tian, Zeyin Han, Ning Wang, Baoding Su, Weilin Xiang Nov 2025

Twin Modeling Of Gearbox Fault Early Warning System Based On Spatio-Temporal Characteristics, Yuanxing Tian, Zeyin Han, Ning Wang, Baoding Su, Weilin Xiang

Journal of System Simulation

Abstract: The wind turbine gearbox cannot effectively collect vibration signals under complex faults, which leads to the decline of fault early warning accuracy of wind turbine gearbox. To address this issue, this study investigated the twin modeling of gearbox fault early warning system based on spatio-temporal characteristics. Through the information acquisition subsystem and optical fiber sensing technology, the time sequence and spatial position data of the wind turbine gearbox during operation were collected in real time to obtain spatio-temporal characteristic data. By using the twin space, the collected spatiotemporal characteristic data of the gearbox were transmitted to the virtual space. …

Go to article

Path Planning For Mobile Robots Based On Improved Artificial Potential Field Algorithm, Chi Zhang, Wei Wei Nov 2025

Path Planning For Mobile Robots Based On Improved Artificial Potential Field Algorithm, Chi Zhang, Wei Wei

Journal of System Simulation

Abstract: In view of the problems of unreachable target areas and easy local minima in traditional artificial potential field methods, an improved artificial potential field method was proposed. The improved algorithm optimized the repulsive field function by introducing obstacle angle factors and distance factors to control the repulsive force magnitude. At the same time, an additional repulsive force towards the target point was added to solve the problem of unreachable target areas in traditional algorithms. When the robot fell into a local minimum, by introducing turning towards obstacles and turning factors to accurately apply escape forces to the robot, the …

Go to article

Improvement Of Slam Localization Accuracy In Ar By Enhancing Yolov8, Jia Liu, Zengwei Zhang, Dapeng Chen, Nanxuan Huang, Bin Wang, Hong Song Nov 2025

Improvement Of Slam Localization Accuracy In Ar By Enhancing Yolov8, Jia Liu, Zengwei Zhang, Dapeng Chen, Nanxuan Huang, Bin Wang, Hong Song

Journal of System Simulation

Abstract: In the presence of dynamic interference in the environment, traditional simultaneous localization and mapping (SLAM) methods often experience reduced precision and stability in the registration of virtual objects during three-dimensional registration in augmented reality (AR). To address these issues, an improved method for dynamic scenes based on semantic segmentation and optical flow tracking was proposed. The convolutional block attention module (CBAM) attention mechanism was incorporated into YOLOv8 to enhance its focus on dynamic objects in the environment, thereby improving detection performance and accuracy. The semantic segmentation functionality of the improved YOLOv8 was integrated into the front-end of ORB-SLAM3 to …

Go to article

Optimization Of Service Caching And Computation Offloading In Digital Twin Cloud-Edge Networks, Jiayu Zheng, Zhuxue Mai, Zheyi Chen Nov 2025

Optimization Of Service Caching And Computation Offloading In Digital Twin Cloud-Edge Networks, Jiayu Zheng, Zhuxue Mai, Zheyi Chen

Journal of System Simulation

Abstract: In mobile edge computing (MEC), to satisfy diverse user demands by jointly optimizing service caching and computation offloading and address low-efficiency resource utilization caused by irrational resource allocation, this paper proposed a novel joint optimization of service caching and computation offloading with a convex-optimization-enabled deep reinforcement learning (JCO-CR) method. Additionally, a new model for digital twin cloud-edge networks (DTCEN) was constructed. The joint optimization of service caching and computation offloading was decoupled into two sub-problems, which were solved by an improved deep reinforcement learning method and convex optimization theory, respectively. Simulation experiments demonstrate that the proposed JCO-CR method …

Go to article

Research On Cgf-Oriented Natural Language Interaction Framework, Xinmeng Li, Kai Xu, Yue Hu, Hesong Huang, Quanjun Yin Nov 2025

Research On Cgf-Oriented Natural Language Interaction Framework, Xinmeng Li, Kai Xu, Yue Hu, Hesong Huang, Quanjun Yin

Journal of System Simulation

Abstract: To address the mismatch between existing natural language interaction frameworks and training tasks in simulation-based military training, which limits smooth interaction between trainees and Computer Generated Forces (CGF), this paper proposes a Natural Language Interaction framework for Computer Generated Forces (NLI4CGF). The framework analyzes the logic and functional requirements of natural language interaction between trainees and CGF, and establishes an interaction architecture tailored for military simulation training scenarios. It supports semantic parsing and knowledge query tasks within a prototype system developed for infantry squad simulation training. Experimental results demonstrate that the proposed model performs effectively, meets the requirements of …

Go to article

Preparing For The Artificial Intelligence (Ai) Economy In The Mountain West, 2025, Kian Parikh, Taylor Volk, Maisoon Faris, Kristian Thymianos, William E. Brown Jr. Nov 2025

Preparing For The Artificial Intelligence (Ai) Economy In The Mountain West, 2025, Kian Parikh, Taylor Volk, Maisoon Faris, Kristian Thymianos, William E. Brown Jr.

Economic Development & Workforce

This fact sheet presents data from the Brainly report, “Here Are the States Most (and Least) Prepared to Win the AI Race in 2025” for the five Mountain West states of Arizona, Colorado, New Mexico, Nevada, and Utah. This fact sheet highlights the national and individual rankings of four key metrics for each Mountain West state: the fixed percentage of businesses using artificial intelligence (AI); the number of AI jobs per 1,000 workers; the number of AI-related degrees per 10,000 people ages 20-24; and federal funding for small business technology innovation per $1 million of gross domestic product (GDP).

Go to article

Research On Vehicle Path Optimization Algorithms For Urban Logistics And Distribution, Zhenpeng Ma, Hanyang Jiao, Zhe Zhang, Cheng Liu, Bo Jiang, Lin Wang Nov 2025

Research On Vehicle Path Optimization Algorithms For Urban Logistics And Distribution, Zhenpeng Ma, Hanyang Jiao, Zhe Zhang, Cheng Liu, Bo Jiang, Lin Wang

Journal of System Simulation

Abstract: Existing optimization algorithms for solving the vehicle routing problem with time windows (VRPTW) are prone to fall into local optimal solutions and have slow convergence speed. To address this issue, a K-means clustering algorithm and improved large neighborhood search algorithm (K-means-ILNSA) was proposed. A strategy of clustering before optimization was adopted, and the K-means algorithm was adopted to group the customers to be delivered, so as to improve the optimization efficiency. The genetic algorithm was adopted to optimize each group of customers generated by clustering separately to initially plan the distribution routes. The large neighborhood search (LNS) algorithm was …

Go to article

Bayesian Network Parameter Learning Based On Ahp-Dst Fusion Of Expert Prior Knowledge, Haiyang Chen, Hongkai Lin, Zhifang Ren, Jing Liu, Jing Zhang Nov 2025

Bayesian Network Parameter Learning Based On Ahp-Dst Fusion Of Expert Prior Knowledge, Haiyang Chen, Hongkai Lin, Zhifang Ren, Jing Liu, Jing Zhang

Journal of System Simulation

Abstract: Aiming at the problem of low accuracy of BN parameter learning due to the uncertainty of a single expert prior knowledge under the condition of small sample data set, a BN parameter learning method based on AHP-DST fusion expert prior knowledge was designed. The synthetic prior knowledge of experts was calculated by using the thought of analytic hierarchy process combined with the rules of evidence theory synthesis. The expert comprehensive prior knowledge was added to the normal distribution and combined with the monotonicity constraint to obtain the virtual sample information. The virtual sample information was added to the Bayesian …

Go to article

First Prev Next Last