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

Ubiquitous Computing and Intelligent Information systems (ICUIS), International Conference on

作者： Abotle Tito Kokoro Abid Yahya Ravi Samikannu K.Maruliya Begam T. Meeradevi Vishnu Kumar Kaliappan Department of Electrical and Communications Systems Engineering Botswana International University of Science and Technology Palapye Botswana Department of Electrical and Electronics Engineering Periyar Maniammai Institute of Science and Technology Thanjavur India Department of Electronics and Communications Engineering Kongu Engineering College Perundurai Tamil Nadu India Department of Computer Science and Engineering KPR Institute of Engineering and Technology Coimbatore India

ISBN: (数字)9798331529635

ISBN: (纸本)9798331529642

This paper proposes a novel strategy to address the difficulties encountered in Botswana's open-pit mine dewatering procedures. The conventional approach, which relies on labor-intensive manual labor and mechanical switching, is expensive, time-consuming, and present significant safety hazards. To overcome these limitations, this project proposes a multi-sensor network system that automates and optimizes the dewatering process and improve operational efficiency. The system integrates real-time sensor data to monitor fuel consumption and water levels in mining pits, enabling precise pump operation control. The system has two sets of sensors for data collection on fuel levels in the reserve and dewatering pump tank. Water level sensors are also used to monitor the water levels in the tank and turn the pump on or off based on predetermined thresholds. After receiving the sensor data, a microcontroller controls the entire process and shows the fuel levels and consumption on an LCD screen. The system's circuitry was designed and simulated using Proteus software, and the LCD successfully displayed measurements obtained from the sensors. When the sump level surpassed the predetermined threshold, a relay was energized to initiate the motor, thereby pumping out the water. Similarly, the tank level sensor (LV800) detected water levels exceeding 80% capacity, sending a signal to the microcontroller, which, in turn, energized the relay to activate the stage motor. The LCD also displayed readings from the temperature and current sensors. Simulation results indicate that the proposed sensor-based approach effectively monitors the condition of the pumps. At the same time, the microcontroller, in conjunction with the sensors, can adequately control the pump's operation during the dewatering process in the mining pit. This research demonstrates the feasibility and effectiveness of employing sensors and a microcontroller in managing and controlling dewatering pumps. By automating the

关键词： Temperature sensors Temperature measurement Microcontrollers Motors control systems Liquid crystal displays Real-time systems Fuels Relays Monitoring

来源：评论

学校读者我要写书评

暂无评论

Deep Learning control for Autonomous Robot

引用

computers, Materials & Continua 2022年第8期72卷 2811-2824页

作者： Rihem Farkh Saad Alhuwaimel Sultan Alzahrani Khaled Al Jaloud Mohammad Tabrez Quasim College of Engineering Muzahimiyah BranchKing Saud UniversityRiyadh11451Saudi Arabia Laboratory for Analysis Conception and Control of SystemsLR-11-ES20Department of Electrical Engineering National Engineering School of TunisTunis El Manar University1002Tunisia King Abdulaziz City for Science and Technology Saudi Arabia College of Computing and Information Technology University of BishaBisha67714Saudi Arabia

Several applications of machine learning and artificial intelligence,have acquired importance and come to the fore as a result of recent advances and improvements in these *** cars are one such *** is expected to have a significant and revolutionary influence on *** with smart cities,new infrastructure and urban planning with sophisticated cyber-security are some of the current ramifications of self-driving *** autonomous automobile,often known as selfdriving systems or driverless vehicles,is a vehicle that can perceive its surroundings and navigate predetermined routes without human *** are on the verge of evolving into autonomous robots,thanks to significant breakthroughs in artificial intelligence and related technologies,and this will have a wide range of socio-economic ***,in order for these automobiles to become a reality,they must be endowed with the perception and cognition necessary to deal with high-pressure real-life events and make proper judgments and take appropriate *** majority of self-driving car technologies are based on computer systems that automate vehicle control *** forward-collision warning and antilock brakes to lane-keeping and adaptive drive control,to fully automated driving,these technological components have a wide range of capabilities.A self-driving car combines a wide range of sensors,actuators,and *** researches on computer vision and deep learning are used to control autonomous driving *** self-driving automobiles,lane-keeping is *** study presents a deep learning approach to obtain the proper steering angle to maintain the robot in the *** propose an advanced control for a selfdriving robot by using two controllers *** neural networks(CNNs)are employed,to predict the car’and a proportionalintegral-derivative(PID)controller is designed for speed and steering *** stu

