Abstract

In this article, a novel adaptive controller is designed for Euler-Lagrangian systems under predefined time-varying state constraints. The proposed controller could achieve this objective without a priori knowledge of system parameters and, crucially, of state-dependent uncertainties. The closed-loop stability is verified using the Lyapunov method, while the overall efficacy of the proposed scheme is verified using a simulated robotic arm compared to the state of the art.

Abstract

In this work, we describe the creation of our machine- learning-based solution for coma prognosis after cardiac arrest using longitudinal EEG and ECG recordings for the ”Predicting Neurological Recovery from Coma After Car- diac Arrest: The George B. Moody PhysioNet Challenge 2023”. Our team, “ComaToast”, had its best submission ranked 28 out of 36 teams selected worldwide, with a chal- lenge score of 0.381 on the official leaderboard for the hid- den test set. We use a combination of age and signal fea- tures from EEG and ECG recordings. Frequency domain features, specifically mean power spectral density from 4 different bands of frequencies (Delta, Theta, Alpha and Beta) and mean Burst Suppression Ratio, were extracted from pre-processed EEG recordings from the first and last available recording for a given patient. Features like mean and standard deviations were extracted along channels for ECG recordings. After imputing missing values, these fea- tures are fed to an XGBoost classifier for the final binary classification of the outcome prediction task. The features are fed to a random forest regressor to predict the CPC outcome for every patient. A solution like ours, which uses a simple model and training technique, may be more viable than deep-learning solutions in general use cases. In our final model, our approach achieved a 5-fold cross- validation score of 0.34 on the public train set.

Abstract

This paper aims to address the limitations of current water level monitoring systems, which are bulky, expensive, and difficult to maintain, resulting in limited deployment. To overcome these challenges, the study utilises Internet of Things (IoT)-enabled low-cost sensor nodes for water level monitoring. In this study, an ultrasonic sensor-based water level node is developed to send data to the cloud through GPRS (2G). Five such nodes were deployed to monitor water levels in overhead tanks and sumps on the campus of IIIT Hyderabad, India. The collected water level data were analysed for behavioural patterns and detecting faulty float switches. In addition, a deep learning algorithm was employed, which can predict future water needs. Thus, the proposed IoT-based smart water level meter offers a more accessible and cost-effective approach to water level monitoring.

Abstract

The discovery of potential therapeutic agents for life‑threatening diseases has become a significant problem. There is a requirement for fast and accurate methods to identify drug‑like molecules that can be used as potential candidates for novel targets. Existing techniques like high‑throughput screening and virtual screening are time‑consuming and inefficient. Traditional molecule generation pipelines are more efficient than virtual screening but use time‑consuming docking software. Such docking functions can be emulated using Machine Learning models with comparable accuracy and faster execution times. However, we find that when pre‑trained machine learning models are employed in generative pipelines as oracles, they suffer from model degradation in areas where data is scarce. In this study, we propose an active learning‑based model that can be added as a supplement to enhanced molecule generation architectures. The proposed method uses uncertainty sampling on the molecules created by the generator model and dynamically learns as the generator samples molecules from different regions of the chemical space. The proposed framework can generate molecules with high binding affinity with ∼a 70% improvement in runtime compared to the baseline model by labeling only ∼30% of molecules compared to the baseline oracle.

Abstract

This paper presents a novel approach to estimate water usage without directly interfacing with the water line. Instead, it utilizes a device that indirectly gauges water consumption by monitoring the position of the tap handle after it is rotated or moved. The setup process for this device is straightforward, as it doesn’t require any modifications to the existing water infrastructure. The system, known as ”Sensible Flow,” employs a sensor node consisting of an inertial Measurement Unit (IMU) to track and analyze the movement and position of the tap handle. To ensure accurate readings, the device is initially calibrated using a flow rate sensor or through manual measurement with a known-volume beaker. Once the flow rate is inferred based on the tap handle position, the data is transmitted via Bluetooth Low Energy (BLE) to a base gateway unit. This base unit provides real-time updates on water consumption and can also be configured to send the collected data to the cloud via WiFi, enabling further analysis and monitoring. Extensive testing has been conducted to evaluate the device’s accuracy and performance. The Sensible Flow system provides a cost-effective and non-intrusive solution for estimating water usage, with potential applications in water conservation and management.

Abstract

In this paper, we propose MolOpt, the first attempt of its kind to use Multi-Agent Reinforcement Learning (MARL) for autonomous molecular geometry optimization (MGO). Typically MGO algorithms are hand-designed, but MolOpt uses MARL to learn a learned optimizer (policy) that can perform MGO without depending on other hand-designed optimizers. We cast MGO as a MARL problem, where each agent corresponds to a single atom in the molecule. MolOpt performs MGO by minimizing the forces on each atom in the molecule. Our experiments demonstrate the generalizing ability of MolOpt for MGO of Propane, Pentane, Heptane, Hexane, and Octane when trained on Ethane, Butane, and Isobutane. In terms of performance, MolOpt outperforms the MDMin optimizer and demonstrates similar performance to the FIRE optimizer. However, it does not surpass the BFGS optimizer. The results demonstrate that MolOpt has the potential to introduce innovative advancements in MGO by providing a novel approach using reinforcement learning (RL), which may open up new research directions for MGO. Overall, this work serves as a proof-of-concept for the potential of MARL in MGO.

