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.
Today's mobile devices have inherited many of the characteristics of desktop computing -- including the assumptions that the user's full attention and dexterity can be focused on the interface. Unfortunately, on-the-go users are impaired by their mobility and often find desktop-style Windows Icon Menu and Pointer (WIMP) interfaces difficult, if not impossible, to use while performing their primary...
Software testing plays an important role in the life cycle of software development. Because software testing is very costly and tedious, many techniques have been proposed to automate it. One technique that has achieved good results is the use of search algorithms. Because most previous work on search algorithms has been of an empirical nature, there is a need for theoretical results that confirm...
A new fast algorithm for reconstructing the stray magnetic field of a magnetic head by electron beam tomography, and applications of the method, are described. We had previously proposed a method for 3-D reconstruction of stray magnetic fields using an "ART" method of electron beam tomography. In this new algorithm, the magnetic field distribution in the measurement plane just beyond the...
A model for searching algorithms is developed which includes most tree-like searching structures such as lists, binary trees, AVL trees and 2, 3-trees. It is shown that no searching algorithm employing a data structure that is uniquely represented (up to isomorphism) can provide search, insert and delete functions all operating faster than c√n time for every n key tree. The c√n bound is shown to be...
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.