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

An algorithm for conditional-fault local diagnosis of multiprocessor systems under the MM⁎ model

Theoretical computer science 2024年 987卷

作者： Lv, Yali Lin, Cheng-Kuan Hsu, D. Frank Fan, Jianxi School of Information Technology Henan University of Chinese Medicine Zhengzhou China Department of Computer Science National Yang Ming Chiao Tung University Hsinchu Taiwan Undergraduate Degree Program of Systems Engineering and Technology National Yang Ming Chiao Tung University Hsinchu Taiwan Computer Science and Information Engineering Chung Cheng Institute of Technology NDU Taoyuan Taiwan Department of Computer and Information Science Fordham University New York United States School of Computer Science and Technology Soochow University Suzhou China

Diagnosis is a crucial subject for maintaining the reliability of multiprocessor systems. Under the MM⁎ diagnosis model, Sengupta and Dahbura proposed a polynomial-time algorithm with time complexity O(N5) to diagnose a system with N processors. In this paper, we propose a (α,β)-trees combination S(u,X,α,β) and give an algorithm to identify the fault or fault-free status of each processor for conditional local diagnosis under the MM⁎ model. According to our results, a connected network with a (α,β)-trees combination S(u,X,α,β) for a node u is conditionally locally (α+2β−3)-diagnosable at node u and the time complexity of our algorithm to diagnose u is O(α2β+αβ2). As an application, we show that our algorithm can identify the status of each node of n-dimensional star graph Sn if the faulty node number does not exceed 3n−8. Compared with existing algorithms, our algorithm allows more faulty nodes in a multiprocessor system. © 2024 Elsevier B.V.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Inner-approximate Reachability Computation via Zonotopic Boundary Analysis

arXiv

引用

arXiv 2024年

作者： Ren, Dejin Liang, Zhen Wu, Chenyu Ding, Jianqiang Wu, Taoran Xue, Bai Key Laboratory of System Software Chinese Academy of Sciences State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China College of Computer Science and Technology National University of Defense Technology Changsha China Department of Electrical Engineering and Automation Aalto University Espoo Finland

Inner-approximate reachability analysis involves calculating subsets of reachable sets, known as inner-approximations. This analysis is crucial in the fields of dynamic systems analysis and control theory as it provides a reliable estimation of the set of states that a system can reach from given initial states at a specific time instant. In this paper, we study the inner-approximate reachability analysis problem based on the set-boundary reachability method for systems modelled by ordinary differential equations, in which the computed inner-approximations are represented with zonotopes. The set-boundary reachability method computes an inner-approximation by excluding states reached from the initial set’s boundary. The effectiveness of this method is highly dependent on the efficient extraction of the exact boundary of the initial set. To address this, we propose methods leveraging boundary and tiling matrices that can efficiently extract and refine the exact boundary of the initial set represented by zonotopes. Additionally, we enhance the exclusion strategy by contracting the outer-approximations in a flexible way, which allows for the computation of less conservative inner-approximations. To evaluate the proposed method, we compare it with state-of-the-art methods against a series of benchmarks. The numerical results demonstrate that our method is not only efficient but also accurate in computing inner-approximations. Copyright © 2024, The Authors. All rights reserved.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

Intelligent Blood Flow Velocity Calculation using Deep Belief Network with Harmony Search Algorithm 2

Intelligent Blood Flow Velocity Calculation using Deep Belie...

引用

2nd International Conference on Electronics and Renewable systems, ICEARS 2023

作者： Mahendran, Radha Ala Walid, Md. Abul Vijaya Pratap, G. Pradeep, Aneesh Soumya, M. Udhayaraja, P. Institute of Science and Technology and Advanced Studies. Pv Department of Bioinformatics Vels Tamilnadu Chennai India Khulna9203 Bangladesh Sga Gov. Degree College Andhra Pradesh India New Uzbekistan University Software Engineering Tashkent Uzbekistan Sr University Department of Computer Science & Artificial Intelligence Telangana Warangal India Excel College for Commerce and Science Department of Microbiology Tamilnadu Namakkal India

ISBN: (纸本)9798350346640

