Searching and matching

Top PDF Searching and matching:

A New String Matching Algorithm for Searching Biological Sequences

A New String Matching Algorithm for Searching Biological Sequences

String matching algorithms play a key role in many computer science problems, and in the implementation of computer software. This problem has received, and continues to receive a great deal of attention due to various applications in text manipulation, information retrieval, speech recognition, image and signal processing and computational biology. In this study, we propose a new algorithm called the Odd and Even algorithm (OE). OE combines an enhanced preprocessing phase from the Berry Ravindran algorithm with our proposed new searching phase procedure. This variety of searching order allows our proposed algorithm to reduce the number of comparison characters and enhances the searching response time. Experimental results show that OE algorithm offers a smaller number of comparisons and offers improved elapsed searching time when compared to other well-known algorithms for searching any length of alphabets and patterns. The proposed algorithm is applicable to searching protein sequence databases as well as any other string searching applications.
Show more

6 Read more

OE Matching Algorithm for Searching Biological Sequences

OE Matching Algorithm for Searching Biological Sequences

String matching algorithms play a key role in many computer science problems, and in the implementation of computer software. This problem has received, and continues to receive a great deal of attention due to various applications in text manipulation, information retrieval, speech recognition, image and signal processing and computational biology. In this study, we propose a new algorithm called the Odd and Even algorithm (OE). OE combines an enhanced preprocessing phase from the Berry Ravindran algorithm with our proposed new searching phase procedure. This variety of searching order allows our proposed algorithm to reduce the number of comparison characters and enhances the searching response time. Experimental results show that OE algorithm offers a smaller number of comparisons and offers improved elapsed searching time when compared to other well-known algorithms for searching any length of alphabets and patterns. The proposed algorithm is applicable to searching protein sequence databases as well as any other string searching applications.
Show more

8 Read more

Job Searching and Job Matching in a Two Sector General Equilibrium Model

Job Searching and Job Matching in a Two Sector General Equilibrium Model

Job-searching and job-matching are the two striking features of the labour market. In the labour market, we find flows of workers, flows of jobs offered, new vacancies are created, old jobs are destroyed, workers search good jobs, firms search good workers. All these facts have been included in the matching models of the labour market. The job- matching models generally explain the existence of equilibrium rate of unemployment and give insights to the planners to pursue various economic policies in the fractional labour market.
Show more

19 Read more

Rate of Agreement between Database Users’ and Authors’ Keywords in SID and Magiran Databases and Its Effect on Information Retrieval

Rate of Agreement between Database Users’ and Authors’ Keywords in SID and Magiran Databases and Its Effect on Information Retrieval

At the next stage, the two groups of users were compared in terms of match- ing level, in order to find out that the difference between the Persian and Latin keywords belongs to which group users in this study. The average number of mismatching keywords among PhD students was lower than clinical residents. This finding indicates that lower exact matching in clinical residents generally led to lower matching between the authors and users. As noted earlier, clinical residents tend to use more specific keywords in their searches that was hardly consistent with the system language (that can be keywords by authors). Hence, they become confused in searching the retrieval information system, and finally fail to retrieve the desired documents.
Show more

16 Read more

An efficient and improved performance for keyword searching in larger databases

An efficient and improved performance for keyword searching in larger databases

First, No-index Method one section is Using Like predicates: In SQL there is an in-built predicate LIKE which allows matching the keyword and retrieving that record. Second section is Using User-Defined Function (UDF): We can add the functions into the databases to examine whether a record contains the query keyword or not. Second, Index Based Method a database index is a data structure that improves the speed of data retrieval operations on a database table at the cost of additional writes and storage space to maintain the index data structure. Indexes are used to quickly locate data without having to search every row in a database table every time a database table is accessed. Indexes can be created using one or more columns of a database table, providing the basis for both rapid random lookups and efficient access of ordered records.For making an inverted index table, firstly an single id is assign to keywords in alphabetic order which are in Table T. Afterwards inverted index table IT is created with records in form<key id,rec id> where key id is the id of keyword and rec id is id of record For a table T, Prefix table PT is created with <prefix, skey id, lkey id> where p represent the prefix of keywords, lkey id the largest string id of prefix p and skey id smallest string id of p. An example; TABLE II of inverted
Show more

6 Read more

Online Full Text

