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ę "Błażewicz, J." wg kryterium: Autor

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 29
Tytuł:
Estimation of the usability of Triticale malts in brewing industry
Autorzy:
Blazewicz, J.
Powiązania:
https://bibliotekanauki.pl/articles/1371652.pdf
Data publikacji:
1993
Wydawca:
Instytut Rozrodu Zwierząt i Badań Żywności Polskiej Akademii Nauk w Olsztynie
Tematy:
usability
brewing industry
extractivity
malt
wort viscosity
Triticale
food industry
diastatic power
estimation
Źródło:
Polish Journal of Food and Nutrition Sciences; 1993, 02, 1; 39-45
1230-0322
2083-6007
Pojawia się w:
Polish Journal of Food and Nutrition Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some remarks on evaluating the quality of the multiple sequence alignment based on the BAliBASE benchmark
Autorzy:
Błażewicz, J.
Formanowicz, P.
Wojciechowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/930013.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
dostosowanie odniesienia
dokładność ustawienia
multiple sequence alignment
reference alignment
alignment accuracy
Opis:
BAliBASE is one of the most widely used benchmarks for multiple sequence alignment programs. The accuracy of alignment methods is measured by bali score-an application provided together with the database. The standard accuracy measures are the Sum of Pairs (SP) and the Total Column (TC). We have found that, for non-core block columns, results calculated by bali score are different from those obtained on the basis of the formal definitions of the measures. We do not claim that one of these measures is better than the other, but they are definitely different. Such a situation can be the source of confusion when alignments obtained using various methods are compared. Therefore, we propose a new nomenclature for the measures of the quality of multiple sequence alignments to distinguish which one was actually calculated. Moreover, we have found that the occurrence of a gap in some column in the first sequence of the reference alignment causes column discarding.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 4; 675-678
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New machine learning methods for prediction of protein secondary structures
Autorzy:
Błażewicz, J.
Łukasiak, P.
Wilk, S.
Powiązania:
https://bibliotekanauki.pl/articles/969728.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
machine learning
prediction of protein structures
LAD
LEM2
MODLEM
Opis:
The first and probably the most important step in predicting the tertiary structure of proteins from its primary structure is to predict as many as possible secondary structures in a protein chain. Secondary structure prediction problem has been known for almost a quarter of century. In this paper, new machine learning methods such as LAD, LEM2, and MODLEM have been used for secondary protein structure prediction with the aim to choose the best among them which will be later parallelized in order to handle a huge amount of data sets.
Źródło:
Control and Cybernetics; 2007, 36, 1; 183-201
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on the complexity of scheduling of communication-aware directed acyclic graph
Autorzy:
Musial, J.
Guzek, M.
Bouvry, P.
Blazewicz, J.
Powiązania:
https://bibliotekanauki.pl/articles/202127.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
computational complexity
cloud computing
communication-aware cloud computing
directed acyclic graph
NP-hardness in cloud computing
złożoność obliczeniowa
chmura obliczeniowa
skierowany graf acykliczny
Opis:
The most recent incarnation of distributed paradigm is cloud computing. It can be seen as the first widely accepted business model of mass consumption of the distributed computing resources. Despite the differences in business models and technical details regarding cloud platforms, the distributed computing underlies cloud. Communications in cloud systems include transmissions of the results of cloud applications, users interactions, and exchange of data between different services that compose applications. The latter becomes more critical as applications become richer as well as more complex, and may consist of services operated by various providers. The effective communication between components of cloud systems is thus critical to the end user satisfaction and to the success of cloud services. We will discuss different cloud computing models (communication aware and unaware). Main focus will be placed on communication-aware directed acyclic graph (CA-DAG), which extends the classical DAG model by explicitly modeling communication tasks. Moreover, we will analyze and consult computational complexity of this innovative distributed computation model inspired by the characteristics of cloud computing. Providing a proof of strong NP-hardness of the problem allows for a future implementation and evolution of the communication-aware DAG models.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 2; 187-191
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
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ł:
Simplified mashing efficiency. Novel method for optimization of food industry wort production with the use of adjuncts
Autorzy:
Szwed, Ł. P.
Tomaszewska-Ciosk, E.
Błażewicz, J.
Powiązania:
https://bibliotekanauki.pl/articles/779962.pdf
Data publikacji:
2014
Wydawca:
Zachodniopomorski Uniwersytet Technologiczny w Szczecinie. Wydawnictwo Uczelniane ZUT w Szczecinie
Tematy:
mathematic optimization
mashing effi ciency
wort production
malt concentrates for food industry
Opis:
Malt extracts and malt concentrates have a broad range of application in food industry. Those products are obtained by methods similar to brewing worts. The possible reduction of cost can be achieved by application of malt substitutes likewise in brewing industry. As the malt concentrates for food industry do not have to fulfill strict norms for Beer production it is possible to produce much cheaper products. It was proved that by means of mathematic optimization it is possible to determine the optimal share of unmalted material for cheap yet effective production of wort.
Źródło:
Polish Journal of Chemical Technology; 2014, 16, 3; 36-39
1509-8117
1899-4741
Pojawia się w:
Polish Journal of Chemical Technology
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ł:
Influence of sprinkler irrigation and nitrogen fertilization on the quality of malt and wort from barley grains
Autorzy:
Błażewicz, J.
Żarski, J.
Dudek, S.
Kuśmierek-Tomaszewska, R.
Powiązania:
https://bibliotekanauki.pl/articles/101297.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Stowarzyszenie Infrastruktura i Ekologia Terenów Wiejskich PAN
Tematy:
malting barley
sprinkler irrigation
nitrogen fertilization
malt
wort
simplified mashing efficiency
Opis:
The aim of the research was the evaluation of sprinkler irrigation and nitrogen fertilization on some selected features of the quality of malt and wort from ‘Marthe’ and ‘Mauritia’ malting barley grains. The field experiment was carried out in the years 2010-2012 at the Research Station of the University of Science and Technology in Mochełek near Bydgoszcz. As a result of 3-year field experiment and laboratory test of grain, malt and wort, it was found that introducing sprinkler irrigation into the production process of malting barley is a step justified by the obtained quality effects. It was found that in the case of irrigated malting barley cultivations nitrogen fertilization at the rate of 30 kg·ha-1 provides (in relation to control, non-irrigated treatment) the highest values of such parameters as weight of the technical barley crops, content of protein, extractivity of Pilsen type malt, amount of obtained wort and simplified mashing efficiency. The combination of sprinkler irrigation of malting barley plants with their nitrogen fertilization at the increased rates of 60 and 90 kg·ha-1, resulted in the following effect – high mass of the usable grain of crops remained but their quality deteriorated. Malt produced from malting barley fertilized with nitrogen at the rates of 60 and 90 kg·ha-1, in spite of applied sprinkler irrigation, was characterized by unacceptable – from the technological point of view - increased content of protein in malt in the amount of over 11.5% d.m., as well as huge decrease in malt extractivity (even by 2%) and lower, simplified mashing efficiency (below 70%).
Źródło:
Infrastruktura i Ekologia Terenów Wiejskich; 2017, IV/1; 1469-1481
1732-5587
Pojawia się w:
Infrastruktura i Ekologia Terenów Wiejskich
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ł:
Internet shopping optimization problem
Autorzy:
Błażewicz, J.
Kovalyov, M. Y.
Musiał, J.
Urbański, A. P.
Wojciechowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/907755.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytm
złożoność obliczeniowa
algorytm kombinatoryczny
optymalizacja
zakupy internetowe
algorithm
computational complexity
combinatorial algorithms
optimization
Internet shopping
Opis:
A high number of Internet shops makes it difficult for a customer to review manually all the available offers and select optimal outlets for shopping. A partial solution to the problem is brought by price comparators which produce price rankings from collected offers. However, their possibilities are limited to a comparison of offers for a single product requested by the customer. The issue we investigate in this paper is a multiple-item multiple-shop optimization problem, in which total expenses of a customer to buy a given set of items should be minimized over all available offers. In this paper, the Internet Shopping Optimization Problem (ISOP) is defined in a formal way and a proof of its strong NP-hardness is provided. We also describe polynomial time algorithms for special cases of the problem.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 385-390
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the complexity of the Double Digest Problem
Autorzy:
Błażewicz, J.
Burke, E.
Jaroszewski, M.
Kasprzak, M.
Paliswiat, B.
Pryputniewicz, P.
Powiązania:
https://bibliotekanauki.pl/articles/970429.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
złożoność obliczeniowa
computational complexity
DNA restriction maps
Opis:
The problem of genome mapping is considered. It is showed that the Double Digest Problem (DDP) is NP-hard in its search version, while its decision version is trivially easy.
Źródło:
Control and Cybernetics; 2004, 33, 1; 133-140
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A method for analysis and interpretation of data from field and brewery trials
Autorzy:
Mejza, I.
Ambrozy-Deregowska, K.
Bocianowski, J.
Blazewicz, J.
Liszewski, M.
Nowosad, K.
Powiązania:
https://bibliotekanauki.pl/articles/9595.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Przyrodniczy w Lublinie. Katedra Zastosowań Matematyki i Informatyki
Źródło:
Colloquium Biometricum; 2018, 48
1896-7701
Pojawia się w:
Colloquium Biometricum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Building the library of RNA 3D nucleotide conformations using the clustering approach
Autorzy:
Zok, T.
Antczak, M.
Riedel, M.
Nebel, D.
Villmann, T.
Lukasiak, P.
Blazewicz, J.
Szachniuk, M.
Powiązania:
https://bibliotekanauki.pl/articles/329744.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
RNA nucleotides
conformer library
torsion angles
clustering
neural gas
Opis:
An increasing number of known RNA 3D structures contributes to the recognition of various RNA families and identification of their features. These tasks are based on an analysis of RNA conformations conducted at different levels of detail. On the other hand, the knowledge of native nucleotide conformations is crucial for structure prediction and understanding of RNA folding. However, this knowledge is stored in structural databases in a rather distributed form. Therefore, only automated methods for sampling the space of RNA structures can reveal plausible conformational representatives useful for further analysis. Here, we present a machine learning-based approach to inspect the dataset of RNA three-dimensional structures and to create a library of nucleotide conformers. A median neural gas algorithm is applied to cluster nucleotide structures upon their trigonometric description. The clustering procedure is two-stage: (i) backbone- and (ii) ribose-driven. We show the resulting library that contains RNA nucleotide representatives over the entire data, and we evaluate its quality by computing normal distribution measures and average RMSD between data points as well as the prototype within each cluster.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 3; 689-700
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
Autorzy:
Lopez-Loces, M. C.
Musial, J.
Pecero, J. E.
Fraire-Huacuja, H. J.
Blazewicz, J.
Bouvry, P.
Powiązania:
https://bibliotekanauki.pl/articles/330508.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
internet shopping optimization
integer linear programming
cellular processing algorithm
heuristic algorithms
optimization in e-commerce
zakupy internetowe
programowanie liniowe
algorytm heurystyczny
handel elektroniczny
Opis:
Internet shopping has been one of the most common online activities, carried out by millions of users every day. As the number of available offers grows, the difficulty in getting the best one among all the shops increases as well. In this paper we propose an integer linear programming (ILP) model and two heuristic solutions, the MinMin algorithm and the cellular processing algorithm, to tackle the Internet shopping optimization problem with delivery costs. The obtained results improve those achieved by the state-of-the-art heuristics, and for small real case scenarios ILP delivers exact solutions in a reasonable amount of time.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 391-406
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithms solving the Internet shopping optimization problem with price discounts
Autorzy:
Musial, J.
Pecero, J. E.
Lopez-Loces, M. C.
Fraire-Huacuja, H. J.
Bouvry, P.
Blazewicz, J.
Powiązania:
https://bibliotekanauki.pl/articles/200209.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
e-commerce
Internet shopping
applications of operations research
approximations
algorithms
heuristics
combinatorial optimization
zakupy przez Internet
wnioski z badań operacyjnych
aproksymacje
algorytmy
heurystyki
optymalizacja kombinatoryczna
Opis:
The Internet shopping optimization problem arises when a customer aims to purchase a list of goods from a set of web-stores with a minimum total cost. This problem is NP-hard in the strong sense. We are interested in solving the Internet shopping optimization problem with additional delivery costs associated to the web-stores where the goods are bought. It is of interest to extend the model including price discounts of goods. The aim of this paper is to present a set of optimization algorithms to solve the problem. Our purpose is to find a compromise solution between computational time and results close to the optimum value. The performance of the set of algorithms is evaluated through simulations using real world data collected from 32 web-stores. The quality of the results provided by the set of algorithms is compared to the optimal solutions for small-size instances of the problem. The optimization algorithms are also evaluated regarding scalability when the size of the instances increases. The set of results revealed that the algorithms are able to compute good quality solutions close to the optimum in a reasonable time with very good scalability demonstrating their practicability.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2016, 64, 3; 505-516
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 29

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