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

An Algorithm for Solving the Problem of Algebraic Synthesis of a finite-state machine with Datapath of Transitions Based on a Matrix Approach

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2025年第3期61卷 347-353页

作者： Babakov, R. M. Barkalov, A. A. VasylStus Donetsk Natl Univ Vinnytsya Ukraine Univ Zielona Gora Zielona Gora Poland

A new algorithm for solving the problem of algebraic synthesis is proposed for a finite-state machine with a datapath of transitions, which allows finding formal solutions to the problem for a given set of transition operations. The algorithm is based on presenting state encoding as a transition matrix. This matrix is compared with a combined matrix of operations, which contains all possible options for the transformation of state codes using a given set of transition operations. The element-by-element comparison of matrices allows revealing the availability of a formal solution for the selected set of state codes. It is shown that the proposed algorithm finds all the possible solutions using a complete enumeration of the ways of state encoding. The speed of the proposed algorithm was evaluated when it was implemented in Python.

关键词： finite-state machine datapath of transitions flowchart of algorithm algebraic synthesis state encoding

来源：评论

学校读者我要写书评

暂无评论

Nonexcessive-ΔV and Low Complexity Model Predictive Control Based on finite-state machine for Three-Level Three-Phase Inverters

引用

IEEE TRANSACTIONS ON POWER ELECTRONICS 2023年第7期38卷 8355-8366页

作者： Zhou, Hanbin Yang, Jian Huang, Liansheng Song, Dongran Dong, Mi Chen, Xiaojiao Cent South Univ Sch Automat Hunan 410083 Peoples R China Chinese Acad Sci Inst Plasma Phys Hefei 230031 Peoples R China

For three-level three-phase inverters, a novel finite-state machine-based model predictive control (FSM-MPC) is proposed. The state transition diagram of FSM is regarded as the operation guideline to avoid excessive voltage jumps (Delta V). No more than five voltage vectors (VVs) are selected as FSM-MPC's candidates VVs, based on the VV reference and the previous optimal VV. And the cost function is simplified in terms of time duration. Thus, evaluating a candidate VV requires a very low computation cost. Without losing control performance, the proposed FSM-MPC's execution time is decreased to 50% of theMPC algorithm, which enumerates all basic VVs to get global optimal VV and performance. Compared with the existing simplified algorithms, the proposed FSM-MPC makes current harmonics lower, and its average switching frequency is 33% less, which means much less switching loss. Furthermore, the proposed algorithm is robust when the electric-circuit parameters are mismatched in the control system. Experimental results are provided to validate the advantages of the proposed algorithm.

关键词： Calculation burden finite-state machine model predictive control three-level (3L) three-phase inverters voltage jump (Delta V)

来源：评论

学校读者我要写书评

暂无评论

A Matrix Method for Detecting Formal Solutions to the Problem of Algebraic Synthesis of a finite-state machine with a Datapath of Transitions

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2023年第2期59卷 190-198页

作者： Babakov, R. M. Barkalov, A. A. Vasyl Stus Donetsk Natl Univ Vinnytsia Ukraine Univ Zielona Gora Zielona Gora Poland

For a finite-state machine with a datapath of transitions, a new method for detecting formal solutions to an algebraic synthesis problem is proposed. It represents the set of finite-state machine transitions in the form of a matrix that contains information about the current state encoding. This matrix is matched to the merged matrix of operations, which contains all possible transformations of state codes using a given set of transition operations. Such an approach allows one to simultaneously compare all transition operations with each finite-state machine transition, which reduces the number of verifications of the existence of a formal solution to the problem of algebraic synthesis. The result is the reduction in the execution time of any algorithms of algebraic synthesis of a finite-state machine with a datapath of transitions based on the enumeration of ways of using the operations to implement automatic transitions.

关键词： finite-state machine datapath of transitions graph-scheme of algorithms algebraic synthesis matrix of transitions merged matrix of operations

来源：评论

学校读者我要写书评

暂无评论

