In light of the service interruption risks that the automatic ticket checking system may encounter following the full implementation of e-tickets,we conducted a level-by-level analysis of significant abnormal events t...In light of the service interruption risks that the automatic ticket checking system may encounter following the full implementation of e-tickets,we conducted a level-by-level analysis of significant abnormal events that could occur throughout the e-ticket checking service process.Based on this analysis,we developed emergency response plans for various scenarios:To address the risk of passenger service record(PSR)cluster failures at the CHINA RAILWAY level,e-ticket data is remotely backed up to systems at the CR regional group level①.This serves as a data source for ticket verification during abnormal events.In the event of abnormal occurrences in the ticket checking system data at the CR regional group level,the ticket checking operation process is adjusted,and service is handled outside of the database.Additionally,column-type ticket checking machines are utilized to change the start and stop times of gate-type ticket checking machines,allowing for dynamic adjustment of the ticket checking plan by the ticket checking management system when the database is unavailable.To respond to abnormalities of the ticket checking system at the railway station level,handheld ticket checking machines can be employed as an emergency ticket verification method.Alternatively,leveraging the railway integrity system,a procedure is in place where ID cards are scanned first,followed by ticket checking,ensuring the smooth boarding and alighting of passengers at the station.Recent emergency drills and real-world emergency response applications during ticket checking operations have demonstrated the feasibility of these emergency plans at various levels of the ticket checking system.These measures can effectively meet the emergency response requirements of the automatic ticket checking system under full e-ticket conditions.展开更多
Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term...Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term definition set, instantiation assertion set and term restriction set. Based on the extended model, the issue on ontology checking was studied with the conclusion that the four kinds of term checking, including term satisfiability checking, term subsumption checking, term equivalence checking and term disjointness checking, can be reduced to the satisfiability checking, and satisfiability checking can be transformed into instantiation consistence checking.展开更多
Federal Aviation Administration(FAA) and NASA technical reports indicate that the misunderstanding in radiotelephony communications is a primary causal factor associated with operation errors, and a sizable proportion...Federal Aviation Administration(FAA) and NASA technical reports indicate that the misunderstanding in radiotelephony communications is a primary causal factor associated with operation errors, and a sizable proportion of operation errors lead to read-back errors. We introduce deep learning method to solve this problem and propose a new semantic checking model based on Long Short-Time Memory network(LSTM) for intelligent read-back error checking. A meanpooling layer is added to the traditional LSTM, so as to utilize the information obtained by all the hidden activation vectors, and also to improve the robustness of the semantic vector extracted by LSTM. A MultiLayer Perceptron(MLP) layer, which can maintain the information of different regions in the concatenated vectors obtained by the mean-pooling layer, is applied instead of traditional similarity function in the new model to express the semantic similarity of the read-back pairs quantitatively. The K-Nearest Neighbor(KNN) classifier is used to verify whether the read-back pairs are consistent in semantics according to the output of MLP layer. Extensive experiments are conducted and the results show that the proposed model is more effective and more robust than the traditional checking model to verify the semantic consistency of read-backs automatically.展开更多
Model checking based on linear temporal logic reduces the false negative rate of misuse detection.However,linear temporal logic formulae cannot be used to describe concurrent attacks and piecewise attacks.So there is ...Model checking based on linear temporal logic reduces the false negative rate of misuse detection.However,linear temporal logic formulae cannot be used to describe concurrent attacks and piecewise attacks.So there is still a high rate of false negatives in detecting these complex attack patterns.To solve this problem,we use interval temporal logic formulae to describe concurrent attacks and piecewise attacks.On this basis,we formalize a novel algorithm for intrusion detection based on model checking interval temporal logic.Compared with the method based on model checking linear temporal logic,the new algorithm can find unknown succinct attacks.The simulation results show that the new method can effectively reduce the false negative rate of concurrent attacks and piecewise attacks.展开更多
The current collector fracture failure of lithium-ion batteries(LIBs)occurs during its winding production process frequently,and the consequent damages are usually large,but little research has been conducted on this ...The current collector fracture failure of lithium-ion batteries(LIBs)occurs during its winding production process frequently,and the consequent damages are usually large,but little research has been conducted on this phenomenon.This work stems from the difficulty and obstacles in the winding process of actual production of LIBs.The fracture failure of the current collectors is easily caused by the evolution and mutation of the mechanical behavior during the winding process,resulting in safety hazards and poor efficiency.The purpose of this work is to reveal the evolution and distribution mechanism of circumferential strain of the current collectors on the fracture failure under the constraint of winding process.Experimental tests,finite element calculations and theoretical model are used to study the evolution and distribution of circumferential strain.The dynamic evolution process of circumferential strain is tested accurately,and the mechanism of fracture failure of current collectors is revealed.The criterion for current collector strength is proposed based on the results of strain analysis and SEM observation.展开更多
Product detection based on state abstraction technologies in the software product line(SPL)is more complex when compared to a single system.This variability constitutes a new complexity,and the counterexample may be v...Product detection based on state abstraction technologies in the software product line(SPL)is more complex when compared to a single system.This variability constitutes a new complexity,and the counterexample may be valid for some products but spurious for others.In this paper,we found that spurious products are primarily due to the failure states,which correspond to the spurious counterexamples.The violated products correspond to the real counterexamples.Hence,identifying counterexamples is a critical problem in detecting violated products.In our approach,we obtain the violated products through the genuine counterexamples,which have no failure state,to avoid the tedious computation of identifying spurious products dealt with by the existing algorithm.This can be executed in parallel to improve the efficiency further.Experimental results showthat our approach performswell,varying with the growth of the system scale.By analyzing counterexamples in the abstract model,we observed that spurious products occur in the failure state.The approach helps in identifying whether a counterexample is spurious or genuine.The approach also helps to check whether a failure state exists in the counterexample.The performance evaluation shows that the proposed approach helps significantly in improving the efficiency of abstraction-based SPL model checking.展开更多
The soundness is a very important criterion for the correctness of the workflow. Specifying the soundness with Computation Tree Logic (CTL) allows us to verify the soundness with symbolic model checkers. Therefore t...The soundness is a very important criterion for the correctness of the workflow. Specifying the soundness with Computation Tree Logic (CTL) allows us to verify the soundness with symbolic model checkers. Therefore the state explosion problem in verifying soundness can be overcome efficiently. When the property is not satisfied by the system, model checking can give a counter-example, which can guide us to correct the workflow. In addition, relaxed soundness is another important criterion for the workflow. We also prove that Computation Tree Logic * (CTL * ) can be used to character the relaxed soundness of the workflow.展开更多
In order to find the completeness threshold which offers a practical method of making bounded model checking complete, the over-approximation for the complete threshold is presented. First, a linear logic of knowledge...In order to find the completeness threshold which offers a practical method of making bounded model checking complete, the over-approximation for the complete threshold is presented. First, a linear logic of knowledge is introduced into the past tense operator, and then a new temporal epistemic logic LTLKP is obtained, so that LTLKP can naturally and precisely describe the system's reliability. Secondly, a set of prior algorithms are designed to calculate the maximal reachable depth and the length of the longest of loop free paths in the structure based on the graph structure theory. Finally, some theorems are proposed to show how to approximate the complete threshold with the diameter and recurrence diameter. The proposed work resolves the completeness threshold problem so that the completeness of bounded model checking can be guaranteed.展开更多
A novel design and implementation of an attendance checking node for coal mines based on the CAN bus is presented in this paper. Hardware circuits and programming methods for the attendance checking node are discussed...A novel design and implementation of an attendance checking node for coal mines based on the CAN bus is presented in this paper. Hardware circuits and programming methods for the attendance checking node are discussed,including the single-chip computer with CAN controller AT89C51CC03,the CAN bus transceiver TJA1050,the large capacity DataFlash memory,the real-time clock DS1302,the voice chip ISD2560 and the card-reading circuit in Wie-gand format. All the extended hardware satisfies the requirements for intrinsically safe circuits (GB3836.4-2000) and intrinsically safe authentication promoted by the national explosion-proof institute. Further,the software programming methods for the CAN controller (AT89C51CC03) and the implementation of the CAN communications protocol are presented as well.展开更多
A formal model representing the navigation behavior of a Web application as the Kripke structure is proposed and an approach that applies model checking to test case generation is presented. The Object Relation Diagra...A formal model representing the navigation behavior of a Web application as the Kripke structure is proposed and an approach that applies model checking to test case generation is presented. The Object Relation Diagram as the object model is employed to describe the object structure of a Web application design and can be translated into the behavior model. A key problem of model checking-based test generation for a Web application is how to construct a set of trap properties that intend to cause the violations of model checking against the behavior model and output of counterexamples used to construct the test sequences. We give an algorithm that derives trap properties from the object model with respect to node and edge coverage criteria.展开更多
The checking survey in Open mine is one of the most frequent and important work.It plays the role of forming a connecting link between open mine planning and pro- duction.Traditional checking method has such disadvant...The checking survey in Open mine is one of the most frequent and important work.It plays the role of forming a connecting link between open mine planning and pro- duction.Traditional checking method has such disadvantages as long time consumption, heavy workload,complicated calculating process,and lower automation.Used GPS and GIS technologies to systematically study the core issues of checking survey in open mine. A detail GPS data acquisition coding scheme was presented.Based on the scheme an algorithm used for computer semiautomatic cartography was made.Three methods used for eliminating gross errors from raw data which were needed for creating DEM was dis- cussed.Two algorithms were researched and realized which can be used to create open mine fine DEM model with constrained conditions and to dynamically update the model. The precision analysis and evaluation of the created model were carried out.展开更多
Classical logic cannot be used to effectively reason about concurrent systems with inconsistencies (inconsistencies often occur, especially in the early stage of the development, when large and complex concurrent syst...Classical logic cannot be used to effectively reason about concurrent systems with inconsistencies (inconsistencies often occur, especially in the early stage of the development, when large and complex concurrent systems are developed). In this paper, we propose the use of a guasi-classical temporal logic (QCTL) for supporting the verification of temporal properties of such systems even where the consistent model is not available. Our models are paraKripke structures (extended standard Kripke structures), in which both a formula and its negation are satisfied in a same state, and properties to be verified are expressed by QCTL with paraKripke structures semantics. We introduce a novel notion of paraKripke models, which grasps the paraconsistent character of the entailment relation of QCTL. Furthermore, we explore the methodology of model checking over QCTL, and describe the detailed algorithm of implementing QCTL model checker. In the sequel, a simple example is presented, showing how to exploit the proposed model checking technique to verify the temporal properties of inconsistent concurrent systems.展开更多
In the Internet environment, documents are easily leaked, and divulged files spread rapidly. Therefore, it is important for privacy institutions to actively check the documents on the Internet to find out whether some...In the Internet environment, documents are easily leaked, and divulged files spread rapidly. Therefore, it is important for privacy institutions to actively check the documents on the Internet to find out whether some private files have been leaked. In this paper, we put forward a scheme for active image betrayal checking on the Intemet based on the digital fingerprint, which embeds fingerprints into privacy documents, extracts codes from the Intemet images, and then fmds out the divulged files by matching two groups of codes. Due to so many documents on the Internet, the number of times of code comparison is huge, which leads to a large running time. To overcome the deficiency in practical application, we optimized the process by accurate matching methods and approximate matching method. Then a method was proposed to group objects by locality sensitive hashing (LSH) process before code comparison, in order to eliminate the vast majority of unrelated pairs. Experiments prove that this method could operate with less running time and less memory.展开更多
In this paper the application of spatialization technology on metadata quality check and updating was dis-cussed. A new method based on spatialization was proposed for checking and updating metadata to overcome the de...In this paper the application of spatialization technology on metadata quality check and updating was dis-cussed. A new method based on spatialization was proposed for checking and updating metadata to overcome the defi-ciency of text based methods with the powerful functions of spatial query and analysis provided by GIS software. Thismethod employs the technology of spatialization to transform metadata into a coordinate space and the functions ofspatial analysis in GIS to check and update spatial metadata in a visual environment. The basic principle and technicalflow of this method were explained in detail, and an example of implementation using ArcMap of GIS software wasillustrated with a metadata set of digital raster maps. The result shows the new method with the support of interactionof graph and text is much more intuitive and convenient than the ordinary text based method, and can fully utilize thefunctions of GIS spatial query and analysis with more accuracy and efficiency.展开更多
This study focuses on automatic searching and verifying methods for the teachability, transition logics and hierarchical structure in all possible paths of biological processes using model checking. The automatic sear...This study focuses on automatic searching and verifying methods for the teachability, transition logics and hierarchical structure in all possible paths of biological processes using model checking. The automatic search and verification for alternative paths within complex and large networks in biological process can provide a considerable amount of solutions, which is difficult to handle manually. Model checking is an automatic method for verifying if a circuit or a condition, expressed as a concurrent transition system, satisfies a set of properties expressed in a temporal logic, such as computational tree logic (CTL). This article represents that model checking is feasible in biochemical network verification and it shows certain advantages over simulation for querying and searching of special behavioral properties in biochemical processes.展开更多
Web-services are highly distributed programs, and concurrent software is notoriously error-prone. Model checking is a powerful technique to find bugs in concurrent systems. However, the existing model checkers have no...Web-services are highly distributed programs, and concurrent software is notoriously error-prone. Model checking is a powerful technique to find bugs in concurrent systems. However, the existing model checkers have no enough ability to support for the programming languages and communication mechanisms used for Web services. We propose to use Kripke structures as means of modeling Web service. This paper presents an automated way to extract formal models from programs implementing Web services using predicate abstraction for abstract model checking. The abstract models are checked by means of a model checker that implements automatic abstraction refinement. These results enable the verification of the applications that implement Web services.展开更多
Abstract Single event upset (SEU) effect, caused by highly energized particles in aerospace, threatens the reliability and security of small satellites composed of commercialofftheshelves (COTS). SEU induced contr...Abstract Single event upset (SEU) effect, caused by highly energized particles in aerospace, threatens the reliability and security of small satellites composed of commercialofftheshelves (COTS). SEU induced control flow errors (CFEs) may cause unpredictable behavior or crashes of COTSbased small satellites. This paper proposes a generic softwarebased control flow checking technique (CFC) and bipartite graphbased control flow checking (BGCFC). To simplify the types of illegal branches, it transforms the conventional control flow graph into the equivalent bipartite graph. It checks the legal ity of control flow at runtime by comparing a global signature with the expected value and introduces consecutive IDs and bitmaps to reduce the time and memory overhead. Theoretical analysis shows that BGCFC can detect all types of internode CFEs with constant time and memory overhead. Practical tests verify the result of theoretical analysis. Compared with previous techniques, BGCFC achieves the highest error detection rate, lower time and memory overhead; the composite result in evaluation fac tor shows that BGCFC is the most effective one among all these techniques. The results in both theory and practice verify the applicability of BGCFC for COTSbased small satellites.展开更多
In many hospitals,prescription checks are conducted by 2 or 3 individual pharmacists at each step of prescription checking,dispensing,and final checking to maintain the safety and efficacy of pharmaceutical therapies ...In many hospitals,prescription checks are conducted by 2 or 3 individual pharmacists at each step of prescription checking,dispensing,and final checking to maintain the safety and efficacy of pharmaceutical therapies in Japan[1,2].In Gunma University Hospital,we also check all prescriptions by 3 pharmacists at each step of dispensing(3 step prescription check system)with the exception of night time.In this study,to assess the significance of our 3 step prescription check system for managing safety of pharmaceutical therapies,we investigated prescriptions that needed the confirmation of questionable points and prescription corrections.展开更多
This paper proposes a generic high-performance and low-time-overhead software control flow checking solution, graph-tree-based control flow checking (GTCFC) for space-borne commercial-off-the-shelf (COTS) processo...This paper proposes a generic high-performance and low-time-overhead software control flow checking solution, graph-tree-based control flow checking (GTCFC) for space-borne commercial-off-the-shelf (COTS) processors. A graph tree data structure with a topology similar to common trees is introduced to transform the control flow graphs of target programs. This together with design of IDs and signatures of its vertices and edges allows for an easy check of legality of actual branching during target program execution. As a result, the algorithm not only is capable of detecting all single and multiple branching errors with low latency and time overheads along with a linear-complexity space overhead, but also remains generic among arbitrary instruction sets and independent of any specific hardware. Tests of the algorithm using a COTS-processor-based onboard computer (OBC) of in-service ZDPS-1A pico-satellite products show that GTCFC can detect over 90% of the randomly injected and all-pattern-covering branching errors for different types of target programs, with performance and overheads consistent with the theoretical analysis; and beats well-established preeminent control flow checking algorithms in these dimensions. Furthermore, it is validated that GTCGC not only can be accommodated in pico-satellites conveniently with still sufficient system margins left, but also has the ability to minimize the risk of control flow errors being undetected in their space missions. Therefore, due to its effectiveness, efficiency, and compatibility, the GTCFC solution is ready for applications on COTS processors on pico-satellites in their real space missions.展开更多
摘要In light of the service interruption risks that the automatic ticket checking system may encounter following the full implementation of e-tickets,we conducted a level-by-level analysis of significant abnormal events that could occur throughout the e-ticket checking service process.Based on this analysis,we developed emergency response plans for various scenarios:To address the risk of passenger service record(PSR)cluster failures at the CHINA RAILWAY level,e-ticket data is remotely backed up to systems at the CR regional group level①.This serves as a data source for ticket verification during abnormal events.In the event of abnormal occurrences in the ticket checking system data at the CR regional group level,the ticket checking operation process is adjusted,and service is handled outside of the database.Additionally,column-type ticket checking machines are utilized to change the start and stop times of gate-type ticket checking machines,allowing for dynamic adjustment of the ticket checking plan by the ticket checking management system when the database is unavailable.To respond to abnormalities of the ticket checking system at the railway station level,handheld ticket checking machines can be employed as an emergency ticket verification method.Alternatively,leveraging the railway integrity system,a procedure is in place where ID cards are scanned first,followed by ticket checking,ensuring the smooth boarding and alighting of passengers at the station.Recent emergency drills and real-world emergency response applications during ticket checking operations have demonstrated the feasibility of these emergency plans at various levels of the ticket checking system.These measures can effectively meet the emergency response requirements of the automatic ticket checking system under full e-ticket conditions.
基金National Natural Science Foundation ofChina(No.70 2 710 3 8)
摘要Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term definition set, instantiation assertion set and term restriction set. Based on the extended model, the issue on ontology checking was studied with the conclusion that the four kinds of term checking, including term satisfiability checking, term subsumption checking, term equivalence checking and term disjointness checking, can be reduced to the satisfiability checking, and satisfiability checking can be transformed into instantiation consistence checking.
基金supported by the National Natural Science Foundation of China(Nos.61502498,U1433120 and 61806208)the Fundamental Research Funds for the Central Universities,China(No.3122017001)
摘要Federal Aviation Administration(FAA) and NASA technical reports indicate that the misunderstanding in radiotelephony communications is a primary causal factor associated with operation errors, and a sizable proportion of operation errors lead to read-back errors. We introduce deep learning method to solve this problem and propose a new semantic checking model based on Long Short-Time Memory network(LSTM) for intelligent read-back error checking. A meanpooling layer is added to the traditional LSTM, so as to utilize the information obtained by all the hidden activation vectors, and also to improve the robustness of the semantic vector extracted by LSTM. A MultiLayer Perceptron(MLP) layer, which can maintain the information of different regions in the concatenated vectors obtained by the mean-pooling layer, is applied instead of traditional similarity function in the new model to express the semantic similarity of the read-back pairs quantitatively. The K-Nearest Neighbor(KNN) classifier is used to verify whether the read-back pairs are consistent in semantics according to the output of MLP layer. Extensive experiments are conducted and the results show that the proposed model is more effective and more robust than the traditional checking model to verify the semantic consistency of read-backs automatically.
基金supported by National Natural Science Foundation of China under Grant No. 61003079
摘要Model checking based on linear temporal logic reduces the false negative rate of misuse detection.However,linear temporal logic formulae cannot be used to describe concurrent attacks and piecewise attacks.So there is still a high rate of false negatives in detecting these complex attack patterns.To solve this problem,we use interval temporal logic formulae to describe concurrent attacks and piecewise attacks.On this basis,we formalize a novel algorithm for intrusion detection based on model checking interval temporal logic.Compared with the method based on model checking linear temporal logic,the new algorithm can find unknown succinct attacks.The simulation results show that the new method can effectively reduce the false negative rate of concurrent attacks and piecewise attacks.
基金National Natural Science Foundation of China(12002183)Postdoctoral Science Foundation(2019TQ0171,2020M670304)Beijing Natural Science Foundation(Grant Nos.16L00001 and 2182065)are Rratefullv acknowledged.
摘要The current collector fracture failure of lithium-ion batteries(LIBs)occurs during its winding production process frequently,and the consequent damages are usually large,but little research has been conducted on this phenomenon.This work stems from the difficulty and obstacles in the winding process of actual production of LIBs.The fracture failure of the current collectors is easily caused by the evolution and mutation of the mechanical behavior during the winding process,resulting in safety hazards and poor efficiency.The purpose of this work is to reveal the evolution and distribution mechanism of circumferential strain of the current collectors on the fracture failure under the constraint of winding process.Experimental tests,finite element calculations and theoretical model are used to study the evolution and distribution of circumferential strain.The dynamic evolution process of circumferential strain is tested accurately,and the mechanism of fracture failure of current collectors is revealed.The criterion for current collector strength is proposed based on the results of strain analysis and SEM observation.
基金supported by the Fund of ExcellentYouth Scientific and Technological Innovation Team of Hubei’s Universities(Project No:T201818)Science and Technology Research Program of Hubei Provincial Education Department(Project No:Q20143005)Guiding project of scientific research plan of Hubei Provincial Department of Education(Project No:B2021261).
摘要Product detection based on state abstraction technologies in the software product line(SPL)is more complex when compared to a single system.This variability constitutes a new complexity,and the counterexample may be valid for some products but spurious for others.In this paper,we found that spurious products are primarily due to the failure states,which correspond to the spurious counterexamples.The violated products correspond to the real counterexamples.Hence,identifying counterexamples is a critical problem in detecting violated products.In our approach,we obtain the violated products through the genuine counterexamples,which have no failure state,to avoid the tedious computation of identifying spurious products dealt with by the existing algorithm.This can be executed in parallel to improve the efficiency further.Experimental results showthat our approach performswell,varying with the growth of the system scale.By analyzing counterexamples in the abstract model,we observed that spurious products occur in the failure state.The approach helps in identifying whether a counterexample is spurious or genuine.The approach also helps to check whether a failure state exists in the counterexample.The performance evaluation shows that the proposed approach helps significantly in improving the efficiency of abstraction-based SPL model checking.
基金Supported by the National Natural Science Foun-dation of China (60573046)
摘要The soundness is a very important criterion for the correctness of the workflow. Specifying the soundness with Computation Tree Logic (CTL) allows us to verify the soundness with symbolic model checkers. Therefore the state explosion problem in verifying soundness can be overcome efficiently. When the property is not satisfied by the system, model checking can give a counter-example, which can guide us to correct the workflow. In addition, relaxed soundness is another important criterion for the workflow. We also prove that Computation Tree Logic * (CTL * ) can be used to character the relaxed soundness of the workflow.
基金The National Natural Science Foundation of China (No.10974093)the Scientific Research Foundation for Senior Personnel of Jiangsu University (No.07JDG014)the Natural Science Foundation of Higher Education Institutions of Jiangsu Province (No.08KJD520015)
摘要In order to find the completeness threshold which offers a practical method of making bounded model checking complete, the over-approximation for the complete threshold is presented. First, a linear logic of knowledge is introduced into the past tense operator, and then a new temporal epistemic logic LTLKP is obtained, so that LTLKP can naturally and precisely describe the system's reliability. Secondly, a set of prior algorithms are designed to calculate the maximal reachable depth and the length of the longest of loop free paths in the structure based on the graph structure theory. Finally, some theorems are proposed to show how to approximate the complete threshold with the diameter and recurrence diameter. The proposed work resolves the completeness threshold problem so that the completeness of bounded model checking can be guaranteed.
基金Projects 50674086 supported by the National Natural Science Foundation of ChinaBS2006002 by the Society Development Science and Technology Planof Jiangsu Province20060290508 by the Doctoral Foundation of Ministry of Education of China
摘要A novel design and implementation of an attendance checking node for coal mines based on the CAN bus is presented in this paper. Hardware circuits and programming methods for the attendance checking node are discussed,including the single-chip computer with CAN controller AT89C51CC03,the CAN bus transceiver TJA1050,the large capacity DataFlash memory,the real-time clock DS1302,the voice chip ISD2560 and the card-reading circuit in Wie-gand format. All the extended hardware satisfies the requirements for intrinsically safe circuits (GB3836.4-2000) and intrinsically safe authentication promoted by the national explosion-proof institute. Further,the software programming methods for the CAN controller (AT89C51CC03) and the implementation of the CAN communications protocol are presented as well.
基金Supported by the National Natural Science Foundation of China (60673115)the National Basic Research Program of China (973 Program) (2002CB312001)the Open Foundation of State Key Laboratory of Soft-ware Engineering (SKLSE05-13)
摘要A formal model representing the navigation behavior of a Web application as the Kripke structure is proposed and an approach that applies model checking to test case generation is presented. The Object Relation Diagram as the object model is employed to describe the object structure of a Web application design and can be translated into the behavior model. A key problem of model checking-based test generation for a Web application is how to construct a set of trap properties that intend to cause the violations of model checking against the behavior model and output of counterexamples used to construct the test sequences. We give an algorithm that derives trap properties from the object model with respect to node and edge coverage criteria.
基金the Ph.D.Program Research Foundation from MOE of China(20060147004)Research Foundation from Liaoning Technical University(04A02001)
摘要The checking survey in Open mine is one of the most frequent and important work.It plays the role of forming a connecting link between open mine planning and pro- duction.Traditional checking method has such disadvantages as long time consumption, heavy workload,complicated calculating process,and lower automation.Used GPS and GIS technologies to systematically study the core issues of checking survey in open mine. A detail GPS data acquisition coding scheme was presented.Based on the scheme an algorithm used for computer semiautomatic cartography was made.Three methods used for eliminating gross errors from raw data which were needed for creating DEM was dis- cussed.Two algorithms were researched and realized which can be used to create open mine fine DEM model with constrained conditions and to dynamically update the model. The precision analysis and evaluation of the created model were carried out.
基金Supported by the National Natural Science Foundation of China (No.60603036)the Jiangsu Province Research Foundation (No.BK2007139)
摘要Classical logic cannot be used to effectively reason about concurrent systems with inconsistencies (inconsistencies often occur, especially in the early stage of the development, when large and complex concurrent systems are developed). In this paper, we propose the use of a guasi-classical temporal logic (QCTL) for supporting the verification of temporal properties of such systems even where the consistent model is not available. Our models are paraKripke structures (extended standard Kripke structures), in which both a formula and its negation are satisfied in a same state, and properties to be verified are expressed by QCTL with paraKripke structures semantics. We introduce a novel notion of paraKripke models, which grasps the paraconsistent character of the entailment relation of QCTL. Furthermore, we explore the methodology of model checking over QCTL, and describe the detailed algorithm of implementing QCTL model checker. In the sequel, a simple example is presented, showing how to exploit the proposed model checking technique to verify the temporal properties of inconsistent concurrent systems.
基金National High-Tech Research and Development Program of China(863 Program)(No.2007AA01Z309)
摘要In the Internet environment, documents are easily leaked, and divulged files spread rapidly. Therefore, it is important for privacy institutions to actively check the documents on the Internet to find out whether some private files have been leaked. In this paper, we put forward a scheme for active image betrayal checking on the Intemet based on the digital fingerprint, which embeds fingerprints into privacy documents, extracts codes from the Intemet images, and then fmds out the divulged files by matching two groups of codes. Due to so many documents on the Internet, the number of times of code comparison is huge, which leads to a large running time. To overcome the deficiency in practical application, we optimized the process by accurate matching methods and approximate matching method. Then a method was proposed to group objects by locality sensitive hashing (LSH) process before code comparison, in order to eliminate the vast majority of unrelated pairs. Experiments prove that this method could operate with less running time and less memory.
基金Project 40301042 supported by Natural Science Foundation of China
摘要In this paper the application of spatialization technology on metadata quality check and updating was dis-cussed. A new method based on spatialization was proposed for checking and updating metadata to overcome the defi-ciency of text based methods with the powerful functions of spatial query and analysis provided by GIS software. Thismethod employs the technology of spatialization to transform metadata into a coordinate space and the functions ofspatial analysis in GIS to check and update spatial metadata in a visual environment. The basic principle and technicalflow of this method were explained in detail, and an example of implementation using ArcMap of GIS software wasillustrated with a metadata set of digital raster maps. The result shows the new method with the support of interactionof graph and text is much more intuitive and convenient than the ordinary text based method, and can fully utilize thefunctions of GIS spatial query and analysis with more accuracy and efficiency.
摘要This study focuses on automatic searching and verifying methods for the teachability, transition logics and hierarchical structure in all possible paths of biological processes using model checking. The automatic search and verification for alternative paths within complex and large networks in biological process can provide a considerable amount of solutions, which is difficult to handle manually. Model checking is an automatic method for verifying if a circuit or a condition, expressed as a concurrent transition system, satisfies a set of properties expressed in a temporal logic, such as computational tree logic (CTL). This article represents that model checking is feasible in biochemical network verification and it shows certain advantages over simulation for querying and searching of special behavioral properties in biochemical processes.
基金the National Natural Science Foundation of China (60663005, 60563005)the Natural Science Foundation of Guangxi Province (0542036, 0728093, 0728089)
摘要Web-services are highly distributed programs, and concurrent software is notoriously error-prone. Model checking is a powerful technique to find bugs in concurrent systems. However, the existing model checkers have no enough ability to support for the programming languages and communication mechanisms used for Web services. We propose to use Kripke structures as means of modeling Web service. This paper presents an automated way to extract formal models from programs implementing Web services using predicate abstraction for abstract model checking. The abstract models are checked by means of a model checker that implements automatic abstraction refinement. These results enable the verification of the applications that implement Web services.
基金support from the National Natural Science Foundation of Chinathe Fundamental Research Funds for the Central Universities of China
摘要Abstract Single event upset (SEU) effect, caused by highly energized particles in aerospace, threatens the reliability and security of small satellites composed of commercialofftheshelves (COTS). SEU induced control flow errors (CFEs) may cause unpredictable behavior or crashes of COTSbased small satellites. This paper proposes a generic softwarebased control flow checking technique (CFC) and bipartite graphbased control flow checking (BGCFC). To simplify the types of illegal branches, it transforms the conventional control flow graph into the equivalent bipartite graph. It checks the legal ity of control flow at runtime by comparing a global signature with the expected value and introduces consecutive IDs and bitmaps to reduce the time and memory overhead. Theoretical analysis shows that BGCFC can detect all types of internode CFEs with constant time and memory overhead. Practical tests verify the result of theoretical analysis. Compared with previous techniques, BGCFC achieves the highest error detection rate, lower time and memory overhead; the composite result in evaluation fac tor shows that BGCFC is the most effective one among all these techniques. The results in both theory and practice verify the applicability of BGCFC for COTSbased small satellites.
摘要In many hospitals,prescription checks are conducted by 2 or 3 individual pharmacists at each step of prescription checking,dispensing,and final checking to maintain the safety and efficacy of pharmaceutical therapies in Japan[1,2].In Gunma University Hospital,we also check all prescriptions by 3 pharmacists at each step of dispensing(3 step prescription check system)with the exception of night time.In this study,to assess the significance of our 3 step prescription check system for managing safety of pharmaceutical therapies,we investigated prescriptions that needed the confirmation of questionable points and prescription corrections.
基金supported by National Natural Science Foundation of China (No. 60904090)
摘要This paper proposes a generic high-performance and low-time-overhead software control flow checking solution, graph-tree-based control flow checking (GTCFC) for space-borne commercial-off-the-shelf (COTS) processors. A graph tree data structure with a topology similar to common trees is introduced to transform the control flow graphs of target programs. This together with design of IDs and signatures of its vertices and edges allows for an easy check of legality of actual branching during target program execution. As a result, the algorithm not only is capable of detecting all single and multiple branching errors with low latency and time overheads along with a linear-complexity space overhead, but also remains generic among arbitrary instruction sets and independent of any specific hardware. Tests of the algorithm using a COTS-processor-based onboard computer (OBC) of in-service ZDPS-1A pico-satellite products show that GTCFC can detect over 90% of the randomly injected and all-pattern-covering branching errors for different types of target programs, with performance and overheads consistent with the theoretical analysis; and beats well-established preeminent control flow checking algorithms in these dimensions. Furthermore, it is validated that GTCGC not only can be accommodated in pico-satellites conveniently with still sufficient system margins left, but also has the ability to minimize the risk of control flow errors being undetected in their space missions. Therefore, due to its effectiveness, efficiency, and compatibility, the GTCFC solution is ready for applications on COTS processors on pico-satellites in their real space missions.