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

Hierarchical Decision Problems for Non-Affine Multi-Player systems

学校读者我要写书评

暂无评论

Hierarchical Decision Problems for Non-Affine Multi-Player S...

IEEE International Conference on Real-time Computing and Robotics (RCAR)

作者： Danyu Lin Shan Xue Derong Liu Bo Zhao School of Automation Guangdong University of Technology Guangzhou China School of Computer Science and Engineering South China University of Technology Guangzhou China School of System Design and Intelligent Manufacturing Southern University of Science and Technology Shenzhen China School of Systems Science Beijing Normal University Beijing China

Adaptive dynamic programming is used in this paper to solve the hierarchical decision problem for non-affine multi-player systems. A new affine system is formed by adding control dynamics to the original system. To solve the hierarchical decision problem of the original system, we modeled it as a Stackelberg game in the new system. Adaptive dynamic programming is used to approximate the value functions. The stability of the system is analyzed according to Lyapunov theory, which leads to the conclusion that both the system states and the weight errors are uniformly ultimately bounded. Finally, matlab simulation is used to verify the conclusion.

关键词：

Knowledge discovery of patients reviews on breast cancer drugs: Segmentation of side effects using machine learning techniques

学校读者我要写书评

暂无评论

Heliyon 2024年第19期10卷 e38563页

作者： Nilashi, Mehrbakhsh Ahmadi, Hossein Abumalloh, Rabab Ali Alrizq, Mesfer Alghamdi, Abdullah Alyami, Sultan UCSI Graduate Business School UCSI University Cheras Kuala Lumpur 56000 Malaysia Centre for Health Technology Faculty of Health University of Plymouth Plymouth PL4 8AA United Kingdom Department of Computer Science and Engineering Qatar University Doha 2713 Qatar Information Systems Dept. College of Computer Science and Information Systems Najran University Najran Saudi Arabia Computer Science Dept. College of Computer Science and Information Systems Najran University Najran Saudi Arabia AI Lab Scientific and Engineering Research Center (SERC) Najran University Najran Saudi Arabia Centre for Business Informatics and Industrial Management UCSI Graduate Business School UCSI University Malaysia

Breast cancer stands as the most frequently diagnosed life-threatening cancer among women worldwide. Understanding patients' drug experiences is essential to improving treatment strategies and outcomes. In this research, we conduct knowledge discovery on breast cancer drugs using patients' reviews. A new machine learning approach is developed by employing clustering, text mining and regression techniques. We first use Latent Dirichlet Allocation (LDA) technique to discover the main aspects of patients' experiences from the patients' reviews on breast cancer drugs. We also use Expectation-Maximization (EM) algorithm to segment the data based on patients' overall satisfaction. We then use the Forward Entry Regression technique to find the relationship between aspects of patients' experiences and drug's effectiveness in each segment. The textual reviews analysis on breast cancer drugs found 8 main side effects: Musculoskeletal Effects, Menopausal Effects, Dermatological Effects, Metabolic Effects, Gastrointestinal Effects, Neurological and Cognitive Effects, Respiratory Effects and Cardiovascular. The results are provided and discussed. The findings of this study are expected to offer valuable insights and practical guidance for prospective patients, aiding them in making informed decisions regarding breast cancer drug consumption. © 2024 The Authors

关键词： Breast cancer Drugs Knowledge discovery Machine learning Online reviews Public health Text mining

On Shaping Gain of Multidimensional Constellation in Linear and Nonlinear Optical Fiber Channel

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chen, Bin Liang, Zhiwei Lei, Yi Deng, JingXin Li, Shen Liga, Gabriele School of Computer Science and Information Engineering Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province China Department of Electrical Engineering Chalmers University of Technology Gothenburg Sweden Department of Electrical and Computer Engineering Université Laval Québec Canada Department of Electrical Engineering Eindhoven University of Technology Eindhoven Netherlands

