International Journal of Intelligent Engineering and Systems

1

Authors: Neha Singh, Agrawal Kalpesh, Swathi Jamjala Narayanan

Prediction of fault proneness of modules in software is one of the ways to ensure the achievement of software quality and reliability. Software delivered cannot not always be bug free, the more the number of bug the more the dis-satisfaction among client due to degradation in software quality and reliability. Though we have few models for detecting software fault prone modules, the intend of our work is to increase the reliability of the software by using an approach named Rough Fuzzy c-means (RFCM) clustering algorithm to analyse the fault proneness of the software modules under test. This helps in an efficient analysis of the modules having an ambiguous behaviour using rough set boundary which is not possible using traditional clustering methods. A dataset from PROMISE software engineering repository has been taken for the experimental analysis. The results were promising enough to determine software modules which fall in the boundary region of ambiguity emphasizing the software team to focus on those modules to achieve higher reliable system.

20

Authors: Naradon Chotiwanaporn, Chow Chompoo-Inwai

This research paper presents the new idea of applying the transmission line teleprotection scheme called direct transfer trip (DTT) technique to use with a closed-loop distribution network. A large-scale 163MW gas turbine power plant connected to a three-substation closed-loop distribution network was chosen to be a case study here. A newly-proposed DTT configuration, DTT logic diagram and circuit breaker trip matrix had been redesigned and presented in this paper. For the proposed DTT configuration, several remote terminal units will be installed at every substation connected to the distribution network, whereas the logic controller will be installed at the selected power plant. A huge advantage over the conventionally-installed zoning peer-to-peer protection scheme is that the proposed DTT logic controller is able to almost instantaneously compute and send out the clearing faults command, regardless of fault locations in this particular closed-loop distribution network, while the conventional one cannot in many cases. Additional benefit is that the proposed DTT teleprotection scheme completely prevent the generators from operation in island mode resulting in minimal lost and damages caused from this circumstance. The relay test tool is used to verify the proposed DTT protective capabilities and speed. The simulation and commissioning test results confirm the proper functionality of the proposed technique. The implementation to the real field has been done and presented here as well. What we have learned from this case study shall be a very good guideline for other similar circumstances.

39

Authors: Bachir Bendjaima, Djamel Saigaa, Djalal Eddine Khodja

In industry, the service continuity of an electrical system drives requires degrees of reliability of operation and high safety. Thus, the system requires robust elements to avoid falling into the defects. But the appearance of defects, it is inevitable. It is therefore necessary to solve this problem by developing a control technique that can ensure continuity of operation in the presence of faults. Indeed, the sliding mode adaptive control based on fuzzy logic ensures the stability of the system healthy and able to compensate certain types of defects: the defects of low severity. In fact, is with the fuzzy sliding controller with varying control gains. This one is based on supervisory fuzzy inference system using the adaptive tune in order to improve the performance of controller in presence of current sensors faults. In addition, the sensors are the most sensitive elements and the seat of frequent faults, and play a leading role in the closed loop control. An operation of a tolerant control the default intended to compensate the default offset sensor. The developed algorithm is validated by simulation and the obtained results showed the effectiveness and the robustness of the proposed approach under different scenarios.

60

Authors: Srihari Mandava, Abhishek Gudipalli, Vidhyasagar Gorla, AmuthaPrabha Nagarajan

The harmonics injecting into power systems are increasing from day to day with the increasing use of power electronics and nonlinear loads. These harmonics are to be monitored and analyzed to measure their impact on the quality of the power flowing through the lines during normal and abnormal conditions. It is easy to measure the fundamental frequency and it’s off nominals of power signal using DFT and its extended methods when the power system frequency is stable. But, with increase in micro-grids and renewable energy sources like wind into the power network, the frequency of the power system in not stable. The DFT leads to errors in frequency estimation during this unstable state .This work uses the demodulation method for estimating the amplitudes and phase angle of fundamental frequency and its off-nominals of a power system having dynamics in frequency. This demodulation principle is part of the orthogonal frequency division multiplexing (OFDM) used for digital multi-carrier modulation.

78

Authors: Madhav Vaidya, Yashwant Joshi, Milind Bhalerao

Recognition of handwritten Marathi character/digits is comparatively a tough task as compared to English. It has several types of applications including the postal code reading and sorting, banks check amount processing. In this paper a novel feature extraction and selection method is proposed for the recognition of isolated handwritten Marathi numbers which is based on one dimensional Discrete Cosine Transform (DCT) algorithm. The scanned document is pre-processed and segmented to create isolated numerals. Features for each numeral can be calculated after normalizing the numeral image to 32 × 32 size. Based on these reduced features, the numerals are classified into appropriate groups. Neural network is used for classification of numerals based on the extracted features. The results of proposed method are compared with the results obtained using Discrete Wavelet Transform and zonal discrete cosine transform (ZDCT). The proposed approach gives improved results as compared to zonal DCT and DWT method. Experimental results shows accuracy observed for the method is 90.30% with normalized numeral image of size 32 × 32.

98

Authors: Kairat Jaroenrat, Natchamol Srichumroenrattana

One popular IP network routing protocol is OSPF (Open Shortest Path First), which uses algorithms to find its own path by calculating the path with the least weight from source to destination. As a result, the design and routing of the data flow may not meet the requirements. To meet the efficiency of cable installation and routing, the Branch Exchange for network design process was applied. With the ability to select the number of links to be exchanged with others, we can trade-off between the design efficiency and the processing time. We used the ability of the Branch Exchange method to determine a network with an efficient traffic flow distribution. We calculated the end-to-end delay time using the M/M/1 model, then analyzed the network design efficiency of 8- and 9-node networks compared to the Simplex method. For 8-, 9-, and 10-node networks, we compared the MENTOR-II method to traffic flow and network complexity. The results showed that the efficiency of the Branch Exchange method in terms of delay and cost closely align to the Simplex method but with faster calculation time. However, more exchange links (r) means a processing time closer to the Simplex method.

116

Authors: Viji Gripsy Jebaseelan, Anithalakshmi Srinivasan

Location aided routing in Mobile-Ad hoc networks are the most significant process because it limits the route search and allows routing with least messages. Due to the dynamic and uncertain infrastructure of Ad-hoc and sensor networks also creates several security issues like route misbehaviors. This paper aims to develop a new lightweight route selection scheme with the security concern. In this scheme, the routing attack targets are identified and avoided by deploying intellectual watchdog and lightweight key verification mechanisms, the scheme also utilizes the curved rectangle zone selection for shrinking route search space. The scheme is extended to adopt the curved rectangle zone routing for both Ad-hoc and Sensor Networks. The core functionality of the proposed work in terms of cost effective and secure route selection is validated by NS-2 tool. The experimental results demonstrated that the proposed approach is cost effective and secure and provides significant performance improvements with least energy consumption

134

Authors: Sindhu Babulogiah, Valarmathi Jayaraman, Christopher Sargunaraj

This paper discusses about the range estimation using multiple model method for single sensor bearing only tracking (BOT) in 3D. For BOT, the ownship is assumed to take a manoeuvre to gain observability in range and target state. The unknown target range was divided into uniform sub-intervals and nonlinear filters like Extended and unscented Kalman filter (EKF and UKF) with Cartesian and modified spherical coordinates (MSC) were implemented. Comparative results indicate that, UKF in MSC performs better with high computational time. This paper introduces Adaptive nonlinear filter (ANF) to get better range estimate with reduced computational time without affecting the filter performance. It is accomplished by conjoining Cartesian EKF with UKF in MSC, adaptively during the stationary and manoeuvring ownship conditions. The performance comparison was analysed using root mean square error, bias error and computational time. Simulation results reveal that ANF shows better results with reduced computational time.

156

Authors: Ketthari Thandapani, Sugumar Rajendran

Privacy Preserving Data Mining (PPDM) has turned into a well-known research region. Step by step instructions are adjusted between privacy assurance and knowledge discovery in the sharing procedure is a critical issue. Likewise, currently, not more strategies are accessible in the literature to hide the sensitive itemsets in the database. One of the existing privacy-preserving utility mining strategies uses two algorithms, HHUIF and MSICF to disguise the sensitive item sets so that the foes can't mine them from the modified database. This paper concentrates the privacy for the sensitive data actualize in a hybrid approach that is Optimal High Utility Item Selector (OHUIS) method. This Item Selector (IS) procedure upgrades the threshold utilizing inspired Krill Herd Optimization (KHO) method. With a specific end goal to hide the sensitive item sets, the frequency estimation of the items is changed. On the off chance that the utility estimations of the items are same, the OHUIS algorithm chooses the precise items and after that, the frequency estimations of the selected items are altered. The proposed OHUIS reduces the computation many-sided quality and also enhances the hiding performance of the item sets. The algorithm is actualized and the resultant item sets are thought about against the item sets that are acquired from the traditional privacy preserving utility mining algorithms. The test comes about demonstrate that OHUIS accomplishes the lower miss costs compared to the existing procedures for various manufactured datasets.

174

Authors: Zavli Juwantara, Maman Abdurohman, Sidik Prabowo

This paper proposes the enhancement of a selected Fuzzy Multiple Attribute Decision Making algorithm, namely Modified Multiplicative Exponent Weighting (M2EW) algorithm. The main focus of improving the Multiplicative Exponent Weighting (MEW) algorithm is to enhance the reliability of alternative vector preference calculations for selecting network candidates in a vertical handover (VHO). However, MEW algorithm has resulted in relative accuracy from each network which has not, in many cases, matched the necessary conditions. The improvement is done by calculating the Euclidean distance between the nodes represented by the weight values of each selected network candidate parameter. There are various algorithms used to support the VHO mechanism, for example an algorithm that calculates the value of each of the network selection parameters such as RSS, bandwidth or network speed such as Simple Additive Weighting (SAW) and MEW algorithm. The result shows that the M2EW algorithm has increased the relative standard deviation value by 0.2% and has shown the same delay as the MEW algorithm.

192

Authors: Eman El Sayed, Abeer El Korany, Akram Salah, Hesham Hefny