Generally, the procedure of blood flow velocity computation contains gathered data on the movement of red blood cells or other indicators of blood flow and utilizes that data to compute the velocity of blood flows with the blood vessels. The procedure of blood flows velocity computation contains evaluating the speed at which blood moves through a blood vessel. It is done utilizing several approaches like magnetic resonance imaging (MRI), Doppler flowmetry, ultrasound, particle image velocimetry (PIV), or computed tomography (CT) scans. This manuscript involves the design of Intelligent Blood Flow Velocity Calculation using Deep Belief Network with Harmony Search Algorithm (BFV-DBNHSA) technique. The proposed BFV-DBNHSA technique computes the velocity of the blood flow accurately and timely. In the presented BFV-DBNHSA technique, the major aim is to determine the interior blood flow velocity. To accomplish this, the BFV-DBNHSA technique employs DBN model to produce the features of the blood flow velocity. Moreover, the BFV-DBNHSA technique uses HSA algorithm for optimal hyperparameter selection of the DBN model. The experimental outcome investigation of the BFV-DBNHSA system is well studied under different measures. The comprehensive comparison analysis revealed the improvement of the BFV-DBNHSA technique over recent algorithms. © 2023 IEEE.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Leveraging Point Annotations in Segmentation Learning with Boundary Loss 27th

Leveraging Point Annotations in Segmentation Learning with...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Breznik, Eva Kervadec, Hoel Malmberg, Filip Kullberg, Joel Ahlström, Håkan de Bruijne, Marleen Strand, Robin Department of Information Technology Uppsala University Uppsala Sweden Department of Biomedical Engineering and Health Systems Royal Institute of Technology Stockholm Sweden Antaros Medical Mölndal Sweden Department of Surgical Sciences Uppsala University Uppsala Sweden Department of Radiology and Nuclear Medicine Erasmus MC Rotterdam Netherlands Department of Computer Science University of Copenhagen Copenhagen Denmark

ISBN: (纸本)9783031782008

This paper investigates the combination of intensity-based distance maps with boundary loss for point-supervised semantic segmentation. By design, the boundary loss imposes a stronger penalty on the errors the farther away from the object boundary they occur. Hence it is inappropriate for cases of weak supervision where the ground truth label is much smaller than the actual object and a certain amount of false positives (w.r.t. the weak ground truth) is actually desirable. Using intensity-aware distances instead may alleviate this drawback, allowing for a certain amount of false positives with similar intensities without a significant increase to the training loss. This formulation is potentially more attractive than existing CRF-based regularizers, due to its simplicity and computational efficiency. We perform experiments on two multi-class datasets;ACDC (heart segmentation) and POEM (whole-body abdominal organ segmentation). Results are encouraging and show that this supervision strategy has great potential. On ACDC it outperforms the CRF-loss based approach, and on POEM data it performs on par with it. The code is made openly available. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

An Efficient Trajectory Planning for Cellular-Connected UAV under the Connectivity Constraint

引用

China Communications 2021年第2期18卷 136-151页

作者： Dingcheng Yang Qian Dan Lin Xiao Chuankuan Liu Laurie Cuthbert School of Information Engineering Nanchang UniversityNanchang 330031China School of Computer Science Jiangxi University of Traditional Chinese MedicineNanchang 330004China Information Systems Research Centre Macao Polytechnic InstituteMacaoChina

Unmanned Aerial Vehicles(UAVs)acting as aerial users to access the cellular network form a promising solution to guarantee its safe and efficient operations via the high-quality *** to the flexible mobility of UAVs and the coverage range limits of ground base station(GBS),the signalto-noise ratio(SNR)of the communication link between UAVs and GBS will *** is an important requirement to maintain the UAV’s cellular connection to meet a certain SNR requirement during the mission for UAV flying from take off to *** this paper,we study an efficient trajectory planning method that can minimize a cellular-connected UAV’s mission completion time under the connectivity *** conventional method to tackle this problem adopts graph theory or a dynamic programming method to optimize the trajectory,which generally incurs high computational ***,there is a nonnegligible performance gap compared to the optimal *** this end,we propose an iterative trajectory optimizing algorithm based on geometric ***,we apply graph theory to obtain all the possible UAV-GBS association sequences and select the candidate association sequences based on the topological relationship among UAV and ***,adopting the triangle inequality property,an iterative handover location design is proposed to determine the shortest flight trajectory with fast convergence and low computation ***,the best flight trajectory can be obtained by comparing all the candidate ***,we revealed the tradeoff between mission completion time and flight energy *** results validate that our proposed solution can obtain the effectiveness with set accuracy and outperform against the benchmark schemes with affordable computation time.

关键词： UAV communication trajectory planning cellular-connected UAV connectivity requirement

来源：评论

学校读者我要写书评

