Dear editor,Reduction of finite automata (FA) is of great importance because of its practical applications in engineering; for example the memory space of hardware realization grows exponentially with the number of st...
详细信息
Dear editor,Reduction of finite automata (FA) is of great importance because of its practical applications in engineering; for example the memory space of hardware realization grows exponentially with the number of states of FSMs. Existing results for reducing FA can roughly be classified into four categories:merging of states [1], refining of the state
DNA methylation is a critical epigenetic modification that plays a central role in gene regulation, cellular differentiation, and the development of various diseases, including cancers. Aberrant methylation patterns h...
详细信息
Dear Editor,This letter proposes a contrastive consensus graph learning model for multi-view *** are usually built to outline the correlation between multi-model objects in clustering task,and multiview graph clusteri...
详细信息
Dear Editor,This letter proposes a contrastive consensus graph learning model for multi-view *** are usually built to outline the correlation between multi-model objects in clustering task,and multiview graph clustering aims to learn a consensus graph that integrates the spatial property of each view.
Because currently intrusion detection systems cannot detect undefined intrusion behavior effectively, according to the robustness and adaptability of the genetic algorithms, this paper integrates the genetic algorithm...
详细信息
Because currently intrusion detection systems cannot detect undefined intrusion behavior effectively, according to the robustness and adaptability of the genetic algorithms, this paper integrates the genetic algorithms into an intrusion detection system, and a detection algorithm based on network traffic is proposed. This algorithm is a real-time and self-study algorithm and can detect undefined intrusion behaviors effectively.
Using semi-tensor product of matrices, the controllability and stabilizability of finite automata are investigated. By expressing the states, inputs, and outputs in vector forms, the transition and output functions ar...
详细信息
Using semi-tensor product of matrices, the controllability and stabilizability of finite automata are investigated. By expressing the states, inputs, and outputs in vector forms, the transition and output functions are represented in matrix *** on this algebraic description, a necessary and sufficient condition is proposed for checking whether a state is controllable to another one. By this condition, an algorithm is established to find all the control sequences of an arbitrary length. Moreover, the stabilizability of finite automata is considered, and a necessary and sufficient condition is presented to examine whether some states can be stabilized. Finally, the study of illustrative examples verifies the correctness of the presented results/algorithms.
This paper investigates the transition function and the reachability conditions of finite automata by using a semitensor product of matrices, which is a new powerful matrix analysis tool. The states and input symbols ...
详细信息
This paper investigates the transition function and the reachability conditions of finite automata by using a semitensor product of matrices, which is a new powerful matrix analysis tool. The states and input symbols are first expressed in vector forms, then the transition function is described in an algebraic form. Using this algebraic representation, a sufficient and necessary condition of the reachability of any two states is proposed, based on which an algorithm is developed for discovering all the paths from one state to another. Furthermore, a mechanism is established to recognize the language acceptable by a finite automaton. Finally, illustrative examples show that the results/algorithms presented in this paper are suitable for both deterministic finite automata （DFA） and nondeterministic finite automata （NFA）.
A new modeling tool, algebraic state space approach to logical dynamic systems, which is developed recently based on the theory of semi-tensor product of matrices （STP）, is applied to the automata field. Using the S...
详细信息
A new modeling tool, algebraic state space approach to logical dynamic systems, which is developed recently based on the theory of semi-tensor product of matrices （STP）, is applied to the automata field. Using the STE this paper investigates the modeling and controlling problems of combined automata constructed in the ways of parallel, serial and feedback. By representing the states, input and output symbols in vector forms, the transition and output functions are expressed as algebraic equations of the states and inputs. Based on such algebraic descriptions, the control problems of combined automata, including output control and state control, are considered, and two necessary and sufficient conditions are presented for the controllability, by which two algorithms are established to find out all the control strings that make a combined automaton go to a target state or produce a desired output. The results are quite different from existing methods and provide a new angle and means to understand and analyze the dynamics of combined automata.
The existing solutions to keyword search in the cloud can be divided into two categories: searching on exact keywords and searching on error-tolerant keywords. An error-tolerant keyword search scheme permits to make s...
详细信息
The existing solutions to keyword search in the cloud can be divided into two categories: searching on exact keywords and searching on error-tolerant keywords. An error-tolerant keyword search scheme permits to make searches on encrypted data with only an approximation of some keyword. The scheme is suitable to the case where users’ searching input might not exactly match those pre-set keywords. In this paper, we first present a general framework for searching on error-tolerant keywords. Then we propose a concrete scheme, based on a fuzzy extractor, which is proved secure against an adaptive adversary under well-defined security definition. The scheme is suitable for all similarity metrics including Hamming distance, edit distance, and set difference. It does not require the user to construct or store anything in advance, other than the key used to calculate the trapdoor of keywords and the key to encrypt data documents. Thus, our scheme tremendously eases the users’ burden. What is more, our scheme is able to transform the servers’ searching for error-tolerant keywords on ciphertexts to the searching for exact keywords on plaintexts. The server can use any existing approaches of exact keywords search to search plaintexts on an index table.
Cascading failures, such as bankruptcies and defaults, pose a serious threat for the resilience of the global financial system. Indeed, because of the complex investment and cross-holding relations within the system, ...
详细信息
In this paper, we focus on the resource optimization issue in Wireless Body Area Networks (WBANs) section of a novel Biomedical Cyber Physical System (BM-CPS) in which the Digital Twin (DT) technique is adopted concur...
详细信息
暂无评论