Continually, search engines improve their capabilities toward facilitating search and the retrieval enhancement. Despite the great efforts in the information retrieval field, the retrieved results may be out of user’s expectation. This may be due to the huge number of web resources, and unidentified user’s interests and domain. This paper proposes exploiting social annotations for improving retrieval based on personalization. The personalization focuses on web resources and retrieval process. In this context, new layer of knowledge is added to the web resource analysis and retrieval. Then, the additional knowledge leads to improve the retrieved results to be close to user’s interests. So, it retrieved different results for the same query based on the user’s interests. By applying the system, the experiments realize 36% precision improvement compared to non-personalized search engine. Moreover, the user satisfaction measured by evaluating search results versus user’s priorities, where it was in between 92% up to 100%.

211

Authors: Vinod Kumar, Ramjeevan Singh Thakur

High utility webpage set states to those set of webpages which have high utility value in a weblog database. To find high utility item sets from transactional databases, there exist various algorithms. However, these existing algorithms mostly deals with data like- categorical, time series, binary etc. The weblog data is different from other types of data. The utility webpages extracted from the log data can be used for knowing the user’s behaviour. In this research paper, two algorithms named HUWSM (high utility webpage sets mining) and HUWP-FP (high utility webpage sets - frequent pattern) Tree have been developed and used for efficiently mining high utility webpage sets from web log database. Along with this, a pattern generation technique based on the ‘Jaccard Similarity’ is also included in this method. The HUWSM method has also been compared with various other existing methods. This algorithm has shown a much better performance and more effectiveness over other algorithms like FHM, HUI-MINER and IHUP methods in terms of memory consumption and execution time.

230

Authors: Kotari Sridevi, Mandapati Sridhar

An unstructured version of a traditional wireless network provides a mobile ad hoc network (MANET) that is well suited for emergencies. However, due to lack of infrastructure and resource limitations, many performance problems occur at the same time. High-security vulnerabilities are likely to arise, largely because of dynamic behavior, and the complete communication cycle dependent on unidentified nodes which join and leaves as they want. Several past security schemes studies suggested that reliable and trusted nodes can minimize communication overhead and achieve higher throughput. This kind of scheme affects the route chosen for communication because it cannot distinguish between intentional and unintentional errors at runtime. It is, therefore, important to categorize node activities and also provide a node recovery scheme to regain their original reliability for the genuine nodes. In this paper, we propose a Reliable Trustworthy Approach (RTA) based on node behavior prediction for secure routing. It presents a behavior prediction algorithm for recognizing node behavior by differentiating among the unintentional transient errors and intentional malicious behavior, and the RTA mechanism which provides a method for node trust computation and a method for trust recovery. Experiment results show throughput improvisation against the malicious node intrusion. With increasing, malicious nodes in network RTA mechanism effectively predicted with an optimal packet loss and delay it attained prove the effectiveness of the mechanism.

250

Authors: Sumalatha Madugula, Panchala Venkata Naganjaneyulu, Kodati Satya Prasad

In VLSI design, performance parameters such as speed and hardware cost are important facts during the implementation of complex algorithms. In this paper, Low Cost Carry SeLect Adder Finite Impulse Response (LC-CSLA-FIR) is introduced to perform the FIR filter operations. With the help of shifter-I, shifter-II, and Shifter-III circuits, the FIR filter operation is performed without using any multipliers. In this new architecture, there is no need of storing the co-efficient in the ROM and number of multipliers. Due to the absence of multipliers, the quantity of hardware is reduced and the performance of the architecture is increase. With the help of Verilog code, the FIR filter architecture is verified in Modelsim software. After Field Programmable Gate Array (FPGA) analysis, Look Up Table (LUT), slices, flip flops, frequency and ASIC implementation area, power, delay, Area Power Product (APP), Area Delay Product (ADP) is improved in LC-CSLA-RFIR method compare to conventional methods.

273

Authors: Sharmasth Vali Yerur, Prakash Natarajan, Tiruchirai Ramanujam Rangaswamy

The open nature of Mobile Ad Hoc NETworks (MANETs) provides an opportunity for intrusions. The current intrusion mechanisms are reactive and incapable of preventing the intrusions proactively. This paper proposes the secure routing using Hybrid intrusion prevention systems against dropping and data integrity THreat (SHEATH). This proposal implements self-key and mutual-key reliant prevention and the appearance frequency based behavior certainty measurement on routing paths. The self-key prevention scheme exploits the encrypted value of the sequence number as a normal pattern and the decryption determine whether the route reply is the result of a malicious node or not. The behavior certainty measurement using distributed selection of Squad Head nodes ensures the effective observation of misuse pattern and minimum routing overhead. The data forwarding phase shares a mutual key between the communicating nodes that prevent the data integrity attacks. The simulation results confirm the efficiency of the hybrid preventive scheme against intrusions.

1

Authors: Abdelhamid El Ibrahimi, Abdennasser Baali

This contribution will verify the effectiveness of formal neural networks for predicting drought in a semi-arid region using a hybrid model of formal neural networks (ANN-MLP) and the standardized precipitation index ( SPI). Three types of models have been optimized to achieve this objective. A database consisting of SPI values, rain, temperature and potential evapotranspiration (PET) at the monthly time step was used as input for these models. These data have been standardized between 0 and 1 and subdivided into two blocks: a first block composed of 2/3 of the data for learning and a second block composed of 1/3 of the data for the test and the validation of the models. These models have been optimized with supervised learning. The activation function chosen is the logistic variant of the type sigmoid. The mean square error (RMSE), the correlation coefficient (R), the criterion of Nash-Sutcliffe (Nash) and the absolute mean error (MAE) were used to test the performance of these models. The results obtained show that the 3rd model is the most efficient. The application of neural networks for the estimation of the dryness of the Saïss Plain yielded quite good results. Indeed, the coefficients of correlation between the predicted and the measured values range from 0.63 to 0.97. It is therefore noted that the performances obtained are relatively good and could be improved by using a larger database.

19

Authors: Pallab Kumar Dey, Sripati Mukhopadhyay

Most of the data mining algorithm's application hampers due to missing attribute values. Inadequate treatment of missing values seriously affects the data mining and classification accuracy. A useful technique has been proposed to deal with missing attribute values. Rough set approach to incomplete information system has been shown. Application of discernible matrix for incomplete information to compute core and reduct has been shown. Imputation based preprocessing approach depends on relation between present attribute value and incomplete attribute value, so have to found most similar object to impute missing value. To find similar objet importance or priority should be given in core attributes, after that reduct attributes if matching occur in corresponding attributes value and other attributes may be neglected. In this paper this concept of core and reduct attributes of rough set has been utilized to fill missing values using the proposed Core Reduct Based (CRB) algorithm. Efficiency of the CRB algorithm in the completeness analysis to incomplete data has been shown by comparing its performance with other existing algorithms using some real life data sets.

38

Authors: Vimala Vellaichamy, Vivekanandan Kalimuthu

A Recommender system (RS) is an information filtering software that helps users with a personalized manner to recommend online products to Users and give suggestions about the products that he or she might like. In e-commerce, collaborative Movie recommender system assist users to select their favorite movies based on their similar neighbor’s movie ratings. However due to data sparsity and scalability problems, neighborhood selection is more challenging with the rapid increasing number of users and movies. In this paper, a hybrid Collaborative Movie Recommender system is proposed that combines Fuzzy C Means clustering (FCM) with Bat optimization to reduce the scalability problem and enhance the clustering which improves recommendation quality. Fuzzy c means clustering is used to cluster the users into different groups. Bat Algorithm is used to obtain the initial position of clusters. Lastly, the proposed system creates movie recommendations for target users. The proposed system was evaluated over Movie Lens dataset. Experiment results obtained show that the proposed Algorithm can yield better recommendation results compared to other techniques in terms of Mean Absolute Error (MAE), precision and Recall.

57

Authors: Anand Shanker Tewari, Asim Gopal Barman

This paper proposes a recommendation system (RS) that generates items recommendations to users with the help of dynamic content based filtering, collaborative filtering, association rules and opinion mining. This RS uses dynamic content based filtering for creating and continuously monitoring the changing shopping behaviour of users. The proposed approach finds other like-minded people with the target user that may cooperate with each other, in the form of items ratings using collaborative filtering. The approach uses association rule mining for the analysis of current market trend. It generates association rules only from those items that are liked by the users. Most of the people prefer to read reviews about the product, before purchasing. Almost all well-known e-commerce websites have hundreds of product reviews available, so it becomes very difficult for the user to read each and every review before buying any item. The proposed approach uses its own unique weighted opinion miner that summarizes the reviews and generates the weights for each item based on customers’ reviews. These weights help in estimating the popularity of an item among customers. This RS generates the final recommendations to users by combining the outputs from the collaborative-classifier, association rules and weighted opinion miner. The proposed RS is evaluated over live dataset using precision evaluation metric. The result shows that recommendations generated by proposed method out performed existing benchmark recommendations methods.

77

Authors: Boominathan Perumal, Aramudhan Murugaiyan

This paper presents a novel application of hypercube framework of ant colony optimization to the virtual machine (VM) placement problem, with the objective of minimizing the power consumption and resource wastage. The aim of the VM placement is to develop an optimal placement strategy to allocate the VM’s to physical servers such that the usage of physical resource is minimized. The hypercube framework of ACO differs from its usual ACO implementation in the hyperspace for the pheromone values. In other words, in the hypercube framework, the updating of pheromone values is constrained to lie between 0 to1. This constrained pheromone updating has an advantage of automatically handling the scaling of objective function values and further leads to robust version pf ACO procedure. Here, we experimentally investigate the influence of hypercube framework of ACO for virtual machine placement using three ACO variants, namely, Ant system, Max-Min Ant System, and Ant colony system.

95

Authors: Srinivasan Kuppuswamy, Balamurugan Panchanathan

