• Title/Summary/Keyword: Algorithm decomposition

Search Result 789, Processing Time 0.026 seconds

A Scalable Heuristic for Pickup-and-Delivery of Splittable Loads and Its Application to Military Cargo-Plane Routing

  • Park, Myoung-Ju;Lee, Moon-Gul
    • Management Science and Financial Engineering
    • /
    • v.18 no.1
    • /
    • pp.27-37
    • /
    • 2012
  • This paper is motivated by a military cargo-plane routing problem which is a pickup-and-delivery problem in which load splits and node revisits are allowed (PDPLS). Although this recent evolution of a VRP-model enhances the efficiency of routing, a solution method is more of a challenge since the node revisits entail closed walks in modeling vehicle routes. For such a case, even a compact IP-formulation is not available and an effective method had been lacking until Nowak et al. (2008b) proposed a heuristic based on a tabu search. Their method provides very reasonable solu-tions as demonstrated by the experiments not only in their paper (Nowak et al., 2008b) but also in ours. However, the computation time seems intensive especially for the class of problems with dynamic transportation requests, including the military cargo-plane routing problem. This paper proposes a more scalable algorithm hybridizing a tabu search for pricing subproblem paused as a single-vehicle routing problem, with a column generation approach based on Dantzig-Wolfe decomposition. As tested on a wide variety of instances, our algorithm produces, in average, a solution of an equiva-lent quality in 10~20% of the computation time of the previous method.

A Study on the Development of Digital Yut Playing System Based on Physical Computing (피지컬 컴퓨팅을 기반으로 한 디지털 윷놀이 시스템 개발에 관한 연구)

  • Koh, Byoungoh
    • Journal of The Korean Association of Information Education
    • /
    • v.21 no.3
    • /
    • pp.335-342
    • /
    • 2017
  • The artificial intelligence, robot technology, Internet of things, and life sciences that create added value while dramatically transforming human life have been highlighted in the fourth industrial revolution, the next industrial revolution. In order to adapt to the 4th industry, it is necessary to educate students to develop fusion thinking and computing thinking ability. Therefore, in this study, we developed a digital Yut Playing system based on physical computing, reflecting STEAM and decomposition, pattern recognition, abstraction, and algorithm design, which are components of computing thinking. By experiencing the developed system and applying it to education, it raised interest and interest in programming education and improved programming lesson for fusion thinking and computing thinking ability.

A Parametric Voice Activity Detection Based on the SPD-TE for Nonstationary Noises (비정체성 잡음을 위한 SPD-TE 기반 계수형 음성 활동 탐지)

  • Koo, Boneung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.34 no.4
    • /
    • pp.310-315
    • /
    • 2015
  • A single channel VAD (Voice Activity Detection) algorithm for nonstationary noise environment is proposed in this paper. Threshold values of the feature parameter for VAD decision are updated adaptively based on estimates of means and standard deviations of past non-speech frames. The feature parameter, SPD-TE (Spectral Power Difference-Teager Energy), is obtained by applying the Teager energy to the WPD (Wavelet Packet Decomposition) coefficients. It was reported previously that the SPD-TE is robust to noise as a feature for VAD. Experimental results by using TIMIT speech and NOISEX-92 noise databases show that decision accuracy of the proposed algorithm is comparable to several typical VAD algorithms including standards for SNR values ranging from 10 to -10 dB.

Structural damage detection in presence of temperature variability using 2D CNN integrated with EMD

  • Sharma, Smriti;Sen, Subhamoy
    • Structural Monitoring and Maintenance
    • /
    • v.8 no.4
    • /
    • pp.379-402
    • /
    • 2021
  • Traditional approaches for structural health monitoring (SHM) seldom take ambient uncertainty (temperature, humidity, ambient vibration) into consideration, while their impacts on structural responses are substantial, leading to a possibility of raising false alarms. A few predictors model-based approaches deal with these uncertainties through complex numerical models running online, rendering the SHM approach to be compute-intensive, slow, and sometimes not practical. Also, with model-based approaches, the imperative need for a precise understanding of the structure often poses a problem for not so well understood complex systems. The present study employs a data-based approach coupled with Empirical mode decomposition (EMD) to correlate recorded response time histories under varying temperature conditions to corresponding damage scenarios. EMD decomposes the response signal into a finite set of intrinsic mode functions (IMFs). A two-dimensional Convolutional Neural Network (2DCNN) is further trained to associate these IMFs to the respective damage cases. The use of IMFs in place of raw signals helps to reduce the impact of sensor noise while preserving the essential spatio-temporal information less-sensitive to thermal effects and thereby stands as a better damage-sensitive feature than the raw signal itself. The proposed algorithm is numerically tested on a single span bridge under varying temperature conditions for different damage severities. The dynamic strain is recorded as the response since they are frame-invariant and cheaper to install. The proposed algorithm has been observed to be damage sensitive as well as sufficiently robust against measurement noise.