暂无评论

Observer-Based Control of Second-Order Multi-vehicle systems in Bearing-Persistently Exciting Formations

arXiv

引用

arXiv 2024年

作者： Tang, Zhiqi Fidan, Baris Johansson, Karl H. Mårtensson, Jonas Hamel, Tarek Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology StockholmSE-10044 Sweden Mechanical and Mechatronics Engineering Department University of Waterloo ON Canada France

This paper proposes an observer-based formation tracking control approach for multi-vehicle systems with second-order motion dynamics, assuming that vehicles' relative or global position and velocity measurements are unavailable. It is assumed that all vehicles are equipped with sensors capable of sensing the bearings relative to neighboring vehicles and only one leader vehicle has access to its global position. Each vehicle estimates its absolute position and velocity using relative bearing measurements and the estimates of neighboring vehicles received over a communication network. A distributed observer-based controller is designed, relying only on bearing and acceleration measurements. This work further explores the concept of the Bearing Persistently Exciting (BPE) formation by proposing new algorithms for bearing-based localization and state estimation of second-order systems in centralized and decentralized manners. It also examines conditions on the desired formation to guarantee the exponential stability of distributed observer-based formation tracking controllers. In support of our theoretical results, some simulation results are presented to illustrate the performance of the proposed observers as well as the observer-based tracking controllers. © 2024, CC BY-NC-ND.

关键词： Acceleration measurement

来源：评论

学校读者我要写书评

暂无评论

Style Matching CAPTCHA: Match Neural Transferred Styles to Thwart Intelligent Attacks

Research Square

引用

Research Square 2023年

作者： Ray, Palash Bera, Asish Giri, Debasis Bhattacharjee, Debotosh Department of Computer Science and Engineering Haldia Institute of Technology WB Haldia India Department of Computer Science and Information Systems Birla Institute of Technology and Science Pilani Pilani Campus Rajasthan India Department of Information Technology Maulana Abul Kalam Azad University of Technology WB India Department of Computer Science and Engineering Jadavpur University WB India

Completely Automated Public Turing Test to Tell computers and Humans Apart (CAPTCHA) is widely used to prevent malicious automated attacks on various online services. Text- and image-CAPTCHAs have shown broader acceptability due to usability and security factors. However, recent progress in deep learning implies that text-CAPTCHAs can easily be exposed to various fraudulent attacks. Thus, image-CAPTCHAs are getting research attention to enhance usability and security. In this work, the Neural Style Transfer (NST) is adapted for designing an image-CAPTCHA algorithm to enhance security while maintaining human performance. In NST-rendered image-CAPTCHAs, existing methods inquire a user to identify or localize the salient object (e.g., content) which is solvable effortlessly by off-the-shelf intelligent tools. Contrarily, we propose a Style Matching CAPTCHA (SMC) that asks a user to select the style image which is applied in the NST method. A user can solve a random SMC challenge by understanding the semantic correlation between the content and style output as a cue. The performance in solving SMC is evaluated based on the 1368 responses collected from 152 participants through a web-application. The average solving accuracy in three sessions is 95.61%;and the average response time for each challenge per user is 6.52 seconds, respectively. Likewise, a Smartphone Application (SMC-App) is devised using the proposed method. The average solving accuracy through SMC-App is 96.33%, and the average solving time is 5.13 seconds. To evaluate the vulnerability of SMC, deep learning-based attack schemes using Convolutional Neural Networks (CNN), such as ResNet-50 and Inception-v3 are simulated. The average accuracy of attacks considering various studies on SMC using ResNet-50 and Inception-v3 is 37%, which is improved over © 2023, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Model Predictive Control for B-Spline Trajectory Tracking in Omnidirectional Robots

Model Predictive Control for B-Spline Trajectory Tracking in...

引用

Iberian Robotics Conference (ROBOT)

作者： José Pedro Carvalho António Paulo Moreira A. Pedro Aguiar Faculty of Engineering University of Porto (FEUP) Porto Portugal SYSTEC-ARISE Research Center for System and Technologies Porto Portugal INESC TEC-Institute for Systems and Computer Engineering Technology and Science Porto Portugal

ISBN: (数字)9798350376364

ISBN: (纸本)9798350376371

