Abstract

Monuments were built for thousands of years as the most enduring and well-known representations of past civilizations. It is crucial to preserve these because they are national symbols with unique cultural and historical significance. The deterioration of the structures happens as a result of weathering, fire, natural disasters like earthquakes, construction flaws, and numerous other factors. In general, the issue with repairing and reinforcing regular buildings is very different from the issue with restoring monument buildings. The goal of keeping a monumental structure in use may be viewed as secondary in importance and any event as a result of the effort made to fulfil the main task. In the case of monumental buildings, emphasis is placed on the preservation of their aesthetic and historical aspects. Therefore, the restoration strives to protect and highlight the monument’s or building’s aesthetic and historical aspects. Choosing the appropriate material for the restoration depends on how the original structure looks. New materials must be compatible with those already used in the building. The goal of the present study is to provide an overview of the materials used to restore the structural integrity of historic structures and monuments that have been damaged by seismic activity. All of these buildings need extra attention because of their specific historical or architectural value, or because they are significant because they are still standing examples of a former way of life.

Abstract

Masonry structures cover a very wide range of monumental works in space and time, covering almost 6,000 years. The structural assessment of the load-carrying capacity of such old structures depends on several parameters such as: (a) material strength; (b) texture of the structure; (c) geometrical form and dimensions; (d) existing loading and constraints; and (e) expected loadings at failure. Detailed calculations are also required for the structural evaluation using most of the above parameters firstly by considering the gravity loads and secondly by the combination of gravity load and lateral action in areas of high seismicity. However, at the same time, it is equally significant for the structural engineer, who is involved in structural restoration design, to know in depth qualitatively the basic forms and their structural behaviour of monumental buildings. The structural engineer in charge must understand from the beginning, qualitatively, the structural behaviour of a building under consideration to various basic actions so that one can make a preliminary diagnosis of the causes that are responsible for the existing damages (cracks, drifts, settlements, splitting etc.). In this way, one will be in a position to focus on the detailed research, in situ and laboratory, to the critical points of the building, and can conduct the analysis and design using suitable models for a credible safety evaluation. Therefore, an effort is made in the present study to give a qualitative approach to the structural behaviour of the basic structural forms of masonry monumental and historical buildings, where the consequences of the seismic action are traumatic now and then. This article gives an outline and creates background information for further structural evaluation of the monuments.

Abstract

Data visualization is key to representing data effectively, especially in large multidimensional datasets. In this paper, we extend the BEADS i.e. breaking cluster into chunks of points and represent each chunk as bead. We do this to study the underlying pattern i.e. shape, size and location of the clusters and visualize them in a manner in which the users understand the distribution of the data points. BEADS cluster visualization system is implemented to represent the high-dimensional shape of a cluster by using standard two-dimensional structures like squares and circles as metaphors. This is achieved by subdividing clusters into smaller chunks, or "beads," using the K-means algorithm and optimizing the lp-norm value to determine the most suitable shape for each bead. The visualization helps comprehend the shape, size and overall placement of clusters in high dimensions. Future work involves finding the best number of beads for each cluster individually and improving the efficiency to speed up the process for large datasets. Instead of K-mean, any other appropriate partitioning algorithm could be used at the user's discretion.

Abstract

The Śabdabrahman exercise platform (SBE), at sabdabrahman.org, is an on-line interactive Sanskrit instructional platform that offers immediate feedback and focused help to students at every step of analyzing and translating the Sanskrit sentences in a first-year Sanskrit textbook. Steps include transliteration from Devanagari to standard Romanization and vice versa, analysis of sandhi, identification of nominal and verbal inflection, syntax, compound analysis, and translation. Student submission at each step is evaluated, errors highlighted, and links supplied to relevant help. Source documents are prepared in XML in accordance with the Text-Encoding Initiative guidelines. The platform is coded in Flask and ReactJS and hosted at Amazon Web Services (AWS). The platform has been successfully used in first-year Sanskrit courses offered through The Sanskrit Library (sanskritlibrary.org).

Abstract

Today, in the post-industrial society, the data created by computers and the internet are becoming a new ‘means of production’. With this, there is a new- found realisation on the question of its ownership, distribution and protection. The question of accessibility in this regard is also becoming a crucial issue in democratic political systems. Internet and data have led to epistemological changes such that new rights for citizens are required with an overhaul of democratic processes founded in digital methods. It will definitely have its own challenges, limitations and possibilities. As data protection bills are now being introduced in many countries of the world, it is important to analyse the key theoretical nuances in the data ownership discourse. In this regard, this article attempts to highlight these nuances along with the scope for new public policy frameworks required in the domain of data ownership, distribution and protection.

Abstract