Abstract

Air pollution due to industrial activity, vehicles, and construction has shown immediate and long-term effects on human health. While respiratory condition manifests directly, long-term conditions like heart diseases, cancer, lung damage, and the impact on fetal health have been established. This study is aimed to explore the effects of air pollution on the physiological health of humans using a smart wearable watch. A total of 8 healthy security guards posted at the institute gate close to a very busy traffic junction for 12 hours a day were recruited. The physiological indicators such as heart rate (HR), body temperature (BT), and SPO2 levels were recorded by the wearable device for changes during the day/night for two seasons (summer and winter). Air pollution monitoring sensors were also deployed at the same site to record PM2.5, PM10, relative humidity (RH), and environmental temperature (ENT). A survey of 43 questions under three different sections: demographic, medical condition, and quality of life (QoL) were also filled by each participant. Descriptive statistics and inferential statistical analysis (Wilcoxon, Correlation) have been presented based on the collected data. The research shows an association between short-term fluctuations in physiological parameters due to air pollution. Still, the findings need to be weighted with the accuracy and consistency of the wearable devices.

Abstract

This paper proposes a low-power relaxation oscillator for low-power high-temperature IoT systems. It generates a 959 Hz clock signal from −40 to 170°C, consuming 6.75 nW at 0.65 V. A proposed switch-leakage compensation scheme nullifies the effects of body diode and subthreshold leakages on oscillator output frequency at high temperatures, thereby obtaining a wide operating temperature range. The oscillator implemented in a 180 nm CMOS process achieves a temperature coefficient of 40 ppm/°C from −40 to 170 °C at 0.65 V and a line sensitivity of 0.5 %/V from 0.65 to 2.4 V at room temperature, in simulation. Compared with state-of-the-art sub- μW oscillators, this circuit obtains the highest operating temperature and the maximum temperature range.

Abstract

We identify a family of binary codes whose structure is similar to Reed-Muller (RM) codes and which include RM codes as a strict subclass. The codes in this family are denoted as Cn(r,m) , and their duals are denoted as Bn(r,m) . The length of these codes is nm , where n≥2 , and r is their ‘order’. When n=2 , Cn(r,m) is the RM code of order r and length 2m . The special case of these codes corresponding to n being an odd prime was studied by Berman (1967) and Blackmore and Norton (2001). Following the terminology introduced by Blackmore and Norton, we refer to Bn(r,m) as the Berman code and Cn(r,m) as the dual Berman code. We identify these codes using a recursive Plotkin-like construction, and we show that these codes have a rich automorphism group, they are generated by the minimum weight codewords, and that they can be decoded up to half the minimum distance efficiently. Using a result of Kumar et al. (2016), we show that these codes achieve the capacity of the binary erasure channel (BEC) under bit-MAP decoding. Furthermore, except double transitivity, they satisfy all the code properties used by Reeves and Pfister to show that RM codes achieve the capacity of binary-input memoryless symmetric channels. Finally, when n is odd, we identify a large class of abelian codes that includes Bn(r,m) and Cn(r,m) and which achieves BEC capacity.

Abstract

We consider the standard broadcast setup with a single server broadcasting information to a number of clients, each of which contains local storage (called cache ) of some size, which can store some parts of the available files at the server. The centralized coded caching framework, consists of a caching phase and a delivery phase, both of which are carefully designed in order to use the cache and the channel together optimally. In prior literature, various combinatorial structures have been used to construct coded caching schemes. One of the chief drawbacks of many of these existing constructions is the large subpacketization level, which denotes the number of times a file should be split for the schemes to provide coding gain. In this work, using a new binary matrix model, we present several novel constructions for coded caching based on the various types of combinatorial designs and their q -analogs, which are also called subspace designs. While most of the schemes constructed in this work (based on existing designs) have a high cache requirement, they provide a rate that is either constant or decreasing, and moreover require competitively small levels of subpacketization, which is an extremely important feature in practical applications of coded caching. We also apply our constructions to the distributed computing framework of MapReduce, which consists of three phases, the Map phase, the Shuffle phase and the Reduce phase. Using our binary matrix framework, we present a new simple generic coded data shuffling scheme. Employing our designs-based constructions in conjunction with this new shuffling scheme, we obtain new coded computing schemes which have low file complexity, with marginally higher communication load compared to the optimal scheme for equivalent parameters. We show that our schemes can neatly extend to the scenario with full and partial stragglers also.