Paper uses smart meter data to accurately estimate multi-phase topology and identify bus phases in unbalanced distribution grids.
problem Accurate topology knowledge is needed for monitoring and controlling uncertainties in unbalanced distribution grids.
method Converts multi-phase unbalanced systems into symmetrical components and uses information theory, power flow equations, and conditional independence relationships to estimate topology and identify bus phases.
result The algorithm accurately estimates multi-phase topology and identifies bus phases in unbalanced distribution grids, even with strong load unbalancing and DERs.
A new method identifies EMTE causes using CNN and unsupervised feature learning.
problem Identifying causes of EMTEs in power grids.
method Spatiotemporal unsupervised feature learning with CNN and softmax.
result Validation through EMTP and RTDS simulations of various events.
New method identifies drivers from car logs without reverse-engineering CAN protocol.
problem Identifying drivers from in-vehicle network logs without access to exact signal semantics.
method Machine learning techniques applied to off-the-shelf data.
result Driver re-identification accuracy of 75-85% on a dataset of 33 drivers.
Paper improves phase identification in power systems using information theory.
problem Improving supervised learning accuracy in phase identification.
method Developed two new techniques based on information theory.
result Significant improvement in phase identification accuracy (e.g., from 51.7% to 97.3%).
The Frenet frame generalizes the Park transform for multi-phase circuits.
problem Generalizing the Park transform for multi-phase circuits.
method Using the Frenet frame and Cartan's moving frames.
result The Frenet frame provides a new approach to circuit analysis.
Study optimizes best-arm identification with minimax and Bayes strategies.
problem Efficiently identifying the best arm in fixed-budget scenarios.
method Adaptive procedure with two stages: pilot phase and minimax game.
result Single strategy is asymptotically minimax and Bayes optimal.
This paper evaluates various bus arrival time prediction models.
problem Improving prediction accuracy of bus arrival times.
method General evaluation framework for various models, including raw data pre-processing.
result Preliminary results show strengths and weaknesses of common models.
BusTr predicts bus travel times from real-time traffic forecasts.
problem Improving accuracy of bus travel time predictions.
method Neural sequence model trained on real-time traffic forecasts.
result BusTr outperforms DeepTTE by 30% in Mean Absolute Percentage Error (MAPE).
Paper revisits five IF paradoxes using differential geometry.
problem Five paradoxes of Instantaneous Frequency in three-phase systems.
method Geometric interpretation of frequency to explain IF paradoxes.
result Revisits and explains five IF paradoxes through a common framework.
Analyzing large X-ray diffraction (XRD) datasets is a key step in high-throughput mapping of the compositional phase diagrams of combinatorial materials libraries. Optimizing and automating this task can help accelerate the process of discovery of materials with novel and desirable properties. Here, we report a new met…
Study develops ML emulators for generator models from terminal bus data.
problem Reconstruct generator models from terminal bus measurements.
method Used machine learning techniques, including VAR and LSTM models.
result Established trade-offs between linear AR and powerful LSTM models.
Data-driven approach learns effective equations for phase field interfaces.
problem Learning accurate equations for phase field interface dynamics.
method Data-driven identification of partial differential equations from phase field data.
result Data-driven equations outperform analytical approximations in certain regimes.
Two neural network models analyze bus system efficiency and demand.
problem Identify service gaps and quantify demand in public transportation.
method Two neural network models considering demographic data and metrics.
result Models can generalize to other cities' bus systems.
A two-phase algorithm identifies the best arm in sparse linear bandits with fixed budget.
problem Best arm identification in sparse linear bandits with limited budget.
method Lasso and Optimal-Design (Lasso-OD) based linear best-arm identification.
result Lasso-OD achieves significant performance improvement for sparse and high-dimensional linear bandits.
Identifying a potentially large number of simultaneous line outages in power transmission networks in real time is a computationally hard problem. This is because the number of hypotheses grows exponentially with the network size. A new "Learning-to-Infer" method is developed for efficient inference of every line statu…
The wave equation utt=c2uxx is generally regarded as a linear approximation to the equation describing the amplitude of a transversely vibrating elastic string in the plane. But, as is shown in \cite{BC96}, the assumption of transverse vibration in fact implies that the wave equation describes the vibration…
Research presents a dataset and algorithm for optimizing bus timetables in New Delhi.
problem Improving efficiency of public transport in New Delhi.
method Real-time GPS data, constrained clustering algorithm, statistical analysis.
result Algorithm reduces waiting time and provides an efficient timetable.
Paper tackles best arm identification with cost consideration.
problem Best arm identification with cost consideration in product development.
method Derives a theoretical lower bound and proposes algorithms CTAS and CO.
result Simple algorithms can deliver near-optimal performance.
Two novel models predict bus travel times with uncertainty, improving connection assurance.
problem Improving bus connection assurance by handling travel time uncertainty.
method Two novel approaches: Deep Quantile Regression (DQR) and Bayesian Recurrent Neural Networks (BRNN).
result DQR model performs best for 80%, 90%, and 95% prediction intervals, with small underestimation.
Adaptive algorithm identifies best arm with abstention, showing phase transition from polynomial to exponential error probability.
problem Bayesian best-arm identification with abstention to reduce undetected error.
method Adaptive algorithm PGWS that optimally uses abstention budget.
result Introducing any positive abstention budget induces an exponential decay in undetected error probability.
Thompson Sampling with bilateral uncertainty improves performance in Bayesian Optimization.
problem Twin difficulties of modeling and searching complex functions in high dimensions.
method Exploiting conditional independence, Thompson Sampling respecting bilateral uncertainty (BU).
result Thompson Sampling with BU is more effective than the additive approximation in small budgets.
This paper presents a bus travel time prediction system using deep neural networks.
problem Accurate travel time predictions for urban buses to compete with other modes of transport.
method Multi-output, multi-time-step deep neural network combining convolutional and LSTM layers.
result The proposed model significantly outperforms other methods and detects small irregular peaks quickly.
Paper compares ML models for fast power system contingency case identification.
problem Identifying critical power system states quickly.
method Comparison of regression and classification ML models.
result MLPs most suitable for fast contingency case prediction.
Consumers with low demand, like households, are generally supplied single-phase power by connecting their service mains to one of the phases of a distribution transformer. The distribution companies face the problem of keeping a record of consumer connectivity to a phase due to uninformed changes that happen. The exact…
We give a polynomial-time algorithm for learning latent-state linear dynamical systems without system identification, and without assumptions on the spectral radius of the system's transition matrix. The algorithm extends the recently introduced technique of spectral filtering, previously applied only to systems with a…
The increasing penetration of distributed energy resources poses numerous reliability issues to the urban distribution grid. The topology estimation is a critical step to ensure the robustness of distribution grid operation. However, the bus connectivity and grid topology estimation are usually hard in distribution gri…
The potential of recovering the topology of a grid using solely publicly available market data is explored here. In contemporary whole-sale electricity markets, real-time prices are typically determined by solving the network-constrained economic dispatch problem. Under a linear DC model, locational marginal prices (LM…
The paper proposes a method to identify power system oscillation modes using blind source separation.
problem Accurately identifying oscillation modes in power systems with renewable energy sources.
method A high-order blind source identification (HOBI) algorithm based on copula statistic combined with Hilbert transform and iteration procedure.
result The method can identify all oscillation modes and model order from a single channel of observation signals, outperforming state-of-the-art methods.
IIC decouples causal identification into two phases, significantly reducing the HTC gap in linear SEMs.
problem Determining causal effect coefficients in linear SEMs with latent confounders using the Half-Trek Criterion (HTC) leaves a gap of inconclusive causal effects.
method Iterative Identification Closure (IIC) framework that decouples causal identification into two phases: a seed function S_0 and Reduced HTC propagation.
result IIC strictly subsumes both HTC and ancestor decomposition, reducing the HTC gap by over 80% with combined seeds.
CNN improves fault location in power grids with high accuracy.
problem Challenges in real-time fault location due to diverse fault types and fast reclosures.
method Convolutional Neural Network (CNN) classifier using bus voltages.
result CNN-based localization tool outperforms other machine learning methods.
Machine learning identifies phase transitions in condensed matter physics.
problem Classifying phase transitions in condensed matter physics.
method Unsupervised and supervised machine learning techniques applied to the Ising model.
result Machine learning can detect multiple phases and regions within the paramagnetic phase.
Paper tackles adversarial attacks on ANN state estimation in smart grids.
problem Adversarial attacks degrade ANN state estimation accuracy without detection.
method Proposes population-based and gradient-based algorithms to generate attack vectors.
result DE algorithm is more effective than SLSQP in generating attack vectors.
PROBE optimizes best-arm identification with cheap proxies, improving sample complexity.
problem Fixed-confidence best-arm identification with costly rewards and correlated cheap proxies.
method PROBE uses control-variate adjustment and phase elimination to learn residual variance online.
result PROBE achieves oracle sample complexity up to a constant factor and additive calibration cost.
Study uses supervised learning to classify quantum phases with limited measurements.
problem Classifying quantum phases of matter with incomplete phase diagrams.
method Combines classical and quantum techniques, including tensor networks, kernel methods, and quantum algorithms.
result Certification of new ground states can be achieved with polynomial measurements.
DDSTN improves breast cancer diagnosis by leveraging imbalanced ultrasound modalities.
problem Imbalanced ultrasound modalities in diagnosing breast cancer.
method Integrates LUPI and MMD into a deep transfer learning framework.
result Outperforms state-of-the-art algorithms in BUS-based CAD.
Generative model predicts ETA for bus routes using local data.
problem Accurate ETA prediction for public transit, especially buses, in cities with limited data.
method Generative deep learning model trained on local bus route data.
result Model updates ETA in real-time based on current trip information.
Given a complete, smooth metric measure space (M,g,e−fdv) with the Bakry-Émery Ricci curvature bounded from below, various gradient estimates for solutions of the following general f-heat equations ut=Δfu+aulogu+bu+Aup+Bu−q and \[ u_t=Δ_f u+Ae^{pu}+Be^{-pu}+D \] are studied. As by-product, we obt…
Proposes BU-SPO method to improve text classification robustness.
problem Vulnerability of deep models in text classification.
method Bigram and unigram based adaptive Semantic Preservation Optimization (BU-SPO) method.
result Achieves highest attack success rates and semantic similarity by changing the smallest number of words.
Optimizes bus schedules to improve on-time performance.
problem Improving on-time performance of public transit systems.
method Formulated as a single-objective optimization task, solved using greedy algorithm, GA, and PSO.
result Enhanced bus timetables leading to better on-time performance.
Consistent partial identification of causal effects proved for neural models.
problem Consistency of neural causal partial identification methods.
method Proving consistency for neural models with continuous and categorical variables, considering architecture design and Lipschitz regularization.
result Proven consistency of partial identification via neural causal models in a general setting.
A new algorithm for identifying the best arm in linear feedback with safety constraints.
problem Identifying the best arm in linear feedback with safety constraints.
method A gap-based algorithm that ensures safety while minimizing sample complexity.
result The algorithm achieves meaningful sample complexity while ensuring safety.
New algorithm identifies best arm in semiparametric bandits with near optimal efficiency.
problem Fixed-confidence Best Arm Identification in semiparametric bandits with unknown baseline shift.
method Phase-elimination algorithm based on orthogonalized regression design.
result Nearly optimal high-probability sample-complexity upper bound established.
A new geometric approach to identify slow invariant manifolds in complex systems.
problem The mathematical definition of slow invariant manifolds is unsatisfactory and limited to slow-fast systems.
method Formulate slow invariant manifolds geometrically within the context of differential geometry, focusing on covariant formulations.
result A more general definition of slow invariant manifolds is provided, independent of coordinate choice.
The increasing complexity of the power grid, due to higher penetration of distributed resources and the growing availability of interconnected, distributed metering devices re- quires novel tools for providing a unified and consistent view of the system. A computational framework for power systems data fusion, based on…
Algorithm identifies the best arm in linear bandits with high probability.
problem Best arm identification in linear multi-armed bandits with noisy measurements.
method Phased Elimination Linear Exploration Game (PELEG) using no-regret learners.
result PELEG achieves sample complexity matching lower bounds.
End-to-end algorithm for controlling bilinear systems with probabilistic noise.
problem Controlling bilinear systems with noisy data.
method Proposes an end-to-end algorithm using statistical learning theory and robust controller design.
result Derived finite sample identification error bounds and structurally suitable for control.
We compute the rings H∗(N;F2) for N a closed Sol3-manifold and then determine the Borsuk-Ulam indices BU(N,φ) with φ=0 in H1(N;F2).
New operations defined on moduli spaces for bundles with orientations.
problem Pushforward operations for principal bundles with orientations.
method Developed a general theory of pushforward operations for principal G-bundles, constructing specific operations for G=BU(1). result Classified all stable pushforward operations and showed they are generated by the projective Euler and rank operations.