A5103243363- Quantum Mechanics and Applications
- Advanced Measurement and Metrology Techniques
- Algebraic and Geometric Analysis
- Quantum Computing Algorithms and Architecture
- Domain Adaptation and Few-Shot Learning
- Gear and Bearing Dynamics Analysis
- Fault Detection and Control Systems
- Quantum Information and Cryptography
- Topic Modeling
- Environmental Policies and Emissions
- Coding theory and cryptography
- Advanced Sensor Technologies Research
- Speech Recognition and Synthesis
- Advanced Statistical Process Monitoring
- graph theory and CDMA systems
- Finite Group Theory Research
- Hydraulic and Pneumatic Systems
- Adaptive Control of Nonlinear Systems
- advanced mathematical theories
- Robotic Path Planning Algorithms
- Gait Recognition and Analysis
- Vehicle Noise and Vibration Control
- Control Systems and Identification
- Protein Structure and Dynamics
- Advanced Chemical Physics Studies
Leipzig University
2021
University of Massachusetts Amherst
2018-2021
Amherst College
2020
Institut de l'Information Scientifique et Technique
2018
Illinois State University
2017
Jacobs (United States)
2017
Robert Bosch (Germany)
2016
New York University
2006
Courant Institute of Mathematical Sciences
2006
Harvard University Press
1988
A computational technique is proposed which combines the string method with a sampling to determine minimum free energy paths. The only requires compute mean force and another conditional expectation locally along string, therefore can be applied even if number of collective variables kept in calculation large. This contrast other techniques aim at mapping full landscape whose cost increases exponentially energy. Provided that large enough, new captures mechanism transition it allows...
Graph states form an important class of multipartite entangled quantum states. We propose a new approach for distributing graph across network. consider network consisting nodes—quantum computers within which local operations are free—and EPR pairs shared between nodes that can continually be generated. prove upper bounds our on the number consumed, completion time, and amount classical communication required, all equal to or better than prior work [10]. also reduce problem minimizing time...
The Maxwell–Boltzmann distribution is a hallmark of statistical physics in thermodynamic equilibrium linking the probability density particle’s kinetic energies to temperature system that also determines its configurational fluctuations. This unique relation lost for Hot Brownian Motion, e.g., when particle constantly heated create an inhomogeneous surrounding liquid. While fluctuations this case can be described with effective temperature, it not all degrees freedom and suggested different...
Intent classification (IC) and slot filling (SF) are two fundamental tasks in modern Natural Language Understanding (NLU) systems. Collecting annotating large amounts of data to train deep learning models for such systems is not scalable. This problem can be addressed by from few examples using fast supervised meta-learning techniques as prototypical networks. In this work, we systematically investigate how contrastive unsupervised augmentation methods benefit these existing pipelines...
Samyadeep Basu, Amr Sharaf, Karine Ip Kiun Chong, Alex Fischer, Vishal Rohra, Michael Amoake, Hazem El-Hammamy, Ehi Nosakhare, Vijay Ramani, Benjamin Han. Proceedings of the Workshop on Structured and Unstructured Knowledge Integration (SUKI). 2022.
We are interested in the problem of time-optimal control omnidirectional robots with bounded acceleration (TOC-ORBA). While there exist approximate solutions for such problems, and exact unbounded acceleration, solvers to TOC-ORBA have remained elusive until now. In this paper, we present a real-time solver true acceleration. first derive general parameterized form solution by application Pontryagin's maximum principle. then frame boundary value as an optimization over space. To overcome...
The paw graph consists of a triangle with pendant edge attached to one the three vertices.We obtain multigraph by adding exactly repeated paw.Now, let D be directed obtained orientating edges that multigraph.For 12 18 possibilities for D, we establish necessary and sufficient conditions on n existence (K * , D)-design.Partial results are given remaining 6 D.
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph across network. consider network consisting nodes-quantum computers within which local operations free-and EPR pairs shared between nodes that can continually be generated. prove upper bounds our on the number consumed, timesteps taken, and amount classical communication required, all equal to or better than prior work. also reduce problem minimizing taken distribute...
Structural analysis provides methods to find all possible residual generators in an over-constrained model structure. The number of candidates though growths exponentially with the degree over-constrainedness. Since on one hand not are necessary for fault detection and isolation other provide sufficient information distinguish between effects uncertainties robustly, it is open problem how optimal subset residuals. This should be sense that a robust diagnosis presence maximal isolation. In...