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

arXiv 2024年

作者： Zha, Yaohua Li, Naiqi Wang, Yanzi Dai, Tao Guo, Hang Chen, Bin Wang, Zhi Ouyang, Zhihao Xia, Shu-Tao Tsinghua Shenzhen International Graduate School Tsinghua University China Institute of Visual Intelligence Pengcheng Laboratory China College of Computer Science and Software Engineering Shenzhen University China Harbin Institute of Technology Shenzhen China Bytedance Inc China

The pre-trained point cloud model based on Masked Point Modeling (MPM) has exhibited substantial improvements across various tasks. However, these models heavily rely on the Transformer, leading to quadratic complexity and limited decoder, hindering their practice application. To address this limitation, we first conduct a comprehensive analysis of existing Transformer-based MPM, emphasizing the idea that redundancy reduction is crucial for point cloud analysis. To this end, we propose a Locally constrained Compact point cloud Model (LCM) consisting of a locally constrained compact encoder and a locally constrained Mamba-based decoder. Our encoder replaces self-attention with our local aggregation layers to achieve an elegant balance between performance and efficiency. Considering the varying information density between masked and unmasked patches in the decoder inputs of MPM, we introduce a locally constrained Mamba-based decoder. This decoder ensures linear complexity while maximizing the perception of point cloud geometry information from unmasked patches with higher information density. Extensive experimental results show that our compact model significantly surpasses existing Transformer-based models in both performance and efficiency, especially our LCM-based Point-MAE model, compared to the Transformer-based model, achieved an improvement of 1.84%, 0.67%, and 0.60% in average accuracy on the three variants of ScanObjectNN while reducing parameters by 88% and computation by 73%. Code is available at https://***/zyh16143998882/LCM. Copyright © 2024, The Authors. All rights reserved.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Binary Equilibrium Optimizer Algorithm

Journal of Network Intelligence

引用

Journal of Network Intelligence 2022年第1期7卷 45-58页

作者： Hu, Pei Chu, Shu-Chuan Snášel, Václav Pan, Jeng-Shyang College of Computer Science and Engineering Shandong University of Science and Technology No.579 Qianwan’gang Road Shandong Qingdao266590 China School of Computer and Software Nanyang Institute of Technology No.80 Changjiang Road Henan Nanyang473004 China College of Science and Engineering Flinders University Sturt Rd Bedford ParkSA5042 Australia Department of Computer Science VŠB—Technical University of Ostrava 17. listopadu 2172/15 Poruba Ostrava708 00 Czech Republic Department of Information Management Chaoyang University of Technology No.168 Jifeng E. Rd. Wufeng District Taichung413310 Taiwan

Equilibrium optimizer (EO) is a new proposed meta-heuristic algorithm by utilizing the mass balance model of the control volume. In order to solve the binary appli-cations, this paper proposes a binary version of equilibrium optimizer (BEO). BEO takes advantage of the structure of EO, only modifying the equations of equilibrium concentra-tion and position updating. Through the benchmark functions and Wilcoxon’s rank sum test, it compares BEO with binary bat algorithm, binary differential evolution, binary grey wolf optimizer, binary particle swarm optimization, and a binary hybrid algorithm of particle swarm optimization and gravitational search algorithm. BEO shows excep-tional performance in the solving quality, time complexity and convergence. Simulation results prove that BEO acquires the least classification errors while having a small number of features in the KNN. © 2022, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Simulation on Molten Pool Characteristics of Al2O3 Laser Selective Melting Based on Energy Input Model

Simulation on Molten Pool Characteristics of Al2O3 Laser Sel...

引用

2019 International Conference on Optoelectronic Science and Materials, ICOSM 2019

作者： Chen, Xiaobing Sun, Quan Sun, Quanping Wu, Haibing Xu, Qian Key Lab of Advanced Manufacturing Technology of Jiangsu Province Huaiyin Institute of Technology Huai'an Jiangsu Province223003 China Faculty of Computer and Software Engineering Huaiyin Institute of Technology Huai'an Jiangsu Province223003 China

In order to obtain the formation rule of molten pool characteristics in SLM process of ceramics, an energy input model for SLM process of Al2O3 ceramics is established. The model is related to laser power P, scanning speed v, scanning spacing s and thickness h of powder layer. The influence of process parameters in the energy model on molten pool characteristics is analyzed by simulation of temperature field of multi-layer and multi-channel SLM process. The simulation results show that when the laser power P is 105W, the scanning speed v is 50mm/s, the initial temperature of powder is 330°C and the thickness of powder layer is 0.20mm, the molten pool formed is easy to form Al2O3 ceramic specimens. © Published under licence by IOP Publishing Ltd.

