Abstract

Premenstrual syndrome (PMS) and premenstrual dysphoric disorder (PMDD) are medically unexplained disorders that occur with somatic or psychiatric symptoms presenting during the luteal phase of the menstrual cycle, ending within a few days after the onset of menstruation. Worldwide, the prevalence of PMS is remarkably high, and its causes are still unclear and are multifactorial. This chapter aims to understand better the etiopathogenesis, clinical features, diagnosis, contemporary, and integrative holistic approaches of PMS management. A thorough literature survey from various scientific databases such as Web of Science, ScienceDirect, PubMed, Google Scholar, Scopus, and other databases was retrieved for the

Abstract

The sudden shift to online education due to the pandemic has led to widespread learning gaps in the student population, increasing the need for individualistic attention to student learning as we transition back to physical classrooms. One can take advantage of the advancements in technology to help in this process by developing tools that can assist teachers decrease the amount of administrative workload and improve their ability to track the learning and understanding of every student in the classroom. The current work proposes a framework for accurate, low-cost, and scalable computer visionbased attendance and attention tracking in physical classroom environment to tackle this problem

Abstract

Deployment of Accident Relief Medical Vans (ARMV) used for accident relief and rescue operations is generally done heuristically. ARMV is an ambulance-train equipped with various tools like jacks, heavy cutting tools, generators, operation theatre, artificial breathing equipment etc. to ease the rescue process. Taking North Eastern Railway (NER) as a case study, Location Set Covering Problem (LSCP) model will be used to find the minimum number of ARMVs required for the given network and their locations so that all demand points can be ‘covered’ within a maximum of one hour @ 100 kmph for each of the nearest facility. This paper proposes a new mathematical model based on the Cluster Coverage Model (CCM) to provide a better coverage of ARMV’s demands. We have used Girvan-Newman (GN) algorithm, a weight-based graph for clustering of NER network where nodes are taken as depots with ARMV parking facilities & crew availability and distance between these nodes is taken as edge weight of the graph. Finally, we present a comparison of results between the proposed cluster coverage models with LSCP and suggest relocations of the existing ARMVs

Abstract

Customer support is an essential part of any company to ensure customer satisfaction and business growth. The responsibility and scale get even higher for enterprise companies like Freshworks that build customer support platforms for its enterprise customers from multiple and previously unseen domains. A ticket may carry issues never seen before, therefore static, and predefined problem labels will not always work. These predefined problem labels are often created manually by admins. For a large customer account, roughly 10-35% of the problem labels could get discovered by this manual process and only 5-9% of the available open tickets could get linked to a problem label. So, there is a need for a system for a new incoming ticket. The system should either automatically detect an existing problem topic with its possible suggestions or systematically generate new problem topic(s) for its assignment. Our system is based on an incremental approach to mine ticket data streams and assigns them to hierarchical soft clusters with auto-generated problem/issue topics. Our system achieves an improvement in ticket assignments up to 97%. To compare with recent clustering advancements, we’ve also evaluated our approach on a public dataset [9] and achieved comparable results. Source code and results of the evaluation are available in detail at: https://github.com/vinidixit/hierarchical-labelled-clustering-evaluation.

Abstract

Grain segmentation of sandstone that is partitioning the grain from its surrounding matrix/cement in the thin section is the primary step for computer-aided mineral identification and sandstone classification. The microscopic images of sandstone contain many mineral grains and their surrounding matrix/cement. The distinction between adjacent grains and the matrix is often ambiguous, making grain segmentation difficult. Various solutions exist in literature to handle these problems; however, they are not robust against sandstone petrography's varied pattern. In this paper, we formulate grain segmentation as a pixel-wise two-class (i.e., grain and background) semantic segmentation task. We develop a deep learning-based end-to-end trainable framework named Deep Semantic Grain Segmentation network (DSGSN), a data-driven method, and provide a generic solution. As per the authors' knowledge, this is the first work where the deep neural network is explored to solve the grain segmentation problem. Extensive experiments on microscopic images highlight that our method obtains better segmentation accuracy than various segmentation architectures with more parameters.

Abstract

