Scitech Research Journals
Not a member yet
1011 research outputs found
Sort by
Recent Trends in Image Encryption: A Review
Get PDFSecurity of multimedia data is gaining acceptance owing to the growth and acceptability of images in various applications and in telecommunication. Encryption is one of the ways to ensure high security of images as they are used in many fields such as in secure medical imaging services, military intelligence, internet and intranet communication, e-banking etc. These images are stored or transmitted through a network; hence the security of such image data is important. In this work, recently developed encryption techniques are studied and analyzed to promote further development of more encryption methods to ensure additional security and versatility. All the techniques reviewed came into existence within the last five years (2011-2015) and are found to be useful for the present day encryption applications. Each technique is unique in its own way, which might be suitable for different applications. As time goes on, new encryption techniques are evolving. Hence, fast and secure conventional encryption techniques will always be needed in applications requiring high rate of security
A Performance Assessment on Various Data mining Tool Using Support Vector Machine
Get PDFData mining is essentially the discovery of valuable information and patterns from huge chunks of available data. Two indispensable techniques of data mining are clustering and classification, where the latter employs a set of pre-classified examples to develop a model that can classify the population of records at large, and the former divides the data into groups of similar objects. In this paper we have proposed a new method for data classification by integrating two data mining techniques, viz. clustering and classification. Then a comparative study has been carried out between the simple classification and new proposed integrated clustering-classification technique. Four popular data mining tools were used for both the techniques by using six different classifiers and one clustered for all sets. It was found that across all the tools used, the integrated clustering-classification technique was better than the simple classification technique. This result was consistent for all the six classifiers used. For both of the techniques, the best classifier was found to be SVM. From the four tools used, KNIME found to be the best in terms of flexibility of algorithm. All comparisons were drawn by comparing the percentage accuracy of each classifier used
On The Diophantine Equation ∑x_i^2+a=y^2 And ∑x_i^3+a=y^3
No full textIn this paper, the Diophantine equations ∑+= and ∑+= where 1≠2≠3≠⋯ and a is a positive integer have been discussed for possible positive integral solutions
Forming a mixed Quadrature rule using an anti-Lobatto four point Quadrature rule
Get PDFA mixed quadrature rule of higher precision for approximate evaluation of real definite integrals has been constructed using an anti-Lobatto rule. The analytical convergence of the rule has been studied. The relative efficiencies of the mixed quadrature rule has been shown with the help of suitable test integrals. The error bound has been determined asymptotically
Oscillation of Second Order Quasi-linear Differential Equation with Several Neutral Terms
Get PDFThis paper deals with the oscillatory behavior of solutions of second order neutral type differential equations. The results obtained here extend some of the existing results. Examples are provided to illustrate the main results
Some results on integer cordial graph
Get PDFAn integer cordial labeling of a graph G(V, E) is an injective map f from V to or as p is even or odd, which induces an edge labeling f*: E → {0, 1} defined by f*(uv) = 1 if f(u) + f(v) ≥ 0 is positive and 0 otherwise such that the number of edges labeled with1and the number of edges labeled with 0 differ atmost by 1. If a graph has integer cordial labeling, then it is called integer cordial graph. In this paper, we introduce the concept of integer cordial labeling and prove that some standard graphs are integer cordial
An Improved Group Acceptance Sampling Plan for Weighted Binomial on Time Truncated Testing Strategy Using Multiple Testers: Exponential Distributed Lifetime
Get PDFIn this paper an improved group acceptance sampling plan using weighted binomial is developed when the lifetime of the test item follows exponential distribution. The optimal numbers of group are obtained for pre-specified parameters, acceptance number, quality levels, and number of tester per group at different level of consumer risk. The results are discussed with the help of example and figure. The proposed plan is compare with Anburajan and Ramaswamy (2015) and observed more efficient than the existing plan for Exponential Distribution
Analysis of stochastic model of tuberculosis transmission
Get PDFIn this paper, we consider a stochastic model of tuberculosis imbedded in environmental noise. We prove the existence of global solution , and we establish the stochastic stability of solutions
Radiotherapy Treatment Planning With Dose Volume Constraints By Linear Programming Approach
Get PDFOptimization has become an important tool in treatment planning for cancer radiation therapy. It may be used to determine beam weights, beam directions, and appropriate use of beam modifiers such as wedges and blocks, with the aim of delivering a required dose to the tumor while sparing nearby critical structures and normal tissue. Linear programming formulations are a core computation in many approaches to treatment planning, because of the abundance of highly developed linear programming software. Moreover the choices of formulation, algorithm, and pivot rule that perform best from a computational view point are sometimes not obvious, and the software’s default choices are sometimes poor. Here we present some linear programming formulations of treatment planning problem with dose volume constraints, conclusions are drawn about the formulations and variants
Parametric Non-linear programming approach for N-policy queues with infinite capacity
Get PDFThis paper proposes a procedure to construct the membership function of N-policy queue with infinite capacity. By using mathematical programming we construct the membership function of the system performance measure in which arrival rate and service rate are fuzzy numbers. Based on a-cut approach and Zadeh’s extension principle, the fuzzy queues are converted into a family of crisp queues. Suitable real world example is exemplified to analyze N-policy fuzzy queues. Extending this model to fuzzy environment it would have further more wider applications