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ę "Niewiadomska-Szynkiewicz, E." wg kryterium: Wszystkie pola


Wyświetlanie 1-6 z 6
Tytuł:
A Software Platform for Global Optimization
Autorzy:
Niewiadomska-Szynkiewicz, E.
Marks, M.
Powiązania:
https://bibliotekanauki.pl/articles/308471.pdf
Data publikacji:
2010
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
global optimization
integrated software systems
nonconvex optimization
numerical libraries
price management
Opis:
This paper addresses issues associated with the global optimization algorithms, which are methods to find optimal solutions for given problems. It focuses on an integrated software environment - global optimization object-oriented library (GOOL), which provides the graphical user interface together with the library of solvers for convex and nonconvex, unconstrained and constrained problems. We describe the design, performance and possible applications of the GOOL system. The practical example - price management problem - is provided to illustrate the effectiveness and range of applications of our software tool.
Źródło:
Journal of Telecommunications and Information Technology; 2010, 3; 49-56
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multiobjective Approach to Localization in Wireless Sensor Networks
Autorzy:
Marks, M.
Niewiadomska-Szynkiewicz, E.
Powiązania:
https://bibliotekanauki.pl/articles/309060.pdf
Data publikacji:
2009
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
ad hoc networks
localization
simulated annealing
stochastic optimization
wireless sensor network
Opis:
Wireless sensor network localization is a complex problem that can be solved using different types of methods and algorithms. Nowadays, it is a popular research topic. What becomes obvious is that there are several criteria which are essential when we consider wireless sensor networks. Our objective is to determine accurate estimates of nodes location under the constraints for hardware cost, energy consumption and computation capabilities. In this paper the application of stochastic optimization for performing localization of nodes is discussed. We describe two phase scheme that uses a combination of the trilateration method, along with the simulated annealing optimization algorithm. We investigate two variants of our technique, i.e., centralized and distributed. The attention is paid to the convergence of our algorithm for different network topologies and trade-off between its efficiency and localization accuracy.
Źródło:
Journal of Telecommunications and Information Technology; 2009, 3; 59-67
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization schemes for wireless sensor network localization
Autorzy:
Niewiadomska-Szynkiewicz, E.
Marks, M.
Powiązania:
https://bibliotekanauki.pl/articles/907665.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sieć bezprzewodowa
sieć sensorowa
lokalizacja
optymalizacja stochastyczna
wyżarzanie symulowane
wireless sensor networks
localization
stochastic optimization
simulated annealing
Opis:
Many applications of wireless sensor networks (WSN) require information about the geographical location of each sensor node. Self-organization and localization capabilities are one of the most important requirements in sensor networks. This paper provides an overview of centralized distance-based algorithms for estimating the positions of nodes in a sensor network. We discuss and compare three approaches: semidefinite programming, simulated annealing and two-phase stochastic optimization-a hybrid scheme that we have proposed. We analyze the properties of all listed methods and report the results of numerical tests. Particular attention is paid to our technique-the two-phase method-that uses a combination of trilateration, and stochastic optimization for performing sensor localization. We describe its performance in the case of centralized and distributed implementations.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 2; 291-302
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Localization in Wireless Sensor Networks Using Heuristic Optimization Techniques
Autorzy:
Niewiadomska-Szynkiewicz, E.
Marks, M.
Kamola, M.
Powiązania:
https://bibliotekanauki.pl/articles/308429.pdf
Data publikacji:
2011
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
evolutionary strategy
genetic algorithm
localization
location systems
nonconvex optimization
simulated annealing
wireless sensor network
Opis:
Many applications of wireless sensor networks (WSN) require information about the geographic location of each sensor node. Devices that form WSN are expected to be remotely deployed in large numbers in a sensing field, and to self-organize to perform sensing and acting task. The goal of localization is to assign geographic coordinates to each device with unknown position in the deployment area. Recently, the popular strategy is to apply optimization algorithms to solve the localization problem. In this paper, we address issues associated with the application of heuristic techniques to accurate localization of nodes in a WSN system. We survey and discuss the location systems based on simulated annealing, genetic algorithms and evolutionary strategies. Finally, we describe and evaluate our methods that combine trilateration and heuristic optimization.
Źródło:
Journal of Telecommunications and Information Technology; 2011, 4; 55-64
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Hybrid CPU/GPU Cluster for Encryption and Decryption of Large Amounts of Data
Autorzy:
Niewiadomska-Szynkiewicz, E.
Marks, M.
Jantura, J.
Podbielski, M.
Powiązania:
https://bibliotekanauki.pl/articles/309363.pdf
Data publikacji:
2012
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
AES
computer clusters
cryptography
DES
GPU computing
parallel calculation
software systems
Opis:
The main advantage of a distributed computing system over standalone computer is an ability to share the workload between cores, processors and computers. In our paper we present a hybrid cluster system - a novel computing architecture with multi-core CPUs working together with many-core GPUs. It integrates two types of CPU, i.e., Intel and AMD processor with advanced graphics processing units, adequately, Nvidia Tesla and AMD FirePro (formerly ATI). Our CPU/GPU cluster is dedicated to perform massive parallel computations which is a common approach in cryptanalysis and cryptography. The efficiency of parallel implementations of selected data encryption and decryption algorithms are presented to illustrate the performance of our system.
Źródło:
Journal of Telecommunications and Information Technology; 2012, 3; 32-39
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heterogeneous GPU&CPU cluster for High Performance Computing in cryptography
Autorzy:
Marks, M.
Jantura, J.
Niewiadomska-Szynkiewicz, E.
Strzelczyk, P.
Góźdź, K.
Powiązania:
https://bibliotekanauki.pl/articles/305288.pdf
Data publikacji:
2012
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
parallel computing
HPC
clusters
GPU computing
OpenCL
cryptography
cryptanalysis
Opis:
This paper addresses issues associated with distributed computing systems and the application of mixed GPU&CPU technology to data encryption and decryption algorithms. We describe a heterogenous cluster HGCC formed by two types of nodes: Intel processor with NVIDIA graphics processing unit and AMD processor with AMD graphics processing unit (formerly ATI), and a novel software framework that hides the heterogeneity of our cluster and provides tools for solving complex scientific and engineering problems. Finally, we present the results of numerical experiments. The considered case study is concerned with parallel implementations of selected cryptanalysis algorithms. The main goal of the paper is to show the wide applicability of the GPU&CPU technology to large scale computation and data processing.
Źródło:
Computer Science; 2012, 13 (2); 63-79
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-6 z 6

    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