Quantifying DNS namespace influence

Name resolution using the Domain Name System (DNS) is integral to today’s Internet. The resolution of a domain name is often dependent on namespace outside the control of the domain’s owner. In this article we review the DNS protocol and several DNS server implementations. Based on our examination, we propose a formal model for analyzing the name dependencies inherent in DNS. Using our name dependency model we derive metrics to quantify the extent to which domain names affect other domain names. It is found that under certain conditions, more than half of the queries for a domain name are influenced by namespaces not expressly configured by administrators. This result serves to quantify the degree of vulnerability of DNS due to dependencies that administrators are unaware of. When we apply metrics from our model to production DNS data, we show that the set of domains whose resolution affects a given domain name is much smaller than previously thought. However, behaviors such as using cached addresses for querying authoritative servers and chaining domain name aliases increase the number and diversity of influential domains, thereby making the DNS infrastructure more vulnerable.     

On the sizing of a solar thermal electricity plant for multiple objectives using evolutionary optimization

Design, implementation and operation of solar thermal electricity plants are no more an academic task, rather they have become a necessity. In this paper, we work with power industries to formulate a multi-objective optimization model and attempt to solve the resulting problem using classical as well as evolutionary optimization techniques. On a set of four objectives having complex trade-offs, our proposed procedure first finds a set of trade-off solutions showing the entire range of optimal solutions. Thereafter, the evolutionary optimization procedure is combined with a multiple criterion decision making (MCDM) approach to focus on preferred regions of the trade-off frontier. Obtained solutions are compared with a classical generating method. Eventually, a decision-maker is involved in the process and a single preferred solution is obtained in a systematic manner. Starting with generating a wide spectrum of trade-off solutions to have a global understanding of feasible solutions, then concentrating on specific preferred regions for having a more detailed understanding of preferred solutions, and then zeroing on a single preferred solution with the help of a decision-maker demonstrates the use of multi-objective optimization and decision making methodologies in practice. As a by-product, useful properties among decision variables that are common to the obtained solutions are gathered as vital knowledge for the problem. The procedures used in this paper are ready to be used to other similar real-world problem solving tasks.     

Brain tumor detection based on hybrid deep neural network in MRI by adaptive squirrel search optimization

In the medical field, image segmentation is a paramount and challenging task. The head and vertebral column make up the central nervous system (CNS), which control all the paramount functions. These include thinking, speaking, and gestures. The uncontrolled growth in the CNS can affect a person’s thinking of communication or movement. The tumor is known as the uncontrolled growth of cells in brain. The tumor can be recognized by MRI image. Brain tumor detection is mostly affected with inaccurate classification. This proposed work designed a novel classification and segmentation algorithm for the brain tumor detection. The proposed system uses the Adaptive fuzzy deep neural network with frog leap optimization to detect normality and abnormality of the image. Accurate classification is achieved with error minimization strategy through our proposed method. Then, the abnormal image is segmented using adaptive flying squirrel algorithm and the size of the tumor is detected, which is used to find out the severity of the tumor. The proposed work is implemented in the MATLAB simulation platform. The proposed work Accuracy, sensitivity, specificity, false positive rate and false negative rate are 99.6%, 99.9%, 99.8%, 0.0043 and 0.543, respectively. The detection accuracy is better in our proposed system than the existing teaching and learning based algorithm, social group algorithm and deep neural network.

     

Requirement-oriented risk management for incremental software development

In incremental software development (ISD) functionalities are delivered incrementally and requirements keep on evolving across iterations. The requirements evolution involves the addition of new dependencies and conflicts among functional and non-functional requirements along with changes in priorities and dependency weights. This, in turn, demands refactoring the order of development of system components to minimize the impact of these changes. Neglecting the non-functional constraints in the software development process exposes it to risks that may accumulate across several iterations. In this research work, we propose a risk management framework for ISD processes that provides an estimate of risk exposure for the project when functional features are frozen while ignoring the associations with non-functional requirements. Our framework proposes suitable risk reduction strategies that work in tandem with the risk assessment module. We also provide a tool interface for our risk management framework.

     

Multi-Model Approach to Assess the Dynamics of Hydrologic Components in a Tropical Ecosystem

Estimation of terrestrial water budget at global and regional scales are essential for efficient agricultural water management, flood predictions, and, hydrological modeling. In hydrological modeling, it is a challenging task to quantify the major hydrological components like runoff, evapotranspiration (ET), and total water storage (TWS) due to improper and limited availability of detailed meteorological datasets. Furthermore, there has been no consensus to answer a-decade-long critical question that a less data-intensive models can be an alternate to robust data-intensive models in data scarce conditions. This study aims at multi-model approach over the single models usage for representing the hydrological behaviour in the Kangsabati River Basin (KRB), India. It is done by applying the standard model selection criteria over various hydrological models. Two hydrological models are selected, a semi- distributed model, Variable Infiltration Capacity (VIC-3 L), and a conceptually lumped model, Identification of unit Hydrograph and Component flows from Rainfall, Evapotranspiration and Streamflow (IHACRES). Both models were calibrated against the observed daily discharge at the KRB outlet for the period of 2001–2006 and validated for 2008–2010. The results show that both VIC-3 L and IHACRES produce reasonable runoff estimates at daily and monthly time scale in the KRB. The ET estimates show that VIC-3 L and IHACRES captured the seasonal variations with the percent change of 0.4% and 6.6% respectively. As IHACRES is simpler, parsimonious, fewer parameters, and better performances, it can be useful for hydrological modeling in data-scarce regions.

     

