Zobrazeno 1 - 10
of 58
pro vyhledávání: '"John L. Pfaltz"'
Autor:
John L. Pfaltz
Publikováno v:
Algorithms, Vol 14, Iss 5, p 153 (2021)
Three computer algorithms are presented. One reduces a network N to its interior, I. Another counts all the triangles in a network, and the last randomly generates networks similar to N given just its interior I. However, these algorithms are not the
Externí odkaz:
https://doaj.org/article/54200fdb448c4700a04ae3fa65728045
Autor:
John L. Pfaltz
Publikováno v:
Mathematics for Applications. 2020 vol. 9, č. 1, s. 55-66. ISSN 1805-3629
In this paper we show that the composition (symmetric difference) ofcycles is well-defined. So, such a collection {. . . , Ci, Ck, . . .} of cycles with a com-position operator,◦, is a matroid. As such, it has sets of independent, or basis,cycles t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8125c7c5c5c7b253a01181e69e3da50
https://hdl.handle.net/11012/195182
https://hdl.handle.net/11012/195182
Autor:
John L. Pfaltz
Publikováno v:
Mathematics for Applications. 2019 vol. 8, č. 1, s. 79-96. ISSN 1805-3629
In this paper, we study relational networks. They may be as large as socialnetworks or as small as neural networks. We employ the concepts of closure andclosure operators to describe their structures, and introduce the idea of functionaltransformatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b43d6932f15ef46ab7fcfd39467f94d
https://hdl.handle.net/11012/186964
https://hdl.handle.net/11012/186964
Autor:
John L. Pfaltz
Publikováno v:
BCB
Any concept of a long-term, relatively permanent, memory must include a mechanism for encoding episodic experiences into some appropriate format and later retrieving and recreating a reasonable approximation of the original "episode". Psychologists c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b4f35691a406345677d586dc7c4b2ac
https://doi.org/10.1145/3233547.3233679
https://doi.org/10.1145/3233547.3233679
Autor:
John L. Pfaltz
Publikováno v:
Mathematics for Applications. 2015 vol. 4, č. 2, s. 129-152. ISSN 1805-3629
Many scientists observing the cognitive development in children have noted distinct phases in the way they learn. One phase appears to be a gradual accumulation of experience. Another phase appears to be a reorganization of those experiences to make
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d470775f47758d31f5998f3406515d5e
https://doi.org/10.13164/ma.2015.11
https://doi.org/10.13164/ma.2015.11
Autor:
John L. Pfaltz
Publikováno v:
Mathematics for Applications. 2015 vol. 4, č. 1, s. 61-76. ISSN 1805-3629
This paper examines the properties of structure preserving morphisms f over discrete partial orders. It employs concepts of continuity and path homomor- phisms. It will conclude that no single constraint on f will be sufficient, and it will also conc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc6dff239fdcd31673aef40fc186c841
https://doi.org/10.13164/ma.2015.05
https://doi.org/10.13164/ma.2015.05
Autor:
John L. Pfaltz
Publikováno v:
Graph Transformation, Specifications, and Nets ISBN: 9783319753959
Graph Transformation, Specifications, and Nets
Graph Transformation, Specifications, and Nets
In this paper, a category of undirected graphs is introduced where the morphisms are chosen in the style of mathematical graph theory rather than as algebraic structures as is more usual in the area of graph transformation.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::401300da91349cc9de7cae510c2f9fff
https://doi.org/10.1007/978-3-319-75396-6_12
https://doi.org/10.1007/978-3-319-75396-6_12
Autor:
John L. Pfaltz
Publikováno v:
Social Network Analysis and Mining. 3:863-872
A mathematical model for dynamic networks is developed that is based on closed, rather than open, sets. For a social network, it seems appropriate to use a neighborhood concept to establish these sets. We then define a rigorous concept of continuous
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0364e5c2ebaf446be90c771cb341ee92
https://doi.org/10.1007/s13278-013-0109-9
https://doi.org/10.1007/s13278-013-0109-9
Autor:
John L. Pfaltz
Publikováno v:
Algorithms for Computational Biology ISBN: 9783319581620
AlCoB
AlCoB
This paper presents two computable functions, \(\omega \) and \(\varepsilon \), that map networks into networks. If all cognition occurs as an active neural network, then it is thought that \(\omega \) models long-term memory consolidation and \(\var
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b13e3475edd37ebabf1bb13b3984b83
https://doi.org/10.1007/978-3-319-58163-7_6
https://doi.org/10.1007/978-3-319-58163-7_6
Autor:
Josef V{S}Lapal, John L. Pfaltz
Publikováno v:
Volume: 46, Issue: 1 91-101
Hacettepe Journal of Mathematics and Statistics
Hacettepe Journal of Mathematics and Statistics
We study network (i.e., undirected simple graph) structures by investigating associated closure operators and the corresponding closed sets. To describe the dynamic behavior of networks, we employ continuous transformations and neighborhood homomorph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbe5d67a4855fb871df2188e86acb97e
https://dergipark.org.tr/tr/pub/hujms/issue/39355/464287
https://dergipark.org.tr/tr/pub/hujms/issue/39355/464287