HCRVD: A Vulnerability Detection System Based on CST-PDG Hierarchical Code Representation Learning

Prior studies have demonstrated that deep learning-based approaches can enhance the performance of source code vulnerability detection by training neural networks to learn vulnerability patterns in code representations.However,due to limitations in code representation and neural network design,the validity and practicality of the model still need to be improved.Additionally,due to differences in programming languages,most methods lack cross-language detection generality.To address these issues,in this paper,we analyze the shortcomings of previous code representations and neural networks.We propose a novel hierarchical code representation that combines Concrete Syntax Trees(CST)with Program Dependence Graphs(PDG).Furthermore,we introduce a Tree-Graph-Gated-Attention(TGGA)network based on gated recurrent units and attention mechanisms to build a Hierarchical Code Representation learning-based Vulnerability Detection(HCRVD)system.This system enables cross-language vulnerability detection at the function-level.The experiments show that HCRVD surpasses many competitors in vulnerability detection capabilities.It benefits from the hierarchical code representation learning method,and outperforms baseline in cross-language vulnerability detection by 9.772%and 11.819%in the C/C++and Java datasets,respectively.Moreover,HCRVD has certain ability to detect vulnerabilities in unknown programming languages and is useful in real open-source projects.HCRVD shows good validity,generality and practicality.

A Disturbance Localization Method for Power System Based on Group Sparse Representation and Entropy Weight Method

This paper addresses the problem of complex and challenging disturbance localization in the current power system operation environment by proposing a disturbance localization method for power systems based on group sparse representation and entropy weight method.Three different electrical quantities are selected as observations in the compressed sensing algorithm.The entropy weighting method is employed to calculate the weights of different observations based on their relative disturbance levels.Subsequently,by leveraging the topological information of the power system and pre-designing an overcomplete dictionary of disturbances based on the corresponding system parameter variations caused by disturbances,an improved Joint Generalized Orthogonal Matching Pursuit(J-GOMP)algorithm is utilized for reconstruction.The reconstructed sparse vectors are divided into three parts.If at least two parts have consistent node identifiers,the node is identified as the disturbance node.If the node identifiers in all three parts are inconsistent,further analysis is conducted considering the weights to determine the disturbance node.Simulation results based on the IEEE 39-bus system model demonstrate that the proposed method,utilizing electrical quantity information from only 8 measurement points,effectively locates disturbance positions and is applicable to various disturbance types with strong noise resistance.

Systematic Method for Constructing Lewis Representations

The systematic method for constructing Lewis representations is a method for representing chemical bonds between atoms in a molecule. It uses symbols to represent the valence electrons of the atoms involved in the bond. Using a number of rules in a defined order, it is often better suited to complicated cases than the Lewis representation of atoms. This method allows us to determine the formal charge and oxidation number of each atom in the edifice more efficiently than other methods.

ON THE MAXIMAL DISJOINT SYSTEM IN Riesz ALGEBRAS AND REPRESENTATION

Let E be an Archimedean Riesz algebra possessing a weak unit element e and a maximal disjoint system {e,: i∈I} in which e, is a projection element for each i. The principal band generated by eiis denoted by B(ei). The main result in this paper says that if there exists a completely regular Hausdorff space X such that E is Riesz algebra isomorphic to C(X) then for every i ∈ I there exists a completely regular Hausdorff space X, such that B(ei) is Riesz algebra isomorphic to C(Xi). Under an additional condition the inverse holds.

Computation of the Rational Representation for Solutions of High-dimensional Systems

This paper deals with the representation of the solutions of a polynomial system, and concentrates on the high-dimensional case. Based on the rational univari- ate representation of zero-dimensional polynomial systems, we give a new description called rational representation for the solutions of a high-dimensional polynomial sys- tem and propose an algorithm for computing it. By this way all the solutions of any high-dimensional polynomial system can be represented by a set of so-called rational- representation sets.

Research on system-of-systems combat simulation model formal specification and representation

To makesystem-of-systems combat simulation models easy to be developed and reused, simulation model formal specification and representation are researched. According to the view of system-of-systems combat simulation, and based on DEVS, the simulation model＇s fundamental formalisms are explored. It includes entity model, system-of-systems model and experiment model. It also presents rigorous formal specification. XML data exchange standard is combined to design the XML based language, SCSL, to support simulation model representation. The corresponding relationship between SCSL and simulation model formalism is discussed and the syntax and semantics of elements in SCSL are detailed. Based on simulation model formal specification, the abstract simulation algorithm is given and SCSL virtual machine, which is capable of automatically interpreting and executing simulation model represented by SCSL, is designed. Finally an application case is presented, which can show the validation of the theory and verification of SCSL.

Enhanced Deep Autoencoder Based Feature Representation Learning for Intelligent Intrusion Detection System

