2,641 research outputs found
Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem
This paper proposes a heuristic that introduces the
application of bottleneck-based concept at the beginning of an initial sequence
determination with the objective of makespan minimization. Earlier studies
found that the scheduling activity become complicated when dealing with
machine, m greater than 2, known as non-deterministic polynomial-time
hardness (NP-hard). To date, the Nawaz-Enscore-Ham (NEH) algorithm is
still recognized as the best heuristic in solving makespan problem in
scheduling environment. Thus, this study treated the NEH heuristic as the
highest ranking and most suitable heuristic for evaluation purpose since it is
the best performing heuristic in makespan minimization. This study used the
bottleneck-based approach to identify the critical processing machine which
led to high completion time. In this study, an experiment involving machines
(m =4) and n-job (n = 6, 10, 15, 20) was simulated in Microsoft Excel Simple
Programming to solve the permutation flowshop scheduling problem. The
overall computational results demonstrated that the bottleneck machine M4
performed the best in minimizing the makespan for all data set of problems
MDL Denoising Revisited
We refine and extend an earlier MDL denoising criterion for wavelet-based
denoising. We start by showing that the denoising problem can be reformulated
as a clustering problem, where the goal is to obtain separate clusters for
informative and non-informative wavelet coefficients, respectively. This
suggests two refinements, adding a code-length for the model index, and
extending the model in order to account for subband-dependent coefficient
distributions. A third refinement is derivation of soft thresholding inspired
by predictive universal coding with weighted mixtures. We propose a practical
method incorporating all three refinements, which is shown to achieve good
performance and robustness in denoising both artificial and natural signals.Comment: Submitted to IEEE Transactions on Information Theory, June 200
Recommended from our members
On the block wavelet transform applied to the boundary element method
This paper follows an earlier work by Bucher et al. [1] on the application of wavelet transforms to the boundary element method, which shows how to reuse models stored in compressed form to solve new models with the same geometry but arbitrary load cases - the so-called virtual assembly technique. The extension presented in this paper involves a new computational procedure created to perform the required two-dimensional wavelet transforms by blocks, theoretically allowing the compression of matrices of arbitrary size. Details of the computer implementation that allows the use of this methodology for very large models or at high compression ratios are given. A numerical application shows a standard PC being used to solve a 131,072 DOF model, previously compressed, for 100 distinct load cases in less than 1 hour – or 33 seconds for each load case
ENO-wavelet transforms for piecewise smooth functions
We have designed an adaptive essentially nonoscillatory (ENO)-wavelet transform for approximating discontinuous functions without oscillations near the discontinuities. Our approach is to apply the main idea from ENO schemes for numerical shock capturing to standard wavelet transforms. The crucial point is that the wavelet coefficients are computed without differencing function values across jumps. However, we accomplish this in a different way than in the standard ENO schemes. Whereas in the standard ENO schemes the stencils are adaptively chosen, in the ENO-wavelet transforms we adaptively change the function and use the same uniform stencils. The ENO-wavelet transform retains the essential properties and advantages of standard wavelet transforms such as concentrating the energy to the low frequencies, obtaining maximum accuracy, maintained up to the discontinuities, and having a multiresolution framework and fast algorithms, all without any edge artifacts. We have obtained a rigorous approximation error bound which shows that the error in the ENO-wavelet approximation depends only on the size of the derivative of the function away from the discontinuities. We will show some numerical examples to illustrate this error estimate
Kajian motivasi ekstrinsik di antara Pelajar Lepasan Sijil dan Diploma Politeknik Jabatan Kejuruteraan Awam KUiTTHO
Kajian ini dijalankan untuk menyelidiki pengaruh dorongan keluarga, cara pengajaran pensyarah, pengaruh rakan sebaya dan kemudahan infrastruktur terhadap motivasi ekstrinsik bagi pelajar tahun tiga dan tahun empat lepasan sijil dan diploma politeknik Jabatan Kejuruteraan Awain Kolej Universiti Teknologi Tun Hussein Onn. Sampel kajian ini beijumlah 87 orang bagi pelajar lepasan sijil politeknik dan 38 orang bagi lepasan diploma politeknik. Data kajian telah diperolehi melalui borang soal selidik dan telah dianalisis menggunakan perisian SPSS (Statical Package For Sciences). Hasil kajian telah dipersembahkan dalam bentuk jadual dan histohgrapi. Analisis kajian mendapati bahawa kedua-dua kumpulan setuju bahawa faktor-faktor di atas memberi kesan kepada motivasi ekstrinsik mereka. Dengan kata lain faktpr-faktor tersebut penting dalam membentuk pelajar mencapai kecemerlangan akademik
- …