Buscar
Mostrando ítems 1-10 de 4307
ATTRACTORS POINTS IN THE AUTOSUBSTITUTION
(Universidad Católica del Norte, Departamento de Matemáticas, 2001)
Reversal fuzzy switch graphs
(Universidade Federal do Rio Grande do NorteBrasilUFRNPROGRAMA DE PÓS-GRADUAÇÃO EM SISTEMAS E COMPUTAÇÃO, 2022-06-17)
We present a state-based Fuzzy model called Reversal Fuzzy Switch Graph (RF SG). This
model enables the activation or deactivation of edges as well as the updating of fuzzy values
from the action of aggregation functions, ...
A graph-theoretic perspective on the links-to-concepts ratio expected in cognitive maps
(2009)
Strategic options development and analysis (SODA) has maintained that it expects a links-to-concepts ratio of 1.15-1.20 in cognitive maps. This expectation is investigated from a graph-theoretic perspective in order to ...
Graph database with the entire water drainage network of the Brazilian hidrography
(Repositório de Dados de Pesquisa da Unicamp, 2015)
G-CORE a core for future graph query languages
(Association for Computing Machinery, 2018)
We report on a community effort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider supporting a query language with two key ...
Graph coloring for enforcing password identification against brute force attacks
(Scopus, 2008)
Password Identification or Weak Authentication is one of the weakest points in accessing a system and a suitable point for recurrent attacks of crackers or sniffers. Breakdowns ranging from dictionary brute force attacks ...
System-level prognostics and health management: A graph convolutional network-based framework
(SAGE, 2020)
Sensing technologies have been used to gather massive amounts of data to improve system reliability analysis with the use of deep learning. Their use has been mainly focused on specific components or for the whole system, ...
Packing triangles in low degree graphs and indifference graphs
(ELSEVIER SCIENCE BV, 2008)
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known ...