Informacja

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

Wyszukujesz frazę "search" wg kryterium: Temat


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ł:
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ł:
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ł:
"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ł:
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ł:
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ł:
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ł
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ł
Tytuł:
Assigning NMR spectra of irregular RNAs by heuristic algorithms
Autorzy:
Szachniuk, M.
Powiązania:
https://bibliotekanauki.pl/articles/201820.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
bioinformatics
NMR
tabu search
beam search
RNA structure
bioinformatyka
wyszukiwarka tabu
wyszukiwarka wiązki
struktura RNA
Opis:
Computer-aided analysis and preprocessing of spectral data is a prerequisite for any study of molecular structures by Nuclear Magnetic Resonance (NMR) spectroscopy. The data processing stage usually involves a considerable dedication of time and expert knowledge to cope with peak picking, resonance signal assignment and calculation of structure parameters. A significant part of the latter step is performed in an automated way. However, in peak picking and resonance assignment a multistage manual assistance is still essential. The work presented here is focused on the theoretical modeling and analyzing the assignment problem by applying heuristic approaches to the NMR spectra recorded for RNA structures containing irregular regions.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 1; 329-338
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Psychologiczna koncepcja poszukiwania sacrum w religijności i duchowości
Autorzy:
Krok, Dariusz
Powiązania:
https://bibliotekanauki.pl/articles/669541.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Papieski Jana Pawła II w Krakowie
Tematy:
Religiousness
search for the sacred
spirituality
Opis:
Nowadays, there is a growing interest in the area of psychology of religion as regards religiousness and spirituality. In the past both terms overlapped substantially which was clearly visible in great spiritual traditions of many religions. Recently, however, spirituality has emerged as a distinct construct. Although, religiousness and spirituality have common characteristics they are generally regarded as related but not identical constructs. Both religiousness and spirituality are embedded within the context of “a search for the sacred” which refers to sacrum. The main difference is that religiousness represents the personal or communal search for the sacred that happens within a traditional and institutionalized context, while spirituality is usually understood as a search for the sacred at the level of the individual. The process of “search” entails the attempt to discover significance. People are goal-directed beings who pursue whatever they hold significant in their lives. The search for sacrum lies in the heart of religiousness and spirituality and can be found at multiple level of analysis: psychological, social, physical, and material. There are four main factors that determine the search for sacrum: developmental stage, culture and upbringing, life events, and activity. Their levels specify one’s religiousness and spirituality.
Źródło:
Analecta Cracoviensia; 2012, 44
2391-6842
0209-0864
Pojawia się w:
Analecta Cracoviensia
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ł:
Google is Introducing a New Feature for Fact Checking
Autorzy:
Alföldiová, Alexandra
Powiązania:
https://bibliotekanauki.pl/articles/526487.pdf
Data publikacji:
2018
Wydawca:
Univerzita sv. Cyrila a Metoda. Fakulta masmediálnej komunikácie
Tematy:
Google
Fact-checking
Tools
Data+
Search
Opis:
The article reviews the recent introduction of Google’s Fact Check Tool available in the Google News section. The tool is focused on the examination of articles that claim to be correct by checking the facts stated in the articles, based on an algorithmic process in cooperation with review systems. The Fact Check Tool is currently in beta version, accessible on certain websites in the United States and the United Kingdom. The algorithmic process is not yet final and requires improvements in order to state an objective approach towards the reviewing of articles without human affecting the checking.
Źródło:
Media Literacy and Academic Research; 2018, 1, 2; 78-79
2585-8726
2585-9188
Pojawia się w:
Media Literacy and Academic Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Map Quality Measurements for GNG and SOM based Document Collection Maps
Autorzy:
Kłopotek, M. A.
Wierzchoń, S. T.
Ciesielski, K.
Dramiński, M.
Czerski, D.
Kujawiak, M.
Powiązania:
https://bibliotekanauki.pl/articles/92814.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
Search Engines
map of document collection
Opis:
The paper presents a proposal of a set of measures for comparison of maps of document collections as well as preliminary results concerning evaluation of their usefulness and expressive power.
Źródło:
Studia Informatica : systems and information technology; 2006, 1(7); 65-76
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
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 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ł:
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ł:
Application that assists modern website positioning: modern SEO
Autorzy:
Zabierowski, W.
Ciechanowski, C.
Powiązania:
https://bibliotekanauki.pl/articles/398096.pdf
Data publikacji:
2016
Wydawca:
Politechnika Łódzka. Wydział Mikroelektroniki i Informatyki
Tematy:
SEO
Search Engine Optimization
SEM
Search Engine Marketing
optymalizacja dla wyszukiwarek internetowych
marketing w wyszukiwarkach internetowych
Opis:
The article describes the immense potential of using websites and their optimization in technical and content aspect, with the aim of building prominence in natural Google Search results. The study also presents the functionality of service research tools, website return links, and website research tools.
Źródło:
International Journal of Microelectronics and Computer Science; 2016, 7, 4; 133-139
2080-8755
2353-9607
Pojawia się w:
International Journal of Microelectronics and Computer Science
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ł:
Route prediction for a person in water drifting in chosen basins using graph theory
Autorzy:
Kijewska, M.
Powiązania:
https://bibliotekanauki.pl/articles/135003.pdf
Data publikacji:
2017
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
route prediction
trajectory prediction
object movement
search planning
survivor
person in water
search and rescue
graph theory
Opis:
In this paper, the route prediction for a person in water was performed on the basis of a developed graph algorithm. This person drifted in water under the influence of surface currents and wind. The total drift route for the person in water was established as the route in a weighted directed graph. Vertices of this graph correspond to given points within a given basin. Additionally, the graph’s edges show possible directions of the overall human drift. The weight of the given edge describes the difference between the gradient of the edge and the total drift direction calculated on the basis of surface current field data and wind field data. An application has been created on the basis of a given algorithm which might be used to support the search for survivors in coastal areas (e.g. port basins, basins adjacent to the port, bays and sea areas) for which hydrodynamic models reliably reflect local phenomena.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2017, 50 (122); 45-51
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
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ł:
Determinants of Involuntary Job Termination in the Polish Labor Market
Autorzy:
Pytka, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/483261.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
involuntary unemployment
count data models
job search
Opis:
The intention of this article is to evaluate the exogenous dismissal probability for a certain worker depending on her characteristics for the Polish labor market. To model this phenomenon I considered a range of count data models. In the analysis the data from the Polish General Social Survey of 2008 was used. Covariates explaining the number of unemployment spells were selected in the spirit of the human-capital theory. In the course of the study existence of intransferable firm-specific human capital across employers and depreciation of the human capital acquired through learning by doing have been empirically confirmed. The conducted analysis may be considered the first step in the calibration of a job-search model with heterogeneous agents.
Źródło:
Central European Journal of Economic Modelling and Econometrics; 2011, 3, 1; 25-38
2080-0886
2080-119X
Pojawia się w:
Central European Journal of Economic Modelling and Econometrics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of Genetic Algorithms in Design of Public Transport Network
Autorzy:
Lesiak, Piotr
Bojarczak, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/504669.pdf
Data publikacji:
2015
Wydawca:
Międzynarodowa Wyższa Szkoła Logistyki i Transportu
Tematy:
genetic algorithms
search methods
optimization
transportation problems
Opis:
The paper presents possibilities of application of genetic algorithms in design of public transport network. Transportation tasks such as determination of optimal routes and timetable for means of transport belong to difficult complex optimization problems, therefore they cannot be solved using traditional search algorithms. It turns out that genetic algorithms can be very useful to solve these transportation problem.
Źródło:
Logistics and Transport; 2015, 26, 2; 75-82
1734-2015
Pojawia się w:
Logistics and Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Актуальные методы исследования детской литературы в собраниях зарубежных библиотек. На примере коллекции польской детской книги 19-20 вв. в фонде славянского отделения библиотеки Российской академии наук (Санкт-Петербург)
Autorzy:
Димяненко, Анна Димяненко
Powiązania:
https://bibliotekanauki.pl/articles/1826657.pdf
Data publikacji:
2018-10-08
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
bibliographic search
polish children's book
library collections
Opis:
The report concerns the problems of the methodology of studying children’s literaturein foreign libraries and archives. Also studies difficulties that researchesof subject encounter fields collections and deals what kind of modern informationaltools are used to solve this problem in libraries and archives.
Źródło:
Conversatoria Litteraria; 2018, 12; 237-242
1897-1423
Pojawia się w:
Conversatoria Litteraria
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Unmanned Aerial Vehicles in the Security Service and as a New Tool in the Hands of Criminals
Autorzy:
Krakowiak, Ewelina
Powiązania:
https://bibliotekanauki.pl/articles/466204.pdf
Data publikacji:
2018-06-30
Wydawca:
Centrum Rzeczoznawstwa Budowlanego Sp. z o.o.
Tematy:
UAV
security
smuggling
search and rescue
terrorism
Opis:
The aim of the article is to show areas in which unmanned aerial vehicles are used for protection purposes and to show that drones are increasingly used for criminal purposes, an important aspect is also to present the possibilities offered by these devices. Increasingly, new technologies are used daily in human activities. They become supportive, and at the same time, they facilitate many activities. With the introduction of unmanned aerial vehicles, they have become an object that has been adopted in many industries, from simple flight operations, to filming and shooting, to complex transport or search. Due to the many constraints inherent in the human factor, the necessity of introducing drones into many everyday industries has been recognized. Particular attention has been paid to unmanned aerial vehicles in the area of security and protection, where daily activities involve a high risk of human loss. For this purpose, new technologies are introduced, but drones, due to their characteristics and many other factors, a tool used by criminals for the purposes of trade, data theft, illegal shooting and photographing. These are just a few of the offences committed by means of unmanned aerial vehicles. This poses a threat and conducive to the emergence illegal market using drones.
Źródło:
Safety & Defense; 2018, 4(1), 1; 31-36
2450-551X
Pojawia się w:
Safety & Defense
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ł:
Perturbations in a Signed Graph and its Index
Autorzy:
Stanić, Zoran
Powiązania:
https://bibliotekanauki.pl/articles/31343791.pdf
Data publikacji:
2018-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
signed graph
switching equivalence
index
computer search
Opis:
In this paper we consider the behaviour of the largest eigenvalue (also called the index) of signed graphs under small perturbations like adding a vertex, adding an edge or changing the sign of an edge. We also give a partial ordering of signed cacti with common underlying graph by their indices and demonstrate a general method for obtaining lower and upper bounds for the index. Finally, we provide our computational results related to the generation of small signed graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 3; 841-852
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
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ł:
A critical review of the newest biologically-inspired algorithms for the flowshop scheduling problem
Autorzy:
Duda, J.
Powiązania:
https://bibliotekanauki.pl/articles/1943277.pdf
Data publikacji:
2007
Wydawca:
Politechnika Gdańska
Tematy:
flowshop scheduling
metaheuristics
local search
hybrid algorithms
Opis:
The three most recent bio-inspired heuristics proposed in the OR literature for solving the flowshop scheduling problem are revised in the paper. All of these algorithms use local search procedures to improve solutions achieved by the main procedure. The author tries to asses the gains from hybridizing such heuristics with local search procedures. The achieved results confirm that simple local search algorithms can compete successfully with much complex hybrids.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2007, 11, 1-2; 7-19
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
SO(3) matrix transformation for rapid polarization search and coding in a three-plate polarizer
Autorzy:
Huang, C
Wang, X
Powiązania:
https://bibliotekanauki.pl/articles/174349.pdf
Data publikacji:
2015
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
SO(3) transformer
tabu search
polarization coding
Opis:
A SO(3) transformer of a three-plate polarizer is adopted to rapidly achieve the transformation of the polarized state. The polarization coding based on Stokes components S2 and S3 is analyzed and demonstrated. Tabu search algorithm is used to accelerate the transformation of the polarized state by utilizing Mueller matrix roots decomposition to decompose the SO(3) matrix, and substituting first order Taylor series approximations for the trigonometric functions in the SO(3) matrix. The results show that bias voltage is less than 120 V in the coding zone. The search speed of our algorithm is faster than the one without first order Taylor series approximations by 4 times.
Źródło:
Optica Applicata; 2015, 45, 1; 101-112
0078-5466
1899-7015
Pojawia się w:
Optica Applicata
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The edge domination problem
Autorzy:
Hwang, Shiow-Fen
Chang, Gerard
Powiązania:
https://bibliotekanauki.pl/articles/971919.pdf
Data publikacji:
1995
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
edge domination
block graph
depth first search
Opis:
An edge dominating set of a graph is a set D of edges such that every edge not in D is adjacent to at least one edge in D. In this paper we present a linear time algorithm for finding a minimum edge dominating set of a block graph.
Źródło:
Discussiones Mathematicae Graph Theory; 1995, 15, 1; 51-57
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Matrioshkas soft approaches to personalized web exploration
Autorzy:
Bordogna, G.
Psaila, G.
Powiązania:
https://bibliotekanauki.pl/articles/970192.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
Matrioshka
prototypal meta-search system
interaction framework
Opis:
In this paper, we present the soft approaches and techniques developed within Matrioshka, a prototypal meta-search system aimed at providing personalized exploratory facilities, addressing the well known Ranked-List Problem. Matrioshka implements a novel interaction framework that provides tools for clustering documents retrieved by search engines, tools for exploring the content of clusters through the analysis of some cluster properties, tools for generating disambiguated queries from the clusters, and tools for combining the clusters to highlight their shared contents. All these tools are defined based on soft operations, in order to deal with intrinsic semantic ambiguity, imprecision and uncertainty of complex web searches. In this way, the user is supported in the deployment of complex web search exploratory activities.
Źródło:
Control and Cybernetics; 2010, 39, 4; 925-957
0324-8569
Pojawia się w:
Control and Cybernetics
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ł:
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ł:
Google AdWords advertising in higher education marketing
Autorzy:
Dawidziuk, R.
Powiązania:
https://bibliotekanauki.pl/articles/213763.pdf
Data publikacji:
2012
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Lotnictwa
Tematy:
advertisement
Google AdWords search
marketing of universities
Opis:
In the long run, prestige does play an important role in building a university's brand from the point of view of both management and students, alumni in particular. Prestige is built by the academic staff, programmes of studies, and the learning conditions, to name the most important factors. A programme of studies is a distinctive element that sets a university apart from the competition, and by doing so decides about its competitive advantage. In the context of higher education marketing, it is also important to remember about the already mentioned process of adjusting programmes of studies to the labour market requirements.
Źródło:
Prace Instytutu Lotnictwa; 2012, 5 (226); 123-129
0509-6669
2300-5408
Pojawia się w:
Prace Instytutu Lotnictwa
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ł:
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ł:
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ł:
Młodzi Polacy poszukują prawdziwych wartości … wśród duchownych. Analiza badań w świetle logoterapii v.e. Frankla
Young Poles in search of real values... Among the religious. A research in the light of logotherapy by v. E. Frankl
Autorzy:
Formella, Zbigniew
Ekert, Amata
Powiązania:
https://bibliotekanauki.pl/articles/496423.pdf
Data publikacji:
2011
Wydawca:
Towarzystwo Naukowe Franciszka Salezego
Tematy:
Young People
search of meaning
vocation
pastoral
Opis:
This article aims at describing the reality where young Poles live and grow up, as well as their ways of coping with the challenges coming from both modern times and the changes in their own home country, Europe and the whole world. Generally speaking, we reflect upon the ways of leading the youth through adulthood. One opportunity is represented by the meetings organised by youth pastoral centres, managed by female and male congregations, as well as by Institutes of consecrated life. In this article, the results of the research carried out in 13 youth pastoral centres in the year 2007/2008 are presented. Just the variable related to the search for the meaning of life is dealt with in more detail, as soon as the very first existential questions arise, such as “Who am I?”, “Why am I living?”, “What is the sense of the things I do?”, “Where is my place in the world?” It is necessary to lead young people through this complex process of growing up, providing support, backing and presence. On the other hand, the following question arises: “to what extent can we intervene in the person’s development and in the shaping of their personality through contents and values, influencing their way of perceiving the world and themselves?” The analysis of this research can serve as a starting point in order to reflect on what is to be elaborated in detail, what is to be changed, what is to be highlighted, so that the meetings with the youth be more productive and the suggestions become a reference in the search for better solutions.
Źródło:
Seminare. Poszukiwania naukowe; 2011, 29; 173-202
1232-8766
Pojawia się w:
Seminare. Poszukiwania naukowe
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ł:
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ł:
System poszukiwania i ratownictwa lotniczego na terenie RP w morskiej strefie odpowiedzialności. Problemy i proponowane zmiany oraz kierunki rozwoju
Air search and rescue system in the Republic of Poland within the maritime responsibility zone. Issues and proposed changes as well as directions for development
Autorzy:
Surzyn, Michał
Sadaj-Owczarek, Kamila
Powiązania:
https://bibliotekanauki.pl/articles/34106645.pdf
Data publikacji:
2023-09-30
Wydawca:
Collegium Witelona Uczelnia Państwowa
Tematy:
Państwowe Ratownictwo Medyczne
Lotnicze Pogotowie Ratunkowe
System ASAR
System SAR
System poszukiwania
State Emergency Medical Service
Air Ambulance Service
ASAR – Aeronautical
Search and Rescue
SAR – Search and Rescue
Search System
Opis:
W pracy opisano działanie służb współpracujących z Państwowym Ratownictwem Medycznym w aspekcie działających w kraju systemów poszukiwania związanych ze służbą ASAR oraz SAR. Współdziałanie służb w trakcie akcji poszukiwawczych stanowi niezwykle istotny element rokowniczy i ma niewątpliwie duży wpływ na przeżywalność poszkodowanych.
This paper describes the operation of services cooperating with the State Emergency Medical Service in terms of the search systems operating in the country related to the ASAR and SAR services. The cooperation of services during search operations is an extremely important prognostic element and undoubtedly has a significant impact on the survival of the injured.
Źródło:
Zeszyty Naukowe Collegium Witelona; 2023, 3, 48; 105-116
2956-302X
2956-3208
Pojawia się w:
Zeszyty Naukowe Collegium Witelona
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ł:
Użytkownicy bibliotecznych dokumentów kartograficznych
Users of cartographic documents in libraries
Autorzy:
Poloczek, I.
Powiązania:
https://bibliotekanauki.pl/articles/204498.pdf
Data publikacji:
2007
Wydawca:
Polskie Towarzystwo Geograficzne
Tematy:
dokument kartograficzny
wyszukiwanie
użytkownik
cartographic document
user
search
Opis:
Dokumenty kartograficzne są współcześnie w powszechnym użyciu. Ich bogactwo i różnorodność sprawiają jednak, że są one trudne do opracowania bibliotecznego. W czasie kiedy w Polsce trwają prace nad instrukcją katalogowania dokumentów kartograficznych w systemach komputerowych, istotną sprawą jest zwrócenie uwagi na użytkownika tych dokumentów, na jego potrzeby, trudności i oczekiwania. Z doświadczeń bibliotekarzy pracujących przy udostępnianiu dokumentów kartograficznych wynika, że osoby nie związane zawodowo z kartografią mają na ogół dosyć małą wiedzę na temat tych dokumentów. Nowym wyzwaniem dla bibliotekarzy jest obecnie coraz powszechniejsze stosowanie technik komputerowych do opracowania, przechowywania i prezentacji map. Użytkownicy coraz częściej chcą korzystać z map cyfrowych, co stawia nowe zadania przed bibliotekami i bibliotekarzami. Z tego względu biblioteki powinny stać się miejscem, gdzie dostępne będą również dokumenty w postaci cyfrowej i jednocześnie powinny one być pośrednikiem między użytkownikiem a ogromnym zasobem informacji, by pomóc użytkownikowi odnaleźć się w tym zasobie i jak najlepiej z niego korzystać. W celu poznania i przeanalizowania, które elementy dokumentu kartograficznego są dla użytkownika najważniejsze, podjęto badanie czytelników Centralnej Biblioteki Geografii i Ochrony Środowiska Instytutu Geografii i Przestrzennego Zagospodarowania PAN. Badanie zostało wykonane metodą rejestru zapytań. Było ono prowadzone przez 16 miesięcy - od stycznia 2005 do końca kwietnia 2006 roku. Ogółem zarejestrowano 90 czytelników poszukujących map. Na podstawie pytań użytkowników map wyodrębniono osiem elementów dokumentu kartograficznego: obszar, skalę, temat, rok, wydawcę, tytuł, autora i język. Nie zawsze w pytaniu dany element był wyrażony bezpośrednio, często bowiem z kontekstu pytania wynikało, że dokument musi być w odpowiedniej skali, obejmować konkretny obszar lub dotyczyć konkretnego tematu. Najwięcej, bo aż 79 pytań dotyczyło obszaru, a 53 skali. W dalszej kolejności użytkowników interesował temat mapy (występował on w 46 pytaniach) i rok wydania lub odzwierciedlona w dokumencie sytuacja w konkretnych latach - 34 pytania. Zanotowano tylko pojedyncze pytania o wydawcę, autora dokumentu i język, w którym ma być dokument. Wyniki analizy pytań użytkowników powinny zainteresować osoby zajmujące się opracowaniem haseł przedmiotowych dla dokumentów kartograficznych. Wyszukiwanie dokumentów kartograficznych nie jest sprawą prostą, gdyż - jak to wynika z przeprowadzonych badań, a również innych opracowań - tylko mały procent użytkowników szuka konkretnej mapy. Zdecydowana większość poszukuje obszaru geograficznego i tematu oraz skali. Skala, choć jest ważnym elementem wyszukiwawczym, nie ma odzwierciedlenia w hasłach przedmiotowych, dlatego tak znacząca jest możliwość połączenia w wyszukiwarce haseł przedmiotowych z innymi elementami opisu, które zawierają geograficzne współrzędne mapy. Podobny problem dotyczy roku wydania. W wyszukiwaniu tego typu dokumentów istotna jest możliwość zastosowania technik komputerowych. Konieczna jest większa niż w przypadku książek liczba haseł wyszukiwawczych, z których minimum to obszar i temat.
Cartographic documents are frequently used today. Because of their abundance and variety it is difficult to arrange and file them in libraries. Since an instruction for cataloguing of cartographic documents in computer systems is currently being developed in Poland, now is the right moment to think about the user of these documents, his needs, problems and expectations. Librarians working with cartographic documents point out that lay users usually have very limited knowledge about these documents. Computer tools for processing, storage and presentation of maps, which are currently getting more popular, are another challenge which librarians have to face today. Map users frequently prefer digital maps - meeting these expectations is another task for librarians and libraries. Modern libraries should be a place where documents should be available also in digital form; at the same time they should act as an intermediary between users and the enormous volume of data, helping them to use it best. In order to establish which elements of cartographic documents have priority for the user, a research was conducted on the readers of the Central Library of Geography and Environmental Protection at the Polish Academy of Sciences' Institute of Geography and Spatial Organization. The data was collected by the register of enquiries within 16 months (January 2005 -April 2006). 90 users searching for maps were registered. Basing on the enquiries 8 elements of cartographic documents were defined: area, scale, topic, year, publisher, title, author and language. Particular elements were often not expressed directly in the enquiry - they could be concluded from the context. Most of the enquiries - 79 in total - concerned the area, and 53 - the scale. The next most common element was the topic (46 enquiries) and the year of publication or presentation (34 enquiries). Only single enquiries concerned the publishers, author and language. The results of the survey should be useful for preparation of topic entries for cartographic documents. Searching for cartographic documents is not easy. The research (and other sources) shows that only a small percentage of users look for a particular map. Most enquiries refer to an area, topic and scale. Although scale is an important search parameter, it is not included in topic entries. It is therefore important that in the search engine topic entries are linked to other parameters including geographical coordinates. The same is relevant for the year of publication. Application of computer technology is the key issue for searching of such documents. A larger number of topic entries is needed, the minimum of which are area and topic.
Źródło:
Polski Przegląd Kartograficzny; 2007, T. 39, nr 1, 1; 35-43
0324-8321
Pojawia się w:
Polski Przegląd Kartograficzny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Experimental and numerical investigation of towing resistance of the innovative pneumatic life raft
Autorzy:
Burciu, Z.
Abramowicz-Gerigk, T.
Jachowski, J.
Kornacka, E.
Wawrzusiszyn, M.
Powiązania:
https://bibliotekanauki.pl/articles/258684.pdf
Data publikacji:
2017
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
search and rescue
pneumatic life raft
towing resistance
Opis:
The paper presents the experimental and numerical investigations of a novel design of a pneumatic life raft in calm water conditions. Two main issues were considered: the life raft performance under tow and its resistance in calm water conditions. The experiment and CFD simulations were performed by using the full scale prototype to eliminate the scale effect. The towing tank tests confirmed the results of numerical computations. The compatibility of the results of numerical and experimental tests was high mainly because the new life raft does not deform under the hydrodynamic and aerodynamic loads. The characteristics similar to rigid body behaviour result mainly from a new construction and materials used for manufacturing the life raft.
Źródło:
Polish Maritime Research; 2017, 2; 40-47
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sources of medical information of patients referred to colorectal surgery outpatient clinic for hemorrhoidal disease
Autorzy:
Spychalski, Piotr
Perdyan, Adrian
Łaski, Dariusz
Kobiela, Jarek
Błażyńska-Spychalska, Agata
Łachiński, Andrzej
Śledziński, Zbigniew
Powiązania:
https://bibliotekanauki.pl/articles/895825.pdf
Data publikacji:
2019-06-04
Wydawca:
Gdański Uniwersytet Medyczny
Tematy:
hemorrhoids
internet
patient preference
google trends
search engine
Opis:
Background: We surveyed patients with hemorrhoids about their behavior regarding searching for information about that disease and confronted it with data obtained from Google Trends website and Google searches. We aimed to determine sources of information on hemorrhoids used by patients. Secondary aim was to assess the quality of information provided by Internet in particular. Material and methods: We collected 78 surveys from patients of the outpatient surgical clinic at Medical University of Gdańsk, in which we asked about sources of information about hemorrhoids. We used Google Trends to analyze most often used search queries associated with that topic. In result, we analyzed the content of top 10 Google search results of that queries in order to verify reliability. Results: Over 80% of surveyed patients looked for information about that disease online, 50% of whom were satisfied with the quality of information obtained. Our Google Trends analysis showed that term hemorrhoids has overwhelming prevalence in comparison to remaining terms. Analysis of top 10 Google search results showed that 7 in 10 organic links lead to websites with professional information about hemorrhoids. Conclusions: Patients use the Internet as a source of knowledge about hemorrhoids and find it satisfactory. Moreover, our research indicates that this information is reliable.
Źródło:
European Journal of Translational and Clinical Medicine; 2019, 2, 1; 36-43
2657-3148
2657-3156
Pojawia się w:
European Journal of Translational and Clinical Medicine
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reduced Complexity by Combining Norm Based Ordering MMSE-BSIDE Detection in MIMO Systems
Autorzy:
Jothikumar, R.
Rangaswamy, N.
Powiązania:
https://bibliotekanauki.pl/articles/226286.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
MIMO
MMSE
SD
ML
BSIDE
breadth first search
Opis:
The breadth first signal decoder (BSIDE) is well known for its optimal maximum likelihood (ML) performance with lesser complexity. In this paper, we analyze a multiple-input multiple-output (MIMO) detection scheme that combines; column norm based ordering minimum mean square error (MMSE) and BSIDE detection methods. The investigation is carried out with a breadth first tree traversal technique, where the computational complexity encountered at the lower layers of the tree is high. This can be eliminated by carrying detection in the lower half of the tree structure using MMSE and upper half using BSIDE, after rearranging the column of the channel using norm calculation. The simulation results show that this approach achieves 22% of complexity reduction for 2x2 and 50% for 4x4 MIMO systems without any degradation in the performance.
Źródło:
International Journal of Electronics and Telecommunications; 2017, 63, 3; 305-308
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithm combined with a local search method for identifying susceptibility genes
Autorzy:
Yang, C -H.
Moi, S. -H.
Lin, Y. -D.
Chuang, L. -Y.
Powiązania:
https://bibliotekanauki.pl/articles/91586.pdf
Data publikacji:
2016
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
genetic algorithms
identifying susceptibility genes
local search algorithm
Opis:
Detecting genetic association models between single nucleotide polymorphisms (SNPs) in various disease-related genes can help to understand susceptibility to disease. Statistical tools have been widely used to detect significant genetic association models, according to their related statistical values, including odds ratio (OR), chi-square test (χ2), p-value, etc. However, the high number of computations entailed in such operations may limit the capacity of such statistical tools to detect high-order genetic associations. In this study, we propose lsGA algorithm, a genetic algorithm based on local search method, to detect significant genetic association models amongst large numbers of SNP combinations. We used two disease models to simulate the large data sets considering the minor allele frequency (MAF), number of SNPs, and number of samples. The three-order epistasis models were evaluated by chi-square test (χ2) to evaluate the significance (P-value < 0.05). Analysis results showed that lsGA provided higher chi-square test values than that of GA. Simple linear regression indicated that lsGA provides a significant advantage over GA, providing the highest β values and significant p-value.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2016, 6, 3; 203-212
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Po(k)ruszyć sen – pedagogika filozoficzna jako wybuchowe poszukiwanie
Autorzy:
Krzysztof, Maliszewski,
Powiązania:
https://bibliotekanauki.pl/articles/892497.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Warszawski. Wydawnictwa Uniwersytetu Warszawskiego
Tematy:
philosophical pedagogy
Socratic tradition
explosive search
worldview
dreams
Opis:
Philosophical thinking has no fixed location. It is constructed of tensions between different areas of culture: science, art, religion, politics, education. Therefore, in this article the philosophical pedagogy has been presented as a point of view, not a discipline with clear boundaries. The source of this perspective is the Socratic tradition, especially two of its motifs: thinking without limits and the search of the real problems. Philosophical thinking protects a background of education from becoming an ideology. It is also an effort devoted to broadening the expressivity of the sphere of education. So, we can say that philosophical pedagogy is a dynamite that disrupts some educational dreams (illusions) and simultaneously sets in motion other dreams (symbols, values).
Źródło:
Kwartalnik Pedagogiczny; 2017, 62(1 (243)); 20-33
0023-5938
Pojawia się w:
Kwartalnik Pedagogiczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving some deterministic finite horizon inventory models
Autorzy:
Sinha, P.
Powiązania:
https://bibliotekanauki.pl/articles/406508.pdf
Data publikacji:
2013
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
inventory
finite horizon
globally optimal solution
search method
Opis:
Two single-item, deterministic, continuous, finite horizon inventory models having no shortage have been considered. A demand rate function, which is relatively general, for the item has been assumed. In the first model, units of the item do not deteriorate; while in the second units deteriorate in a constant fraction rate. Some optimality conditions are shown for the models. Based on these properties, single variable search methods have been described to obtain globally optimal solutions. Numerical experiments indicate that the methods yield acceptable solutions within small time and are suitable for practical applications.
Źródło:
Operations Research and Decisions; 2013, 23, 1; 63-74
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
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ł
Tytuł:
Single-objective optimal power flow for electric power systems based on crow search algorithm
Autorzy:
Fathy, A.
Abdelaziz, A.
Powiązania:
https://bibliotekanauki.pl/articles/140618.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
crow search algorithm
distribution network
optimal power flow
Opis:
This paper presents the application of a recent meta-heuristic optimization technique named a crow search algorithm (CSA) in solving the problem of an optimal power flow (OPF) for electric power systems. Various constrained objective functions, total fuel cost, active power loss and pollutant emission are proposed. The generators’ output powers, generators’ terminal voltages, transmission lines’ taps and the shunt capacitors’ reactive powers are considered as variables to be designed. The proposed methodology based on the CSA is applied on an IEEE 30-bus system and IEEE 118-bus system. The obtained results via the CSA are compared to others and they ensure the superiority of the CSA in solving the OPF problem in electric power systems.
Źródło:
Archives of Electrical Engineering; 2018, 67, 1; 123-138
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Design of Grover’s Algorithm over 2, 3 and 4- Qubit Systems in Quantum Programming Studio
Autorzy:
Diana, Jingle
Shylu, Sam
Mano, Mano
Ananth, Jude
Selvaraj, Daniel
Powiązania:
https://bibliotekanauki.pl/articles/2055247.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
quantum search
Oracle
Qubit
Hadamard
transform
phase shift
Opis:
In this paper, we design and analyse the Circuit for Grover’s Quantum Search Algorithm on 2, 3 and 4-qubit systems, in terms of number of gates, representation of state vectors and measurement probability for the state vectors. We designed, examined and simulated the quantum circuit on IBM Q platform using Quantum Programming Studio. We present the theoretical implementation of the search algorithm on different qubit systems. We observe that our circuit design for 2 and 4-qubit systems are precise and do not introduce any error while experiencing a small error to our design of 3-qubit quantum system.
Źródło:
International Journal of Electronics and Telecommunications; 2022, 68, 1; 77--82
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of survey results in terms of selection of characteristics of the mining rescuer to the ranks of rapid response
Analiza wyników badań ankietowych w aspekcie doboru cech charakteryzujących ratownika górniczego do zastępu szybkiego reagowania
Autorzy:
Grodzicka, A.
Szlązak, J.
Powiązania:
https://bibliotekanauki.pl/articles/409800.pdf
Data publikacji:
2016
Wydawca:
STE GROUP
Tematy:
mining
search and rescue
questionnaire
górnictwo
ratownictwo
ankietyzacja
Opis:
The authors of the current study undertook the subject of the analysis features of the mining rescuer as a member of the ranks of the rescue, with particular emphasis on the following parameters: heart rate, body weight, height, BMI, age and seniority in the mining and rescue. This publication concerns the analysis of the test results of these characteristics rescuer as a potential member of the ranks of the rescue, taking into account its risk appetite, stress resistance, attitude towards life, the role of the team, teamwork, attitude to work, motivation to work and physical fitness.
Autorzy w dotychczasowych badaniach podejmowali tematykę z zakresu analizy cech charakteryzujących ratownika górniczego jako członka zastępu ratowniczego ze szczególnym uwzględnieniem następujących parametrów: częstość akcji serca, masa ciała, wzrost, wskaźnik BMI, wiek oraz staż pracy w górnictwie i w ratownictwie. Prezentowana publikacja dotyczy analizy wyników badań tych cech ratownika jako potencjalnego członka zastępu ratowniczego z uwzględnieniem jego skłonności do ryzyka, odporności na stres, nastawienia do życia, roli w zespole, współpracy w zespole, nastawienia do pracy, motywacji do pracy i sprawności fizycznej.
Źródło:
Management Systems in Production Engineering; 2016, 2 (22); 135-140
2299-0461
Pojawia się w:
Management Systems in Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An adaptive hybrid metaheuristic for permutation flowshop scheduling
Autorzy:
Moccellin, J.
Santos, M.
Powiązania:
https://bibliotekanauki.pl/articles/206870.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
flowshop sequencing
hybrid metaheuristics
simulated annealing
tabu search
Opis:
In this paper we present a hybrid Tabu Search - Simulated Annealing heuristic fox the minimal makespan flowshop sequencing problem. In order to evaluate the effectiveness of the hybridization we compare the hybrid metaheuristic with pure Tabu Search and Simulated Annealing heuristics. The results from computational experience are discussed.
Źródło:
Control and Cybernetics; 2000, 29, 3; 761-771
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The impact of relevance feedback on web-based information retrieval for horizon scanning applications
Autorzy:
Palomino, Marco A.
Taylor, Tim
McBride, Geoff
Mortimer, Hugh
Owen, Richard
Depledge, Michael
Powiązania:
https://bibliotekanauki.pl/articles/432410.pdf
Data publikacji:
2013
Wydawca:
Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
Tematy:
horizon scanning
web mining
strategic planning
search engines
Opis:
Horizon scanning is being increasingly regarded as an instrument to support strategic decision making. It requires the systematic examination of data to identify potential threats and opportunities to improve resilience and decrease risk exposure. Horizon scanning may benefit from various retrieval techniques to augment the acquisition of data, though this involves a search for novel and emerging issues without knowing them beforehand. To optimise such a search, we propose the use of relevance feedback, which involves human interaction in the retrieval process so as to improve the results. As a proof-of-concept demonstration, we have carried out a horizon scanning exercise which showed that our utilisation of relevance feedback for horizon scanning applications was able to maintain the retrieval of relevant documents constant over the entire length of the experiment, without any reduction. This represents an improvement over previous studies where relevance feedback was not considered.
Źródło:
Informatyka Ekonomiczna; 2013, 2(28); 77-99
1507-3858
Pojawia się w:
Informatyka Ekonomiczna
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Problem-Independent Approach to Multiprocessor Dependent Task Scheduling
Autorzy:
Król, D.
Zydek, D.
Koszałka, L.
Powiązania:
https://bibliotekanauki.pl/articles/226364.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
tasks scheduling
DAG
genetic algorithm
tabu search
makespan
Opis:
This paper concerns Directed Acyclic Graph task scheduling on parallel executors. The problem is solved using two new implementations of Tabu Search and genetic algorithm presented in the paper. A new approach to solution coding is also introduced and implemented in both metaheuristics algorithms. Results given by the algorithms are compared to those generated by greedy LPT and SS-FF algorithms; and HAR algorithm. The analysis of the obtained results of multistage simulation experiments confirms the conclusion that the proposed and implemented algorithms are characterized by very good performance and characteristics.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 4; 369-379
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Topography of Mythization and Ritual of Reading The review of Dorota Siwor, Tropy mitu i rytuału. O polskiej prozie współczesnej – nie tylko najnowszej [Traces of Myth and Ritual On Contemporary Polish Prose]
Autorzy:
Dutka, Elżbieta
Powiązania:
https://bibliotekanauki.pl/articles/1828654.pdf
Data publikacji:
2020-07-09
Wydawca:
Akademia Techniczno-Humanistyczna w Bielsku-Białej
Tematy:
myth
mythization strategy
ritual
Polish prose
search
topography
Opis:
The article is a review of Dorota Siwor’s monography entitled Traces of Myth and Ritual On Contemporary Polish Prose (Tropy mitu i rytuału. O polskiej prozie współczesnej – nie tylko najnowszej). The affinities between literature and myth (and the ritual that is associated with myth) are analysed in this book from several perspectives – those of structure, theme, and function. Dorota Siwor’s interpretations generally focus on Polish prose composed in the second half of the twentieth century and the first several years of the twenty-first century (the literary works written by Andrzej Stasiuk, Olga Tokarczuk, Wilhelm Dichter, but also by Czesław Miłosz, Tadeusz Konwicki, Tadeusz Nowak and others). Essays included in this book are interpretative, but some of them also offer a systematic account. In this monograph, the main problem – the mythization strategy in prose – is explained as a type of search (search for order in the surrounding world, search for the origins and search for oneself). The analyses in mythical and ritualistic contexts highlight the interesting tendencies in prose but also show some kind of different topography (topography of mythization) and ritual of reading (not only private but also more universal).
Źródło:
Świat i Słowo; 2020, 34, 1; 419-420
1731-3317
Pojawia się w:
Świat i Słowo
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards a characterization of bipartite switching classes by means of forbidden subgraphs
Autorzy:
Hage, Jurriaan
Harju, Tero
Powiązania:
https://bibliotekanauki.pl/articles/743415.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
switching classes
bipartite graphs
forbidden subgraphs
combinatorial search
Opis:
We investigate which switching classes do not contain a bipartite graph. Our final aim is a characterization by means of a set of critically non-bipartite graphs: they do not have a bipartite switch, but every induced proper subgraph does. In addition to the odd cycles, we list a number of exceptional cases and prove that these are indeed critically non-bipartite. Finally, we give a number of structural results towards proving the fact that we have indeed found them all. The search for critically non-bipartite graphs was done using software written in C and Scheme. We report on our experiences in coping with the combinatorial explosion.
Źródło:
Discussiones Mathematicae Graph Theory; 2007, 27, 3; 471-483
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
У пошуках iдентичностi: Героïня украïнськоï жiночоï прози рубежа ХХ-ХХ1 ст.
In search of identity: Heroine of Ukrainian woman prose of end of XX and beginning of XXI centuries
Autorzy:
Betko, Iryna
Powiązania:
https://bibliotekanauki.pl/articles/481907.pdf
Data publikacji:
2008-12-01
Wydawca:
Uniwersytet Warmińsko-Mazurski w Olsztynie
Tematy:
Ukrainian woman prose
Ukrainian literature
search of identity
Opis:
One of the most unusual events in the Ukrinian new wave literature is massive return women in it, which began in the end of 80-es. Among the most interesting writers there must be mentioned Oksana Zabuzhko, Svitlana Kasjanova, Jevhenia Kononenko, Sofia Majdanska, Valentyna Masterova, Halyna Pahutiak, Lubov Ponomarenko, Natalka Śniadanko and others. In the works of these authors, written from the femine and feministic position, as opposite to patriarchal-maskuline mentality, are deeply and convincingly considered the aspects of modern human exsistence: loneliness and alienation, loss of identity, lack of mutual understanding even among fellows and relatives, egoism and egocentism, various forms of physical and phsychological agression, and so on. Espacially great attention author of this article devotes to the analysis of chosen aspects of female identyty in the works of Zabuzhko (Field Exploration in Ukrainian Sex and others), Śniadanko (Collection of Pasions or Adventures ofYoung Ukrainian Lady), Kononenko (Without Fellow).
Źródło:
Acta Polono-Ruthenica; 2008, 1, XIII; 7-18
1427-549X
Pojawia się w:
Acta Polono-Ruthenica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wyszukiwarka Google jako praktyczne narzędzie lingwistyczne do opisu innowacyjnych użyć frazeologizmów
The Google Search Engine as a Practical Linguistic Tool for Describing Innovative Uses of Phraseologisms
Autorzy:
Dziamska-Lenart, Gabriela
Woźniak-Wrzesińska, Ewelina
Powiązania:
https://bibliotekanauki.pl/articles/2135460.pdf
Data publikacji:
2022-09-30
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
phraseology
phraseological innovation
Internet search engine
language corpus
Opis:
The aim of this article is to present the basic capabilities of the Google search engine in the process of analysing multi-word lexical combinations. Our assumption is that the Google search engine can be regarded as a kind of linguistic database ready to be used as a practical linguistic tool. The text is an overview, therefore the presented material is limited to the necessary minimum, i.e. fifty randomly-selected phraseological compounds. In the introduction, we list ( and briefly discuss ) the tools available for studying Polish-language multi-word lexical combinations. With such an outlined background, we may characterise the Google search engine as a linguistic database. Finally, in the relevant part, we present the ways of using this tool with selected examples. In the summary, we discuss the possibilities offered by the use of a constantly-updated linguistic database which the Internet search engine under review can be considered to be.
Źródło:
Poznańskie Studia Polonistyczne. Seria Językoznawcza; 2022, 29, 1; 15-34
1233-8672
2450-4939
Pojawia się w:
Poznańskie Studia Polonistyczne. Seria Językoznawcza
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ł:
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ł:
Wybrane zagadnienia wielokryterialnego planowania sieci WLAN
Selected issues of multi-objective WLAN planning
Autorzy:
Pieprzycki, A.
Ludwin, W.
Powiązania:
https://bibliotekanauki.pl/articles/93106.pdf
Data publikacji:
2018
Wydawca:
Państwowa Wyższa Szkoła Zawodowa w Tarnowie
Tematy:
wielokryterialny algorytm optymalizacji
planowanie
WLAN
optymalizacja nieliniowa
cuckoo search
multi objective swarm optimization
multiobjective cuckoo search
WLAN planning
non–linear optimization
Opis:
Celem artykułu jest zastosowanie wielokryterialnego podejścia do planowania MOO (Multi Objective Optimisation) sieci łączności bezprzewodowej WLAN (Wireless Local Area Network) z wykorzystaniem wybranych rojowych metod optymalizacji. W tym celu, w procesie poszukiwania ekstremów dwóch funkcji kryterialnych, które są wskaźnikiem optymalizacyjnych, zastosowano dwa algorytmy rojowe: kukułki MOCS (Multi Objective Cuckoo Search) oraz optymalizacji rojem cząstek MOPSO (Multi Objective Particle Swarm Optimisation). Wyniki porównano z jednokryterialnym SOO (Single Objective Optimisation) zasięgowym planowaniem sieci bazującym na regularnym rozmieszczeniu punktów testujących TP (test point) z wykorzystaniem rojowego algorytmu kukułki CS (Cuckoo Search).
The aim of the article is to apply a multicriteria approach to MOO (Multi Objective Optimization) planning for WLAN (Wireless Local Area Network) using selected swarm optimization methods. For this purpose, in the process of searching for the extremum of two criterion functions, which are an optimization index, two swarm algorithms were used: MOCS (Multi Objective Cuckoo Search) and MOPSO (Multi Objective Particle Swarm Optimization). The results were compared with the single-criterion SOO (Single Objective Optimization) range-based network planning based on the regular distribution of TP (test point) using the CS Cuckoo Search algorithm.
Źródło:
Science, Technology and Innovation; 2018, 3, 2; 69-78
2544-9125
Pojawia się w:
Science, Technology and Innovation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Koordynacja akcji poszukiwawczych i ratowniczych na Bałtyku
Coordination of SAR operations in the Baltic Sea
Autorzy:
Wolski, A.
Powiązania:
https://bibliotekanauki.pl/articles/197190.pdf
Data publikacji:
2012
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
żegluga morska
akcja ratownicza
akcja poszukiwawcza
Morska Służba Poszukiwania i Ratownictwa
Maritime Search and Rescue Service
search operation
rescure operation
shipping
Opis:
W artykule przedstawiono zasady koordynacji akcji poszukiwawczych i ratowniczych na Bałtyku, wdrożonych przez Morską Służbę Poszukiwania i Ratownictwa. Są one zgodne z konwencjami międzynarodowymi, podpisanymi przez Polskę.
The article presents principles of coordinating search and rescue operations in the Baltic Sea implemented by the Maritime Search and Rescue Service (MSPR). These principles are in compliance with international conventions signed by Poland.
Źródło:
Zeszyty Naukowe. Transport / Politechnika Śląska; 2012, 75; 103-111
0209-3324
2450-1549
Pojawia się w:
Zeszyty Naukowe. Transport / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Econometric Modelling of the Perceptions Students have Regarding the Probability of Finding a Job in the Field of the Master’s Programme
Autorzy:
Mare, Codruta
Popa, Irimie
Dinu, Vasile
Dragos, Cristian
Powiązania:
https://bibliotekanauki.pl/articles/26170535.pdf
Data publikacji:
2013-06-30
Wydawca:
Wydawnictwo Adam Marszałek
Tematy:
Ordered Logit model
job search
perception
master’s students
Opis:
The labour market in any field becomes more and more demanding and specialized, professional. For a more efficient absorption of graduates, the professional environment requires both advanced theoretical knowledge and practical abilities. During the study period, based on rational mechanisms, students form a perception related to the probability of finding an adequate job. In this article we model the constructed perceptions through Ordered Logit models. The application regards 88 students from two Romanian universities. The programme they are involved in is called “The Audit and Financial Management of European Funds”. The results obtained are in accordance with the logical mechanisms evidenced in the theoretical part. The explanatory variables that are statistically significant relate both to the scholarly results and to the student’s status on the labour market. The conclusions drawn are not limited only to the evaluated sample. They are easy to generalize, with necessary changes, to any university specialization.
Źródło:
The New Educational Review; 2013, 32; 35-48
1732-6729
Pojawia się w:
The New Educational Review
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ł:
A Short Introduction to Stochastic Optimization
Autorzy:
Ombach, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/1373633.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
global optimization
stochastic algorithm
random search
convergence of metaheuristics
Opis:
We present some typical algorithms used for finding global minimum/ maximum of a function defined on a compact finite dimensional set, discuss commonly observed procedures for assessing and comparing the algorithms’ performance and quote theoretical results on convergence of a broad class of stochastic algorithms.
Źródło:
Schedae Informaticae; 2014, 23; 9-20
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
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ł:
Numerical analysis of MOB manoeuvres in regard to a body suffering from hypothermia
Autorzy:
Kulbiej, E.
Rosik, R.
Powiązania:
https://bibliotekanauki.pl/articles/135324.pdf
Data publikacji:
2018
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
MOB
search and rescue
maneuver
Williamson turn
hypothermia
survival
Opis:
The following paper’s aim is to provide a numerical analysis of well-known man overboard (MOB) manoeuvres undertaken by vessels’ masters’ in critical situations, when a passenger or crew member falls out from a vessel. The simulation, based on a complex hydrodynamical model of a merchant ship, which compares 3 variants of this manoeuvre, shows that the Scharnov turn is the shortest and the quickest one, but the ship finishes the Anderson turn with the lowest velocity. Also, the time of the Williamson turn is short enough, to successfully finish the operation. The duration of MOB manoeuvres is likened to the results of a medical overview, with not only the duration of MOB, but also the time between falling overboard and the beginning of the manoeuvre playing a crucial role in saving a casualty’s life.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2018, 54 (126); 120-126
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal point to point path planning of flexible manipulator under large deformation by using harmony search method
Autorzy:
Esfandiar, H.
Korayem, M. H.
Powiązania:
https://bibliotekanauki.pl/articles/280605.pdf
Data publikacji:
2016
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
meta-heuristic optimization
harmony search
large deformation
flexible manipulator
Opis:
This paper aims at planning an optimal point to point path for a flexible manipulator under large deformation. For this purpose, the researchers use a direct method and meta-heuristic optimization process. In this paper, the maximum load carried by the manipulator and the minimum transmission time are taken as objective functions of the optimization process to get optimal path profiles. Kinematic constraints, the maximum velocity and acceleration, the dynamic constraint of the maximum torque applied to the arms and also the constraint of final point accuracy are discussed. For the optimization process, the Harmony Search (HS) method is used. To evaluate the effectiveness of the approach proposed, simulation studies are reviewed by considering a two-link flexible manipulator with the fixed base. The findings indicate that the proposed method is in power of dealing with nonlinear dynamics of the system. Furthermore, the results obtained by rigid, small and large deformation models are compared with each other.
Źródło:
Journal of Theoretical and Applied Mechanics; 2016, 54, 1; 179-193
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The potential underwater rescue scenario in incident defined by DiveSMART project
Potencjalny przebieg akcji ratowniczej dla katastrofy zdefiniowanej w projekcie DiveSMART
Autorzy:
Kłos, R.
Powiązania:
https://bibliotekanauki.pl/articles/222056.pdf
Data publikacji:
2017
Wydawca:
Akademia Marynarki Wojennej. Wydział Dowodzenia i Operacji Morskich
Tematy:
SAR
underwater search and rescue
poszukiwania i ratownictwo podwodne
Opis:
This article is one of the series dedicated to the DiveSMART project conducted to better coordination of international underwater rescue operations in the Baltic Sea. The project DiveSMART Baltic has received Flagship status. The article is the second from planned cycle of articles referring tasks realised in the Naval Academy in frame of DiveSMART project. It describes a potential scenario of an action carried out in order to determine which of the existing resources should be applied during underwater search and rescue operations. This subject is connected to the work package two ‘Determine what resources should be in the database’ of the DiveSMART project: Identify different platforms and vessels that the modules could be used on, the adjustment of the transport and rescue modules to these platforms and vessels.
Artykuł należy do serii dotyczącej projektu DiveSMART, który związany jest z zapewnieniem lepszej koordynacji międzynarodowej akcji ratownictwa podwodnego w rejonie Morza Bałtyckiego. Projekt ten otrzymał status „projektu flagowego”. Artykuł jest drugim z planowanego cyklu opisującego realizację zadań przez Akademię Marynarki Wojennej w ramach harmonogramu projektu DiveSMART. Opisano w nim potencjalny przebieg mobilizacji w akcji ratowniczej z wykorzystaniem istniejących zasobów możliwych do wykorzystania w ratownictwie podwodnym. Przeprowadzona gra decyzyjna jest związana z realizacją drugiego pakietu roboczego projektu DiveSMART pt. „Określenie zasobów, które powinny znajdować się w bazie danych”, polegającego na zidentyfikowaniu różnych jednostek pływających, na których możliwy jest transport i wykorzystanie sprzętu ratowniczego.
Źródło:
Zeszyty Naukowe Akademii Marynarki Wojennej; 2017, R. 58 nr 2 (209), 2 (209); 75-96
0860-889X
Pojawia się w:
Zeszyty Naukowe Akademii Marynarki Wojennej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Selected decompression procedures for survivors who became saturated in a sunken wreck
Wybrane procedury dekompresyjne dla rozbitków, którzy zostali poddani saturacji we wraku zatopionej jednostki pływającej
Autorzy:
Kłos, R.
Powiązania:
https://bibliotekanauki.pl/articles/223447.pdf
Data publikacji:
2018
Wydawca:
Akademia Marynarki Wojennej. Wydział Dowodzenia i Operacji Morskich
Tematy:
SAR
underwater search and rescue
poszukiwania i ratownictwo podwodne
Opis:
This article is one of the series dedicated to the DiveSMART Baltic project conducted to better coordination of international underwater rescue operations in the Baltic Sea. The project DiveSMART Baltic has received Flagship status. The article is the forth in the planned cycle of articles referring tasks realised in the Naval Academy in the framework of DiveSMART Baltic project. This article describes selected decompression procedures for victims who became saturated by air at maximum depth to H=30mH2O in the air pockets of the hull of a sunken wreck. This subject is associated with the work package four ‘Medical treatment’ of the DiveSMART Baltic project Identifies methods for different medical treatments in operational areas.
Artykuł należy do serii dotyczącej projektu DiveSMART Baltic który jest związany z zapewnieniem lepszej koordynacji międzynarodowej akcji ratownictwa podwodnego w rejonie Morza Bałtyckiego. Projekt ten otrzymał status „projektu flagowego”. Artykuł jest czwartym z cyklu artykułów opisujących zadania realizowane przez Akademię Mary-narki Wojennej w ramach projektu DiveSMART Baltic. Scharakteryzowane są w nim wybrane procedury dekompresji poszkodowanych, którzy ulegli saturacji powietrznej na maksymalnej głębokości do H=30mH2O w powietrznych pułapkach wewnątrz zatopionego wraku. Tematyka dotyczy realizacji zadania czwartego pt. ‘Medical treatment’ of the DiveSMART project: Identifies methods for different medical treatments in operational areas.
Źródło:
Zeszyty Naukowe Akademii Marynarki Wojennej; 2018, R. 59 nr 2 (213), 2 (213); 17-34
0860-889X
Pojawia się w:
Zeszyty Naukowe Akademii Marynarki Wojennej
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ł:
L’identité hybride d’un exilé à l’exemple de L’oublié d’Élie Wiesel
Hybrid identity of an exile on the example of The Forgotten by Élie Wiesel
Autorzy:
Kamiński, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/483756.pdf
Data publikacji:
2016
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II. Wydawnictwo Werset
Tematy:
Élie Wiesel
exile
search for identity
Jewishness
cultural hybrid
Opis:
The present article discusses a hybrid identity of two main characters from the novel The Forgotten by Élie Wiesel. Having left Europe, Elhanan Rosenbaum settles down in the United States. Even though he adapts to his new surroundings, he perceives himself chiefly as a Jew. When he begins to suffer from an incurable disease that causes him to lose his memory, he compels his son, who was brought up in the USA, to go to Romania. The main goal of this trip is to rescue the memory of the past from oblivion: memory as an indicator of Jewishness. Moreover, thanks to the expedition, Malkiel succeeds to strengthen his own Jewish identity.
Źródło:
Quêtes littéraires; 2016, 6; 128-137
2084-8099
2657-487X
Pojawia się w:
Quêtes littéraires
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Procesowa kontrola danych informatycznych w chmurze obliczeniowej
Autorzy:
Nowikowska, Monika
Powiązania:
https://bibliotekanauki.pl/articles/13948496.pdf
Data publikacji:
2023-02-20
Wydawca:
Akademia Sztuki Wojennej
Tematy:
cloud computing
physical imaging
logical imaging
search
securing evidence
Opis:
The article attempts to analyze the process control of correspondence stored in virtual memory, i.e. in the so-called Cloud Computing. The study is an attempt to answer the question of how mobile devices and clouds are examined and what impact the law on privacy has on the implementation of procedural activities. The growing interest in cloud computing results in the emergence of many new legal problems, which translate into, among others, on the practice and operation of law enforcement agencies. First, the concept of „cloud computing” was discussed and the provisions on obtaining electronic evidence were analyzed. The independence of ICT systems from the functioning of a classic work environment based on a single workstation also allowed us to raise the question of the cross-border nature of services provided in the cloud. IT data transmitted via cloud computing can be saved on several devices located in different countries.
Źródło:
Cybersecurity and Law; 2023, 9, 1; 167-183
2658-1493
Pojawia się w:
Cybersecurity and Law
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zastosowanie algorytmów poszukiwania z tabu do optymalizacji układania planu zajęć
Tabu search algorithms for timetabling optimization
Autorzy:
Witczak, Eliza
Powiązania:
https://bibliotekanauki.pl/articles/41203998.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Kazimierza Wielkiego w Bydgoszczy
Tematy:
tabu serach
generowanie rozkładu zajęć
tabu search
time-table
Opis:
TS jest mataheurystyką szukającą rozwiązania problemu poprzez nadzorowanie innych procedur heurystycznych lokalnego przeszukiwania, w celu eksploracji przestrzeni rozwiązań poza lokalne optimum. Proces przeszukiwania przestrzeni rozwiązań jest koordynowany za pomocą strategii opartych na mechanizmach pamięci, będących cechą charakterystyczną algorytmu TS. Niniejszy artykuł opisuje zastosowanie metody TS w procesie optymalizacji rozkładu zajęć.
Tabu Search is a metaheuristic that guides a local heuristic search procedures to explore the solution space beyond local optimum. The process of searching the solutions space is coordinated by strategies based on the memory mechanisms, which are characters of the TS algorithm. This paper describes the method of TS in the timetable optimization process
Źródło:
Studia i Materiały Informatyki Stosowanej; 2010, 2; 59-66
1689-6300
Pojawia się w:
Studia i Materiały Informatyki Stosowanej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Methods for treatment of decompression sickness developed during wreck penetration
Metody leczenia choroby dekompresyjnej zaistniałej podczas penetracji wraku
Autorzy:
Kłos, R.
Powiązania:
https://bibliotekanauki.pl/articles/222935.pdf
Data publikacji:
2018
Wydawca:
Akademia Marynarki Wojennej. Wydział Dowodzenia i Operacji Morskich
Tematy:
SAR
underwater search and rescue
poszukiwania i ratownictwo podwodne
Opis:
This article is one of the series articles relating to the DiveSmart project conducted to improve coordination procedures used in international underwater rescue operations in the Baltic Sea. The project DiveSmart Baltic has received the ‘flagship status. The article is the third in the planned cycle of articles relating to efforts made at the Naval Academy within the framework of DiveSmart Baltic project. It includes scenarios of treating decompression sickness acquired by divers during a rescue operation or after completed their decompression. These issues are connected with the work package four Medical treatment’ of the DiveSmart Baltic project: Identifies methods for different medical treatments in operational areas.
Artykuł należy do serii dotyczącej projektu DiveSmart, który jest związany z zapewnieniem lepszej koordynacji międzynarodowej akcji ratownictwa podwodnego w rejonie Morza Bałtyckiego. Projekt ten otrzymał status „projektu flagowego”. Artykuł jest trzecim z cyklu artykułów opisujących zadania realizowane przez Akademię Marynarki Wojennej w ramach projektu DiveSmart Baltic Zawiera opis scenariuszy leczenia potencjalnych przypadków choroby dekompresyjnej zaistniałej u nurków podczas akcji ratowniczej lub po dekompresji. Tematyka ta dotyczy realizacji zadania czwartego ‘Medical treatment’ of the DiveSmart Baltic project: Identifies methods for different medical treatments in operational areas.
Źródło:
Zeszyty Naukowe Akademii Marynarki Wojennej; 2018, R. 59 nr 1 (212), 1 (212); 27-53
0860-889X
Pojawia się w:
Zeszyty Naukowe Akademii Marynarki Wojennej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving a large heterogeneous-agent general equilibrium model with labour market frictions
Autorzy:
Antosiewicz, M.
Powiązania:
https://bibliotekanauki.pl/articles/205786.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
heterogeneous–agent model
search and matching
DSGE
computational metod
Opis:
In this paper we build and solve a heterogeneous-agent dynamic stochastic general equilibrium (DSGE) model with incomplete markets in the spirit of Krussel and Smith (1998). We expand this model to account for search and matching labour market frictions, using the classic Mortensen and Pissarides (1994) framework. The model, therefore, combines two important strands of economic modelling and presents a numerical challenge in terms of solving the model due to the inclusion of additional dimensions in the optimization problem. Despite the addition of additional state variables and higher dimensionality, we show that we are able to efficiently solve it numerically using value function iteration and we document basic properties of the model.
Źródło:
Control and Cybernetics; 2016, 45, 4; 513-523
0324-8569
Pojawia się w:
Control and Cybernetics
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ł:
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ł:
Cryptographically Strong Elliptic Curves of Prime Order
Autorzy:
Barański, Marcin
Gliwa, Rafał
Szmidt, Janusz
Powiązania:
https://bibliotekanauki.pl/articles/1844627.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Mersenne primes
elliptic curves
security requirements
search algorithm
Magma
Opis:
The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields Fp, where p is a Mersenne prime, one of the special primes or a random prime. We search for elliptic curves which orders are also prime numbers. The cryptographically strong elliptic curves are those for which the discrete logarithm problem is computationally hard. The required mathematical conditions are formulated in terms of parameters characterizing the elliptic curves. We present an algorithm to generate such curves. Examples of elliptic curves of prime order are generated with Magma.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 2; 207-212
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Néologie et traduction ou comment faire traverser la route à un écureuil
Neology and Translation, or How to Shepherd a Squirrel Across the Street
Neologia i tłumaczenia, czyli jak przeprowadzić wiewiórkę przez drogę
Autorzy:
Durieux, Christine
Powiązania:
https://bibliotekanauki.pl/articles/1878673.pdf
Data publikacji:
2016
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II. Towarzystwo Naukowe KUL
Tematy:
tłumaczenie
neologizmy
wyszukiwanie dokumentacji
translation
neologisms
search of documentation
Opis:
Dans cet article, la néologie est considérée dans son rapport à la traduction. Le propos vise à mettre en évidence une méthodologie de nature à permettre de vaincre la résistance à la traduction qu’opposent les néologismes. À cet effet, le développement d’un exemple concret (français/anglais) montre le recours nécessaire à la recherche documentaire pour aboutir à une solution satisfaisante. Cette démarche, qui s’attache à s’en tenir à l’usage, se trouve confirmée par le fait que l’intégration de néologismes dans le vocabulaire est subordonnée à l’acceptation de ceux qui sont amenés à les utiliser.
In this paper, neology is considered in its relationship with translation. The purpose of this paper is to outline an appropriate methodology to manage the translation of neologisms and overcome the difficulty they present. The theme is illustrated by a concrete example (French/English) showing the relevance of document analysis to reach a satisfactory solution. The steps taken within the working method are focused on the use of new terms in context by specialists of the subject area, insofar as neologisms are integrated in language only when they are accepted by the community who is supposed to use them.
Artykuł dotyczy problemu neologii w odniesieniu do tłumaczeń. Celem analizy jest ukazanie metodologii tak, aby przełamać opór, jaki stawiają tłumaczeniom neologizmy. Szczegółowe omówienie konkretnego przykładu (francuski/angielski) ukazuje konieczność odwoływania się do poszukiwań odpowiednich dokumentów, aby znaleźć właściwe rozwiązanie. Tę metodę, która wskazuje na potrzebę uwzględniania użycia terminów, potwierdza fakt, że integrowanie neologizmów do słownictwa wymaga akceptacji tych, którzy mają ich używać.
Źródło:
Roczniki Humanistyczne; 2016, 64, 8; 27-39
0035-7707
Pojawia się w:
Roczniki Humanistyczne
Dostawca treści:
Biblioteka Nauki
Artykuł

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