Abstract

Modern System on Chip (SoC) seeks multiple LDOs to provide regulated supply to its different peripherals. However, distributed LDOs across the chip increase power consumption and at the same time, each driver requires a separate transient detection block to reduce the undershoot/overshoot, increasing the area. The work presents a viable solution to tackle such issues by proposing a Multi-loop LDO that uses distributed Flipped Voltage Follower (FVF) drivers. The topology presents one central unit common to every distributed FVF driver across the chip that acts as a global loop, whereas each FVF loop serves as a fast local loop. The proposed power grid structure reduces the overshoot/undershoot voltage without adding additional transient detection schemes. The work depicts design and simulation results to validate the proposed idea with four distributed drivers in 180 nm TSMC node. Simulation results show that the proposed technique helps reduce the droop voltage by more than 40% compared to conventional structures without increasing the design complexity.

Abstract

Personal Health Records (PHRs) allow patients to have full control over their health data. However, storage and sharing of PHRs still remains a difficult but necessary task, especially when health data is one of the major targets of cyber attacks worldwide. Searchable Encryption (SE) is a feasible solution for this problem and can be augmented by Blockchain to address some of its issues, such as verifiability. Therefore, SE using blockchain is a promising technologies to tackle the challenge of PHR storage and sharing. In this survey, we have explored the research works that use SE and blockchain technology for the same. The work starts with an introduction of cloud, searchable encryption and blockchain. Subsequently, we present a literature survey of the corresponding technologies. We then describe SE in detail and how it fits with blockchain. This is followed by description of noteworthy existing solutions for secure storage and sharing of PHRs. Even though there have been a number of surveys related to SE, none of them have surveyed the use of blockchain with SE or use of SE and blockchain in PHR sharing. The work concludes with a comparative study of these existing solutions and future scope in this direction. KEYWORDS: Searchable encryption, Blockchain, Cloud computing, Personal Health Records (PHRs), Storage, Security

Abstract

Secure storage and sharing of Personal Health Records (PHRs) in Internet of Medical Things (IoMT) is one of the significant challenges in the healthcare ecosystem. Due to the high value of personal health information, PHRs are one of the favourite targets of cyber attackers worldwide. Over the years, many solutions have been proposed; however, most solutions are inefficient for practical applications. For instance, several existing schemes rely on the bilinear pairings, which incur high computational costs. To mitigate these issues, we propose a novel PHR-sharing scheme that is dynamic, efficient, and practical. Specifically, we combine searchable symmetric encryption, blockchain technology and a decentralized storage system, known as Inter-Planetary File System (IPFS) to guarantee confidentiality of PHRs, verifiability of search results, and forward security. Moreover, we provide formal security proofs for the proposed scheme. Finally, we have conducted extensive test-bed experiments and the results demonstrate that the proposed scheme can be used in practical scenarios related to IoMT environment.

Abstract

Abstract Working from home (WFH) is a new reality and norm in today’s work culture. COVID-induced lockdown introduced the concept of WFH for many people. Blurring home and workplace boundaries was a prominent cause of disorientation in people’s lives. Hence, WFH becomes a signifcant phenomenon to explore as it raises the fundamental question of body and space in shaping people’s experiences. To study this, the researchers designed a phenomenological inquiry and examined the lived phenomenon of WFH during the COVID lockdown. Borrowing theoretical concepts from philosophers Martin Heidegger and Merleau-Ponty, they aimed to understand human experiences from an embodied perspective. They interviewed a few adults (age group 27–50) in three urban Indian cities during the frst phase of the COVID-19 lockdown. The participants’ experiences were transcribed, and Interpretative Phenomenological Analysis (IPA) was conducted. The IPA themes highlighted their varied lived experiences and lifeworld, such as distractions in working from home, their changed routines, habits, and social interaction. The fndings are discussed through phenomenological psychology concepts such as embodied cognition, body memory, extended self, shared empathy, intersubjectivity and prerefective bodily intelligence in coping. The study’s contribution is that it advances a methodological understanding by interpreting people’s experiences from a phenomenological view of being-in-the-world in which the individual is not an isolated

Abstract

