Semantic Consistency and Correctness Verification of Digital Traffic Rules

The consensus of the automotive industry and traffic management authorities is that autonomous vehicles must follow the same traffic laws as human drivers.Using formal or digital methods,natural language traffic rules can be translated into machine language and used by autonomous vehicles.In this paper,a translation flow is designed.Beyond the translation,a deeper examination is required,because the semantics of natural languages are rich and complex,and frequently contain hidden assumptions.The issue of how to ensure that digital rules are accurate and consistent with the original intent of the traffic rules they represent is both significant and unresolved.In response,we propose a method of formal verification that combines equivalence verification with model checking.Reasonable and reassuring digital traffic rules can be obtained by utilizing the proposed traffic rule digitization flow and verification method.In addition,we offer a number of simulation applications that employ digital traffic rules to assess vehicle violations.The experimental findings indicate that our digital rules utilizing metric temporal logic(MTL)can be easily incorporated into simulation platforms and autonomous driving systems(ADS).

The First Verification Test of Space-Ground Collaborative Intelligence via Cloud-Native Satellites

Recent advancements in satellite technologies and the declining cost of access to space have led to the emergence of large satellite constellations in Low Earth Orbit(LEO).However,these constellations often rely on bent-pipe architecture,resulting in high communication costs.Existing onboard inference architectures suffer from limitations in terms of low accuracy and inflexibility in the deployment and management of in-orbit applications.To address these challenges,we propose a cloud-native-based satellite design specifically tailored for Earth Observation tasks,enabling diverse computing paradigms.In this work,we present a case study of a satellite-ground collaborative inference system deployed in the Tiansuan constellation,demonstrating a remarkable 50%accuracy improvement and a substantial 90%data reduction.Our work sheds light on in-orbit energy,where in-orbit computing accounts for 17%of the total onboard energy consumption.Our approach represents a significant advancement of cloud-native satellite,aiming to enhance the accuracy of in-orbit computing while simultaneously reducing communication cost.

Dynamic Signature Verification Using Pattern Recognition

Dynamic signature is a biometric modality that recognizes an individual’s anatomic and behavioural characteristics when signing their name. The rampant case of signature falsification (Identity Theft) was the key motivating factor for embarking on this study. This study was necessitated by the damages and dangers posed by signature forgery coupled with the intractable nature of the problem. The aim and objectives of this study is to design a proactive and responsive system that could compare two signature samples and detect the correct signature against the forged one. Dynamic Signature verification is an important biometric technique that aims to detect whether a given signature is genuine or forged. In this research work, Convolutional Neural Networks (CNNsor ConvNet) which is a class of deep, feed forward artificial neural networks that has successfully been applied to analysing visual imagery was used to train the model. The signature images are stored in a file directory structure which the Keras Python library can work with. Then the CNN was implemented in python using the Keras with the TensorFlow backend to learn the patterns associated with the signature. The result showed that for the same CNNs-based network experimental result of average accuracy, the larger the training dataset, the higher the test accuracy. However, when the training dataset are insufficient, better results can be obtained. The paper concluded that by training datasets using CNNs network, 98% accuracy in the result was recorded, in the experimental part, the model achieved a high degree of accuracy in the classification of the biometric parameters used.

A Novel High-Efficiency Transaction Verification Scheme for Blockchain Systems

Blockchain can realize the reliable storage of a large amount of data that is chronologically related and verifiable within the system.This technology has been widely used and has developed rapidly in big data systems across various fields.An increasing number of users are participating in application systems that use blockchain as their underlying architecture.As the number of transactions and the capital involved in blockchain grow,ensuring information security becomes imperative.Addressing the verification of transactional information security and privacy has emerged as a critical challenge.Blockchain-based verification methods can effectively eliminate the need for centralized third-party organizations.However,the efficiency of nodes in storing and verifying blockchain data faces unprecedented challenges.To address this issue,this paper introduces an efficient verification scheme for transaction security.Initially,it presents a node evaluation module to estimate the activity level of user nodes participating in transactions,accompanied by a probabilistic analysis for all transactions.Subsequently,this paper optimizes the conventional transaction organization form,introduces a heterogeneous Merkle tree storage structure,and designs algorithms for constructing these heterogeneous trees.Theoretical analyses and simulation experiments conclusively demonstrate the superior performance of this scheme.When verifying the same number of transactions,the heterogeneous Merkle tree transmits less data and is more efficient than traditional methods.The findings indicate that the heterogeneous Merkle tree structure is suitable for various blockchain applications,including the Internet of Things.This scheme can markedly enhance the efficiency of information verification and bolster the security of distributed systems.

