To address the distributed certificates searching problem in trust management, the member set and privilege set are defined, the forward, backward and bidirectional distributed certificates searching algorithms based on the definitions are brought forward, the complexity of the algorithms and also the comparison of the algorithms and existing algorithms are analyzed, the application of the algo...

Enterprise search infrastructure supports searching in structural data and non-structural data with high efficiency. A well designed enterprise search infrastructure increases productivity and contributes user experience. In this work, we describe querying work items with advanced search and effect to user experience with application lifecycle management system which is located in HAVELSAN. SQL...

At present, most peer-to-peer file sharing systems provide file-mark-based searching function. In the paper, we offer a file recommendation system based on pure peer-to-peer system, use the TOPK method to find similar interest peers in a way to realize the interest-based self-adaptive adjustment of network topology; and exploits the recommendation information between users with similar interest...

Image similarity measurement is very important part for image clustering and content based image retrieval. Store the images and searching them with efficiency is the main issue. As the volume of image database increases day by day, efficient searching technique is a challenging job. Here a proposed approach is given for image similarity measurement using regionprops, color, texture and GLCM fe...

Searching efficiency, which biologists and roboticists are ever concerned about, has become important in physics information science nowadays. In classical probability-based searching problems, as stigmergy, the increase graph complexity will decrease efficiency. Here we study efficiency based on first-passage probability find a counterintuitive phenomenon quantum walk with floating vertices. C...

in this journal, because of the central role of the orient, we have mentioned special points to the readout of theorizing about orient, in each issue.

Searching algorithms are closely related to the concept of dictionaries. String searching algorithms are too complex in all sorts of applications. To analyze an algorithm is to determine the amount of resources (such as time and storage) necessary to execute it. Most algorithms are designed to work with inputs of arbitrary length. Usually the efficiency or running time of an algorithm is stated...

As a novel optimization technique, chaos has gained much attention and some applications during the past decade. For a given energy or cost function, by following chaotic ergodic orbits, a chaotic dynamic system may eventually reach the global optimum or its good approximation with high probability. To enhance the performance of the local search method (LS), which is based on the generalized re...