Green clouds optimally use energy resources in large-scale distributed computing environments. Large scale industries such as smart grids are adopting green cloud paradigm to optimize energy needs and to maximize lifespan of smart devices such as smart meters. Both, energy consumption and lifespan of smart meters are critical factors in smart grid applications where performance of these factors decreases with each cycle of grid operation such as record reading and dispatching to the edge nodes. Also, considering large-scale infrastructure of smart grid, replacing out-of-energy and faulty meters is not an economical solution. Therefore, to optimize the energy consumption and lifespan of smart meters, we present a knowledge-based usage strategy for smart meters in this paper. Our proposed scheme is novel and generates custom graph of smart meter tuple datasets and fetches the frequency of lifespan and energy consumption factors. Due to very large-scale dataset graphs, the said factors are fine-grained through R3F filter over modified Hungarian algorithm for smart grid repository. After receiving the exact status of usage, the grid places smart meters in logical partitions according to their utilization frequency. The experimental evaluation shows that the proposed approach enhances lifespan frequency of 100 smart meters by 72% and optimizes energy consumption at an overall percentile of 21% in the green cloud-based smart grid.

Relational databases are storage for a massive amount of data. Knowledge of structured query language is a prior requirement to access that data. That is not possible for all non-technical personals, leading to the need for a system that translates text to SQL query itself rather than the user. Text to SQL task is also crucial because of its economic and industrial value. Natural Language Interface to Database (NLIDB) is the system that supports the text-to-SQL task. Developing the NLIDB system is a long-standing problem. Previously they were built based on domain-specific ontologies via pipelining methods. Recently a rising variety of Deep learning ideas and techniques brought this area to the attention again. Now end to end Deep learning models is being proposed for the task. Some publicly available datasets are being used for experimentation of the contributions, making the comparison process convenient. In this paper, we review the current work, summarize the research trends, and highlight challenging issues of NLIDB with Deep learning models. We discussed the importance of datasets, prediction model approaches and open challenges. In addition, methods and techniques are also summarized, along with their influence on the overall structure and performance of NLIDB systems. This paper can help future researchers start having prior knowledge of findings and challenges in NLIDB with Deep learning approaches.

A software product line is used for the development of a family of products utilizing the reusability of existing resources with low costs and time to market. Feature Model (FM) is used extensively to manage the common and variable features of a family of products, such as Internet of Things (IoT) applications. In the literature, the binary pattern for nested cardinality constraints (BPNCC) approach has been proposed to compute all possible combinations of development features for IoT applications without violating any relationship constraints. Relationship constraints are a predefined set of rules for the selection of features from an FM. Due to high probability of relationship constraints violations, obtaining optimum features combinations from large IoT-based FMs are a challenging task. Therefore, in order to obtain optimum solutions, in this paper, we have proposed multi-objective optimum-BPNCC that consists of three independent paths (first, second, and third). Furthermore, we applied heuristics on these paths and found that the first path is infeasible due to space and execution time complexity. The second path reduces the space complexity; however, time complexity increases due to the increasing group of features. Among these paths, the performance of the third path is best as it removes optional features that are not required for optimization. In experiments, we calculated the outcomes of all three paths that show the significant improvement of optimum solution without constraint violation occurrence. We theoretically prove that this paper is better than previously proposed optimization algorithms, such as a non-dominated sorting genetic algorithm and an indicator-based evolutionary algorithm.