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

Aadhar Jain

dblp:136/0973 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0001-6085-0267ORCID · corroborated

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

Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1Theory of computation · 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.

Theoretical computer science
1 paper
Mathematical optimization · 56% Approximation and online algorithms · 44%
Human-computer interaction and pervasive computing
1 paper
Wearable and physiological sensing · 44% Health and well-being technologies · 44% Ubiquitous computing and smart environments · 13%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%
Computer networks
1 paper
Cellular and mobile networks · 100%

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

TopicWeightPapersLastEvidence papers
Approximation and online algorithms
approximation algorithms
0.312017
Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates · ACM Trans. Algorithms 2017
Mathematical optimization › submodular optimization
submodular maximization
0.312017
Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates · ACM Trans. Algorithms 2017
Multimedia analysis and retrieval
activity recognition
0.212013
3D teleimmersive activity classification based on application-system metadata · ACM Multimedia 2013
Mathematical optimization › combinatorial optimization
matroid constraint
0.112017
Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates · ACM Trans. Algorithms 2017
Cellular and mobile networks
quality-of-service provisioning
0.012013
3D teleimmersive activity classification based on application-system metadata · ACM Multimedia 2013

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

metadata analysis · 0.3learning model · 0.3local search · 0.3greedy algorithm · 0.3signal processing · 0.2photoacoustic spectroscopy · 0.2machine learning · 0.2
YearPublicationVenuePosition
2018 Personalized stress monitoring: a smartphone-enabled system for quantification of salivary cortisol
Elizabeth Rey, Aadhar Jain, Saeed Abdullah, Tanzeem Choudhury, David Erickson
Pers. Ubiquitous Comput.2
2017 Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
abstract
Result diversification is an important aspect in web-based search, document summarization, facility location, portfolio management, and other applications. Given a set of ranked results for a set of objects (e.g., web documents, facilities, etc.) with a distance between any pair, the goal is to select a subset S satisfying the following three criteria: (a) the subset S satisfies some constraint (e.g., bounded cardinality), (b) the subset contains results of high “quality,” and (c) the subset contains results that are “diverse” relative to the distance measure. The goal of result diversification is to produce a diversified subset while maintaining high quality as much as possible. We study a broad class of problems where the distances are a metric, where the constraint is given by independence in a matroid, where quality is determined by a monotone submodular function and diversity is defined as the sum of distances between objects in S . Our problem is a generalization of the max-sum diversification problem studied in Gollapudi and Sharma [2009], which in turn is a generalization of the max-sum p-dispersion problem studied extensively in location theory. It is NP-hard even with the triangle inequality. We propose two simple and natural algorithms: a greedy algorithm for a cardinality constraint and a local search algorithm for an arbitrary matroid constraint. We prove that both algorithms achieve constant approximation ratios.
Allan Borodin, Aadhar Jain, Hyun Chul Lee, Yuli Ye
ACM Trans. Algorithms2
2016 Nutrilyzer: A Mobile System for Characterizing Liquid Food with Photoacoustic Effect
abstract
In this paper, we propose Nutrilyzer, a novel mobile sensing system for characterizing the nutrients and detecting adulterants in liquid food with the photoacoustic effect. By listening to the sound of the intensity modulated light or electromagnetic wave with different wavelengths, our mobile photoacoustic sensing system captures unique spectra produced by the transmitted and scattered light while passing through various liquid food. As different liquid foods with different chemical compositions yield uniquely different spectral signatures, Nutrilyzer's signal processing and machine learning algorithm learn to map the photoacoustic signature to various liquid food characteristics including nutrients and adulterants. We evaluated Nutrilyzer for milk nutrient prediction (i.e., milk protein) and milk adulterant detection. We have also explored Nutrilyzer for alcohol concentration prediction. The Nutrilyzer mobile system consists of an array of 16 LEDs in ultraviolet, visible and near-infrared region, two piezoelectric sensors and an ARM microcontroller unit, which are designed and fabricated in a printed circuit board and a 3D printed photoacoustic housing.
Tauhidur Rahman, Alexander Travis Adams, Perry Schein, Aadhar Jain, David Erickson, Tanzeem Choudhury
SenSys4
2013 3D teleimmersive activity classification based on application-system metadata
abstract
Being able to detect and recognize human activities is essential for 3D collaborative applications for efficient quality of service provisioning and device management. A broad range of research has been devoted to analyze media data to identify human activity, which requires the knowledge of data format, application-specific coding technique and computationally expensive image analysis. In this paper, we propose a human activity detection technique based on application generated metadata and related system metadata. Our approach does not depend on specific data format or coding technique. We evaluate our algorithm with different cyber-physical setups, and show that we can achieve very high accuracy (above 97%) by using a good learning model.
Aadhar Jain, Ahsan Arefin, Raoul Rivas, Chien-Nan (Shannon) Chen, Klara Nahrstedt
ACM Multimedia1