Operations Research Transforms Baosteel's Operations
نویسندگان
چکیده
منابع مشابه
Numerical inversion of probability generating functions
Random quanti t ies of interest in operations research models can often be determined conveniently in the form of transforms. Hence, numerical t ransform inversion can be an effective way to obtain desired numerical values of cumulative distribution functions, probability density functions and probability mass functions. However, numerical transform inversion has not been widely used. This lack...
متن کاملFast Möbius Inversion in Semimodular Lattices and ER-labelable Posets
We consider the problem of fast zeta and Möbius transforms in finite posets, particularly in lattices. It has previously been shown that for a certain family of lattices, zeta and Möbius transforms can be computed in O(e) elementary arithmetic operations, where e denotes the size of the covering relation. We show that this family is exactly that of geometric lattices. We also extend the algorit...
متن کاملFast Fourier Analysis for Abelian Group Extensions
Let G be a nite group and f any complex-valued function deened on G and an irreducible complex matrix representation of G. The Fourier transform of f at is deened to be the matrix P s2G f(s)(s). The Fourier transforms of f at all the irreducible representations of G determine f via the Fourier inversion formula f(s) = 1 j Gj P d trace(b f()(s ?1)): Direct computation of all Fourier transforms o...
متن کاملUsing Analytic Hierarchy Process with Operations
The Analytic Hierarchy Process (AHP) is a structured decision making support tool that has been used by the Ministry of Defence and DSTA for evaluating weapon systems and platforms. Since 2005, AHP has also been adopted in the evaluation of several large-scale non-defence government tenders. As the Singapore Armed Forces transforms into a Third Generation fighting force, new technologies and co...
متن کاملThe Role of Super-Fast Transforms in Speeding Up Quantum Computations
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While the fast transform algorithms reduce the number of operations needed in obtaining the transforms from O(2) to O(n2), quantum transforms are in comparison super-fast. The Quantum Fourier Transform can be performed in O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Interfaces
دوره 44 شماره
صفحات -
تاریخ انتشار 2014