An expressive framework and efficient algorithms for the analysis of collaborative tagging

The rise of Web 2.0 is signaled by sites such as Flickr, del.icio.us, and YouTube, and social tagging is essential to their success. A typical tagging action involves three components, user, item (e.g., photos in Flickr), and tags (i.e., words or phrases). Analyzing how tags are assigned by certain users to certain items has important implications in helping users search for desired information. In this paper, we develop a dual mining framework to explore tagging behavior. This framework is centered around two opposing measures, similarity and diversity, applied to one or more tagging components, and therefore enables a wide range of analysis scenarios such as characterizing similar users tagging diverse items with similar tags or diverse users tagging similar items with diverse tags. By adopting different concrete measures for similarity and diversity in the framework, we show that a wide range of concrete analysis problems can be defined and they are NP-Complete in general. We design four sets of efficient algorithms for solving many of those problems and demonstrate, through comprehensive experiments over real data, that our algorithms significantly out-perform the exact brute-force approach without compromising analysis result quality.     

Buoyancy convection in a cavity with mutually orthogonal heated plates

Buoyancy driven convection in a square cavity induced by two mutually orthogonal arbitrarily placed heated thin plates is studied numerically under isothermal and isoflux boundary conditions. The flow is assumed to be two-dimensional. The coupled governing equations were solved by the finite difference method using the Alternating Direction Implicit technique and Successive Over Relaxation method. The steady state results are depicted in terms of streamline and isotherm plots. It is found that the resulting convection pattern is stronger for the isothermal boundary condition. A better overall heat transfer can be achieved by placing one of the plates far away from the center of the cavity for isothermal boundary condition and near the center of the cavity for isoflux boundary condition.     

Discrete GWO Optimized Data Aggregation for Reducing Transmission Rate in IoT

The conventional hospital environment is transformed into digital transformation that focuses on patient centric remote approach through advanced technologies. Early diagnosis of many diseases will improve the patient life. The cost of health care systems is reduced due to the use of advanced technologies such as Internet of Things (IoT), Wireless Sensor Networks (WSN), Embedded systems, Deep learning approaches and Optimization and aggregation methods. The data generated through these technologies will demand the bandwidth, data rate, latency of the network. In this proposed work, efficient discrete grey wolf optimization (DGWO) based data aggregation scheme using Elliptic curve Elgamal with Message Authentication code (ECEMAC) has been used to aggregate the parameters generated from the wearable sensor devices of the patient. The nodes that are far away from edge node will forward the data to its neighbor cluster head using DGWO. Aggregation scheme will reduce the number of transmissions over the network. The aggregated data are preprocessed at edge node to remove the noise for better diagnosis. Edge node will reduce the overhead of cloud server. The aggregated data are forward to cloud server for central storage and diagnosis. This proposed smart diagnosis will reduce the transmission cost through aggregation scheme which will reduce the energy of the system. Energy cost for proposed system for 300 nodes is 0.34μJ. Various energy cost of existing approaches such as secure privacy preserving data aggregation scheme (SPPDA), concealed data aggregation scheme for multiple application (CDAMA) and secure aggregation scheme (ASAS) are 1.3 μJ, 0.81 μJ and 0.51 μJ respectively. The optimization approaches and encryption method will ensure the data privacy.     

BS-SC Model: A Novel Method for Predicting Child Abuse Using Borderline-SMOTE Enabled Stacking Classifier

For a long time, legal entities have developed and used crime prediction methodologies. The techniques are frequently updated based on crime evaluations and responses from scientific communities. There is a need to develop type-based crime prediction methodologies that can be used to address issues at the subgroup level. Child maltreatment is not adequately addressed because children are voiceless. As a result, the possibility of developing a model for predicting child abuse was investigated in this study. Various exploratory analysis methods were used to examine the city of Chicago’s child abuse events. The data set was balanced using the Borderline-SMOTE technique, and then a stacking classifier was employed to ensemble multiple algorithms to predict various types of child abuse. The proposed approach successfully predicted crime types with 93% of accuracy, precision, recall, and F1-Score. The AUC value of the same was 0.989. However, when compared to the Extra Trees model (17.55), which is the second best, the proposed model’s execution time was significantly longer (476.63). We discovered that Machine Learning methods effectively evaluate the demographic and spatial-temporal characteristics of the crimes and predict the occurrences of various subtypes of child abuse. The results indicated that the proposed Borderline-SMOTE enabled Stacking Classifier model (BS-SC Model) would be effective in the real-time child abuse prediction and prevention process.     

Intelligent Machine Learning with Metaheuristics Based Sentiment Analysis and Classification

Sentiment Analysis (SA) is one of the subfields in Natural Language Processing (NLP) which focuses on identification and extraction of opinions that exist in the text provided across reviews, social media, blogs, news, and so on. SA has the ability to handle the drastically-increasing unstructured text by transforming them into structured data with the help of NLP and open source tools. The current research work designs a novel Modified Red Deer Algorithm (MRDA) Extreme Learning Machine Sparse Autoencoder (ELMSAE) model for SA and classification. The proposed MRDA-ELMSAE technique initially performs preprocessing to transform the data into a compatible format. Moreover, TF-IDF vectorizer is employed in the extraction of features while ELMSAE model is applied in the classification of sentiments. Furthermore, optimal parameter tuning is done for ELMSAE model using MRDA technique. A wide range of simulation analyses was carried out and results from comparative analysis establish the enhanced efficiency of MRDA-ELMSAE technique against other recent techniques.     

An automatic query expansion based on hybrid CMO-COOT algorithm for optimized information retrieval