Object tracking is a dynamic optimization process based on the temporal information related to the previous frames. Proposing a method with higher precision in complex environments is a challenge for researchers in the field of study. In this paper, we have proposed a novel framework for similar object tracking. In our proposed technique we are considering both PETS and Cricket video for input video sequence. The primary steps of suggested technique are preprocessing, background subtraction and segmentation, similar object detection and object tracking. In the preprocessing stage, the adaptive median filter is used to remove the noise from each frame. Next, the foreground and background images are separated and then segmentation of object is carried out by using morphological operation. For similar object detection, the recommended technique uses the modified local self-similarity descriptor and similar object tracking is done by a particle filter. The performance of the suggested technique is evaluated by means of precision, recall, F-measure, FPR, FNR, PWC, FAR, similarity, specificity, and accuracy. An experimental result shows that the proposed technique attains the maximum tracking efficiency for both videos when compared to the existing techniques.

115

Authors: Devi Thiyagarajan, Ganesan Ramachandrarao

Cloud computing is a popular subject across the IT industry, but many risks associated with this relatively new delivery model is not yet fully understood. Cloud computing is an budding information technology of data storage, of local networks (infrastructure) as well as software and has its advantages of scalability, reliability, high performance and comparatively low cost feasible solution contrast to committed infrastructures. Here, initially the data owner will encrypt the searchable index with ElGamal cryptosystem utilizing Hyper Elliptical Curve Cryptography for double encryption. The ElGamal cryptosystem is utilized for security analysis where in sharing of multiple keys between two parties are performed aiming for better security. The random integer selection in the ElGamal cryptosystem is modified based on optimization process using Modified cuckoo search (MCS). Further Hyper elliptical curve cryptography is incorporated with ElGamal cryptosystem which is utilized for encryption and decryption. Also, the hyper elliptic curve cryptography is modified using auxiliary input in the divisor calculation in order to improve security. For selecting keys, we have used Gravitational search algorithm (GSO). The retrieval process will take a two-round communication between the cloud server and the data user. The experimental results shown that, the recommended technique attains minimum storage cost and minimum computation time when compared to the existing technique.

134

Authors: Monika Verma, Vandana Dixit Kaushik, Vinay Pathak

In this paper a novel method for removing haze is given which is based on the Hue Saturation Value color model together with dark channel subtraction. Single image fog/haze removal is a challenging task due to its ill posed nature. As fog/haze increases the brightness of the images captured also increases. In the current wok, a new methodology has been used which involves the subtraction of extra image brightness from the hazy images for keeping the hue and saturation intact. It uses the information of image brightness to get the clear image by histogram equalization. Together, the three approaches of HSV color model, histogram equalization and Dark Channel Subtraction gives clear images. Experimental results are shown in comparison with the state of the art methods. The approach used in the current paper is at par with the current methodologies and the results are better than the existing approaches.

153

Authors: Veera Venkata Murali Krishna Ravinuthala, Satyananda Reddy Chinnam

Graph based keyword extraction approaches represent the text document as a graph with the words as vertices. An edge between two vertices exists only if the corresponding words are related. The effectiveness of the graph representation is dependent on how the relationship is defined between two words. Early approaches used word order, word co-occurrence and syntactic relationships. Recent graph representation approaches are using lexical association measures for defining relationship between two words. The existing relationships can only help in identifying the words which form the topics in a document. But the topics in a document essentially form a theme in the document. Theme is the central idea conveyed though the topics in a document. In this paper a new relationship is defined between the words to capture the words which convey the theme of the document. This relationship is defined using lexical association among the words in the document. Based on the relationship a graph representation of text is defined and used for extracting the words that build the theme of the document. These words are used for selecting important sentences in the document. Experiments on DUC 2002 data set indicated that the proposed keyword extraction approach improves the quality of Extractive summarization.

172

Authors: John Sahaya Rani Alex, Nithya Venkatesan

Traditional Dynamic Time Warping (DTW) technique find similarities between two one-dimensional time series sequence. Initially, in earlier decades, DTW was not preferred because of its computational complexity. However, due to the evolution of computing power, this has been revisited for spoken keyword detection recently. Conventional spectral features such as Mel-Frequency Cepstral Coefficients (MFCC) and contemporary wavelet features are multi-dimensional in nature which are used in speech recognition. In this work, a new strategy of DTW is proposed to work with multi-dimensional feature vector in calculating the local distance matrix. Additionally, a faster approach is specified to find the similarity in the global distance matrix. The proposed methods are evaluated with MFCC and wavelet features on a connected TIDIGITS corpus for spoken keyword detection system. Experimental results prove that there is an improvement in reduction of computational complexity compared to traditional DTW. Also, contemporary wavelet feature based spoken keyword detection system gave better detection accuracy than MFCC based spoken keyword detection system in the noisy environment.

191

Authors: Azzeddine Dahbi, Siham Jabri, Youssef Balouki, Taoufiq Gadi

Using the association rules in datamining is one of the most relevant techniques in modern society, aiming to extract the interesting correlation and relation among sets of items or products in large transactional databases. The huge number of extracted association rules represents the main problem that a decision maker can face. Hence, the knowledge post-processing phase becomes very important and challenging to define the most interesting association rules, many interestingness measures have been proposed. Currently, there is no optimal measure that can be selected to evaluate the extracted association rules. To bypass this problem, we propose an approach based on multi-criteria optimization aiming to find a good compromise without excluding any measures. The experiments performed on numerous benchmark datasets show that the proposed algorithm is properly reducing a large number of association rules and keeping the most significant and interesting ones compared to other approaches which illustrate the efficiency and the applicability our approach.

210

Authors: Nophanut Katephap, Sunpasit Limnararat

This research investigates the operational, economic and environmental advantages of the returnable packaging under various reverse logistics arrangements, in relation to the disposable packaging. The business under study is a Thai manufacturer and exporter of automotive parts with the trading partners in the Philippines and Vietnam. In the study, a switch was made from the currently disposable packaging to the standardized returnable packaging under three reverse logistics arrangements: the single-, round- and multi-trip arrangements. Due to the large initial investment associated with the returnable packaging, a mathematical model was proposed to calculate the total effective packaging cost. The research findings revealed that the multi-trip reverse logistics arrangement was most operationally and environmentally viable, with the largest total packaging cost reduction and packaging waste reduction of 61% and 68%, relative to the disposable packaging. Meanwhile, the single-trip reverse logistics arrangement was most favorable economically due to its shortest payback period of 0.33 year. Moreover, the life cycle assessment (LCA) was applied to the disposable and returnable packaging to evaluate the environmental impacts throughout their lifetime. The LCA results validate the more environmentally-friendly nature of the returnable packaging.

231

Authors: Mohanaprasad Kothandaraman, Jeet Kiran Pawani, Arulmozhivarman Pachaiyappan, Sankar Ganesh Sankaran

In this paper a PEVD (Polynomial Eigen Value Decomposition) based adaptive kalman filter is proposed for Acoustic Echo Cancellation (AEC) in the presence of noise. Acoustic echo is the phenomenon when the speaker listens to his own voice after some delay while speaking to his fellow mate on a call. The presence of acoustic coupling between the loudspeakers and the near-end microphone signal produces an undesired acoustic echo, which reduces the speech quality. Existing AEC system implemented adaptive kalman filter which results in less output efficiency in the noisy environment. In the proposed method, the near end speech is separated from the acoustic echo as well as from the surrounding noise by using PEVD based adaptive kalman filter. Initially mixed microphone signal is pre-processed by Polynomial Eigen Value Decomposition which strongly de-correlates the signal and also de-correlates out the noise. The pre-processed signal is passed through adaptive kalman filter for estimation of the acoustic echo. The efficiency of the output is calculated using Echo Return Loss Enhancement (ERLE). If the ERLE lies in the range of 30-40 dB indicates the good echo cancellation. The simulations show that the proposed PEVD based adaptive kalman method provides higher cancellation of echo. The simulations are being carried out in Matlab 2016a.

247

Authors: Parvathy Madhukumar, Ganesan Ramu, Balaji Veerasamy, Felix Joseph

Turbo decoding for the advanced 4GPP-LTE wireless communication standard is the most challenging technique in terms of computational complexity and power consumption of corresponding cellular devices. The standard VLSI implementation of turbo decoder requires memory, latency, area, power, and throughput. These particularities cannot tolerate in some applications as well as the previous method of floating point has some pitfalls due to this; the performance is degraded. The novel fixed point technique for SISO parallel advanced long-term evolution turbo decoders with new hard-wried 6144 bit interleaver is proposed here to achieve the specification. The major contribution of the planned methodology is the enhancement of throughput in parallel SISO decoders by eliminating the critical data path problem in floating point method. The signal to noise ratio is calculated to reduce the power consumption, and zero state metrics are used to eliminate the bit error rate. The designed algorithms are used to enhance the error correction capacity.

267

Authors: Shankar Ramasamy, Karthikeyan Eswaramoorthy

Voice over Inter Protocol (VoIP) empowers in the integration of voice data over IP networks, minimizing the cost of network transmission for helping users of IP protocol. Robust and effective procedure of handoff is introduced for increasing the quality and the dependability of the networks. Ant Colony Optimization (ACO) is presented for the handoff mechanism and Mean Opinion Score (MOS) is observed to be the fitness value for obtained measurements of the assessment of voice quality. In this research, the scheme of Multiplex-Multicast (M-M) is proposed that will improve the capability of VoIP in WLAN to 100% in the form of an infrastructure Basic Service Set (BSS). This research work deals with the security features of VoIP in order to enhance the quality making use of Verifiable Secret Sharing (VSS) with the help of M-M scheme. The M-M scheme will eliminate the downlink VoIP traffic ineffectiveness through the multiplexing of the packets from different VoIP streams into one multicast packet for transmitting over the WLAN. The results from simulation indicate the advancements in the security enhancements making use of the proposed schemes. The average Round Trip Time (RTT) results of the proposed VSS with M-M are 0.30436 milliseconds, whereas average RTT is 0.3598 milliseconds and 0.43604 milliseconds for VSS and Shamir SS methods respectively. It concludes that the proposed VSS with M-M takes lesser RTT results when compared to existing methods.

1

Authors: Sreesudha Parnapalli, Barooru Lakshmi Malleswari

In the late years, MIMO MC-CDMA approach has been proposed in order to expand framework capacity over frequency-selective wireless channels. The key component of MIMO MC-CDMA is the capacity of abusing diversity jointly in time, frequency and in the space domain. In this work, we implement an efficient multi-user STBC MC-CDMA transmission System Based on Minimum Conditional BER Criterion and Oppositional krill herd algorithm (OKHA) assisted channel estimation. The multiuser MC-CDMA system using Alamouti’s Space-Time Block coding for encoding the transmitting sequence. The estimation of Channel State Information (CSI) is optimally selected using OKHA. Normally, KHA is a natural-inspired metaheuristic algorithm which mimics the herding behavior of ocean krill individual. To improve the convergence speed and accuracy of the basic KHA algorithm, in this proposed work we combine KHA with oppositional based learning (OBL). The experimental results are conducted for the different algorithm based on BER, SER, and spectral efficiency. The simulation results show that the proposed algorithm is properly reducing the BER, SER and properly increase the spectral efficiency value compare to other techniques.

18

Authors: Gadekallu Thippa Reddy, Neelu Khare

Huge amount of medical data is available today. In order to predict the disease we need a reliable method to diagnose the disease. In this paper we introduce a technique known as FFBAT-ANN prediction algorithm which is categorized as Feature reduction and Diabetes disease classification and such a process is carried out using LPP algorithm and FFBAT- artificial neural network classifier respectively. Initially, LPP algorithm is employed to produce fuzzy rules by recognizing the attributes corresponding to the diabetes disease. Later on, the classification is carried out by blending FFBAT optimization technique with Artificial Neural Network classifier. Finally, the experiment is performed on diabetes dataset. The experimental result proves that the performance of our proposed method outperforms the other conventional methods.

41

Authors: Hady E. Abdel-Maksoud, Mahmoud M. Khater, Shaaban M. Shaaban

Aiming to improve the control performance in the switched reluctance (SR) motor drives, this paper presents a simple nonlinear mathematical model of SRM. The model depends on describing the characteristic data obtained from finite element analysis (FEA) in a simple parametric formula. An adaptive fuzzy logic PI controller is used with the suggested model in speed control drive system. The controller is designed based on Mamdani type with nine control rules along with Gaussian function memberships. The control technique is implemented and tested under different operating conditions as well as its results are compared with those of conventional PI controller. Both control schemes operate in pulse width modulation (PWM) control mode. The proposed adaptive fuzzy logic PI improves the motor speed performance in terms of tracking precision and travel time.

60

Authors: Shounak Rushikesh Sugave, Suhas Haribhau Patil, B. Eswara Reddy

Software testing is required to detect the faults and to ensure the quality of the software under development. Usually, test suites are used to evaluate the software system during the software development cycle. But often test suites contain more redundant test cases due to overlapped test objectives. So, the test-suite reduction is an important step to reduce the number of test cases so as to satisfy the entire objectives with less computational cost. Literature presents different methods to select the suitable test suites of optimal subsets for regression testing. Accordingly, this research aims to develop an effective test suite reduction approach for regression testing. The proposed algorithm (GTAP) is newly designed using TAP measure and greedy search algorithm. This algorithm uses TAP-measure which is specially developed for measuring the importance of test cases. The performance of the GTAP algorithm is evaluated using four different evaluation metrics with eleven subject programs available in SIR repository. From the experimentation, the average performance of the proposed GTAP algorithm in all the programs is 93.07% which is higher than the DIV-GA which obtained the value of 90.27%.

81

Authors: Sharmasth Vali Yeruru, Tiruchirai Ramanujam Rangaswamy

The distinctive aspect of Mobile Ad Hoc Networks (MANETs), including dynamic network topology, susceptible wireless medium, limited battery power, network overhead are highly vulnerable and remains as major issues in designing Intrusion Detection Systems (IDS). This paper proposes a framework of Anomaly IDS with Subjective logic based Trust (AID-ST) system to discern and eradicate the intruders from the network. AID-ST system incorporates multi-dimensional trust parameters and subjective logic theory to effectively detect and confirm the attack behavior. The system measures indirect trust of a node using subjective logic theory, and IDS estimates trustworthiness of a suspected node by collecting and combining the evidence from various observers. The simulation results depict that the AID-ST attains high performance in terms of detection accuracy, overhead, and energy consumption when compared to existing AIPD AODV.

100

Authors: Mahendra Pratap Singh, Sanjay Kumar Dubey

Anaemia is a serious health condition caused primarily by deficiency of iron in the body. In India cases of anaemia are on an alarmingly high rate affecting pregnant women, men and children alike. Malnutrition has been identified as the primary cause of iron deficiency. The treatment of anaemia can be accomplished by adhering to a stringent diet plan containing all the critical nutrients in the right amount. This makes it a complex process to pick the most relevant diet plan among all the available ones. Our objective here pertains to determining the best diet plan for anaemia patient and to procure this we are employing Analytic Hierarchy Process (AHP) in the proposed paper. Diet recommendation for anaemia patient using AHP is relatively new, making this work as unique. The results obtained show the best diet among the available ones that must be recommended to an anaemia patient. This diet contains all the meals that must be consumed at breakfast, lunch and dinner by an anaemia patient. The proposed work is further validated using Fuzzy Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS). The results obtained after validation are exactly the same as determined using AHP.

117

Authors: Fakhriy Hario, I Wayan Mustika, Adhi Susanto, Sholeh Hadi, Sevia M Idrus

Nonlinearity characteristic in OFDM (Orthogonal Frequency Division Multiplexing)-RoF (Radio over Fiber) system which causes the frequency shift of light and has a high electrical field on medium transmission. We begin by discussing SPM (Self Phase Modulation) and GVD (Group Velocity Dispersion) are part of nonlinear characteristic. SPM induced spectral broadening will be degrade performance of light wave and GVD will be impact on duration pulse of optic. The impaired information signal reduces the power and later affects the quality of signal. This research aims to focus on the improvement of two external modulator LiNbO3 MZM (Lithium Niobate-Mach Zehnder Modulator) and applying of frequency dithering techniques to reduce the existing nonlinearity of the optical fiber purposely to enhance the receiving power for the lower input power with the length of fiber up to 100 km. Finally, the result shows an average of 18.5% increase in the power level for linewidth of 1 MHz, 3 MHz, and 7 MHz across 50 km distance with the log BER (Bit Error Rate) -2.407, BER 0.003, and SNR (Signal to Noise Ratio) 43.8, across 100 km of optical fiber the value of log BER -2.471, BER 0.003, and SNR 49.14.

135

Authors: Thaksin Sangsuwan, Teerawat Thepmanee, Amphawan Julsereewong

Detailed knowledge of how to balance between safety and availability for instruments is essential to successful design and implementation in fieldbus-based process control systems. The configuration correctness is crucial to actually obtain the benefits of digital fieldbus technology used. In actuality, a number of device parameters must be set to provide the required functionalities. This paper focuses on improving safety and availability for the proportional-integral-derivative (PID) and cascade control strategies using Foundation Fieldbus (FF) with control in the field. The aim of this paper is to analyze the logical behaviors of PID and cascade loops in two conflicting purposes for studying how different configuration options affect the interlocks between function blocks located in instruments as well as the initialization and fail-safe mechanisms in response to invalid measurements. For safety purpose, the interested control loops are configured to bring the process to a safe state in the presence of a fault. For availability purpose, the interested control loops are configured to keep the process running in the event of a failure. A water tank process is utilized as a case study for control loop implementations. Interactions between the status propagation and mode shedding for demonstrating the studied control loop behaviors are examined experimentally in Petri net models. In addition, the function block options for bumpless transfer and setpoint tracking are also described. The proved configuration method for proper operations in balancing the interests of safety and availability is proposed.

157

Authors: Theagarajan Senthil, Balasubramanian Kannapiran

Energy conservation is the major concern of Wireless Sensor Networks, as the energy is the determining factor of the network lifetime. The reason is that the energy level of sensors has a great impact on the network lifetime. Several mechanisms have been proposed to minimize the energy consumption of nodes. In this paper, a cluster based, trustworthy topology management mechanism is presented and is proved to be energy efficient. The entire work relies on three important phases and they are cluster formation, chief node selection, trust degree computation and node’s state control. The cluster is formed by taking the location coordinates into account. This is followed by the selection of chief node. The chief node is responsible for computing the trust degree and to control the state of the constituent nodes. As limited count of nodes is involved in the process, the lifetime of the network is considerably improved. Finally, the proposed work is tested for its efficacy and the experimental results are satisfactory with respect to network lifetime.

175

Authors: Shyamala Loganathan, Renuka Devi Saravanan, Saswati Mukherjee

A cloud system uses virtualization technology to provide cloud resources (e.g. CPU, memory) to users in form of virtual machines. Job requests are assigned on these VMs for execution. Efficient job assignment on VMs will reduce the number of hosts used. Hence, it is essential to achieve energy optimization in cloud computing environments. Therefore, in this paper, a job scheduling mechanism is proposed to assign job to a VM of the existing active hosts itself by considering job classification and preemption. So that minimizing the number of host used in allocation intern reduces the energy consumption in the Cloud datacenter. In our proposed job scheduling algorithm, categorizing the job in to three different types and assigned based on preemption policy with the earliest available time of the resource (VM) which is attached to a host. Thereby, we reduce the energy consumption by making less number of hosts in the active state and increase the utilization of active host. Finally, we conduct simulations using CloudSim and compare our algorithm with other existing methods. Significant energy savings can be obtained depending on system loads. Energy saving is about 2% to 46% with respect to the non-energy aware algorithm, 1% to 7% than the energy aware algorithms.

193

Authors: Vangapelli Sowmya, Bulusu Vishnu Vardhan, Mantena S.V.S. Bhadri Raju

Semantic Textual Similarity (STS) measures the degree of semantic equivalence between two segments of text, even though the similar context is expressed using different words. The textual segments are word phrases, sentences, paragraphs or documents. The similarity can be measured using lexical, syntactic and semantic information embedded in the sentences. The STS task in SemEval workshop is viewed as a regression problem, where real-valued output is clipped to the range 0-5 on a sentence pair. In this paper, empirical evaluations are carried using lexical, syntactic and semantic features on STS 2016 dataset. A new syntactic feature, Phrase Entity Alignment (PEA) is proposed. A phrase entity is a conceptual unit in a sentence with a subject or an object and its describing words. PEA aligns phrase entities present in the sentences based on their similarity scores. STS score is measured by combing the similarity scores of all aligned phrase entities. The impact of PEA on semantic textual equivalence is depicted using Pearson correlation between system generated scores and the human annotations. The proposed system attains a mean score of 0.7454 using random forest regression model. The results indicate that the system using the lexical, syntactic and semantic features together with PEA feature perform comparably better than existing systems.

