Demo Data from EDBT 2026 / reviewers in the wild / expert
Kathleen Sucipto
dblp:183/1922
· DBLP profile ↗
3ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 1 first-authorApplied, interdisciplinary, general and emerging 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Computer networks
1 paper |
Edge and fog computing · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Energy-efficient computing · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › statistical genetics
association testing |
0.6 | 1 | 2022 | High-sensitivity pattern discovery in large, paired multiomic datasets · Bioinform. 2022 |
Bioinformatics and computational biology
multi-omics |
0.6 | 1 | 2022 | High-sensitivity pattern discovery in large, paired multiomic datasets · Bioinform. 2022 |
Edge and fog computing › mobile edge computing
computation offloading |
0.3 | 1 | 2017 | Keep your nice friends close, but your rich friends closer - Computation offloading using NFC · INFOCOM 2017 |
Edge and fog computing
mobile cloud computing |
0.1 | 1 | 2017 | Keep your nice friends close, but your rich friends closer - Computation offloading using NFC · INFOCOM 2017 |
Energy-efficient computing
mobile device energy management |
0.1 | 1 | 2017 | Keep your nice friends close, but your rich friends closer - Computation offloading using NFC · INFOCOM 2017 |
Methods — techniques the papers use, named apart from their topics
hierarchical hypothesis testing · 0.6experimental evaluation · 0.6NFC protocol design · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | High-sensitivity pattern discovery in large, paired multiomic datasetsabstractMOTIVATION: Modern biological screens yield enormous numbers of measurements, and identifying and interpreting statistically significant associations among features are essential. In experiments featuring multiple high-dimensional datasets collected from the same set of samples, it is useful to identify groups of associated features between the datasets in a way that provides high statistical power and false discovery rate (FDR) control. RESULTS: Here, we present a novel hierarchical framework, HAllA (Hierarchical All-against-All association testing), for structured association discovery between paired high-dimensional datasets. HAllA efficiently integrates hierarchical hypothesis testing with FDR correction to reveal significant linear and non-linear block-wise relationships among continuous and/or categorical data. We optimized and evaluated HAllA using heterogeneous synthetic datasets of known association structure, where HAllA outperformed all-against-all and other block-testing approaches across a range of common similarity measures. We then applied HAllA to a series of real-world multiomics datasets, revealing new associations between gene expression and host immune activity, the microbiome and host transcriptome, metabolomic profiling and human health phenotypes. AVAILABILITY AND IMPLEMENTATION: An open-source implementation of HAllA is freely available at http://huttenhower.sph.harvard.edu/halla along with documentation, demo datasets and a user group. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Andrew R. Ghazi, Kathleen Sucipto, Gholamali Rahnavard, Eric A. Franzosa, Lauren J. McIver, Jason Lloyd-Price, Emma H. Schwager, George Weingart, Yo Sup Moon, Xochitl C. Morgan, Levi Waldron, Curtis Huttenhower |
Bioinform. | 2 |
| 2017 | Keep your nice friends close, but your rich friends closer - Computation offloading using NFCabstractThe increasing complexity of smartphone applications and services necessitate high battery consumption but the growth of smartphones' battery capacity is not keeping pace with these increasing power demands. To overcome this problem, researchers gave birth to the Mobile Cloud Computing (MCC) research area. In this paper we advance on previous ideas, by proposing and implementing the first known Near Field Communication (NFC)-based computation offloading framework. This research is motivated by the advantages of NFC's short distance communication, with its better security, and its low battery consumption. We design a new NFC communication protocol that overcomes the limitations of the default protocol; removing the need for constant user interaction, the one-way communication restraint, and the limit on low data size transfer. We present experimental results of the energy consumption and the time duration of two computationally intensive representative applications: (i) RSA key generation and encryption, and (ii) gaming/puzzles. We show that when the helper device is more powerful than the device offloading the computations, the execution time of the tasks is reduced. Finally, we show that devices that offload application parts considerably reduce their energy consumption due to the low-power NFC interface and the benefits of offloading. Kathleen Sucipto, Dimitris Chatzopoulos, Sokol Kosta, Pan Hui 0001 |
INFOCOM | 1 |
| 2016 | Video compression in the neighborhood: An opportunistic approachabstractThe proliferation of mobile devices combined with advances in the area of low-power wireless communication, such as Wi-Fi Direct and Bluetooth 4.0, gave rise to a new computation paradigm known as Device-to-Device (D2D) offloading. In this scenario, devices collaborate with each other using short wireless links to create ad-hoc P2P networks for distributed task execution. Experiments on human movement, a non-negligible factor in the D2D context, have shown that people move in group or meet frequently, which suggests that D2D is possible. In this work, we examine the case of parallel compression of smartphone recorded videos with the help of nearby devices. First, we present a mathematical formulation of the problem that optimizes the compression time on the number of nearby helping devices, and show that the problem can be mapped as a water-filling problem. Then, we present real results of the compression time and energy when the compression is performed on one device and when it is parallelized among collaborating devices. To obtain these results, we implemented an Android application that is able to detect nearby devices, connect with them using Wi-Fi Direct, send video chunks for compression, receive and merge compressed chunks into one full compressed video. Dimitris Chatzopoulos, Kathleen Sucipto, Sokol Kosta, Pan Hui 0001 |
ICC | 2 |