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.
Aiming at the problem of low retrieval quality in digital library, a novel literature retrieval model based on Wiki technology was studied. Using Wiki technology in the traditional literature retrieval system, the retrieval model also adopts data mining algorithms to extract literature retrieval parameters and user interest characteristics from retrieval history to improve the quality of literature...
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...
Libraries and museums are digitizing their collections of historical culture objects to enable public access, such as historical Chinese calligraphy. These collections are only available in image format, lacking practical technology to offer the basic search service for public access. This paper proposes a quick search approach by a coarse-to-fine strategy. First, long list of calligraphy characters...
It is becoming increasingly difficult to implement effective systems for preventing network attacks, due to the combination of (1) the rising sophistication of attacks requiring more complex analysis to detect, (2) the relentless growth in the volume of network traffic that we must analyze, and, critically, (3) the failure in recent years for uniprocessor performance to sustain the exponential gains...
An algorithm is given for the multi-writer version of the Concurrent Reading While Writing (CRWW) problem. The algorithm solves the problem of allowing simultaneous access to arbitrarily sized shared data without requiring waiting, and hence avoids mutual exclusion. This. demonstrates that a quite complicated concurrent control problem can be solved-without eliminating the efficiency of parallelism...
The contribution of this paper is two-fold. First, we describe two ways to construct multivalued atomic n-writer n-reader registers. The first solution uses atomic 1-writer 1-reader registers and unbounded tags. the other solution uses atomic 1-writer n-reader registers and bounded tags. The second part of the paper develops a general methodology to prove atomicity, by identifying a set of criteria...
We present a formal framework for distributed databases, and we study the complexity of the concurrency control problem in this framework. Our transactions are partially ordered sets, of actions, as opposed to the straight-line programs of the centralized case. The concurrency control algorithm, or scheduler, is itself a distributed program. Three notions of performance of the scheduler are studied...
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.