Cost Effective Optimal Task Scheduling Model in Hybrid Cloud Environment

In today’s world, Cloud Computing (CC) enables the users to access computing resources and services over cloud without any need to own the infrastructure. Cloud Computing is a concept in which a network of devices, located in remote locations, is integrated to perform operations like data collection, processing, data profiling and data storage. In this context, resource allocation and task scheduling are important processes which must be managed based on the requirements of a user. In order to allocate the resources effectively, hybrid cloud is employed since it is a capable solution to process large-scale consumer applications in a pay-by-use manner. Hence, the model is to be designed as a profit-driven framework to reduce cost and make span. With this motivation, the current research work develops a Cost-Effective Optimal Task Scheduling Model (CEOTS). A novel algorithm called Target-based Cost Derivation (TCD) model is used in the proposed work for hybrid clouds. Moreover, the algorithm works on the basis of multi-intentional task completion process with optimal resource allocation. The model was successfully simulated to validate its effectiveness based on factors such as processing time, make span and efficient utilization of virtual machines. The results infer that the proposed model outperformed the existing works and can be relied in future for real-time applications.     

Machine Learning-Informed Predictive Design and Analysis of Electrohydrodynamic Printing Systems

Electrohydrodynamic (EHD) processes are promising techniques for manufacturing nanoscopic products with different shapes (such as thin films, nanofibers, 2D/3D nanostructures, and nanoparticles) and materials at a low cost using simple equipment. A key challenge in their adoption by nonexperts is the requirement of enormous time and resources in identifying the optimum design/process parameters for the underlying material and EHD system. Machine learning (ML) has made exciting advancements in predictive modeling of different processes, provided it is trained on high-quality datasets at appropriate volumes. This article extends the suitability of such ML-enabled approaches to a new technological domain of EHD spraying and drop-on-demand printing. Different ML models like ridge regression, random forest regression, support vector regression, gradient boosting regression, and multilayer perceptron are trained and their performance using evaluation metrics like RMSE and R2_score is examined. Tree-based algorithms like gradient boosting regression are found to be the most suitable technique for modeling EHD processes. The trained ML models show substantially higher accuracy (average error < 5%) in replicating these nonlinear processes as compared to previously reported scaling laws (average error ≈ 42%) and are well suited for predictive modeling/analysis of the underlying EHD system and process.     

An effective deep learning model for grading abnormalities in retinal fundus images using variational auto-encoders

Diabetic retinopathy (DR) and Diabetic Macular Edema (DME) are severe diseases that affect the eyes due to damage in blood vessels. Computer-aided automated grading will help clinicians conduct disease diagnoses at ease. Experiments of automated image processing with deep learning techniques using CNN produce promising results, especially in the medical imaging domain. However, the disease grading tasks in retinal images using CNN struggle to retain high-quality information at the output. A novel deep learning model based on variational auto-encoder to grade DR and DME abnormalities in retinal images is proposed. The objective of the proposed model is to extract the most relevant retinal image features efficiently. It focuses on addressing less relevant candidate region generation and translational invariance present in images. The experiments are conducted in IDRID dataset and evaluated using accuracy, U-kappa, sensitivity, specificity and precision metrics. The results outperform compared with other state-of-art techniques.     

Robust named entity detection from optical character recognition output

In this paper, we focus on information extraction from optical character recognition (OCR) output. Since the content from OCR inherently has many errors, we present robust algorithms for information extraction from OCR lattices instead of merely looking them up in the top-choice (1-best) OCR output. Specifically, we address the challenge of named entity detection in noisy OCR output and show that searching for named entities in the recognition lattice significantly improves detection accuracy over 1-best search. While lattice-based named entity (NE) detection improves NE recall from OCR output, there are two problems with this approach: (1) the number of false alarms can be prohibitive for certain applications and (2) lattice-based search is computationally more expensive than 1-best NE lookup. To mitigate the above challenges, we present techniques for reducing false alarms using confidence measures and for reducing the amount of computation involved in performing the NE search. Furthermore, to demonstrate that our techniques are applicable across multiple domains and languages, we experiment with optical character recognition systems for videotext in English and scanned handwritten text in Arabic.     

Multi-objective parameter estimation of induction motor using particle swarm optimization