关键词： Selective laser melting

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Approach to Identify Stroke based on Real-time Medical Data

A Comprehensive Approach to Identify Stroke based on Real-ti...

引用

Cognitive Robotics and Intelligent Systems (ICC - ROBINS), International Conference on

作者： M. Maragatharajan Shanmugapriya S M. B. Sudhan Deeptha R. Sankar Muthu Paramasivam School of Computing Science and Engineering VIT Bhopal University Kothrikalan Madhya Pradesh India Department of Computer Science and Engineering School of Computing Kalasalingam Academy of Research and Education Srivilliputhur Tamilnadu India Department of Computer Science and Engineering SRM Institute of Science and Technology Ramapuram Chennai Tamilnadu Department of Information Technology SRM Institute of Science and Technology Ramapuram Chennai Tamilnadu India Distinguished Software Engineer Palo Alto Networks Inc Santa Clara California USA

ISBN: (数字)9798350372748

ISBN: (纸本)9798350372755

Strokes or cardiovascular disorders continue to be a major global health concern. Proactive intervention and timely detection greatly reduce the morbidity and death related to strokes. The goal of this research is to build a prediction model using machine learning techniques to assess a person’s risk of stroke based on a variety of sociodemographic and health characteristics. The dataset used in this study consists of a large collection of medical records. It contains important details including age, gender, BMI, smoking habits, heart disease, hypertension, and the type of residential property. Using this information, a Decision Tree Classifier is trained to predict the likelihood of strokes, enabling early detection and customized treatment plans. A Decision Tree Classifier with a predetermined maximum depth is used in the proposed methodology’s rigorous data preprocessing, which includes handling missing values, encoding categorical features, and developing models. Both the training and testing datasets are used to evaluate the model’s performance using evaluation measures including accuracy, precision, and recall. The model’s insights provide important characteristics that influence the prediction of stroke risk, assisting medical professionals in focused risk assessment and preventive intervention. The proposed method has the potential to improve healthcare practices by facilitating prompt interventions and personalized treatment for stroke risk individuals. The proposed model has resulted in 86.78% accuracy for this dataset by using the traditional machine learning algorithms. This work highlights the value of predictive modelling in the healthcare industry by demonstrating how it may improve early detection techniques and lessen the impact of strokes on public health.

关键词： Training Machine learning algorithms Machine learning Predictive models Stroke (medical condition) Real-time systems Risk management

来源：评论

学校读者我要写书评

暂无评论

BLOCK-TO-SCENE PRE-TRAINING FOR POINT CLOUD HYBRID-DOMAIN MASKED AUTOENCODERS

arXiv

引用

arXiv 2024年

作者： Zha, Yaohua Dai, Tai Wang, Yanzi Guo, Hang Zhang, Taolin Ouyang, Zhihao Fan, Chunlin Chen, Bin Chen, Ke Xia, Shu-Tao Tsinghua Shenzhen International Graduate School Tsinghua University China Institute of Visual Intelligence Pengcheng Laboratory China College of Computer Science and Software Engineering Shenzhen University China Harbin Institute of Technology Shenzhen China Aitist.ai

Point clouds, as a primary representation of 3D data, can be categorized into scene domain point clouds and object domain point clouds based on the modeled content. Masked autoencoders (MAE) have become the mainstream paradigm in point clouds self-supervised learning. However, existing MAE-based methods are domain-specific, limiting the model’s generalization. In this paper, we propose to pre-train a general Point cloud Hybrid-Domain Masked AutoEncoder (PointHDMAE) via a block-to-scene pre-training strategy. We first propose a hybrid-domain masked autoencoder consisting of an encoder and decoder belonging to the scene domain and object domain, respectively. The object domain encoder specializes in handling object point clouds and multiple shared object encoders assist the scene domain encoder in analyzing the scene point clouds. Furthermore, we propose a block-to-scene strategy to pre-train our hybrid-domain model. Specifically, we first randomly select point blocks within a scene and apply a set of transformations to convert each point block coordinates from the scene space to the object space. Then, we employ an object-level mask and reconstruction pipeline to recover the masked points of each block, enabling the object encoder to learn a universal object representation. Finally, we introduce a scene-level block position regression pipeline, which utilizes the blocks’ features in the object space to regress these blocks’ initial positions within the scene space, facilitating the learning of scene representations. Extensive experiments across different datasets and tasks demonstrate the generalization and superiority of our hybrid-domain model. The code will be released. Copyright © 2024, The Authors. All rights reserved.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

