Informacja

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

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

Wyszukujesz frazę "search" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 49
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
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ł:
Two heuristic alghorithms for test point selection in analog circuit diagnoses
Autorzy:
Pułka, A.
Powiązania:
https://bibliotekanauki.pl/articles/221005.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
analog circuit diagnosis
fault diagnosis
testing
search methods
heuristic optimization
Opis:
The paper presents a heuristic approach to the problem of analog circuit diagnosis. Different optimization techniques in the field of test point selection are discussed. Two new algorithms: SALTO and COSMO have been introduced. Both searching procedures have been implemented in a form of the expert system in PROLOG language. The proposed methodologies have been exemplified on benchmark circuits. The obtained results have been compared to the others achieved by different approaches in the field and the benefits of the proposed methodology have been emphasized. The inference engine of the heuristic algorithms has been presented and the expert system knowledge-base construction discussed.
Źródło:
Metrology and Measurement Systems; 2011, 18, 1; 115-128
0860-8229
Pojawia się w:
Metrology and Measurement Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 49

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