An algorithm for recognizing palm polygons

A polygonP is said to be apalm polygon if there exists a pointxP such that the Euclidean shortest path fromx to any pointyP makes only left turns or only right turns. The set of all such pointsx is called thepalm kernel. In this paper we propose an O(E) time algorithm for recognizing a palm polygonP, whereE is the size of the visibility graph ofP. The algorithm recognizes the given polygonP as a palm polygon by computing the palm kernel ofP. If the palm kernel is not empty,P is a palm polygon.The extended abstract of this paper was reported at the Second Canadian Conference in Computational Geometry, pp. 246–251, 1990     

FSE2R: An Improved Collision-Avoidance-based Energy Efficient Route Selection Protocol in USN

The 3D Underwater Sensor Network (USNs) has become the most optimistic medium for tracking and monitoring underwater environment. Energy and collision are two most critical factors in USNs for both sparse and dense regions. Due to harsh ocean environment, it is a challenge to design a reliable energy efficient with collision free protocol. Diversity in link qualities may cause collision and frequent communication lead to energy loss; that effects the network performance. To overcome these challenges a novel protocol Forwarder Selection Energy Efficient Routing (FSE2R) is proposed. Our proposal’s key idea is based on computation of node distance from the sink, Residual Energy (RE) of each node and Signal to Interference Noise Ratio (SINR). The node distance from sink and RE is computed for reliable forwarder node selection and SINR is used for analysis of collision. The novel proposal compares with existing protocols like H2AB, DEEP, and E2LR to achieve Quality of Service (QoS) in terms of throughput, packet delivery ratio and energy consumption. The comparative analysis shows that FSE2R gives on an average 30% less energy consumption, 24.62% better PDR and 48.31% less end-to-end delay compared to other protocols.     

Domain-specific initial population strategy for compliant mechanisms using customized genetic algorithm

Genetic algorithms (GAs) can precisely handle the discrete structural topology optimization of single-piece elastic structures called compliant mechanisms. The initial population of these elastic structures is mostly generated by assigning the material at random. This causes disconnected or unfeasible designs and further rule-based repairing can result in representation degeneracy. However, the problem-specific initial population can affect the performance of GAs like other operators. In this paper, a domain-specific initial population strategy is developed that generates geometrically feasible structures for path generating compliant mechanisms (PGCMs). It is coupled with the elitist non-dominated sorting genetic algorithm (NSGA-II) which has been customized for structural topology optimization. The performance of initial population strategy over random initialization using customized NSGA-II is checked on single and bi-objective optimization problems. Based on the results, it is observed that the custom initialization outperforms the random initialization by dominating all the solutions and exploring larger area of posed objectives. The elastic structures obtained by solving two examples of PGCMs using domain specific initial population strategy are also presented.     

Vehicle license plate tilt correction based on the straight line fitting method and minimizing variance of coordinates of projection points

Tilt correction is a very crucial and inevitable task in the automatic recognition of the vehicle license plate (VLP). In this paper, according to the least square fitting with perpendicular offsets (LSFPO), the VLP region is fitted to a straight line. After the line slope is obtained, rotation angle of the VLP is estimated. Then the whole image is rotated for tilt correction in horizontal direction by this angle. Tilt correction in vertical direction by minimizing the variance of coordinates of the projection points is proposed. Character segmentation is performed after horizontal correction and character points are projected along the vertical direction after shear transform. Despite the success of VLP detection approaches in the past decades, a few of them can effectively locate license plate (LP), even when vehicle bodies and LPs have similar color. A common drawback of color-based VLP detection is the failure to detect the boundaries or border of LPs. In this paper, we propose a modified recursive labeling algorithm for solving this problem and detecting candidate regions. According to different colored LP, these candidate regions may include LP regions. Geometrical properties of the LP such as area, bounding box and aspect-ratio are then used for classification. Various LP images were used with a variety of conditions to test the proposed method and results are presented to prove its effectiveness.     

Introducing robustness in multi-objective optimization

In optimization studies including multi-objective optimization, the main focus is placed on finding the global optimum or global Pareto-optimal solutions, representing the best possible objective values. However, in practice, users may not always be interested in finding the so-called global best solutions, particularly when these solutions are quite sensitive to the variable perturbations which cannot be avoided in practice. In such cases, practitioners are interested in finding the robust solutions which are less sensitive to small perturbations in variables. Although robust optimization is dealt with in detail in single-objective evolutionary optimization studies, in this paper, we present two different robust multi-objective optimization procedures, where the emphasis is to find a robust frontier, instead of the global Pareto-optimal frontier in a problem. The first procedure is a straightforward extension of a technique used for single-objective optimization and the second procedure is a more practical approach enabling a user to set the extent of robustness desired in a problem. To demonstrate the differences between global and robust multi-objective optimization principles and the differences between the two robust optimization procedures suggested here, we develop a number of constrained and unconstrained test problems having two and three objectives and show simulation results using an evolutionary multi-objective optimization (EMO) algorithm. Finally, we also apply both robust optimization methodologies to an engineering design problem.