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.

Simon Li

dblp:96/1774 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1 · 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.

Theoretical computer science
1 paper
Information theory · 50% Mathematical optimization · 50%
Network and information security
1 paper
Cyber-physical and IoT security · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Cyber-physical and IoT security › iot privacy
smart meter privacy
0.312018
Information-Theoretic Privacy for Smart Metering Systems with a Rechargeable Battery · IEEE Trans. Inf. Theory 2018
Information theory
information-theoretic security
0.312018
Information-Theoretic Privacy for Smart Metering Systems with a Rechargeable Battery · IEEE Trans. Inf. Theory 2018
Mathematical optimization › sequential decision making
markov decision processes
0.312018
Information-Theoretic Privacy for Smart Metering Systems with a Rechargeable Battery · IEEE Trans. Inf. Theory 2018
Bioinformatics and computational biology › bioimage informatics
bioimage analysis
0.312025
bia-binder: a web-native cloud compute service for the bioimage analysis community · Bioinform. 2025
Geometric modeling and processing
design optimization
0.012002
A computerized team approach for concurrent product and process design optimization · Comput. Aided Des. 2002

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

mutual information · 0.7dynamic programming · 0.7team-based optimization · 0.1
YearPublicationVenuePosition
2025 bia-binder: a web-native cloud compute service for the bioimage analysis community
abstract
SUMMARY: We introduce BioImage Archive Binder (bia-binder), an open-source, cloud-architectured, and web-based coding environment tailored to bioimage analysis that is freely accessible to all researchers. The service generates easy-to-use Jupyter Notebook coding environments hosted on EMBL-EBI's Embassy Cloud, an academically hosted compute service which provides significant computational resources. The bia-binder architecture is free, open-source and publicly available for deployment. It features fast and direct access to images in the BioImage Archive, the Image Data Resource, and the BioStudies databases. We believe that this service can play a role in mitigating the current inequalities in access to scientific resources across academia. As bia-binder produces permanent links to compiled coding environments, we foresee the service to become widely used within the community and enable exploratory research. AVAILABILITY AND IMPLEMENTATION: bia-binder is built and deployed using helmsman and helm and released under the MIT licence. It can be accessed at binder.bioimagearchive.org and runs on any standard web browser.
Craig Russell, Jean-Marie Burel, Awais Athar, Simon Li, Ugis Sarkans, Jason R. Swedlow, Alvis Brazma, Matthew Hartley, Virginie Uhlmann
Bioinform.4
2018 Information-Theoretic Privacy for Smart Metering Systems with a Rechargeable Battery
abstract
Smart-metering systems report electricity usage of a user to the utility provider on almost real-time basis. This could leak private information about the user to the utility provider. In this paper, we investigate the use of a rechargeable battery in order to provide privacy to the user. We assume that the user load sequence is a first-order Markov process, the battery satisfies ideal charge conservation, and that privacy is measured using normalized mutual information (leakage rate) between the user load and the battery output. We study the optimal battery charging policy that minimizes the leakage rate among the class of battery policies that satisfy causality and charge conservation. We propose a series reduction on the original problem and ultimately recast it as a Markov Decision Process (MDP) that can be solved using a dynamic program. In the special case of i.i.d. demand, we explicitly characterize the optimal policy and show that the associated leakage rate can be expressed as a single-letter mutual information expression. In this case, we show that the optimal charging policy admits an intuitive interpretation of preserving a certain invariance property of the state. Interestingly an alternative proof of optimality can be provided that does not rely on the MDP approach, but is based on purely information theoretic reductions.
Simon Li, Ashish Khisti, Aditya Mahajan
IEEE Trans. Inf. Theory1
2002 A computerized team approach for concurrent product and process design optimization
Simon Li
Comput. Aided Des.2