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.
The multiple pattern matching has always been a significant principle for applying to a network security system. This principle is adapted to accommodate the target patterns to be detected in a pre-processing phase, and the objective text and the suspect patterns are simultaneously detected by comparing with the existing structure. This research article introduces a new algorithm of multi-string pattern...
Conventional e-assessment systems often are not suited for examining mathematical calculations or proofs, and the few existing ones have very limited functionality. On this account we have developed the e-assessment system EASy which focuses on mathematical proofs. As we are not aware of any documented experiences concerning the applicability, usability and acceptance of a corresponding system for...
As one of the possible solutions to the problem of model checking multi-agent systems, we have suggested model checking for deontic logic using the formalism of deontic interpreted systems and the possible world semantics.
As one of the possible solutions to the problem of model checking multi-agent systems, we have suggested model checking for deontic logic using the formalism of deontic interpreted systems and the possible world semantics.
Considering the storage characteristics of vector digital geographic data, and taking the advantages of the sensitivity of the initial values and parameters of chaos-based system, a compound chaos-based encryption algorithm was proposed for encrypting vector geographic data here, the algorithm presented a stronger and larger space of key, which overcame some disadvantages of single chaos-based encryption...
The trend over the past decade in computer science and computer engineering curricula has been to use computer graphics as a junior- or senior-level elective course focusing on 3-D graphics and data visualization. Alternatively, it is possible to develop a computer graphics course that can address core curricular needs beyond its obvious topical and algorithmic scope. The development of an interactive...
We give a new characterization of the planar separator theorem in terms of mutually non-containing closed Jordan Curves. using this, we develop an O(n √n logn) maximum flow algorithm for directed planar networks (hence for any planar network).
The complexity of the search problem for a very broad class of data structures is estimated. The lower (Information Theoretic) bound and the upper bound differ by a small multiplicative constant.
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.