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ę "efficient" wg kryterium: Wszystkie pola


Wyświetlanie 1-13 z 13
Tytuł:
Efficient learning variable impedance control for industrial robots
Autorzy:
Li, C.
Zhang, Z.
Xia, G.
Xie, X.
Zhu, Q.
Powiązania:
https://bibliotekanauki.pl/articles/200716.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
variable impedance control
reinforcement learning
efficient
Gaussian process
industrial robots
impedancja
poprawa efektywności
wydajność
model Gaussa
roboty przemysłowe
Opis:
Compared with the robots, humans can learn to perform various contact tasks in unstructured environments by modulating arm impedance characteristics. In this article, we consider endowing this compliant ability to the industrial robots to effectively learn to perform repetitive force-sensitive tasks. Current learning impedance control methods usually suffer from inefficiency. This paper establishes an efficient variable impedance control method. To improve the learning efficiency, we employ the probabilistic Gaussian process model as the transition dynamics of the system for internal simulation, permitting long-term inference and planning in a Bayesian manner. Then, the optimal impedance regulation strategy is searched using a model-based reinforcement learning algorithm. The effectiveness and efficiency of the proposed method are verified through force control tasks using a 6-DoFs Reinovo industrial manipulator.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2019, 67, 2; 201-212
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient rendering of caustics with streamed photon mapping
Autorzy:
Guzek, K.
Napieralski, P.
Powiązania:
https://bibliotekanauki.pl/articles/200625.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
rendering
global illumination
photon mapping
caustics
wykonanie
globalne oświetlenie
mapowanie fotonów
kaustyki
Opis:
In this paper, we present the streamed photon mapping method for enhancing the rendering of caustics. In order to achieve a realistic caustic effect, global illumination methods require additional data, which are gathered by creating a caustic map or increasing the number of samples used for rendering. Our method employs a stream of photons with a varying luminance level depending on the material properties of the surface. The application of a concentrated photon stream provides the ability to render caustics effectively without increasing the number of photons in a photon map. Such an approach increases visibility of results, while also allowing for faster computations.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 3; 361-368
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient alternatives to PSI-BLAST
Autorzy:
Startek, M.
Lasota, S.
Sykulski, M.
Bułak, A.
Noé, L.
Kucherov, G.
Gambin, A.
Powiązania:
https://bibliotekanauki.pl/articles/201603.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
PSI BLAST tool
sequence alignment
seeding technique
Opis:
In this paper we present two algorithms that may serve as efficient alternatives to the well-known PSI BLAST tool: SeedBLAST and CTX-PSI Blast. Both may benefit from the knowledge about amino acid composition specific to a given protein family: SeedBLAST uses the advisedly designed seed, while CTX-PSI BLAST extends PSI BLAST with the context-specific substitution model. The seeding technique became central in the theory of sequence alignment. There are several efficient tools applying seeds to DNA homology search, but not to protein homology search. In this paper we fill this gap. We advocate the use of multiple subset seeds derived from a hierarchical tree of amino acid residues. Our method computes, by an evolutionary algorithm, seeds that are specifically designed for a given protein family. The seeds are represented by deterministic finite automata (DFAs) and built into the NCBI-BLAST software. This extended tool, named SeedBLAST, is compared to the original BLAST and PSI-BLAST on several protein families. Our results demonstrate a superiority of SeedBLAST in terms of efficiency, especially in the case of twilight zone hits. The contextual substitution model has been proven to increase sensitivity of protein alignment. In this paper we perform a next step in the contextual alignment program. We announce a contextual version of the PSI-BLAST algorithm, an iterative version of the NCBI-BLAST tool. The experimental evaluation has been performed demonstrating a significantly higher sensitivity compared to the ordinary PSI-BLAST algorithm.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 3; 495-505
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Speeding-up convolutional neural networks: A survey
Autorzy:
Lebedev, V.
Lempitsky, V.
Powiązania:
https://bibliotekanauki.pl/articles/201708.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
convolutional neural networks
resource-efficient computation
algorithm optimization
splotowe sieci neuronowe
efektywne zasoby obliczeniowe
optymalizacja algorytmu
Opis:
Convolutional neural networks (CNN) have become ubiquitous in computer vision as well as several other domains, but the sheer size of the modern CNNs means that for the majority of practical applications, a significant speed up and compression are often required. Speeding-up CNNs therefore have become a very active area of research with multiple diverse research directions pursued by many groups in academia and industry. In this short survey, we cover several research directions for speeding up CNNs that have become popular recently. Specifically, we cover approaches based on tensor decompositions, weight quantization, weight pruning, and teacher-student approaches. We also review CNN architectures designed for optimal speed and briefly consider automatic architecture search.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 6; 799-811
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
G-DNA – a highly efficient multi-GPU/MPI tool for aligning nucleotide reads
Autorzy:
Frohmberg, W.
Kierzynka, M.
Blazewicz, J.
Gawron, P.
Wojciechowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/200827.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
DNA assembly preprocessing
sequence alignment
GPU computing
Opis:
DNA/RNA sequencing has recently become a primary way researchers generate biological data for further analysis. Assembling algorithms are an integral part of this process. However, some of them require pairwise alignment to be applied to a great deal of reads. Although several efficient alignment tools have been released over the past few years, including those taking advantage of GPUs (Graphics Processing Units), none of them directly targets high-throughput sequencing data. As a result, a need arose to create software that could handle such data as effectively as possible. G-DNA (GPU-based DNA aligner) is the first highly parallel solution that has been optimized to process nucleotide reads (DNA/RNA) from modern sequencing machines. Results show that the software reaches up to 89 GCUPS (Giga Cell Updates Per Second) on a single GPU and as a result it is the fastest tool in its class. Moreover, it scales up well on multiple GPUs systems, including MPI-based computational clusters, where its performance is counted in TCUPS (Tera CUPS).
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2013, 61, 4; 989-992
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The optimization of the TMDI for efficient mitigation of the vibration
Autorzy:
Mnich, Konrad
Perlikowski, Przemysław
Powiązania:
https://bibliotekanauki.pl/articles/27311383.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
tuned mass damper
inerter
optimization
mitigation of vibrations
falownik
optymalizacja
łagodzenie wibracji
tłumik masowy strojony
Opis:
The paper concerns the optimization of a tuned mass damper with inerter (TMDI) based on two strategies, i.e., the minimum amplitude in the resonance peak and minimum area under the frequency response curve. The optimization is based on real, accessible parameters. Both optimization procedures are presented in two steps. In the first one, two parameters of the TMDI are tuned (inertance and damping coefficient), while in the second one, three parameters (mass, inertance, and damping coefficient). We show that both strategies give the optimum sets of parameters and allow the reduction of the amplitude of the damped system.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 3; art. no. e144619
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Computationally efficient method for determining the most important electrical parameters of axial field permanent magnet machine
Autorzy:
Smoleń, A.
Gołębiowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/202137.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
axial flux permanent magnet
2D FEA
numerical optimization
magnes stały
optymalizacja numeryczna
Opis:
This paper describes a numerically efficient method for determining the electrical parameters of axial field permanent magnet machine (AFPM). The presented method aims to accurately determine the back EMF waveform and self-inductance coefficients, while maintaining possibly low computational complexity, which is crucial in case of incorporation of the method in numerical optimization procedure of AFPM construction. The described algorithm is based on 2D FEM with several simplifications. The obtained results have been compared with full 3D FEA conducted with Ansys/Maxwell software, and confirmed by measurements. The result shows that presented method ensures satisfactory accuracy as well as computational time performance.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 6; 947-959
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
G-PAS 2.0 - an improved version of protein alignment tool with an efficient backtracking routine on multiple GPUs
Autorzy:
Frohmberg, W.
Kierzynka, M.
Blazewicz, J.
Wojciechowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/201593.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
pairwise alignment
GPU computing
alignment with backtracking procedure
Opis:
Several highly efficient alignment tools have been released over the past few years, including those taking advantage of GPUs (Graphics Processing Units). G-PAS (GPU-based Pairwise Alignment Software) was one of them, however, with a couple of interesting features that made it unique. Nevertheless, in order to adapt it to a new computational architecture some changes had to be introduced. In this paper we present G-PAS 2.0 - a new version of the software for performing high-throughput alignment. Results show, that the new version is faster nearly by a fourth on the same hardware, reaching over 20 GCUPS (Giga Cell Updates Per Second).
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 3; 491-494
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The use of multi-criteria optimization to choose solutions for energy-efficient buildings
Autorzy:
Basińska, M.
Powiązania:
https://bibliotekanauki.pl/articles/201781.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
global cost methodology
low energy buildings
European Union Directive
multicriteria optimization
metodologia
globalny koszt
budynek o niskim zużyciu energii
Dyrektywa Unii Europejskiej
optymalizacja wielokryterialna
Opis:
The goal of this paper was to optimize the building envelope and technical equipment in the building through the mitigation of the global cost value, and then to evaluate the influence of the chosen assumptions on the primary energy index. The analyses carried out using global cost method allow for finding the cost optimal solution but only for the some range of primary energy index variability. In order to find the optimal solutions it was proposed to use the multi-criteria optimisation, assuming the following as basic criteria: a global cost value and investment prices increase (economic criteria), a primary energy index (energy-related criterion), an emission of carbon dioxide (environmental criterion). The analysed case study refers to the technical solutions for the residential buildings with the usable energy demand at the level of 40 and 15 kWh/m2/a. The presented method might be applied to different types of buildings: those being designed and those being the subject of the thermo-modernisation. The results demonstrate that the proposed model allows for classification of the alternative technical solutions regarding the designing process and the building’s technical equipment. The carried out analyses indicate the economic possibility to achieve the low energy building standard and show the need to concentrate the activities related to the installation technology and used energy source.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 6; 815-826
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient algorithm for determining positions of astronomical objects in the Deep Sky Object pictures
Autorzy:
Suszynski, R.
Wawryn, K.
Dziębowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/201895.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
effect of atmospheric turbulence
filtering of Deep Sky Object images
Gaussian noise
efekt turbulencji atmosferycznej
obiekt głębokiego nieba
obiekt astronomiczny
Opis:
The article presents an algorithm for digital image processing of astronomical objects in order to effectively determine the position of these objects. The proposed method has been optimized due to its effectiveness of removing noise and distortion caused by atmospheric turbulence and imperfections in long exposure photography of astronomical objects. This solution is ready for implementation in a system for automatic identification of stars in the recorded images. Such a system is designed for GoTo circuits at telescope’s drives, which can automatically point a telescope to astronomical objects. The method was verified by simulation in MATLAB program on real images of astronomical objects.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 3; 679-684
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithm to predict the location of C0 separators for efficient isogeometric analysis simulations with direct solvers
Autorzy:
Paszyńska, A.
Jopek, K.
Woźniak, M.
Paszyński, M.
Powiązania:
https://bibliotekanauki.pl/articles/201497.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
refined isogeometric analysis
finite element method
multi-frontal direct solver
heuristic algorithms
analiza izogeometryczna
metoda elementów skończonych
algorytmy heurystyczne
Opis:
We focus on two and three-dimensional isogeometric finite element method computations with tensor product Ck B-spline basis functions. We consider the computational cost of the multi-frontal direct solver algorithm executed over such tensor product grids. We present an algorithm for estimation of the number of floating-point operations per mesh node resulting from the execution of the multi-frontal solver algorithm with the ordering obtained from the element partition trees. Next, we propose an algorithm that introduces C0 separators between patches of elements of a given size based on the stimated number of flops per node. We show that the computational cost of the multi-frontal solver algorithm executed over the computational grids with C0 separators introduced is around one or two orders of magnitude lower, while the approximability of the functional space is improved. We show O(NlogN) computational complexity of the heuristic algorithm proposing the introduction of the C0 separators between the patches of elements, reducing the computational cost of the multi-frontal solver algorithm.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 6; 907-917
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Computationally efficient nonlinear model predictive controller using parallel particle swarm optimization
Autorzy:
Diwan, Supriya P.
Deshpande, Shraddha S.
Powiązania:
https://bibliotekanauki.pl/articles/2173694.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
nonlinear model predictive control
particle swarm optimization
PSO
fast dynamic systems
rotary inverted pendulum
divide approach
conquer approach
kontrola predykcyjna modelu nieliniowa
optymalizacja roju cząstek
system dynamiczny szybki
wahadło obrotowe odwrócone
Opis:
As nonlinear optimization techniques are computationally expensive, their usage in the real-time era is constrained. So this is the main challenge for researchers to develop a fast algorithm that is used in real-time computations. This work proposes a fast nonlinear model predictive control approach based on particle swarm optimization for nonlinear optimization with constraints. The suggested algorithm divide and conquer technique improves computing speed and disturbance rejection capability, demonstrating its suitability for real-time applications. The performance of this approach under constraints is validated using a highly nonlinear fast and dynamic real-time inverted pendulum system. The solution presented through work is computationally feasible for smaller sampling times and it gives promising results compared to the state of art PSO algorithm
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 4; art. no. e140696
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient microgrid model based on Markov fuzzy demand-side management
Autorzy:
Jabash Samuel, G. K.
Sivagama Sundari, M. S.
Bhavani, R.
Jasmine Gnanamalar, A.
Powiązania:
https://bibliotekanauki.pl/articles/27311444.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
smart grid
fuzzy Markov decision process
power scheduling
operating cost
nonlinear model predictive control
inteligentna sieć
planowanie mocy
koszt operacyjny
proces decyzyjny Markowa rozmyty
regulator predykcyjny nieliniowego modelu
Opis:
Today’s electricity management mainly focuses on smart grid implementation for better power utilization. Supply-demand balancing, and high operating costs are still considered the most challenging factors in the smart grid. To overcome this drawback, a Markov fuzzy real-time demand-side manager (MARKOV FRDSM) is proposed to reduce the operating cost of the smart grid system and maintain a supply-demand balance in an uncertain environment. In addition, a non-linear model predictive controller (NMPC) is designed to give a global solution to the non-linear optimization problem with real-time requirements based on the uncertainties over the forecasted load demands and current load status. The proposed MARKOV FRDSM provides a faster scale power allocation concerning fuzzy optimization and deals with uncertainties and imprecision. The implemented results show the proposed MARKOV FRDSM model reduces the cost of operation of the microgrid by 1.95%, 1.16%, and 1.09% than the existing method such as differential evolution and real coded genetic algorithm and maintains the supply-demand balance in the microgrid.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 3; art. no. e145569
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-13 z 13

    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