Utilizing the multi-dimensional (MD) space for constellation shaping has been proven to be an effective approach for achieving shaping gains. Despite there exists a variety of MD modulation formats tailored for specific optical transmission scenarios, there remains a notable absence of a dependable comparison method for efficiently and promptly re-evaluating their performance in arbitrary transmission systems. In this paper, we introduce an analytical nonlinear interference (NLI) power model-based shaping gain estimation method to enable a fast performance evaluation of various MD modulation formats in coherent dual-polarization (DP) optical transmission system. In order to extend the applicability of this method to a broader set of modulation formats, we extend the established NLI model to take the 4D joint distribution into account and thus able to analyze the complex interactions of non-iid signaling in DP systems. With the help of the NLI model, we conduct a comprehensive analysis of the state-of-the-art modulation formats and investigate their actual shaping gains in two types of optical fiber communication scenarios (multi-span and single-span). The numerical simulation shows that for arbitrary modulation formats, the NLI power and relative shaping gains in terms of signal-to-noise ratio can be more accurately estimated by capturing the statistics of MD symbols. Furthermore, the proposed method further validates the effectiveness of the reported NLI-tolerant modulation format in the literature, which reveals that the linear shaping gains and modulation-dependent NLI should be jointly considered for nonlinearity mitigation. © 2024, CC BY-NC-SA.

关键词： Optical fibers

Modeling Prototypical Preference Behavior and Diversity using Rank Score Characteristic Functions 21

学校读者我要写书评

暂无评论

Modeling Prototypical Preference Behavior and Diversity usin...

21st IEEE International Conference on Cognitive informatics and Cognitive Computing, ICCI*CC 2022

作者： Schweikert, Christina Shimojo, Shinsuke Glasser, Hannah Hendsey, Rebecca Alsaber, Rami Hsu, D. Frank St. John's University QueensNY United States California Institute of Technology Division of Biology and Biological Engineering / Computation and Neural Systems PasadenaCA United States Fordham University Laboratory of Informatics and Data Mining Department of Computer and Information Science New YorkNY United States

ISBN: (纸本)9781665490849

When given two human face images to choose, a subject's decision process is recorded as a sequence of eye movement gaze points. This sequence is then analyzed to detect and predict the preference made by the subject. In an experiment with twelve subjects, each with sixty trials, we have analyzed the 720 sequences using five attributes and combinatorial fusion. Results are promising with good accuracy and efficiency. In this paper, we characterize the decision-making behavior of each subject and measure the cognitive diversity between each of these twelve subjects and a prototypical subject. Our study contributes to improving the data and predictive quality of the experiment and the computational modeling. © 2022 IEEE.

关键词： Eye movements

Optimizing Load and Routes in Supply Chain Management with Travelling Salesman Problem and CapsNet Attention 3

学校读者我要写书评

暂无评论

Optimizing Load and Routes in Supply Chain Management with T...

3rd International Conference on Integrated Circuits and Communication systems, ICICACS 2025

作者： Rajasekar, P. Begam, M. Shabeena Chattopadhyay, Shouvik Basha, S. Chand Chandre, Shanker Dwivedi, Vijay Kumar Srm Institute of Science and Technology Department of Data Science and Business Systems Kattankulathur India Sns College of Technology Department of Mba Coimbatore India Institute of Engineering & Management Department of Mba Kolkata India University of Engineering & Management Kolkata India St Ann's College of Engineering and Technology Department of Business Administration Chirala India School of Computer Science & Artificial Intelligence Sr University Department of Computer Science & Artificial Intelligence Warangal India Vishwavidyalaya Engineering College Department of Mathematics Ambikapur India

ISBN: (纸本)9798331508456

