Abstract

Buildings on hill slopes are highly vulnerable due to its less resistive lateral load capacity. This type of buildings are unsymmetrical and are of in irregular configuration. There are variations in the column height which gives eccentricity to the structure as the center of mass and center of rigidity doesn’t coincide. This irregularity leads to its torsional behavior and gives us the necessity for analyzing these buildings for its base conditions and its behavior by changing its plan configuration. This paper contain the calculation of Twist which is an effective parameter to decide the behavior of the building, Axial forces on the members that can lead to collapse in the structure and about the twist variation with change in the aspect ratio so that we can know the suitability of the configuration of the building. The building on hill slopes does not behave similar to the buildings which are on plane ground. Change in the Aspect ratio means changing the length of the building in ridge direction. Changing the length in valley direction will disturb the load path of gravity load for each and every change in the structure and after some increment of the length in valley direction will fail the structure for its gravity load path. So we can’t play with the length of the building along the valley direction but changing the length along ridge direction does not effect that much to the load path of gravity load and we can obtain a best aspect ratio of the structure for that region. Keywords: Twist, Axial forces, Slope of the ground

Abstract

Residensial Energy electricity

Abstract

A corpus of Hindi news headlines shared on Twitter was created by collecting tweets of 5 mainstream Hindi news sources for a period of 4 months. 7 independent annotators were recruited to mark the 20 most retweeted news posts by each of the 5 news sources on its clickbait nature. The clickbait score hence generated was assessed for its correlation with interactions on the platform (retweets, favorites, reader replies), tweet word count, and normalized POS (part-of-speech) tag counts in tweets. A positive correlation was observed between readers’ interactions with tweets and tweets’ clickbait score. Significant correlations were also observed for POS tag counts and clickbait score. The prevalence of clickbait in mainstream Hindi news media was found to be similar to its prevalence in English news media. We hope that our observations would provide a platform for discussions on clickbait in mainstream Hindi news media.

Abstract

In this endeavour, a new adaptive-robust control framework is devised for tracking control problem of a class of uncertain systems having state-dependent uncertainty and under the influence of time-varying input delay. In comparison to the existing adaptive-robust control (ARC) strategies, the proposed ARC framework removes the conservative assumption of a priori bounded uncertainty. In addition, the Razumikhin theorem based stability analysis allows the proposed scheme to deal with arbitrary variation in input delay. The effectiveness of the proposed ARC is verified via simulations and via experimentations using a wheeled mobile robot demonstrating improved tracking accuracy compared to the state of the art. Keywords: Adaptive-robust control, Input delay, Razumikhin theorem, State-dependent uncertainty, Wheeled mobile robot

Abstract

Buildings damaged in past earthquakes have exemplified the poor performance of reinforced concrete moment resisting frame (RC MRF) buildings due to inadequate design and wrong construction practices. The only way to avoid damage to existing buildings is to retrofit them. There is a large stock of RC MRF buildings constructed as per old Indian standards. With the latest revisions in codal provisions, these buildings are considered to be inadequately designed. Therefore, a large stock of existing buildings needs to be retrofitted. However, retrofitting of houses is not a common practice among the general public in India. To encourage retrofitting among the general public, the efficacy of retrofitting needs to be proven with the well-laid process. In this paper, a case study is done to understand the performance of G+5 storey RC MRF precode building after partial and full column retrofitting. Pushover Analysis (POA) is performed to obtain the capacity of the precode building. The capacity is compared with the seismic demand of that area to decide whether retrofitting is required or not. Initially, ground storey columns are retrofitted and POA is performed to study the damage distribution and obtain the updated capacity curve. It is observed that damage shifted to the first storey. Further, the first storey columns are retrofitted and POA is performed again. From the hinge mechanism, it is observed that the damage propagated to the second storey. Further, the second storey columns are retrofitted and POA is performed again to obtain updated capacity and

Abstract

