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ę "Data flow" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 21
Tytuł:
Dataflow approach to testing Java programs supported with DFC
Autorzy:
Bluemke, I
Rembiszewski, A
Powiązania:
https://bibliotekanauki.pl/articles/384114.pdf
Data publikacji:
2015
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
Java programming
data flow testing
structural programming language
DFC (Data Flow Coverage)
Opis:
Code based (“white box”) approach to testing can be divided into two main types: control flow coverage and data flow coverage methods. Dataflow testing was introduced for structural programming languages and later adopted for object languages. Among many tools supporting code based testing of object programs, only JaBUTi and DFC (Data Flow Coverage) support dataflow testing of Java programs. DFC is a tool implemented at the Institute of Computer Science Warsaw University of Technology as an Eclipse plug-in. The objective of this paper is to present dataflow coverage testing of Java programs supported by DFC. DFC finds all definition-uses pairs in tested unit and provides also the definition-uses graph for methods. After the execution of test information which def-uses pairs were covered is shown. An example of data flow testing of Java program is also presented
Źródło:
e-Informatica Software Engineering Journal; 2015, 9, 1; 9-19
1897-7979
Pojawia się w:
e-Informatica Software Engineering Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reducing the Number of Higher-order Mutants with the Aid of Data Flow
Autorzy:
Ghiduk, A. S.
Powiązania:
https://bibliotekanauki.pl/articles/384156.pdf
Data publikacji:
2016
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
mutation testing
first-order mutants
higher-order mutants
data-flow analysis
Opis:
Higher-order mutants are created by injecting two or more mutations into the original program, while first-order mutants are generated by seeding single faults in the original program. Mutant generation is a key stage of mutation testing which is computationally very expensive, especially in the case of higher-order mutants. Although many mutation testing techniques have been developed to construct the first-order mutants, a very small number of techniques have been presented to generate the higher-order mutants because of the exponential growth of the number of higher-order mutants, and the coupling effect between higher-order and first-order mutants. To overcome the exponential explosion in the number of higher-order mutants considered, this paper introduces a new technique for generating a reduced set of higher-order mutants. The proposed technique utilizes a data-flow analysis to decrease the number of mutation points through the program under test and consequently reduce the number of higher-order mutants. In this technique only positions of defs and uses are considered as locations to seed the mutation. The generated set of higher-order mutants consists of a reduced number of mutants, which reduces the costs of higher-order mutation testing. In addition, the proposed technique can generate the higher-order mutants directly without generating the first-order mutants or by combining two or more first-order mutants. A set of experiments are conducted to evaluate the effectiveness of the proposed technique. The results of the conducted experiments are presented and compared with the results of the related work. These results showed that the proposed technique is more effective than the earlier techniques in generating higher-order mutants without affecting the efficiency of mutation testing.
Źródło:
e-Informatica Software Engineering Journal; 2016, 10, 1; 31-49
1897-7979
Pojawia się w:
e-Informatica Software Engineering Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling of synchronous dataflow graphs for datapath synthesis
Autorzy:
Maslennikowa, N.
Sergiyenko, A.
Powiązania:
https://bibliotekanauki.pl/articles/118384.pdf
Data publikacji:
2015
Wydawca:
Politechnika Koszalińska. Wydawnictwo Uczelniane
Tematy:
data flow graph
DFG (data flow graph)
synchronous dataflow graphs
SDFs
matrix
pipelined datapath design
graf zależności informacyjnych
DFG
synchroniczny graf zależności informacyjnych
macierz
projektowanie potokowej jednostki przetwarzającej
Opis:
A method of the schedule searching is proposed, which is based on the properties of the spatial SDF. The method is based on the SDF representation in the multidimensional space. The dimensions of this space are spatial coordinate of the processing unit, time moment of the operator calculation, and operator type. During the synthesis, the nodes are placed in the space according to a set of rules, providing the minimum hardware volume for the given number of clock cycles in the algorithm period. The resulting spatial SDF is described by VHDL language and is modeled and compiled using proper CAD tools. The method is successfully proven by the synthesis of a set of FFT processors, IIR filters, and other pipelined datapaths for FPGA.
Zaproponowany sposób poszukiwania opiera się na właściwościach przestrzennych SDF. Metoda ta bazuje na SDF prezentacji w przestrzeni wielowymiarowej. Wymiarami danej przestrzeni są współrzędne jednostki przetwarzającej, czas momentu obliczeniowego operatora oraz typ operatora. Podczas syntezy, węzły są umieszczone w przestrzeni zgodnie z zestawem reguł, dając minimalną częstotliwość pracy zegara systemowego podczas wykonywania algorytmu. Powstały przestrzenny SDF jest opisany przez język VHDL i jest modelowany i skompilowany przy użyciu odpowiednich narzędzi CAD. Ta metoda jest pomyślnie sprawdzona przez syntezę zestawu procesorów FFT, filtrów IIR, oraz innych potokowych jednostek przetwarzających płytki FPGA.
Źródło:
Zeszyty Naukowe Wydziału Elektroniki i Informatyki Politechniki Koszalińskiej; 2015, 8; 53-60
1897-7421
Pojawia się w:
Zeszyty Naukowe Wydziału Elektroniki i Informatyki Politechniki Koszalińskiej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Loop profiling tool for HPC code inspection as an efficient method of FPGA based acceleration
Autorzy:
Pietroń, M.
Russek, P.
Wiatr, K.
Powiązania:
https://bibliotekanauki.pl/articles/929582.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
HPC
HPRC
obliczanie wysokowartościowe
obliczanie rekonfigurowalne
przetwarzanie danych
loop profiling
Mitrion-C
DFG (data flow graph)
Opis:
This paper presents research on FPGA based acceleration of HPC applications. The most important goal is to extract a code that can be sped up. A major drawback is the lack of a tool which could do it. HPC applications usually consist of a huge amount of a complex source code. This is one of the reasons why the process of acceleration should be as automated as possible. Another reason is to make use of HLLs (High Level Languages) such as Mitrion-C (Mohl, 2006). HLLs were invented to make the development of HPRC applications faster. Loop profiling is one of the steps to check if the insertion of an HLL to an existing HPC source code is possible to gain acceleration of these applications. Hence the most important step to achieve acceleration is to extract the most time consuming code and data dependency, which makes the code easier to be pipelined and parallelized. Data dependency also gives information on how to implement algorithms in an FPGA circuit with minimal initialization of it during the execution of algorithms.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 3; 581-589
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Resource Utilization Estimation and Core Placement in an NoC-based MPSoC realizing a data-dominated algorithm
Szacowanie wykorzystania zasobów i rozmieszczenia rdzeni przy realizacji algorytmów zdominowanych danymi w MPSoC opartych na NoC
Autorzy:
Dondziak, P.
Dziurzański, P.
Powiązania:
https://bibliotekanauki.pl/articles/154795.pdf
Data publikacji:
2010
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
szacowanie zasobów
odwzorowanie rdzeni
diagram przepływu danych i kontroli
problem pokrycia paska
sieci wewnątrzukładowe
resource estimation
core mapping
Control Data Flow Graph
Rectangular Strip Packing Problem
Network on Chip (NoC)
Opis:
In this paper we propose a technique for estimating the number of NoC-based MPSoCs resources (measured in FPGA LUTs) needed for realizing an arbitrary data-dominated algorithm given in the SystemC language. This technique utilizes Control Data Flow Graphs describing the functionality of the code. In order to map the cores into the target chip we use the Bottom-Left-Decreasing algorithm for solving the 2D Rectangular Strip Packing problem. We illustrate the proposed technique with a lossless audio FLAC codec.
W artykule zaproponowano technikę szacowania zasobów potrzebnych do realizacji wielordzeniowych układów MPSoC opartych na sieciach wewnątrzukładowych NoC (ang. Networks on Chip) realizujących dowolny algorytm zdominowany danymi. Algorytm ten jest wyrażony za pomocą kodu w języku opisu systemu SystemC. Jako miarę powierzchni przyjęto liczbę tablic look-up-table (LUT) układów typu FPGA, do których wejściowe algorytmy zostają odwzorowywane. Proponowana technika wykorzystuje diagram przepływu danych i kontroli (ang. Control Data Flow Graph, CDFG), opisujący funkcjonalność kodu. Następnie dla węzłów tego diagramu dokonuje się prostej estymacji wymaganych zasobów w zależności od typu danego węzła i rozmiaru danych, na których węzeł przeprowadza obliczenia. Proponowana technika została zilustrowana przykładem bezstratnego kodeka FLAC. Zaprezentowane wyniki badań eksperymentalnych pokazują dokładność od 99.3% do 57%, co jest zbliżone do wyników innych zespołów badawczych, np. [2, 4]. W celu odwzorowania rdzeni do docelowego układu użyto zachłannego algorytmu Bottom-Left-Decreasing do rozwiązania dwuwymiarowego problemu pokrycia paska. Badania przeprowadzono dla różnych ograniczeń maksymalnej wysokości paska; w artykule przedstawiono wizualizacje najlepszego i najgorszego przypadku.
Źródło:
Pomiary Automatyka Kontrola; 2010, R. 56, nr 7, 7; 784-786
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
E-AZS platform model – the concept of application of information and communications technology in sports enterprises
Autorzy:
Cieśliński, Wojciech B.
Witkowski, Kazimierz
Migasiewicz, Juliusz
Rokita, Andrzej
Perechuda, Kazimierz
Chomiak-Orsa, Iwona
Powiązania:
https://bibliotekanauki.pl/articles/432184.pdf
Data publikacji:
2014
Wydawca:
Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
Tematy:
ICT platform
process approach
sports enterprise
monitoring of the flow of data
information and knowledge
Opis:
The article presents the research concerning the description of the possible application, in sports enterprises, of an ICT system supporting the exchange of data, information and knowledge between the management, trainers providing training services, and the clients of the sports enterprise, namely the athletes.
Źródło:
Informatyka Ekonomiczna; 2014, 4(34); 9-15
1507-3858
Pojawia się w:
Informatyka Ekonomiczna
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Data analysis and flow graphs
Autorzy:
Pawlak, Z.
Powiązania:
https://bibliotekanauki.pl/articles/308986.pdf
Data publikacji:
2004
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
data mining
data independence
flow graph
Bayes' rule
Opis:
In this paper we present a new approach to data analysis based on flow distribution study in a flow network. Branches of the flow graph are interpreted as decision rules, whereas the flow graph is supposed to describe a decision algorithm. We propose to model decision processes as flow graphs and analyze decisions in terms of flow spreading in the graph.
Źródło:
Journal of Telecommunications and Information Technology; 2004, 3; 18-22
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Method of organizing of the data flow in business entity on the basis of data flow diagram and the theory of queues
Autorzy:
Liaushuk, Aliaksandr
Jasiak, Aleksandra
Powiązania:
https://bibliotekanauki.pl/articles/409258.pdf
Data publikacji:
2019
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
flow
data
information
theory of queues
business entity
Opis:
This article presents selected issues related to the elaboration of the method used to the organization of data flow in the business entity with the assistance of data flow diagram and the theory of queues. The aim of this work is to create a method, to visualize processes in business entity in the form of data flow diagrams and to determine the weakest points in data flow in the business entity using the theory of queues as well as to propose solutions improving this process.
Źródło:
Research in Logistics & Production; 2019, 9, 1; 31-38
2083-4942
2083-4950
Pojawia się w:
Research in Logistics & Production
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decisions algorithms and flow graphs; a rough set approach
Autorzy:
Pawlak, Z.
Powiązania:
https://bibliotekanauki.pl/articles/307789.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
rough sets
decision algorithms
flow graphs
data mining
Opis:
This paper concerns some relationship between Bayes' theorem and rough sets. It is revealed that any decision algorithm satisfies Bayes' theorem, without referring to either prior or posterior probabilities inherently associated with classical Bayesian methodology. This leads to a new simple form of this theorem, which results in new algorithms and applications. Besides, it is shown that with every decision algorithm a flow graph can be associated. Bayes' theorem can be viewed as a flow conservation rule of information flow in the graph. Moreover, to every flow graph the Euclidean space can be assigned. Points of the space represent decisions specified by the decision algorithm, and distance between points depicts distance between decisions in the decision algorithm.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 98-101
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Polish households savings in the financial intersectoral linkages
Autorzy:
Trębska, Joanna
Powiązania:
https://bibliotekanauki.pl/articles/22446548.pdf
Data publikacji:
2018
Wydawca:
Instytut Badań Gospodarczych
Tematy:
saving
flow of funds
data estimation
financial input-output model
Opis:
Research background: Savings of households are accumulated as a result of individual propensity to save. Simultaneously, they provide the sources of financing investments in the economy through financial institutions as intermediaries in the flow of funds, between entities with a surplus and those with a demand for them. Purpose of the article: The paper aims at indicating the changes in the structure of households' financial savings in Poland in the period 2003-2015, as well as at exploring them as a source of financing the activities of other sectors through institutional mechanisms of the financial system. Methods: Intersectoral financial flows were estimated using input-output methods for com-piling 'sector by instrument' tables of financial assets and liabilities into 'sector by sector' matrices of intersectoral flows of each financial instrument. The research is based on statistical data published in the Eurostat database, i.e. annual accounts ? financial balance sheets by institutional sectors and subsectors. The role of households' financial savings in the network of intersectoral linkages in the financial system has been examined on the basis of financial input-output model. Findings & Value added: The comparison of the significance of particular institutional sectors' supply of funds clearly indicates that the increase in households' financial assets causes the largest increase in financial flows both as a result of direct effect and indirect effects reflecting the size of these flows' feedback in the financial system. The study presented herein is the first application of the input-output approach for the Polish financial system. The idea of financial input-output model proposed by Tsujimura & Mizoshita (2003) is extended to disaggregate intersectoral flows in the form of individual financial instruments.
Źródło:
Equilibrium. Quarterly Journal of Economics and Economic Policy; 2018, 13, 2; 307-329
1689-765X
2353-3293
Pojawia się w:
Equilibrium. Quarterly Journal of Economics and Economic Policy
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Periodic trends in two-phase flow through a vertical minichannel: wavelet and multiscale entropy analyses based on digital camera data
Autorzy:
Górski, Grzegorz
Mosdorf, Romuald
Rysak, Andrzej
Litak, Grzegorz
Powiązania:
https://bibliotekanauki.pl/articles/387600.pdf
Data publikacji:
2019
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
digital camera data
two-phase flow
pattern identification
multiscale entropy
wavelets
Opis:
By changing the air and water flow relative rates in the two-phase (air-water) flow through a minichannel, we observe aggregation and partitioning of air bubbles and slugs of different sizes. An air bubble arrangement, which show non-periodic and periodic patterns. The spatiotemporal behaviour was recorded by a digital camera. Multiscale entropy analysis is a method of measuring the time series complexity. The main aim of the paper was testing the possibility of implementation of multiscale entropy for two-phase flow patterns classification. For better understanding, the dynamics of the two-phase flow patterns inside the minichannel histograms and wavelet methods were also used. In particular, we found a clear distinction between bubbles and slugs formations in terms of multiscale entropy. On the other hand, the intermediate region was effected by appearance of both forms in non-periodic and periodic sequences. The preliminary results were confirmed by using histograms and wavelets.
Źródło:
Acta Mechanica et Automatica; 2019, 13, 1; 51-56
1898-4088
2300-5319
Pojawia się w:
Acta Mechanica et Automatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Flexible production flow control systems
Autorzy:
Chrobot, Jarosław
Powiązania:
https://bibliotekanauki.pl/articles/36847846.pdf
Data publikacji:
2021
Wydawca:
Polskie Towarzystwo Zarządzania Produkcją
Tematy:
production flow control
data registration
traceability
sterowanie przepływem produkcji
rejestracja danych
identyfikowalność
Opis:
Requirements regarding the quality and full traceability of delivered products in some industrial sectors, such as the food, pharmaceutical and automotive industries, where the life and health of the end user depends on the quality of the product, cause production flow control systems (PFC) to become an important element of the functioning of production enterprises. PFC systems are IT systems that are generally used for recording production data (in a database) at various stages of industrial processes, mainly from PLC controllers (in this respect they perform the function of traceability systems, that enable tracking products), but also provide blocking of identifiable products, which were incorrectly processed during earlier stages of production or follow wrong technology sequence. The desirable feature of such systems is their flexibility, which is characterised by their scalability and configurability. Configurability is the ability to include different processes into the PFC system in a relatively short time. The concept of a configurable system must be well considered and different material flow cases must be taken into account to avoid future dramatic changes in the IT system. Scalability is the ability to include more and more processes under control of the PFC system without the significant impact on its effectiveness. The PFC systems use computer networks to process production data, so the scalability of PFC systems depends on their modular architecture in the network. The article discusses basic features and possible PFC architectures, as well as two examples of configurable PFC systems along with their analysis and assessment. The described systems are the result of projects in which the author of this article participated, the aim of which was to develop and launch a flexible PFC system that meets the basic industrial requirements from the area of discrete manufacturing.
Źródło:
Zarządzanie Przedsiębiorstwem; 2021, 24, 1-2; 2-7
1643-4773
Pojawia się w:
Zarządzanie Przedsiębiorstwem
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The uncertainty of the water flow velocity data obtained in the laboratory test
Miara niepewności wyników pomiarów uzyskanych z badań laboratoryjnych przepływu
Autorzy:
Malinowska, E.
Sas, W.
Szymanski, A.
Powiązania:
https://bibliotekanauki.pl/articles/81805.pdf
Data publikacji:
2008
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
data uncertainty
water flow
laboratory test
organic soil
soil
flow characteristics
soil strength
deformation parameter
soil structure
statistical analysis
Źródło:
Annals of Warsaw University of Life Sciences - SGGW. Land Reclamation; 2008, 40
0208-5771
Pojawia się w:
Annals of Warsaw University of Life Sciences - SGGW. Land Reclamation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Combination of Association Rules and Optimization Model to Solve Scheduling Problems in an Unstable Production Environment
Autorzy:
Del Gallo, Mateo
Ciarapica, Filippo Emanuele
Mazzuto, Giovanni
Bevilacqua, Maurizio
Powiązania:
https://bibliotekanauki.pl/articles/27324213.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
data mining
association rules
optimization model
production scheduling
job-shop scheduling
flow shop scheduling
Opis:
Production problems have a significant impact on the on-time delivery of orders, resulting in deviations from planned scenarios. Therefore, it is crucial to predict interruptions during scheduling and to find optimal production sequencing solutions. This paper introduces a selflearning framework that integrates association rules and optimisation techniques to develop a scheduling algorithm capable of learning from past production experiences and anticipating future problems. Association rules identify factors that hinder the production process, while optimisation techniques use mathematical models to optimise the sequence of tasks and minimise execution time. In addition, association rules establish correlations between production parameters and success rates, allowing corrective factors for production quantity to be calculated based on confidence values and success rates. The proposed solution demonstrates robustness and flexibility, providing efficient solutions for Flow-Shop and Job-Shop scheduling problems with reduced calculation times. The article includes two Flow-Shop and Job-Shop examples where the framework is applied.
Źródło:
Management and Production Engineering Review; 2023, 14, 4; 56--70
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Urban tidal flow noise - case study
Autorzy:
Bąkowski, Andrzej
Radziszewski, Leszek
Powiązania:
https://bibliotekanauki.pl/articles/24201984.pdf
Data publikacji:
2023
Wydawca:
Politechnika Poznańska. Instytut Mechaniki Stosowanej
Tematy:
urban noise
traffic flow
monitoring station data
hałas miejski
ruch uliczny
dane ze stacji monitoringu
Opis:
The study carried out an analysis of the urban traffic noise from 2011 to 2016 at Kielce (Poland). The results of noise simulations according to the Cnossos-EU model were compared with the sound level calculated by monitoring station and a very good agreement was obtained. The mean absolute error was smaller than 1 dB(A). For weekdays the charts shape at individual hours of the day were shown to be similar. However, one can notice a different shape of this charts from the morning peak on Friday to the end of the weekend and especially on Saturday and Sunday.
Źródło:
Vibrations in Physical Systems; 2023, 34, 1; art. no. 2023119
0860-6897
Pojawia się w:
Vibrations in Physical Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 21

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