Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "search" wg kryterium: Wszystkie pola

  Lista filtrów

Dostawca treści

Podbaza

Wyrównaj
Wyświetlanie 1-50 z 1363
Tytuł:
Tabu search - a guided tour
Autorzy:
Hindsberger, M.
Vidal, R.
Powiązania:
https://bibliotekanauki.pl/articles/205563.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
combinatorial optimization
local search
metaheuristics
tabu search
Opis:
The main purpose of this paper is to provide an overview of the ideas behind Tabu Search - one of the most popular metaheuristic appoaches. For the sake of concreteness a simple example of the traveling salesman problem will be used in the discussion to illustrate the process of designing a Tabu Search algorithm. In addition, some extensions will be presented. Finally, applications will also be provided as well as references to more specialized publications.
Źródło:
Control and Cybernetics; 2000, 29, 3; 631-651
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ship Collision Avoidance by Distributed Tabu Search
Autorzy:
Kim, D.
Hirayama, K.
Okimoto, M.
Powiązania:
https://bibliotekanauki.pl/articles/116919.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Safety of Navigation
Collision Avoidance
Distributed Tabu Search Algorithm (DTSA)
Distributed Local Search Algorithm (DLSA)
Quasi-Local Minimum (QLM)
Tabu Search Algorithm
Local Search Algorithm
Distributed Tabu Search
Opis:
More than 90% of world trade is transported by sea. The size and speed of ships is rapidly increasing in order to boost economic efficiency. If ships collide, the damage and cost can be astronomical. It is very difficult for officers to ascertain routes that will avoid collisions, especially when multiple ships travel the same waters. There are several ways to prevent ship collisions, such as lookouts, radar, and VHF radio. More advanced methodologies, such as ship domain, fuzzy theory, and genetic algorithm, have been proposed. These methods work well in one-on-one situations, but are more difficult to apply in multiple-ship situations. Therefore, we proposed the Distributed Local Search Algorithm (DLSA) to avoid ship collisions as a precedent study. DLSA is a distributed algorithm in which multiple ships communicate with each other within a certain area. DLSA computes collision risk based on the information received from neighboring ships. However, DLSA suffers from Quasi-Local Minimum (QLM), which prevents a ship from changing course even when a collision risk arises. In our study, we developed the Distributed Tabu Search Algorithm (DTSA). DTSA uses a tabu list to escape from QLM that also exploits a modified cost function and enlarged domain of next-intended courses to increase its efficiency. We conducted experiments to compare the performance of DLSA and DTSA. The results showed that DTSA outperformed DLSA.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 1; 23-29
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Learning Search Algorithms: An Educational View
Autorzy:
Janota, M.
Šimák, V.
Hrbček, J.
Powiązania:
https://bibliotekanauki.pl/articles/116502.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Search Algorithm
Learning Search Algorithms
educational view
Artificial Intelligence Method
Search Method
Labyrinth
Dijkstra algorithm
Opis:
Artificial intelligence methods find their practical usage in many applications including maritime industry. The paper concentrates on the methods of uninformed and informed search, potentially usable in solving of complex problems based on the state space representation. The problem of introducing the search algorithms to newcomers has its technical and psychological dimensions. The authors show how it is possible to cope with both of them through design and use of specialized authoring systems. A typical example of searching a path through the maze is used to demonstrate how to test, observe and compare properties of various search strategies. Performance of search methods is evaluated based on the common criteria.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8 no. 4; 565-570
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wizualność Google Search
The Visual Aspects of Google Search
Autorzy:
Kopeć, Jarosław
Powiązania:
https://bibliotekanauki.pl/articles/1029971.pdf
Data publikacji:
2013-12-15
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Opis:
The article discusses the issue of colour-related metaphors used by institutions and common users for describing the experience of using the Web. The context of thinking about modern Internet in this text is provided by William Gibson’s classic cyberpunk novel – Neuromancer. I assume that colours may be persuasive in presenting the Internet in specific, political and business-related context.
Źródło:
Człowiek i Społeczeństwo; 2013, 36, 2; 251-256
0239-3271
Pojawia się w:
Człowiek i Społeczeństwo
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reliability and uncertainty in determining search area during Search-and Rescue action
Autorzy:
Barciu, Z.
Powiązania:
https://bibliotekanauki.pl/articles/259059.pdf
Data publikacji:
2012
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
life raft
uncertainty
reliability
belief
probability
PIW (Person In Water)
search
rescue
search area
SAR
Opis:
Sea accident occurring far away from the base of rescue ships generates – for SAR action coordinator - problem of determining search areas on the basis of information which sometimes may be incomplete and uncertain, e.g. an unknown number of launched life rafts and persons in water (PIW), as well as that of sending, to the area, a non-rescue ship nearest to place of occurrence of the accident. Variety of operational states of life rafts (number of persons on raft, drift anchor etc) produces different wind leeways as a result of which search areas for the objects would be in a different distance from the last known position (LKP), e.g.: - search areas for life rafts without drift anchor, with an unknown number of castaways on board, -search areas for life rafts with drift anchor, with an unknown number of castaways on board, and - search area for the PIW. To sweep determined search areas the coordinator makes use of a ship nearest to place of danger. In this paper has been made an attempt to determine measures which would make SAR action coordinator capable of deciding which area should be searched first by using a ship nearest to place of the action.
Źródło:
Polish Maritime Research; 2012, 1; 21-30
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu Search for target-radar assignment
Autorzy:
Hindsberger, M.
Vidal, R.
Powiązania:
https://bibliotekanauki.pl/articles/205568.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
assignment
combinatorial optimization
metaheuristics
tabu search
Opis:
In this paper the problem of assigning air-defense illumination radars to enemy targets is presented. A Tabu Search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches. Implementation and experimental aspects are discussed. It is argued that Tabu Search could be used in near realtime decision making systems.
Źródło:
Control and Cybernetics; 2000, 29, 3; 701-724
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu search for the RNA partial degradation problem
Autorzy:
Rybarczyk, A.
Hertz, A.
Kasprzak, M.
Blazewicz, J.
Powiązania:
https://bibliotekanauki.pl/articles/330324.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
RNA degradation
tabu search
bioinformatics
rozkład RNA
algorytm tabu search
bioinformatyka
Opis:
In recent years, a growing interest has been observed in research on RNA (ribonucleic acid), primarily due to the discovery of the role of RNA molecules in biological systems. They not only serve as templates in protein synthesis or as adapters in the translation process, but also influence and are involved in the regulation of gene expression. The RNA degradation process is now heavily studied as a potential source of such riboregulators. In this paper, we consider the so-called RNA partial degradation problem (RNA PDP). By solving this combinatorial problem, one can reconstruct a given RNA molecule, having as input the results of the biochemical analysis of its degradation, which possibly contain errors (false negatives or false positives). From the computational point of view the RNA PDP is strongly NP-hard. Hence, there is a need for developing algorithms that construct good suboptimal solutions. We propose a heuristic approach, in which two tabu search algorithms cooperate, in order to reconstruct an RNA molecule. Computational tests clearly demonstrate that the proposed approach fits well the biological problem and allows to achieve near-optimal results. The algorithm is freely available at http://www.cs.put.poznan.pl/arybarczyk/tabusearch.php.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 2; 401-415
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
PRZESZUKANIE OSOBY A KONTROLA OSOBISTA – W KONTEKŚCIE ZASADY INFORMACJI PRAWNEJ
BODY SEARCH AND PERSONAL SEARCH – IN THE CONTEXT OF THE PRINCIPLES OF LEGAL INFORMATION
Autorzy:
Kamińska-Nawrot, Aneta
Powiązania:
https://bibliotekanauki.pl/articles/508704.pdf
Data publikacji:
2017
Wydawca:
Wyższa Szkoła Bezpieczeństwa Publicznego i Indywidualnego Apeiron w Krakowie
Tematy:
body search
personal search
principal of legal information
rights and obligations
administration body
Opis:
The principle of legal information imposes the obligation on the authorities authorized to search the person and on personal control to inform the participants about their rights and duties. In relation to the person searched, the provisions of the Criminal Procedure Code fully protect its implementation. On the other hand, persons subjected to personal control, which is governed by the Police Act and executive acts, are exposed to imprecise regulations that limit the sense of security of activity participants and influence on a degree of implementation of the principle of legal information and its basic functions, like guarantee and information functions.
Źródło:
Security, Economy & Law; 2017, 4/2017 (XVII)
2353-0669
Pojawia się w:
Security, Economy & Law
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards the data structure for effective word search
Autorzy:
Karwowski, W.
Powiązania:
https://bibliotekanauki.pl/articles/95043.pdf
Data publikacji:
2018
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
text indexing
associative array
ternary search tree
Opis:
In the paper problem of searching basic forms for words in the Polish language is discussed. Polish language has a very extensive inflection and effective method for finding base form is important in many NLP tasks for example text indexing. The method for searching, based on open-source dictionary of Polish language, is presented. In this method it is important to design a structure for storing all words from dictionary, in such a way that it allows to quickly find basic words forms. Two dictionary structures: ternary search tree and associative table are presented and discussed. Tests are performed on the six actual and three crafted artificial texts and results are compared with other possible dictionary structures. At the end conclusions about structures effectiveness are formulated.
Źródło:
Information Systems in Management; 2018, 7, 4; 227-236
2084-5537
2544-1728
Pojawia się w:
Information Systems in Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Task conditions and short-term memory search: two-phase model of STM search
Autorzy:
Orzechowski, Jarosław
Nęcka, Edward
Balas, Robert
Powiązania:
https://bibliotekanauki.pl/articles/430621.pdf
Data publikacji:
2016-04-01
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
short-term memory
STM retrieval
STM search
Sternberg paradigm
familiarity
recollection
Opis:
Short-term memory (STM) search, as investigated within the Sternberg paradigm, is usually described as exhaustive rather than self-terminated, although the debate concerning these issues is still hot. We report three experiments employing a modified Sternberg paradigm and show that whether STM search is exhaustive or self-terminated depends on task conditions. Specifically, STM search self-terminates as soon as a positive match is found, whereas exhaustive search occurs when the STM content does not contain a searched item. Additionally, we show that task conditions influence whether familiarity- or recollection-based strategies dominate STM search performance. Namely, when speeding up the tempo of stimuli presentation increases the task demands, people use familiarity-based retrieval more often, which results in faster but less accurate recognition judgments. We conclude that STM search processes flexibly adapt to current task conditions and finally propose two-phase model of STM search.
Źródło:
Polish Psychological Bulletin; 2016, 47, 1; 12-20
0079-2993
Pojawia się w:
Polish Psychological Bulletin
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu search for multiobjective combinatorial optimization : TAMOCO
Autorzy:
Hansen, M.
Powiązania:
https://bibliotekanauki.pl/articles/205565.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
polioptymalizacja kombinatoryczna
metaheuristics
multiobjective combinatorial optimization (MOCO)
tabu search
Opis:
This paper presents the multiobjective tabu search method, TAMOCO. Being an adaptation of the well-known tabu search, it can be used to generate approximations to the non-dominated solutions of multiobjective combinatorial optimization problems. TAMOCO works with a set of current solutions which, through manipulation of weights, are optimized towards the non-dominated frontier while at the same time seek to disperse over the frontier. The general procedure and some extensions to it are presented, as well as suggestions of usage in interactive procedures. A computational experiment is also presented.
Źródło:
Control and Cybernetics; 2000, 29, 3; 799-818
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Skłonność do temporalnego poszukiwania korzystnych cen a wiek nabywcy
Propensity for temporal price search and consumers age
Autorzy:
Awdziej, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/592589.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Ekonomiczny w Katowicach
Tematy:
Poszukiwanie przestrzenne
Poszukiwanie temporalne
Wiek nabywcy
Consumer age
Spatial search
Temporal search
Opis:
Nabywcy mogą korzystać z obniżek cen, dostosowując swoje wizyty do kalendarza oferowanych w sklepach promocji cenowych lub odwiedzając liczne sklepy oferujące obniżki. Wyniki zaprezentowanego w artykule badania sugerują, że skłonność do poszukiwania korzystnych cenowo ofert w wymiarze temporalnym obniża się z wiekiem, a jej poziom jest związany z „biegłością rynkową” nabywcy i jego umiejętnościami szukania.
The paper presents the results of research into consumers’ propensity for temporal price search, that is delaying or accelerating purchases to benefit from price discounts. The results suggest that propensity for temporal search tends to decline with age, and is weak among elderly consumers. This might be due to the cognitive decline of more effort required to benefit from such behaviour.
Źródło:
Studia Ekonomiczne; 2017, 328; 115-125
2083-8611
Pojawia się w:
Studia Ekonomiczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Assessment of the potential effectiveness of the WIG craft in search action at sea using SARMAP software
Autorzy:
Małyszko, M.
Powiązania:
https://bibliotekanauki.pl/articles/116819.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
aviation
SARMAP
Wing in Ground (WIG)
WIG craft
search action
IAMSAR manual
International Aeronautical and Maritime Search and Rescue Manual (IAMSAR)
Search and Rescue (SAR)
Opis:
Selection and choice of search and rescue units is an important stage in planning SAR operations at sea. The different characteristics of units enable them to be used for specific tasks at sea to varying ranges. The main advantage of WIG crafts is their speed, but they also have other features necessary for marine rescue. The assessment of the unit's potential effectiveness is based, among other things, on defining and determining the parameters influencing its ability to achieve success. Computer software such as SARMAP can be used for action planning. The article contains calculations for simulated actions of searching for several objects, additionally a graphical solution of the situation has been shown.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 2; 437-442
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Derivative free optimal thrust allocation in ship dynamic positioning based on direct search algorithms
Autorzy:
Valčić, M.
Prpić-Oršić, J.
Powiązania:
https://bibliotekanauki.pl/articles/116991.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
algorithm
dynamic positioning
direct search algorithms
sequential quadratic programing (SQP)
Singular Values Decomposition (SVD)
Lagrangian Multiplier Method (LMM)
Direct Search (DS)
Mesh Adaptive Direct Search (MADS)
Opis:
In dynamic positioning systems, nonlinear cost functions, as well as nonlinear equality and inequality constraints within optimal thrust allocation procedures cannot be handled directly by means of the solvers like industry-standardized quadratic programing (QP), at least not without appropriate linearization technique applied, which can be computationally very expensive. Thus, if optimization requirements are strict, and problem should be solved for nonlinear objective function with nonlinear equality and inequality constraints, than one should use some appropriate nonlinear optimization technique. The current state-of-the-art in nonlinear optimization for gradient-based algorithms is surely the sequential quadratic programing (SQP), both for general applications and specific thrust allocation problems. On the other hand, in recent time, one can also notice the increased applications of gradient-free optimization methods in various engineering problems. In this context, the implementation of selected derivative free direct search algorithms in optimal thrust allocation is proposed and discussed in this paper, and avenues for future research are provided.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2020, 14, 2; 309-314
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An analysis of discrepancies in search areas in a diagram of an expanding square search
Autorzy:
Kasyk, L.
Pleskacz, K.
Bugajski, G.
Powiązania:
https://bibliotekanauki.pl/articles/135076.pdf
Data publikacji:
2016
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
SAR
search area
manoeuvrability characteristics
earch patterns
rescue
accident
Opis:
Search patterns and procedures contained in the International Aeronautical and Maritime Search and Rescue Manual for Mobile Facilities meet the requirements of theoretical assumptions about search and rescue operations. But the individual manoeuvrability characteristics of a search vessel cause real search and rescue operations to differ from theoretical patterns. This article analyses the difference between theoretical and actual search regions in a Diagram of an Expanding Square Search. Different variants of parameters of ship manoeuvrability have been considered. Some solutions modifying the Diagram of Expanding Square Search are proposed by the authors.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2016, 45 (117); 94-98
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
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ł:
The Use of Initial Filters to Direct Search in Decision Processes
Autorzy:
Ramsey, David M.
Powiązania:
https://bibliotekanauki.pl/articles/578612.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Ekonomiczny w Katowicach
Tematy:
Filtering
Job search problem
Multiple signals
Sequential search
Filtrować
Problem w znalezieniu pracy
Wielokrotne sygnały
Wyszukiwanie sekwencyjne
Opis:
When looking for a valuable resource, many people use information from the Internet as a way of choosing a small number of offers to investigate in more detail. This paper considers strategies based on the filtering of initial information. A new model is presented according to which the goal of the decision maker is to maximise her expected reward from search taking into account the search costs. The effectiveness of strategies based on filtering is compared to sequential search based on a threshold and exhaustive search of a chosen number of items.
Źródło:
Multiple Criteria Decision Making; 2017, 12; 134-150
2084-1531
Pojawia się w:
Multiple Criteria Decision Making
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
W poszukiwaniu tożsamości. Lwów w twórczości Adama Zagajewskiego
In search of identity. Lviv in Adam Zagajewski’s works
Autorzy:
Czajkowska, Zoriana
Powiązania:
https://bibliotekanauki.pl/articles/511365.pdf
Data publikacji:
2020
Wydawca:
Wydawnictwo Uniwersytetu Śląskiego
Tematy:
Polish literature
Adam Zagajewski
Lviv
search for identity
search of identity
Opis:
The paper devoted to an important theme in Adam Zagajewski’s work: the search for identity. Using the author’s biography as the background, the author of the paper refers to various works by the writer (including Two Cities, To Go to Lvov, and Should We Visit Sacred Places?) and draws attention to the fact that the author’s poetic declaration about homelessness is his identity status; consequently, the author of the paper focuses on the aspect of Lviv in Zagajewski’s work.
Źródło:
Postscriptum Polonistyczne; 2020, 25, 1; 236-249
1898-1593
2353-9844
Pojawia się w:
Postscriptum Polonistyczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Porównanie algorytmów wyszukiwania Google i Yandex
Autorzy:
Bihun, O.
Miłosz, M.
Powiązania:
https://bibliotekanauki.pl/articles/98346.pdf
Data publikacji:
2017
Wydawca:
Politechnika Lubelska. Instytut Informatyki
Tematy:
wyszukiwarka
porównanie
algorytmy wyszukiwania
search engine
comparison
search algorithms
Opis:
W artykule przedstawiono rezultaty analizy porównawczej wyszukiwarek Google i Yandex. Analizę przeprowadzono pod kątem szybkości wyszukiwania oraz liczby znalezionych wyników. Przy pomocy metody kryteriów ważonych porównano Google i Yandex dla wyszukiwania w języku angielskim i rosyjskim. Analiza wielokryterialna pozwoliła wskazać wyszukiwarkę o szybszych i wydajniejszych algorytmach.
The article presents the results of a comparative analysis Google’s and Yandex’s search algorithms. The analysis was made from the point of view of search speed and number of results. Google and Yandex were compared for search in Russian and English language, using the method of weighted criteria. Multi-criteria analysis allowed to find faster and efficient search engine.
Źródło:
Journal of Computer Sciences Institute; 2017, 4; 128-130
2544-0764
Pojawia się w:
Journal of Computer Sciences Institute
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Experiments concerning hashing in the multiobjective tabu search method TAMOCO
Autorzy:
Hansen, M.
Powiązania:
https://bibliotekanauki.pl/articles/206866.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
hashing
multiobjective combinatorial optimization (MOCO)
tabu search
Opis:
This paper examines the use of hashing in the multiobjective tabu search, TAMOCO. The hasliing method was suggested by Woodruff and Zemel (1993) as a method of avoiding return to the already examined solutions in the standard single-objective tabu search. While the traditional tabu list is capable of insuring this, it can normally only be used for cycles of a moderate length. The hashing method, however, can efficiently avoid cycles over a much larger number of iterations and must be considered a natural component in the tabu search tool-box. We report from two experiments on practical models where the hashing component has been included into the TAMOCO-procedure ; with two different outcomes.
Źródło:
Control and Cybernetics; 2000, 29, 3; 789-798
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Kontrola osobista – racjonalność ustawodawcy
Personal search – legislator rationality
Autorzy:
Kamińska-Nawrot, Aneta
Powiązania:
https://bibliotekanauki.pl/articles/507183.pdf
Data publikacji:
2017-05-21
Wydawca:
Akademia Pomorska w Słupsku
Tematy:
kontrola osobista
sprawdzenie
przeszukanie osoby
prawa człowieka
prawa konstytucyjne
system prawa
personal search
check
body search
human rights
constitutional rights
legal system
Opis:
Niniejsza publikacja przedstawia problematykę kontroli osobistej dokonywanej przez funkcjonariuszy Policji jako czynności zbędnej i niezgodnej z Konstytucją RP. Autorka wskazuje zagrożenia zarówno dla obywatela, którego konstytucyjnie chronione prawa nie są właściwe realizowane, jak i dla organu ścigania, który nie jest w stanie podjąć właściwej decyzji z uwagi na brak spójnych i szczegółowych przepisów. Wyposażenie organów ścigania w dodatkowe uprawnienia zbliżone do uprawnień do przeszukania osoby, bez określenia szczegółowych instrukcji postępowania, pozostawia tym organom pełną swobodę działania i wprowadza ogólny chaos w praktyce tychże organów. Dlatego też przepisy, które uprawniają te organy do wkraczania w konstytucyjne prawa jednostki i przeprowadzania czynności pozaprocesowych, bez możliwości skontrolowania celowości i prawidłowości tych decyzji, pozostają w sprzeczności z zasadami demokratycznego państwa i powinny zostać uchylone.
An analysis of legal acts concerning the powers of the police to conduct personal searches clearly indicates that these provisions clearly conflict with the provisions of the Constitution, which exposes the police to accusations of acting against the values of a democratic state ruled by law. This publication is an argument that these acts, which were created in violation of the applicable standards of the rule of law and violate the constitutional rights of the individual, should be removed from the legal system. There still remains the problem of distinguishing, by the different law enforcement agencies, the procedure called personal search and body search.
Źródło:
Studia nad Bezpieczeństwem; 2017, 2; 45-56
2543-7321
Pojawia się w:
Studia nad Bezpieczeństwem
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling of multiunit projects using tabu search algorithm
Autorzy:
Podolski, M.
Powiązania:
https://bibliotekanauki.pl/articles/347178.pdf
Data publikacji:
2015
Wydawca:
Akademia Wojsk Lądowych imienia generała Tadeusza Kościuszki
Tematy:
construction works scheduling
optimization
job scheduling
tabu search algorithm
Opis:
The paper describes problems of discrete optimization in scheduling of multiunit projects. A model of this kind of project with possibility of using many workgroups by the contractor has been presented. It leads to reduction of project duration. For solving NP-hard optimization problem, a tabu search algorithm has been applied in the model. The example of mod-el and application of the algorithm are also included in the paper.
Źródło:
Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki; 2015, 1; 110-122
1731-8157
Pojawia się w:
Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Greedy randomised adaptive search procedures for topological design of MPLS networks
Autorzy:
Mysłek, A.
Powiązania:
https://bibliotekanauki.pl/articles/309269.pdf
Data publikacji:
2002
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
network design
optimisation
MPLS
GRASP
local search
Opis:
In this paper, the IP/MPLS network cost optimisation problem of selecting localisation of nodes and links, combined with link's dimensioning, is discussed. As the considered problem is hard, we discuss and propose greedy randomised adaptive search procedure (GRASP) based solution method. GRASP is an iterative randomised sampling technique which combines adaptive randomised greedy function in constructing initial solution with local search optimisation. The effectiveness of the method is illustrated by means of a numerical study. We compare the GRASP results with results for both exact and heuristic methods obtained in previous research concerning topological design problem.
Źródło:
Journal of Telecommunications and Information Technology; 2002, 2; 26-32
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fundamentals of scatter search and path relinking
Autorzy:
Glover, F.
Laguna, M.
Marti, R.
Powiązania:
https://bibliotekanauki.pl/articles/205907.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optymalizacja
evolutionary methods
metaheuristics
optimization
tabu search
Opis:
The evolutionary approach called Scatter Search, and its generalized form called Path Relinking, have proved unusually effective for solving a diverse array of optimization problems from both classical and real world settings. Scatter Search and Path Relinking differ from other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalized path constructions (in both Euclidean and neighborhood spaces) and by utilizing strategic designs where other approaches resort to randomization. Scatter Search and Path Relinking are also intimately related to the Tabu Search metaheuristic, and derive additional advantages by making use of adaptive memory and associated memory-exploiting mechanisms that are capable of being adapted to particular contexts. We describe the features of Scatter Search and Path Relinking that set them apart from other evolutionary approaches, and that offer opportunities for creating increasingly more versatile and effective methods in the future.
Źródło:
Control and Cybernetics; 2000, 29, 3; 653-684
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Adaptation of an Algorithm of Search and Rescue Operations to Ship Manoeuvrability
Autorzy:
Kasyk, L.
Pleskacz, K.
Powiązania:
https://bibliotekanauki.pl/articles/116946.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
search and rescue (SAR)
Ship Manoeuvrability
Algorithm
Search and Rescue Operations
Hydrometeorological Conditions
IAMSAR
SAR Action Algorithm
ECDIS
Opis:
This article presents an overview of an algorithm to facilitate action when planning search and rescue operations, taking into account actual hydro-meteorological conditions and the maneuverability of ships involved in the search.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 2; 265-268
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving multi-objective production scheduling problems with Tabu Search
Autorzy:
Loukil, T.
Teghem, J.
Fortemps, P.
Powiązania:
https://bibliotekanauki.pl/articles/206202.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multiple criteria
scheduling
tabu search
Opis:
Most of multiple criteria scheduling problems are NP-hard, so that exact procedures can only solve small problems and with two criteria. The complexity and the diversity of multiple criteria scheduling problems resulted in many alternative approaches to solve them. Exact and approximate procedures proposed in the literature are mainly dedicated to the problem to be solved and their performance depends on the problem data, on the criteria optimized, and are generally difficult to implement. We propose in this paper a Tabu Search approach to multiple criteria scheduling problems. The proposed procedure is a general flexible method, able to solve hard multiple criteria scheduling problems, easy to implement, and providing a set of potential efficient schedules. The criteria are any combination chosen from (C[sub max],T[sub max], L, N[sub T] and F).
Źródło:
Control and Cybernetics; 2000, 29, 3; 819-828
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of the Harmony Search algorithm in solving the inverse heat conduction problem
Zastosowanie algorytmu "Harmony Search" do rozwiązania odwrotnego zagadnienia przewodnictwa ciepła
Autorzy:
Hetmaniok, E.
Jama, D.
Słota, D.
Zielonka, A.
Powiązania:
https://bibliotekanauki.pl/articles/87282.pdf
Data publikacji:
2011
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
algorytm optymalizacyjny
Harmony Search
dźwięk
przewodnictwo cieplne
harmonia
zagadnienie odwrotne
optimization algorithm
harmony search
sound
heat conduction
harmony
inverse problem
Opis:
In this paper the inverse heat conduction problem with boundary condition of the third kind is solved by applying the recently invented Harmony Search algorithm belonging to the group of optimization algorithms inspired by the natural behaviors or processes. In this case the applied algorithm imitates the process of searching for the harmony in jazz music composition.In this paper the inverse heat conduction problem with boundary condition of the third kind is solved by applying the recently invented Harmony Search algorithm belonging to the group of optimization algorithms inspired by the natural behaviors or processes. In this case the applied algorithm imitates the process of searching for the harmony in jazz music composition.
Celem niniejszego artykułu jest rozwiązanie odwrotnego zagadnienia przewodnictwa ciepła z warunkiem brzegowym trzeciego rodza- ju przy użyciu niedawno zaproponowanego algorytmu „Harmony Search” (poszukiwania harmonii). Zastosowany algorytm należy do grupy algoryt- mów optymalizacyjnych inspirowanych zachowaniami bądź procesami za- chodzącymi w rzeczywistym świecie, w szczególności imituje proces poszu- kiwania harmonii dźwięków podczas improwizacji jazzowej.
Źródło:
Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska; 2011, 1; 99-108
2084-073X
Pojawia się w:
Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Semantic Framework for Graph-Based Enterprise Search
Autorzy:
Modoni, G. E.
Sacco, M.
Terkaj, W.
Powiązania:
https://bibliotekanauki.pl/articles/118193.pdf
Data publikacji:
2014
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
Enterprise Search
Graph Knowledge
semantic web
Opis:
Various recent studies have shown that in many companies workers can spend near half of their time looking for information. Effective internal search tools could make their job more efficient. However, a killer application for this type of solutions is still not available. This paper introduces an envisioned architecture, which should represent the foundations of a new generation of tools for searching information within enterprises.
Źródło:
Applied Computer Science; 2014, 10, 4; 66-74
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bi-directional search in route planning in navigation
Autorzy:
Dramski, M.
Powiązania:
https://bibliotekanauki.pl/articles/360091.pdf
Data publikacji:
2014
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
shortest path
safe route
restricted area
bi-directional search
Dijkstra algorithm
Opis:
The shortest path problem is one of the most significant ones in the field of maritime navigation. One of the most efficient algorithms was proposed by E. Dijkstra in 1959. Taking into account the development of computer technology was offered another interesting approach to the issue. The main idea is to execute the shortest path algorithm simultaneously forward from the source and backward from the target. The results are presented and discussed.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2014, 39 (111); 57-62
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The functioning of the aeronautical search and rescue services in Poland
Autorzy:
Konarzewski, A.
Powiązania:
https://bibliotekanauki.pl/articles/93222.pdf
Data publikacji:
2018
Wydawca:
Akademia Sztuki Wojennej
Tematy:
search
rescue
ASAR services
poszukiwanie
ratownictwo
służby poszukiwawczo-ratownicze
Opis:
The article examines the legal and institutional functioning of the aeronautical search and rescue services (ASAR services) in Poland, also in view of their cooperation with civil and military authorities. This study also looks at the international and national legal regulations relating to ASAR services. The work contains a presentation of the most important legal acts underpinning the organisation and functioning of the ASAR services in Poland, as well as the tasks of the civil/military aeronautical rescue coordination centre and the civil and military authorities responsible for establishment and operation of ASAR services. The characteristics of the relevant entities forming part of the ASAR services have been outlined, as have other relevant legal instruments and operational documents that are essential for the functioning of the aeronautical search and rescue services in Poland.
Źródło:
Zeszyty Naukowe Akademii Sztuki Wojennej; 2018, 1(110); 50-60
2543-6937
Pojawia się w:
Zeszyty Naukowe Akademii Sztuki Wojennej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Designing WDM networks by a variable neighborhood search
Autorzy:
Melian-Batista, B.
Höller, H.
Voss, S.
Powiązania:
https://bibliotekanauki.pl/articles/308920.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
network design
WDM
SDH
variable neighborhood search
Opis:
With the ever-rising data volume that is demanded by the market, network planning in order to minimize the necessary investment while meeting the demands is constantly an important task for the network providers. Synchronous digital hierarchy (SDH) and wavelength division multiplex (WDM) form the core of many current backbone networks. In order to solve the provisioning and routing problem in such WDM networks, we develop a variable neighborhood search (VNS) metaheuristic. VNS is a metaheuristic that combines series of random and improving local searches based on systematically changed neighborhoods. An integer flow formulation is modeled in AMPL and solved by CPLEX in order to obtain optimal solutions as a reference for the heuristic.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 4; 15-20
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Integrating pivot based search with branch and bound for binary MIPs
Autorzy:
Lokketangen, A.
Woodruff, D.
Powiązania:
https://bibliotekanauki.pl/articles/206756.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
branch and bound
chunking
heuristics
tabu search
Opis:
This paper examines integration of a sophisticated, pivot-based tabu search into branch and bound for 0-1 MIPS and global diversification tests using chunking. Issues related to behavior of a tabu search within a branch and bound algorithm are analyzed using computational experiments. Results are presented showing that the inclusion of the local search sometimes results in fewer and nodes and lower CPU times even when used in a callback mode. The main benefit in incorporating a pivot based heuristic is that an integer feasible solution can be found earlier in the branching process. Computational experiments are presented showing that for some instances the overall search time is improved, while for some others the tabu search can find good solutions quickly.
Źródło:
Control and Cybernetics; 2000, 29, 3; 741-759
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Weryfikacja poprawności działania algorytmu tabu search w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących
Verification of correct operation of a tabu search algorithm for elastic task model scheduling in control and measurement systems
Autorzy:
Powroźnik, P.
Powiązania:
https://bibliotekanauki.pl/articles/152993.pdf
Data publikacji:
2010
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
szeregowanie zadań
elastyczny model
algorytm tabu search
task scheduling
elastic task model
tabu search algorithm
Opis:
W artykule przedstawiono ideę zastosowania algorytmu tabu search do wyznaczenia okresu zadań w elastycznym modelu szeregowania zadań. Wyniki przeprowadzonych symulacji dowodzą przydatność algorytmu w doborze parametrów czasowych w elastycznym modelu szeregowania zadań. Rozdział pierwszy zawiera tło zastosowania teorii szeregowania zadań w systemach pomiarowo - sterujących. Rozdział drugi wprowadza czytelnika do zastosowania elastycznego modelu szeregowania zadań w systemach pomiarowo - sterujących. Rozdział ten zawiera krótki przegląd literaturowy prezentowanej tematyki [1, 2, 3]. Rozdział trzeci przedstawia ideę zastosowania wybranego algorytmu heurystycznego tabu serach w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących. Rysunek pierwszy przedstawia schemat blokowy szeregowania zadań przy zastosowaniu algorytmu tabu search. Rozdział czwarty zawiera wyniki z przeprowadzonych symulacji zastosowania algorytmu tabu search w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących. Podsumowanie zawiera najważniejsze wnioski wynikające ze stosowania omawianego algorytmu w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących.
In this paper use of a tabu search algorithm for elastic task model scheduling is presented. The results of simulations confirm usefulness of this method for assigning the time parameters in elastic task model scheduling. In the first section, the background of application of task model scheduling to control and measurement systems is outlined. The second section deals with introduction to using the elastic task model scheduling for control and measurement systems. This section provides a brief literature review of the presented subjects [1, 2, 3]. The third section presents an idea of applying the selected tabu search heuristic algorithm to the elastic task model scheduling in control and measurement systems. The block diagram of the elastic task model scheduling with use of the tabu search algorithm is shown in Fig. 1. The fourth section contains the results of simulations carried out for the elastic task model scheduling with use of the tabu search algorithm in control and measurement systems. At the end there are presented the main conclusions drawn from using the tabu search algorithm for assigning the task time parameters in the elastic task model scheduling in control and measurement systems.
Źródło:
Pomiary Automatyka Kontrola; 2010, R. 56, nr 11, 11; 1345-1347
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Model of the Search and Rescue operations in Republic of Serbia
Autorzy:
Šoškić, S.
Ćurčić, J.
Karapetrović, L.
Powiązania:
https://bibliotekanauki.pl/articles/116341.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
search and rescue (SAR)
SAR Operation
IAMSAR Manual
Rescue Coordination Centre (RCC)
Search and Rescue Sub-Region (SRS)
SAR in Republic of Serbia
Search and Rescue Unit (SRU)
Water Course Traffic Service (WTS)
Opis:
The IAMSAR Manual contains practical guidelines for the organisation of maritime and aeronautical SAR, mission coordination, operations of search and rescue units (SRUs) and provision of SAR-related training. RCC (rescue coordination center) - a unit responsible for promoting efficient organization of search and rescue operations within a search and rescue region. Rescue Coordination Centre (RCC) means a designated coordination centre that acts as the national Search and Rescue Region's coordination centre and the international point of contact for search and rescue (SAR) services and that takes care of the continuous maintenance of coordination and communication preparedness and coordinates SAR operations within its Search and Rescue Sub-Region (SRS). Definition of tearms Search: An operation, normally coordinated by a RCC or RSC, using available personnel and facilities to locate persons in distress. (IAMSAR, Volume 1). Definition of terms Rescue: An operation to retrieve persons in distress, provide for their initial medical or other needs and deliver them to a place of safety. Work should contribute to the establishment of thinking for model of SAR in Republic of Serbia due to the growing need of interventions in the prevention and elimination of consequences of natural disasters and better organization of search and rescue using the standards prescribed in the the world.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 2; 269-277
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Accelerating backtrack search with a best-first-search strategy
Autorzy:
Mann, Z. Á.
Szép, T.
Powiązania:
https://bibliotekanauki.pl/articles/329816.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
best first search
backtrack
branch and bound
constraint satisfaction problem (CSP)
frequent restarting
algorytm wyszukiwania
system backtrack
metoda podziału i ograniczeń
programowanie z ograniczeniami
Opis:
Backtrack-style exhaustive search algorithms for NP-hard problems tend to have large variance in their runtime. This is because “fortunate” branching decisions can lead to finding a solution quickly, whereas “unfortunate” decisions in another run can lead the algorithm to a region of the search space with no solutions. In the literature, frequent restarting has been suggested as a means to overcome this problem. In this paper, we propose a more sophisticated approach: a best-first-search heuristic to quickly move between parts of the search space, always concentrating on the most promising region. We describe how this idea can be efficiently incorporated into a backtrack search algorithm, without sacrificing optimality. Moreover, we demonstrate empirically that, for hard solvable problem instances, the new approach provides significantly higher speed-up than frequent restarting.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 901-916
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Search traffic w obszarach z deficytem miejsc postojowych
Search traffic in the area with a big shortage of vacant parking spots
Autorzy:
Duda-Wiertel, Urszula
Powiązania:
https://bibliotekanauki.pl/articles/2146711.pdf
Data publikacji:
2021
Wydawca:
Stowarzyszenie Inżynierów i Techników Komunikacji Rzeczpospolitej Polskiej
Tematy:
ruch generowany poszukiwaniem wolnego miejsca parkingowego
parkowanie
polityka parkingowa
search traffic
parking
parking policy
Opis:
Artykuł w całości poświęcono problematyce ruchu generowanego poszukiwaniem wolnego miejsca parkingowego (search traffic), pojawiającego się w obszarach z deficytem miejsc parkingowych, a którego najczęstszą przyczyną jest duża różnica pomiędzy popytem na parkowanie a podażą parkingową. W pracy przedstawiono wyniki wnikliwego przeglądu literatury: analizę definicji i interpretacji ruchu tego rodzaju, rozważania nad możliwymi czynnikami wpływającymi na jego występowanie i parametry oraz strategie realizowania tego poszukiwania, przegląd stosowanych za granicą metod badawczych, przykładów modelowania oraz stopnia uwzględnienia go w analizach różnego rodzaju. Odwołano się do wyników badań ruchu tego rodzaju przeprowadzonych w Krakowie, które pokazują możliwy udział search traffic w ruchu ogólnym – na tle wyników z miast zagranicznych. Zwrócono uwagę na uciążliwość przemieszczeń wykonywanych w ramach search traffic oraz kosztów, które generują.
This article is dedicated to the problem of traffic generated by searching for parking (search traffic) in areas with deficit of parking spaces. The most common reason for this problem is a big difference between parking demand and supply. An insightful overview of the literaturę: definition analysis and interpretation of this type of traffic flow, possible factors influencing its occurence and parameters, review of the actual condition of researches, method of research, examples of modelling, the extent to which it has been incorporated into analyses of various types have been presented. Local research of search traffic in Polish conditions has been conducted in Krakow. In the article, the overview of the result of this research was included to show the possible share of search traffic in general traffic – compared to the results from foreign cities. The attention was paid to the inconvenience of search traffic movements and the costs they generate.
Źródło:
Transport Miejski i Regionalny; 2021, 3; 19--26
1732-5153
Pojawia się w:
Transport Miejski i Regionalny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Search for knowledge and professional scepticism of accounting students – an experimental study
Autorzy:
Ciołek, Maciej
Powiązania:
https://bibliotekanauki.pl/articles/582953.pdf
Data publikacji:
2018
Wydawca:
Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
Tematy:
auditing
search for knowledge
accounting students
experimental study
HPSS
Opis:
The purpose of this study is to examine whether university accounting programs shape such ‘search for knowledge’ trait in significantly more effective comparing other university programs in the field of economy. For this purpose I conducted an experimental study using Hurtt Professional Skepticism Scale – HPSS which is one of the most recognized skepticism measures. I surveyed 432 students of Poznań University of Economics who follow either accounting program or management program (control group). The results showed that only programs in accounting increased the mean level of ‘search for knowledge’ trait significantly comparing to management program. The robustness analysis showed that gender, professional experience and length of service had no statistically significant impact on results.
Źródło:
Prace Naukowe Uniwersytetu Ekonomicznego we Wrocławiu; 2018, 515; 243-256
1899-3192
Pojawia się w:
Prace Naukowe Uniwersytetu Ekonomicznego we Wrocławiu
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A graphical model to determine the influence of surface currents on small objects immersed in water
Autorzy:
Kijewska, M.
Powiązania:
https://bibliotekanauki.pl/articles/135216.pdf
Data publikacji:
2016
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
estimating survivor location
search survivor movement
object searching
search planning
trajectory prediction
search and rescue
graph theory
hydrodynamic models
Opis:
This paper proposes a model of the interactions between surface currents and small, moving objects. These objects are immersed in water so that the part extending above the water is no larger than a human head. These interactions are defined as the weighted-directed graph. The basis for determining the edge weights are the directions of the surface currents. The speeds of these currents are used to calculate the time of moving objects. According to the modelling method of the surface-current influence on small objects, presented in this paper, it is possible to implement an application supporting search-and-rescue-operation planning. This method can be used to locate small objects, such as survivors, when planning search-and-rescue operations. Thus, the routes of these objects moving together with surface-water masses can be predicted using this method.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2016, 47 (119); 170-175
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Saving migrants from the sea: improving training for search and rescue operations
Autorzy:
Radojević, S.
Kresojević, M.
Powiązania:
https://bibliotekanauki.pl/articles/116881.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Maritime Education and Training (MET)
saving migrants
saving migrants from the sea
Search and Rescue (SAR)
search and rescue operations
maritime search and rescue
IAMSAR
situation
mission
execution
administration and logistics
command
control and communication SMEA
Opis:
This paper presents a research in the field of maritime training and education for Search and Rescue (SAR) migrants at sea. This research is oriented to more effective method based on team training for SAR Operations utilizing ship simulation and process of Operational Planning. The training which conducts in cabinets and ship simulators at the Military Academy provides the best results in the optimal application of onboard and emergency/SAR procedures. The training method is in line with all conventions of the International Maritime Organization and models of maritime training courses. The proposed training method can be developed and applied in all schools and centers where seafarers and other Maritime Search and Rescue personnel are trained.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2020, 14, 1; 129-133
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Selecting a good configuration of one-way and two-way routes using tabu search
Autorzy:
Drezner, Z.
Salhi, S.
Powiązania:
https://bibliotekanauki.pl/articles/206880.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
metaheuristics
network design
tabu search
Opis:
The problem of designing a near optimal configuration of a system of one-way and two-way routes is investigated. Each arc of the network can be designed as either a two-way arc or a one-way arc in one of the two directions. The traffic speed on a one-way arc is faster than the speed on a two-way arc by a given factor. The problem is to design a network which minimizes total travel time between all pairs of nodes by the proper selection of one-way and two-way arcs. Efficient implementations of the metaheuristic tabu search are designed for solving this network design problem. These approaches are tested on a set of network problems with encouraging results.
Źródło:
Control and Cybernetics; 2000, 29, 3; 725-740
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu Search Against Permutation Based Stream Ciphers
Autorzy:
Polak, I.
Boryczka, M.
Powiązania:
https://bibliotekanauki.pl/articles/227111.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
tabu search
TS
cryptanalysis
RC4
VMPC
stream cipher
state recovery attack
Opis:
Encryption is one of the most effective methods of securing data confidentiality, whether stored on hard drives or transferred (e.g. by e-mail or phone call). In this paper a new state recovery attack with tabu search is introduced. Based on research and theoretical approximation it is shown that the internal state can be recovered after checking 2⁵² internal states for RC4 and 2¹⁸⁰ for VMPC.
Źródło:
International Journal of Electronics and Telecommunications; 2018, 64, 2; 137-145
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Grid Search of Convolutional Neural Network model in the case of load forecasting
Autorzy:
Tran, Thanh Ngoc
Powiązania:
https://bibliotekanauki.pl/articles/1841362.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
load forecasting
grid search
convolutional neural network
Opis:
The Convolutional Neural Network (CNN) model is one of the most effective models for load forecasting with hyperparameters which can be used not only to determine the CNN structure and but also to train the CNN model. This paper proposes a frame work for Grid Search hyperparameters of the CNN model. In a training process, the optimalmodels will specify conditions that satisfy requirement for minimum of accuracy scoresof Root Mean Square Error (RMSE), Mean Absolute Percentage Error (MAPE) and Mean Absolute Error (MAE). In the testing process, these optimal models will be used to evaluate the results along with all other ones. The results indicated that the optimal models have accuracy scores near the minimum values. Load demand data of Queensland (Australia) and Ho Chi Minh City (Vietnam) were utilized to verify the accuracy and reliability of the Grid Search framework.
Źródło:
Archives of Electrical Engineering; 2021, 70, 1; 25-36
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows
Autorzy:
Gładysz, J.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/226174.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
anycast
network design
tabu search
survivability
Opis:
In this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.
Źródło:
International Journal of Electronics and Telecommunications; 2010, 56, 1; 41-47
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Probability of containment and search effort factor in the dynamic search area
Autorzy:
Budny, T.
Powiązania:
https://bibliotekanauki.pl/articles/320540.pdf
Data publikacji:
2008
Wydawca:
Polskie Forum Nawigacyjne
Tematy:
operacje ratownicze
prawdopodobieństwo zawierania się
SAR operation
probability of containment
Opis:
In the paper, there is presented a problem of search object drift during SAR operation. Presented method of conducting search takes into account probability of containment (POC) of searched object inside search area. Its also consider available endurance of SAR unit. Described method allows for achieving as good as possible average POC.
Źródło:
Annual of Navigation; 2008, 13; 15-24
1640-8632
Pojawia się w:
Annual of Navigation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem
Autorzy:
Bereta, M.
Powiązania:
https://bibliotekanauki.pl/articles/308683.pdf
Data publikacji:
2017
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
Euclidean Steiner tree problem
MCTS
Monte Carlo Tree Search
UCT algorithm
Opis:
This study is concerned with a novel Monte Carlo Tree Search algorithm for the problem of minimal Euclidean Steiner tree on a plane. Given p p p points (terminals) on a plane, the goal is to find a connection between all the points, so that the total sum of the lengths of edges is as low as possible, while an addition of extra points (Steiner points) is allowed. Finding the minimum Steiner tree is known to be np-hard. While exact algorithms exist for this problem in 2D, their efficiency decreases when the number of terminals grows. A novel algorithm based on Upper Confidence Bound for Trees is proposed. It is adapted to the specific characteristics of Steiner trees. A simple heuristic for fast generation of feasible solutions based on Fermat points is proposed together with a correction procedure. By combing Monte Carlo Tree Search and the proposed heuristics, the proposed algorithm is shown to work better than both the greedy heuristic and pure Monte Carlo simulations. Results of numerical experiments for randomly generated and benchmark library problems (from OR-Lib) are presented and discussed.
Źródło:
Journal of Telecommunications and Information Technology; 2017, 4; 71-81
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A strategy in sports betting with the nearest neighbours search and genetic algorithms
Autorzy:
Borycki, D.
Powiązania:
https://bibliotekanauki.pl/articles/106184.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
sports betting
nearest neighbour search
genetic algorithm
English Premier League
Opis:
The point of sports betting is not merely to correctly predict the outcome of a game, but to actually win on a bet. We propose a model of sports betting that uses the nearest neighbours search and genetic algorithms to do the job. It uses data on the teams playing, their respective formations, individual players, results of previous games, as well as odds offered by bookmakers. The model has been trained using the data from the seasons 2002/03 until 2008/09 of the English Premier League and tested against the already played games of the seasons 2009/10 and 2010/11.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2011, 11, 1; 7-13
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hyper-heuristics for cross-domain search
Autorzy:
Cichowicz, T..
Drozdowski, M.
Frankiewicz, M.
Pawlak, G.
Rytwinski, F.
Wasilewski, J.
Powiązania:
https://bibliotekanauki.pl/articles/201681.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
hyper-heuristics
cross-domain heuristic search
HyFlex
Opis:
In this paper we present two hyper-heuristics developed for the Cross-Domain Heuristic Search Challenge. Hyper-heuristics solve hard combinatorial problems by guiding low level heuristics, rather than by manipulating problem solutions directly. Two hyper-heuristics are presented: Five Phase Approach and Genetic Hive. Development paths of the algorithms and testing methods are outlined. Performance of both methods is studied. Useful and interesting experience gained in construction of the hyper-heuristics are presented. Conclusions and recommendations for the future advancement of hyper-heuristic methodologies are discussed.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 4; 801-808
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A support vector machine with the tabu search algorithm for freeway incident detection
Autorzy:
Yao, B.
Hu, P.
Zhang, M.
Jin, M.
Powiązania:
https://bibliotekanauki.pl/articles/329943.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
automated incident detection
support vector machine (SVM)
tabu search
freeway
maszyna wektorów wspierających
odcinek swobodny trasy
algorytm tabu search
Opis:
Automated Incident Detection (AID) is an important part of Advanced Traffic Management and Information Systems (ATMISs). An automated incident detection system can effectively provide information on an incident, which can help initiate the required measure to reduce the influence of the incident. To accurately detect incidents in expressways, a Support Vector Machine (SVM) is used in this paper. Since the selection of optimal parameters for the SVM can improve prediction accuracy, the tabu search algorithm is employed to optimize the SVM parameters. The proposed model is evaluated with data for two freeways in China. The results show that the tabu search algorithm can effectively provide better parameter values for the SVM, and SVM models outperform Artificial Neural Networks (ANNs) in freeway incident detection.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 2; 397-404
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Charakterystyka search funds jako inwestorów dla firm rodzinnych w Polsce w obliczu braku sukcesji
The Profile of Search Funds as Investors for Family Businesses in the Face of Succession Crisis in Poland
Autorzy:
Biegajło, Mateusz
Powiązania:
https://bibliotekanauki.pl/articles/18104498.pdf
Data publikacji:
2022-01-18
Wydawca:
Szkoła Główna Handlowa w Warszawie. Kolegium Zarządzania i Finansów
Tematy:
search fund
family business
succession
firma rodzinna
sukcesja
Opis:
Celem artykułu jest analiza search funds jako nowej grupy inwestorów na rynku kapitałowym w Polsce, która stanowi jednocześnie grupę potencjalnych inwestorów dla firm rodzinnych w obliczu braku sukcesji. W części teoretycznej artykułu zaprezentowana została istotność firm rodzinnych w Polsce oraz skala problematyki braku sukcesji. Przedstawiona została również geneza powstania search funds, ich charakterystyka oraz cechy, które sprawiają, że w teorii ta grupa inwestorów jest niemal stworzona dla firm rodzinnych, w których brakuje rodzinnego następcy. W części empirycznej przedstawiono studium przypadku transakcji sprzedaży polskiej firmy rodzinnej na rzecz search fund, która do końca 2020 r. pozostawała pierwszą i jedyną transakcją search funds w Polsce. W wyniku przeprowadzonych analiz wykazano, że sprzedaż przedsiębiorstwa rodzinnego na rzecz search fund powinna na trwałe znaleźć się w katalogu możliwych form dezinwestycji właściciela firmy rodzinnej w obliczu braku sukcesji.
The paper aims to analyze search funds, a new group of investors in the capital market in Poland which, at the same time, is a group of potential investors for family businesses facing succession crisis. The theoretical section of the paper discusses the relevance of family businesses for the Polish economy and the scale of succession issues. The origin of an investment vehicle such as a search fund is discussed together with its profile which, in theory, makes this group of investors an almost ideal match for family businesses where there is no family succession. The empirical part is a case study that explores the act of selling a Polish family company to a search fund, the first and the only one transaction of this kind in Poland reported by the end of 2020. Findings from conducted analyses have demonstrated that selling a family company to a search fund should become a permanently available option and an acceptable form of disinvestment in the face of succession crisis.
Źródło:
Studia i Prace Kolegium Zarządzania i Finansów; 2021, 182; 9-30
1234-8872
2657-5620
Pojawia się w:
Studia i Prace Kolegium Zarządzania i Finansów
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-50 z 1363

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