Ever since the industrial revolution, industries have partnered to solve marketing problems and create new channels. Because they don't understand their clients' needs, sales centers often pursue conflicting aims. Lack of information has extended delivery times. Due to supply time, quality, or bulk freight depreciation agreements, facility expenses rise to satisfy demand, resulting in excess inventory. Supply chain management, particularly regional inventory management, has considerably impacted beer manufacturing profitability. The recommended method involves training the model and extracting features. Dynamic and PCA feature extraction are different. While PCA's main purpose is to dissociate correlated from uncorrelated data, dynamic PCA considers auto- and cross-correlation in time-series observations. A revised CapsNet approach trained the models. The Improved CapsNet model outperformed the Attention and baseline models in every test. The model solved brewing supply chain issues with 94.68% accuracy. The most successful advanced machine learning approaches for improving SCM include augmented CapsNet, PCA, and dynamic PCA, according to research. These techniques boost industrial profitability when applied to major issues like excess stock and supply unpredictability. The suggested strategy is more reliable and superior than present solutions, according to results. © 2025 IEEE.

关键词： Supply chain management

OpenVNA: A Framework for Analyzing the Behavior of Multimodal Language Understanding System under Noisy Scenarios

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yuan, Ziqi Zhang, Baozheng Xu, Hua Liang, Zhiyun Gao, Kai State Key Laboratory of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University China China School of Information Science and Engineering Hebei University of Science and Technology China College of Information and Electrical Engineering China Agricultural University China Technology Development Co. Ltd. China

We present OpenVNA, an open-source framework designed for analyzing the behavior of multimodal language understanding systems under noisy conditions. OpenVNA serves as an intuitive toolkit tailored for researchers, facilitating convenience batch-level robustness evaluation and on-the-fly instance-level demonstration. It primarily features a benchmark Python library for assessing global model robustness, offering high flexibility and extensibility, thereby enabling customization with user-defined noise types and models. Additionally, a GUI-based interface has been developed to intuitively analyze local model behavior. In this paper, we delineate the design principles and utilization of the created library and GUI-based web platform. Currently, OpenVNA is publicly accessible at https://***/thuiar/OpenVNA, with a demonstration video available at https://***/0Z9cW7RGct4. © 2024, CC BY-NC-SA.

关键词： Graphical user interfaces

ARTEMIS: Autoregressive End-to-End Trajectory Planning with Mixture of Experts for Autonomous Driving

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Feng, Renju Xi, Ning Chu, Duanfeng Wang, Rukang Deng, Zejian Wang, Anzheng Lu, Liping Wang, Jinxiang Huang, Yanjun Intelligent Transportation Systems Research Center Wuhan University of Technology Wuhan430063 China Department of Data and Systems Engineering The University of Hong Kong 999077 Hong Kong School of Computer Science and Artificial Intelligence Wuhan University of Technology Wuhan430070 China School of Mechanical Engineering Southeast University Nanjing211189 China School of Automotive Studies Tongji University Shanghai201804 China

—This paper presents ARTEMIS, an end-to-end autonomous driving framework that combines autoregressive trajectory planning with Mixture-of-Experts (MoE). Traditional modular methods suffer from error propagation, while existing end-to-end models typically employ static one-shot inference paradigms that inadequately capture the dynamic changes of the environment. ARTEMIS takes a different method by generating trajectory waypoints sequentially, preserves critical temporal dependencies while dynamically routing scene-specific queries to specialized expert networks. It effectively relieves trajectory quality degradation issues encountered when guidance information is ambiguous, and overcomes the inherent representational limitations of singular network architectures when processing diverse driving scenarios. Additionally, we use a lightweight batch reallocation strategy that significantly improves the training speed of the Mixture-of-Experts model. Through experiments on the NAVSIM dataset, ARTEMIS exhibits superior competitive performance, achieving 87.0 PDMS and 83.1 EPDMS with ResNet-34 backbone, demonstrates state-of-the-art performance on multiple metrics. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep learning

A GNN-Based Learning Approach for Energy Optimization in Relay-Assisted IoT Networks

学校读者我要写书评

暂无评论