217

Authors: Samarth Borker, Sanjiv Bonde

This paper proposes a novel method for underwater image enhancement algorithm using Principal Component Analysis (PCA) fusion. For fusion process, the dual images are derived using single underwater degraded image. The novelty of this work is the fact that it does not demand any underwater scene parameters beforehand and is independent of prior based information. Secondly, we demonstrated the successful use of homomorphic filter and adaptive histogram equalization for individual color channels followed with image smoothing as two inputs to fusion scheme. The fused image is subsequently post-processed using color constancy technique for effective results. The visual and quantitative analysis of this method is carried out with contemporary underwater dehazing and enhancement algorithms. Metrics such as entropy and quantification of restored edges is utilized to validate our findings. The outcome reveals better exposure of dark areas, enhancement of edges, increase in overall contrast and preservation of natural colors.

235

Authors: Jay Prakash, Rakesh Kumar, Jai Prakash Saini

Mobile Ad-hoc Networks (MANETs) find numerous applications. Its utility can be extended by integrating it with Internet. Some real-life applications where such integrated networks can be used are disaster situation viz., earthquake, battle fields etc. MANETs are dynamic topology, infrastructure less and standalone networks of wireless mobile nodes. To overcome this limitation, MANET needs to connect to the Internet. In such networks, mobile nodes do not have wired connection, so they do not follow any particular route to transfer their packets. Thus, every time when topology changes, routing paths changes too. However, every node selects the shortest path to route their packet. In that case, this path will be congested due to overload. We propose a load balancing adaptive Internet gateway discovery approach which focuses on solving the problem of overload and congestion in mobile ad-hoc domain. Particle Swarm Optimization is used for selecting an optimal path among all paths available. Our work is to optimize this load balancing problem. We are using Particle Swarm Optimization (PSO) concept to overcome this problem. In our approach, we use soft computing technique viz., working procedure of PSO algorithm which searches the optimal paths using some mathematical function. Then, we combine shortest path algorithm with the gateway discovery algorithm. Thus, the algorithm first selects the shortest path stored in the memory and check whether it is free for routing packets or not, if the route is free or lightly loaded, then the source node will transfer packets otherwise if the node is overloaded, then PSO searches for the next optimal neighbour or node to route the packet. The new path is selected to route packets and stored in the place of current available path. Proposed algorithm has been implemented in MATLAB. Our approach outperforms the existing approaches.

256

Authors: Santhi Kannan, Saravanan Ramakrishnan

Cloud technology is broadly supported by healthcare organizations worldwide. Throughout the previous few years, healthcare industries have recognized the potential of cloud computing architecture and how it can assistance them to give quality services to patients. The cloud technology has faster the way healthcare industry can use or share information crossways a network. This paper offering an e-health solution founded on healthcare information systems joined with cloud computing concept emphasis on medical information processing. Our proposed work based on public cloud and request management application has been proposed and analysed in terms of waiting time defined as Quality of Service criteria (QoS). The service of the public cloud has been modelled using queueing theory as two serially connected queues (Tandem Queues) M/M/s and single server retrial queue (SSRQ). The results obtained in our proposed model are considerably reducing the total waiting time of different class of units in the cloud system than the existing system and more utilization of service in cloud.

274

Authors: Kavita Bhatnagar, Subhash Chander Gupta

Our previous article has proposed a simulation model to explore the nonlinear relationship between the nonlinear regime of the fiber, laser intensity and the error probability of the optical link. This paper extends the model to include the effective area of the fiber. In order to handle the extended parameter, time series feed forward neural network based prediction model is proposed. The reliability of the model is substantiated by extensive experimental analysis through which the relationship exhibiting between the laser intensity and the corresponding nonlinear regime and effective area of the fiber can be observed. The observed results demonstrate the performance of the prediction model in estimating the launch power to meet the desired error probability under varying nonlinear regime and effective of the fiber.

1

Authors: Vanaja Roselin Emmanvelraj Chirchi, Laxman Madhavrao Waghmare

In this paper, we propose a novel method for iris recognition system using enhanced isocentric segmentor (EISOS) and wavelet rectangular coder (WRC). At first, we locate the center of the eye within the area of the pupil on low resolution images using EISOS method. Once the iris region is successfully segmented, the next stage is to transform the iris region into the fixed dimensions. Then, we propose a novel feature vector generation method namely, wavelet rectangular coder (WRC). Finally, we recognize the iris image using fuzzy logic classifier to identify whether the iris image is present in the dataset or not. The iris recognition performance is measured using different dataset such as, CASIA, MMU and UBIRIS dataset. Experimental results indicate that the proposed method of EISOS+WRC based iris segmentation and recognition framework have outperformed by having better accuracy of 99.75% which is 94% and 93% for using existing approaches.

20

Authors: Loukal Keltoum, Benalia Leila, Bouguerra Abderrahmen

The mean of this paper is fuzzy sliding mode control of a Doubly Fed Induction Motor (DFIM); it’s the coupling of the fuzzy logic control and sliding mode control (SMC). The use of the sliding mode method provides very acceptable performance for DFIM control, and the chattering phenomenon effect is also eliminated by the fuzzy logic mode. In the first part, we carried out briefly a study of modeling on the full system. This model is intended to facilitate the procedures for setting and controlling the speed. We introduced the parameter variation to test the robustness of the control laws. The results of our simulations are conducted to validate the theory and indicate that the control performance of the DFIM is satisfactory and the proposed fuzzy sliding mode control (FSMC) can achieve favorable tracking performance.

38

Authors: Rama RaoAdimalla, Vatsavayi Valli Kumari, Ch Satyananda Reddy

Mobile ad-hoc network face a serious issue of frequent change of network topology which leads to the stability and reliability problems of routing. Many routing schemes such as multi-path routing and backup path routing are developed to increase the link reliability in the literature. Accordingly, we propose to design a backup route establishment for QoS routing protocol. In this protocol, the potential failures of network and node are identified and a backup routing is initiated. For detection of failures, a path evaluation function is determined based on the metrics energy drain rate and interference, congestion status are measured. The primary path satisfying the QoS parameters node’s static resource capacity, dynamic resource availability, neighborhood quality, link quality is established. Once failure is detected, back up routes are established and transmission is redirected on these back up routes. Simulation results show that the proposed protocol has reduced recovery delay and improved throughput as compared with the existing protocol. The improvement of 68% in terms of delay, 30% in terms of delivery ratio and 83% in terms of throughput are achieved for the proposed routing protocol.

58

Authors: Banoth Rajkumar, Gugulothu Narsimha

This paper proposes an incorporation mechanism of primitives to provide complete cryptography services for Mobile Ad-Hoc Networks (MANETs). The proposed approach is the Secure Light Weight Encryption Protocol for MANET, where an algorithm for providing availability with DoS resilience has been implemented to avoid TCP SYN flooding packets in the network and passes other packets and also an authentication code and hash function is generated. Later the intermediate nodes are allowed to recode the encoded data in the network. Through which the confidentiality and non-repudiation, key management, integration is achieved.

75

Authors: Thangavel Muthamilselvan, Balamurugan Balusamy

The growth of IT industry technology is absorbed by the cloud service technology, which leads to secure connectivity and availability of services to cloud users. This paper proposes an e-health data classification system that gives the services to e-health cloud user for their disease prediction requirements. The tree bagging method is suitable to select better weighted attributes and the careful seeding of K-means ++ algorithm improves the accuracy and speed of clustering. Most of the tree classification methods use only information gain as the strategy to select suitable attributes for classification. We used information gain in bagging technique to improve accuracy. In this research article, we proposed a method to Coalescing Decision tree classification algorithm, bagging technique, and K-means++ algorithm to build a better classifier for the e-health cloud users. It was evaluated with the standard data sets such as Diabetes, breast cancer, liver disorders and cardiotocography.

94

Authors: M. B. Jayalekshmi, S. H. Krishnaveni

Cloud computing is a paradigm which offers a range of services to the cloud users. Cloud storage is the most popular service, as the data owners are freed up from the data management and storage overhead. However, the data owners are concerned about the security of the data. In order to address this issue, this article presents a twin layered security scheme, which guarantees the security of the data and thus the data integrity is preserved. The proposed work involves two building blocks, which are hashing and encryption. The input data is separated into several blocks, followed by which a tree is constructed. This is followed by the computation of hash codes, which is done by the keccak-256 hash function. The hash codes are then encrypted by Advanced Encryption Standard (AES) (256) with a dynamic key being generated by CodeIgniter. Thus, the security of the system is tightened and misuse of the data is strictly denied. The performance of the proposed work is tested with respect to throughput, memory and time consumption. The experimental results are reasonable, when compared to the analogous algorithms.

117

Authors: Vyacheslav Shulunov, Irina Esheeva

The article considering the problem of quick transformation of solids of revolution into raster layer for Roll Powder Sintering (RPS) additive manufacturing technology. The author describes the algorithm for solving this problem. This work is devoted to the development and the validation of the impetuous algorithm for converting the 3D coordinates of a solid of revolution to spiral coordinates. It is based on the assumption that one point on the figure of revolution is predetermined multitude of points in the spiral coordinate system and these can be defined without calculations because of symmetry properties. Such method provides to accelerate the performance of the coordinate conversion thousand fold and real time forming objects 1.5 m3 in volume with layer thickness ~25 µm by non-powerful computers per hour. The proposed algorithm has been extensively tested and proven by numerical examples of several parts of computer aided design models. It is faster than other coordinates transformations and can be extended to the acceleration converting and processing geometry of 3D objects.

136

Authors: Pooja Choudhary, Jaisankar Natarajan

