Gamma Ray Array Detector(GRAD) is one of external target facility subsystems in the Cooling Storage Ring on the Heavy Ion Research Facility at Lanzhou(HIRFL-CSR).The trigger subsystem of GRAD is required to make a fas...Gamma Ray Array Detector(GRAD) is one of external target facility subsystems in the Cooling Storage Ring on the Heavy Ion Research Facility at Lanzhou(HIRFL-CSR).The trigger subsystem of GRAD is required to make a fast L1 trigger decision with a fixed latency for the data acquisition.Because the hit signals from the detector are asynchronous with the local clock of the trigger system,a nondeterministic latency(the value changes between zero and one clock period) is generated when the synchronous receivers of the conventional trigger system process the hit signals.In this paper,an improved trigger logic based on a field-programmable gate array is developed,and comprised of zero-delay broadening circuits as receivers and an improved adding circuit designed for the new receivers.Software simulation and experimental measurement have been conducted.Comparison with the conventional trigger logic,the improved trigger logic has the advantage of eliminating the nondeterministic latency and reducing the total processing latency.展开更多
This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to del...This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.展开更多
In some practical applications modeled by discrete-event systems(DES),the observations of events may be no longer deterministic due to sensor faults/failures,packet loss,and/or measurement uncertainties.In this contex...In some practical applications modeled by discrete-event systems(DES),the observations of events may be no longer deterministic due to sensor faults/failures,packet loss,and/or measurement uncertainties.In this context,it is interesting to reconsider the infinite-step opacity(∞-SO)and K-step opacity(K-SO)of a DES under abnormal conditions as mentioned.In this paper,the authors extend the notions of∞-SO and K-SO defined in the standard setting to the framework of nondeterministic observations(i.e.,the event-observation mechanism is state-dependent and nondeterministic).Obviously,the extended notions of∞-SO and K-SO are more general than the previous standard ones.To effectively verify them,a matrix-based current state estimator in the context of this advanced framework is constructed using the Boolean semi-tensor product(BSTP)technique.Accordingly,the necessary and sufficient conditions for verifying these two extended versions of opacity are provided as well as their complexity analysis.Finally,several examples are given to illustrate the obtained theoretical results.展开更多
The aim is to study the set of subsets of grids of the Waterloo language from the point of view of abstract algebra and graph theory. The study was conducted using the library for working with transition graphs of non...The aim is to study the set of subsets of grids of the Waterloo language from the point of view of abstract algebra and graph theory. The study was conducted using the library for working with transition graphs of nondeterministic finite automata NFALib implemented by one of the authors in C#, as well as statistical methods for analyzing algorithms. The results are regularities obtained when considering semilattices on a set of subsets of grids of the Waterloo language. It follows from the results obtained that the minimum covering automaton equivalent to the Waterloo automaton can be obtained by adding one additional to the minimum covering set of grids. .展开更多
基金Supported by the Important Direction Project of the CAS Knowledge Innovation Program(No.KJCX2-YW-N27)the National Natural Science Foundation of China(No.11079045)
文摘Gamma Ray Array Detector(GRAD) is one of external target facility subsystems in the Cooling Storage Ring on the Heavy Ion Research Facility at Lanzhou(HIRFL-CSR).The trigger subsystem of GRAD is required to make a fast L1 trigger decision with a fixed latency for the data acquisition.Because the hit signals from the detector are asynchronous with the local clock of the trigger system,a nondeterministic latency(the value changes between zero and one clock period) is generated when the synchronous receivers of the conventional trigger system process the hit signals.In this paper,an improved trigger logic based on a field-programmable gate array is developed,and comprised of zero-delay broadening circuits as receivers and an improved adding circuit designed for the new receivers.Software simulation and experimental measurement have been conducted.Comparison with the conventional trigger logic,the improved trigger logic has the advantage of eliminating the nondeterministic latency and reducing the total processing latency.
基金supported by Northern Border University,Arar,Kingdom of Saudi Arabia,through the Project Number“NBU-FFR-2024-2248-03”.
文摘This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.
基金supported by the National Natural Science Foundation of China under Grant Nos.61903274,61873342,61973175the Tianjin Natural Science Foundation of China under Grant No.18JCQNJC74000。
文摘In some practical applications modeled by discrete-event systems(DES),the observations of events may be no longer deterministic due to sensor faults/failures,packet loss,and/or measurement uncertainties.In this context,it is interesting to reconsider the infinite-step opacity(∞-SO)and K-step opacity(K-SO)of a DES under abnormal conditions as mentioned.In this paper,the authors extend the notions of∞-SO and K-SO defined in the standard setting to the framework of nondeterministic observations(i.e.,the event-observation mechanism is state-dependent and nondeterministic).Obviously,the extended notions of∞-SO and K-SO are more general than the previous standard ones.To effectively verify them,a matrix-based current state estimator in the context of this advanced framework is constructed using the Boolean semi-tensor product(BSTP)technique.Accordingly,the necessary and sufficient conditions for verifying these two extended versions of opacity are provided as well as their complexity analysis.Finally,several examples are given to illustrate the obtained theoretical results.
文摘The aim is to study the set of subsets of grids of the Waterloo language from the point of view of abstract algebra and graph theory. The study was conducted using the library for working with transition graphs of nondeterministic finite automata NFALib implemented by one of the authors in C#, as well as statistical methods for analyzing algorithms. The results are regularities obtained when considering semilattices on a set of subsets of grids of the Waterloo language. It follows from the results obtained that the minimum covering automaton equivalent to the Waterloo automaton can be obtained by adding one additional to the minimum covering set of grids. .
