Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "search" wg kryterium: Temat


Wyświetlanie 1-10 z 10
Tytuł:
Scheduling with high variety of customized compound products
Autorzy:
Smutnicki, Cz.
Powiązania:
https://bibliotekanauki.pl/articles/1203939.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
scheduling
tabu search
Opis:
Domestic appliance is an instance of manufacturing various products on clients demand with frequent changes of production. Although the technological process for each individual product is relatively simply, the variety of products, mixed orders, frequent machines changeovers, machines with unusual service policy, lack or limited storage, etc., generates quite nontrivial planning, batching and scheduling problems and furthermore of a huge size. In this paper, we present specific real process of production of refrigerators, mathematical and graph models of the problem and an outline of solution algorithm, based the on local search approach.
Źródło:
Decision Making in Manufacturing and Services; 2007, 1, 1-2; 91-110
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Character frequency-based approach for searching for substrings of circular patterns and their conjugates in online text
Autorzy:
Prasad, Vinod
Powiązania:
https://bibliotekanauki.pl/articles/2097972.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
pattern matching in strings
circular pattern matching
similarity search
substring search
Opis:
A fundamental problem in computational biology is dealing with circular patterns. The problem consists of finding a pattern and its rotations in a database. In this paper, we present two online algorithms. The first algorithm reports all of the substrings (factors) of a given pattern in an online text. Then, without losing efficiency, we extend the algorithm to process the circular rotations of the pattern. For a given pattern P of size M and a text T of size N, the extended algorithm reports all of the locations in the text where a substring of Pc is found where Pc is one of the rotations of P. For an alphabet size σ using O(M) space, the desired goals are achieved in an average O(MN/σ) time, which is O(N) for all patterns with length M ≤ σ. Traditional string-processing algorithms make use of advanced data structures such as suffix trees and automaton. The experimental results we have provided show that basic data structures such as arrays can be used in text-processing algorithms without compromising efficiency.
Źródło:
Computer Science; 2021, 22 (2); 235-250
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Distributed web-scale infrastructure for crawling, indexing and search with semantic support
Autorzy:
Dlugolinsky, S.
Seleng, M.
Laclavik, M.
Hluchy, L.
Powiązania:
https://bibliotekanauki.pl/articles/305377.pdf
Data publikacji:
2012
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
distributed web crawling
information extraction
information retrieval
semantic search
geocoding
spatial search
Opis:
In this paper, we describe our work in progress in the scope of web-scale information extraction and information retrieval utilizing distributed computing. We present a distributed architecture built on top of the MapReduce paradigm for information retrieval, information processing and intelligent search supported by spatial capabilities. Proposed architecture is focused on crawling documents in several different formats, information extraction, lightweight semantic annotation of the extracted information, indexing of extracted information and finally on indexing of documents based on the geo-spatial information found in a document. We demonstrate the architecture on two use cases, where the first is search in job offers retrieved from the LinkedIn portal and the second is search in BBC news feeds and discuss several problems we had to face during the implemen-tation. We also discuss spatial search applications for both cases because both LinkedIn job offer pages and BBC news feeds contain a lot of spatial information to extract and process.
Źródło:
Computer Science; 2012, 13 (4); 5-19
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Falcon optimization algorithm for bayesian network structure learning
Autorzy:
Kareem, Shahab Wahhab
Okur, Mehmet Cudi
Powiązania:
https://bibliotekanauki.pl/articles/2097968.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Bayesian network
global search
falcon optimization algorithm
structure learning
search and score
Opis:
In machine-learning, some of the helpful scientific models during the production of a structure of knowledge are Bayesian networks. They can draw the relationships of probabilistic dependency among many variables. The score and search method is a tool that is used as a strategy for learning the structure of a Bayesian network. The authors apply the falcon optimization algorithm (FOA) to the learning structure of a Bayesian network. This paper has employed reversing, deleting, moving, and inserting to obtain the FOA for approaching the optimal solution of a structure. Essentially, the falcon prey search strategy is used in the FOA algorithm. The result of the proposed technique is associated with pigeon-inspired optimization, greedy search, and simulated annealing that apply the BDeu score function. The authors have also examined the performances of the confusion matrix of these techniques by utilizing several benchmark data sets. As shown by the experimental evaluations, the proposed method has a more reliable performance than other algorithms (including the production of excellent scores and accuracy values).
Źródło:
Computer Science; 2021, 22 (4); 553--569
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analiza wpływu rozlewu olejowego na skuteczność poszukiwań w trakcie akcji SAR z wykorzystaniem symulatorów SARMAP i OILMAP
Analysis of the influence of oil spill on effectiveness of the SAR action using SARMAP and OILMAP simulators
Autorzy:
Łazuga, K.
Górtowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/350704.pdf
Data publikacji:
2011
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
poszukiwanie i ratownictwo
SAR
rozlew olejowy
oil spill
search and rescue
Opis:
Niniejsze opracowanie rozważa poszukiwanie człowieka i tratwy ratowniczej w miejscu rozlewu olejowego przy użyciu helikoptera Anakonda, samolotu M-28 X2 oraz statku Kapitan Poinc. Wyniki badań prezentują trajektorię ruchu plamy olejowej, trajektorię ruchu rozbitka ubranego w kombinezon ochrony termicznej i tratwy ratunkowej dla dwóch sytuacji hydrometeorologicznych. Poszukiwania wyżej wymienionych środków ratunkowych odbywają się wg schematów IAMSAR a wyniki poszukiwań przedstawione są w postaci prawdopodobieństwa sukcesu (POS [%]) opartego na prawdopodobieństwie wykrycia rozbitka/tratwy podczas przejazdu po ustalonej trasie oraz prawdopodobieństwie znalezienia się rozbitka/tratwy w wyznaczonym obszarze poszukiwań.
This paper considers the human search and rescue raft search in the place of oil spill using the Anaconda helicopter, aircraft M-28 X2 and the ship Captain Poinc. Results represent the trajectory of movement of oil slick, the trajectory of motion of surviver dressed in survival suit and life raft for two hydrometeorological situation. The search for life-saving measures mentioned above are held by schemes IAMSAR. Search results are presented in the form of the probability of success (POS [%]) based on the propability of detection and probability of containment.
Źródło:
Górnictwo i Geoinżynieria; 2011, 35, 4/1; 233-242
1732-6702
Pojawia się w:
Górnictwo i Geoinżynieria
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wpływ rozlewu olejowego na skuteczność poszukiwań w trakcie akcji SAR
The influence of oil spill on effectiveness of the SAR action
Autorzy:
Górtowski, P.
Łazuga, K.
Powiązania:
https://bibliotekanauki.pl/articles/350240.pdf
Data publikacji:
2011
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
poszukiwanie i ratownictwo
SAR
rozlew olejowy
oil spill
search and rescue
Opis:
Wzrost wydobycia złóż ropy z dna morskiego niesie ze sobą ryzyko zwiększenia się prawdopodobieństwa wystąpienia rozlewu olejowego nie tylko w rejonie eksploatowanych złóż, ale również na trasach uczęszczanych przez statki transportujące ropę naftową i jej produkty. Niniejsze opracowanie porusza tematykę prowadzenia akcji poszukiwania rozbitków przy jednoczesnym wystąpieniu rozlewu produktu ropopochodnego a w związku z tym zagrożeń związanych z przebywaniem zarówno rozbitków jak i ratowników w środowisku toksycznym dla człowieka. Zagrożenia związane z obecnością produktów ropopochodnych na miejscu akcji to między innymi ich łatwopalność, tworzenie się par wybuchowych w powietrzu, obniżenie zawartości tlenu w atmosferze i toksyczność produktu. Artykuł rozważa również wpływ rozlewu olejowego na możliwości lokalizacji rozbitków.
The increase in the extraction of oil from the seabed carries a risk of increasing the likelihood of an oil spill not only in the region of exploited deposits, but also on routes frequented by vessels transporting crude oil and its products. This study moves the driving theme of searching survivors share while petroleum product spill occurs and therefore the risks associated with staying in both survivors and rescuers in environment toxic to humans. Risks associated with the presence of petroleum products on the site include the share of their flammability, formation of explosive vapors in the air, lowering the oxygen content in the atmosphere and the toxicity of the product. Article also considers the influance of an oil spill on the possible of location of survivors.
Źródło:
Górnictwo i Geoinżynieria; 2011, 35, 4/1; 137-144
1732-6702
Pojawia się w:
Górnictwo i Geoinżynieria
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Computing resource and work allocations using social profiles
Autorzy:
Lavin, P.
Kenny, E.
Coghlan, B.
Powiązania:
https://bibliotekanauki.pl/articles/305617.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
agents
search
resource allocation
social
economic
Social Grid Agents
social profile
Opis:
If several distributed and disparate computer resources exist, many of which have been created for different and diverse reasons, and several large scale computing challenges also exist with similar diversity in their backgrounds, then one problem which arises in trying to assemble enough of these resources to address such challenges is the need to align and accommodate the different motivations and objectives which may lie behind the existence of both the resources and the challenges. Software agents are offered as a mainstream technology for modelling the types of collaborations and relationships needed to do this. As an initial step towards forming such relationships, agents need a mechanism to consider social and economic backgrounds. This paper explores addressing social and economic differences using a combination of textual descriptions known as social profiles and search engine technology, both of which are integrated into an agent technology.
Źródło:
Computer Science; 2013, 14 (2); 273-293
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
HP-HGS strategy for inverse AC/DC resistivity logging measurement simulations
Autorzy:
Gajda-Zagórska, E.
Paszyński, M
Schaefer, R.
Pardo, D.
Powiązania:
https://bibliotekanauki.pl/articles/305666.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
resistivity logging simulations
adaptive finite element method
hierarchical genetic search
inverse problems
Opis:
In this paper, we present resistivity-logging-measurement simulation with the use of two types of borehole logging devices: those which operate with zero frequency (direct current, DC) and those with higher frequencies (alternate current, AC). We perform simulations of 3D resistivity measurements in deviated wells, with a sharp angle between the borehole and formation layers. We introduce a hierarchical adaptive genetic strategy hp−HGS interfaced with an adaptive finite element method. We apply a strategy for the solution of the inverse problem, where we identify the resistivities of the formation layers based on a given measurement. We test the strategy on both direct and alternate current cases.
Źródło:
Computer Science; 2013, 14 (4); 629-644
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hybrid end-to-end approach integrating online learning with face-identification system
Autorzy:
Nguyene, Dat Van
Nguyen, Son Trung
Pham, Thi Hong Anh
Pham, Van Toan
Hoang, Thao Thu
Thanh, Ta Minh
Powiązania:
https://bibliotekanauki.pl/articles/27312886.pdf
Data publikacji:
2023
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
facial recognition
visual search engine
end-to-end applications
online learning
ElasticSearch (ES)
ES
Opis:
Facial recognition has been one of the most intriguing and exciting research topics over the last few years. It involves multiple face-based algorithms such asfacial detection, facial alignment, facial representation, and facial recognition. However, all of these algorithms are derived from large deep-learning architectures, leading to limitations in development, scalability, accuracy, and deployment for public use with mere CPU servers. Also, large data sets that contain hundreds of thousands of records are often required for training purposes. In this paper, we propose a complete pipeline for an effective face-recognition application that requires only a small data set of Vietnamese celebrities and a CPU for training, solving the problem of data leakage, and the need for GPU devices. The pipeline is based on the combination of a conversion algorithm from face vectors to string tokens and the indexing & retrieval process by Elasticsearch, thereby tackling the problem of online learning in facial recognition. Compared with other popular algorithms on the same data set, our proposed pipeline not only outperforms the counterpart in terms of accuracy but also delivers faster inference, which is essential to real-time applications.
Źródło:
Computer Science; 2023, 24 (1); 141--161
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Applying Hunger Game Search (HGS) for selecting significant blood indicators for early prediction of ICU COVID-19 severity
Autorzy:
Sayed, Safynaz AbdEl-Fattah
ElKorany, Abeer
Sayed, Sabah
Powiązania:
https://bibliotekanauki.pl/articles/27312915.pdf
Data publikacji:
2023
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
ICU severity prediction
COVID-19
clinical blood tests
Hunger Game search
HGS
optimization algorithm
support vector machine
SVM
feature selection
Opis:
This paper introduces an early prognostic model for attempting to predict the severity of patients for ICU admission and detect the most significant features that affect the prediction process using clinical blood data. The proposed model predicts ICU admission for high-severity patients during the first two hours of hospital admission, which would help assist clinicians in decision-making and enable the efficient use of hospital resources. The Hunger Game search (HGS) meta-heuristic algorithm and a support vector machine (SVM) have been integrated to build the proposed prediction model. Furthermore, these have been used for selecting the most informative features from blood test data. Experiments have shown that using HGS for selecting features with the SVM classifier achieved excellent results as compared with four other meta-heuristic algorithms. The model that used the features that were selected by the HGS algorithm accomplished the topmost results (98.6 and 96.5%) for the best and mean accuracy, respectively, as compared to using all of the features that were selected by other popular optimization algorithms.
Źródło:
Computer Science; 2023, 24 (1); 113--136
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-10 z 10

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies