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

2021 3rd International Conference on Robotics, Intelligent Control and Artificial Intelligence, ICRICA 2021

作者： Li, Yun Yin, Xiangfeng Wen, Xueting School of Mathematics and Computational Science Hunan University of Science and Technology Xiangtan China Sch. of Mathematics and Computational Science Hunan University of Science and Technology Hunan Engineering Research Center for Big Data and Intelligent Decision-making of Industrial Development Xiangtan China

In this paper, we use support vector regression (SVR) to estimate the parameters of the SETAR model for predicting the log-return of stock price data. SETAR model is usually estimated using maximum likelihood (ML) and minimize conditional sum-of-squares (CSS), assuming that the data are normal distribution. SVR is a powerful tool for regression estimation. Therefore, this paper proposes to use SVR instead of maximum likelihood and conditional least squares to estimate the parameters of the SETAR model. Empirical analysis on the two stock price data of China Unicom and ICBC, the results show that on the data of China Unicom, the prediction error of the Gaussian kernel SVR-SETAR model is 8% lower than that of the ML-SETAR model and the CSS-SETAR model. And on ICBC data, the prediction error of the Gaussian kernel SVR-SETAR model is 26.32% and 20% lower than that of the ML-SETAR model and CSS-SETAR model, respectively. This suggests that SVR can be used to estimate the parameters of the SESAT model and the SVR-SETAR model has higher predictive power. © Published under licence by IOP Publishing Ltd.

关键词： Normal distribution

来源：评论

学校读者我要写书评

暂无评论

Safe Reinforcement Learning for Social Motor Coordination in Two Dimensional Space 26

Safe Reinforcement Learning for Social Motor Coordination in...

引用

26th International Conference on Industrial Technology, ICIT 2025

作者： Yang, Fan Huang, Yuening Zhai, Chao Zhang, Hehong China University of Geosciences School of Automation Wuhan Campus China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China Rice University George R. Brown School of Engineering and Computing HoustonTX United States Fuzhou University School of Computer and Data Science Fuzhou China

ISBN: (纸本)9798331521950

This paper presents an interactive motion control method based on reinforcement learning, designed to assist children with autism who have social motor impairments through a mirror game intervention. The virtual teacher uses the Deep Deterministic Policy Gradient (DDPG) algorithm to optimize its actions, guiding the participant to follow a Lissajous trajectory. To ensure safety, a motion-correction mechanism was developed, which automatically adjusts actions when the predicted trajectory surpasses predefined safety boundaries. The reward function considers both the distance between the virtual teacher and the target trajectory, as well as the distance between the virtual teacher and the participant, with dynamic adjustments applied by the motion-correction mechanism. Experimental results demonstrate that the virtual teacher effectively guides the participant towards the target trajectory while adhering to safety constraints. © 2025 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Co-Learning Bayesian Optimization

arXiv

引用

arXiv 2025年

作者： Guo, Zhendong Ong, Yew-Soon He, Tiantian Liu, Haitao The Data Science and Artificial Intelligence Research Center School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore The School of Energy and Power Engineering Dalian University of Technology Dalian116024 China

Bayesian optimization (BO) is well known to be sample-efficient for solving black-box problems. However, the BO algorithms can sometimes get stuck in suboptimal solutions even with plenty of samples. Intrinsically, such suboptimal problem of BO can attribute to the poor surrogate accuracy of the trained Gaussian process (GP), particularly that in the regions where the optimal solutions locate. Hence, we propose to build multiple GP models instead of a single GP surrogate to complement each other and thus resolving the suboptimal problem of BO. Nevertheless, according to the bias-variance tradeoff equation, the individual prediction errors can increase when increasing the diversity of models, which may lead to even worse overall surrogate accuracy. On the other hand, based on the theory of Rademacher complexity, it has been proved that exploiting the agreement of models on unlabeled information can help to reduce the complexity of the hypothesis space, and therefore achieving the required surrogate accuracy with fewer samples. Such value of model agreement has been extensively demonstrated for co-training style algorithms to boost model accuracy with a small portion of samples. Inspired by the above, we propose a novel BO algorithm labeled as co-learning BO (CLBO), which exploits both model diversity and agreement on unlabeled information to improve the overall surrogate accuracy with limited samples, and therefore achieving more efficient global optimization. Through tests on five numerical toy problems and three engineering benchmarks, the effectiveness of proposed CLBO has been well demonstrated. © 2025, CC BY.