It is always an effective option for storing the data on cloud as it has advantages such as processing huge volume of data on user’s request. But policy updating is one of challenging issue when attribute based encryption method is used for constructing schemes such as access control. Many techniques have been proposed for achieving secure data access control in any cloud storage system, but policy updating is always a problem. In this paper, a novel scheme is proposed to enable to access control by using method known as dynamic policy updating for the data in cloud. The focus of this paper is to develop dynamic policy updating method for the data which is stored in the cloud. This method will help the data owners to update the policy for the data which is stored in the cloud. The features of this method are that data owner can update the policy on his data and data will be encrypted according to the new policy and user will be able to download only if he has new policy which is not possible in existing methods. The drawback of traditional method was removed such as user revocation and method is made more efficient access control scheme policy update based on attribute. The results show that policy can be updated for the data stored in the cloud and revoked user cannot download the file. Only the data owner can update the policy for his data in the cloud other than data owner cannot do this.

155

Authors: Jegan Govindasamy, Samundiswary Punniakodi

Nowadays, ZigBee is one of the dominating standards for wireless sensor networks and Internet of Things (IoT) networks. Even though, the ZigBee standard is formed with low per-unit costs, security in mind and network resilience, existing security mechanisms are not effective to provide security and protection against wormhole attacks and Distributed Denial of Service ( DDoS) attacks on networks such as WSN and IoT. They also introduce high consumption of energy, storage memory and processing. In this work, Energy Efficient Intrusion Detection System (EE-IDS) and Energy Efficient Intrusion Detection System with Energy Prediction (EE-IDSEP) are proposed for protection of ZigBee based wireless sensor networks in presence of wormhole attacks and ( DDoS) attacks. The EE-IDS is developed and its performance is evaluated by considering three different routing protocols such as Ad hoc On-Demand Distance Vector (AODV), Shortcut Tree Routing (STR) and Opportunistic Shortcut Tree Routing (OSTR) to improve the security against wormhole attack and to mitigate the energy consumption of the sensor nodes in the ZigBee based wireless sensor networks. The proposed EE-IDS and EE-IDSEP are evaluated through extensive simulations by using NS2 and then compared with the existing Energy Efficient Trust System for Wormhole detection (EE-TSW) and Energy Efficient Trust System (EE-TS) for detection of DDoS attack. It is inferred from the simulation results that proposed IDS namely EE-IDS-AODV, EE-IDS-STR and EE-IDS-OSTR for detection of wormhole attack have better performance than that of existing EE-TSW and proposed system EE-IDSEP for detection of DDoS attack have also shown better performance than that of existing system EE-TS in terms of performance metrics such as Packet Delivery Ratio (PDR), Average End-to-End Delay, energy consumption, detection rate, average detection time and False Positive Rate (FPR).

173

Authors: Malay Bhatt, Tejas Patalia

A large number of folk dance videos are uploaded on the web or added as a situational song in the Bollywood movies. The classification of folk dance videos is essential for dance education, to preserve cultural heritage, and for music companies to provide better customer oriented service. India is a country having many regional languages and each region has its own popular folk dances. Four different Indian folk dances namely, 'Garba', 'Lavani', 'Ghoomar' and 'Bhangra' are considered. A Folk Dance Classification Framework is proposed which extracts audio signal from video, takes a fragment of 125 seconds from the beginning and further separates it into a set of small segments, calculates Mel-frequency Cepstral Coefficients (MFCC) and Linear Predictive Coding (LPC) coefficients, generates high dimensional feature vector, reduces dimensionality using Principle Component Analysis (PCA) and classifies segments using Scale Conjugate Gradient Neural Network. The performances of chosen classifiers, K-Nearest Neighbor, Naïve Bayes and Neural Networks, are compared. Class labels of all segments are clubbed together and based on majority voting class label is assigned to a folk dance song. System achieves more than 90% accuracy.

192

Authors: Ghetiya Rutvi Babulal, Gayathri Prakasam

Proficient Algorithms for Mining High Utility Itemset in One Phase utilizing Direct Discovery of High Utility Patterns refers to the disclosure of object/item sets with high utility. The situation may end up being more terrible when the database contains long high utility itemsets.The information of high utility itemsets is kept up in a tree-based data structure UP-Tree to such a degree, to the point that required itemsets can be created productivity with only two yields of database. The execution of existing algorithm issue all utilize a two-stage, applicant era approach with an exemption which is however neither efficient nor versatile in case of huge databases. This two-stage approach experiences adaptability issue because of the enormous number of matching itemsets. This paper proposes a novel calculation that finds high utility examples in a solitary stage without creating candidates. Our straight information structure empowers us to process a tight technique for pruning and to specifically distinguish high utility examples in an efficient and versatile way, which focuses on the main driver with earlier technique. Test comes to conclusion that the proposed computations, especially Direct Discovery of High Utility Pattern reduce the amount of hopefuls satisfactorily and additionally beat diverse figuring extensively to the extent runtime, especially when databases contain clusters of long trades.

210

Authors: Thendral Puyalnithi, Madhuviswanatham Vankadara

Most of the existing Clinical Decision Support Systems(CDSS) for predicting Coronary Heart Disease(CHD) risks rely solely on the analysis of single type of diagnostic data or a certain type of classification algorithm, thus making the predicted component unreliable. Since the Risk value very much influences the further course of the treatment, the correctness of the risk value is eminent. So the novelty of the proposed method lies in considering many classification algorithms and many diagnostics data sets to predict the risk value. Moreover in the proposed method we have given flowchart for finding the risk value, which is a novelty. The results shows that the selection of classification algorithms cannot be universal as proposed by many recent researches and each type of data set will be having a certain type of classifier which works best for the data set. The proposed system has four classifiers namely Mixed cardio data classifier, Single Photon Emission Computed Tomography(SPECT) data classifier, Electrocardiogram(ECG) data classifier and 1-year survival Electrocardiogram data classifier, each trained with benchmark datasets of University of California, Irvine(UCI) Machine learning repository. The performance of algorithms such as Iterative Dichotomiser3(ID3), Naïve Bayes(NB), Support Vector Machine(SVM), k-Nearest Neighbors(kNN) and Ensemble classifiers such as Bagging and Boosting are evaluated for every data set and best classifier is chosen by its accuracy measure. Ensemble method is the most efficient for 1-year survival ECG data classifier with 89.5% accuracy, ID3 is the most efficient algorithm for Mixed cardiac data classifier with 96.9% accuracy and SVM is the most efficient algorithm for SPECT data classifier and ECG data Classifier with accuracy of 98.3% and 100% respectively. The proposed work also finds the optimal number of samples needed for Bagging and Boosting type of ensemble classifiers.

226

Authors: Leo Dencelin Xavier, Ramkumar Thirunavukarasu

Knowledge of a protein’s secondary structure, in turn, contributes to our understanding of the functions of the protein is vital to many aspects of living organisms such as those of enzymes, hormones, and structural material, etc. It also helps in designing new drugs for critical disease. In this paper, we have advocated a distributed approach to identify the Protein Secondary Structures using an ensemble method on protein primary sequences. The Ensemble based Random Forest algorithm has been adopted to build the three-way predictive model. Based on the amino acid features of each protein and decision tree parameters, the classification model allows us to assign protein structures as ‘α helix’, ‘β sheet’, or a coil. Also the proposed model is implemented in a distributed computing environment, SPARK. Experiments have been carried out using cross-validation tests on RS126 and CB513 benchmark datasets. Our results clearly confirm that ensemble approach in classifying protein secondary structures scores better accuracy with improved performance when it will be implemented in the distributed environment.

245

Authors: Alexis Cordovés García, Ricardo Sors Lancho, Arlys M. Lastre Aleaga, Alexis Cordovés Rodríguez, Leonardo L. Lorente Leyva

The goal of this paper is the adaptation of plans of manufacturing processes of Axisymmetric Solid Parts under the approach of Case Based Reasoning (CBR). To this end, a data model for feature-based representation has been developed, which contains the geometric, dimensional and technological information required for the preparation of the one-piece process plan. As a result, an algorithm to generate new parts process plans from a similar plan retrieved from the case base is presented, which is based on the specific information of the Primitive Form Features (PFF) and considers the possible interaction between neighboring PFFs. The computer support of the developed algorithm was implemented in AutoLISP as programming language of the CAD system used and the interface was created in OpenDCL.

257

Authors: Myungsuk Lee, Eunsook Bae

The purpose of this study is to explore a new teaching and learning method using MOOC as a way of solving the change of the educational environment and the learner 's unsatisfied academic desire. This study suggests 'Hybrid teaching method' as a way to utilize MOOC in liberal arts education. This teaching method is a method of perfect learning through formal learning and informal learning. Formal learning consisted of a teacher - centered knowledge acquisition stage and a learner - centered thinking extension stage. Informal learning consists of learner - led experience/reflection stages. It is a characteristic of 'Hybrid teaching method' that emphasizes the role of instructor, breaks the boundaries of education space through informal learning, and implements perfect learning through level learning. This study is meaningful that the MOOC has provided a detailed plan to utilize it in the curriculum of the university. We hope that the ‘Hybrid teaching method’ using MOOCs will be a way to adapt and lead the liberal education to the future education trends as a customized learning according to the development of science and technology, destruction of spatial areas such as online and offline, emphasis on connection between theory and reality through formal learning and informal learning.

272

Authors: Fatiha Bessaha, Nouria Mahrez, Souhila Bendenia, Fatima Kasmi, Kheira Marouf-Khelifa, Amine Khelifa

Algerian halloysite was heated at 600 °C and treated with HCl 5N. The materials were characterized by chemical analysis, TEM, and FT-IR spectroscopy, and used in the elimination of Congo red (CR) from aqueous solution. The effects of contact time and temperature were investigated. The thermal treatment at 600 °C results in the formation of dehydroxylated structure. Acid attack involves an increase in SiO2 content, due to the leaching of Al ions from octahedral sheet. Thermo-chemical treatment also diminishes the percentage of impurities and maintains the tubular morphology. Kinetic data follow the pseudo-second order model, whilst thermodynamic parameters lead to a not spontaneous and endothermic process. Significant changes occur in the vibrational spectrum of H600-5N (halloysite treated at 600 °C and with HCl 5N), after adsorption of Congo red, with the involvement of amino and sulfoxide groups. The mechanism highlights an outer-sphere surface complexation of SiOH....H2O species, i.e., SiOH linked to H2O via H-bonds.