关键词： Autonomous car cascade PID control deep learning convolutional neural network differential drive system raspberry PI road lane detector

来源：评论

学校读者我要写书评

暂无评论

Safe vehicle motion design with learning for moving in environment with uncertainties ⁎

引用

IFAC-PapersOnLine 2024年第4期58卷 228-233页

作者： Dénes Tompos Balázs Németh Tamás Hegedűs Vu Van Tan Péter Gáspár Institute for Computer Science and Control (SZTAKI) Hungarian Research Network (HUN-REN) Kende u. 13-17. 1111 Budapest Hungary Department of Control for Transportation and Vehicle Systems Budapest University of Technology and Economics Stoczek u. 2. 1111 Budapest Hungary Department of Automotive Mechanical Engineering Faculty of Mechanical Engineering University of Transport and Communications 3 Cau Giay Street 100000 Hanoi Vietnam

In this paper a motion profile design for unmanned aerial vehicles is proposed which method is able to guarantee safe collision-free motion. The motivations of the work are provided by the uncertainties of covered areas by the vehicles, and also the need of high performance fast vehicle motion. The uncertain information on the environment for detecting Conflict areas is processed through clustering and Mahalanobis-distance-based filtering methods. The resulted Conflict areas are involved in the motion design method, which is facilitated through reinforcement learning. This paper shows the application of the method on a drone that moves together with a mobile robot in the same environment. The safe and high performance motion of the drone is illustrated through simulation example.

关键词： Unmanned aerial vehicles safe motion clustering point clouds

来源：评论

学校读者我要写书评

暂无评论

Reinforcement Learning for Platooning control in Vehicular Networks

Reinforcement Learning for Platooning Control in Vehicular N...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Thiago S. Gomides Evangelos Kranakis Ioannis Lambadaris Yannis Viniotis Carleton University School of Computer Science Ottawa ON Canada Department of Systems and Computer Engineering Carleton University Ottawa ON Canada Department of Electrical and Computer Engineering North Carolina State University Raleigh NC USA

Truck platooning is a promising technology that can reduce costs (fuel consumption) and enhance the overall transportation productivity. While recent research has focused on platoons' network and stability, few studies have tackled platooning formation and control. This paper uses Reinforcement Learning (RL) to study the dispatching control of trucks with arriving platoons, a problem first proposed in [1]. This work builds on [1] by considering the lack of the cost function and statistical knowledge. In particular, we employ Q-learning to compute the optimal dispatch control policy at a highway hub. Given the unbounded state space of the model, traditional Q-learning may converge slowly or even get stuck in sub-optimal policies. We improve Q-learning by confining the agent to transition in a finite subset of the state space. For this purpose, we use the switching condition property of the optimal policy (derived in [1]), the underlying random walk model, and a sensitivity analysis of the cost function. Our numerical results demonstrate that our Enhanced Q-learning converges significantly faster (up to 97%) in terms of CPU time and number of interactions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Q-PAC: Automated Detection of Quantum Bug-Fix Patterns

arXiv

引用

arXiv 2023年

作者： Nayak, Pranav K. Kher, Krishn V. Chandra, M. Bharat Rao, M.V. Panduranga Zhang, Lei Department of Computer Science and Engineering IIT Hyderabad India Department of Information Systems University of Maryland Baltimore County United States