The World Wide Web(WWW) comprises a wide range of information, and it is mainly operated on the principles of keyword matching which often reduces accurate information retrieval. Automatic query expansion is one of the primary methods for information retrieval, and it handles the vocabulary mismatch problem often faced by the information retrieval systems to retrieve an appropriate document using the keywords. This paper proposed a novel approach of hybrid COOT-based Cat and Mouse Optimization (CMO) algorithm named as hybrid COOT-CMO for the appropriate selection of optimal candidate terms in the automatic query expansion process. To improve the accuracy of the Cat and Mouse Optimization (CMO) algorithm, the parameters are tuned with the help of the Coot algorithm. The best suitable expanded query is identified from the available expanded query sets also known as candidate query pools. All feasible combinations in this candidate query pool should be obtained from the top retrieved documents. Benchmark datasets such as the GOV2 Test Collection, the Cranfield Collections, and the NTCIR Test Collection are utilized to assess the performance of the proposed hybrid COOT-CMO method for automatic query expansion. This proposed method surpasses the existing state-of-the-art techniques using many performance measures such as F-score, precision, and mean average precision (MAP).

     

Development of porous defects in plasma membranes of adenosine triphosphate-depleted Madin-Darby canine kidney cells and its inhibition by glycine

Studies during the past decade have led to the recognition of a fundamental, widely expressed mechanism of structural damage in energy-deprived cells, which is suppressed by physiologic levels of glycine and is independent of Ca2+ availability or alterations of cytosolic free Ca2+. To gain insight into this process, Madin-Darby canine kidney (MDCK) cells were depleted of adenosine triphosphate (ATP) by a mitochondrial uncoupler in glucose-free medium, and intracellular free Ca2+ was clamped at 100 nM to avoid calcium cytotoxicity. Although the ATP-depleted cells swelled and blebbed and their plasma membranes appeared to be under tension, they nevertheless became permeable to macromolecules. The plasma membranes of these cells retained structural continuity, as determined by morphologic observations, and confocal microscopy of a plasma membrane protein label (Biotin: Ultra Avidin-Texas Red) and a lipid label (NBD-sphingomyelin). Using fluoresceinated dextrans of graded molecular size, membrane permselectivity was examined noninvasively by confocal microscopy. Measured as inside/outside ratios of fluorescence intensity, the permeability indices showed progressively greater restriction to diffusion of increasingly larger dextran molecules across plasma membranes, with sharp break-points between 70,000 and 145,000 daltons (d). The results indicated that the membranes behaved as if they were perforated by water-filled channels or "pores," with size-exclusion limits of molecular dimensions. The membrane defects evolved from small pores permeable only to propidium iodide (668 d) and the smallest dextran (4,000 d), before enlarging with time to become permeable to larger dextrans. Inclusion of glycine during ATP depletion did not affect cell swelling or blebbing but completely prevented the development of permeability defects. Treatment of cells before ATP depletion with a membrane-impermeant homobifunctional "nearest neighbor" cross-linking agent, 3,3' dithiobis(sulfosuccinimidylpropionate), suppressed the development of permeability defects, even in the absence of glycine. These observations suggest that the cellular abnormality that is suppressed by glycine involves rearrangement of plasma membrane proteins to form water-filled pores large enough to leak macromolecules.     

A genetic algorithm-based artificial neural network model for the optimization of machining processes

Artificial intelligent tools like genetic algorithm, artificial neural network (ANN) and fuzzy logic are found to be extremely useful in modeling reliable processes in the field of computer integrated manufacturing (for example, selecting optimal parameters during process planning, design and implementing the adaptive control systems). When knowledge about the relationship among the various parameters of manufacturing are found to be lacking, ANNs are used as process models, because they can handle strong nonlinearities, a large number of parameters and missing information. When the dependencies between parameters become noninvertible, the input and output configurations used in ANN strongly influence the accuracy. However, running of a neural network is found to be time consuming. If genetic algorithm-based ANNs are used to construct models, it can provide more accurate results in less time. This article proposes a genetic algorithm-based ANN model for the turning process in manufacturing Industry. This model is found to be a time-saving model that satisfies all the accuracy requirements.     

Fault diagnosis of spur bevel gear box using discrete wavelet features and Decision Tree classification

The wavelet transform (WT) is used to represent all possible types of transients in vibration signals generated by faults in a gear box. It is shown that the transform provides a powerful tool for condition monitoring and fault diagnosis. The vibration signal of a spur bevel gear box in different conditions is used to demonstrate the application of various wavelets in feature extraction. In present work, a discrete wavelet, Daubechies wavelets (db1–db15) is used for feature extraction and their relative effectiveness in feature extraction is compared. The major steps in pattern classification are feature extraction and classification. This paper investigates the use of discrete wavelets for feature extraction and a Decision Tree for classification. J48 Decision Tree algorithm has been used for feature selection as well as for classification. This paper illustrates the powerfulness and flexibility of the discrete wavelet transform to decompose linear and non-linear processing of vibration signal.     

Simulated annealing heuristics for the dynamic facility layout problem

In today's economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in product mix and demand. Therefore, this paper considers the problem of arranging and rearranging (when there are changes between the flows of materials between departments) manufacturing facilities such that the sum of the material handling and rearrangement costs is minimized. This problem is known as the dynamic facility layout problem (DFLP). In this paper, two simulated annealing (SA) heuristics are developed for the DFLP. The first SA heuristic (SA I) is a direct adaptation of SA to the DFLP. The second SA heuristic (SA II) is the same as SA I with a look-ahead/look-back strategy added. To test the performance of the heuristics, a data set taken from the literature is used in the analysis. The results obtained show that the proposed heuristics are very effective for the dynamic facility layout problem.