In this paper we define two new fourth-order Schroder-type methods for finding zeros of nonlinear equations having unknown multiplicity. In terms of computational cost the new iterative methods requires six evaluations of functions per iteration. It is proved that the new methods have a convergence of order four. Numerical comparisons are included to demonstrate exceptional convergence speed of the proposed methods.
We obtain a necessary and sufficient condition for L1-convergence of a modified cosine sum and a theorem of Telyakovskii  concerning convergence behavior of cosine series with monotonic decreasing coefficients has been deduced as a corollary.
In this paper, digital signature that is resistant to attacks by quantum computer is designed in two versions – with the application and with message recovery. We study the security and performance of this digital signature by comparing it with the signatures of RSA and DSA. In particular, it appears that the new digital signature is not less secure, but it is much faster than these signatures are commonly used in practice.
The basic idea about parallel computing is about putting independent processing units together to collectively solve a task. However, the amount of speedup attained by this collection of processing units is a function of several factors, one of which is the interconnection network.
This paper focuses on measuring performance of parallel programs deployed on wired and wireless networks. Our experiments were conducted on Beowulf clusters; a parallel computer built using a collection of everyday personal computers. This paper shows empirically that distributed memory parallel programs (MPI) written for Beowulf clusters on wireless LAN (IEEE 802.11 g) do not gain appreciable speedup as the number of processing nodes increases compared to the same parallel programs written for the same Beowulf clusters but on wired LAN. It further shows the impact the kind of network has in the overall performances of parallel programs when a multiprogramming approach is used to achieve speedup.
A modified approximate analytic solution of the quadratic nonlinear oscillator “ ẍ + x2 sgn(x) =0 ” has been obtained based on an iteration procedure. Here we have used the truncated Fourier series in each iterative step. The approximate frequencies obtained by our technique shows a good agreement with the exact frequency. The percentage of error between exact frequency and our fourth approximate frequency is as low as 0.00003%.
The combination between semantic web and web mining is known as semantic web mining. Semantic web can improve the effectiveness of web mining. The knowledge of semantic web data can be mined using web mining techniques, as semantic web data are rich sources of knowledge to feed data mining techniques. This paper concentrated on how to combine two emergency research areas, namely semantic web and web mining. Firstly, we extract data from RDF file using SPARQL as query language. After that, we are going to cluster the entities of semantic web. One of the techniques is k-means clustering algorithm. Sematic web is about the meaning of the web data and to make machine understandable about it. Moreover, web mining is to extract and discover useful and previously unknown information from web data. This research gives an overview of where semantic web and web mining areas meet today, and how it is useful to combine these two well-known areas to obtain better and more accurate results.
Georg Cantor (1845-1918) introduced the notion of the cantor set, which consists of points along a single line segment with a number of remarkable and deep properties. This paper aims to emphasize a proceeding to obtain the Cantor (ternary) set, C by means of the so-called elimination of the open-middle third at each step using a general basic approach in constructing the set.