Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Karen Witting

dblp:38/4284 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Content delivery and video streaming · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Content delivery and video streaming
dynamic content
0.012000
A Publishing System for Efficiently Creating Dynamic Web Content · INFOCOM 2000

Methods — techniques the papers use, named apart from their topics

consistency algorithms · 0.1dependence-graph algorithm · 0.0dependence graph algorithms · 0.0
YearPublicationVenuePosition
2007 Century: Automated Aspects of Patient Care
abstract
Remote health monitoring affords the possibility of improving the quality of health care by enabling relatively inexpensive out-patient care. However, remote health monitoring raises new a problem: the potential for data explosion in health care systems. To address this problem, the remote health monitoring systems must be integrated with analysis tools that provide automated trend analysis and event detection in real time. In this paper, we propose an overview of Century, an extensible framework for analysis of large numbers of remote sensor-based medical data streams.
Marion Blount, John S. Davis II, Maria Ebling, Ji Hyun Kim, Kyu Hyun Kim, Kangyoon Lee, Archan Misra, SeHun Park, Daby M. Sow, Young Ju Tak, Min Wang 0001, Karen Witting
RTCSA12
2005 A fragment-based approach for efficiently creating dynamic web content
abstract
This article presents a publishing system for efficiently creating dynamic Web content. Complex Web pages are constructed from simpler fragments. Fragments may recursively embed other fragments. Relationships between Web pages and fragments are represented by object dependence graphs. We present algorithms for efficiently detecting and updating Web pages affected after one or more fragments change. We also present algorithms for publishing sets of Web pages consistently; different algorithms are used depending upon the consistency requirements.Our publishing system provides an easy method for Web site designers to specify and modify inclusion relationships among Web pages and fragments. Users can update content on multiple Web pages by modifying a template. The system then automatically updates all Web pages affected by the change. Our system accommodates both content that must be proofread before publication and is typically from humans as well as content that has to be published immediately and is typically from automated feeds.We discuss some of our experiences with real deployments of our system as well as its performance. We also quantitatively present characteristics of fragments used at a major deployment of our publishing system including fragment sizes, update frequencies, and inclusion relationships.
Jim Challenger, Paul Dantzig, Arun Iyengar, Karen Witting
ACM Trans. Internet Techn.4
2003 Monitoring Distributed Systems: A Publish/Subscribe Methodology and Architecture
Karen Witting, Jim Challenger, Brian O'Connell
Integrated Network Management1
2000 A Publishing System for Efficiently Creating Dynamic Web Content
abstract
This paper presents a publishing system for efficiently creating dynamic Web content. Complex Web pages are constructed from simpler fragments. Fragments may recursively embed other fragments. Relationships between Web pages and fragments are represented by object dependence graphs. We present algorithms for efficiently detecting and updating Web pages affected after one or more fragments change. We also present algorithms for publishing sets of Web pages consistently; different algorithms are used depending upon the consistency requirements. Our publishing system provides an easy method for Web site designers to specify and modify inclusion relationships among Web pages and fragments. Users can update content on multiple Web pages by modifying a template. The system then automatically updates an Web pages affected by the change. Our system accommodates both content that must be proof-read before publication and is typically from humans as well as content that has to be published immediately and is typically from automated feeds. Our system is deployed at several popular Web sites including the 2000 Olympic Games Web site. We discuss some of our experiences with real deployments of our system as well as its performance.
Jim Challenger, Arun Iyengar, Karen Witting, Cameron Ferstat, Paul Reed
INFOCOM3