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
Wyrównaj
Wyświetlanie 1-15 z 257
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
Google Search intensity and stock returns in frontier markets: Evidence from the Vietnamese market
Autorzy:
Duc, Dang Thi Viet
Hoai, Nguyen Thu
Nguyen, Van Phuoc
Nguyen, Dang Phong
Anh, Nguyen Huong
Hai, Ho Hong
Powiązania:
https://bibliotekanauki.pl/articles/51476161.pdf
Data publikacji:
2024
Wydawca:
Uniwersytet Ekonomiczny w Poznaniu. Wydawnictwo Uniwersytetu Ekonomicznego w Poznaniu
Tematy:
Google search
Vietnam
COVID-19
investor attention
search intensity
stock returns
frontier markets
Opis:
The study investigates investor attention's impact on stock trading by modeling the relationship between Google search intensity and stock return with stocks listed in frontier markets in Vietnam from October 2016 to October 2021. The study has three findings. First, the study confirms the price pressure hypothesis and attention theory that Google search intensity positively affects stock returns. Second, this study indicates that the impact of Google search intensity on stock price is short. The positive effect is within the week of searching and reverses the following week, although the reverse force is not strong. Third, the relationship is more robust post than pre-COVID-19, suggesting that after a shock, more new individual investors enter the market, the impact of GSVI on stock return is stronger.
Źródło:
Economics and Business Review; 2024, 10, 1; 30-56
2392-1641
Pojawia się w:
Economics and Business Review
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ł
Wyświetlanie 1-15 z 257

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