Search Keywords

Results Restricted To:

https://www.temple.edu

Total Results: 2,620

Dr. Jie Wu - 2024 Publications

https://cis.temple.edu/~jiewu/research/publications/Publications_2024.html

W. Tang, T. Ai, and J. Wu, " Tiresias: Optimizing NUMA Performance with CXL Memory and Locality-Aware Process Scheduling," Proc. of the ACM Turing Award Celebration Conference (ACM TURC), Jun 5-7, 2024.

A Survival Guide to AI and Teaching pt.4: Make AI Your Friend

https://sites.temple.edu/edvice/2023/06/21/a-survival-guide-to-ai-and-teaching-pt-4-make-ai-your-friend/

Allow students to submit an AI-generated first draft of a paper early in the semester, then focus their efforts on the revision process. Students submit both the AI draft and their revised version in a collaborative document (such as MS Word or Google Docs) so that you can track changes and see the version history.

stoj-1.qxd - Temple University

https://cis.temple.edu/~wu/teaching/Spring%202013/handoff.pdf

1.1 INTRODUCTION Mobility is the most important feature of a wireless cellular communication system. Usu-ally, continuous service is achieved by supporting handoff (or handover) from one cell to another. Handoff is the process of changing the channel (frequency, time slot, spreading code, or combination of them) associated with the current connection while a call is in progress. It is often ...

Online Federated Learning on Distributed Unknown Data Using UAVs

https://cis.temple.edu/~jiewu/research/publications/Publication_files/ICDE2024_Online_Federated_Learning_on_Distributed_Unknown_Data_Using_UAVs.pdf

Abstract—Along with the advance of low-altitude economy, a variety of applications based on Unmanned Aerial Vehicles (UAVs) have been developed to accomplish diverse tasks. In this paper, we focus on the scenario of multiple UAVs performing Federated Learning (FL) tasks. Specifically, a group of UAVs is scheduled to repeatedly visit some Points of Interest (PoIs), collect the data produced ...

Building Classification Models: ID3 and C4.5 - Temple University

https://cis.temple.edu/~ingargio/cis587/readings/id3-c45.html

Introduction ID3 and C4.5 are algorithms introduced by Quinlan for inducing Classification Models, also called Decision Trees, from data.

Introduction and Methodology - Temple University

https://community.mis.temple.edu/mis5203sec003spring2020/files/2019/01/COBIT-2019-Framework-Introduction-and-Methodology_res_eng_1118.pdf

About ISACA Nearing positive potential its 50th year, of technology. ISACA®(isaca.org) Technology powers global today’s association world helping and ISACA individuals knowledge, credentials, leverages the expertise of its half-million engaged professionals in information and cyber their organizations. education and community to advance their careers and transform equips professionals ...

Adaptive Procedural Generation in Minecraft - Temple University

https://cis.temple.edu/~wangp/5603-AI/Project/2022S/pattersonblaker/Ward_Patterson_Final_Report.pdf

1 Abstract Minecraft has been the focus of much AI research in past years. Most recently, interest has risen in procedural generation of settlements in Minecraft, largely due to a annual competition established in 2018 called the Generative Design in Minecraft Competition. Inspired by this recent research, we aim to develop a set of algorithms that are capable of building a realistic ...

It’s RILA Time: An Introduction to Registered Index-Linked Annuiti

https://www.fox.temple.edu/sites/fox/files/documents/Cummins%20Conference%202022/RILA_Moenig_JRI_final.pdf

Registered index-linked annuities (RILAs) are increasingly popular equity-based re-tirement savings products o ered by U.S. life insurance companies. They combine features of xed-index annuities and traditional variable annuities (TVAs), o ering in-vestors equity exposure with downside protection in a tax-deferred setting. This article introduces RILAs to the academic literature by describing ...

Graph Theory - Temple University

https://cis.temple.edu/~latecki/Courses/CIS166-05/Lectures/graph.ppt

The edges e1 and e2 are multiple edges if f(e1) = f(e2) Representation Example: V = {u, v, w}, E = {e1, e2, e3, e4} Definitions – Graph Type Terminology – Undirected graphs u and v are adjacent if {u, v} is an edge, e is called incident with u and v. u and v are called endpoints of {u, v} Degree of Vertex (deg (v)): the number of edges ...

Microsoft Word - IJNPA_submission2-final.doc

https://cis.temple.edu/~apal/npa.pdf

Abstract Recent advances in radio and embedded systems have enabled the proliferation of wireless sensor networks. Wireless sensor networks are tremendously being used in different environments to perform various monitoring tasks such as search, rescue, disaster relief, target tracking and a number of tasks in smart environments. In many such tasks, node localization is inherently one of the ...