290

Authors: Asha Jerlin, Jayakumar Chinnappan

Detection of malware has become more challenging today because of the advancements and technologies adapted to corrupt the network or the devices. Static, dynamic and hybrid malware detection analysis methods have failed to provide complete malware detection. Hence in this work, a bio inspired sequence alignment method used in bioinformatics to compare the similarity between amino acid sequences in protein structures has been adapted to give the best similarity score to detect malwares. The state of art sequence alignment methods like Smith Water Man Algorithm (SWMA) used in bio informatics suffers from the problem of more memory utilization and computation time which is in the order of n2 ie., (O(n2)) and hence in this work an efficient sequence alignment algorithm (ESSA) has been proposed to address the problem of memory utilization thereby making the memory utilization and computation time to the order of n ie., (O(n)) there by making the detection rate higher. It is also clear from the results that the similarity score is high when the sequence length is small. The accuracy of the prediction rate of malware and benign increases.

307

Authors: Gunasekaran Ganesan, Venkatesan MeenakshiSundram

3D visualization is the recent research need to be able to view the model from various angles so as to see data that is obscured by other data. While visualizing the data, view point selection is one of the major challenge which define the viewpoint information to select best viewpoints. This paper introduces teaching learning opacity based optimization (TLOO) and Kalman filter for selecting optimal viewpoint. The structural features of 3D volume dataset such as opacity and luminance is extracted for selecting optimal viewpoint position from that structural features. TLOO optimization algorithm identifies the voxels and standard information using view point evolution function. Then, kalman filter steers the optimization process with the help of cost function. The proposed flow of the technique is simple and very effective for selecting optimal viewpoints in 3D images. Computational complexity and the quality metrics are analyzed that provided maximum output efficiency.

327

Authors: Nagaraja Gundluru, Pradeep Reddy Ch

We can realize instant joint group communication by forming Mobile Ad Hoc Networks without demanding any pre-plan or pre-existing infrastructure setup. Conversely, the curbs of these networks such as unreliable wireless medium, unpredictable topology, no central administration, fuel the compulsion of a key based cryptographic algorithm to defend data traffic. In this perspective, substantial research work has been done in the last decade or so and ascertained that the trust based frameworks for group key management deliver superior performance than others. Since the nodes in ad hoc networks have limited computing resources, the overall performance of the system depends on how effectively and securely designed the system. This encourages us to work on a framework which consumes less computing power and also invulnerable to internal as well as external attacks. We propose a framework which reduces the network resource consumption for the trust request and collection using game theory concept. The energy of the wireless nodes are significantly saved by choosing the novel strategy called as finding optimal set of remote nodes to send the response for trust request using game theory. Choosing local optimal at each stage eventually leads to global optimal. Later, synthesize the collected trust and handle the attacks using fuzzy concept in order to get the degree of trustworthiness instead of binary classification. We prove with our simulation results that our proposed scheme reduces overhead of the network significantly while without compromising security aspects.

347

Authors: Balamanigandan Ramachandran, Kamalraj Subramaniam

During the last decade internet users, researchers and industries have focused on the cloud based technologies. Cloud technology is a distributed and scalable service model and in this model service providers offer the services depending on the cloud users. Security in cloud is a challenge for the service providers , data owners and the service requesters because the cloud providers provide various services such as storage, computing , database and network . All the services focus on data processing in a network to share the information from cloud to users, data owner to cloud and cloud to authenticator. To solve these security issues, in this paper we define a new approach for data sharing issues and service management of Trusted Third Party Authentication ( TPA ) based on multilevel security framework and bilinear pairing techniques. This framework consists of three modules and these modules are service module, transaction processing module and security module . The next thing is bilinear pairing technique, which uses the pairing techniques to achieve the secure cloud service and improve the computing utility power , store large amount of data and execute the efficient encryption process securely in cloud environment. In this work, the cloud ssecurity requirement has been enhanced using bilinear mapping and multilevel security framework . The result of multilevel security framework is comparatively better than the present day cloud security.

363

Authors: Kumaran Umapathy, Neelu Khare

Preservation of privacy is a significant aspect of data mining and as the secrecy of sensitive information must be maintained while sharing the data among different untrusted parties. There are many application is suffering from vulnerable, data leakage, data misuse, and sensitive data disclosure issues. To protect the privacy of sensitive data without losing the usability of data, various techniques have been used in privacy-preserving data mining (PPDM). Some of the approaches are available to maintain the tight privacy, but they fail to minimize the execution time and error rate. The main objective of the article is to contribute and retrieve the data with minimal classification error and execution time with enhanced privacy. To overcome the issues, the paper introduces the Secure Data Contribution Retrieval algorithm (SDCRA) to fulfill the current issues. Proposed algorithms define a privacy policy and arrange the security based on requirements. This design applies the privacy based on the compatibility of applications. This approach is capable of satisfying the accuracy constraints for multiple datasets. It also considers the efficient data extraction with a good ranking of attributes in tables. Here, proposed SDCRA is compared with existing approaches namely as Perturbation, singular value decomposition (SVD), Singular Value Decomposition data Perturbation (SVD+DP), K-anonymity with Decision Tree (KA+DT)[] for Cancer, HIV, Diabetes dataset. Based on experimental result proposed approach performs well regarding success rate, error rate and system execution time compare than existing methods. Proposed approach improves Success Rate 1.83% reduces the Error Rate 2.33% and minimizes the system execution time 2 seconds.

381

Authors: Shachi Mall, Umesh Chandra Jaiswal

This paper developed innovative algorithms such as shallow parsing and modified Lesk’s algorithm to resolve the issues in Word Sense Disambiguation and performed correct translation from Hindi language to English language. Shallow parsing method is based on Hidden Markov model. We also perform an evaluation for 1657 Hindi tokens with 990 phrases for Parts of speech tagging and Chunking for given Hindi sentence as input and able to achieve Precision, Recall, F-score, Accuracy for Parts of speech tagger: Accuracy: 92.09%; precision: 84.76%; recall: 89.29%; F-score: 86.97, system accuracy for Chunk: Accuracy: 93.96%; precision: 89.33%; recall: 91.31%; F-score: 90.315%. The evaluation is performed by developing confusion matrix in which the system result of Parts of speech tagger and Chunk is compared with Gold standard date provided by IIIT Hyderabad in the summer school 2015. In this paper we discuss the second problem Word Sense Disambiguation in which we enhance the Modified Lesk algorithms by using overlap based method which will find information between three pieces of words in a given context. The system generated result resolves the issues of Word Sense Disambiguation and shows the comparison result with the website Google Translator in which we input polysemy word in a Hindi sentence and same sentence input in our generated system and shows the comparison result of both. The output result shows that our system resolves Word Sense Disambiguation and produces correct translation and Google Translator is fails to resolves the correct Translation.

401

Authors: Gunavathi Chellamuthu, Premalatha Kandasamy, Sivasubramanian Kanagaraj

Microarray technology is commonly used in the study of disease diagnosis using gene expression levels. The classification of cancer is a foremost area of research in the field of bioinformatics. Microarray technology enables the researcher to investigate the expression levels of thousands of genes in a single experiment and gives the measurements of their differential expression. The main drawback of gene expression data is that it contains thousands of genes and a very few samples. Feature or gene selection methods are used to successfully extract the genes that directly involved in the classification and to eliminate irrelevant genes. These methods considerably improve the classification accuracy. The proposed method applies bat algorithm (BA) for feature selection in tumour classification. Initially, the top-10 genes are selected by T-Statistics, signal-to-noise ratio (SNR) and F-Test. The classifier accuracy of k-nearest neighbour (kNN) technique is used as the fitness function for BA. The simulated results are demonstrated and analyzed with 10 different cancer gene expression dataset. For Lung Cancer Michigan and Lung Harvard2 datasets the proposed method gives 100% classification accuracy with minimum number of genes. For 5 other datasets, the proposed method gives more than 90% of classification accuracy. The results show the suitability of the proposed algorithm for feature selection in cancer classification.

418

Authors: Haritha Akkineni, Venkata Swarajya Lakshmi Papineni, Vijaya Babu Burra

Ubiquitous online communication is producing massive amounts of data on an un-precedential scale. Many have come up in analyzing the data produced from Twitter. Sentiment analysis is being carried out to catch the pulse of the people. As the data is mostly in the unstructured format. Getting the summary of what has been expressed positively and what has been expressed negatively plays a major role. Summaries take a wide strand in this plait as the relevant content can't be comprehended all at once. Working on the premise that online social media conversations might represent a new source of information to monitor the status of the policies launched by the government, this investigate stands as a first paw which may ultimately be the source for producing abstractive summaries from Twitter. This paper mainly focuses on developing a hybrid method which takes the combination of extractive summaries using statistical approaches as well as abstractive summaries using Rich Semantic Graph based approaches. The set of classified positive and the negative tweets will be passed as input to the hybrid method and it generates concise as well as readable summaries from both set of tweets. These summaries can be easily viewable on the PDA's and enhances the decision making capability of the policymaker.

435

Authors: Dhivya Elavarasan, Durai Raj Vincent

Web mining is an application of data mining techniques to extract and process knowledge from sources such as web documents, hyperlinks, website usage logs etc. Due to the outbreak of extensive information through web resources, mining of semantically relevant data for a search keyword is one of the most intriguing studies to research. This work deals with automatically extracting the information from web documents using web content mining. The extracted data needs to be preprocessed in order to obtain the appropriate data format for further analysis. Generally, the content based search algorithm is used to find the items relevant to the keyword searched resulting in an indexed set of similar results. Further, the clustering of the similar data is done by adopting the quality threshold clustering algorithm assigning a similarity index to each of the result items. For the final list of items obtained, the weighted page ranking algorithm is applied to rank the most frequently searched item in the lists. The proposed work efficiency will be determined by the cluster's quality and the query blocks ranking efficiency. Various metrics like cluster purity, NMI, Rand Index, F-Measure, wPRF are used to evaluate the quality and the ranking efficiency of the search result obtained. Duplicate result sets are handled and are castigated for better unambiguous results. The results obtained is proved to be better and to overrun the existing approaches like QFI and QFJ. The quality of the result set obtained is further evaluated by repeating the process considering only the top n ranked items, shuffling the top items or by randomly selecting the items. Thus, enabling to validate and uphold the results of the proposed work surpassing the existing algorithms.