Ghost Module Based Residual Mixture of Self-Attention and Convolution for Online Signature Verification

Online Signature Verification (OSV), as a personal identification technology, is widely used in various industries.However, it faces challenges, such as incomplete feature extraction, low accuracy, and computational heaviness. Toaddress these issues, we propose a novel approach for online signature verification, using a one-dimensionalGhost-ACmix Residual Network (1D-ACGRNet), which is a Ghost-ACmix Residual Network that combines convolutionwith a self-attention mechanism and performs improvement by using Ghost method. The Ghost-ACmix Residualstructure is introduced to leverage both self-attention and convolution mechanisms for capturing global featureinformation and extracting local information, effectively complementing whole and local signature features andmitigating the problem of insufficient feature extraction. Then, the Ghost-based Convolution and Self-Attention(ACG) block is proposed to simplify the common parts between convolution and self-attention using the Ghostmodule and employ feature transformation to obtain intermediate features, thus reducing computational costs.Additionally, feature selection is performed using the random forestmethod, and the data is dimensionally reducedusing Principal Component Analysis (PCA). Finally, tests are implemented on the MCYT-100 datasets and theSVC-2004 Task2 datasets, and the equal error rates (EERs) for small-sample training using five genuine andforged signatures are 3.07% and 4.17%, respectively. The EERs for training with ten genuine and forged signaturesare 0.91% and 2.12% on the respective datasets. The experimental results illustrate that the proposed approacheffectively enhances the accuracy of online signature verification.

Efficacy of Juanbi capsule on ameliorating knee osteoarthritis:a network pharmacology and experimental verification-based study

Background:The purpose of the study was to investigate the active ingredients and potential biochemical mechanisms of Juanbi capsule in knee osteoarthritis based on network pharmacology,molecular docking and animal experiments.Methods:Chemical components for each drug in the Juanbi capsule were obtained from Traditional Chinese Medicine Systems Pharmacology Database and Analysis Platform,while the target proteins for knee osteoarthritis were retrieved from the Drugbank,GeneCards,and OMIM databases.The study compared information on knee osteoarthritis and the targets of drugs to identify common elements.The data was imported into the STRING platform to generate a protein-protein interaction network diagram.Subsequently,a“component-target”network diagram was created using the screened drug components and target information with Cytoscape software.Common targets were imported into Metascape for GO function and KEGG pathway enrichment analysis.AutoDockTools was utilized to predict the molecular docking of the primary chemical components and core targets.Ultimately,the key targets were validated through animal experiments.Results:Juanbi capsule ameliorated Knee osteoarthritis mainly by affecting tumor necrosis factor,interleukin1β,MMP9,PTGS2,VEGFA,TP53,and other cytokines through quercetin,kaempferol,andβ-sitosterol.The drug also influenced the AGE-RAGE,interleukin-17,tumor necrosis factor,Relaxin,and NF-κB signaling pathways.The network pharmacology analysis results were further validated in animal experiments.The results indicated that Juanbi capsule could decrease the levels of tumor necrosis factor-αand interleukin-1βin the serum and synovial fluid of knee osteoarthritis rats and also down-regulate the expression levels of MMP9 and PTGS2 proteins in the articular cartilage.Conclusion:Juanbi capsule may improve the knee bone microstructure and reduce the expression of inflammatory factors of knee osteoarthritis via multiple targets and multiple signaling pathways.

Verification and Application Evaluation of Intelligent Audit Rules for The UN9000 Urine Analysis System

