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

Carl Pfeiffer

dblp:119/0694 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0003-1868-7800ORCID · corroborated

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

Computer networks · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1

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
2 papers
Physical-layer communications · 88% Internet of things and sensor networks · 12%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 100%
Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 77% Human-AI interaction · 23%
Network and information security
1 paper
Authentication and access control · 100%

Topics — the 6 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › antenna systems
antenna theory
0.712023
On the Maximum Communication Data Rate of Resonant Antennas · IEEE Trans. Commun. 2023
Physical-layer communications › information theory › capacity analysis
channel capacity
0.712023
On the Maximum Communication Data Rate of Resonant Antennas · IEEE Trans. Commun. 2023
Physical-layer communications
modulation
0.212023
On the Maximum Communication Data Rate of Resonant Antennas · IEEE Trans. Commun. 2023
Physical-layer communications › modulation
quadrature amplitude modulation
0.212023
On the Maximum Communication Data Rate of Resonant Antennas · IEEE Trans. Commun. 2023
Collaborative and social computing
crowdsourcing
0.212013
EmailValet: managing email overload through private, accountable crowdsourcing · CSCW 2013
Authentication and access control
access control
0.212013
EmailValet: managing email overload through private, accountable crowdsourcing · CSCW 2013

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

baseband simulation · 0.7QPSK · 0.7system-level co-optimization · 0.5field study · 0.3
YearPublicationVenuePosition
2023 On the Maximum Communication Data Rate of Resonant Antennas
abstract
A simple expression for the maximum data rate that can be reliably communicated (i.e., capacity) through a narrowband, resonant antenna with a Lorentzian frequency response is derived. Both transmit and receive cases are considered. In general, resonant antennas handle different data rates on receive than transmit because receive antennas filter out some of the external noise, but they also add their own loss related noise. It is also shown how adding loss, an impedance mismatch, or a matching network can increase the channel capacity by widening the resonant bandwidth at the expense of a reduced signal strength. A baseband simulation of communication between a narrowband transmitter and wideband receiver employing single-carrier quadrature amplitude modulation (QAM) is developed. The simulated data rates closely approach the derived theoretical limit. Finally, the simulation is experimentally validated by transmitting a quadrature phase shift keyed (QPSK) modulated signal through a single-resonant narrowband filter.
Carl Pfeiffer, Bae-Ian Wu
IEEE Trans. Commun.1
2016 Energy-Autonomous Wireless Communication for Millimeter-Scale Internet-of-Things Sensor Nodes
abstract
This paper presents an energy-autonomous wireless communication system for ultra-small Internet-of-Things (IoT) platforms. In the proposed system, all necessary components, including the battery, energy-harvesting solar cells, and the RF antenna, are fully integrated within a millimeter-scale form factor. Designing an energy-optimized wireless communication system for such a miniaturized platform is challenging because of unique system constraints imposed by the ultra-small system dimension. The proposed system targets orders of magnitude improvement in wireless communication energy efficiency through a comprehensive system-level analysis that jointly optimizes various system parameters, such as node dimension, modulation scheme, synchronization protocol, RF/analog/digital circuit specifications, carrier frequency, and a miniaturized 3-D antenna. We propose a new protocol and modulation schemes that are specifically designed for energy-scarce ultra-small IoT nodes. These new schemes exploit abundant signal processing resources on gateway devices to simplify design for energy-scarce ultra-small sensor nodes. The proposed dynamic link adaptation guarantees that the ultra-small IoT node always operates in the most energy efficient mode for a given operating scenario. The outcome is a truly energy-optimized wireless communication system to enable various classes of new applications, such as implanted smart-dust devices.
Nikolaos Chiotellis, Li-Xuan Chuo, Carl Pfeiffer, Yao Shi 0001, Ronald G. Dreslinski, Anthony Grbic, Trevor N. Mudge, David D. Wentzloff, David T. Blaauw, Hun-Seok Kim
IEEE J. Sel. Areas Commun.4
2015 More than bin packing: Dynamic resource allocation strategies in cloud data centers
Andreas Wolke, Boldbaatar Tsend-Ayush, Carl Pfeiffer, Martin Bichler
Inf. Syst.3
2014 Improving Enterprise VM Consolidation with High-Dimensional Load Profiles
abstract
Modern enterprise data centers take advantage of virtual machine consolidation to allocate virtual machines to virtualized servers to increase energy efficiency. One key problem is to minimize the number of virtualized servers required while maintaining service quality. A promising approach is to exploit recurring load patterns exhibited by enterprise VMs for increased allocation efficiency. This paper shows that bin packing heuristics can deliver the same allocation quality as integer linear programs if calculation time is constrained. There were no significant differences between vector bin packing heuristics in simulations based on CPU load profiles obtained from enterprise data centers. We further show that consolidating in clusters of a few hundred virtual machines is sufficient as solution quality does not improve with larger clusters.
Andreas Wolke, Carl Pfeiffer
IC2E2
2013 EmailValet: managing email overload through private, accountable crowdsourcing
abstract
This paper introduces privacy and accountability techniques for crowd-powered systems. We focus on email task management: tasks are an implicit part of every inbox, but the overwhelming volume of incoming email can bury important requests. We present EmailValet, an email client that recruits remote assistants from an expert crowdsourcing marketplace. By annotating each email with its implicit tasks, EmailValet's assistants create a task list that is automatically populated from emails in the user's inbox. The system is an example of a valet approach to crowdsourcing, which aims for parsimony and transparency in access con-trol for the crowd. To maintain privacy, users specify rules that define a sliding-window subset of their inbox that they are willing to share with assistants. To support accountability, EmailValet displays the actions that the assistant has taken on each email. In a weeklong field study, participants completed twice as many of their email-based tasks when they had access to crowdsourced assistants, and they became increasingly comfortable sharing their inbox with assistants over time.
Nicolas Kokkalis, Thomas Köhn, Carl Pfeiffer, Dima Chornyi, Michael S. Bernstein, Scott R. Klemmer
CSCW3