Online Full Text

Nevatia, "Single View Human Action Recognition using Key Pose Matching and Viterbi Path Searching," in IEEE Conference on Computer Vision and Pattern Recognition CVPR '07., 2007, pp.. Ne[r]

5 Read more

A New CBIR Approach for the Annotation of Medical Images

A New CBIR Approach for the Annotation of Medical Images

There are various image retrieval methods that have been applied in various applications. One among which is Euclidean distance method for image similarity measurement. Euclidean distance gives the best results for image searching [14]. In this work, we have used Euclidean distance method to retrieval of similar images from the database. When query image is given, the color feature of that image is identified and which is compared with values, from the data base of index, one by one by using Euclidean distance method. By comparing query image with others images in data base, the distance between images will be finding and shortest distance will be considered as best matching image in that matching process. Similarly, one after one best matching images will be finding by measuring the one after one shortest distance in to retrieve the similar images from the database. The distance d between two image calculated by using the following equation.
Show more

12 Read more

A Survey on Data Mining Techniques for Maximizing Ride- Sharing Route

A Survey on Data Mining Techniques for Maximizing Ride- Sharing Route

This paper [1] author has presented the new method for optimization of dynamic ride sharing system. This method is very effective one. It optimizes the traffic pressure problem and solves it. The dynamic ride- sharing is used to reduce the traffic jam and carbon emissions. This paper various data mining techniques such as dynamic ride matching, Minimal Route Bi-searching algorithm are used to efficiently matches rides and satisfying multiple or number of participant constraints for rider requests. The rider request may be the following details based are time bounds maximum allowed deviation distances and minimized the route ride. This algorithm is to developing a prototype and evaluated system on GPS (Global Positioning System). Finally, the system to reduce the travel distances and computation cost. It analyzes the computation cost to compare the recent ride searching method, so it to maximize the efficiency.
Show more

5 Read more

Title: A Novel Approach of Color Histogram Based Image Search/Retrieval

Title: A Novel Approach of Color Histogram Based Image Search/Retrieval

After getting a query it’s important to extract the features of images, because using these extracting features of input image match with this to our existing images features. The feature is defined as a function of one or more measurements, each of which specifies some quantifiable property of an object, and is computed such that it quantifies some significant characteristics of the object. Features Extraction process is play main role in every type of image search engines because its help at the time of creation of database means adding the entries into the database as well as at the time of searching images its help to find or search matching features from the database.
Show more

9 Read more

The Symbolic OBDD Algorithm for Finding Optimal Semi matching in Bipartite Graphs

The Symbolic OBDD Algorithm for Finding Optimal Semi matching in Bipartite Graphs

The optimal semi-matching problem is one relaxing form of the maximum cardinality matching problems in bipartite graphs, and finds its applications in load balancing. Ordered binary decision diagram (OBDD) is a canonical form to represent and manipulate Boolean functions efficiently. OBDD-based symbolic algorithms appear to give improved results for large-scale combinatorial optimization problems by searching nodes and edges implicitly. We present novel symbolic OBDD formulation and algorithm for the optimal semi- matching problem in bipartite graphs. The symbolic algorithm is initialized by heuristic searching initial matching and then iterates through generating residual network, building layered network, backward trav- ersing node-disjoint augmenting paths, and updating semi-matching. It does not require explicit enumeration of the nodes and edges, and therefore can handle many complex executions in each step. Our simulations show that symbolic algorithm has better performance, especially on dense and large graphs.
Show more

8 Read more

An Algorithm for String Searching

An Algorithm for String Searching

After preprocessing the pattern and the text, the comparison will be done. This comparison will be between the pattern and the segments that their indexes are stored in the array. For each segment taken from the created array, the first character in the pattern is compared with the first character in the segment, if they match, then the algorithm continues by comparing the last character in the pattern with the last character in the segment taken from the array. If the corresponding last characters match then the algorithm allows to perform character by character matching between the pattern and the segment taken from the text. In the case of a mismatch in any step, the algorithm will directly take the next segment in the array, else it will continue comparing.
Show more

6 Read more

National federated searching

National federated searching

3 Lobby national government to provide money to establish repositories for all higher education research. By[r]

25 Read more

Searching for New Earth

Searching for New Earth