In the era of Big data,learning discriminant feature representation from network traffic is identified has as an invariably essential task for improving the detection ability of an intrusion detection system(IDS).Owing to the lack of accurately labeled network traffic data,many unsupervised feature representation learning models have been proposed with state-of-theart performance.Yet,these models fail to consider the classification error while learning the feature representation.Intuitively,the learnt feature representation may degrade the performance of the classification task.For the first time in the field of intrusion detection,this paper proposes an unsupervised IDS model leveraging the benefits of deep autoencoder(DAE)for learning the robust feature representation and one-class support vector machine(OCSVM)for finding the more compact decision hyperplane for intrusion detection.Specially,the proposed model defines a new unified objective function to minimize the reconstruction and classification error simultaneously.This unique contribution not only enables the model to support joint learning for feature representation and classifier training but also guides to learn the robust feature representation which can improve the discrimination ability of the classifier for intrusion detection.Three set of evaluation experiments are conducted to demonstrate the potential of the proposed model.First,the ablation evaluation on benchmark dataset,NSL-KDD validates the design decision of the proposed model.Next,the performance evaluation on recent intrusion dataset,UNSW-NB15 signifies the stable performance of the proposed model.Finally,the comparative evaluation verifies the efficacy of the proposed model against recently published state-of-the-art methods.

Homogeneity Analysis of Multiairport System Based on Airport Attributed Network Representation Learning

The homogeneity analysis of multi-airport system can provide important decision-making support for the route layout and cooperative operation.Existing research seldom analyzes the homogeneity of multi-airport system from the perspective of route network analysis,and the attribute information of airport nodes in the airport route network is not appropriately integrated into the airport network.In order to solve this problem,a multi-airport system homogeneity analysis method based on airport attribute network representation learning is proposed.Firstly,the route network of a multi-airport system with attribute information is constructed.If there are flights between airports,an edge is added between airports,and regional attribute information is added for each airport node.Secondly,the airport attributes and the airport network vector are represented respectively.The airport attributes and the airport network vector are embedded into the unified airport representation vector space by the network representation learning method,and then the airport vector integrating the airport attributes and the airport network characteristics is obtained.By calculating the similarity of the airport vectors,it is convenient to calculate the degree of homogeneity between airports and the homogeneity of the multi-airport system.The experimental results on the Beijing-Tianjin-Hebei multi-airport system show that,compared with other existing algorithms,the homogeneity analysis method based on attributed network representation learning can get more consistent results with the current situation of Beijing-Tianjin-Hebei multi-airport system.

A NEW COMPLETELY INTEGRABLE LIOUVILLE' S SYSTEM, ITS LAX REPRESENTATION AND BI-HAMILTONIAN STRUCTURE

A new isospectral problem and the corresponding hierarchy of nonlinear evolution equations is presented. As a reduction, the well-known MKdV equation is obtained. It is shown that the hierarchy of equations is integrable in Liouville' s sense and possesses Bi-Hamiltonian structure. Under the constraint between the potentials and eigenfunctions, the eigenvalue problem can be nonlinearized as a finite dimensional completely integrable system.

Enhanced LMI Representations for H2 Performance of Polytopic Uncertain Systems: Continuous-time Case

Based on two recent results, several new criteria of H2 performance for continuous-time linear systems are established by introducing two slack matrices. When used in robust analysis of systems with polytopic uncertainties, they can reduce conservatism inherent in the earlier quadratic method and the established parameter-dependent Lyapunov function approach. Two numerical examples are included to illustrate the feasibility and advantage of the proposed representations.

Simulation for chaos game representation of genomes by recurrent iterated function systems

Chaos game representation (CGR) of DNA sequences and linked protein sequences from genomes was proposed by Jeffrey (1990) and Yu et al. (2004), respectively. In this paper, we consider the CGR of three kinds of sequences from complete genomes: whole genome DNA sequences, linked coding DNA sequences and linked protein sequences. Some fractal patterns are found in these CGRs. A recurrent iterated function systems (RIFS) model is proposed to simulate the CGRs of these sequences from genomes and their induced measures. Numerical results on 50 genomes show that the RIFS model can simulate very well the CGRs and their induced measures. The parameters estimated in the RIFS model reflect information on species classification.

Knowledge Graph Representation Reasoning for Recommendation System

In view of the low interpretability of existing collaborative filtering recommendation algorithms and the difficulty of extracting information from content-based recommendation algorithms,we propose an efficient KGRS model.KGRS first obtains reasoning paths of knowledge graph and embeds the entities of paths into vectors based on knowledge representation learning TransD algorithm,then uses LSTM and soft attention mechanism to capture the semantic of each path reasoning,then uses convolution operation and pooling operation to distinguish the importance of different paths reasoning.Finally,through the full connection layer and sigmoid function to get the prediction ratings,and the items are sorted according to the prediction ratings to get the user’s recommendation list.KGRS is tested on the movielens-100k dataset.Compared with the related representative algorithm,including the state-of-the-art interpretable recommendation models RKGE and RippleNet,the experimental results show that KGRS has good recommendation interpretation and higher recommendation accuracy.

A FAMILY OF INTEGRABLE SYSTEMS OF LIOUVILLE AND LAX REPRESENTATION, DARBOUX TRANSFORMATIONS FOR ITS CONSTRAINED FLOWS