The goal of this study is to investigate advanced signal processing approaches [single frequency filtering (SFF) and zero-time windowing (ZTW)] with modern deep neural networks (DNNs) [convolution neural networks (CNNs), temporal convolution neural networks (TCN), time-delay neural network (TDNN), and emphasized channel attention, propagation and aggregation in TDNN (ECAPA-TDNN)] for dialect classification of major dialects of English. Previous studies indicated that SFF and ZTW methods provide higher spectro-temporal resolution. To capture the intrinsic variations in articulations among dialects, four feature representations [spectrogram (SPEC), cepstral coefficients, mel filter-bank energies, and mel-frequency cepstral coefficients (MFCCs)] are derived from SFF and ZTW methods. Experiments with and without data augmentation using CNN classifiers revealed that the proposed features performed better than baseline short-time Fourier transform (STFT)-based features on the UT-Podcast database [Hansen, J. H., and Liu, G. (2016). "Unsupervised accent classification for deep data fusion of accent and language information," Speech Commun. 78, 19-33]. Even without data augmentation, all the proposed features showed an approximate improvement of 15%-20% (relative) over best baseline (SPEC-STFT) feature. TCN, TDNN, and ECAPA-TDNN classifiers that capture wider temporal context further improved the performance for many of the proposed and baseline features. Among all the baseline and proposed features, the best performance is achieved with single frequency filtered cepstral coefficients for TCN (81.30%), TDNN (81.53%), and ECAPA-TDNN (85.48%). An investigation of data-driven filters, instead of fixed mel-scale, improved the performance by 2.8% and 1.4% (relatively) for SPEC-STFT and SPEC-SFF, and nearly equal for SPEC-ZTW. To assist related work, we have made the code available ([Kethireddy, R., and Kadiri, S. R. (2022). "Deep neural architectures for dialect classification with single frequency filtering and zero-time windowing feature representations," https://github.com/r39ashmi/e2e_dialect (Last viewed 21 December 2021)].).

Abstract

Measurement error models are studied extensively in the literature. In these models, when the measurement error variance ΣδδΣδδ is known, the estimating techniques require positive definiteness of the matrix Sxx−ΣδδSxx−Σδδ, even when this is positive definite, it might be near singular if the number of observations is small. There are alternative estimators discussed in literature when this matrix is not positive definite. In this paper, estimators when the matrix Sxx−ΣδδSxx−Σδδ is near singular are proposed and it is shown that these estimators are consistent and have the same asymptotic properties as the earlier ones. In addition, we show that our estimators work far better than the earlier estimators in case of small samples and equally good for large samples.

Abstract

The present article deals with the positive solutions of a periodically perturbed Duffing type equation with singularity of the form and its damped counterpart , for . Using a result on monotonicity for the period function of an associated planar autonomous system, we prove the existence of infinitely many subharmonic solutions, as well as the presence of chaotic dynamics, for some T-periodic forcing terms with negative mean value.

Abstract

The information system of healthcare operates through various frameworks, like wireless body area network, telecare medical information system, and mobile or electronic healthcare. All these systems need to maintain the personal health records (PHRs) for various users (ie, patients, doctors, and nurses). In such systems, we need to process and store the health related sensitive data (ie, PHRs). In this article, we aim to provide a robust security mechanism to secure exchange and storage of healthcare data, especially PHRs. We present a generic architecture of blockchain‐enabled secure communication mechanism for Internet of Things‐driven personal health records (BIPHRS). We then discuss various threats and security attacks of healthcare system along with different available security mechanisms. The conducted security analysis and detailed comparative study of the state of art blockchain enabled security schemes for PHR systems show that the proposed BIPHRS provides a better security and more functionality features as compared to other similar existing approaches. We propose a blockchain‐enabled secure communication framework for Internet of Things‐driven personal health records (BIPHRS). The proposed BIPHRS provides better security and more functionality features as compared to the other similar schemes. In addition, a practical

Abstract

Industry 5.0 is the automation, digitization, and data communication of the industrial procedure that comprises industrial cyber–physical systems (I-CPSs), industrial Internet of Things (IIoT), and artificial intelligence (AI). In the I-CPS-enabled healthcare ecosystem, intelligent wearable devices have been extensively employed to sense body information and measure the health status of the patients. Besides other IIoT applications, the I-CPS-enabled healthcare ecosystem also bears various challenges. For instance, due to the communal communication mediums, the security of a patient’s physiological datum is becoming a significant challenge these days. In order to cope with this challenge, we presented a secure and lightweight key establishment protocol. To the best of our knowledge, this protocol is the first application of physically unclonable function (PUF) in the I-CPS-enabled healthcare. The security of the designed protocol is proved with the help of a widely recognized real-or-random (ROR) model. The practical demonstration of our protocol from the network perspective is also measured through broadly recognized NS3 simulator tool.