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.
This study present a new learning tool developed for the visualization of an algorithm for the assignment problem. We show how the teaching of an algorithm can be greatly enhanced and the tutor's effort decreased with a visualization tool that provides an interactive and animated view of the subject being taught to the students. This tool makes use of the Java technology; therefore it is platform...
Earlier the model suggested was much generalized and simple. It was lacking in clarity about the functioning of its components, which made it difficult to be implemented. In this paper an improved model for the security policy framework is suggested, in which functioning of each component and there interconnectivity is explained clearly. The fitness functions for the system and which parameter can...
Security is one of the major issue for the ubiquitous sensor networks' (USNs) applications. The evolution of ubiquitous sensor networks provides a unique solution for many ubiquitous information services. Apparently, it challenges the data security and secrecy due to its hostile deployment which is not robust to physical attacks from restricted sources. In order to resolve, the security issue that...
Given a set of points P and a query point q, the reverse furthest neighbor (Rfn) query fetches the set of points p isin P such that q is their furthest neighbor among all points in PU{q}. This is the monochromatic Rfn (Mrfn) query. Another interesting version of Rfn query is the bichromatic reverse furthest neighbor (Brfn) query. Given a set of points P, a query set Q and a query point q isin Q, a...
Every element of the transaction in a transaction database may contain the components such as item number, quantity, cost of the item bought and some other relevant information of the customer. Most of the association rules mining algorithms to discover frequent itemsets do not consider the components such as quantity, cost etc. In a large database it is possible that even if the itemset appears in...
We study the problem of computing the minimum volume enclosing ellipsoid (MVEE) containing a given set of ellipsoids S = {E1, E2, hellip, En} sube Ropfd. We show how to efficiently compute a small set X sube S of size at most a = |X| = O(d2/epsi ) whose minimum volume ellipsoid is an (1 + epsi)-approximation to the minimum volume ellipsoid of S. We use an augmented real num ber model of computation...
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.