In order to simplify the offline parameter estimation of induction motor, a method based on optimization using a particle swarm optimization (PSO) technique is presented. Three different induction motor models such as approximate, exact and deep bar circuit models are considered. The parameter estimation methodology describes a method for estimating the steady-state equivalent circuit parameters from the motor performance characteristics, which is normally available from the manufacturer data or from tests. The optimization problem is formulated as multi-objective function to minimize the error between the estimated and the manufacturer data. The sensitivity analysis is also performed to identify parameters, which have the most impact on motor performance. The feasibility of the proposed method is demonstrated for two different motors and it is compared with the genetic algorithm and the classical parameter estimation method. Simulation results show that the proposed PSO method was indeed capable of estimating the parameters over a wide operating range of the motor.     

Balancing task allocation in multi-robot systems using K-means clustering and auction based mechanisms

This paper aims to solve the balanced multi-robot task allocation problem. Multi-robot systems are becoming more and more significant in industrial, commercial and scientific applications. Effectively allocating tasks to multi-robots i.e. utilizing all robots in a cost effective manner becomes a tedious process. The current attempts made by the researchers concentrate only on minimizing the distance between the robots and the tasks, and not much importance is given to the balancing of work loads among robots. It is also found from the literature that the multi-robot system is analogous to Multiple Travelling Salesman Problem (MTSP). This paper attempts to develop mechanism to address the above two issues with objective of minimizing the distance travelled by ‘m’ robots and balancing the work load between ‘m’ robots equally. The proposed approach has two fold, first develops a mathematical model for balanced multi-robot task allocation problem, and secondly proposes a methodology to solve the model in three stages. Stage I groups the ‘N’ tasks into ‘n’ clusters of tasks using K-means clustering technique with the objective of minimizing the distance between the tasks, stage II calculates the travel cost of robot and clusters combination, stage III allocates the robot to the clusters in order to utilise all robot in a cost effective manner.     

Modeling basal ganglia for understanding Parkinsonian reaching movements

We present a computational model that highlights the role of basal ganglia (BG) in generating simple reaching movements. The model is cast within the reinforcement learning (RL) framework with correspondence between RL components and neuroanatomy as follows: dopamine signal of substantia nigra pars compacta as the temporal difference error, striatum as the substrate for the critic, and the motor cortex as the actor. A key feature of this neurobiological interpretation is our hypothesis that the indirect pathway is the explorer. Chaotic activity, originating from the indirect pathway part of the model, drives the wandering, exploratory movements of the arm. Thus, the direct pathway subserves exploitation, while the indirect pathway subserves exploration. The motor cortex becomes more and more independent of the corrective influence of BG as training progresses. Reaching trajectories show diminishing variability with training. Reaching movements associated with Parkinson's disease (PD) are simulated by reducing dopamine and degrading the complexity of indirect pathway dynamics by switching it from chaotic to periodic behavior. Under the simulated PD conditions, the arm exhibits PD motor symptoms like tremor, bradykinesia and undershooting. The model echoes the notion that PD is a dynamical disease.     

Scalable satisfiability checking and test data generation from modeling diagrams

We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling (ORM) language. ORM is a popular conceptual modeling language, primarily targeting database applications, with significant uses in practice. The general problem of even checking whether an ORM diagram is satisfiable is quite hard: restricted forms are easily NP-hard and the problem is undecidable for some expressive formulations of ORM. Brute-force mapping to input for constraint and SAT solvers does not scale: state-of-the-art solvers fail to find data to satisfy uniqueness and mandatory constraints in realistic time even for small examples. We instead define a restricted subset of ORM that allows efficient reasoning yet contains most constraints overwhelmingly used in practice. We show that the problem of deciding whether these constraints are consistent (i.e., whether we can generate appropriate test data) is solvable in polynomial time, and we produce a highly efficient (interactive speed) checker. Additionally, we analyze over 160 ORM diagrams that capture data models from industrial practice and demonstrate that our subset of ORM is expressive enough to handle their vast majority.     

pH-Dependent interaction of sulfamethoxazole with crosslinked poly(N-vinyl-2-pyrrolidone)

Summary The sorption of sulfamethoxazole (SM) to crosslinked poly(N-vinyl-2-pyrrolidone) (CPVP) was studied by batch adsorption technique at pH's 1.0, 5.0 and 7.0 and at temperatures 10 and 30°C. Analysis by Scatchard method and Giles adsorption isotherm indicated that (i) the sorption increased in the order of pH, 7.0<1.0<5.0 and (ii) SM sorbed vertically through a monofunctional group. The peculiar sorption at pH 5.0 was explained in terms of CPVP — H₂O interaction. The water-uptake by CPVP was minimum at pH 5.0 and increased at pH's 1.0 and 7.0.