Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
possible to go through the entire curriculum or to imagine how the individual courses, learning units, outcomes and branches of medicine are interrelated. This paper introduces an innovative analytical approach which helps to identify automatically the most frequent topics based on keyword extraction. Moreover, the
Broadcast Searchable Keywords Encryption (BSKE) is a novel scheme that allows searching in encrypted data without knowing a secret key. Consider Bob wants to encrypt the same data under master public key for a group of users and stores this encrypted data with Alice, Malice is one of those recipients he asks Alice
advertised policies. In this paper, we focus in particular on the scenario where a data owner wishes to (i) outsource its public database to a cloud server; (ii) enable anyone to submit multi-keyword search queries to the outsourced database; and (iii) ensure that anyone can verify the correctness of the server's responses. To
patterns. However, this implies an expensive computation or communication cost of all the data on the server. Existing solutions are not efficient due to their impractical communication and computation cost. Besides, most of them do not support keyword search. In this paper, we introduce the mechanism of pricing to solve the
Keyword search is a wildly popular way for querying XML document. However, the increasing volume of XML data poses new challenges to keyword search processing. Parallel database is an efficient solution for this problem. In this paper, we study the problem of effective keyword search for SLCA (Smallest lower common
Keyword search is familiar to general users as the most popular information retrieval method, especially for searching on the Web because of its user-friendly way. In recent years various approaches to free-form keyword search over RDBMS have been proposed. They can produce results across multiple tuples in different
authorized ones. In this paper, we propose a novel searchable encryption scheme, named PEKS-PM, based on pseudo inverse matrix, which enables a trusted party to give the service provider's server the ability to test whether a given keyword appears in log records but the server learns nothing about the keyword and the log
the device to strengthen the defense. To enhance the security of the back-end application servers, we use keyword filtering and re-treatment to rule out the blacklist, and to adjust the system settings so that it can effectively block the assaults or reduce the possibility of successful attacks. In addition, we also
OpenEHR is an open standard specification for developing flexible electronic health record (EHR) management system. It defines the standard service models and APIs, and offers a whole lifetime data storage method to the patient's record. As an important OpenEHR system component, EHRServer plays the role of back-end services repository for data storage and query. It complies with the openEHR specifications...
The analysis of the vast storehouse of email content accumulated or produced by individual users has received relatively little attention other than for specific tasks such as relationship. Current email analysis in standard client applications consists of keyword based matching techniques for relationship of email
which regions of interest (ROIs) become highlighted. These UIMs are used to establish and reinforce keyword-to-image relations. A tentative application for semantic annotation is also presented.
systems, and they are publicly available through the online repositories of popular CMTs. However, locating and retrieving desired operation services is challenging since keyword-and tag-based search provided by a repository is with low precision. In this paper, we implement a hierarchical categorization approach based
databases are termed as Web Databases (WDB). Web databases have been frequently employed to search the products online for retail industry. They can be private to a retailer/concern or publicly used by a number of retailers. Whenever the user queries these databases using keywords, most of the times the user will be deviated
mechanism based on format-preserving encryption (FPE), which protects the privacy of the sensitive data and keeps the data structure. The mechanism generates keywords for every possible keyword of the corresponding data, and results in a longer keyword string. It performs fuzzy query at a cost of O(n^2) times of AES and
In this paper different searchable encryption techniques are studied along with some implementation of searchable encryption in a cloud environment. Symmetric searchable encryption is implemented through trapdoor function to selectively expose keyword for search. A new method of achieving searchable encryption in the
encrypted data when a majority of research is limited to exact-keyword-search only. We propose a novel scheme for proximity-based-search on encrypted databases hosted in untrusted service environments. This scheme involves a trusted proxy which facilitates a trapdoor to execute search queries over encrypted data while
scheme, which allows users to perform an encrypted keyword search on encrypted data stored in database server directly without decrypting it. In many applications, it requires to access the database by multiple users where data is written by different users using different encryption keys. In this paper, we propose schemes
database to the cloud server. In this context, privacy is a primary challenge and it is necessary to fulfill main privacy requirements of database owners and clients. This paper presents protocols for executing keyword search and aggregate SQL queries that preserve the privacy of both the client and the database owner. Client
Invalid web links exert a profound negative influence both on detection effect and support evidence of anti-plagiarism system based on the network information resources. For this reason, we utilize the self-developed software ROST CM to detect 57662 academic keyword links of 30 hot research issues from 6 popular
multimedia user-generated content. An authorized person or body filters it before being published. Once user-generated multimedia tourist contents are accepted, they are published using a tool into a web page. This GUI allows browsing for contents provided by individual users or those including a tag or keyword. Finally, the
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.