11 resultados para discrete support
em Martin Luther Universitat Halle Wittenberg, Germany
Resumo:
Magdeburg, Univ., Fak. für Wirtschaftswiss., Diss., 2011
Resumo:
Magdeburg, Univ., Fak. für Mathematik, Diss., 2009
Resumo:
Magdeburg, Univ., Fak. für Mathematik, Diss., 2009
Resumo:
Magdeburg, Univ., Fak. für Informatik, Diss., 2012
Resumo:
This article describes the problem of commercializing of scientific researches in universities. Management tasks are reduced to subtasks and combined formal algorithm. The overall control problem is reduced to a set of formal subtasks combined into a single algorithm. Here the necessity of joint control of all commercialization projects as well as the use of information systems for the successful implementation of the existing commercialpotential is shown.
Resumo:
Complex aspects of management by life cycle ofelectrotechnical complexes of the oil-extracting enterprises by amethod of the integrated logistic support are considered.
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.
Resumo:
The following article describes an approach covering the variety of opinions and uncertainties of estimates within the chosen technique of decision support. Mathematical operations used for assessment of options are traced to operations of working with functions that are used for assessment of possible options of decision-making. Approach proposed could be used within any technique of decision support based on elementary mathematical operations. In this article the above-mentioned approach is described under analytical hierarchy process.
Resumo:
Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2015
Resumo:
Otto-von-Guericke-Universität Magdeburg, Fakultät für Maschinenbau, Univ., Dissertation, 2015