A Multi-Feature Learning Model with Enhanced Local Attention for Vehicle Re-Identification

引用

computers, Materials & Continua 2021年第12期69卷 3549-3561页

作者： Wei Sun Xuan Chen Xiaorui Zhang Guangzhao Dai Pengshuai Chang Xiaozheng He Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology Nanjing University of Information Science&TechnologyNanjing210044China School of Automation Nanjing University of Information Science&TechnologyNanjing210044China Engineering Research Center of Digital Forensics Ministry of EducationJiangsu Engineering Center of Network MonitoringSchool of Computer and SoftwareNanjing University of Information Science&TechnologyNanjing210044China Rensselaer Polytechnic Institute TroyNY12180USA

Vehicle re-identification(ReID)aims to retrieve the target vehicle in an extensive image gallery through its appearances from various views in the cross-camera *** has gradually become a core technology of intelligent transportation *** existing vehicle re-identification models adopt the joint learning of global and local ***,they directly use the extracted global features,resulting in insufficient feature ***,local features are primarily obtained through advanced annotation and complex attention mechanisms,which require additional *** solve this issue,a multi-feature learning model with enhanced local attention for vehicle re-identification(MFELA)is proposed in this *** model consists of global and local *** global branch utilizes both middle and highlevel semantic features of ResNet50 to enhance the global representation *** addition,multi-scale pooling operations are used to obtain multiscale *** the local branch utilizes the proposed Region Batch Dropblock(RBD),which encourages the model to learn discriminative features for different local regions and simultaneously drops corresponding same areas randomly in a batch during training to enhance the attention to local *** features from both branches are combined to provide a more comprehensive and distinctive feature *** experiments on VeRi-776 and VehicleID datasets prove that our method has excellent performance.

关键词： Vehicle re-identification region batch dropblock multi-feature learning local attention

来源：评论

学校读者我要写书评

暂无评论

FlagVNE: A Flexible and Generalizable Reinforcement Learning Framework for Network Resource Allocation

arXiv

引用

arXiv 2024年

作者： Wang, Tianfu Fan, Qilin Wang, Chao Yang, Long Ding, Leilei Yuan, Nicholas Jing Xiong, Hui School of Computer Science and Technology University of Science and Technology of China China School of Big Data and Software Engineering Chongqing University China Guangzhou HKUST Fok Ying Tung Research Institute China School of Artificial Intelligence Peking University China Thrust of Artificial Intelligence The Hong Kong University of Science and Technology Guangzhou China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong Hong Kong

Virtual network embedding (VNE) is an essential resource allocation task in network virtualization, aiming to map virtual network requests (VNRs) onto physical infrastructure. Reinforcement learning (RL) has recently emerged as a promising solution to this problem. However, existing RL-based VNE methods are limited by the unidirectional action design and one-size-fits-all training strategy, resulting in restricted searchability and generalizability. In this paper, we propose a FLexible And Generalizable RL framework for VNE, named FlagVNE. Specifically, we design a bidirectional action-based Markov decision process model that enables the joint selection of virtual and physical nodes, thus improving the exploration flexibility of solution space. To tackle the expansive and dynamic action space, we design a hierarchical decoder to generate adaptive action probability distributions and ensure high training efficiency. Furthermore, to overcome the generalization issue for varying VNR sizes, we propose a meta-RL-based training method with a curriculum scheduling strategy, facilitating specialized policy training for each VNR size. Finally, extensive experimental results show the effectiveness of FlagVNE across multiple key metrics. Our code is available at GitHub1 Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Keeping Pace with Ever-Increasing Data: Towards Continual Learning of Code Intelligence Models

Keeping Pace with Ever-Increasing Data: Towards Continual Le...

引用

International Conference on software engineering (ICSE)

作者： Shuzheng Gao Hongyu Zhang Cuiyun Gao Chaozheng Wang School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Peng Cheng Laboratory and Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Big Data and Software Engineering Chongqing University China

