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

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

作者： Hongtao Wang Ang Li School of Control and Computer Engineering North China Electric Power University Baoding China Harbin Institute of Technology Shenzhen China

In light of the widespread utilization of deep neural networks in various natural language tasks, adversarial attacks targeting these models have emerged as a significant concern. Through the introduction of subtle perturbations via word substitution, word-level adversarial attacks have demonstrated the ability to deceive deep classifiers into making erroneous decisions. Previous word-level attacks have predominantly focused on substituting verbs and adjectives with their synonyms. In this paper, we explore whether deep textual classifiers exhibit resilience against the replacement of Named Entities (NEs) belonging to the same category. We introduce an effective NE adversarial attack method, which underscores that NEs are very sensitive to such substitutions for deep textual classifiers. To enhance the robustness of these classifiers, we also propose three defense strategies: 1) mask replacement, 2) concept replacement, and 3) data augmentation based on NE sampling. We assess the performance of these strategies in text classification tasks involving various victim and attack models, employing a range of standard datasets. Experimental results demonstrate the efficacy of our defense strategies against NE adversarial attacks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Newton-Euler Modeling of Robot Dynamics Using Geometric Algebra

Newton-Euler Modeling of Robot Dynamics Using Geometric Alge...

引用

International Conference on Methods and Models in Automation and Robotics (MMAR)

作者： Eduardo Bayro-Corrochano Daniel Alvarado-Mejia Institute of Automatic Control and Robotics Poznan University of Technology Dept. Electrical Engineering and Computer Science CINVESTAV Guadalajara Mexico

ISBN: (数字)9798350362343

ISBN: (纸本)9798350362350

In this work, we present the modeling of the dynamics of a robot manipulator using the Newton-Euler algorithm in the conformal algebra framework. The modeling of the dynamics of robot manipulators is currently done using the Euler-Lagrange formulation which is a batch type of computation. In contrast, in this paper, we propose a recursive algorithm for the modeling of the dynamics of robot manipulators using the Newton-Euler algorithm in the conformal geometric algebra framework.

关键词： Algebra Heuristic algorithms Computational modeling Optimal control Motors Real-time systems Mathematical models

来源：评论

学校读者我要写书评

暂无评论

Steps Toward Industry 5.0:Building“6S”Parallel Industries With Cyber-Physical-Social Intelligence

引用

IEEE/CAA Journal of Automatica Sinica 2023年第8期10卷 1692-1703页

作者： Xingxia Wang Jing Yang Yutong Wang Qinghai Miao Fei-Yue Wang Aijun Zhao Jian-Ling Deng Lingxi Li Xiaoxiang Na Ljubo Vlacic School of Artificial Intelligence University of Chinese Academy of SciencesBeijing 100049China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China IEEE Macao University of Science and Technology Macao 999078China Beijing Engineering Research Center of Intelligent Systems and Technology Chinese Academy of SciencesBeijing 100098 State Key Laboratory for Management and Control of Complex Systems Chinese Academy of SciencesBeijing 100190China North Automatic Control Technology Institute Taiyuan 030006China China Huaneng Group Co. Ltd.Beijing 100031China Department of Electrical and Computer Engineering Indiana University-Purdue University Indianapolis(IUPUI)IndianapolisIN 46202 USA Department of Engineering University of CambridgeCambridgeCB21PZUK School of Engineering and Built Environment Griffith UniversityGold CoastQLD 4222Australia

Very recently,intensive discussions and studies on Industry 5.0 have sprung up and caused the attention of researchers,entrepreneurs,and policymakers from various sectors around the ***,there is no consensus on why and what is Industry 5.0 *** this paper,we define Industry 5.0from its philosophical and historical origin and evolution,emphasize its new thinking on virtual-real duality and human-machine interaction,and introduce its new theory and technology based on parallel intelligence(PI),artificial societies,computational experiments,and parallel execution(the ACP method),and cyber-physical-social systems(CPSS).Case studies and applications of Industry 5.0 over the last decade have been briefly summarized and analyzed with suggestions for its future *** believe that Industry 5.0 of virtual-real interactive parallel industries has great potentials and is critical for building smart *** are outlined to ensure a roadmap that would lead to a smooth transition from CPS-based Industry 4.0 to CPSS-based Industry 5.0 for a better world which is Safe in physical spaces,S ecure in cyberspaces,Sustainable in ecology,Sensitive in individual privacy and rights,Service for all,and Smartness of all.

