skip to main content


Search for: All records

Creators/Authors contains: "Kumar, V."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. MicroLEDs offer an extraordinary combination of high luminance, high energy efficiency, low cost, and long lifetime. These characteristics are highly desirable in various applications, but their usage has, to date, been primarily focused toward next-generation display technologies. Applications of microLEDs in other technologies, such as projector systems, computational imaging, communication systems, or neural stimulation, have been limited. In non-display applications which use microLEDs as light sources, modifications in key electrical and optical characteristics such as external efficiency, output beam shape, modulation bandwidth, light output power, and emission wavelengths are often needed for optimum performance. A number of advanced fabrication and processing techniques have been used to achieve these electro-optical characteristics in microLEDs. In this article, we review the non-display application areas of the microLEDs, the distinct opto-electrical characteristics required for these applications, and techniques that integrate the optical and electrical components on the microLEDs to improve system-level efficacy and performance.

     
    more » « less
    Free, publicly-accessible full text available May 1, 2024
  2. Accurate predictions of water temperature are the foundation for many decisions and regulations, with direct impacts on water quality, fishery yields, and power production. Building accurate broad-scale models for lake temperature prediction remains challenging in practice due to the variability in the data distribution across different lake systems monitored by static and time-series data. In this paper, to tackle the above challenges, we propose a novel machine learning based approach for integrating static and time-series data in deep recurrent models, which we call Invertibility-Aware-Long Short-Term Memory(IA-LSTM), and demonstrate its effectiveness in predicting lake temperature. Our proposed method integrates components of the Invertible Network and LSTM to better predict temperature profiles (forward modeling) and infer the static features (i.e., inverse modeling) that can eventually enhance the prediction when static variables are missing. We evaluate our method on predicting the temperature profile of 450 lakes in the Midwestern U.S. and report a relative improvement of 4\% to capture data heterogeneity and simultaneously outperform baseline predictions by 12\% when static features are unavailable. 
    more » « less
  3. Surface cleaning using commercial disinfectants, which has recently increased during the coronavirus disease 2019 pandemic, can generate secondary indoor pollutants both in gas and aerosol phases. It can also affect indoor air quality and health, especially for workers repeatedly exposed to disinfectants. Here, we cleaned the floor of a mechanically ventilated office room using a commercial cleaner while concurrently measuring gas-phase precursors, oxidants, radicals, secondary oxidation products, and aerosols in real time; these were detected within minutes after cleaner application. During cleaning, indoor monoterpene concentrations exceeded outdoor concentrations by two orders of magnitude, increasing the rate of ozonolysis under low (<10 ppb) ozone levels. High number concentrations of freshly nucleated sub–10-nm particles (≥105 cm−3) resulted in respiratory tract deposited dose rates comparable to or exceeding that of inhalation of vehicle-associated aerosols. 
    more » « less
  4. de Campos, C. ; Maathuis, M. H. (Ed.)
    An important achievement in the field of causal inference was a complete characterization of when a causal effect, in a system modeled by a causal graph, can be determined uniquely from purely observational data. The identification algorithms resulting from this work produce exact symbolic expressions for causal effects, in terms of the observational probabilities. More recent work has looked at the numerical properties of these expressions, in particular using the classical notion of the condition number. In its classical interpretation, the condition number quantifies the sensitivity of the output values of the expressions to small numerical perturbations in the input observational probabilities. In the context of causal identification, the condition number has also been shown to be related to the effect of certain kinds of uncertainties in the structure of the causal graphical model. In this paper, we first give an upper bound on the condition number for the interesting case of causal graphical models with small “confounded components”. We then develop a tight characterization of the condition number of any given causal identification problem. Finally, we use our tight characterization to give a specific example where the condition number can be much lower than that obtained via generic bounds on the condition number, and to show that even “equivalent” expressions for causal identification can behave very differently with respect to their numerical stability properties. 
    more » « less
  5. An important achievement in the field of causal inference was a complete characterization of when a causal effect, in a system modeled by a causal graph, can be determined uniquely from purely observational data. The identification algorithms resulting from this work produce exact symbolic expressions for causal effects, in terms of the observational probabilities. More recent work has looked at the numerical properties of these expressions, in particular using the classical notion of the condition number. In its classical interpretation, the condition number quantifies the sensitivity of the output values of the expressions to small numerical perturbations in the input observational probabilities. In the context of causal identification, the condition number has also been shown to be related to the effect of certain kinds of uncertainties in the structure of the causal graphical model. In this paper, we first give an upper bound on the condition number for the interesting case of causal graphical models with small “confounded components”. We then develop a tight characterization of the condition number of any given causal identification problem. Finally, we use our tight characterization to give a specific example where the condition number can be much lower than that obtained via generic bounds on the condition number, and to show that even “equivalent” expressions for causal identification can behave very differently with respect to their numerical stability properties. 
    more » « less
  6. Demeniconi, Carlotta ; Davidson, Ian (Ed.)
    This paper proposes a physics-guided machine learning approach that combines machine learning models and physics-based models to improve the prediction of water flow and temperature in river networks. We first build a recurrent graph network model to capture the interactions among multiple segments in the river network. Then we transfer knowledge from physics-based models to guide the learning of the machine learning model. We also propose a new loss function that balances the performance over different river segments. We demonstrate the effectiveness of the proposed method in predicting temperature and streamflow in a subset of the Delaware River Basin. In particular, the proposed method has brought a 33%/14% accuracy improvement over the state-of-the-art physics-based model and 24%/14% over traditional machine learning models (e.g., LSTM) in temperature/streamflow prediction using very sparse (0.1%) training data. The proposed method has also been shown to produce better performance when generalized to different seasons or river segments with different streamflow ranges. 
    more » « less