Abstract

Worldover, seismic design of buildings typically follows a prescriptive approach in which designers conform to a series of prescriptive code requirements in terms of both analysis and design procedures. Even though this prescriptive seismic design approach is time-tested and easily understandable by structural designers. In the recent past, performance-based seismic design has started to gain traction among structural designers. The performance-based seismic design allows designers to set performance objectives and design buildings to meet the targeted performance criteria. Due to its flexible nature, performance-based design has proven extremely useful for critical and lifeline buildings like hospitals and tall buildings. With a focus placed on performance objectives, designers utilizing performance-based seismic design are proficient in designing code exceeding buildings efficiently. Despite these cited benefits, performance-based design is still considered an uncommon practice in structural design, particularly in the developing countries. Hence, the present study aims to provide an overview and framework to practice performance-based seismic design. This work identifies and discusses the key differences between the prescriptive- and performance-based seismic design methods and also addresses the significance, application and implementation of performance-based seismic design of buildings. This paper makes an original contribution to the literature through a critical review of how the performance-based design withholds the opportunity to elevate the role of the structural engineers to which they are informed members of the community, where the structures they create not only perform according to design prescriptions, but also perform according to the needs of the owners, engineers, and society.

Abstract

Carbon monoxide (CO) and Nitrogen dioxide (NO 2 ) are major air pollutants that have the potential to affect human health adversely. There is a lack of useful information regarding the spatial distribution and temporal variability of CO and NO 2 emissions in major metropolitan areas. The primary goal of this research is to provide a geospatial data methodology for detecting emission spikes of CO and NO 2 in polluted urban environments employing portable low-cost sensors. We propose that ephemeral identification of harmful gas concentrations can be achieved using different IoT device types mounted on a mobile platform. We propose that persistent identification of the CO and NO 2 emission spikes can be attained by driving through the city on different days. We applied this approach to Hyderabad, India, by fixing a mobile platform on a street car. We corrected the IoT device measurement errors by calibrating

Abstract

The direction of arrival (DOA) estimation algorithms are crucial in localizing acoustic sources. Traditional localization methods rely on block-level processing to extract the directional information from multiple measurements processed together. However, these methods assume that DOA remains constant throughout the block, which may not be true in practical scenarios. Also, the performance of localization methods is limited when the true parameters do not lie on the parameter search grid. In this paper we propose two trajectory models, namely the polynomial and bandlimited trajectory models, to capture the DOA dynamics. To estimate trajectory parameters, we adopt two gridless algorithms: i) Sliding Frank-Wolfe (SFW), which solves the Beurling LASSO problem and ii) Newtonized Orthogonal Matching Pursuit (NOMP), which improves over OMP using cyclic refinement. Furthermore, we extend our analysis to include wideband processing. The simulation results indicate that the proposed trajectory localization algorithms exhibit improved performance compared to grid-based methods in terms of resolution, robustness to noise, and computational efficiency.

Abstract

This paper focuses on optimal beamforming to maximize the mean signal-to-noise ratio (SNR) for a reconfigurable intelligent surface (RIS)-aided MISO downlink system under correlated Rician fading. The beamforming problem becomes non-convex because of the unit modulus constraint of passive RIS elements. To tackle this, we propose a semidefinite relaxation-based iterative algorithm for obtaining statistically optimal transmit beamforming vector and RIS-phase shift matrix. Further, we analyze the outage probability (OP) and ergodic capacity (EC) to measure the performance of the proposed beamforming scheme. Just like the existing works, the OP and EC evaluations rely on the numerical computation of the iterative algorithm, which does not clearly reveal the functional dependence of system performance on key parameters. Therefore, we derive closed-form expressions for the optimal beamforming vector

Abstract

Finding the centrality measures of nodes in a graph is a problem of fundamental importance due to various applications from social networks, biological networks, and transportation networks. Given the large size of such graphs, it is natural to use parallelism as a recourse. Several studies show how to compute the various centrality measures of nodes in a graph on parallel architectures, including multi‐core systems and GPUs. However, as these graphs evolve and change, it is pertinent to study how to update the centrality measures on changes to the underlying graph. In this article, we show novel parallel algorithms for updating the betweenness‐ and closeness‐centrality values of nodes in a dynamic graph. Our algorithms process a batch of updates in parallel by extending the approach of handling a single update for betweenness‐ and closeness‐centrality. For the latter, we also introduce techniques based on

