https://cis.temple.edu/~wu/teaching/Spring2020_CIS5644_Distributed_Computing/distributed-computing-2020-notes-1.pdf
A distributed system is collection of independent computers that appear to the users of the system as single computer.
https://cis.temple.edu/tagit/presentations/Review%20of%20Besta23.pdf
the architecture can be seamlessly extended with novel thought transformations
https://cis.temple.edu/~wu/research/publications/Publication_files/Topology-Aware_Scheduling_Framework_for_Microservice_Applications_in_Cloud.pdf
Abstract—Loosely coupled and highly cohesived microservices running in containers are becoming the new paradigm for application development. Compared with monolithic applications, applications built on microservices architecture can be deployed and scaled independently, which promises to simplify software development and operation. However, the dramatic increase in the scale of microservices ...
https://cis.temple.edu/~jiewu/research/publications/Publication_files/jiang_www_2020.pdf
ABSTRACT Serendipity recommendation has attracted more and more atten-tion in recent years; it is committed to providing recommendations which could not only cater to users’ demands but also broaden their horizons. However, existing approaches usually measure user-item relevance with a scalar instead of a vector, ignoring user preference direction, which increases the risk of unrelated ...
https://cis.temple.edu/~jiewu/research/publications/Publication_files/WENJUNJIANG2021TWeb.pdf
In online systems, including e-commerce platforms, many users resort to the reviews or comments generated by previous consumers for decision making, while their time is limited to deal with many reviews. Therefore, a review summary, which contains all important features in user-generated reviews, is expected. In this paper, we study “how to generate a comprehensive review summary from a ...
https://cis.temple.edu/~latecki/Papers/DSP_PAMI2014.pdf
Abstract—In this paper, we present a novel partition framework, called dense subgraph partition (DSP), to automatically, precisely and efficiently decompose a positive hypergraph into dense subgraphs. A positive hypergraph is a graph or hypergraph whose edges, except self-loops, have positive weights. We first define the concepts of core subgraph, conditional core subgraph, and disjoint ...
https://cis.temple.edu/~wu/research/publications/Publication_files/jsan-13-00044-v2.pdf
Therefore, AI now governs the best time and nodes for such computational ofloading in order to better the response time and lessen edge device energy consumption.