Evaluation of reservoir sedimentation using data driven techniques

The sedimentation is a pervasive complex hydrological process subjected to each and every reservoir in world at different extent. Hydrographic surveys are considered as most accurate method to determine the total volume occupied by sediment and its distribution pattern in a reservoir. But, these surveys are very cumbersome, time consuming and expensive. This complex sedimentation process can also be simulated through the well calibrated numerical models. However, these models generally are data extensive and require large computational time. Generally, the availability of such data is very scarce. Due to large constraints of these methods and models, in the present study, data driven approaches such as artificial neural networks (ANN), model trees (MT) and genetic programming (GP) have been investigated for the estimation of volume of sediment deposition incorporating the parameters influenced it along with conventional multiple linear regression data driven model. The aforementioned data driven models for the estimation of reservoir sediment deposition were initially developed and applied on Gobindsagar Reservoir. In order to generalise the developed methodology, the developed data driven models were also validated for unseen data of Pong Reservoir. The study depicted that the highly nonlinear models ANN and GP captured the trend of sediment deposition better than piecewise linear MT model, even for smaller length datasets.     

BLAST-SSAHA Hybridization for Credit Card Fraud Detection

A phenomenal growth in the number of credit card transactions, especially for online purchases, has recently led to a substantial rise in fraudulent activities. Implementation of efficient fraud detection systems has thus become imperative for all credit card issuing banks to minimize their losses. In real life, fraudulent transactions are interspersed with genuine transactions and simple pattern matching is not often sufficient to detect them accurately. Thus, there is a need for combining both anomaly detection as well as misuse detection techniques. In this paper, we propose to use two-stage sequence alignment in which a profile analyzer (PA) first determines the similarity of an incoming sequence of transactions on a given credit card with the genuine cardholder's past spending sequences. The unusual transactions traced by the profile analyzer are next passed on to a deviation analyzer (DA) for possible alignment with past fraudulent behavior. The final decision about the nature of a transaction is taken on the basis of the observations by these two analyzers. In order to achieve online response time for both PA and DA, we suggest a new approach for combining two sequence alignment algorithms BLAST and SSAHA.     

An Optimal Mechanism for Sponsored Search Auctions on the Web and Comparison With Other Mechanisms

In this paper, we first describe a framework to model the sponsored search auction on the Web as a mechanism design problem. Using this framework, we describe two well-known mechanisms for sponsored search auction - generalized second price (GSP) and Vickrey-Clarke-Groves (VCG). We then derive a new mechanism for sponsored search auction which we call optimal (OPT) mechanism. The OPT mechanism maximizes the search engine's expected revenue, while achieving Bayesian incentive compatibility and individual rationality of the advertisers. We then undertake a detailed comparative study of the mechanisms GSP, VCG, and OPT. We compute and compare the expected revenue earned by the search engine under the three mechanisms when the advertisers are symmetric and some special conditions are satisfied. We also compare the three mechanisms in terms of incentive compatibility, individual rationality, and computational complexity.     

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.     

Detection of Malicious Profiles and Protecting Users in Online Social Networks

Wireless Personal Communications - Everyone today actively uses online social networks to get in touch with their friends, for career opportunities, and business also. Some of the most popular...     

A Deep Learning Approach to Detection and Mitigation of Distributed Denial of Service Attacks in High Availability Intelligent Transport Systems

Mobile Networks and Applications - In the era of Internet of Things (IoT) powered by 5G technologies, Automobile Industry is headed towards a revolution. In Intelligent Transport Systems (ITS),...     

VMI versus information sharing: an analysis under static uncertainty strategy with fill rate constraints

A vendor-managed inventory (VMI) relationship between a downstream retailer and an upstream vendor consists of two distinct components: (i) information sharing (IS) and (ii) a shift in decision-making responsibility. This study compares these two components of VMI in a two-stage serial supply chain based on the ‘static uncertainty’ strategy under dynamic and random demand with fill rate constraints. Numerical experiments are conducted using analytical models to identify the conditions where the incremental value of VMI over IS is significant. The results provide guidelines relevant to academia and supply chain practitioners in taking VMI adoption decision above and beyond IS according to their specific business environment.     

Measurement Uncertainty in Airborne Sound Insulation and Single-Number Quantities: Strategy and Implementation in Indian Scenario

This paper presents the factors affecting the uncertainty of measurement in sound transmission loss testing and the single-number quantities (SNQs) used widely in building acoustics. It provides a retrospective view of the recently published work especially in European continent and standard ISO 12999-1 for interpreting and elaborating the concept of calculation of measurement uncertainty in SNQs particularly for the laboratories engaged in sound transmission loss testing in India by presenting case studies for different types of building materials. The study suggests that the poor low frequency sound insulation and low frequency mass-air-mass and flexural resonances inculcate a higher uncertainty in SNQs for building elements. It is imperative to adopt the strategy recommended in ISO 12999-1 in Indian scenario particularly with growing international trade in building materials and technology and for the recognition as well as acceptance of testing results of Indian laboratories across the globe.     

Monte Carlo techniques for phrase-based translation

Recent advances in statistical machine translation have used approximate beam search for NP-complete inference within probabilistic translation models. We present an alternative approach of sampling from the posterior distribution defined by a translation model. We define a novel Gibbs sampler for sampling translations given a source sentence and show that it effectively explores this posterior distribution. In doing so we overcome the limitations of heuristic beam search and obtain theoretically sound solutions to inference problems such as finding the maximum probability translation and minimum risk training and decoding.