关键词： ACP artificial intelligence CPS CPSS Industry 4.0 Industry 5.0 parallel industries parallel intelligence

来源：评论

学校读者我要写书评

暂无评论

Adaptive Dynamic Dipper Throated Optimization for Feature Selection in Medical Data

引用

computers, Materials & Continua 2023年第4期75卷 1883-1900页

作者： Ghada Atteia El-Sayed M.El-kenawy Nagwan Abdel Samee Mona M.Jamjoom Abdelhameed Ibrahim Abdelaziz A.Abdelhamid Ahmad Taher Azar Nima Khodadadi Reham A.Ghanem Mahmoud Y.Shams Department of Information Technology College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Department of Communications and Electronics Delta Higher Institute of Engineering and TechnologyMansoura35111Egypt Faculty of Artificial Intelligence Delta University for Science and TechnologyMansoura35712Egypt Department of Computer Sciences College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Computer Engineering and Control Systems Department Faculty of EngineeringMansoura UniversityMansoura35516Egypt Department of Computer Science Faculty of Computer and Information SciencesAin Shams UniversityCairo11566Egypt Department of Computer Science College of Computing and Information TechnologyShaqra University11961Saudi Arabia Faculty of Computers and Artificial Intelligence Benha UniversityBenha13518Egypt College of Computer and Information Sciences Prince Sultan UniversityRiyadh11586Saudi Arabia Department of Civil Engineering University of Science and TechnologyMiami33101USA Department of Civil and Environmental Engineering Florida International UniversityMiamiUSA Oral Biology Department Faculty of Oral and Dental MedicineDelta University for Science and TechnologyGamasaEgypt Faculty of Artificial Intelligence Kafrelsheikh UniversityKafrelsheikh33511Egypt

The rapid population growth results in a crucial problem in the early detection of diseases inmedical *** all the cancers unveiled,breast cancer is considered the second most severe ***,an exponential rising in death cases incurred by breast cancer is expected due to the rapid population growth and the lack of resources required for performing medical *** recent advances in machine learning could help medical staff in diagnosing diseases as they offer effective,reliable,and rapid responses,which could help in decreasing the death *** this paper,we propose a new algorithm for feature selection based on a hybrid between powerful and recently emerged optimizers,namely,guided whale and dipper throated *** proposed algorithm is evaluated using four publicly available breast cancer *** evaluation results show the effectiveness of the proposed approach from the accuracy and speed *** prove the superiority of the proposed algorithm,a set of competing feature selection algorithms were incorporated into the conducted *** addition,a group of statistical analysis experiments was conducted to emphasize the superiority and stability of the proposed *** best-achieved breast cancer prediction average accuracy based on the proposed algorithm is 99.453%.This result is achieved in an average time of 3.6725 s,the best result among all the competing approaches utilized in the experiments.

关键词： Medical dataset breast cancer guided whale optimizer dipper throated optimizer feature selection meta-heuristics

来源：评论

学校读者我要写书评

暂无评论

Efficient Data Completion and Augmentation

Efficient Data Completion and Augmentation

引用

International Conference on Data Science and Advanced Analytics (DSAA)

作者： Antonina Krajewska Ewa Niewiadomska-Szynkiewicz Research and Academic Computer Network (NASK) Warsaw Poland Institute of Control and Computation Engineering Warsaw University of Technology Warsaw Poland

ISBN: (数字)9798350364941

ISBN: (纸本)9798350364958