1

Authors: Tamilarasan Santhamurthy, Kumar Parasuramane

Today’s wireless communication systems required groundbreaking solution to meet scarcity of radio spectrum. Cognitive radio (CR) is an emerging technology which provides futuristic solution and improving the precious likely resources utilization. Cognitive radio network (CRN) is an intellectual wireless communication system as well as aware of its environment. In CRN, we have sensing problem by multiple nodes with changing computational power, spectrum allocation and range of sensing. The secondary user (SU) plays major role of primary channel sensing and appropriate unused channel selection for communication. In this paper we focused on optimum resource allocations and priority based scheduling for primary user (PU) and secondary user (SU) to exploit the performance of the entire network by reducing the interference at PU and also exploiting the throughput and decreasing the risk of overlying the coverage of CRNs. The effectiveness of dynamic resource allocation priority based scheduling (DRAPBS-CRN) algorithm is compared with dynamic resource allocation (DRA-CRN) algorithm and is found to be 26% more efficient using ns-2 simulation. This proposed DRAPBS-CRN algorithm also will avoid collisions and perform smart data transmission in CRN.

21

Authors: M.N.Shah Zainudin, Md Nasir Sulaiman, Norwati Mustapha, Thinagaran Perumal, Azree Shahrel Ahmad Nazri, Raihani Mohamed, Syaifulnizam Abd Manaf

In various classification areas, the curse of dimensionality becomes a major challenge among the researchers. Thus, feature selection plays an important role in overcoming dimensionality problem. Relief-f is one of the filter methods to rank the most significant features based on their relevance. Although relief-f proved to be a powerful technique in filter strategy, but this method only rank the features based on their significant level. Hence, feature selection is embedded to select the most meaningful features based on their rank. Differential evolution (DE) is one of the evolutionary algorithms that are widely used in various classification domains. Simple and powerful in implementation, we combined relief-f with DE in our proposed feature selection method to solving the optimization problem. In this work, population size and generation size were adaptively determined from the number of features from relief-f. The performance of proposed method is compared with several feature selection techniques in order to prove their superiority using ten datasets obtained from UCI machine learning repository.

40

Authors: Anitha Arumalla, Madhavi Latha Makkena

Reconfigurable architectures have provided a low cost, fast turnaround platform for the development and deployment of designs in communication and signal processing applications. The floating point operations are used in most of the signal processing applications that require high precision and good accuracy. In this paper, an effective implementation of Fused Floating-point Add-Subtract (FFAS) unit with a modification in dual path design is presented. To enhance the performance of FFAS unit for reconfigurable architectures, a dual path unit with a modification in close path design is proposed. The proposed design is targeted on a Xilinx Virtex-6 device and implemented on ML605 Evaluation board for single, double and double extended precision. When compared to discrete floating point adder design, the FFAS unit reduces area requirement and power dissipation as the later shares common logic. A Dual Path FFAS (DPFFAS) unit has reduced latency when compared with FFAS unit. The latency is further reduced with the proposed modified DPFFAS when compared with DPFFAS for reconfigurable architectures.

58

Authors: Ramani Selvanambi, Jaisankar Natarajan

In data mining, association rules are produced in view of solid relations and regularities existing among the variables in extensive exchanges. These association rules go for extricating connections, frequent patterns and associations among the item sets in exchanges. Association rules are connected for use in different zones, for example, media transmission, hazard administration and so forth. One such territory where the association rules are vital is the stock market. In stock marketing, picking the right stock relies on upon the genuine stock quality and the capacity to pick the stock is urgent as it impacts the profit of investors. In this work, the proposed technique develops a novel and effective way to deal with producing optimal stock rules to help in the stock market prediction by utilizing Enhanced Apriori algorithm and Artificial Bee Colony Optimization (ABC) algorithm. In the result profit of PP, EMA, ROC and RSI for min-support 3, 4, 5 and 6 individually in rule mining for HCL stock market dataset is appeared with correlation of GA-Apriori algorithm, AGA- Enhanced Apriori algorithm and ABC- Enhanced Apriori algorithm. From this Artificial Bee Colony (ABC) optimization algorithm is performed when contrasting and different strategies and grant that strong association rules to be produced.

78

Authors: Palamakula Ramesh Babu, Parimala Venkata Krishna

The MAC layer plays a major role in the enhancement of the performance of any network. Hence this paper proposes a modified virtual backoff algorithm which queues the packets based on the delay that application can tolerate and ant colony optimization technique is used to choose the best of all available forwarding nodes. Two counter referred as Naccess and Nattempt are maintained for each node which is used to calculate the success rate of each node based on which the node is given the channel access of all contending nodes. Sleep scheduling is incorporated in order to enhance the energy conservation and hence increase the lifetime of the network. The performance of the proposed algorithm is proved to be better when compared to the legacy systems like VBA, S-MAC and EACAODV. The parameters used for testing are packet delivery ratio, average energy consumption, delay and number of collisions.

96

Authors: Sunitha Badanahatti, Yelisetty Satya Sree Rama Murthy

Regression testing is a kind of software testing that authenticates that software previously developed and established still accomplishes correctly after it was altered or interfaced with other software. The aim of the investigation is to progress the software competence via cloud based regression testing. The projected technique has three chief stages such as, 1) test case generation, 2) clustering and 3) test case prioritization. Primarily the input implementation is send to the cloud for test case generation. For producing the test cases the projected method utilizes coverage metrics. Following the test case generation, the existing test cases are gathered with the help of kernel fuzzy c means clustering algorithm. Subsequently each group is fed to test case prioritization; in that grey wolf optimization algorithm is utilized for test case prioritization. Thus we will get operative prioritized test cases. Our method will be implemented on JAVA with Cloud Sim platform. The presentation will be assessed using execution time and memory use. From the solution the applied method precedes minimum implementation time associated with the available technique.

116

Authors: Nageswara Rao Sirisala, C. Shoba Bindu

Evaluation of node’s trust value is certainly advantage in mobile Adhoc networks (MANETs) where the applications run efficiently by involving trustable nodes only. The proposed method “A Novel QoS Trust computation in MANETs using Fuzzy Petri Nets-QTFPN”, evaluates node trust value based on its quality of service (QoS) parameters. Here the MANET is represented as Dynamic Adaptive Fuzzy Petri Nets (DAFPN) model with concurrent reasoning algorithm (CRA). In which delivery of each packet from node to node requires evaluation of certainty factor (μ) using fuzzy expert system. This fuzzy inference system uses QoS parameters as fuzzy input variables namely energy, bandwidth, node mobility and reliability. In the routing process the intermediate node’s trust values are evaluated based on certainty factor. The concurrent reasoning algorithm can strengthen the proposed method in selection of quality path to destination and reestablishment of path in case of path breaks. The proposed method performance is analyzed theoretically in terms of time and space complexities. The simulation results are taken against node velocity and network size, where the proposed method outperforms the existing protocols.

136

Authors: Anggun Fitrian Isnawati, Risanuri Hidayat, Selo Sulistyo, I Wayan Mustika

Dynamic user in mobile communication encourages the implementation of self-organized and non-cooperative distributed power control. To be implemented, the power control must meet the feasible and convergent conditions. Feasibility of power control must be qualified for non-negative power vectors and the limit of maximum power, whereas convergence is tested by the speed for achieving of convergent conditions on fixed point. If it is feasible, then the system will be convergent, but when it is infeasible then the power transmit of user will be negative and the system is never reach the convergence. While the semi feasible condition requires the implementation of a proposed method of HDCPC. When power transmit of user exceeded the maximum power, Pmax, HDCPC method choose the transmit power that equal with ½ Pmax compared to use Pmax that required on DCPC or to force the user turned off the power transmit on GDCPC. Results showed that it would be more efficient in power usage than DCPC and more implementable than GDCPC. Proposed HDCPC is done when there is no option of handover channel, while the results after user move to another channel is able to achieve the SINR target and spent less power. Related to the convergence analysis, it can be concluded that the larger the SINR target, the longer iterations required to achieve a convergent condition.

156

Authors: Harshita Patel, Ghanshyam Singh Thakur

Learning from imbalanced data is one of the burning issues of the era. Traditional classification methods exhibit degradation in their performances while dealing with imbalanced data sets due to skewed distribution of data into classes. Among various suggested solutions, instance based weighted approaches secured the space in such cases. In this paper, we are proposing a new fuzzy weighted nearest neighbor method that optimally handle the imbalance issue of data. Use of optimal weights improve the performance of fuzzy nearest neighbor algorithm for default balanced distribution of data, for the classification of imbalanced data concept of adaptive K is merged with it that apply large K, number of nearest neighbors for large class and small K for small class. We deploy this combination to classify imbalanced data with better accuracy for different evaluation measures. Experimental results affirm that our proposed method perform well than the traditional fuzzy nearest neighbor classification for these type of data sets.

173

Authors: Achyut Shankar1*, Natarajan Jaisankar

In this paper, we propose an (SAPSO) Self-Adaptive Particle Swarm Optimization algorithm to solve the base station positioning problem. This algorithm is used to minimize the distance between the base station and cluster head owing to maximizing the energy. Moreover, the proposed algorithm is compared with many other conventional algorithms such as Artificial Bee Colony-Dynamic Scout bee (ABC-DS) algorithm, Genetic algorithm (GA), Particle swarm optimization (PSO) and Firefly with Dual Update Process (FFDUP) algorithm. Also, empowering SAPSO helps to find the optimal location of the base station to conserve energy in a noteworthy manner to maximize the network lifetime and prolong network connectivity regarding minimizing distance, delay and maximizing the security, energy. Our simulation results demonstrate that the proposed SAPSO algorithm performs better than the other conventional algorithm.