Results 71 to 80 of about 24,879 (166)

TAP: A static analysis model for PHP vulnerabilities based on token and deep learning technology.

PLoS ONE, 2019
With the widespread usage of Web applications, the security issues of source code are increasing. The exposed vulnerabilities seriously endanger the interests of service providers and customers. There are some models for solving this problem.
Yong Fang, Shengjun Han, Cheng Huang, Runpu Wu   +3 more
doaj   +1 more source

Invariant Hamming graphs in infinite quasi-median graphs

Discrete Mathematics, 1996
A Hamming graph is a Cartesian product of complete graphs. The main results of the paper are: (i) a quasi-median graph without isometric rays contains a Hamming graph which is invariant under any automorphism; and (ii) any contraction of a rayless quasi-median graph stabilizes a finite Hamming graph.
Chastand, Marc, Polat, Norbert
openaire   +1 more source

Isometric embeddings in Hamming graphs

Journal of Combinatorial Theory, Series B, 1990
An \(O(n^ 3)\)-algorithm is established which embeds a given graph isometrically into a Hamming graph (i.e., a Cartesian product of complete graphs) whenever possible, and recognizes non-embeddable graphs. From the algorithm several characterizations of the embeddable graphs are derived.
openaire   +2 more sources

Consensus Strategies for Signed Profiles on Graphs [PDF]

The median problem is a classical problem in Location Theory: one searches for a location that minimizes the average distance to the sites of the clients. This is for desired facilities as a distribution center for a set of warehouses. More recently, for
Balakrishnan, K., Changat, M., Mulder, H.M., Subhamathi, A.R.   +3 more
core   +1 more source

The retracts of Hamming graphs

Discrete Mathematics, 1992
All graphs considered are finite undirected simple ones. The object of this article is the investigation of the so-called quasimedian graphs. In detail known results, especially of \textit{H. M. Mulder}, are presented, the essential concepts and their properties are placed at disposal and to it many definitions are necessary, the most important of them
openaire   +1 more source

\(L(h,k)\)-labelings of Hamming graphs

Discrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huang, L.-H., Chang, G. J.
openaire   +2 more sources

Fundamental Groups of Hamming Graphs

The PUMP Journal of Undergraduate Research
Recently there has been growing interest in discrete homotopies and homotopies of graphs beyond treating graphs as 1-dimensional simplicial spaces. One such type of homotopy is the -homotopy. Recent work by Chih-Scull has developed a homotopy category, a fundamental group for graphs under this homotopy, and a way of computing covers of graphs that lift
Behal, Keira, Chih, Tien
openaire   +2 more sources

NAPE: Numbering as a Position Encoding in Graphs

IEEE Access
Deep learning has been instrumental in feature extraction from various data types, such as images and sequences, which inherently possess oriented structures.
Olayinka Ajayi, Hongkai Wen, Tanaya Guha
doaj   +1 more source

Analyzing IND-CPA Security of HQC Codes Using k-Nearest Neighbors

IEEE Access
Hamming Quasi-Cyclic (HQC) codes, recently selected by NIST for post-quantum cryptography standardization, rely on the hardness of the 2-QCSD problem. While typically analyzed through algebraic methods, we apply AI-driven techniques to explore their IND ...
Emilio Volpe, Valerie Gauthier-Umana
doaj   +1 more source

Graph embeddings into Hamming spaces

, 2019
Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also offers attractive research in pure graph theory \cite{ge2}. In this note we show that any graph can be embedded into
openaire   +2 more sources