996 resultados para Multicommodity flow algorithms
Resumo:
Step flow growth, meandering instability, coarsening
Resumo:
Magdeburg, Univ., Fak. für Mathematik, Habil.-Schr., 2006
Resumo:
Analyte retention, analyte transport, axial dispersion, adsorption, charge-selectivity, concentration polarization, confocal laser scanning microscopy, donnan-exclusion, electrical double layer; electrochromatography; electrohydrodynamics, electrokinetic instability, electroosmosis; electroosmotic flow; electroosmotic mobility, electroosmotic perfusion, electrophoresis, hierarchical porous media, hydrodynamic flow, induced-charge electroosmosis, ion-permselectivity, ion-permselective transport, monolith, nonequilibrium electrical double layer, nonequilibrium electrokinetic effects, nonlinear electroosmosis, plate height, plate number, porous media, pore-scale dispersion, refractive index matching, space charge effects, sphere packing, quantitative imaging, wall effect, zeta-potential
Resumo:
Cross-Flow, Radial Jets Mixing, Temperature Homogenization, Optimization, Combustion Chamber, CFD
Resumo:
AbstractBackground:The relationship between psychiatric illness and heart disease has been frequently discussed in the literature. The aim of the present study was to investigate the relationship between anxiety, depression and overall psychological distress, and coronary slow flow (CSF).Methods:In total, 44 patients with CSF and a control group of 50 patients with normal coronary arteries (NCA) were prospectively recruited. Clinical data, admission laboratory parameters, and echocardiographic and angiographic characteristics were recorded. Symptom Checklist 90 Revised (SCL-90-R), Beck Depression Inventory (BDI), and Beck Anxiety Inventory (BAI) scales were administered to each patient.Results:The groups were comparable with respect to age, sex, and atherosclerotic risk factors. In the CSF group, BAI score, BDI score, and general symptom index were significantly higher than controls (13 [18.7] vs. 7.5 [7], p = 0.01; 11 [14.7] vs. 6.5 [7], p = 0.01; 1.76 [0.81] vs. 1.1[0.24], p = 0.01; respectively). Patients with CSF in more than one vessel had the highest test scores. In univariate correlation analysis, mean thrombolysis in myocardial infarction (TIMI) frame counts were positively correlated with BAI (r = 0.56, p = 0.01), BDI (r = 0.47, p = 0.01), and general symptom index (r = 0.65, p = 0.01). The psychiatric tests were not correlated with risk factors for atherosclerosis.Conclusion:Our study revealed higher rates of depression, anxiety, and overall psychological distress in patients with CSF. This conclusion warrants further studies.
Resumo:
Magdeburg, Univ., Fak. für Informatik, Diss., 2009
Resumo:
Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2009
Resumo:
Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2010
Resumo:
Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2012
Resumo:
This work describes a test tool that allows to make performance tests of different end-to-end available bandwidth estimation algorithms along with their different implementations. The goal of such tests is to find the best-performing algorithm and its implementation and use it in congestion control mechanism for high-performance reliable transport protocols. The main idea of this paper is to describe the options which provide available bandwidth estimation mechanism for highspeed data transport protocols and to develop basic functionality of such test tool with which it will be possible to manage entities of test application on all involved testing hosts, aided by some middleware.
Resumo:
Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2013
Resumo:
Magdeburg, Univ., Fak. für Informatik, Diss., 2013
Resumo:
In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inverse Fast Fourier Transformation (IFFT), and proper techniques for maximizing the FFT/IFFT execution speed, such as pipelining or parallel processing, and use of memory structures with pre-computed values (look up tables -LUT) or other dedicated hardware components (usually multipliers). Furthermore, we discuss the optimal hardware architectures that best apply to various FFT/IFFT algorithms, along with their abilities to exploit parallel processing with minimal data dependences of the FFT/IFFT calculations. An interesting approach that is also considered in this paper is the application of the integrated processing-in-memory Intelligent RAM (IRAM) chip to high speed FFT/IFFT computing. The results of the assessment study emphasize that the execution speed of the FFT/IFFT algorithms is tightly connected to the capabilities of the FFT/IFFT hardware to support the provided parallelism of the given algorithm. Therefore, we suggest that the basic Discrete Fourier Transform (DFT)/Inverse Discrete Fourier Transform (IDFT) can also provide high performances, by utilizing a specialized FFT/IFFT hardware architecture that can exploit the provided parallelism of the DFT/IDF operations. The proposed improvements include simplified multiplications over symbols given in polar coordinate system, using sinе and cosine look up tables, and an approach for performing parallel addition of N input symbols.
Resumo:
In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inverse Fast Fourier Transformation (IFFT), and proper techniquesfor maximizing the FFT/IFFT execution speed, such as pipelining or parallel processing, and use of memory structures with pre-computed values (look up tables -LUT) or other dedicated hardware components (usually multipliers). Furthermore, we discuss the optimal hardware architectures that best apply to various FFT/IFFT algorithms, along with their abilities to exploit parallel processing with minimal data dependences of the FFT/IFFT calculations. An interesting approach that is also considered in this paper is the application of the integrated processing-in-memory Intelligent RAM (IRAM) chip to high speed FFT/IFFT computing. The results of the assessment study emphasize that the execution speed of the FFT/IFFT algorithms is tightly connected to the capabilities of the FFT/IFFT hardware to support the provided parallelism of the given algorithm. Therefore, we suggest that the basic Discrete Fourier Transform (DFT)/Inverse Discrete Fourier Transform (IDFT) can also provide high performances, by utilizing a specialized FFT/IFFT hardware architecture that can exploit the provided parallelism of the DFT/IDF operations. The proposed improvements include simplified multiplications over symbols given in polar coordinate system, using sinе and cosine look up tables,and an approach for performing parallel addition of N input symbols.