Abstract:- The discovery of exoplanets has intensified interest in the search for extraterrestrial life, especially for planets orbiting the sun like stars in habitable zone. The study of planetary habitability also considers a wide range of other factors in determining the suitability of a planet for hosting life. This study aims to determine to explore the variety exoplanets like giant planets, terrestrial planets, habitable planets, and earth like planets. The method for searching that planets are using five different methods, like radial velocity method, transit method, gravitational micro-lensing, astrometry, and direct imaging. From the study process obtained that there are 1.271 giant planets, 211 terrestrial planets, 291 habitable planets, and 2 earth like planets.
Show more

6 Read more

google hacking tool security professional 4320  pdf

google hacking tool security professional 4320 pdf

Not every company can afford the time and effort it takes to manually Google hack their own company. Many tools and applications are now being written to automate the Google hacking process. The foundation that many of these applications are written on are the Google API’s. These API’s allow developers to create their own interface to the Google searching system. You must have a Google account to get a license key for the API’s, and the terms of service state that your program must transmit your license key with all requests. Any

28 Read more

Searching for evidence

Searching for evidence

In addition to the chapter on insect development and life histories, ecologists will be particularly pleased to find chapter sections dedicated to environmental monitoring using both ter[r]

10 Read more

Searching for the Devil

Searching for the Devil

Consider this example from Chapter 3, which distills development down to its essence: ‘The general “recipe” for animal development was set forth in Chapter 1: make an egg, cut it up into[r]

15 Read more

CT and MRI Brain Images Matching Using Ridgeness Correlation

CT and MRI Brain Images Matching Using Ridgeness Correlation

Image registration is considered as one of the most fundamental and crucial pre processing step in digital image processing. Since it is a vital problem in medical imaging, though it has several applications in clinical diagnosis such as diagnosis of cardiac, retinal, pelvic, renal, abdomen, liver, tissue etc disorders. Ridges, edges and troughs are useful geometric features for image analysis. Geometrical image features like ridges in digital images may be extracted by convolving the images with Gaussian kernels. In this paper we will perform the task of using ridgeness correlation for CT and MRI brain images matching using scale space method and also demonstrate 3D CT – MRI image registration with a software package using rigid translations and rotations.
Show more

6 Read more

Strategic transport planning for Odisha matching with changing scenarios of current industrialization and economic policy in 21st century

Strategic transport planning for Odisha matching with changing scenarios of current industrialization and economic policy in 21st century

The author’s intention is to reflect the present transport and logistic system in Odisha and to focus precisely the strategic transport planning matching with changing scenarios of new i[r]

7 Read more

On the reconstraction of the matching polynomial and the reconstruction conjecture

On the reconstraction of the matching polynomial and the reconstruction conjecture

Matching, perfect matching, matching polynomial, matching matrix, Reconstruction Conjecture, edge reconstruction, node reconstruction.. 1980 AMS SUBJECT CLASSIFICATION CODE.[r]

8 Read more

The Personality matching of mentors and mentees in a youth mentoring program

The Personality matching of mentors and mentees in a youth mentoring program

Campbell and Campbell investigated the academic impacts of mentoring as well as the matching of mentors. Three hundred thirty nine undergraduate students were mentored by faculty members. Three hundred thirty-nine other undergraduate student records served as controls based on similar gender, ethnicity, class level, and entering grade point average. The authors posited that many studies assume that similar backgrounds in gender and ethnicity result in better mentor-mentee relations. Whereas some studies show support for gender and ethnic matching (Dubois, Holloway, Valentine, & Cooper, 2002; Santos & Reigadas, 2002), other studies have found matching on gender or ethnic background to be unrelated to outcome, either in relations or mentor effectiveness (Atkinson et al., 1991; Campbell & Campbell, 1997; Hickson, 2002). The authors also wrote that few studies have investigated the impact of mentoring on academics. Campbell and Campbell had two primary hypotheses: 1) That the students in the mentoring program will complete more class credits and achieve a higher GPA than students not in the mentoring program and 2) Students in the mentoring program will be more likely to remain in school and graduate than the control group. The authors also explored two other hypotheses regarding matching: 1) Academic retention and grade point average will be greater when there is a gender match between mentor and student and 2) Academic retention and grade point average will be greater when there is a match in ethnicity between mentor and student.
Show more

87 Read more

Show all 10000 documents...