Objective:To apply and verify the application of intelligent audit rules for urine analysis by Cui et al.Method:A total of 1139 urine samples of hospitalized patients in Tai’an Central Hospital from September 2021 to November 2021 were randomly selected,and all samples were manually microscopic examined after the detection of the UN9000 urine analysis line.The intelligent audit rules(including the microscopic review rules and manual verification rules)were validated based on the manual microscopic examination and manual audit,and the rules were adjusted to apply to our laboratory.The laboratory turnaround time(TAT)before and after the application of intelligent audit rules was compared.Result:The microscopic review rate of intelligent rules was 25.63%(292/1139),the true positive rate,false positive rate,true negative rate,and false negative rate were 27.66%(315/1139),6.49%(74/1139),62.34%(710/1139)and 3.51%(40/1139),respectively.The approval consistency rate of manual verification rules was 84.92%(727/856),the approval inconsistency rate was 0%(0/856),the interception consistency rate was 12.61%(108/856),and the interception inconsistency rate was 0%(0/856).Conclusion:The intelligence audit rules for urine analysis by Cui et al.have good clinical applicability in our laboratory.

Formal Verification Platform as a Service:WebAssembly Vulnerability Detection Application

In order to realize a general-purpose automatic formal verification platform based on WebAssembly technology as a web service(FVPS),which aims to provide an automated report of vulnerability detections,this work builds a Hyperledger Fabric blockchain runtime model.It proposes an optimized methodology of the functional equivalent translation from source program languages to formal languages.This methodology utilizes an external application programming interface(API)table to replace the source codes in compilation,thereby pruning the part of housekeeping codes to ease code inflation.Code inflation is a significant metric in formal language translation.Namely,minor code inflation enhances verification scale and performance efficiency.It determines the efficiency of formal verification,involving launching,running,and memory usage.For instance,path explosion increases exponentially,resulting in out-of-memory.The experimental results conclude that program languages like golang severely impact code inflation.FVPS reduces the wasm code size by over 90%,achieving two orders of optimization magnitude,from 2000 kilobyte(KB)to 90 KB.That means we can cope with golang applications up to 20 times larger than the original in scale.This work eliminates the gap between Hyperledger Fabric smart contracts and WebAssembly.Our approach is pragmatic,adaptable,extendable,and flexible.Nowadays,FVPS is successfully applied in a Railway-Port-Aviation blockchain transportation system.

A measurable refinement method of design and verification for micro-kernel operating systems in communication network

A secure operating system in the communication network can provide the stable working environment,which ensures that the user information is not stolen.The micro-kernel operating system in the communication network retains the core functions in the kernel,and unnecessary tasks are implemented by calling external processes.Due to the small amount of code,the micro-kernel architecture has high reliability and scalability.Taking the microkernel operating system in the communication network prototype VSOS as an example,we employ the objdump tool to disassemble the system source code and get the assembly layer code.On this basis,we apply the Isabelle/HOL,a formal verification tool,to model the system prototype.By referring to the mathematical model of finite automata and taking the process scheduling module as an example,the security verification based on the assembly language layer is developed.Based on the Hoare logic theory,each assembly statement of the module is verified in turn.The verification results show that the scheduling module of VSOS has good functional security,and also show the feasibility of the refinement framework.

Numerical simulation and experimental verification of plasma jet development in gas gap switch

Plasma jet triggered gas gap switch has obvious advantages in fast control switch.The development of the plasma in the ambient medium is the key factor affecting the triggering conduction of the gas switch.However,the plasma jet process and its characteristic parameters are complicated and the existing test methods cannot fully characterize its development laws.In this work,a two-dimensional transient fluid calculation model of the plasma jet process of the gas gap switch is established based on the renormalization-group k-εturbulence equation.The results show that the characteristic parameters and morphological evolution of the plasma jet are basically consistent with the experimental results,which verifies the accuracy of the simulation model calculation.The plasma jet is a long strip with an initial velocity of 1.0 km·s-1and develops in both axial and radial directions.The jet velocity fluctuates significantly with axial height.As the plasma jet enters the main gap,the pressure inside the trigger cavity drops by80%,resulting in a rapid drop in the jet velocity.When the plasma jet head interacts with the atmosphere,the two-phase fluid compresses each other,generating a forward-propelled pressure wave.The plasma jet heads flow at high velocity,a negative pressure zone is formed in the middle part of the jet,and the pressure peak decreases gradually with height.As the value of the inlet pressure increases,the characteristic parameters of the plasma jet increase.The entrainment phenomenon is evident,which leads to an increase in the pressure imbalance of the atmospheric gas medium,leading to a significant Coanda effect.Compared with air,the characteristic parameters of a plasma jet in SF6are lower,and the morphological evolution is significantly suppressed.The results of this study can provide some insight into the mechanism of action of the switch jet plasma development process.