The default approach to deal with the enormous size and lim- ited accessibility of many Web and social media networks is to sample one or more subnetworks from a conceptually unbounded unknown network. Clearly, the extracted subnet- works will crucially depend on the sampling scheme. Mo- tivated by studies of homophily and opinion formation, we propose a variant of snowball sampling designed to priori- tize inclusion of entire cohesive communities rather than any kind of representativeness, breadth, or depth of coverage. The method is illustrated on a concrete example, and experiments on synthetic networks suggest that it behaves as desired.

Abstract

The burdensome impact of a skewed judges-to-cases ratio on the judicial system manifests in an overwhelming backlog of pending cases alongside an ongoing influx of new ones. To tackle this issue and expedite the judicial process, the proposition of an automated system capable of suggesting case outcomes based on factual evidence and precedent from past cases gains significance. This research paper centres on developing a graph neural network-based model to address the Legal Judgment Prediction (LJP) problem, recognizing the intrinsic graph structure of judicial cases and making it a binary node classification problem. We explored various embeddings as model features, while nodes such as time nodes and judicial acts were added and pruned to evaluate the model's performance. The study is done while considering the ethical dimension of fairness in these predictions, considering gender and name biases. A link prediction task is also conducted to assess the model's proficiency in anticipating connections between two specified nodes. By harnessing the capabilities of graph neural networks and incorporating fairness analyses, this research aims to contribute insights towards streamlining the adjudication process, enhancing judicial efficiency, and fostering a more equitable legal landscape, ultimately alleviating the strain imposed by mounting case backlogs. Our best-performing model with XLNet pre-trained embeddings as its features gives the macro F1 score of 75% for the LJP task. For link prediction, the same set of features is the best performing giving ROC of more than 80%

Abstract

Criticality, observed during second-order phase transitions, is an emergent phenomenon. The brain operates near criticality where complex systems exhibit high correlations. As a system approaches criticality, it develops “domain”-like regions with competing phases and increased spatio-temporal correlations that diverge. The dynamics of these domains depend on the system’s proximity to criticality. This study explores the differences in the proximity to criticality of Alzheimer’s-afflicted and cognitively normal brains through the use of a spin-lattice model derived from resting-state fMRI data and investigates the type of criticality found in the human brain - whether it is of the Ising class or something more complex. The autocorrelation relaxation time in both groups displays a stretched exponential nature, indicating closer alignment with the criticality of the spin-glass class rather than the Ising class. Longer relaxation times observed in cognitively normal subjects suggest increased proximity to the phase boundary. The weak distinction observed in the spatial characteristics related to proximity to criticality might once more point to a spin-glass scenario, necessitating nuanced order parameters to distinguish between phase-ordering in Alzheimer’s and cognitively normal brains.

Abstract

Accurate localization of sound sources is essential in many acoustic sensing and monitoring applications. In the absence of temporal continuity models, many methods produce unrealistic direction of arrival (DOA) estimates involving sudden changes. To address this, we propose an approach that trains a neural network to predict DOA derivatives in Cartesian coordi- nates (x′, y′, z′), which capture the rate of change in DOA (x, y, z) over time. By combining the predicted DOAs with the predicted derivatives, our method can suppress sudden DOA changes and generate smooth motion trajectories. We introduce an update rule that combines the predicted DOAs with the predicted derivatives to obtain the final DOAs. We validate our approach using the TAU-NIGENS Spatial Sound Events (TNSSE) 2021 dataset. Our results demonstrate that incorporating DOA derivatives improves the accuracy of DOA estimation, particularly in low signal-to- noise ratio scenarios

Abstract

The RSU(Road-Side Unit)-assisted computation offloading allows vehicles to use the RSU’s compute resources to provide connected services which cannot be done due to on-board resource limitations. We propose the empirical analysis framework that can systematically characterize such RSU’s compute workloads. We first formalize the relationship of the three aspects: the local load (generated from vehicles), the composite load (imposed on RSUs) and the traffic flow (mobility patterns of vehicles). Then, our framework takes the models of the local load and the traffic flow as input, and produces the RSUs’ composite loads as an output. We provide the quantitative analysis to show how the RSU’s composite loads change in varying traffic flows in some areas of New York City with different offload patterns.

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.