Browse Items (11810 total)
Sort by:
-
Lateral Load Behavior of Unreinforced Masonry Spandrels
Spandrels, are usually classified as secondary elements and even though their behaviour has not received adequate focus unlike piers, they significantly affect the seismic capacity of the structure. Masonry spandrels are often damaged and the first structural components that crack within Unreinforced Masonry structures. Despite this, existing analytical methods typically consider a limit case in which the strength of spandrels is either neglected, considered to be infinitely rigid and strong or treated as rotated piers. It is clearly evident that such an assumption is not plausible. Hence, reliable predictive strength models are required. This thesis attempts to re-examine the flexural behaviour of spandrels and proposes an analytical model. The model is based on the interlocking phenomena of the joints at the end-sections of the spandrel and the contiguous masonry. The proposed analytical model is incorporated within a simplified approach to account for the influence of spandrel response on global capacity estimate of URM buildings. 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG. -
Curvature Ductility of Reinforced Masonry Walls and Reinforced Concrete Walls
Research conducted in this work proposes an equation to evaluate and compares the curvature ductility of reinforced masonry (RM) and reinforced concrete (RC) walls. The curvature ductilities are measured at varying levels of axial stresses for walls for aspect ratio (l/h) of 0.5, 1.0 and 1.5. The percentage of reinforcement is increased from 0.25% (minimum reinforcement for RC walls as per IS-13920) to 1.00%. The curvature ductilities are evaluated by plotting flexural strength (M) versus curvature (?) for the walls. The stressstrain curves of masonry, concrete and reinforcing steel are all adopted from existing literature. The compressive strength of masonry and concrete has been chosen as 10MPa and 25MPa, respectively. The yield strength of the steel is fixed as 415MPa. The height and thickness of the wall are 3000 and 230mm, respectively, and the length of the wall is varied to obtain different aspect ratios. Results obtained from this paper imply due to increase curvature ductility, RM walls provide a better alternative for the construction of structural walls compared to RC walls in regions of significant seismicity. 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. -
Idealised Bilinear Moment-Curvature Curves of Reinforced Masonry (RM) Walls
In this paper, an analytical investigation of the axial loadflexural strength interaction of reinforced masonry walls is carried. The curvature ductility of masonry walls is evaluated for walls with different modes of reinforcement configurations under different levels of axial loads. An analytical expression for evaluating the curvature ductility of masonry walls at varying axial loads is proposed in this paper. Value of curvature ductility obtained from the proposed expression is compared with existing methods. Results indicate the proposed model can be used to determine the ductility of reinforced masonry walls. 2020, Springer Nature Singapore Pte Ltd. -
A facile, green synthesis of carbon quantum dots from Polyalthia longifolia and its application for the selective detection of cadmium /
Dyes and Pigments, Vol.210, ISSN No: 0143-7208.
Carbon quantum dots (CQDs) has received world-wide recognition for their outstanding physicochemical properties that have the ability to substitute the semiconductor quantum dots. Herein, we have developed a strategy to determine the presence of Cd<sup>2+</sup> using CQDs as a fluorescence probe. The CQDs were synthesized from the leaves of <em>Polyalthia longifolia</em> (a natural source) through a one-step hydrothermal method. The CQDs obtained from <em>Polyalthia longifolia</em> (p-CQDs) was characterized using XRD, TEM, FTIR, Raman Spectroscopy, XPS Studies, UV–Visible spectroscopy and PL Spectroscopy. The p-CQDs displayed bright red fluorescence under the UV light, with good water solubility, and appreciable photostability and a quantum yield of 22%. The p-CQDs had a quasi-spherical morphology with an average particle size of 3.33 nm. -
Deducing Water Quality Index (WQI) by Comparative Supervised Machine Learning Regression Techniques for India Region
Water quality is of paramount importance for the wellbeing of the society at large. It plays avery important role in maintaining the health of the living being. Several attributes like biological oxygen demand (BOD), power of hydrogen (pH), dissolved oxygen (DO) content, nitrate content (NC) and so on help to identify the appropriateness of the water to be used for different purposes. In this research study, the focus is to deduce the Water Quality Index (WQI) by means of artificial intelligence (AI)-based machine learning (ML) models. Six parameters, namely BOD, DO, pH, NC, total coliform (CO) and electrical conductivity (EC) are used to measure, analyze and predict WQI using nine supervised regression machine learning techniques. Bayesian Ridge regression (BRR) and automatic relevance determination regression (ARD regression) yielded a low mean squared error (MSE) value when compared to other regression techniques. ARD regression model parameters as independent a priori so that non-zero coefficients do not exploit vectors that are not just sparse, but they are dependent. In the estimation process, BRR contains regularization parameters; regularization parameters are not set hard but are adjusted to the relevant data. Due to these reasons, ARD regression and BRR models performed better. 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. -
Twitter Hate Speech Detection using Stacked Weighted Ensemble (SWE) Model
Online Social Media has expanded the freedom of expression in the internet, which has become a disturbing problem if it has an impact on the situation or the interest of a country. Hate speech refers to the use of hostile, abusive or offensive language, directed at a certain group of people who share common property, whether it is their gender, ethnicity or race (i.e. racism), faith and religion. Therefore, auto detection of hate speeches has an increased importance in Online Social Media for filtering any message that has hatred language before posting it to the network. In this paper, a Stacked Weighted Ensemble (SWE) model is proposed for the detection of hate speeches. The model ensembles five standalone classifiers: Linear Regression, Nae Bayes', Random Forest, Hard Voting and Soft Voting. The experimental results on a Twitter dataset has shown an accuracy of 95.54% in binary classification of tweets into hateful speech and an improved performance is noted compared to the standalone classifiers. 2020 IEEE. -
Adaptive artificial bee colony (aabc)-based malignancy pre-diagnosis
Lung cancer is one of the leading causes of death. The survival rate of the patients diagnosed with lung cancer depends on the stage of the detection and the timely prognosis. Hence, early detection of anomalous malignant cells is needed for pre-diagnosis of lung cancer as it plays a major role in the prognosis and treatment. In this work, an innovative pre-diagnosis approach is suggested, wherein the size of the dataset comprising risk factors and symptoms is considerably decreased and optimized by means of an Adaptive Artificial Bee Colony (AABC) algorithm. Subsequently, the optimized dataset is fed to the Feed-Forward Back-Propagation Neural Network (FFBNN) to perform the training task. For the testing, supplementary data is furnished to well-guided FFBNN-AABC to authenticate whether the supplied investigational data is competent to effectively forecast the lung disorder or not. The results obtained show a considerable improvement in the classification performance compared to other approaches like Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2021. -
A comparative study of text mining algorithms for anomaly detection in online social networks
Text mining is a process by which information and patterns are extracted from textual data. Online Social Networks, which have attracted immense attention in recent years, produces enormous text data related to the human behaviours based on their interactions with each other. This data is intrinsically unstructured and ambiguous in nature. The data involves incorrect spellings and inaccurate grammars leading to lexical, syntactic and semantic ambiguities. This causes wrong analysis and inappropriate pattern identification. Various Text Mining approaches are being used by researchers which can help in Anomaly Detection through Topic Modeling, identification of Trending Topics, Hate Speeches and evolution of the communities in Online Social Networks. In this paper, a comparative analysis of the performance of four classification algorithms, Support Vector Machine (SVM), Rocchio, Decision Trees and K-Nearest Neighbour (KNN) for a Twitter data set is presented. The experimental study revealed that SVM outperforms better than other classifiers, and also classifies the dataset into anomalous and non-anomalous users opinions. The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2021. -
Self-supervised learning based anomaly detection in online social media
Online Social Media (OSM) produce enormous data related to the human behaviours based on their interactions. One such data is the opinions expressed and posted for any specific issue addressed in the OSM. Majority of the opinions posted would be categorized as positive, negative and neutral. The lighter group's opinions are termed anomalous as it is not conforming the regular opinions posted by other users. Though, lot of conventional classification and clustering based learning algorithms works well under supervised and un-supervised environment, due to the inherent ambiguity in the tweeted data, anomaly detection poses a bigger challenge in text mining. Though the data is un-supervised, for the learning purpose it is treated as Supervised Learning by assigning class labels for the training data. This paper attempts to give an insight into various anomalies of OSM and identify behavioural anomalies for a Twitter Dataset on user's opinions on demonetization policy in India. Through Self-Supervised learning, it is observed that 86% of the user's opinions did agree to the demonetization policy and the remaining have posted negative opinions for the policy implemented. 2020, Intelligent Network and Systems Society. -
Identification of misconceptions about corona outbreak using trigrams and weighted TF-IDF model
Misconceptions of a particular issue like health, diseases, politics, government policies, epidemics and pandemics have been a social issue for a number of years, particularly after the advent of social media, and often spread faster than true truth. The engagement with social media like Twitter being one of the most prominent news outlets continuing is a major source of information today, particularly the information distributed around the network. In this paper, the efficacy of Misconception Detection System was tested on Corona Pandemic Dataset extracted from Twitter posts. A Trigram and a weighted TF-IDF Model followed by a supervised classifier were used for categorizing the dataset into two classes: one with misconceptions about COVID-19 virus and the other comprising correct and authenticated information. Trigrams were more reliable as the functional words related to coronavirus appeared more frequently in the corpus created. The proposed system using a combination of trigrams and weighted TF-IDF gave relevant and a normalized score leading to an efficient creation of vector space model and this has yielded good performance results when compared with traditional approaches using Bag of Words and Count Vectorizer technique where the vector space model was created only through word count. 2020, Institute of Advanced Scientific Research, Inc. All rights reserved. -
A two-stepped feature engineering process for topic modeling using batchwise LDA with stochastic variational inference model
Online ratings and customer feedback on hotel booking websites support the decision-making process of the customer as the reviews provide a deeper understanding about all aspects of a hotel. Consequently, review and rating analyses are of great interest to consumers and hotel owners for the hotel related social media services. The key challenge, however, is to make the wide variety of information accessible in a simple, fast and relevant way and the solution is Topic Modelling and Opinion Mining. Common approaches like Latent Semantic Analysis (LSA) and Hierarchical Dirichlet Process (HDP) have order affects. If the input dataset is shuffled then different topics are generated leading to misleading results. To overcome this, a two-stepped feature engineering process is used: first step is to use a TF-IDF with modified trigrams calculation followed by the second step in removing weak features from the corpus thereby reducing the dimensionality of the Vector Space Model (SVM) for efficient Topic Modeling and sentiment analysis of the considered corpus. Sentiment score is calculated using VADER tool and Topic Modeling is done with Batch Wise Latent Dirichlet Allocation (LDA) using Stochastic Variational Inference (SVI) model. The modified trigrams included calculation of probabilities of words not only in the backward direction but also the probability calculation of the next two words of the target word thereby retaining its context information. The proposed method using Batchwise LDA with SVI along with two-stepped feature engineering process considerably improved its performance when compared to LSA and HDP models due to the fact of identifying hidden and relevant topics in terms of their optimized posterior distribution in hotel reviews dataset. The Batchwise LDA with SVI improved its performance by 3% in terms of its coherence values by using two-stepped feature engineering process and by 9% and 4% increase when compared with LSA and HDP models respectively. 2020, Intelligent Network and Systems Society. -
Root cause analysis of COVID-19 cases by enhanced text mining process
The main focus of this research is to find the reasons behind the fresh cases of COVID-19 from the publics perception for data specific to India. The analysis is done using machine learning approaches and validating the inferences with medical professionals. The data processing and analysis is accomplished in three steps. First, the dimensionality of the vector space model (VSM) is reduced with improvised feature engineering (FE) process by using a weighted term frequency-inverse document frequency (TF-IDF) and forward scan trigrams (FST) followed by removal of weak features using feature hashing technique. In the second step, an enhanced K-means clustering algorithm is used for grouping, based on the public posts from Twitter. In the last step, latent dirichlet allocation (LDA) is applied for discovering the trigram topics relevant to the reasons behind the increase of fresh COVID-19 cases. The enhanced K-means clustering improved Dunn index value by 18.11% when compared with the traditional K-means method. By incorporating improvised two-step FE process, LDA model improved by 14% in terms of coherence score and by 19% and 15% when compared with latent semantic analysis (LSA) and hierarchical dirichlet process (HDP) respectively thereby resulting in 14 root causes for spike in the disease. 2022 Institute of Advanced Engineering and Science. All rights reserved. -
A Study on Ornated Graphs
In this paper, we introduce the notion of a finite non-simple directed graph called, an ornated graph. An ornated graph is a directed graph on n vertices, denoted by On(sl), whose vertices are consecutively labeled clockwise on the circumference of a circle and constructed from an ordered string sl. Joining vertices is such that for an odd indexed entry at of the string, a tail vertex vi has clockwise heads vj if and only if (i + at) ? j. For an even indexed entry as of the string, a tail vertex vi has anticlockwise heads vj if and only if (i - as) ? j. Some interesting results for certain types of ornated graphs are presented. 2023 World Scientific Publishing Company. -
Generalisation of the rainbow neighbourhood number and k-jump colouring of a graph
In this paper, the notions of rainbow neighbourhood and rainbow neigh-bourhood number of a graph are generalised and further to these general-isations, the notion of a proper k-jump colouring of a graph is also intro-duced. The generalisations follow from the understanding that a closed k-neighbourhood of a vertex v ? V (G) denoted, Nk [v] is the set, Nk [v] = {u: d(v, u) ? k, k ? N and k ? diam(G)}. If the closed k-neighbourhood Nk [v] contains at least one of each colour of the chromatic colour set, we say that v yields a k-rainbow neighbourhood. 2020, Eszterhazy Karoly College. All rights reserved. -
Rainbow neighbourhood number of graphs
In this paper, we introduce the notion of the rainbow neighbourhood and a related graph parameter namely the rainbow neighbourhood number and report on preliminary results thereof. The closed neighbourhood N [v] of a vertex v ? V (G) which contains at least one coloured vertex of each colour in the chromatic colouring of a graph is called a rainbow neighbourhood. The number of rainbow neighbourhoods in a graph G is called the rainbow neighbourhood number of G, denoted by r?(G). We also introduce the concepts of an expanded line graph of a graph G and a v-clique of v ? V (G). With the help of these new concepts, we also establish a necessary and sufficient condition for the existence of a rainbow neighbourhood in the line graph of a graph G. 2019 Johan Kokand Sudev Naduvath and Muhammad Kamran Jamil. -
On the rainbow neighbourhood number of set-graphs
In this paper, we present results for the rainbow neighbourhood numbers of set-graphs. It is also shown that set-graphs are perfect graphs. The intuitive colouring dilemma in respect of the rainbow neighbourhood convention is clarified as well. Finally, the new notion of the maximax independence, maximum proper colouring of a graph and a new graph parameter called the i-max number of G are introduced as a new research direction. 2020 the author(s). -
Some new results on proper colouring of edge-set graphs
In this paper, we present a foundation study for proper colouring of edge-set graphs. The authors consider that a detailed study of the colouring of edge-set graphs corresponding to the family of paths is best suitable for such foundation study. The main result is deriving the chromatic number of the edge-set graph of a path, Pn+1, n ? 1. It is also shown that edge-set graphs for paths are perfect graphs. 2020 the author(s). -
Tattooing and the Tattoo Number of Graphs
Consider a network D of pipes which have to be cleaned using some cleaning agents, called brushes, assigned to some vertices. The minimum number of brushes required for cleaning the network D is called its brush number. The tattooing of a simple connected directed graph D is a particular type of the cleaning in which an arc are coloured by the colour of the colour-brush transiting it and the tattoo number of D is a corresponding derivative of brush numbers in it. Tattooing along an out-arc of a vertex v may proceed if a minimum set of colour-brushes is allocated (primary colours) or combined with those which have arrived (including colour blends) together with mutation of permissible new colour blends, has cardinality greater than or equal to dG+v. 2020 World Scientific Publishing Company. -
Chromatic completion number
The well known concept of proper vertex colouring of a graph is used to introduce the construction of a chromatic completion graph and determining its related parameter, the chromatic completion number of a graph. The chromatic completion numbers of certain classes of cycle derivative graphs and helm graphs are then presented. Finally, we discuss further problems for research related to this concept. 2020 the author(s). -
A note on perfect lucky k-colourable graphs
This paper presents the notion of perfect Lucky k-colouring. Basic conditions for a perfect Lucky k-colourable graph are presented. Application thereof is then presented by obtaining the Lucky 4-polynomials for all connected graphs G on six vertices with ten edges. The chromatic number of these connected graphs is ?(G) = 3 or 4. For k = max{?(G): 3 or 4g = 4, it is possible to find Lucky 4-polynomials for all graphs on six vertices and ten edges. The methodology improves substantially on the fundamental methodology such that, vertex partitions begin with Lucky partition forms immediately. Finally, further problems for research related to this study are presented. 2020, International Scientific Research Publications. All rights reserved.