Autonomous Vehicle Cut-In Algorithm for Lane-Merging Scenarios via Policy-Based Reinforcement Learning Nested Within finite-state machine

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2022年第10期23卷 17594-17606页

作者： Hwang, Seulbin Lee, Kibeom Jeon, Hyeongseok Kum, Dongsuk NAVER LABS Dept Robot SW & Deep Learning Gyeonggi 13591 South Korea Gachon Univ Dept Future Mobil Autonomous Syst Lab Gyeonggi 13120 South Korea Korea Adv Inst Sci & Technol KAIST Vehicular Syst Design & Control Lab Grad Sch Green Transportat Daejeon 34141 South Korea

Lane-merging scenarios pose highly challenging problems for autonomous vehicles due to conflicts of interest between the human-driven and cutting-in autonomous vehicles. Such conflicts become severe when traffic increases, and cut-in algorithms suffer from a steep trade-off between safety and cut-in performance. In this study, a reinforcement learning (RL)-based cut-in policy network nested within a finite state machine (FSM)--which is a high-level decision maker, is proposed to achieve high cut-in performance without sacrificing safety. This FSM-RL hybrid approach is proposed to obtain 1) a strategic and adjustable algorithm, 2) optimal safety and cut-in performance, and 3) robust and consistent performance. In the high-level decision making algorithm, the FSM provides a framework for four cut-in phases (ready for safe gap selection, gap approach, negotiation, and lane-change execution) and handles the transitions between these phases by calculating the collision risks associated with target vehicles. For the lane-change phase, a policy-based deep-RL approach with a soft actor-critic network is employed to get optimal cut-in performance. The results of simulations show that the proposed FSM-RL cut-in algorithm consistently achieves a high cut-in success rate without sacrificing safety. In particular, as the traffic increases, the cut-in success rate and safety are significantly improved over existing optimized rule-based cut-in algorithms and end-to-end RL algorithm.

关键词： Safety Reinforcement learning Autonomous vehicles Vehicles Decision making Automata Stochastic processes Autonomous vehicle lane-merge cut-in deep reinforcement learning finite-state machine

来源：评论

学校读者我要写书评

暂无评论

A finite-state machine-based control design for thermal and state-of-charge balancing of lithium iron phosphate battery using flyback converters

BATTERY ENERGY

引用

BATTERY ENERGY 2024年第4期3卷 20230055-20230055页

作者： Zabetian-Hosseini, Asal Ghazanfari, Amin Boulet, Benoit McGill Univ Elect & Comp Engn Dept Montreal PQ Canada Hydroquebec Ctr Excellence Transportat Electrifica Varennes PQ Canada Polytech Montreal Dept Elect Engn Montreal PQ Canada

Battery cell balancing plays a vital role in maximizing the performance of the battery system by enhancing battery system capacity and prolonging the battery system life expectancy. Active cell balancing using power converters is a promising approach to maintaining uniform state of charges (SoCs) and temperatures across battery cells. The SoC balancing function in the battery management system (BMS) increases the battery pack capacity, and the temperature balancing function mitigates variations in the aging of battery cells due to unbalanced temperatures. In this work, a finite-state machine-based control design is proposed for lithium iron phosphate (LFP) battery cells in series to balance SoCs and temperatures using flyback converters. The primary objective of this design is to ensure balanced SoCs by the end of the charging session while mitigating the temperature imbalance during the charging process. To achieve the SoC and temperature balancing functions using the same balancing circuits, a finite-state machine control design decides on the operating mode, and a balancing strategy balances either temperature or SoC depending on the operating mode. The proposed control design has the advantages of low computational burden, simple implementation compared to the optimization-based controller found in the literature, and the proposed balancing strategy offers faster balancing speed compared to conventional methods. The effectiveness of the proposed strategy is validated on battery cell RC models in series with unbalanced SoCs and temperatures. The process of design and validation of the proposed balancing algorithm to balance temperatures and SoCs among lithium iron phosphate battery cells. image