This paper considers the contextual multi-armed bandit (CMAB) problem with fairness and privacy guarantees in a federated environment. We consider merit-based exposure as the desired fair outcome, which provides exposure to each action in proportion to the reward associated. We model the algorithm's effectiveness using fairness regret, which captures the difference between fair optimal policy and the policy output by the algorithm. Applying fair CMAB algorithm to each agent individually leads to fairness regret linear in the number of agents. We propose that collaborative -- federated learning can be more effective and provide the algorithm Fed-FairX-LinUCB that also ensures differential privacy. The primary challenge in extending the existing privacy framework is designing the communication protocol for communicating required information across agents. A naive protocol can either lead to weaker privacy guarantees or higher regret. We design a novel communication protocol that allows for (i) Sub-linear theoretical bounds on fairness regret for Fed-FairX-LinUCB and comparable bounds for the private counterpart, Priv-FairX-LinUCB (relative to single-agent learning), (ii) Effective use of privacy budget in Priv-FairX-LinUCB. We demonstrate the efficacy of our proposed algorithm with extensive simulations-based experiments. We show that both Fed-FairX-LinUCB and Priv-FairX-LinUCB achieve near-optimal fairness regret.

Abstract

Restless multi-armed bandits (RMABs) generalize the multi-armed bandits where each arm exhibits Markovian behavior and transitions according to their transition dynamics. Solutions to RMAB exist for both offline and online cases. However, they do not consider the distribution of pulls among the arms. Studies have shown that optimal policies lead to unfairness, where some arms are not exposed enough. Existing works in fairness in RMABs focus heavily on the offline case, which diminishes their application in real-world scenarios where the environment is largely unknown. In the online scenario, we propose the first fair RMAB framework, where each arm receives pulls in proportion to its merit. We define the merit of an arm as a function of its stationary reward distribution. We prove that our algorithm achieves sublinear fairness regret in the single pull case , with being the total number of episodes. Empirically, we show that our algorithm performs well in the multi-pull scenario as well.

Abstract

Existing approaches to fairness in stochastic multi-armed bandits (MAB) primarily focus on exposure guarantee to individual arms. When arms are naturally grouped by certain attribute(s), we propose Bi-Level Fairness, which considers two levels of fairness. At the first level, Bi-Level Fairness guarantees a certain minimum exposure to each group. To address the unbalanced allocation of pulls to individual arms within a group, we consider meritocratic fairness at the second level, which ensures that each arm is pulled according to its merit within the group. Our work shows that we can adapt a UCB-based algorithm to achieve a Bi-Level Fairness by providing (i) anytime Group Exposure Fairness guarantees and (ii) ensuring individual-level Meritocratic Fairness within each group. We first show that one can decompose regret bounds into two components: (a) regret due to anytime group exposure fairness and (b) regret due to meritocratic fairness within each group. Our proposed algorithm BF-UCB balances these two regrets optimally to achieve the upper bound of on regret; being the stopping time. With the help of simulated experiments, we further show that BF-UCB achieves sub-linear regret; provides better group and individual exposure guarantees compared to existing algorithms; and does not result in a significant drop in reward with respect to UCB algorithm, which does not impose any fairness constraint.

Abstract

Dysarthria due to Amyotrophic Lateral Sclerosis (ALS) affects the acoustic characteristics of different speech sounds. The effects intensify with increasing severity leading to the collapse of the acoustic space of the affected individuals. With an aim to characterize such changes in the acoustic space, this paper studies the variations in band-specific and full-band spectral properties of 4 sustained vowels (/a/, /i/, /o/, /u/) and 3 sustained fricatives (/s/, /sh/, /f/) at different dysarthria severity levels. Effect of dysarthria on spectral features of these phonemes are not well explored. Statistical comparison of these features among different severities for the phonemes considered and among different vowels/fricatives for every severity level using speech data from 119 ALS and 40 healthy subjects indicate the followings. Though all band-specific and full-band features of the three fricatives and most of those features for the four vowels become statistically similar at high severity levels, certain features remain distinguishable. Spectral differences in 0-2 kHz band between /a/ and the other vowels and in the 2-6 kHz band between /a/ and /o/, /u/ persist through all severity levels. Moreover, properties of /f/ remain mostly unchanged with increasing dysarthria severity levels.

Abstract

: Gathering requirements for developing virtual reality (VR) software products is a labor-intensive process. It requires detailed elicitation of scene flow, articles in the scene, action responses, custom behaviors, and timeline of events. The slightest change in requirements will escalate the design and development costs. While most VR practitioners depend on conventional software engineering (SE) requirement-gathering techniques, there is a need for novel methods to streamline VR software development. With severe software platform fragmentation and hardware volatility, VR practitioners need assistance specifying non-volatile requirements for a minimum viable VR software product.