https://cis.temple.edu/~pwang/Publication/OpenNARS.pdf
The OpenNARS implementation of the Non-Axiomatic Reasoning System Patrick Hammer1, Tony Lofthouse2, Pei Wang3
https://cis.temple.edu/tagit/publications/A_Model_of_Unified_Perception_and_Cognition.pdf
Pei Wang1*, Christian Hahm1 and Patrick Hammer2 1Department of Computer and Information Sciences, Temple University, Philadelphia, PA, United States, 2Department of Psychology, Stockholm University, Stockholm, Sweden This article discusses an approach to add perception functionality to a general-purpose intelligent system, NARS.
https://cis.temple.edu/~wu/hoc4667-liu.pdf
ABSTRACT The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout-ing approaches based on deterministic mobility, ferry-based routing with deterministic or semi-deterministic mobility, °ooding-based approaches for networks with general mo-bility, and probability-based ...
https://cis.temple.edu/~lakaemper/courses/cis350_2004/etc/moeller_triangle.pdf
1 Introduction Most collision detection algorithms, such as OBBTree [Gottschalk96], sphere hier-archies [Hubbard96] and BV-trees [Klosowski97], try to minimize the number of primitive-primitive intersections that have to be computed. Still, a fast and reliable method for computing the primitive-primitive intersection is desired. Since render-ing hardware is often targeted for triangles, the ...
https://cis.temple.edu/tagit/presentations/Sparks%20of%20AGI%20Early%20Experiments%20with%20GPT4.pdf
Paper Review: 'Sparks of Artificial General Intelligence: Early experiments with GPT-4' Authors: Sebastien Bubeck, Varun Chandrasekaran, Ronen Eldan, Johannes Gehrke, Eric Horvitz, Ece Kamar, Peter Lee, Yin Tat Lee, Yuanzhi Li, Scott Lundberg, Harsha Nori, Hamid Palangi, Marco Tulio Ribeiro, Yi Zhang
https://cis.temple.edu/~latecki/Papers/OSB_ICDM07.pdf
The proposed OSB computes the distance value between two sequences based directly on the distances of corre-sponding elements, just as DTW does, and it allows the ignoring of outlier points on both the query and target se-quences to find the best match, just as LCSS does. The main difference between DTW and OSB is that, unlike DTW, OSB can skip outlier elements of the query and target se ...