关键词： Semi-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Systematic Biases in LLM Simulations of Debates

Systematic Biases in LLM Simulations of Debates

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Taubenfeld, Amir Dover, Yaniv Reichart, Roi Goldstein, Ariel The Hebrew University of Jerusalem School of Computer Science and Engineering Israel Google Research United States The Hebrew University Business School Jerusalem Israel Federmann Center for the Study of Rationality Hebrew University Jerusalem Israel Faculty of Data and Decision Sciences Technion Israel Department of Cognitive and Brain Sciences Hebrew University Jerusalem Israel

ISBN: (纸本)9798891761643

The emergence of Large Language Models (LLMs), has opened exciting possibilities for constructing computational simulations designed to replicate human behavior accurately. Current research suggests that LLM-based agents become increasingly human-like in their performance, sparking interest in using these AI agents as substitutes for human participants in behavioral studies. However, LLMs are complex statistical learners without straightforward deductive rules, making them prone to unexpected behaviors. Hence, it is crucial to study and pinpoint the key behavioral distinctions between humans and LLM-based agents. In this study, we highlight the limitations of LLMs in simulating human interactions, particularly focusing on LLMs' ability to simulate political debates on topics that are important aspects of people's day-to-day lives and decision-making processes. Our findings indicate a tendency for LLM agents to conform to the model's inherent social biases despite being directed to debate from certain political perspectives. This tendency results in behavioral patterns that seem to deviate from well-established social dynamics among humans. We reinforce these observations using an automatic self-fine-tuning method, which enables us to manipulate the biases within the LLM and demonstrate that agents subsequently align with the altered biases. These results underscore the need for further research to develop methods that help agents overcome these biases, a critical step toward creating more realistic simulations. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Tracking Objects and Activities with Attention for Temporal Sentence Grounding

Tracking Objects and Activities with Attention for Temporal ...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zeyu Xiong Daizong Liu Pan Zhou Jiahao Zhu Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wangxuan Institute of Computer Technology Peking University

Temporal sentence grounding (TSG) aims to localize the temporal segment which is semantically aligned with a natural language query in an untrimmed video. Most existing methods extract frame-grained features or object-grained features by 3D ConvNet or detection network under a conventional TSG framework, failing to capture the subtle differences between frames or to model the spatio-temporal behavior of core persons/objects. In this paper, we introduce a new perspective to address the TSG task by tracking pivotal objects and activities to learn more fine-grained spatio-temporal behaviors. Specifically, we propose a novel Temporal Sentence Tracking Network (TSTNet), which contains (A) a Cross-modal Targets Generator to generate multi-modal templates and search space, filtering objects and activities, and (B) a Temporal Sentence Tracker to track multi-modal targets for modeling the targets’ behavior and to predict query-related segment. Extensive experiments and comparisons with state-of-the-arts are conducted on challenging benchmarks: Charades-STA and TACoS. And our TSTNet achieves the leading performance with a considerable real-time speed.

关键词： Solid modeling Target tracking Three-dimensional displays Grounding Benchmark testing Signal processing Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Bioinformatic Analysis Reveals both Oversampled and Underexplored Biosynthetic Diversity in Nonribosomal Peptides

引用

ACS Chemical Biology 2023年第3期18卷 476-483页

作者： Jian, Bo-Siyuan Chiou, Shao-Lun Hsu, Chun-Chia Ho, Josh Wu, Yu-Wei Chu, John Department of Computer Science and Information Engineering National Taiwan University Taipei 10617 Taiwan Department of Chemistry National Taiwan University Taipei 10617 Taiwan Graduate Institute of Biomedical Informatics College of Medical Science and Technology Taipei Medical University Taipei 10675 Taiwan Clinical Big Data Research Center Taipei Medical University Hospital Taipei 10675 Taiwan TMU Research Center for Digestive Medicine Taipei Medical University Taipei 10675 Taiwan