A family of integrable systems of Liouville are obtained by, Tu pattern. Using higher-order potential-eigenfunction constraints, the integrable systems are factorized to two x- and t(n)-integrable Hamiltonian systems whose Lax representation and three kinds of Darboux transformations are presented.

Expert system for earthquake prediction（ESEP）（2）－Knowledge representation and evidence combination

This paper deals with knowledge representation of ESEP (Expert System for Earthqauke Prediction). Attending the characteristics of the knowledge in earthquake prediction domain, production representation and procedural representation are connected in the knowledge repesentation model of ESEP named ESEP/K, and three new ways of evidence conbination are proposed for production rules besides 'AND' and 'OR'.

Majorana stellar representation for mixed-spin (s, 1/2) systems

By describing the evolution of a quantum state with the trajectories of the Majorana stars on a Bloch sphere,Majorana’s stellar representation provides an intuitive geometric perspective to comprehend the quantum system with highdimensional Hilbert space.However,the representation of a two-spin coupling system on a Bloch sphere has not been solved satisfactorily yet.Here,a practical method is presented to resolve the problem for the mixed-spin(s,1/2)system and describe the entanglement of the system.The system can be decomposed into two spins:spin-(s+1/2)and spin-(s−1/2)at the coupling bases,which can be regarded as independent spins.Besides,any pure state may be written as a superposition of two orthonormal states with one spin-(s+1/2)state and the other spin-(s−1/2)state.Thus,the whole initial state can be regarded as a state of a pseudo spin-1/2.In this way,the mixed spin decomposes into three spins.Therefore,the state can be represented by(2s+1)+(2s−1)+1=4s+1 sets of stars on a Bloch sphere.Finally,some examples are given to show symmetric patterns on the Bloch sphere and unveil the properties of the high-spin system by analyzing the trajectories of the Majorana stars on the Bloch sphere.

Application of Coordinate-Momentum Intermediate Representation in Solving Eigenstate Problem of a Coupled Oscillator System

We study the eigenstate problem of a kind of coupled oscillators in the new quantum mechanical representation ｜q,μ,υ〉, which is defined as the eigenvector of the operator （μQ ＋ υP）, whereμ and υ are two real parameters. We also use the U operator transformation method to deal with the same problem. We obtain the normally ordered product expressions of U operator and eigenvector. It is shown that the ground state of system Hamiltonian is a squeezed state.

Knowledge representation and rule-based solution system for dynamic programming model

A knowledge representation has been proposed using the state space theory of Artificial Intelligence for Dynamic Programming Model, in which a model can be defined as a six tuple M=(I,G,O,T,D,S). A building block modeling method uses the modules of a six tuple to form a rule based solution model. Moreover, a rule based system has been designed and set up to solve the Dynamic Programming Model. This knowledge based representation can be easily used to express symbolical knowledge and dynamic characteristics for Dynamic Programming Model, and the inference based on the knowledge in the process of solving Dynamic Programming Model can also be conveniently realized in computer.

EQUATION OF MATHEMATICAL PHYSICS AND OTHER AREAS OF APPLICATION: A CLASSICAL INTEGRABLE SYSTEM AND THE INVOLUTIVE REPRESENTATION OF SOLUTIONS OF THE HIGHER ORDER KAUP-NEWELL EQUATION

Under the constrained condition induced by the eigenfunction expresson of the potential (u, v)T = (-[A2q, q], [A2p, p])T = f (q, p), the spatial part of the Lax pair of the Kaup-Newell equation is non linearized to be a completely integrable system (R2N, Adp AND dq, H = H-1) with the Hamiltonian H-1 = -[A3q, p]-1/2[A2p, p][A2q, q]. while the nonlinearization of the time part leads to its N-involutive system {H(m)}. The involutive solution of the compatible fsystem (H-1), (H(m)) is mapped by into the solution of the higher order Kaup-Newell equation.

Tensor-Product Representation for Switched Linear Systems

This paper presents the method for the construction of tensor-product representation for multivariate switched linear systems, based on a suitable tensor-product representation of vectors and matrices. We obtain a representation theorem for multivariate switched linear systems. The stability properties of the tensor-product representation are investigated in depth, achieving the important result that any stable switched systems can be constructed a stable tensor-product representation of finite dimension. It is shown that the tensor-product representation provides a high level framework for describing the dynamic behavior. The interpretation of expressions within the tensor-product representation framework leads to enhanced conceptual and physical understanding of switched linear systems dynamic behavior.

Knowledge Representation and Fuzzy Reasoning of an Agricultural Expert System

The design scheme of an agricultural expert system based on longan and cauliflower planting techniques is presented. Using an object-oriented design and a combination of the techniques in multimedia, database, expert system and artificial intelligence, an in-depth analysis and summary are made of the knowledge features of die agricultural multimedia expert system and data models involved. According to the practical problems in agricultural field, the architectures and functions of the system are designed, and some design ideas about the hybrid knowledge representation and fuzzy reasoning are proposed.