Buildings damaged in past earthquakes have exemplified the poor performance of reinforced concrete moment resisting frame (RC MRF) buildings due to inadequate design and wrong construction practices. The only way to avoid damage to existing buildings is to retrofit them. There is a large stock of RC MRF buildings constructed as per old Indian standards. With the latest revisions in codal provisions, these buildings are considered to be inadequately designed. Therefore, a large stock of existing buildings needs to be retrofitted. However, retrofitting of houses is not a common practice among the general public in India. To encourage retrofitting among the general public, the efficacy of retrofitting needs to be proven with the well-laid process. In this paper, a case study is done to understand the performance of G+5 storey RC MRF precode building after partial and full column retrofitting. Pushover Analysis (POA) is performed to obtain the capacity of the precode building. The capacity is compared with the seismic demand of that area to decide whether retrofitting is required or not. Initially, ground storey columns are retrofitted and POA is performed to study the damage distribution and obtain the updated capacity curve. It is observed that damage shifted to the first storey. Further, the first storey columns are retrofitted and POA is performed again. From the hinge mechanism, it is observed that the damage propagated to the second storey. Further, the second storey columns are retrofitted and POA is performed again to obtain updated capacity and

Abstract

Estimating the time, location and the size of an earthquake event using neural networks is an emerging technology. Present study aims to predict the near future earthquake events in each of the regions partitioned as clusters of epi-central locations of earthquakes related to Indian subcontinent. K-means clustering algorithm is applied to develop a catalogue of earthquake epicenters. Two approaches are considered for the purpose of forecasting. In the first approach regions obtained as clusters are considered as the area sources. The distribution of time series of (temporal distribution) events are divided into five time periods viz., 15 days, 30 days, 60 days, 90 days and 180 days. The accuracy of forecasting a magnitude for the next time period is studied using application of Recurrent Neural Network In the second approach the seismic data of each cluster is further grouped into three categories of magnitude viz., minor (≤ 4 Mw), moderate (between 4 Mw and 6 Mw) and strong (> 6 Mw). Accuracy of forecasting for each of the group belonging to the clusters is computed considering the same five time periods. The epicentral locations represented as latitude and longitude is the inputs for recurrent neural network. The results show that accuracy of second approach is significantly more than first approach. Finally, an attempt has been made to compare the accuracy level of Recurrent Neural Network method with the accuracy level of Gutenberg Richter law in predicting the earthquakes for future 60 days. It has been observed that Gutenberg-Richter law poorly forecasts near future earthquake.

Abstract

An extensive research of MPC protocols in different adversarial settings over the past few years has led to various improvements in this domain. Goyal et al.[14] in their paper addressed the issue of an efficient MPC protocol in active adversarial setting by removing the dependency on multiplication depth Dm in the arithmetic circuit. This development was followed by Hirt et al.[16] which proposed an efficient MPC protocol tolerating mixed adversary with communication complexity of O ((ci+ cm+ co) nκ+ ciBA (κ)+ Dm (n3κ+ nBA (κ))) bits, where Dm is the multiplicative depth of the circuit and κ is the size of an element in the field. Additionally, Hirt et al.[16], proposed an open problem to construct a protocol for the mixed adversarial setting, independent of the multiplicative depth Dm, with linear communication complexity. In this paper, we resolve this problem in the affirmative by providing an efficient MPC protocol in the mixed adversarial setting independent of the multiplicative depth of the circuit.

Abstract

Locally recoverable codes (LRCs) are known to reduce the repair locality, i.e., the number of nodes accessed during node repair, in distributed storage systems. Regenerating codes, on the other hand, offer a decreased repair bandwidth, which is the repair traffic incurred during node repairs. Locally regenerating codes (LRGCs), which are constructed via intertwining regenerating codes of smaller block lengths, simultaneously offer a small repair locality and repair bandwidth. In this letter, we construct a family of LRGCs where the constituent codes are bandwidth-efficient, minimum bandwidth cooperative regenerating codes. The newly constructed LRGCs are optimal with respect to both minimum distance and rate.

Abstract

In distributed storage systems, cooperative regenerating codes tradeoff storage for repair bandwidth in the case of multiple node failures. In rack-aware distributed storage systems, there is no cost associated with transferring symbols within a rack. Hence, the repair bandwidth will only take into account cross-rack transfer. Rack-aware regenerating codes for the case of single node failures have been studied and their repair bandwidth tradeoff characterized. In this paper, we consider the framework of rack-aware cooperative regenerating codes for the case of multiple node failures where the node failures are uniformly distributed among a certain number of racks. We characterize the storage repair-bandwidth tradeoff as well as derive the minimum storage and minimum repair bandwidth points of the tradeoff. We also provide constructions of minimum bandwidth rack-aware cooperative regenerating codes for all parameters.