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: Temat

  Lista filtrów

Dostawca treści

Podbaza

Wyrównaj
Wyświetlanie 1-25 z 415
Tytuł:
Procedural and non-procedural activities to reveal and secure drug substances
Autorzy:
Theuss, Patryk
Powiązania:
https://bibliotekanauki.pl/articles/45450973.pdf
Data publikacji:
2023-08-23
Wydawca:
Akademia Policji w Szczytnie
Tematy:
search
body search
drugs
forfeiture
evidence
Opis:
Combating drug crime is one of the most important challenges faced by law enforcement agencies in the modern world. The infamous popularity of prohibited substances, in particular amphetamine and marijuana, is due to its availability and reasonable price. Eliminating the indicated threat requires such diligent operational work from the law enforcement authorities and the comprehensive use of legal tools provided by the legislator. Taking appropriate steps, both procedural and non-procedural, leads to a factual conduct of criminal proceedings in the in rem and ad personam phase. In the presented article, the author analyzed the current legal status in terms of possible procedural and non-trial activities aimed at disclosing and securing prohibited substances. An important element of this publication is also an indication of activities aimed at collecting comprehensive evidence in accordance with the principle of material truth, which is a constitutive principle of criminal procedure. The conducted analysis leads to the conclusion that in global terms, combating drug crime is a measurable benefit not only in legal but also social, economic and sociological terms.
Źródło:
Przegląd Policyjny; 2023, 150(2); 365-375
0867-5708
Pojawia się w:
Przegląd Policyjny
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł:
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ł:
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ł:
Methods of conducting the shipwrecked people search at sea with the analysis of thermal images and spectrum characteristics of objects
Autorzy:
Milewski, S.
Zieliński, M.
Powiązania:
https://bibliotekanauki.pl/articles/320759.pdf
Data publikacji:
1999
Wydawca:
Polskie Forum Nawigacyjne
Tematy:
shipwrecked people search
Opis:
Methods of acquisition, data processing and their interpretation are the main problems in the field of scanning. One of many ways and possibilities for information acquisition is utilisation of devices working in the infrared radiation range. It gains special meaning under conditions of limited visibility in the range of classical optics application.
Źródło:
Annual of Navigation; 1999, 1; 91-98
1640-8632
Pojawia się w:
Annual of Navigation
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ł:
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ł:
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ł:
Problematyka przeszukania w ustawie o ochronie konkurencji i konsumentów – zmiany przepisów uokk po nowelizacji z 2014 r.
Issue of Search in the Act on Competition and Consumer Protection – Amendments to the Regulations of the Act of 2014
Autorzy:
Porwisz, Monika
Powiązania:
https://bibliotekanauki.pl/articles/416992.pdf
Data publikacji:
2015-08
Wydawca:
Najwyższa Izba Kontroli
Tematy:
Issue of Search
competition and consumer protection
carrying out a search
Opis:
The article is dedicated to how search is regulated in the Act of 16th February 2007 on competition and consumer protection. It especially focuses on the amendments to the regulations related to this issue that are in force since 18th January 2015, introduced with the Act of 10th June 2014 on the amendments to the Act on competition and consumer protection, and the Act – Code of Civil Procedure. The article describes the legal basis and the course of carrying out a search aimed at obtaining, by a competition and consumer protection body, of material that may be used as evidence in proceedings with the involvement of the President of the Office of Competition and Consumer Protection (UOKiK).
Źródło:
Kontrola Państwowa; 2015, 60, 4 (363); 131-149
0452-5027
Pojawia się w:
Kontrola Państwowa
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ł:
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ł:
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ł:
"EKSPEDYCJA ORZEŁ BalexMetal" w poszukiwaniu legendarnego polskiego okrętu podwodnego
"ORZEŁ BalexMetal EXPEDITION" - in search of the legendary polish submarine
Autorzy:
Siadek, A.
Jando, H.
Powiązania:
https://bibliotekanauki.pl/articles/366435.pdf
Data publikacji:
2008
Wydawca:
Polskie Towarzystwo Medycyny i Techniki Hiperbarycznej
Tematy:
poszukiwania podwodne
underwater search
Opis:
W artykule przedstawiono genezę i przebieg realizowanej przez Morska Agencję Poszukiwawczą ekspedycji, której celem było odnalezienie zaginionego podczas II Wojny Swiatowej okretu podwodnego ORP "Orzeł".
In the paper depicted the genesis and proceedings of realized by Marine Search Agency expedition, which destination was lost during the Second World War submarine ORP "Orzeł" retrieving
Źródło:
Polish Hyperbaric Research; 2008, 3(24); 29-33
1734-7009
2084-0535
Pojawia się w:
Polish Hyperbaric Research
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ł:
Jak Polacy poszukują pracy? – analiza logitowa
How do the Polish People Seek Work? – Logistic Regression Analysis
Autorzy:
Kubiak, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/596437.pdf
Data publikacji:
2017
Wydawca:
Łódzkie Towarzystwo Naukowe
Tematy:
bezrobocie
poszukiwania pracy
metody poszukiwań pracy
unemployment
job search
job search methods
Opis:
Modele poszukiwań na rynku pracy traktują proces poszukiwania pracy jako inwestycję w zdobywanie informacji o możliwościach uzyskania zatrudnienia. Podejmowane działania wymagają ponoszenia określonych kosztów i nakładów w celu znalezienia najlepszych warunków zatrudnienia. W artykule podejmuję próbę identyfikacji czynników mających wpływ na prawdopodobieństwo znalezienia pracy przez osoby bezrobotne. Badanie przeprowadzam w oparciu o dane jednostkowe pochodzące z BAEL. Tworzę panel, w którym każda jednostka obserwowana jest w czterech momentach. Zabieg taki pozwala określić wpływ wybranych czynników na poszukiwania pracy oraz ustalić, jak zmienia się ich znaczenie wraz z wydłużaniem się okresu poszukiwań. Wyniki badań wskazują, że takie cechy respondentów, jak płeć, wiek, stan cywilny, wykształcenie, posiadane doświadczenie zawodowe aproksymowane stażem pracy i zawodem wykonywanym w przeszłości, miejsce zamieszkania oraz podejmowane działania w celu znalezienia zatrudnienia istotnie różnicują prawdopodobieństwo znalezienia pracy przez osoby bezrobotne, a siła ich oddziaływania zmienia się wraz z wydłużaniem się okresu poszukiwań.
The job search models treat the search process as the way to collect information about the job offers. The search process is time and resource consuming. The agents bear theses costs to find the most suitable job postings. In this study, I try to identify factors that determine the probability of the job offer encountering by the unemployed individuals. I use individual LFS data and create a panel in which each individual is observed 4 times. I analyse the impact of particular factor and test whether their importance is time varying. The results prove that sex, age, marital status, place of residence and applied search methods diversify likelihood of a job match. Moreover, the impact of particular factors changes long the unemployment duration.
Źródło:
Studia Prawno-Ekonomiczne; 2017, 103; 193-202
0081-6841
Pojawia się w:
Studia Prawno-Ekonomiczne
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ł:
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ł:
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ł:
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ł:
Nonmonotone line searches for optimization algorithms
Autorzy:
Sachs, E. W.
Sachs, S. M.
Powiązania:
https://bibliotekanauki.pl/articles/206103.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
line search
nonmonotone
Armijo's rule
Opis:
In this paper we develop a general convergence theory for nonmonotone line searches in optimization algorithms. The advantage of this theory is that it is applicable to various step size rules that have been published in the past decades. This gives more insight into the structure of these step size rules and points to several relaxations of the hypotheses. Furthermore, it can be used in the framework of discretized infinite-dimensional optimization problems like optimal control problems and ties the discretized problems to the original problem formulation.
Źródło:
Control and Cybernetics; 2011, 40, 4; 1059-1075
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ł:
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ł:
How good are my search strings? Reflections on using an existing review as a quasi-gold standard
Autorzy:
Tran, Huynh Khanh Vi
Börstler, Jürgen
Ali, Nauman bin
Unterkalmsteiner, Michael
Powiązania:
https://bibliotekanauki.pl/articles/2060914.pdf
Data publikacji:
2022
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
search string construction
automated search validation
quasi-gold standard
systematic literature review
systematic mapping study
Opis:
Background: Systematic literature studies (SLS) have become a core research methodology in Evidence-based Software Engineering (EBSE). Search completeness, i.e., finding all relevant papers on the topic of interest, has been recognized as one of the most commonly discussed validity issues of SLSs. Aim: This study aims at raising awareness on the issues related to search string construction and on search validation using a quasi-gold standard (QGS). Furthermore, we aim at providing guidelines for search string validation. Method: We use a recently completed tertiary study as a case and complement our findings with the observations from other researchers studying and advancing EBSE. Results: We found that the issue of assessing QGS quality has not seen much attention in the literature, and the validation of automated searches in SLSs could be improved. Hence, we propose to extend the current search validation approach by the additional analysis step of the automated search validation results and provide recommendations for the QGS construction. Conclusion: In this paper, we report on new issues which could affect search completeness in SLSs. Furthermore, the proposed guideline and recommendations could help researchers implement a more reliable search strategy in their SLSs.
Źródło:
e-Informatica Software Engineering Journal; 2022, 16, 1; art. no. 220103
1897-7979
Pojawia się w:
e-Informatica Software Engineering Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cellular particle swarm optimization with a simple adaptive local search strategy for the permutation flow shop scheduling problem
Autorzy:
Seck-Tuoh-Mora, Juan C.
Medina-Marin, Joselito
Martinez-Gomez, Erick S.
Hernandez-Gress, Eva S.
Hernandez-Romero, Norberto
Volpi-Leon, Valeria
Powiązania:
https://bibliotekanauki.pl/articles/230060.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
flow shop
particle swarm optimization (PSO)
local search strategy
hybrid search method
cellular automata
scheduling
Opis:
Permutation flow shop scheduling problem deals with the production planning of a number of jobs processed by a set of machines in the same order. Several metaheuristics have been proposed for minimizing the makespan of this problem. Taking as basis the previous Alternate Two-Phase PSO (ATPPSO) method and the neighborhood concepts of the Cellular PSO algorithm proposed for continuous problems, this paper proposes the improvement of ATPPSO with a simple adaptive local search strategy (called CAPSO-SALS) to enhance its performance. CAPSO-SALS keeps the simplicity of ATPPSO and boosts the local search based on a neighborhood for every solution. Neighbors are produced by interchanges or insertions of jobs which are selected by a linear roulette scheme depending of the makespan of the best personal positions. The performance of CAPSO-SALS is evaluated using the 12 different sets of Taillard’s benchmark problems and then is contrasted with the original and another previous enhancement of the ATPPSO algorithm. Finally, CAPSO-SALS is compared as well with other ten classic and state-of-art metaheuristics, obtaining satisfactory results.
Źródło:
Archives of Control Sciences; 2019, 29, 2; 205-226
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-25 z 415

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