https://cis.temple.edu/~latecki/Papers/mldm07.pdf
Abstract. Outlier detection has recently become an important prob-lem in many industrial and ̄nancial applications. In this paper, a novel unsupervised algorithm for outlier detection with a solid statistical foun-dation is proposed. First we modify a nonparametric density estimate with a variable kernel to yield a robust local density estimation. Out-liers are then detected by comparing the ...
https://sites.temple.edu/ticlj/files/2017/02/27.1.Bricker-TICLJ.pdf
Long ago, American legislatures and courts rejected such a defense for various reasons that make sense under both a utilitarian and retributivist model of punishment.2 Prior to developments in modern medicine, many injuries that are treatable today led to death3 and were treated as murder under different theories such as depraved heart murder. Further, based on the immutable facts in the above ...
https://sites.temple.edu/ticlj/files/2017/02/30.1.Scharre-TICLJ.pdf
Paul Scharre* Much of the debate on autonomous weapons presumes a choice between human versus autonomous decision-making over targeting and engagement decisions. In fact, in many situations, human-machine teaming in engagement decisions will not only be possible but preferable. Hybrid human-machine cognitive architectures will be able to leverage the precision and reliability of automation ...
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/~latecki/Papers/OSB_ICDM07.pdf
The sets of indices (ik) and (f(ik)) ik ∈ {1 . . .m} define the subsequences a′ of a and b′ of b, such that f restricted to (ik) is a bijection. This explains the phrase “subsequence bijection” in Optimal Subsequence Bi-jection (OSB).
https://ronlevygroup.cst.temple.edu/courses/2023_fall/chem5302/slides-notes/DDM_FEP_lecture.pdf
Very important type of “reaction”: bimolecular non-covalent binding R(sol) + L(sol)
https://cis.temple.edu/~latecki/Courses/CIS2033-Spring12/ElementaryProbabilityforApplications/ch2.pdf
The last equality is easy to prove: The number of ways of picking m objects out of n to take is the same as the number of ways of choosing n − m to leave behind.
https://cis.temple.edu/~yu/research/FitLoc-infocom16.pdf
In this paper, we propose, FitLoc, a fine-grained and low cost DfL approach that can localize multiple targets in various areas. By taking advantage of the compressive sensing (CS) theory, FitLoc decreases the deployment cost by collecting only a few of RSS measurements and performs a fine-grained localization. Further, FitLoc employs a rigorously designed transfer scheme to unify the radio ...
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/~wu/research/publications/Publication_files/handbook-part1.pdf
The 19 chapters in this section cover a wide range of topics across multiple layers: MAC (part of the data link layer), network, and applications. One chapter is devoted to the cross-layer architecture for ad hoc wireless networks. Several chapters deal with various efficient and scalable routing, including multicasting and geocasting, in ad hoc wireless networks. One chapter discusses routing ...