Context: Bug-fix pattern detection has been investigated in the past in the context of classical software. However, while quantum software is developing rapidly, the literature still lacks automated methods and tools to identify, analyze, and detect bug-fix patterns. To the best of our knowledge, our work previously published in SEKE’23 was the first to leverage classical techniques to detect bug-fix patterns in quantum code. Objective: To extend our previous effort, we present a research agenda (Q-Repair), including a series of testing and debugging methodologies, to improve the quality of quantum software. The ultimate goal is to utilize machine learning techniques to automatically predict fix patterns for existing quantum bugs. Method: As part of the first stage of the agenda, we extend our initial study and propose a more comprehensive automated framework, called Q-PAC, for detecting bug-fix patterns in IBM Qiskit quantum code. In the framework, we develop seven bug-fix pattern detectors using abstract syntax trees, syntactic filters, and semantic checks. Results: To demonstrate our method, we run Q-PAC on a variety of quantum bug-fix patterns using both real-world and handcrafted examples of bugs and fixes. The experimental results show that Q-PAC can effectively identify bug-fix patterns in IBM Qiskit. Conclusion: We hope our initial study on quantum bug-fix detection can bring awareness of quantum software engineering to both researchers and practitioners. Thus, we also publish Q-PAC as an open-source software on GitHub. We would like to encourage other researchers to work on research directions (such as Q-Repair) to improve the quality of the quantum programming. © 2023, CC BY-SA.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

IRKO:An Improved Runge-Kutta Optimization Algorithm for Global Optimization Problems

引用

computers, Materials & Continua 2022年第3期70卷 4803-4827页

作者： R.Manjula Devi M.Premkumar Pradeep Jangir Mohamed Abdelghany Elkotb Rajvikram Madurai Elavarasan Kottakkaran Sooppy Nisar Department of Computer Science and Engineering Kongu Engineering CollegePerundurai638060Tamil NaduIndia Department of Electrical&Electronics Engineering Dayananda Sagar College of EngineeringBengaluru560078KarnatakaIndia Rajasthan Rajya Vidyut Prasaran Nigam Sikar332025RajasthanIndia Mechanical Engineering Department College of EngineeringKing Khalid UniversityAbha61421Saudi Arabia Mechanical Engineering Department Faculty of EngineeringKafrelsheikh UniversityEgypt Clean and Resilient Energy Systems(CARES)Laboratory Texas A&MUniversityGalveston77553TXUSA College of Arts and Sciences Prince Sattam bin Abdulaziz UniversityWadi Aldawaser11991Saudi Arabia

Optimization is a key technique for maximizing or minimizing functions and achieving optimal cost,gains,energy,mass,and so *** order to solve optimization problems,metaheuristic algorithms are *** of these techniques are influenced by collective knowledge and natural *** is no such thing as the best or worst algorithm;instead,there are more effective algorithms for certain ***,in this paper,a new improved variant of a recently proposed metaphorless Runge-Kutta Optimization(RKO)algorithm,called Improved Runge-Kutta Optimization(IRKO)algorithm,is suggested for solving optimization *** IRKO is formulated using the basic RKO and local escaping operator to enhance the diversification and intensification capability of the basic RKO *** performance of the proposed IRKO algorithm is validated on 23 standard benchmark functions and three engineering constrained optimization *** outcomes of IRKO are compared with seven state-of-the-art algorithms,including the basic RKO *** to other algorithms,the recommended IRKO algorithm is superior in discovering the optimal results for all selected optimization *** runtime of IRKO is less than 0.5 s for most of the 23 benchmark problems and stands first for most of the selected problems,including real-world optimization problems.

关键词： engineering design global optimization local escaping operator metaheuristics Runge-Kutta optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Bio-Inspired Feature Selection and Fusion for Facial Emotion Recognition

Bio-Inspired Feature Selection and Fusion for Facial Emotion...

引用

India Council International Subsections Conference (INDISCON), IEEE

作者： Pranavi Gunda Mohan Teja Jabez Christopher Vasan Arunachalam Department of Computer Science and Information Systems BITS Pilani Telangana India Department of Civil Engineering BITS Pilani Telangana India