Abstract

This work presents a thermoelectric vibration and buckling behaviour of a bidirectional functionally graded piezoelectric porous (BD-FGPP) plate resting on the elastic foundation with arbitrary boundary conditions. The variation of the material properties in the FGPP plate is bidirectional, ie, along longitudinal and thickness directions, using the modified power law distributions. Also, the BD-FGPP plate carries various porosity distributions, ie, even, uneven, and symmetric center types. The governing equation of the FGPP plate has been obtained through Hamilton’s principle and solved through a higher-order finite element approach. The correctness and usefulness of the current technique are confirmed and compared with existing model outcomes available in the literature. A comprehensive parametric study has investigated the effect of the elastic foundations, porous exponent with various porosity distributions

Abstract

We investigate the dynamical aspects of the quantum switch and find a particular form of quantum memory emerging out of the switch action. We first analyse the loss of information in a general quantum evolution subjected to a quantum switch and propose a measure to quantify the switch-induced memory. We then derive an uncertainty relation between information loss and switch-induced memory. We explicitly consider the example of depolarising dynamics and show how it is affected by the action of a quantum switch. For a more detailed analysis, we consider both the control qubit and the final measurement on the control qubit as noisy and investigate the said uncertainty relation. Further, while deriving the Lindblad-type dynamics for the reduced operation of the switch action, we identify that the switch-induced memory actually leads to the emergence of non-Markovianity. Interestingly, we demonstrate that the emergent non-Markovianity can be explicitly attributed to the switch operation by comparing it with other standard measures of non-Markovianity. Our investigation thus paves the way forward to understanding the quantum switch as an emerging non-Markovian quantum memory.

Abstract

As quantum theory allows for information processing and computing tasks that otherwise are not possible with classical systems, there is a need and use of quantum Internet beyond existing network systems. At the same time, the realization of a desirably functional quantum Internet is hindered by fundamental and practical challenges such as high loss during transmission of quantum systems, decoherence due to interaction with the environment, fragility of quantum states, etc. We study the implications of these constraints by analyzing the limitations on the scaling and robustness of quantum Internet. Considering quantum networks, we present practical bottlenecks for secure communication, delegated computing, and resource distribution among end nodes. Motivated by the power of abstraction in graph theory (in association with quantum information theory), we consider graph-theoretic quantifiers to assess network robustness and provide critical values of communication lines for viable communication over quantum Internet. In particular, we begin by discussing limitations on usefulness of isotropic states as device-independent quantum key repeaters which otherwise could be useful for device-independent quantum key distribution. We consider some quantum networks of practical interest, ranging from satellite-based networks connecting far-off spatial locations to currently available quantum processor architectures within computers, and analyze their robustness to perform quantum information processing tasks. Some of these tasks form primitives for delegated quantum computing, e.g., entanglement distribution and quantum teleportation.

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

Computing binding affinities is of great importance in drug discovery pipeline and its prediction using advanced machine learning methods still remains a major challenge as the existing datasets and models do not consider the dynamic features of protein-ligand interactions. To this end, we have developed PLAS-20k dataset, an extension of previously developed PLAS-5k, with 97,500 independent simulations on a total of 19,500 different protein-ligand complexes. Our results show good correlation with the available experimental values, performing better than docking scores. This holds true even for a subset of ligands that follows Lipinski’s rule, and for diverse clusters of complex structures, thereby highlighting the importance of PLAS-20k dataset in developing new ML models. Along with this, our dataset is also beneficial in classifying strong and weak binders compared to docking. Further, OnionNet model has been retrained on PLAS-20k dataset and is provided as a baseline for the prediction of binding affinities. We believe that large-scale MD-based datasets along with trajectories will form new synergy, paving the way for accelerating drug discovery.