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.展开更多
We present a method of generating test cases from the software specifications which are modeled by nondeterministic finite state machines. It is applicable to both nondeterministic and deterministic finite state mach...We present a method of generating test cases from the software specifications which are modeled by nondeterministic finite state machines. It is applicable to both nondeterministic and deterministic finite state machines. When applied to deterministic machines, this method yields usually smaller test suites with full fault coverage than the existing methods that also assure full fault coverage. In particular, the proposed mehod can be used to test the control portion of software specified in the formalspecification languages SDL or ESTELLE.展开更多
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.展开更多
Information security plays an important role in every aspect of life to protect data from stealing and deciphering.However,most of the previously reported works were based on pure algorithm layer or pure physical laye...Information security plays an important role in every aspect of life to protect data from stealing and deciphering.However,most of the previously reported works were based on pure algorithm layer or pure physical layer encryptions,which have certain limitations in security.In this paper,a nondeterministic message encryption communication scheme is proposed based on a spin-space-frequency multiplexing metasurface(SSFMM),which integrates both algorithmic and physical layer encryptions,and can also produce multiple different ciphertexts for the same message to prevent the message from being cracked through frequency analysis,thus greatly enhancing the security of the information.To be specific,an SSFMM is first designed as a physical-layer meta-key,which can generate eight independent dot matrix holograms with different spin,space,and frequency characteristics.The target message is then encrypted based on these dot matrix holograms combined with algorithmic operations,and the encrypted message is converted into a quick response(QR)code for easy sending to the target users.Once the target user gets that QR code,he/she can scan it to obtain the encryption information,and then recover the target message according to the pre-agreed encryption protocol combined with the eight dot matrix holograms of SSFMM.Finally,the feasibility of the proposed encryption scheme was experimentally validated at the microwave frequency band.展开更多
Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annea...Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.展开更多
Generating desired states is a prerequisite in quantum information. Some desired states can be generated by a quantum-scissors device(QSD). We present a detailed analysis of the properties of the generated states, inc...Generating desired states is a prerequisite in quantum information. Some desired states can be generated by a quantum-scissors device(QSD). We present a detailed analysis of the properties of the generated states, including average photon numbers and intensity gains. The theoretical analysis shows that there is a nondeterministic amplification in terms of the average photon number under the condition that the average photon number of the input state is less than 1. In contrast to the input states, the generated states show the nonclassical property described by the negativity of the Wigner function. Furthermore, we generalize the QSD to truncate arbitrary photon number terms of the input states, which may be useful in high-dimensional quantum information processing.展开更多
Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Anneal...Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing (SA_RA) is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The pa- per outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing (QoSR) in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the (approximate) optimal configuration within a period of polynomial time.展开更多
In the present paper we introduce new heuristic methods for the state minimization of nondeterministic finite automata. These methods are based on the classical Kameda-Weiner algorithm joined with local search heurist...In the present paper we introduce new heuristic methods for the state minimization of nondeterministic finite automata. These methods are based on the classical Kameda-Weiner algorithm joined with local search heuristics, such as stochastic hill climbing and simulated annealing. The description of the proposed methods is given and the results of the numerical experiments are provided.展开更多
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. .展开更多
This paper deals with a comparative study on testing of concurrent programs based on different techniques. The various challenges in testing concurrent programming are: defining test coverage criteria based on control...This paper deals with a comparative study on testing of concurrent programs based on different techniques. The various challenges in testing concurrent programming are: defining test coverage criteria based on control flow, generating control flow graph of nondeterministic programs, investigating the applicability of sequential testing criteria to parallel program testing etc. For solving these issues, some existing techniques are discussed in this study. Various researchers use an intermediate graph called Event Inter Actions Graph (EIAG) to solve the problem of generating the control flow graph of nondeterministic programs. Some researches propose an intermediate graph called Interaction Sequence Testing Criteria (ISTC) approach based on sequence of interactions to solve the problem of test coverage criteria based on control and data flow. Another method to solve the problem of generating test coverage based on control flow graph of nondeterministic programs is constraint based approach. It needs constrained elements to generate test case which includes structural element and constraint. The selection of good test cases has been addressed by test data generation technique. The technique of concurrent path analysis approach is used to solve the problem of applicability of sequential testing criteria to parallel program testing. It reduces the number of combined concurrent test paths. The sequential test paths are combined to form concurrent test path. The Integration and System Test Automation (ISTA) approach is used to solve the problem of applicability of sequential testing criteria to parallel program testing. It is used for automated test case generation and execution by using high-level Petri net is a finite state test model.展开更多
As from time to time it is impractical to ask agents to provide linear orders over all alternatives,for these partial rankings it is necessary to conduct preference completion.Specifically,the personalized preference ...As from time to time it is impractical to ask agents to provide linear orders over all alternatives,for these partial rankings it is necessary to conduct preference completion.Specifically,the personalized preference of each agent over all the alternatives can be estimated with partial rankings from neighboring agents over subsets of alternatives.However,since the agents’rankings are nondeterministic,where they may provide rankings with noise,it is necessary and important to conduct the certainty-based preference completion.Hence,in this paper firstly,for alternative pairs with the obtained ranking set,a bijection has been built from the ranking space to the preference space,and the certainty and conflict of alternative pairs have been evaluated with a well-built statistical measurement Probability-Certainty Density Function on subjective probability,respectively.Then,a certainty-based voting algorithm based on certainty and conflict has been taken to conduct the certainty-based preference completion.Moreover,the properties of the proposed certainty and conflict have been studied empirically,and the proposed approach on certainty-based preference completion for partial rankings has been experimentally validated compared to state-of-arts approaches with several datasets.展开更多
Rapidly rising the quantity of Big Data is an opportunity to flout the privacy of people. Whenhigh processing capacity and massive storage are required for Big Data, distributed networkshave been used. There are sever...Rapidly rising the quantity of Big Data is an opportunity to flout the privacy of people. Whenhigh processing capacity and massive storage are required for Big Data, distributed networkshave been used. There are several people involved in these activities, the system may contributeto privacy infringements frameworks have been developed for the preservation of privacy atvarious levels (e.g. information age, information the executives and information preparing) asfor the existing pattern of huge information. We plan to frame this paper as a literature surveyof these classifications, including the Privacy Processes in Big Data and the presentation of theAssociate Challenges. Homomorphic encryption is particularised aimed at solitary single actionon the ciphered information. Homomorphic enciphering is restrained to an honest operation onthe encoded data. The reference to encryption project fulfils many accurate trading operationson coded numerical data;therefore, it protects the written in code-sensible information evenmore.展开更多
基金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.
文摘We present a method of generating test cases from the software specifications which are modeled by nondeterministic finite state machines. It is applicable to both nondeterministic and deterministic finite state machines. When applied to deterministic machines, this method yields usually smaller test suites with full fault coverage than the existing methods that also assure full fault coverage. In particular, the proposed mehod can be used to test the control portion of software specified in the formalspecification languages SDL or ESTELLE.
基金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(62071117 and 62288101)the Project for Jiangsu Specially-Appointed Professor,the Major Project of the Natural Science Foundation of Jiangsu Province(BK20212002)+1 种基金the 111 Project(111-2-05)the Fundamental Research Funds for the Central Universities(2242023K5002).
文摘Information security plays an important role in every aspect of life to protect data from stealing and deciphering.However,most of the previously reported works were based on pure algorithm layer or pure physical layer encryptions,which have certain limitations in security.In this paper,a nondeterministic message encryption communication scheme is proposed based on a spin-space-frequency multiplexing metasurface(SSFMM),which integrates both algorithmic and physical layer encryptions,and can also produce multiple different ciphertexts for the same message to prevent the message from being cracked through frequency analysis,thus greatly enhancing the security of the information.To be specific,an SSFMM is first designed as a physical-layer meta-key,which can generate eight independent dot matrix holograms with different spin,space,and frequency characteristics.The target message is then encrypted based on these dot matrix holograms combined with algorithmic operations,and the encrypted message is converted into a quick response(QR)code for easy sending to the target users.Once the target user gets that QR code,he/she can scan it to obtain the encryption information,and then recover the target message according to the pre-agreed encryption protocol combined with the eight dot matrix holograms of SSFMM.Finally,the feasibility of the proposed encryption scheme was experimentally validated at the microwave frequency band.
基金the National Natural Science Foundation of China (60373089, 60674106, and 60533010)the National High Technology Research and Development "863" Program (2006AA01Z104)
文摘Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.
基金supported by the National Natural Science Foundation of China(Grant Nos.11725524,61471356,and 11674089)
文摘Generating desired states is a prerequisite in quantum information. Some desired states can be generated by a quantum-scissors device(QSD). We present a detailed analysis of the properties of the generated states, including average photon numbers and intensity gains. The theoretical analysis shows that there is a nondeterministic amplification in terms of the average photon number under the condition that the average photon number of the input state is less than 1. In contrast to the input states, the generated states show the nonclassical property described by the negativity of the Wigner function. Furthermore, we generalize the QSD to truncate arbitrary photon number terms of the input states, which may be useful in high-dimensional quantum information processing.
基金Supported by the National Natural Science Foundation of China (No.60472104), the Natural Science Research Program of Jiangsu Province (No.04KJB510094).
文摘Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing (SA_RA) is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The pa- per outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing (QoSR) in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the (approximate) optimal configuration within a period of polynomial time.
文摘In the present paper we introduce new heuristic methods for the state minimization of nondeterministic finite automata. These methods are based on the classical Kameda-Weiner algorithm joined with local search heuristics, such as stochastic hill climbing and simulated annealing. The description of the proposed methods is given and the results of the numerical experiments are provided.
文摘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. .
文摘This paper deals with a comparative study on testing of concurrent programs based on different techniques. The various challenges in testing concurrent programming are: defining test coverage criteria based on control flow, generating control flow graph of nondeterministic programs, investigating the applicability of sequential testing criteria to parallel program testing etc. For solving these issues, some existing techniques are discussed in this study. Various researchers use an intermediate graph called Event Inter Actions Graph (EIAG) to solve the problem of generating the control flow graph of nondeterministic programs. Some researches propose an intermediate graph called Interaction Sequence Testing Criteria (ISTC) approach based on sequence of interactions to solve the problem of test coverage criteria based on control and data flow. Another method to solve the problem of generating test coverage based on control flow graph of nondeterministic programs is constraint based approach. It needs constrained elements to generate test case which includes structural element and constraint. The selection of good test cases has been addressed by test data generation technique. The technique of concurrent path analysis approach is used to solve the problem of applicability of sequential testing criteria to parallel program testing. It reduces the number of combined concurrent test paths. The sequential test paths are combined to form concurrent test path. The Integration and System Test Automation (ISTA) approach is used to solve the problem of applicability of sequential testing criteria to parallel program testing. It is used for automated test case generation and execution by using high-level Petri net is a finite state test model.
基金supported by the National Natural Science Foundation of China(No.62076087,No.61906059&No.62120106008)the Program for Changjiang Scholars and Innovative Research Team in University(PCSIRT)of the Ministry of Education of China under grant IRT17R32
文摘As from time to time it is impractical to ask agents to provide linear orders over all alternatives,for these partial rankings it is necessary to conduct preference completion.Specifically,the personalized preference of each agent over all the alternatives can be estimated with partial rankings from neighboring agents over subsets of alternatives.However,since the agents’rankings are nondeterministic,where they may provide rankings with noise,it is necessary and important to conduct the certainty-based preference completion.Hence,in this paper firstly,for alternative pairs with the obtained ranking set,a bijection has been built from the ranking space to the preference space,and the certainty and conflict of alternative pairs have been evaluated with a well-built statistical measurement Probability-Certainty Density Function on subjective probability,respectively.Then,a certainty-based voting algorithm based on certainty and conflict has been taken to conduct the certainty-based preference completion.Moreover,the properties of the proposed certainty and conflict have been studied empirically,and the proposed approach on certainty-based preference completion for partial rankings has been experimentally validated compared to state-of-arts approaches with several datasets.
文摘Rapidly rising the quantity of Big Data is an opportunity to flout the privacy of people. Whenhigh processing capacity and massive storage are required for Big Data, distributed networkshave been used. There are several people involved in these activities, the system may contributeto privacy infringements frameworks have been developed for the preservation of privacy atvarious levels (e.g. information age, information the executives and information preparing) asfor the existing pattern of huge information. We plan to frame this paper as a literature surveyof these classifications, including the Privacy Processes in Big Data and the presentation of theAssociate Challenges. Homomorphic encryption is particularised aimed at solitary single actionon the ciphered information. Homomorphic enciphering is restrained to an honest operation onthe encoded data. The reference to encryption project fulfils many accurate trading operationson coded numerical data;therefore, it protects the written in code-sensible information evenmore.
