Lawrence Tan

dblp:05/7452 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0005-4431-6722ORCID · reported

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

Software engineering, systems software and programming languages · 2Artificial intelligence and machine learning · 1Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

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.

Human-computer interaction and pervasive computing
1 paper
Human-AI interaction · 44% Collaborative and social computing · 44% User interface design and tools · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 56% Processor architecture and microarchitecture · 28% Distributed systems · 17%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Human-AI interaction › interactive machine learning › machine teaching
interactive machine teaching
0.812024
Mapping the Design Space of Teachable Social Media Feed Experiences · CHI 2024
Collaborative and social computing
social media
0.812024
Mapping the Design Space of Teachable Social Media Feed Experiences · CHI 2024
Processor architecture and microarchitecture
clustered architecture
0.112009
FAWN: a fast array of wimpy nodes · SOSP 2009
Storage systems › key-value storage
flash-based key-value store
0.112009
FAWN: a fast array of wimpy nodes · SOSP 2009
Storage systems
key-value storage
0.112009
FAWN: a fast array of wimpy nodes · SOSP 2009
Distributed systems › replication › primary-backup replication
chain replication
0.012009
FAWN: a fast array of wimpy nodes · SOSP 2009
Distributed systems
replication
0.012009
FAWN: a fast array of wimpy nodes · SOSP 2009

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

think-aloud study · 0.8taxonomy synthesis · 0.8interviews · 0.8log-structured storage · 0.1consistent hashing · 0.1
YearPublicationVenuePosition
2024 Mapping the Design Space of Teachable Social Media Feed Experiences
abstract
Social media feeds are deeply personal spaces that reflect individual values and preferences. However, top-down, platform-wide content algorithms can reduce users’ sense of agency and fail to account for nuanced experiences and values. Drawing on the paradigm of interactive machine teaching (IMT), an interaction framework for non-expert algorithmic adaptation, we map out a design space for teachable social media feed experiences to empower agential, personalized feed curation. To do so, we conducted a think-aloud study (N = 24) featuring four social media platforms—Instagram, Mastodon, TikTok, and Twitter—to understand key signals users leveraged to determine the value of a post in their feed. We synthesized users’ signals into taxonomies that, when combined with user interviews, inform five design principles that extend IMT into the social media setting. We finally embodied our principles into three feed designs that we present as sensitizing concepts for teachable feed experiences moving forward.
K. J. Kevin Feng, Xander Koo, Lawrence Tan, Amy S. Bruckman, David W. McDonald, Amy X. Zhang
CHI3
2009 FAWNdamentally Power-efficient Clusters
Vijay Vasudevan, Jason Franklin, David G. Andersen, Amar Phanishayee, Lawrence Tan, Michael Kaminsky, Iulian Moraru
HotOS5
2009 FAWN: a fast array of wimpy nodes
abstract
This paper presents a new cluster architecture for low-power data-intensive computing. FAWN couples low-power embedded CPUs to small amounts of local flash storage, and balances computation and I/O capabilities to enable efficient, massively parallel access to data.The key contributions of this paper are the principles of the FAWN architecture and the design and implementation of FAWN-KV--a consistent, replicated, highly available, and high-performance key-value storage system built on a FAWN prototype. Our design centers around purely log-structured datastores that provide the basis for high performance on flash storage, as well as for replication and consistency obtained using chain replication on a consistent hashing ring. Our evaluation demonstrates that FAWN clusters can handle roughly 350 key-value queries per Joule of energy--two orders of magnitude more than a disk-based system.
David G. Andersen, Jason Franklin, Michael Kaminsky, Amar Phanishayee, Lawrence Tan, Vijay Vasudevan
SOSP5
2006 Learning Translation Rules for a Bidirectional English-Filipino Machine Translator
Michelle Wendy Tan, Bryan Anthony Hong, Danniel Liwanag Alcantara, Amiel Perez, Lawrence Tan
PACLIC5