In the field of intelligent autonomous robots, integrating optimization techniques with classical control theory methods for mobile robot control is an increasingly prominent area of research. The combination enhances robots' ability to perform their tasks more efficiently, reliably, and safely. This paper addresses the development of a path and motion planning framework for omnidirectional robots, leveraging B-Splines and Trajectory Tracking with Model Predictive Control. The proposed framework is evaluated through software-in-the-loop tests using two distinct dynamical models and sets of hyperparameters. Final validation is conducted by implementing the framework within a ROS environment and performing field tests on a robotic platform. The results demonstrate that the robot can reliably track trajectories at its actuation limits, and the proposed framework enables the robot to increase its velocity up to 50% when compared to a PID path-following controller.

关键词： Uncertainty Trajectory tracking Wheels Predictive models Trajectory Planning Mobile robots Splines (mathematics) Robots Predictive control

来源：评论

学校读者我要写书评

暂无评论

SPAVIS: Mobile Application for Visually Impaired Based on Assistive software and Volunteerism

SPAVIS: Mobile Application for Visually Impaired Based on As...

引用

Advancements in Computing (ICAC), International Conference on

作者： M.A.M. Mahir M.N.M. Hussain R.D.D Perera Y.A.M Upendra C. J. Wickramarathne Dharshana Kasthurirathna Department of Computer Science & Software Engineering Sri Lanka Institute of Information Technology Malabe Sri Lanka

ISBN: (纸本)9798350398106

Sri Lankan population accounts up to almost one million visually impaired individuals out of which are mostly students and young individuals. As the educational structure for the visually impaired improves with funds, blind schools, and free education, assistance with minute needs for most visually impaired individuals comes at a cost. There are many assistive technologies, such as audio books, screen magnifiers, braille books, and screen readers, prevalent around the island. However, there are several limitations to these technologies, mainly their availability and affordability. In Sri Lanka, many individuals, societies, clubs, and many more are willing to volunteer to help those in need, even those that require physical attention. As much as it is anticipated to aid those in need, there is very little attention to the ways it can be done. Hence, this research provides a way to develop a user-friendly mobile application with assistive software and volunteerism to aid visually impaired students with their daily needs.

关键词： Braille Costs Sociology Education Assistive technologies Chatbots Mobile applications

来源：评论

学校读者我要写书评

暂无评论

Drosophila Larvae-Inspired Soft Crawling Robot with Multimodal Locomotion and Versatile Applications

引用

Research 2025年第1期7卷 35-46页

作者： Qin Fang Jingyu Zhang Yinhui He Nenggan Zheng Yue Wang Rong Xiong Zhefeng Gong Haojian Lu State Key Laboratory of Industrial Control and Technology Zhejiang UniversityHangzhou 310027China Institute of Cyber-Systems and Control Zhejiang UniversityHangzhou 310027China Medical School of Zhejiang University Hangzhou 310027China College of Computer Science and Technology Zhejiang UniversityHangzhou 310027China Stomatology Hospital School of StomatologyZhejiang University School of MedicineZhejiang Provincial Clinical Research Center for Oral DiseasesKey Laboratory of Oral Biomedical Research of Zhejiang ProvinceCancer Center of Zhejiang UniversityEngineering Research Center of Oral Biomaterials and Devices of Zhejiang ProvinceHangzhou 310000China

Soft crawling robots have been widely studied and applied because of their excellent environmental adaptability and flexible ***,most existing soft crawling robots typically exhibit a single-motion mode and lack diverse *** by Drosophila larvae,this paper proposes a compact soft crawling robot(weight,13 g;length,165 mm;diameter,35 mm)with multimodal locomotion(forward,turning,rolling,and twisting).Each robot module uses 4 sets of high-power-density shape memory alloy actuators,endowing it with 4 degrees of motion *** analyze the mechanical characteristics of the robot modules through experiments and simulation *** plug-and-play modules can be quickly assembled to meet different motion and task *** soft crawling robot can be remotely operated with an external controller,showcasing multimodal motion on various material *** a narrow maze,the robot demonstrates agile movement and effective maneuvering around *** addition,leveraging the inherent bistable characteristics of the robot modules,we used the robot modules as anchoring units and installed a microcamera on the robot's head for pipeline *** robot completed the inspection in horizontal,vertical,curved,and branched pipelines,adjusted the camera view,and twisted a valve in the pipeline for the first *** research highlights the robot's superior locomotion and application capabilities,providing an innovative strategy for the development of lightweight,compact,and multifunctional soft crawling robots.

关键词： multimodal locomotion versatile applications Drosophila larvae soft crawling robot weight soft crawling robots shape memory alloy actuators

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：