Hyper-Tuned Convolutional Neural Networks for Authorship Verification in Digital Forensic Investigations

Authorship verification is a crucial task in digital forensic investigations,where it is often necessary to determine whether a specific individual wrote a particular piece of text.Convolutional Neural Networks(CNNs)have shown promise in solving this problem,but their performance highly depends on the choice of hyperparameters.In this paper,we explore the effectiveness of hyperparameter tuning in improving the performance of CNNs for authorship verification.We conduct experiments using a Hyper Tuned CNN model with three popular optimization algorithms:Adaptive Moment Estimation(ADAM),StochasticGradientDescent(SGD),andRoot Mean Squared Propagation(RMSPROP).The model is trained and tested on a dataset of text samples collected from various authors,and the performance is evaluated using accuracy,precision,recall,and F1 score.We compare the performance of the three optimization algorithms and demonstrate the effectiveness of hyperparameter tuning in improving the accuracy of the CNN model.Our results show that the Hyper Tuned CNN model with ADAM Optimizer achieves the highest accuracy of up to 90%.Furthermore,we demonstrate that hyperparameter tuning can help achieve significant performance improvements,even using a relatively simple model architecture like CNNs.Our findings suggest that the choice of the optimization algorithm is a crucial factor in the performance of CNNs for authorship verification and that hyperparameter tuning can be an effective way to optimize this choice.Overall,this paper demonstrates the effectiveness of hyperparameter tuning in improving the performance of CNNs for authorship verification in digital forensic investigations.Our findings have important implications for developing accurate and reliable authorship verification systems,which are crucial for various applications in digital forensics,such as identifying the author of anonymous threatening messages or detecting cases of plagiarism.

OffSig-SinGAN: A Deep Learning-Based Image Augmentation Model for Offline Signature Verification

Offline signature verification(OfSV)is essential in preventing the falsification of documents.Deep learning(DL)based OfSVs require a high number of signature images to attain acceptable performance.However,a limited number of signature samples are available to train these models in a real-world scenario.Several researchers have proposed models to augment new signature images by applying various transformations.Others,on the other hand,have used human neuromotor and cognitive-inspired augmentation models to address the demand for more signature samples.Hence,augmenting a sufficient number of signatures with variations is still a challenging task.This study proposed OffSig-SinGAN:a deep learning-based image augmentation model to address the limited number of signatures problem on offline signature verification.The proposed model is capable of augmenting better quality signatures with diversity from a single signature image only.It is empirically evaluated on widely used public datasets;GPDSsyntheticSignature.The quality of augmented signature images is assessed using four metrics like pixel-by-pixel difference,peak signal-to-noise ratio(PSNR),structural similarity index measure(SSIM),and frechet inception distance(FID).Furthermore,various experiments were organised to evaluate the proposed image augmentation model’s performance on selected DL-based OfSV systems and to prove whether it helped to improve the verification accuracy rate.Experiment results showed that the proposed augmentation model performed better on the GPDSsyntheticSignature dataset than other augmentation methods.The improved verification accuracy rate of the selected DL-based OfSV system proved the effectiveness of the proposed augmentation model.

Detailed analysis and simulation verification for reconstruction of plasma optical boundary with spectrometric technique on HL-2M tokamak

