arXiv subjects
Publications and source records attributed to Soham Chakraborty.
The canonical modular homomorphism provides an embedding of $\mathbb{R}$ into the outer automorphism group Out($M$) of any type III$_{1}$ factor $M$. We provide an explicit construction of a full factor of type III$_{1}$ with separable predual such that the outer automorphism group is minimal, i.e. this embedding is an isomorphism. We obtain such a III$_{1}$ factor by using an amalgamated free product construction.
A countable discrete group is called Choquet-Deny if for any non-degenerate probability measure on the group, the corresponding space of bounded harmonic functions is trivial. Building on the previous work of Jaworski, a complete characterization of Choquet-Deny groups was recently achieved by Frisch, Hartman, Tamuz, and Ferdowski. In this article, we extend the study of the Choquet-Deny property to the framework of discrete measured groupoids. Our primary result offers a complete characterization of this property in terms of the isotropy groups and the equivalence relation associated with the given groupoid. Additionally, we use the implications derived from our main theorem to classify the Choquet-Deny property of transformation groupoids.
Deep learning and computer vision methods are nowadays predominantly used in the field of ophthalmology. In this paper, we present an attention-aided DenseNet-121 for classifying normal and glaucomatous eyes from fundus images. It involves the convolutional block attention module to highlight relevant spatial and channel features extracted by DenseNet-121. The channel recalibration module further enriches the features by utilizing edge information along with the statistical features of the spatial dimension. For the experiments, two standard datasets, namely RIM-ONE and ACRIMA, have been used. Our method has shown superior results than state-of-the-art models. An ablation study has also been conducted to show the effectiveness of each of the components. The code of the proposed work is available at: https://github.com/Soham2004GitHub/DADGC.
Precise ego-motion measurement is crucial for various applications, including robotics, augmented reality, and autonomous navigation. In this poster, we propose mmPhase, an odometry framework based on single-chip millimetre-wave (mmWave) radar for robust ego-motion estimation in mobile platforms without requiring additional modalities like the visual, wheel, or inertial odometry. mmPhase leverages a phase-based velocity estimation approach to overcome the limitations of conventional doppler resolution. For real-world evaluations of mmPhase we have developed an ego-vehicle prototype. Compared to the state-of-the-art baselines, mmPhase shows superior performance in ego-velocity estimation.
Weak-memory models are standard formal specifications of concurrency across hardware, programming languages, and distributed systems. A fundamental computational problem is consistency testing: is the observed execution of a concurrent program in alignment with the specification of the underlying system? The problem has been studied extensively across Sequential Consistency (SC) and weak memory, and proven to be NP-complete when some aspect of the input (e.g., number of threads/memory locations) is unbounded. This unboundedness has left a natural question open: are there efficient parameterized algorithms for testing? The main contribution of this paper is a deep hardness result for consistency testing under many popular weak-memory models: the problem remains NP-complete even in its bounded setting, where candidate executions contain a bounded number of threads, memory locations, and values. This hardness spreads across several Release-Acquire variants of C11, a popular variant of its Relaxed fragment, popular Causal Consistency models, and the POWER architecture. To our knowledge, this is the first result that fully exposes the hardness of weak-memory testing and proves that the problem admits no parameterization under standard input parameters. It also yields a computational separation of these models from SC, x86-TSO, PSO, and Relaxed, for which bounded consistency testing is either known (for SC), or shown here (for the rest), to be in polynomial time.
We provide a complete classification for regular subalgebras $B \subset M$ of injective factors satisfying a natural relative commutant condition. We show that such subalgebras are classified by their associated amenable discrete measured groupoid $\mathcal{G}= \mathcal{G}_{B \subset M}$ and the action $\text{mod}(α)$ of $\mathcal{G}$ on the flow of weights induced by the cocycle action $(α,u)$ of $\mathcal{G}$ on $B$. We obtain a similar result for triple inclusions $A \subset B \subset M$ where $M$ is an injective factor, $A$ is a Cartan subalgebra of $M$, and $B \subset M$ is regular, showing that such inclusions are also classified by their associated groupoid $\mathcal{G} = \mathcal{G}_{B \subset M}$ and the induced action on the flow of weights. Given such a discrete measured amenable groupoid $\mathcal{G}$, we also construct a model action of $\mathcal{G}$ on a field of Cartan inclusions with prescribed action on the associated field of flows.
Over the years, several memory models have been proposed to capture the subtle concurrency semantics of C/C++.One of the most fundamental problems associated with a memory model M is consistency checking: given an execution X, is X consistent with M? This problem lies at the heart of numerous applications, including specification testing and litmus tests, stateless model checking, and dynamic analyses. As such, it has been explored extensively and its complexity is well-understood for traditional models like SC and TSO. However, less is known for the numerous model variants of C/C++, for which the problem becomes challenging due to the intricacies of their concurrency primitives. In this work we study the problem of consistency checking for popular variants of the C11 memory model, in particular, the RC20 model, its release-acquire (RA) fragment, the strong and weak variants of RA (SRA and WRA), as well as the Relaxed fragment of RC20. Motivated by applications in testing and model checking, we focus on reads-from consistency checking. The input is an execution X specifying a set of events, their program order and their reads-from relation, and the task is to decide the existence of a modification order on the writes of X that makes X consistent in a memory model. We draw a rich complexity landscape for this problem; our results include (i)~nearly-linear-time algorithms for certain variants, which improve over prior results, (ii)~fine-grained optimality results, as well as (iii)~matching upper and lower bounds (NP-hardness) for other variants. To our knowledge, this is the first work to characterize the complexity of consistency checking for C11 memory models. We have implemented our algorithms inside the TruSt model checker and the C11Tester testing tool. Experiments on standard benchmarks show that our new algorithms improve consistency checking, often by a significant margin.
Grid-following and grid-forming inverters are integral components of microgrids and for integration of renewable energy sources with the grid. For grid following inverters, which need to emulate controllable current sources, a significant challenge is to address the large uncertainty of the grid impedance. For grid forming inverters, which need to emulate a controllable voltage source, large uncertainty due to varying loads has to be addressed. In this article, a mu-synthesis-based robust control design methodology, where performance under quantified uncertainty is guaranteed, is developed under a unified approach for both grid-following and grid-forming inverters. The control objectives, while designing the proposed optimal controllers, are: i) reference tracking, disturbance rejection, harmonic compensation capability with sufficient LCL resonance damping under large variations of grid impedance uncertainty for grid-following inverters; ii) reference tracking, disturbance rejection, harmonic compensation capability with enhanced dynamic response under large variations of equivalent loading uncertainty for grid-forming inverters. A combined system-in-the-loop (SIL), controller hardware-in-the-loop (CHIL) and power hardware-in-the-loop (PHIL) based experimental validation on 10 kVA microgrid system with two physical inverter systems is conducted in order to evaluate the efficacy and viability of the proposed controllers.
Recovery of power flow to critical infrastructures, after grid failure, is a crucial need arising in scenarios that are increasingly becoming more frequent. This article proposes a power transition and recovery strategy by proposing a mode-dependent droop control-based inverters. The control strategy of inverters achieves the following objectives 1) regulate the output active and reactive power by the droop-based inverters to a desired value while operating in on-grid mode 2) seamless transition and recovery of power flow injections into the critical loads in the network by inverters operating in off-grid mode after the main grid fails; 3) require minimal information of grid/network status and conditions for the mode transition of droop control. A framework for assessing the stability of the system and to guide the choice of parameters for controllers is developed using control-oriented modeling. A comprehensive controller hardware-in-the-loop-based real-time simulation study on a test-system based on the realistic electrical network of M-Health Fairview, University of Minnesota Medical Center, corroborates the efficacy of the proposed controller strategy.
Mapping programs from one architecture to another plays a key role in technologies such as binary translation, decompilation, emulation, virtualization, and application migration. Although multicore architectures are ubiquitous, the state-of-the-art translation tools do not handle concurrency primitives correctly. Doing so is rather challenging because of the subtle differences in the concurrency models between architectures. In response, we address various aspects of the challenge. First, we develop correct and efficient translations between the concurrency models of two mainstream architecture families: x86 and ARM (versions 7 and 8). We develop direct mappings between x86 and ARMv8 and ARMv7, and fence elimination algorithms to eliminate redundant fences after direct mapping. Although our mapping utilizes ARMv8 as an intermediate model for mapping between x86 and ARMv7, we argue that it should not be used as an intermediate model in a decompiler because it disallows common compiler transformations. Second, we propose and implement a technique for inserting memory fences for safely migrating programs between different architectures. Our technique checks robustness against x86 and ARM, and inserts fences upon robustness violations. Our experiments demonstrate that in most of the programs both our techniques introduce significantly fewer fences compared to naive schemes for porting applications across these architectures.
This article proposes the design of H-infinity-based robust current controller for single-phase grid-feeding voltage source inverter with an LCL filter. The main objective of the proposed controller is to have good reference tracking, disturbance rejection and sufficient LCL resonance damping under a large range of variations of grid impedance. Based on the aforementioned performance requirements, frequency dependent weighting functions are designed. Subsequently, the sub-optimal control problem is formulated and solved to determine the stabilizing controller. Computational footprint of the controller is addressed for ease-of-implementability on low-cost controller boards. Finally controller hardware-in-the-loop simulations on OPAL-RT are performed in the validation stage to obtain performance guarantees of the controller. The proposed controller exhibits fast response during transients and superior reference tracking, disturbance rejection at steady-state when compared with proportional- and resonant-based current controllers.
Design and implementation of an optimal and robust single-loop voltage controller is proposed for single-phase grid forming voltage source inverter (VSI). The objective of the proposed controller is to have good reference tracking and disturbance rejection. Uncertain nature of loads can significantly alter system's behavior, especially during heavily loaded conditions, and impose an uncertainty in the dynamic model. This deteriorates the robustness of the controller severely. H-Infinity-based controller design is proposed in this article to address this issue. The required objectives of the optimal controller are formulated after modeling the loads as uncertain element of the control system. Time-domain MATLAB/SIMULINK-based simulation study substantiates the fact that the resulting controller exhibits superior robustness in performance during varying loading, conditions of VSI than that of the conventional multi-loop control architecture.
Advanced microgrids consisting of distributed energy resources interfaced with multi-inverter systems are becoming more common. Consequently, the effectiveness of voltage and frequency regulation in microgrids using conventional droop-based methodologies is challenged by uncertainty in the sizeand schedule of loads. This article proposes an isochronous architecture of parallel inverters with only voltage-active power droop (VP-D) control for improving active power sharing as well as plug-and-play of multi-inverter based distributed energyresources (DERs). In spite of not employing explicit control for frequency regulation, this architecture allows even sharing of reactive power while maintaining reduced circulating currents between inverters. The performance is achieved even when there are mismatches between commanded reference and power demanded from the actual load in the network. The isochronous architecture is implemented by employing a global positioning system (GPS) to disseminate timing signals that enable the microgrid to maintain nominal system frequency in the entire network. This enables direct control of active power through voltage source inverter (VSI) output voltage regulation, even in the presence of system disturbances. A small signal eigenvalue analysis of a multi-inverter system near the steady-state operating point is presented to evaluate the stability of the multi-inverter system with the proposed VP-D control. Simulation studies and hardware experiments on an 1.2 kVA prototype are conducted. The effectiveness of the proposed architecture towards active and reactive power sharing between inverters with load scenarios are demonstrated. Results of the hardware experiments corroborate the viability of the proposed VP-D control architecture.
In the present paper, we explore various gravitational aspects such as energy extraction (via the Penrose process and Superradiance), particle collisions around a $\mathcal{N}=2$, $U(1)^2$ dyonic rotating black hole (BH) in the gauged supergravity model. The impact of the rotation parameter ($a$) and the gauge coupling constant ($g$) on the behaviour of horizon and ergoregion of the BH is studied. It is of interest to note that, compared with the extremal Kerr BH, the gauge coupling constant, under certain constraints, can enhance the maximum efficiency of energy extraction by the Penrose process almost double. Under the same constraints, we can extract approximately 60.75\% of the initial mass energy from the BH which is noticeably higher in contrast to the extremal Kerr BH. The limit of energy extraction in terms of the local speeds of the fragments is also examined with the help of the Wald inequality. We identify an upper limit on the gauge coupling constant up to which the phenomenon of Superradiance is likely to occur. Finally, we computed the center-of-mass energy ($E_{CM}$) of two particles with the same rest masses moving in the equatorial plane of the BH. Our study also aims to sensitize $E_{CM}$ to the rotation parameter and the gauge coupling constant for extremal and nonextremal spacetime as well. Especially, for the extremal case, an infinitely large amount of $E_{CM}$ can be achieved closer to the horizon which allows the BH to serve as a more powerful Planck-energy-scale collider as compared to Kerr and any other generalized BHs in the Kerr family explored so far in general relativity. However, $E_{CM}$ for the nonextremal spacetime is shown to be finite and has an upper bound.
The diagonal representation and optical equivalence theorem are the E. C. G. Sudarshan's mid 20th century adventures in non-classical optics. It basically deals with a quantum mechanical description of photons to explain the quantum properties of light. Inspired by Sudarshan's pioneering work we try to explain the every minute mathematical details of his paper "Equivalence of semi-classical and quantum mechanical descriptions of statistical light beams". In this article we are going to go through some of the basics in developing quantum optics, then land up in E.C.G's original work and try to present it as rigorous as possible. We show some of its important applications in various classes of physics problems.
Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof.
We are developing a wildland fire model based on semi-empirical relations that estimate the rate of spread of a surface fire and post-frontal heat release, coupled with WRF, the Weather Research and Forecasting atmospheric model. A level set method identifies the fire front. Data are assimilated using both amplitude and position corrections using a morphing ensemble Kalman filter. We will use thermal images of a fire for observations that will be compared to synthetic image based on the model state.
A wildland fire model based on semi-empirical relations for the spread rate of a surface fire and post-frontal heat release is coupled with the Weather Research and Forecasting atmospheric model (WRF). The propagation of the fire front is implemented by a level set method. Data is assimilated by a morphing ensemble Kalman filter, which provides amplitude as well as position corrections. Thermal images of a fire will provide the observations and will be compared to a synthetic image from the model state.