Abstract: Publication year: 2015Source: Algorithms Research , Volume 4, Number 1Obayomi Abraham Adesoji, Ogunrinde Roseline BosedeThe paper utilized the application of nonstandard methods to create suitable numerical schemes for some initial value problems arising from nonlinear second order oscillator equations. We have applied the technique of Non-local approximation at the grid points and a set of normalized denominator functions to renormalized the discretization functions. The resulting schemes have been used to simulate the original equations and they have been found to have the same monotonic properties as the original equation.

Abstract: Publication year: 2015Source: Algorithms Research , Volume 4, Number 1Mustapha HamidiThis paper, taking Travelling Salesman Problem as our object, wishes to develop a constructive algorithm to prove P=NP. Our algorithm is described as this process: initially, constructing a convex polygon that includes all points and creating a centroid of this convex polygon, next, examine the position of each point compared to the centroid's position; then, repeating the previous step until all vertexes are included into the optimal tour. This paper has shown that our constructive algorithm can solve the Travelling Salesman Problem in polynomial time.

Abstract: Publication year: 2014Source: Algorithms Research , Volume 3, Number 1Gang LiuWe present a closed-form solution for convex Nonlinear Programming (NLP). It is closed-form solution if all the constraints are linear, quadratic, or homogeneous. It is strongly polynomial when applied to convex NLP. It gives exact optimal solution when applied to LP. The T-forward method moves forward inside the feasible region with a T-shape path toward the increasing direction of the objective function. Each T-forward move reduces the residual feasible region at least by half. The running time of T-forward method is better than the interior point method by a factor of O(N2.5L).

Abstract: Publication year: 2013Source: Algorithms Research , Volume 2, Number 2Abdramane SerméThis paper aims to provide a bound of the forward error of the extended iterative refinement or improvement algorithm used to find the solution to an ill conditioned linear system. We use the additive preconditioning for preconditioner of a smaller rank r and the Schur aggregation to reduce the computation of the solution to an ill conditioned linear system to the computation of the Schur aggregate S. We find S by computing W the solution of a matrix system using an extension of Wikinson iterative refinement algorithm. Some steps of the algorithm are computed error free and other steps are computed with errors that need to be evaluated to determine the accuracy of the algorithm. In this paper we will find the upper bound of the forward error of the algorithm and determine if its solution W can be considered accurate enough.

Abstract: Publication year: 2013Source: Algorithms Research , Volume 2, Number 2Mustafa Kamal, Shazia Zarrin, Arif-Ul-IslamIn Accelerated Life Testing, acceleration factor is known or there exists a mathematical model which specifies the life stress relationship. However, there are some situations in which neither acceleration factor is known nor such models exist or are very hard to assume. In such cases partially accelerated life tests are better criterion to use. This paper deals with simple Constant Stress Partially Accelerated life test using type-I censoring. Assuming that the lifetimes of test item follow Inverted Weibull distribution, the maximum likelihood estimation procedure is used to obtain the estimates for the distribution parameters and acceleration factor. Asymptotic confidence interval estimates of the model parameters are also evaluated by using Fisher information matrix. A Simulation study is used to illustrate the statistical properties of the parameters and the confidence intervals.

Abstract: Publication year: 2013Source: Algorithms Research , Volume 2, Number 2T. Ganesh, PRS ReddyIn Managerial Decision making, the problem environment will be encircled by a set of alternatives for set of criteria. The main objective is to choose the best alternative under each criterion. In this contest, the Decision Maker (DM) plays an important role in solving the hard/complex problems. This type of scenario gives raise to the concept of MCDA. In this paper, we made an attempt to provide some algorithms which are user-friendly. In this paper, we have provided some algorithms which supports in computing the concordance and discordance indices.

Abstract: Publication year: 2013Source: Algorithms Research , Volume 2, Number 1Ch. R. Phani Kumar, P. Krishna Mohan, Ch. SatyavathiData processing through cellular networks has been increased in the present decades. Huge amount of data can cause interruption to the cellular users. Hence a code has been generated that acts as a filter bank. Placing the code into the controlling element of the filter banks required selection of the channels for allocating the voice and data channels are made. By allocating the free channels to the calls, the user can able to provide service to all the calls and also to the data when any channel is free. Even the feedback for the lost data is also provided in such a way that all the channels in one or the other case are kept busy either by voice or data transmissions. Hence the code can provide effective utilization of the channels during data transmission.

Abstract: Publication year: 2013Source: Algorithms Research , Volume 2, Number 1Ch. R. Phani Kumar, B. Uday Kumar, V. Malleswara Rao, Dsvgk KaladharMobile network analysis has a huge potential that provide insight into the relational dynamics of individuals. Machine learning and data mining techniques provide the behavior patterns of the mobile network data. The data transfer during all the days has produced good results in transfer of data starting from Day 1 to Day 22. Hierarchical clustering of the datasets for all the 1634 data examples in the mobile traffic dataset. Complete linkage dendrogram has been produced between 0 and 4.64. Two clusters have been produced from the present wireless mobile traffic datasets.

Abstract: Publication year: 2013Source: Algorithms Research , Volume 2, Number 1D. S.V.G.K.Kaladhar, Bharath Kumar Pottumuthu, Padmanabhuni V. Nageswara Rao, Varahalarao Vadlamudi, A.Krishna Chaitanya, R. Harikrishna ReddyData mining is used in various medical applications like tumor classification, protein structure prediction, gene classification, cancer classification based on microarray data, clustering of gene expression data, statistical model of protein-protein interaction etc. Adverse drug events in prediction of medical test effectiveness can be done based on genomics and proteomics through data mining approaches. Cancer detection is one of the hot research topics in the bioinformatics. Data mining techniques, such as pattern recognition, classification and clustering is applied over gene expression data for detection of cancer occurrence and survivability. Classification of colon cancer dataset using weka 3.6, in which Logistics, Ibk, Kstar, NNge, ADTree, Random Forest Algorithms show 100 % correctly classified instances, followed by Navie Bayes and PART with 97.22 %, Simple Cart and ZeroR has shown the least with 50 % of correctly classified instances. Kappa Statistic for Logistics, Ibk, Kstar, NNge, ADTree, Random Forest has shown Maximum. Mean absolute error and Root mean squared error are shown low for Logistics, Kstar and NNge. Using various Classification algorithms the cancer dataset can be easily analyzed.

Abstract: Publication year: 2013Source: Algorithms Research , Volume 2, Number 1B. Udaya Kumar, D. S. Murty, Ch. R. Phani KumarWireless technologies have been popular and rapidly developed during couple of years which are being used in smart applications like home automation, greenhouse monitoring, healthcare and industrial control etc. The increasing demand in home security has become one of the most essential requirements, both in anti-theft perspective and in anti-accident perspective. Home security systems are available with fixed cameras interfaced through wires to a dedicated PC with internet for accessing the data from remote location. This paper presents the implementation of a low cost wireless home security system using zigbee protocol and remote access through internet. A ZigBee based star network with two nodes had been established employing Xbee radio, ARM7, PIC, and MBED microcontroller. The detection of the intruder motion, gas leakage detection and visual surveillance of the home were provided with the help of Passive Infrared Sensor (PIR), Gas sensor (GH-312) and Camera (LS_Y201).The data transmitted from the nodes using ZigBee modules has been received through on chip Ethernet of MBED microcontroller. The complete design of hardware for each of the nodes has been presented. The implementation of the hardware has been successfully tested for its validation. The performance of the system found to be satisfactory and the results are presented in this paper. The data acquisition of the designed hardware system has been remotely accessed with the help of web server