This paper is focusing on reducing the time for text processing operations by taking the advantage of enumerating each string using the multi hashing methodology. Text analysis is an important subject for any system that deals with strings (sequences of characters from an alphabet) and text processing (e.g., word-processor, text editor and other text manipulation systems). Many problems have been arisen when dealing with string operations which consist of an unfixed number of characters (e.g., the execution time); this due to the overhead embedded-operations (like, symbols matching and conversion operations). The execution time largely depends on the string characteristics; especially its length (i.e., the number of characters consisting

With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as  and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu  is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied  to some special graphs.

     This paper introduced a hybrid technique for lossless image compression of natural and medical images; it is based on integrating the bit plane slicing and Wavelet transform along with a mixed polynomial of linear and non linear base. The experiments showed high compression performance with fully grunted reconstruction.

        In real situations all observations and measurements are not exact numbers but more or less non-exact, also called fuzzy. So, in this paper, we use approximate non-Bayesian computational methods to estimate inverse Weibull parameters and reliability function with fuzzy data. The maximum likelihood and moment estimations are obtained as non-Bayesian estimation. The maximum likelihood estimators have been derived numerically based on two iterative techniques namely “Newton-Raphson” and the “Expectation-Maximization” techniques. In addition, we provide compared numerically through Monte-Carlo simulation study to obtained estimates of the parameters and reliability function i

The chemical properties of chemical compounds and their molecular structures are intimately connected. Topological indices are numerical values associated with chemical molecular graphs that help in understanding the physicochemical properties, chemical reactivity and biological activity of a chemical compound. This study obtains some topological properties of second and third dominating David derived (DDD) networks and computes several K Banhatti polynomial of second and third type of DDD.

Background: Fast dissolving oral drug delivery system is solid dosage form which disintegrates or dissolves within second when placed in the mouth without need of water or chewing. In present investigation, an attempt has been made to develop oral fast dissolving film of calcium channel blocker lacidipine. Method: Five formulas were prepared by solvent casting method using HPMC (METOLOSE)® as a film forming polymer and evaluated for their physical characteristics such as thickness, weight variation, folding endurance, drug content, disintegration time and in vitro drug release. The compatibility of the drug in the formulation was confirmed by FTIR and DSC studies. Result and Conclusion: The optimized formula F1 showed minimum in vitr

Here, we found an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to convex polynomial by means of weighted Totik-Ditzian modulus of continuity