Previous research on code intelligence usually trains a deep learning model on a fixed dataset in an offline manner. However, in real-world scenarios, new code repositories emerge incessantly, and the carried new knowledge is beneficial for providing up-to-date code intelligence services to developers. In this paper, we aim at the following problem: How to enable code intelligence models to continually learn from ever-increasing data? One major challenge here is catastrophic forgetting, meaning that the model can easily forget knowledge learned from previous datasets when learning from the new dataset. To tackle this challenge, we propose REPEAT, a novel method for continual learning of code intelligence models. Specifically, REPEAT addresses the catastrophic forgetting problem with representative exemplars replay and adaptive parameter regularization. The representative exemplars replay component selects informative and diverse exemplars in each dataset and uses them to re-train model periodically. The adaptive parameter regularization component recognizes important parameters in the model and adaptively penalizes their changes to preserve the knowledge learned before. We evaluate the proposed approach on three code intelligence tasks including code summarization, software vulnerability detection, and code clone detection. Extensive experiments demonstrate that REPEAT consistently outperforms baseline methods on all tasks. For example, REPEAT improves the conventional fine-tuning method by 1.22, 5.61, and 1.72 on code summarization, vulnerability detection and clone detection, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Free-space Continuous-variable Quantum Secret Sharing

arXiv

引用

arXiv 2025年

作者： Yang, Fangli Chang, Liang Qiu, Daowen Pan, Minghua Xiong, Wanjun Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin541004 China Institute of Quantum Computing and Software School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology Guilin541004 China

Free-space quantum cryptography has the potential to enable global quantum communication. However, most existing continuous-variable quantum secret sharing (CV-QSS) schemes rely on fiber channels. In this paper, we present a CV-QSS protocol designed for free-space transmission and construct models of crucial parameters, including channel transmittance, excess noise, and interruption probability, thus deriving the bound of the secret key rate. In particular, we provide a multi-source excess noise model for free-space CV-QSS based on the local local oscillator (LLO) scheme and a straightforward optimization of the noise. Furthermore, our research considers the impact of atmospheric turbulence on the protocol. Simulation results demonstrate that the intensification of atmospheric turbulence adversely affects the aforementioned crucial parameters, leading to a significant reduction in the key rate. However, our protocol shows its capability to securely share secrets over a distance of exceeding 60 km among five participants in the presence of turbulence with Cn2 = 1 × 10−15m−2/3, while maintaining a high key rate of approximately 0.55 bit/pulse over a distance of 10 km across twenty participants. These findings suggest that efficient CV-QSS in free space is indeed achievable. This research may serve as a reference for the design and optimization of the practical CV-QSS system. Copyright © 2025, The Authors. All rights reserved.

关键词： Atmospheric turbulence

来源：评论

学校读者我要写书评

暂无评论

Incentivizing Fresh Information Acquisition via Age-Based Reward

IEEE Transactions on Networking

引用

IEEE Transactions on Networking 2025年第3期33卷 1174-1188页

作者： Zhiyuan Wang Qingkai Meng Shan Zhang Hongbin Luo School of Computer Science and Engineering Beihang University Beijing China Zhongguancun Laboratory Beijing China State Key Laboratory of Virtual Reality Technology and Systems Beijing China Institute of Artificial Intelligence Beihang University Beijing China State Key Laboratory of Software Development Environment Beijing China

Many Internet platforms are information-oriented and crowd-based. They collect fresh information of various points of interest (PoIs) relying on users who happen to be nearby the PoIs. The platform will offer rewards to incentivize users and compensate their costs incurred from information acquisition. In practice, a user’s cost is his/her private information, thus both the user cost and its distribution are hidden to the platform, making it challenging to determine the optimal rewarding decision. In this paper, we investigate how the platform dynamically rewards the users, aiming to jointly reduce the age of information (AoI) and the operational expenditure (OpEx). Due to the hidden cost distribution, this is an online non-convex learning problem with bandit feedback. To overcome the challenge, we first design an age-based reward scheme, which decouples the OpEx from the unknown cost distribution and enables the platform to accurately control its OpEx. We then take advantage of the age-based reward scheme and propose an exponentially discretizing and learning (EDAL) policy for platform operation. We prove that the EDAL policy performs asymptotically as well as the optimal decision (derived from the cost distribution). Simulation results show that the age-based reward scheme protects the platform’s OpEx from the influence of the user crowd characteristics, and also verify the asymptotic optimality of the EDAL policy.

关键词： Costs Reviews Soft sensors Pricing Optimization Electronic mail Stochastic processes Simulation Laboratories Internet

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：