Development of Integer DCT for VLSI Implementation (VLSI 구현을 위한 정수화 DCT 개발)

  • 곽훈성;이종하
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.12
    • /
    • pp.1928-1934
    • /
    • 1993
  • This paper presents a fast algorithm of integer discrete cosine transform(IDCT) allowing VLSI implementation by integer arithmetic. The proposed fast algorithm has been developed using Chen`s matrix decomposition in DCT, and requires less number of arithmetic operations compared to the IDCT. In the presented algorithm, the number of addition number is the same as the one of Chen`s algorithm if DCT, and the number of multiplication if the same as that in DCT at N=8 but drastically decreasing when N is above 8. In addition, the drawbacks of DCT such as performance degradation at the finite length arithmetic could be overcome by the IDCT.

  • PDF

An Effective Image Restoration Using Genetic Algorithm in Wavelet Transform Region (웨이브릿 변환 영역에서 유전자 알고리즘을 적용한 효율적인 영상복원)

  • 김은영;안주원;정희태;문영득
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.89-92
    • /
    • 2000
  • In this paper, an effective image restoration using Genetic Algorithm(GA) in wavelet transform region is proposed. First, a wavelet transform is used for decomposition of a blurred image with white Gaussian noise as a preprocessing of the proposed method. The wavelet transform decomposes a degraded image into a wavelet subband coefficient planes. In this wavelet transformed subband coefficient planes, three highest subbands is composed entirely of noise elements on a degraded image. So, these subbands are removed. And remained subbands except for the lowest subband are individually applied to GA. For the performance evaluation, the proposed method is compared with a conventional single GA algorithm and a conventional hybrid method of wavelet transform and GA for a Lenna image and a boat image. As an experimental result, the proposed algorithm is prior to a conventional methods as each PSNR 3.4dB, 1.3dB.

  • PDF

Medical Image Compression using Adaptive Subband Threshold

  • Vidhya, K
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.499-507
    • /
    • 2016
  • Medical imaging techniques such as Magnetic Resonance Imaging (MRI), Computed Tomography (CT) and Ultrasound (US) produce a large amount of digital medical images. Hence, compression of digital images becomes essential and is very much desired in medical applications to solve both storage and transmission problems. But at the same time, an efficient image compression scheme that reduces the size of medical images without sacrificing diagnostic information is required. This paper proposes a novel threshold-based medical image compression algorithm to reduce the size of the medical image without degradation in the diagnostic information. This algorithm discusses a novel type of thresholding to maximize Compression Ratio (CR) without sacrificing diagnostic information. The compression algorithm is designed to get image with high optimum compression efficiency and also with high fidelity, especially for Peak Signal to Noise Ratio (PSNR) greater than or equal to 36 dB. This value of PSNR is chosen because it has been suggested by previous researchers that medical images, if have PSNR from 30 dB to 50 dB, will retain diagnostic information. The compression algorithm utilizes one-level wavelet decomposition with threshold-based coefficient selection.

An Efficient Computational Method for Linear Time-invariant Systems via Legendre Wavelet (르장드르 웨이블릿을 이용한 선형 시불변 시스템의 효율적 수치 해석 방법)

  • Kim, Beomsoo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.7
    • /
    • pp.577-582
    • /
    • 2013
  • In this paper Legendre wavelets are used to approximate the solutions of linear time-invariant system. The Legendre wavelet and its integral operational matrix are presented and an efficient algorithm to solve the Sylvester matrix equation is proposed. The algorithm is based on the decomposition of the Sylvester matrix equation and the preorder traversal algorithm. Using the special structure of the Legendre wavelet's integral operational matrix, the full order Sylvester matrix equation can be solved in terms of the solutions of pure algebraic matrix equations, which reduce the computation time remarkably. Finally a numerical example is illustrated to demonstrate the validity of the proposed algorithm.

System Identification of Flexible beam Using Eigensystem Realization Algorithm (Eigensystem Realization Algorithm을 이용한 유연한 빔의 운동방정식 규명)

  • Lee, In-Sung;Lee, Jae-Won;Lee, Soo-Cheol
    • Proceedings of the KSME Conference
    • /
    • 2000.04a
    • /
    • pp.566-572
    • /
    • 2000
  • The System identification is the process of developing or improving a mathematical model of a physical system using experimental data of the input, output and noise relationship. The field of system identification has been an important discipline within the automatic control area. The reason is the requirement that mathematical models having a specified accuracy must be used to apply modem control methods. In this paper, it is confirmed that we can obtain transfer function of flexible beam that is expressed in the forms of identified state-space system matrix A, B, C, D and identified observer gain G using Eigensystem Realization Algorithm including singular value decomposition. And these matrices can be applied to the automatic control. In addition to, it is also confirmed that transfer function can express a system using identified observer gain G, in spite of a noisy data or a periodic disturbance.

  • PDF

Development of a Cutting Simulation System using Octree Algorithm (옥트리 알고리즘을 이용한 절삭 시뮬레이션 시스템의 개발)

  • Kim Y-H.;Ko S.-L.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.10 no.2
    • /
    • pp.107-113
    • /
    • 2005
  • Octree-based algorithm is developed for machining simulation. Most of commercial machining simulators are based on Z map model, which have several limitations to get a high precision in 5 axis machining simulation. Octree representation is three dimensional decomposition method. So it is expected that these limitations be overcome by using octree based algorithm. By using the octree model, storage requirement is reduced. And also recursive subdivision was processed in the boundaries, which reduces useless computation. The supersampling method is the most common form of the anti-aliasing and usually used with polygon mesh rendering in computer graphics. Supersampling technique is applied for advancing its efficiency of the octree algorithm.