A GNN-Based Learning Approach for Energy Optimization in Rel...

2025 IEEE Wireless Communications and Networking Conference, WCNC 2025

作者： Yang, Huapeng Ji, Han Huang, Zhangqin Wu, Xiping College of Computer Science Beijing University of Technology Beijing Engineering Research Center for IoT Software and Systems Beijing100124 China School of Electrical and Electronic Engineering University College Dublin DublinD04 V1W8 Ireland School of Information Science and Engineering Southeast University The National Mobile Communications Research Laboratory Nanjing210096 China

ISBN: (纸本)9798350368369

Minimizing energy consumption is critical for the long-range (LoRa) Internet of Things (IoT) networks, to extend the battery lifetime of end devices (EDs) while reducing the maintenance cost. To overcome the excessive computational complexity required by the traditional optimization methods, learning approaches such as deep neural network (DNN) and reinforcement learning (RL) have been researched in wireless networks, where star topologies are widely employed. In contrast, LoRa usually deploys relays to assist the connection between the EDs and the gateway (GW), leading to a much more complex network topology. Consequently, DNN and RL would become less effective in LoRa, since those methods are difficult to learn the complex network topology constructed by LoRa. In this paper, we propose a learning method based on graph neural network (GNN), which is known for its prominent ability to capture and represent intricate graph-structural dependencies, to tackle the energy optimization problem for relay-assisted LoRa. Specifically, the multi-hop LoRa network is modeled as a directed graph, with channel state information (CSI) defined as node features, while the spreading factor and transmission power are deemed labels. A hierarchical message aggregation mechanism is proposed to effectively capture the multi-hop structural dependencies, followed by the process of inductive learning. Results show that against conventional optimization algorithms, the proposed method can achieve near-optimal energy consumption with a gap of 10% to 16%, while reducing the runtime by about six orders of magnitude. Compared to DNN, the GNN-based model can provide an energy saving of up to 32%, at a similar level of inference time. © 2025 IEEE.

关键词： Reinforcement learning

Graph Prompt Learning: A Comprehensive Survey and Beyond

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Sun, Xiangguo Zhang, Jiawen Wu, Xixi Cheng, Hong Xiong, Yun Li, Jia Department of Systems Engineering and Engineering Management Shun Hing Institute of Advanced Engineering The Chinese University of Hong Kong Hong Kong Hong Kong University of Science and Technology Guangzhou China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China

Artificial General Intelligence (AGI) has revolutionized numerous fields, yet its integration with graph data, a cornerstone in our interconnected world, remains nascent. This paper presents a pioneering survey on the emerging domain of graph prompts in AGI, addressing key challenges and opportunities in harnessing graph data for AGI applications. Despite substantial advancements in AGI across natural language processing and computer vision, the application to graph data is relatively underexplored. This survey critically evaluates the current landscape of AGI in handling graph data, highlighting the distinct challenges in cross-modality, cross-domain, and cross-task applications specific to graphs. Our work is the first to propose a unified framework for understanding graph prompt learning, offering clarity on prompt tokens, token structures, and insertion patterns in the graph domain. We delve into the intrinsic properties of graph prompts, exploring their flexibility, expressiveness, and interplay with existing graph models. A comprehensive taxonomy categorizes over 100 works in this field, aligning them with pre-training tasks across node-level, edge-level, and graph-level objectives. Additionally, we present, ProG, a Python library, and an accompanying website, to support and advance research in graph prompting. The survey culminates in a discussion of current challenges and future directions, offering a roadmap for research in graph prompting within AGI. Through this comprehensive analysis, we aim to catalyze further exploration and practical applications of AGI in graph data, underlining its potential to reshape AGI fields and beyond. ProG and the website can be accessed by https: //***/WxxShirley/Awesome-Graph-Prompt, and https://***/sheldonresearch/ProG, respectively. Copyright © 2023, The Authors. All rights reserved.

关键词： Websites