Fast data completion and augmentation methods with provable theoretical guarantees enable efficient and reliable data analysis. Many datasets can be represented as real-valued matrices and filled using matrix completion (MC) methods. This paper proposes a novel two-step approach for matrix recovery involving the sequential solution of convex optimization tasks. Firstly, a subset of columns is randomly chosen, and the matrix is completed using a nuclear norm minimization algorithm. Secondly, we solve the least squares problem by incorporating the known elements and the completed columns. We introduce three algorithms for implementing our Columns Selected Matrix Completion (CSMC) method, tailored to different problem sizes. Provided necessary assumptions and the probability of achieving accurate solutions are validated through extensive numerical experiments. Synthetic data experiments assess the method's performance regarding matrix size, rank, and missing element proportion. Evaluation in image completion and graph link prediction demonstrates that CSMC provides comparable solution quality to state-of-the-art convex optimization-based MC algortthms while significantly reduciny computation time.

关键词： Accuracy Reliability theory Data science Minimization Convex functions Optimization Synthetic data

来源：评论

学校读者我要写书评

暂无评论

An approach towards Model-To-Model Mapping between AUTOSAR and Android systems 45

An approach towards Model-To-Model Mapping between AUTOSAR a...

引用

45th Jubilee International Convention on Information, Communication and Electronic Technology, MIPRO 2022

作者： Zlatkovic, Radomir Cabrilo, Vuk Antic, Marija Kovacevic, Branimir University of Novi Sad Faculty of Technical Sciences Department of Computing and Control Engineering Serbia RT-RK Institute for Computer Based Systems Novi Sad Serbia

ISBN: (纸本)9789532331035

Every new generation of modern vehicles aims to provide the customers with a higher level of comfort and entertainment services. Consequently, the burden is placed upon the manufacturers to incorporate ever more complex electronic systems in their products and introduce service-based technologies. To meet these demands, service-oriented architecture (SOA) has become an integral part of the Adaptive AUTOSAR as the industry standard. Also, mobile services and applications are natively supported in the new in-vehicle infotainment systems (IVI) which usually run on the Android operating system. As these fundamentally different technologies are incorporated in the vehicles, the developers are facing the challenge of connecting them and exchanging information between the services running in different domains. Service-oriented architectures usually rely on a model-driven engineering approach to facilitate the development of the applications. However, as the complexity of the system grows, the mapping of various metamodels becomes a challenge, as no single standard is used across all domains in the vehicle. This paper provides a possible solution for mapping the already existing AUTOSAR metamodel to an Android Interface Definition Language (AIDL) metamodel. By applying the proposed mapping, it is possible to build applications that require the cooperation of various domains within the vehicle. © 2022 Croatian Society MIPRO.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Multi-Point Positional Insertion Tuning for Small Object Detection

arXiv

引用

arXiv 2024年

作者： Goto, Kanoko Karasawa, Takumi Hirose, Takumi Kawakami, Rei Inoue, Nakamasa Dept. of Computer Science Institute of Science Tokyo Tokyo Japan Dept. of Systems and Control Engineering Institute of Science Tokyo Tokyo Japan

Small object detection aims to localize and classify small objects within images. With recent advances in large-scale vision-language pretraining, finetuning pretrained object detection models has emerged as a promising approach. However, finetuning large models is computationally and memory expensive. To address this issue, this paper introduces multi-point positional insertion (MPI) tuning, a parameter-efficient finetuning (PEFT) method for small object detection. Specifically, MPI incorporates multiple positional embeddings into a frozen pretrained model, enabling the efficient detection of small objects by providing precise positional information to latent features. Through experiments, we demonstrated the effectiveness of the proposed method on the SODA-D dataset. MPI performed comparably to conventional PEFT methods, including CoOp and VPT, while significantly reducing the number of parameters that need to be tuned. Copyright © 2024, The Authors. All rights reserved.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

Finite-time robust performance improvement for non-linear systems in the presence of input non-linearity and external disturbance

引用

IET control Theory and Applications 2023年第6期17卷 672-682页