The traditional natural product discovery approach has accessed only a fraction of the chemical diversity in nature. The use of bioinformatic tools to interpret the instructions encoded in microbial biosynthetic genes has the potential to circumvent the existing methodological bottlenecks and greatly expand the scope of discovery. Structural prediction algorithms for nonribosomal peptides (NRPs), the largest family of microbial natural products, lie at the heart of this new approach. To understand the scope and limitation of the existing prediction algorithms, we evaluated their performances on NRP synthetase biosynthetic gene clusters. Our systematic analysis shows that the NRP biosynthetic landscape is uneven. Phenylglycine and its derivatives as a group of NRP building blocks (BBs), for example, have been oversampled, reflecting an extensive historical interest in the glycopeptide antibiotics family. In contrast, the benzoyl BB, including 2,3-dihydroxybenzoate (DHB), has been the most underexplored, hinting at the possibility of a reservoir of as yet unknown DHB containing NRPs with functional roles other than a siderophore. Our results also suggest that there is still vast unexplored biosynthetic diversity in nature, and the analysis presented herein shall help guide and strategize future natural product discovery campaigns. We also discuss possible ways bioinformaticians and biochemists could work together to improve the existing prediction algorithms. © 2023 The Authors. Published by American Chemical Society.

关键词： Algorithms Bacteria Bioinformatics and computational biology Peptides and proteins Pharmaceuticals

来源：评论

学校读者我要写书评

暂无评论

CW-YOLO: joint learning for mask wearing detection in low-light conditions

引用

Frontiers of computer science 2023年第6期17卷 191-193页

作者： Mingqiang GUO Hongting SHENG Zhizheng ZHANG Ying HUANG Xueye CHEN Cunjin WANG Jiaming ZHANG School of Computer Science China University of GeosciencesWuhan 430074China National Engineering Research Center of Geographic Information System Wuhan 430074China Wuhan Zondy Cyber Technology Co.Ltd. Wuhan 430074China Shenzhen Data Management Center of Planning and Natural Resources Shenzhen 518000China Key Laboratory of Urban Land Resources Monitoring and Simulation(Ministry of Natural Resources) Shenzhen 518000China College of Engineering Boston UniversityBoston 02215USA

1 Introduction With the rapid progress of Artificial Intelligence(AI)technology in object detection and face recognition,deep learning methods for face mask wearing detection have become increasingly mature and continuously take into account the needs of efficiency and ***,these conventional detection methods mostly ignore the complexity of real-world application scenarios,such as extremely darkness and gloomy *** unfavorable conditions lead to a series of image degradations that seriously hamper machine vision *** camera parameter adjustment,auxiliary lighting,or pre-processing enhancement[1]can weaken these negative effects to some extent to promote the detection,they will also result in increased hardware and time costs.

关键词： hardware lighting weather

来源：评论

学校读者我要写书评

暂无评论

Multi-IRS Enhanced Wireless Coverage: Deployment Optimization Based on Large-Scale Channel Knowledge

arXiv

引用

arXiv 2024年

作者： Fu, Min Zhu, Lipeng Zhang, Rui Department of Electrical and Computer Engineering National University of Singapore 117583 Singapore School of Science and Engineering Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen Guangdong518172 China

In this paper, we study the intelligent reflecting surface (IRS) deployment problem where a number of IRSs are optimally placed in a target area to improve its signal coverage with the serving base station (BS). To achieve this, we assume that there is a given set of candidate sites in the target area for deploying IRSs and divide the area into multiple grids of identical size. Then, we derive the average channel power gains from the BS to IRS in each candidate site and from this IRS to any grid in the target area in terms of IRS deployment parameters, including its size, position, height, and orientation. Thus, we are able to approximate the average cascaded channel power gain from the BS to each grid via any IRS, assuming an effective IRS reflection gain based on the large-scale channel knowledge only. Next, we formulate a multi-IRS deployment optimization problem to minimize the total deployment cost by selecting a subset of candidate sites for deploying IRSs and jointly optimizing their heights, orientations, and numbers of reflecting elements while satisfying a given coverage rate performance requirement over all grids in the target area. To solve this challenging combinatorial optimization problem, we first reformulate it as an integer linear programming problem and solve it optimally using the branchand- bound (BB) algorithm. In addition, we propose an efficient successive refinement algorithm to further reduce computational complexity. Simulation results demonstrate that the proposed lower-complexity successive refinement algorithm achieves nearoptimal performance but with significantly reduced running time compared to the proposed optimal BB algorithm, as well as superior performance-cost trade-off than other baseline IRS deployment strategies. © 2024, CC BY.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Movable Antenna Enhanced Wireless Sensing Via Antenna Position Optimization