关键词： battery model finite-state machine flyback state-of-charge balancing temperature balancing

来源：评论

学校读者我要写书评

暂无评论

finite-state-machine inspired Hardware Watermark using Spin-Orbit Torque operated MTJ 56

Finite-State-Machine inspired Hardware Watermark using Spin-...

引用

56th IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Divyanshu, Divyanshu Kumar, Rajat Khan, Danial Amara, Selma Massoud, Yehia King Abdullah Univ Sci & Technol KAUST Innovat Technol Labs ITL Thuwal 239556900 Saudi Arabia

ISBN: (纸本)9781665451093

The globalization of the Integrated Circuits (ICs) supply chain has increased threats from untrusted entities involved in the process. Various threats, such as the insertion of hardware Trojans, counterfeiting, cloning, overproduction, etc., have emerged as a potential challenge in the ICs supply chain. Several mechanisms are widely used to ensure hardware security, like logic locking, watermarking, split manufacturing, etc. In this work, we propose a different approach to designing a finite state machine (FSM) inspired hardware-based watermarks using the unique physical characteristic of spin-orbit torque-based Magnetic Tunnel Junction (MTJ). Watermarks are helpful to authenticate proof of ownership and are a widely acclaimed strategy against the counterfeiting of chips. We discuss the design strategy involved in detail, the strategy to use the VLSI CAD tool to harness the unique ability of MTJ, such as non-volatility and dependence on an external magnetic field for guiding the information through a specific sequence of states in an FSM. Furthermore, the performance prospects are analyzed using Monte-Carlo simulations, and security aspects are described to ensure a more robust and practical application.

关键词： Watermarks hardware security spin-orbit torque magnetic tunnel junction finite-state machine

来源：评论

学校读者我要写书评

暂无评论

Novel approach for sleep disorder monitoring using a finite-state machine for localities lacking specialist physicians

引用

IET SCIENCE MEASUREMENT & TECHNOLOGY 2017年第8期11卷 1099-1103页

作者： Swetapadma, Aleena KIIT Univ Sch Comp Engn Bhubaneswar 751024 Odisha India

This study proposes a novel method for sleep disorder monitoring based on a finite-state machine (FSM) from various bio-signals, namely electroencephalography (EEG), electro-oculography (EOG) and electromyography (EMG) signals. The sleep signals have been obtained from physionet sleep repository, which includes horizontal EOG, submental-EMG and EEG sampled at 100Hz sampling frequency. Inputs given to the FSM-based module are the processed signals from EMG, EEG and EOG signals. The FSM module for sleep analysis is composed of different states and the conditions to flow from one state to another state. In this study, two FSM modules are designed, one for sleep wave and another for sleep stage identification. Based on the outputs obtained from the above two FSM modules, the sleep disorder can be monitored. The accuracy of the proposed method has been calculated with percentage accuracy, false acceptance rate and false rejection ratio. The average classification accuracy of the finite-state automaton (FSA)-based method is up to 99% for all the tested fault cases. The proposed FSA method suggests a novel method and can be put to effective use in the rural areas for primary analysis.

关键词： sleep medical disorders finite state machines electroencephalography electro-oculography electromyography neurophysiology medical signal processing sleep disorder monitoring finite-state machine electroencephalography electro-oculography electromyography physionet sleep repository horizontal EOG signals submental-EMG signals EEG signals sleep wave sleep stage identification finite-state automaton

来源：评论

学校读者我要写书评

暂无评论

A finite-state machine Based Approach for Fault Detection and Classification in Transmission Lines

引用

ELECTRIC POWER COMPONENTS AND SYSTEMS 2016年第1期44卷 43-59页

作者： Yadav, Anamika Swetapadma, Aleena Natl Inst Technol Dept Elect Engn Raipur 492010 CG India