作者： Wang, Haoping Ghaffari, Valiollah Mobayen, Saleh Bartoszewicz, Andrzej Fekih, Afef Assawinchaichote, Wudhichai School of Automation Nanjing University of Science and Technology Nanjing China Department of Electrical Engineering Persian Gulf University Bushehr Iran Graduate School of Intelligent Data Science National Yunlin University of Science and Technology Yunlin Douliou Taiwan Institute of Automatic Control Lodz University of Technology Lodz Poland Department of Electrical and Computer Engineering University of Louisiana at Lafayette LafayetteLA United States Department of Electronic and Telecommunication Engineering Faculty of Engineering King Mongkut's University of Technology Thonburi Bangkok Thailand

The main focus of this research is on improving the performance of dynamic systems with actuator non-linearities and time-varying disturbances. To this end, using the concept of finite-time stability, a novel observer is presented to estimate the disturbances in systems with input non-linearities. Then, introducing an innovative sliding manifold, a robust observer-based technique is derived to guarantee the finite-time stability of the sliding surface. Hence, the closed-loop system would be stable in the presence of hard non-linearities and time-varying disturbances. The performance of the proposed approach was assessed in using a simulation study of two numerical examples. The obtained results and comparison with a conventional method confirmed the benefits of the suggested approach. © 2022 The Authors. IET control Theory & Applications published by John Wiley & Sons Ltd on behalf of The Institution of engineering and Technology.

关键词： Closed loop systems

来源：评论

学校读者我要写书评

暂无评论

Bayesian hypergame approach to equilibrium stability and robustness in moving target defense 63

Bayesian hypergame approach to equilibrium stability and rob...

引用

63rd IEEE Conference on Decision and control, CDC 2024

作者： Zhang, Hanzheng Cheng, Zhaoyang Chen, Guanpu Johansson, Karl Henrik Shanghai Research Institute for Autonomous Intelligent Systems Tongji University Shanghai China University of Chinese Academy of Science Academy of Mathematics and System Science Chinese Academy of Science Beijing China Kth Royal Institute of Technology and the Digital Futures Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm Sweden

ISBN: (纸本)9798350316339

We investigate the equilibrium stability and robustness in a class of moving target defense problems, in which players have both incomplete information and asymmetric cognition. We first establish a Bayesian Stackelberg game model for incomplete information and then employ a hypergame reformulation to address asymmetric cognition. With the core concept of the hyper Bayesian Nash equilibrium (HBNE), a condition for achieving both the strategic and cognitive stability in equilibria can be realized by solving linear equations. Moreover, to deal with players' underlying perturbed knowledge, we study the equilibrium robustness by presenting a condition of robust HBNE under the given configuration. Experiments evaluate our theoretical results. © 2024 IEEE.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Parallel-Friendly and Work-Efficient Single Source Shortest Path Algorithm on Single-Node System 24

Parallel-Friendly and Work-Efficient Single Source Shortest ...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on Data Science and Systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Zhang, Jie Zhang, Yuan Sun, Yiming Cao, Huawei An, Xuejun Ye, Xiaochun Institute of Computing Technology Cas State Key Lab of Processors Beijing China School of Computer and Control Engineering Ucas Beijing China Nanjing Institute of Information Superbahn Cas Nanjing China

ISBN: (纸本)9798350319934

The Single-Source Shortest Path (SSSP) algorithm is one of the most important kernels used by a variety of high-level graph processing applications. Although having been extensively studied for single-node scenarios, SSSP algorithm still faces difficulties when being deployed on scale-free graph, which brings about redundant edge traversals, expensive atomic operations and random memory access. In this paper, three parallel-friendly and work-efficient opti-mizations are introduced to improve the performance of parallel SSSP algorithm with shared memory on the single-node system. First, a label-aware pruning technique is proposed to reduce the redundant edge traversals. Then, atomic operations caused by race conditions are eliminated by using destination-driven sub graph partitioning. Finally, we propose a double-ordered bucket strategy to further improve the efficiency of SSSP. The experiment demonstrates that the average speedup reaches to 27.58x compared with original implement for R-MAT graphs. Meanwhile, our method achieves up to 2.12x for R-MAT graphs and 4.45 x for real-world graphs on average compared to previous state-of-the-art parallel implementation. © 2022 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：