The plasma optical boundary reconstruction technique based on Hommen's theory is promising for future tokamaks with high parameters. In this work, we conduct detailed analysis and simulation verification to estimate the ‘logic loophole' of this technique. The finite-width effect and unpredictable errors reduce the technique's reliability, which leads to this loophole. Based on imaging theory, the photos of a virtual camera are simulated by integrating the assumed luminous intensity of plasma. Based on Hommen's theory, the plasma optical boundary is reconstructed from the photos. Comparing the reconstructed boundary with the one assumed, the logic loophole and its two effects are quantitatively estimated. The finite-width effect is related to the equivalent thickness of the luminous layer, which is generally about 2-4 cm but sometimes larger. The level of unpredictable errors is around 0.65 cm. The technique based on Hommen's theory is generally reliable, but finite-width effect and unpredictable errors have to be taken into consideration in some scenarios. The parameters of HL-2M are applied in this work.

Finite Element Simulation of Flexible Roll Forming with Supplemented Material Data and the Experimental Verification

Flexible roll forming is a promising manufacturing method for the production of variable cross section products. Considering the large plastic strain in this forming process which is much larger than that of uniform deformation phase of uniaxial tensile test, the widely adopted method of simulating the forming processes with non-supplemented material data from uniaxial tensile test will certainly lead to large error. To reduce this error, the material data is supplemented based on three constitutive models. Then a finite element model of a six passes flexible roll forming process is established based on the supplemented material data and the original material data from the uniaxial tensile test. The flexible roll forming experiment of a B pillar reinforcing plate is carried out to verify the proposed method. Final cross section shapes of the experimental and the simulated results are compared. It is shown that the simulation calculated with supplemented material data based on Swift model agrees well with the experimental results, while the simulation based on original material data could not predict the actual deformation accurately. The results indicate that this material supplement method is reliable and indispensible, and the simulation model can well reflect the real metal forming process. Detailed analysis of the distribution and history of plastic strain at different positions are performed. A new material data supplement method is proposed to tackle the problem which is ignored in other roll forming simulations, and thus the forming process simulation accuracy can be greatly improved.

Distributed Information Flow Verification for Secure Service Composition in Smart Sensor Network

Accelerate processor, efficient software and pervasive connections provide sensor nodes with more powerful computation and storage ability, which can offer various services to user. Based on these atomic services, different sensor nodes can cooperate and compose with each other to complete more complicated tasks for user. However, because of the regional characteristic of sensor nodes, merging data with different sensitivities become a primary requirement to the composite services, and information flow security should be intensively considered during service composition. In order to mitigate the great cost caused by the complexity of modeling and the heavy load of single-node verification to the energy-limited sensor node, in this paper, we propose a new distributed verification framework to enforce information flow security on composite services of smart sensor network. We analyze the information flows in composite services and specify security constraints for each service participant. Then we propose an algorithm over the distributed verification framework involving each sensor node to participate in the composite service verification based on the security constraints. The experimental results indicate that our approach can reduce the cost of verification and provide a better load balance.

Transient characteristics verification method for DC transformer used in flexible HVDC system

Previous studies have proposed higher requirements for the transient characteristics of a DC transformer used in a flexible high-voltage direct current(HVDC) system to achieve faster sampling speed and meet wider bandwidth requirements of the control and protection signal, and to eventually suppress the large transient fault current. In this study, a transient characteristics verification method is proposed for transient characteristics verification of a DC transformer used in a flexible HVDC system based on resampling technology and LabVIEW measurement technology after analyzing the key technology for transient characteristics verification of a DC transformer. A laboratory experiment for the transient characteristics of a full-fiber electronic DC transformer is conducted, and experimental results show that such verification method can be employed for frequency response and step response verification of a DC transformer at 10% of the rated voltage and current, and can eventually improve the screening of a DC transformer.

Prediction and Verifcation of Forming Limit Diagrams Based on a Modifed Shear Failure Criterion