arXiv

引用

arXiv 2024年

作者： Ma, Wenyan Zhu, Lipeng Zhang, Rui The Department of Electrical and Computer Engineering National University of Singapore 117583 Singapore School of Science and Engineering Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Guangdong Shenzhen518172 China

In this paper, we propose a new wireless sensing system equipped with the movable-antenna (MA) array, which can flexibly adjust the positions of antenna elements for improving the sensing performance over conventional antenna arrays with fixed-position antennas (FPAs). First, we show that the angle estimation performance in wireless sensing is fundamentally determined by the array geometry, where the Cramer-Rao bound (CRB) of the mean square error (MSE) for angle of arrival (AoA) estimation is derived as a function of the antennas’ positions for both one-dimensional (1D) and two-dimensional (2D) MA arrays. Then, for the case of 1D MA array, we obtain a globally optimal solution for the MAs’ positions in closed form to minimize the CRB of AoA estimation MSE. While in the case of 2D MA array, we aim to achieve the minimum of maximum (min-max) CRBs of estimation MSE for the two AoAs with respect to the horizontal and vertical axes, respectively. In particular, for the special case of circular antenna movement region, an optimal solution for the MAs’ positions is derived under certain numbers of MAs and circle radii. Thereby, both the lower- and upper-bounds of the min-max CRB are obtained for the antenna movement region with arbitrary shapes. Moreover, we develop an efficient alternating optimization algorithm to obtain a locally optimal solution for MAs’ positions by iteratively optimizing one between their horizontal and vertical coordinates with the other being fixed. Numerical results demonstrate that our proposed 1D/2D MA arrays can significantly decrease the CRB of AoA estimation MSE as well as the actual MSE compared to conventional uniform linear arrays (ULAs)/uniform planar arrays (UPAs) with different values of uniform inter-antenna spacing. Furthermore, it is revealed that the steering vectors of our designed 1D/2D MA arrays exhibit low correlation in the angular domain, thus effectively reducing the ambiguity of angle estimation. © 2024, CC BY.

关键词： Antenna arrays

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed algorithms for holistic aggregation functions on random regular graphs

引用

science China(Information sciences) 2022年第5期65卷 32-50页

作者： Lin JIA Qiang-Sheng HUA Haoqiang FAN Qiuping WANG Hai JIN National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and Technology Institute for Interdisciplinary Information Science Tsinghua University

In this paper, we propose efficient distributed algorithms for three holistic aggregation functions on random regular graphs that are good candidates for network topology in next-generation data *** three holistic aggregation functions include SELECTION（select the k-th largest or smallest element）,DISTINCT（query the count of distinct elements）, MODE（query the most frequent element）. We design three basic techniques — Pre-order Network Partition, Pairwise-independent Random Walk, and Random Permutation Delivery, and devise the algorithms based on the techniques. The round complexity of the distributed SELECTION is Θ（log N） which meets the lower bound where N is the number of nodes and each node holds a numeric element. The round complexity of the distributed DISTINCT and MODE algorithms are O（log3N/log log N） and O（log2N log log N） respectively. All of our results break the lower bounds obtained on general graphs and our distributed algorithms are all based on the CON GE S T model, which restricts each node to send only O（log N） bits on each edge in one round under synchronous communications.

关键词： distributed algorithms holistic aggregation function random regular graph \({\cal C}{\cal O}{\cal N}{\cal G}{\cal E}{\cal S}{\cal T}\) model communication complexity round complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：