Informacja

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

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

Wyszukujesz frazę "search" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 83
Tytuł:
Task conditions and short-term memory search: two-phase model of STM search
Autorzy:
Orzechowski, Jarosław
Nęcka, Edward
Balas, Robert
Powiązania:
https://bibliotekanauki.pl/articles/430621.pdf
Data publikacji:
2016-04-01
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
short-term memory
STM retrieval
STM search
Sternberg paradigm
familiarity
recollection
Opis:
Short-term memory (STM) search, as investigated within the Sternberg paradigm, is usually described as exhaustive rather than self-terminated, although the debate concerning these issues is still hot. We report three experiments employing a modified Sternberg paradigm and show that whether STM search is exhaustive or self-terminated depends on task conditions. Specifically, STM search self-terminates as soon as a positive match is found, whereas exhaustive search occurs when the STM content does not contain a searched item. Additionally, we show that task conditions influence whether familiarity- or recollection-based strategies dominate STM search performance. Namely, when speeding up the tempo of stimuli presentation increases the task demands, people use familiarity-based retrieval more often, which results in faster but less accurate recognition judgments. We conclude that STM search processes flexibly adapt to current task conditions and finally propose two-phase model of STM search.
Źródło:
Polish Psychological Bulletin; 2016, 47, 1; 12-20
0079-2993
Pojawia się w:
Polish Psychological Bulletin
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu Search Against Permutation Based Stream Ciphers
Autorzy:
Polak, I.
Boryczka, M.
Powiązania:
https://bibliotekanauki.pl/articles/227111.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
tabu search
TS
cryptanalysis
RC4
VMPC
stream cipher
state recovery attack
Opis:
Encryption is one of the most effective methods of securing data confidentiality, whether stored on hard drives or transferred (e.g. by e-mail or phone call). In this paper a new state recovery attack with tabu search is introduced. Based on research and theoretical approximation it is shown that the internal state can be recovered after checking 2⁵² internal states for RC4 and 2¹⁸⁰ for VMPC.
Źródło:
International Journal of Electronics and Telecommunications; 2018, 64, 2; 137-145
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Grid Search of Convolutional Neural Network model in the case of load forecasting
Autorzy:
Tran, Thanh Ngoc
Powiązania:
https://bibliotekanauki.pl/articles/1841362.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
load forecasting
grid search
convolutional neural network
Opis:
The Convolutional Neural Network (CNN) model is one of the most effective models for load forecasting with hyperparameters which can be used not only to determine the CNN structure and but also to train the CNN model. This paper proposes a frame work for Grid Search hyperparameters of the CNN model. In a training process, the optimalmodels will specify conditions that satisfy requirement for minimum of accuracy scoresof Root Mean Square Error (RMSE), Mean Absolute Percentage Error (MAPE) and Mean Absolute Error (MAE). In the testing process, these optimal models will be used to evaluate the results along with all other ones. The results indicated that the optimal models have accuracy scores near the minimum values. Load demand data of Queensland (Australia) and Ho Chi Minh City (Vietnam) were utilized to verify the accuracy and reliability of the Grid Search framework.
Źródło:
Archives of Electrical Engineering; 2021, 70, 1; 25-36
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows
Autorzy:
Gładysz, J.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/226174.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
anycast
network design
tabu search
survivability
Opis:
In this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.
Źródło:
International Journal of Electronics and Telecommunications; 2010, 56, 1; 41-47
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
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ł:
In search of ‘our roots’
Autorzy:
Wrona, Grażyna
Powiązania:
https://bibliotekanauki.pl/articles/421817.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
review
recenzja
Opis:
Review article of monograph: A. Kansy, Płocka prasa regionalistyczna w latach 1989–2014, Towarzystwo Naukowe Płockie,Płock 2015, 177 s.
Źródło:
Rocznik Historii Prasy Polskiej; 2016, 19, 1
1509-1074
Pojawia się w:
Rocznik Historii Prasy Polskiej
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ł:
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ł:
Finding Differential Paths in ARX Ciphers through Nested Monte-Carlo Search
Autorzy:
Dwivedi, A. D.
Morawiecki, P.
Wójtowicz, S.
Powiązania:
https://bibliotekanauki.pl/articles/226721.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
ARX ciphers
SPECK Cipher
Nested Monte-Carlo Search
differential cryptanalysis
Opis:
We propose the adaptation of Nested Monte-Carlo Search algorithm for finding differential trails in the class of ARX ciphers. The practical application of the algorithm is demonstrated on round-reduced variants of block ciphers from the SPECK family. More specifically, we report the best differential trails, up to 9 rounds, for SPECK32.
Źródło:
International Journal of Electronics and Telecommunications; 2018, 64, 2; 147-150
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reliability of search and rescue action
Niezawodność akcji poszukiwania i ratowania życia na morzu
Autorzy:
Barciu, Z.
Powiązania:
https://bibliotekanauki.pl/articles/224229.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
ratownictwo morskie
akcje ratownicze
jednostki ratownicze
niezawodność
reliability
SAR (Search and Rescue)
Opis:
Determination of the reliability of Search and Rescue action system allows the SAR Mission Coordinator to increase the effectiveness of the action through the proper selection of operational characteristics of the system elements, in particular the selection of the rescue units and auxiliary units. The paper presents the example of the influence of water temperature and time of the action on the reliability of search and rescue action in the case of rescuing a survivor in the water.
Wyznaczenie niezawodności systemu akcji poszukiwania i ratowania życia na morzu umożliwia koordynatorowi zwiększenie efektywności akcji ratowniczej poprzez właściwy dobór charakterystyk eksploatacyjnych elementów systemu, w szczególności dobór jednostek ratowniczych i jednostek pomocniczych. W artykule przedstawiono przykład wpływu temperatury wody i czasu trwania akcji ratowniczej na niezawodność systemu akcji ratowniczej w przypadku ratowania rozbitka znajdującego się w wodzie.
Źródło:
Archives of Transport; 2012, 24, 2; 141-147
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hybrid Mesh Adaptive Direct Search and Genetic Algorithms Techniques for industrial production systems
Autorzy:
Vasant, P.
Powiązania:
https://bibliotekanauki.pl/articles/229988.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
mesh adaptive direct search
genetic algorithms
fitness function
degree of possibility
level of satisfaction
Opis:
In this paper, computational and simulation results are presented for the performance of the fitness function, decision variables and CPU time of the proposed hybridization method of Mesh Adaptive Direct Search (MADS) and Genetic Algorithm (GA). MADS is a class of direct search of algorithms for nonlinear optimization. The MADS algorithm is a modification of the Pattern Search (PS) algorithm. The algorithms differ in how the set of points forming the mesh is computed. The PS algorithm uses fixed direction vectors, whereas the MADS algorithm uses random selection of vectors to define the mesh. A key advantage of MADS over PS is that local exploration of the space of variables is not restricted to a finite number of directions (poll directions). This is the primary drawback of PS algorithms, and therefore the main motivation in using MADS to solve the industrial production planning problem is to overcome this restriction. A thorough investigation on hybrid MADS and GA is performed for the quality of the best fitness function, decision variables and computational CPU time.
Źródło:
Archives of Control Sciences; 2011, 21, 3; 299-312
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Internetowe pośrednictwo pracy i zbiorowość jego użytkowników w Polsce
Internet Job Search and its User Community in Poland
Autorzy:
Strzelczak, J.
Powiązania:
https://bibliotekanauki.pl/articles/2137826.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Internet
job search
job matching
poszukiwanie pracy
pośrednictwo pracy
Opis:
This paper presents recently developed internet-based job search methods, grouped together under the term 'internet-based job matching', as well as their user community in Poland. The first part of the article introduces the most important web-based techniques and tools currently used in job search, along with their main typical advantages and drawbacks. Thereafter, the user community of the internet-based job matching in Poland is examined and described, considering aspects such as: education and skills, ICT competences, material conditions, social capital resources and subjective assessment of personal work situation. Statistical analysis of the chosen variables is used to verify two hypotheses derived from studies carried out in the United States. Data used in the empirical part of this paper was gathered for Social Diagnosis 2005, a large-scale research project on objective and subjective quality of life in Poland.
Przedmiotem artykułu są nowe metody poszukiwania zatrudnienia bazujące na wykorzystaniu Internetu, zebrane pod wspólnym określeniem „internetowe pośrednictwo pracy”, oraz zbiorowość ich użytkowników w Polsce. W pierwszej części opracowania zaprezentowano najważniejsze dostępne obecnie metody poszukiwania zatrudnienia przy użyciu sieci WWW oraz specyficzne dla nich wady i zalety. Następnie scharakteryzowano zbiorowość polskich użytkowników internetowego pośrednictwa pracy. Uwzględniono przy tym aspekty takie jak: wykształcenie i umiejętności cywilizacyjne, kompetencje w korzystaniu z komputera i Internetu, położenie materialne, zasoby kapitału społecznego oraz subiektywna ocena własnej sytuacji zawodowej. Analiza wybranych zmiennych posłużyła weryfikacji dwu hipotez postawionych na podstawie wyników badań przeprowadzonych w Stanach Zjednoczonych. Podstawę części badawczej stanowią dane zebrane podczas Diagnozy Społecznej 2005.
Źródło:
Studia Socjologiczne; 2007, 3(186); 59-83
0039-3371
Pojawia się w:
Studia Socjologiczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cluster Based Optimization of Routing in Distributed Sensor Networks Using Bayesian Networks with Tabu Search
Autorzy:
Bhajantri, L. B.
Nalini, N.
Powiązania:
https://bibliotekanauki.pl/articles/226310.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Distributed Sensor Networks
routing
cluster head
Bayesian Network
tabu search
Opis:
Distributed Sensor Networks (DSNs) have attracted significant attention over the past few years. A growing list of many applications can employ DSNs for increased effectiveness especially in hostile and remote are as. In all application salargen umber of sensors are expected and requiring careful architecture and management of the net work. Grouping nodes in toclusters has been the most popular approach for support scalability in DSN. This paper proposes acluster based optimization of routing in DSN by employing a Bayesi an network (BN) with Tabu search (TS) approach. BN based approach is used to select efficient cluster head sand construction of BN for the proposed scheme. This approach in corporates energy level of each node, band width and link efficiency. The optimization of routing is considered as a design issue in DSN due to lack of energy consumption, delay and maximum time required for data transmission between source nodes (cluster heads) to sink node. In this work optimization of routing takes place through cluster head nodes by using TS. Simulations have been conducted to compare the performance of the proposed approach with LEACH protocol. The objective of the proposed work is to improve the performance of network in terms of energy consumption, through put, packet delivery ratio, and time efficiency of optimization of routing. The results hows that the proposed approach perform better than LEACH protocol that utilizes minimum energy, latency for cluster formation and reduce over head of the protocol.
Źródło:
International Journal of Electronics and Telecommunications; 2014, 60, 2; 199-208
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic semantic description and search methods for heterogeneous learning resources
Autorzy:
Lai, Xiaocong
Pan, Ying
Jiang, Xueling
Powiązania:
https://bibliotekanauki.pl/articles/2173685.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
heterogeneous data
learning resources
semantic description
semantic search
dane niejednorodne
zasoby edukacyjne
opis semantyczny
wyszukiwanie semantyczne
Opis:
Learning resources are massive, heterogeneous, and constantly changing. How to find the required resources quickly and accurately has become a very challenging work in the management and sharing of learning resources. According to the characteristics of learning resources, this paper proposes a progressive learning resource description model, which can describe dynamic heterogeneous resource information on a fine-grained level by using information extraction technology, then a semantic annotation algorithm is defined to calculate the semantic of learning resource and add these semantic to the description model. Moreover, a semantic search method is proposed to find the required resources, which calculate the content with the highest similarity to the user query, and then return the results in descending order of similarity. The simulation results show that the method is feasible and effective.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 3; art. no. e139434
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reduced-cost design closure of antennas by means of gradient search with restricted sensitivity update
Autorzy:
Kozieł, Sławomir
Pietrenko-Dąbrowska, Anna
Powiązania:
https://bibliotekanauki.pl/articles/221401.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
antenna design
design closure
EM-driven optimization
gradient search
sensitivity update
Opis:
Design closure, i.e., adjustment of geometry parameters to boost the performance, is a challenging stage of antenna design process. Given complexity of contemporary structures, reliable parameter tuning requires numerical optimization and can be executed using local algorithms. Yet, EM-driven optimization is a computationally expensive endeavour and reducing its cost is highly desirable. In this paper, a modification of the trust-region gradient search algorithm is proposed for accelerated optimization of antenna structures. The algorithm is based on sparse updates of antenna sensitivities involving various methods that include the Broyden formula used for selected parameters, as well as dimensionality- and convergence-dependent acceptance thresholds which enable additional speedup, and make the procedure easy to tune for various numbers of antenna parameters. Comprehensive verification executed for a set of benchmark antennas delivers consistent results and considerable cost reduction of up to 60 percent with respect to the reference algorithm. Experimental validation is also provided.
Źródło:
Metrology and Measurement Systems; 2019, 26, 4; 595-605
0860-8229
Pojawia się w:
Metrology and Measurement Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 83

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