The forming limit diagram plays an important role in predicting the forming limit of sheet metals.Previous studies have shown that,the method to construct the forming limit diagram based on instability theory of the original shear failure criterion is efective and simple.The original shear instability criterion can accurately predict the left area of the forming limit diagram but not the right area.In this study,in order to improve the accuracy of the original shear failure criterion,a modifed shear failure criterion was proposed based on in-depth analysis of the original shear failure criterion.The detailed improvement strategies of the shear failure criterion and the complete calculation process are given.Based on the modifed shear failure criterion and diferent constitutive equations,the theoretical forming limit of TRIP780 steel and 5754O aluminum alloy sheet metals are calculated.By comparing the theoretical and experimental results,it is shown that proposed modifed shear failure criterion can predict the right area of forming limit more reasonably than the original shear failure criterion.The efect of the pre-strain and constitutive equation on the forming limits are also analyzed in depth.The modifed shear failure criterion proposed in this study provides an alternative and reliable method to predict forming limit of sheet metals.

Formal Verification under Unknown Constraints

We present a formal method of verifying designs with unknown constraints (e.g., black boxes) using Boolean satisfiability (SAT). This method is based on a new encoding scheme of unknown constraints, and solves the corresponding conjunctive normal form (CNF) formulas.Furthermore,this method can avoid the potential memory explosion, which the binary decision diagram (BDD) based techniques maybe suffer from, thus it has the capacity of verifying large designs. Experimental results demonstrate the efficiency and feasibility of the proposed method.

Formal Verification of the Merchant Registration Phase of the SET Protocol

This paper describes the formal verification of the Merchant Registration phase of the Secure Electronic Transactions (SET) protocol, a realistic electronic transaction security protocol which is used to protect the secrecy of online purchases. A number of concepts, notations, functions, predicates, assumptions and rules are introduced. We describe the knowledge of all legal participants, and a malicious spy, to assess the security of the sub-protocol. Avoiding search in a large state space, the method converges very quickly. We implemented our method in the Isabelle/Isar automated reasoning environment, therefore the whole verification process can be executed mechanically and efficiently. Keywords Formal verification - electronic transaction protocol - knowledge-based system This work was supported by EC, EPSRC, the National Natural Science Foundation of China (No.60496320, 60496321), and Hong Kong K C Wang Education Foundation.Xiao-Qi Ma graduated from Nanjing University of Science and Technology, China, in 1997. He received his Master’s degree from the Institute of Software, Chinese Academy of Sciences in 2003. He is currently a PhD student at the University of Reading. His research interests include computer network security, knowledge-based systems, and operating systems.Xiao-Chun Cheng obtained his PhD in 1996. He has worked as a lecturer at the University of Reading since 2000. He is a guest professor at North East Normal University and Beijing Normal University. His research interests include theoretical and applied aspects in decision support systems, knowledge-based systems and intelligent systems.

One-Class Arabic Signature Verification: A Progressive Fusion of Optimal Features

Signature verification is regarded as the most beneficial behavioral characteristic-based biometric feature in security and fraud protection.It is also a popular biometric authentication technology in forensic and commercial transactions due to its various advantages,including noninvasiveness,user-friendliness,and social and legal acceptability.According to the literature,extensive research has been conducted on signature verification systems in a variety of languages,including English,Hindi,Bangla,and Chinese.However,the Arabic Offline Signature Verification(OSV)system is still a challenging issue that has not been investigated as much by researchers due to the Arabic script being distinguished by changing letter shapes,diacritics,ligatures,and overlapping,making verification more difficult.Recently,signature verification systems have shown promising results for recognizing signatures that are genuine or forgeries;however,performance on skilled forgery detection is still unsatisfactory.Most existing methods require many learning samples to improve verification accuracy,which is a major drawback because the number of available signature samples is often limited in the practical application of signature verification systems.This study addresses these issues by presenting an OSV system based on multifeature fusion and discriminant feature selection using a genetic algorithm(GA).In contrast to existing methods,which use multiclass learning approaches,this study uses a oneclass learning strategy to address imbalanced signature data in the practical application of a signature verification system.The proposed approach is tested on three signature databases(SID)-Arabic handwriting signatures,CEDAR(Center of Excellence for Document Analysis and Recognition),and UTSIG(University of Tehran Persian Signature),and experimental results show that the proposed system outperforms existing systems in terms of reducing the False Acceptance Rate(FAR),False Rejection Rate(FRR),and Equal Error Rate(ERR).The proposed system achieved 5%improvement.