In this article, a novel protective relaying scheme based on a finite-state machine is proposed to detect fault in transmission lines, classify the fault, and identify the faulty phase. The three-phase fundamental component of current and the zero-sequence current signals measured at one end of the double-circuit line are used as inputs. The finite-state machine based relaying scheme relies on time-series analysis of current signals only and is built upon the concepts from the finite-state automata theory. The finite-state machine works by transition of one state to another by following certain conditions. The proposed relay is tested during different shunt faultsinter-circuit and cross-country faultswith wide variations in fault parameters. The proposed method is adaptive to variation in fault type, fault resistance, fault inception angle, fault location, power flow angle, different line length, transient faults, current transformer (CT) saturation, and no-fault events. The relay performed correctly for 99.9% of test cases, proving the effectiveness of the proposed method. Furthermore, the proposed method can provide faster, more reliable protection against all shunt faults, inter-circuit and cross-country faults, with wide variations in parameters, and the protection range is effectively extended and greatly improved, which contributes to system safety and stability.

关键词： transmission-line protection finite-state machine fault detection fault classification response time

来源：评论

学校读者我要写书评

暂无评论

Conflict and Computation on Wikipedia: A finite-state machine Analysis of Editor Interactions

引用

FUTURE INTERNET 2016年第3期8卷 31-31页

作者： DeDeo, Simon Indiana Univ Dept Informat Ctr Complex Networks & Syst Res 919 E 10th St Bloomington IN 47408 USA Indiana Univ Program Cognit Sci 1900 E 10th St Bloomington IN 47406 USA Ostrom Workshop Polit Theory & Policy Anal 513 N Pk Ave Bloomington IN 47408 USA Santa Fe Inst 1399 Hyde Pk Rd Santa Fe NM 87501 USA

What is the boundary between a vigorous argument and a breakdown of relations? What drives a group of individuals across it? Taking Wikipedia as a test case, we use a hidden Markov model to approximate the computational structure and social grammar of more than a decade of cooperation and conflict among its editors. Across a wide range of pages, we discover a bursty war/peace structure where the systems can become trapped, sometimes for months, in a computational subspace associated with significantly higher levels of conflict-tracking "revert" actions. Distinct patterns of behavior characterize the lower-conflict subspace, including tit-for-tat reversion. While a fraction of the transitions between these subspaces are associated with top-down actions taken by administrators, the effects are weak. Surprisingly, we find no statistical signal that transitions are associated with the appearance of particularly anti-social users, and only weak association with significant news events outside the system. These findings are consistent with transitions being driven by decentralized processes with no clear locus of control. Models of belief revision in the presence of a common resource for information-sharing predict the existence of two distinct phases: a disordered high-conflict phase, and a frozen phase with spontaneously-broken symmetry. The bistability we observe empirically may be a consequence of editor turn-over, which drives the system to a critical point between them.

关键词： conflict cooperation finite-state machine tit-for-tat critical transition hidden Markov model memory social norms knowledge commons Wikipedia

来源：评论

学校读者我要写书评

暂无评论

A Novel Fault Self-diagnosis Algorithm Based on finite-state machine for Space Information Network

A Novel Fault Self-diagnosis Algorithm Based on Finite-state...

引用

2016 International Conference on Artificial Intelligence: Technologies and Applications (ICAITA 2016)

作者： Yuan Jiang Ning Li Fapeng Wang Cong Wang Lianguo Wu Institute of Communication Engineering PLA University of Science and Technology

ISBN: (纸本)9781510820524

the possibility of the development of space information network(SIN) was discussed in this paper,and a novel fault selfdiagnosis method was *** is limited research of space information network,especially in fault diagnosis *** paper gives expectation about future SIN features,and based on these features proposes a fault self-diagnosis algorithm based on finite-state *** design a series of novel fault detectors through which multiple satellites nodes can cooperate with each other in a diagnosis *** fault detectors encode the diagnosis process to state *** satellites can participate in the fault diagnosis by transiting the detector's current state to a new one based on local evidence and then pass the fault detector to other satellites.

关键词： self-diagnosis space information network(SIN) finite-state machine

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：