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, a new on-line signature verification system using neural network is presented. The proposed system is based-on a newly developed Spatio-Temporal Artificial Neuron (SPAN), which is well adapted for the verification of Spatio-Temporal patterns. In this model, the strokes of a signature generated by a digitizing tablet is presented in form of a sequence of spikes corresponding to displacement...
Cervical cancer is one of the most preventable/treatable forms of cancer, due to the fact that precursor signs for the disease can be detected in microscopic examination of cervical cells. Currently these examinations are purely visual, but the project reported aims to process the visual images to present them in a complementary auditory form and thereby to improve diagnostic accuracy. Standard mean-shift...
We describe a benchmark of publicly-available multi-threaded programs with documented bugs in them. This project was initiated a few years ago with the goal of helping research groups in the fields of concurrent testing and debugging to develop tools and algorithms that improve the quality of concurrent programs. We present a survey of usage of the benchmark, concluding that the benchmark had an impact...
We show that there can be no computationally tractable description by linear inequalities of the polyhedron associated with any NP-complete combinatorial optimization problem unless NP = co-NP -- a very unlikely event. We also apply the ellipsoid method for linear programming to show that a combinatorial optimization problem is solvable in polynomial time if and only if it admits a small generator...
In order to obtain a short fault-detection sequence for a sequential machine, the concept of an easily testable machine is introduced. Such a machine is one which possesses a minimal-length homogeneous distinguishing sequence and requires no transfer sequences in the fault-detection sequence. A design procedure is presented in which an arbitrary machine is embedded in an easily testable machine by...
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.