The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper it is presented a new application of Levenshtein distance algorithm, for the selection of choices in a vocabulary quiz. Levenshtein distance is a measure for the similarity of two strings. In order to make the quiz more difficult, the choices for the correct word are selected using the calculated degree of similarity with the correct word. We developed a Java graphical application that...
The problem of constructing a dual cone of a convex polyhedral cone arises in many mathematical and applied researches. In the paper the method of constructing the dual cone to the acute convex polyhedral cone in R3 is proposed. The Householder transformation, creating a convex hull on the plane and projecting the point lying on the z-axis onto a corresponding face are the basic operations which we...
Recent innovations introduced in the electric power system, especially the significant usage of unpredictable renewable energy sources, are making to perform the needed matching of generated and absorbed electricity more difficult than in the past. To facilitate this matching, market regulation can provide economical drivers that stimulate cost-effective energy shifting by the so-called “prosumers”...
This work explores beam forming and two-way relaying to alleviate the dual issues of the spectrum congestion and spectrum under-utilization. These problems can be alleviated by the implementation of underlay cognitive radio networks. However, their reliability, capacity or power, and coverage depend on bi-directional or abbreviated as primary-to-secondary or abbreviated as (P2S) and secondary-to-primary...
In recent years, the data mining technology has been developed rapidly. New efficient algorithms are emerging. Association data mining plays an important role in data mining, and the frequent item sets are the highest and the most costly. This paper is based on the association rules data mining technology. The advantages and disadvantages of Apriori algorithm and FP-growth algorithm are deeply analyzed...
The stochastic simplex bisection (SSB) algorithm is evaluated against the collection of optimizers in the Python SciPy.Optimize module on a prominent test set. The SSB algorithm greatly outperforms all SciPy optimizers, save one, in exactly half the cases. It does slightly worse on quadratic functions, but excels at trigonometric ones, highlighting its multimodal prowess. Unlike the SciPy optimizers,...
The use of higher-order basis functions (HOBs) reduces the number of unknowns in method of moments (MoM) compared with the piecewise basis functions. To significantly improve the capability of MoM, a scalable parallel algorithm with a LU decomposition direct solver is extended to efficiently use more than 100K CPU cores on the world's fastest supercomputer, Tianhe-2. The proposed algorithm has the...
Association Rules is one of the data mining techniques which is used for identifying the relation between one item to another. Creating the rule to generate the new knowledge is a must to determine the frequency of the appearance of the data on the item set so that it is easier to recognize the value of the percentage from each of the datum by using certain algorithms, for example apriori. This research...
Because the implicit Runge-Kutta method is hard to use, in addition, there is the lack of precision analysis for the implicit Runge-Kutta methods, three classic four-stage implicit Runge-Kutta methods are used to compare their calculation accuracy and the sensitivity of calculation step, these results provided reference for the selection of four-stage implicit Runge-Kutta methods.
For finding all-pairs shortest paths in a digraph of n nodes, the well-known Floyd-Warshall method yields a particular best path between each pair of nodes efficiently in running time O(n3) when there is no negative-cost cycle (and all ties are ignored). Such a digraph may be a model of a real-world transportation, communication, or road network; then, the information of alternative best routing (if...
Multiplicative order of an element a of Group g is the least positive integer n such that an = e, where e is the identity element of G. If the order of an element is equal to |G|, it is called generator or primitive root. This paper describes the algorithms for computing multiplicative order and primitive root in ℤp*, we also present a logarithmic improvement over classical algorithms.
Simulation-based optimisation carries the burden of computationally expensive fitness calculations. It is very often used to tackle large-scale optimisation problems with a relatively high level of complexity. Therefore, it is of interest to have optimisation techniques dedicated to simulation-based optimisation. This paper proposes a simulation-based optimisation approach, called Constructive Cooperative...
Ascertainable clustering number is one of the vital problems of spectral clustering. To solve this problem, a spectral clustering algorithm automatically determining the clustering number is proposed. By mapping the sample point of the data set into feature space, the orthogonal positional relationship of sample points between different clusters in the feature space can be determined. Based on the...
This study proposes an energy expenditure prediction algorithm (EEPA) to predict the exact energy expended during different types of exercises. The EEPA uses relational expressions obtained through the correlation analysis of exercise indexes on ten types of exercises. The relational expression and algorithm indicated changes in energy expenditures according to the heart rates and movement intensity...
We study algorithms for the fast computation of modular inverses. Newton–Raphson iteration over -adic numbers gives a recurrence relation computing modular inverse modulo , that is logarithmic in . We solve the recurrence to obtain an explicit formula for the inverse. Then, we study different implementation variants of this iteration and show that our explicit formula is interesting for...
Clustering is an important technology in data mining. Squeezer is one such clustering algorithm for categorical data and it is more efficient than most existing algorithms for categorical data. But Squeezer is time consuming for very large datasets which are distributed in different servers. Thus, we employ the distributed thinking to improve Squeezer and a distributed algorithm for categorical data...
Cooperative co-evolutionary (CC) architectures provide a framework for solving large scale function optimization problems, by decomposing variables into different groups as subproblems, solving the subproblems, and then reintegrating the solutions. But there is no systematic method for how to decomposing variables, which is a major abstacle for CC framework. This paper provides a correlation identification...
Designated verifier signature is a new cryptographic primitive, in a designated verifier signature scheme, only the designated verifier specified by the signer can verify the validity of the signature. In this paper, we propose an ID-based designated verifier proxy multi-signature scheme by combining the proxy multi-signature and the designated verifier signature. In our scheme, the designated verifier...
Aiming at the shortages of positioning technology in Wireless Sensor Networks (WSNs), a fuzzy positioning algorithm based on WSNs is proposed. Line segments connecting anchor nodes intersect and the algorithm regards intersection points as sample points which should assist with the positioning and improve positioning precision when there are fewer anchor nodes. The positional relationship of the sample...
B-Spline curves are very flexible; it overcomes lots of shortcomings of Bezier curves. It is of great value in practical applications. This thesis is based on the approximate algorithm offered by literature [1]. In this paper, we promote the algorithm in literature [1] to the cubic B-Spline curve approximate fields which is based on the double quadratic B-Spline curves. With this paper's algorithm,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.