This work presents an approach to improve emotion recognition systems by using two approaches: selection of feature subset using swarm intelligence based bio-inspired algorithms, and fusion of features from different regions of the face. For feature subset selection, Particle Swarm Optimisation (PSO) and Cuckoo Search algorithms are used. Classification is based on the fusion of features from three regions - entire face, mouth and eyes - and the predicted emotion (class label) is decided as the one given by two or more regions (Majority Vote). The ensemble of classifiers includes Random Forest and k-NN classifiers. It can be inferred that the ensemble model on an average yields 92% accuracy for Random Forest and 90% for k-NN, with a selected subset of almost half, or even less than half of the total features extracted. Moreover, not just in the majority region alone, the ensemble model outperformed the models in the mouth region and the face region. Though this work does not intend to show significant improvement in classification accuracy, the hybrid approaches and feature subsets presented in this work can significantly reduce computations with large datasets along with promising classification performance; moreover, some general observations and outcomes would help follow-ups in this area of research.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums

Repairing Reed-Solomon Codes over Prime Fields via Exponenti...

引用

IEEE International Symposium on Information Theory

作者： Roni Con Noah Shutty Itzhak Tamo Mary Wootters Blavatnik School of Computer Science Tel Aviv University Stanford Institute for Theoretical Physics Stanford University Department of Electrical Engineering-Systems Tel Aviv University Department of Computer Science and Electrical Engineering Stanford University

This paper presents several repair schemes for lowrate Reed Solomon (RS) codes over prime fields that can repair any node by downloading a constant number of bits from each surviving node. The resulting total bandwidth is higher than the bandwidth incurred during the trivial repair; however, this is still interesting in the context of leakage-resilient secret sharing. In that language, our results give attacks that show that k-out-of-n Shamir’s Secret Sharing over prime fields for small k is not leakage resilient, even if the parties only leak a constant number of bits. To the best of our knowledge, these are the first such *** another application, we provide decoding schemes for RS codes over prime fields, where the entire RS codeword is recovered by transmitting a constant number of bits from each *** results follow from a novel connection between exponential sums and repair of RS codes. In particular, we show that nontrivial bounds on certain exponential sums imply the existence of efficient nonlinear repair schemes for RS codes over prime fields.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Invited Paper: Learned In-Sensor Visual Computing: From Compression to Eventification

Invited Paper: Learned In-Sensor Visual Computing: From Comp...

引用

IEEE International Conference on computer-Aided Design

作者： Yu Feng Tianrui Ma Adith Boloor Yuhao Zhu Xuan Zhang Department of Computer Science University of Rochester USA Department of Electrical and Systems Engineering Washington University in St. Louis USA

Visual computing is vital for numerous applications. In conventional visual computing systems, CMOS image sensors (CIS) act as pure imaging devices for capturing images, however, recent CIS designs increasingly integrate processing capabilities such as Deep Neural Networks (DNN), which give rise to a notion of in-sensor computing. In this paper, we propose a new concept, learned in-sensor visual computing, which exploits end-to-end optimization of in-sensor processing and downstream vision tasks to achieve better overall algorithm accuracy and adopts hardware/algorithm co-design to achieve ultra-low sensor energy consumption. Two examples of the learned in-sensor visual computing, Leca and EDGAzE, are demonstrated.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems

arXiv

引用

arXiv 2023年

作者： Curtis, Frank E. Kungurtsev, Vyacheslav Robinson, Daniel P. Wang, Qi Department of Industrial and Systems Engineering Lehigh University United States Department of Computer Science Czech Technical University Czech Republic

A stochastic-gradient-based interior-point algorithm for minimizing a continuously differentiable objective function (that may be nonconvex) subject to bound constraints is presented, analyzed, and demonstrated through experimental results. The algorithm is unique from other interior-point methods for solving smooth nonconvex optimization problems since the search directions are computed using stochastic gradient estimates. It is also unique in its use of inner neighborhoods of the feasible region—defined by a positive and vanishing neighborhood-parameter sequence—in which the iterates are forced to remain. It is shown that with a careful balance between the barrier, step-size, and neighborhood sequences, the proposed algorithm satisfies convergence guarantees in both deterministic and stochastic settings. The results of numerical experiments show that in both settings the algorithm can outperform projection-based methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：