Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: indexing method

Sortuj według:

Ogranicz wyniki do:

Assessment of the warehouse management in an industry logistics centre using indexing methods

Bartosiewicz S.

Gospodarka Materiałowa i Logistyka

2015

nr 9

10--19

The aim of this article is to present an analysis and evaluation of the warehouse management on the example of a given logistics centre. For this reason it was necessary to develop a high flexibility method. It allows selecting appropriate dependencies adapted to both the aim of a control and the specific nature of a tested object. This is due to the availability of numerous measures and logistic indicators of different characteristics and information capacity.

Celem artykułu jest przedstawienie analizy i oceny gospodarki magazynowej na przykładzie wybranego centrum logistycznego. Z tego względu do analizy i oceny koniecznym było opracowanie metody, która będzie się charakteryzowała dużą elastycznością. Pozwala ona na dobór odpowiednich zależności dostosowanych zarówno do celu kontroli, jak i samej specyfiki badanego podmiotu. Wynika to z dostępności wielu mierników i wskaźników logistycznych o zróżnicowanej charakterystyce oraz pojemności informacyjnej.

Towards Efficient Searching on the Secondary Structure of Protein Sequences

Seo M., Park S., Won J-I.

Fundamenta Informaticae

2007

Vol. 78, nr 4

525-542

Approximate searching on the primary structure (i.e., amino acid arrangement) of protein sequences is an essential part in predicting the functions and evolutionary histories of proteins. However, because proteins distant in an evolutionary history do not conserve amino acid residue arrangements, approximate searching on proteins' secondary structure is quite important in finding out distant homology. In this paper, we propose an indexing scheme for efficient approximate searching on the secondary structure of protein sequences which can be easily implemented in RDBMS. Exploiting the concept of clustering and lookahead , the proposed indexing scheme processes three types of secondary structure queries (i.e., exact match, range match, and wildcard match) very quickly. To evaluate the performance of the proposed method, we conducted extensive experiments using a set of actual protein sequences. According to the experimental results, the proposed method was proved to be faster than the existing indexing methods up to 6.3 times in exact match, 3.3 times in range match, and 1.5 times in wildcard match, respectively.