• Title/Summary/Keyword: Computational approach

Search Result 2,612, Processing Time 0.06 seconds

Degradation of Sulfonamide Antibiotic Substances by Ozonation: An Experimental and Computational Approach (설폰아미드계 항생물질의 오존산화분해에 대한 계산화학적 해석 및 실험적 검증)

  • Won, Jung Sik;Lim, Dong Hee;Seo, Gyu Tae
    • Journal of Korean Society of Environmental Engineers
    • /
    • v.36 no.6
    • /
    • pp.442-450
    • /
    • 2014
  • Concern has grown over a presence of micropollutants in natural water since sulfonamide antibiotic substances such as sulfamethazine, sulfamethoxazole, sulfathiazole have been frequently detected in Nakdong River, Korea. The current work investigates the degradation of the three sulfonamide substances by using quantum chemistry calculations of density functional theory (DFT) and experimental measurement techniques of Fourier transform infrared spectroscopy (FT-IR) and ultraviolet-visible spectrophotometer (UV-VIS). DFT calculations demonstrate that the lowest energy gap between the highest occupied molecular orbital (HOMO) and the lowest unoccupied molecular orbitals (LUMO) lies in sulfanilamide functional group of sulfonamide, implying that the sulfanilamide functional group would be the most active site for ozone oxidation. Also, UV-VIS spectra and FT-IR analysis reveal that 260 nm band originated from sulfanilamide group was absent after ozone oxidation, indicating that a functional group of amine (N-H) was removed from sulfanilamide. Both theoretical and experimental observations agree well with each other, demonstrating the DFT calculation tool can be an alternative tool for the prediction of chemical reactions in purification treatment processes.

Fast Mode Decision Algorithm for Scalable Video Coding (SVC) Using Directional Information of Neighboring Layer (스케일러블 비디오 코딩에서 방향성 정보를 이용한 모드 결정 고속화 기법)

  • Jung, Hyun-Ki;Hong, Kwang-Soo;Kim, Byung-Gyu;Kim, Chang-Ki;Yoo, Jeong-Ju
    • Journal of Broadcast Engineering
    • /
    • v.17 no.1
    • /
    • pp.108-121
    • /
    • 2012
  • As Scalable Video Coding (SVC) is a video compression standard extended from H.264/AVC, it is a way to provide scalability in terms of temporal, spatial and quality. Although the compression efficiency of SVC is increased due to the scalability in many aspect, it is essential to reduce the complexity in order to efficiently use because the complexity is relatively increased. To reduce the complexity of SVC in the paper, we propose fast mode decision algorithm to reduce the complexity of encoding process using direction information of B-picture by efficiently performing inter-layer prediction. The proposed algorithm is a fast mode decision algorithm that makes different from detection mode number of forward and backward, bi-direction in the way using best mode of base-layer up-sampled after simply SKIP mode detection using the direction information of best mode of base-layer up-sampled. The experimental results show that the proposed algorithm approach can achieve the maximum computational time saving about 53% with almost no loss of rate distortion (RD) performance in the enhancement layer.

An Improvement in K-NN Graph Construction using re-grouping with Locality Sensitive Hashing on MapReduce (MapReduce 환경에서 재그룹핑을 이용한 Locality Sensitive Hashing 기반의 K-Nearest Neighbor 그래프 생성 알고리즘의 개선)

  • Lee, Inhoe;Oh, Hyesung;Kim, Hyoung-Joo
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.11
    • /
    • pp.681-688
    • /
    • 2015
  • The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.

Empirical Mode Decomposition using the Second Derivative (이차 미분을 이용한 경험적 모드분해법)

  • Park, Min-Su;Kim, Donghoh;Oh, Hee-Seok
    • The Korean Journal of Applied Statistics
    • /
    • v.26 no.2
    • /
    • pp.335-347
    • /
    • 2013
  • There are various types of real world signals. For example, an electrocardiogram(ECG) represents myocardium activities (contraction and relaxation) according to the beating of the heart. ECG can be expressed as the fluctuation of ampere ratings over time. A signal is a composite of various types of signals. An orchestra (which boasts a beautiful melody) consists of a variety of instruments with a unique frequency; subsequently, each sound is combined to form a perfect harmony. Various research on how to to decompose mixed stationary signals have been conducted. In the case of non-stationary signals, there is a limitation to use methodologies for stationary signals. Huang et al. (1998) proposed empirical mode decomposition(EMD) to deal with non-stationarity. EMD provides a data-driven approach to decompose a signal into intrinsic mode functions according to local oscillation through the identification of local extrema. However, due to the repeating process in the construction of envelopes, EMD algorithm is not efficient and not robust to a noise, and its computational complexity tends to increase as the size of a signal grows. In this research, we propose a new method to extract a local oscillation embedded in a signal by utilizing the second derivative.

Conceptual Design of Automatic Control Algorithm for VMSs (VMS 자동제어 알고리즘 설계)

  • 박은미
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.7
    • /
    • pp.177-183
    • /
    • 2002
  • Current state-of-the-art of VMS control is based upon simple knowledge-based inference engine with message set and each message's priority. And R&Ds of the VMS control are focused on the accurate detection and estimation of traffic condition of the subject roadways. However VMS display itself cannot achieve a desirable traffic allocation among alternative routes in the network In this context, VMS display strategy is the most crucial part in the VMS control. VMS itself has several limitations in its nature. It is generally known that VMS causes overreaction and concentration problems, which may be more serious in urban network than highway network because diversion should be more easily made in urban network. A feedback control algorithm is proposed in this paper to address the above-mentioned issues. It is generally true that feedback control approach requires low computational effort and is less sensitive to models inaccuracy and disturbance uncertainties. Major features of the proposed algorithm are as follows: Firstly, a regulator is designed to attain system optimal traffic allocation among alternative routes for each VMS in the network. Secondly, strategic messages should be prepared to realize the desirable traffic allocation, that is, output of the above regulator. VMS display strategy module is designed in this context. To evaluate Probable control benefit and to detect logical errors of the Proposed feedback algorithm, a offline simulation test is performed using real network in Daejon, Korea.

A Method for Protein Functional Flow Configuration and Validation (단백질 기능 흐름 모델 구성 및 평가 기법)

  • Jang, Woo-Hyuk;Jung, Suk-Hoon;Han, Dong-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.4
    • /
    • pp.284-288
    • /
    • 2009
  • With explosively growing PPI databases, the computational approach for a prediction and configuration of PPI network has been a big stream in the bioinformatics area. Recent researches gradually consider physicochemical properties of proteins and support high resolution results with integration of experimental results. With regard to current research trend, it is very close future to complete a PPI network configuration of each organism. However, direct applying the PPI network to real field is complicated problem because PPI network is only a set of co-expressive proteins or gene products, and its network link means simple physical binding rather than in-depth knowledge of biological process. In this paper, we suggest a protein functional flow model which is a directed network based on a protein functions' relation of signaling transduction pathway. The vertex of the suggested model is a molecular function annotated by gene ontology, and the relations among the vertex are considered as edges. Thus, it is easy to trace a specific function's transition, and it can be a constraint to extract a meaningful sub-path from whole PPI network. To evaluate the model, 11 functional flow models of Homo sapiens were built from KEGG, and Cronbach's alpha values were measured (alpha=0.67). Among 1023 functional flows, 765 functional flows showed 0.6 or higher alpha values.

Q-learning Using Influence Map (영향력 분포도를 이용한 Q-학습)

  • Sung Yun-Sick;Cho Kyung-Eun
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.5
    • /
    • pp.649-657
    • /
    • 2006
  • Reinforcement Learning is a computational approach to learning whereby an agent take an action which maximize the total amount of reward it receives among possible actions within current state when interacting with a uncertain environment. Q-learning, one of the most active algorithm in Reinforcement Learning, is consist of rewards which is obtained when an agent take an action. But it has the problem with mapping real world to discrete states. When state spaces are very large, Q-learning suffers from time for learning. In constant, when the state space is reduced, many state spaces map to single state space. Because an agent only learns single action within many states, an agent takes an action monotonously. In this paper, to reduce time for learning and complement simple action, we propose the Q-learning using influence map(QIM). By using influence map and adjacent state space's learning result, an agent could choose proper action within uncertain state where an agent does not learn. When this paper compares simulation results of QIM and Q-learning, we show that QIM effects as same as Q-learning even thought QIM uses 4.6% of the Q-learning's state spaces. This is because QIM learns faster than Q-learning about 2.77 times and the state spaces which is needed to learn is reduced, so the occurred problem is complemented by the influence map.

  • PDF

Acoustic 2-D Full-waveform Inversion with Initial Guess Estimated by Traveltime Tomography (주시 토모그래피와 음향 2차원 전파형 역산의 적용성에 관한 연구)

  • Han Hyun Chul;Cho Chang Soo;Suh Jung Hee;Lee Doo Sung
    • Geophysics and Geophysical Exploration
    • /
    • v.1 no.1
    • /
    • pp.49-56
    • /
    • 1998
  • Seismic tomography has been widely used as high resolution subsurface imaging techniques in engineering applications. Although most of the techniques have been using travel time inversion, waveform method is being driven forward owing to the progress of computational environments. Although full-waveform inversion method has been known as the best method in terms of model resolving power without high-frequency restriction and weak scattering approximation, it has practical disadvantage that it is apt to get stuck in local minimum if the initial guess is far from the actual model and it consumes so much time to calculate. In this study, 2-D full-waveform inversion algorithm in acoustic medium is developed, which uses result of traveltime tomography as initial model. From the application on synthetic data, it is proved that this approach can efficiently reduce the problem of conventional approaches: our algorithm shows much faster convergence rate and improvement of model resolution. Result of application on physical modeling data also shows much improvement. It is expected that this algorithm can be applicable to real data.

  • PDF

A Study on Optimization of the Global-Correlation-Based Objective Function for the Simultaneous-Source Full Waveform Inversion with Streamer-Type Data (스트리머 방식 탐사 자료의 동시 송신원 전파형 역산을 위한 Global correlation 기반 목적함수 최적화 연구)

  • Son, Woo-Hyun;Pyun, Suk-Joon;Jang, Dong-Hyuk;Park, Yun-Hui
    • Geophysics and Geophysical Exploration
    • /
    • v.15 no.3
    • /
    • pp.129-135
    • /
    • 2012
  • The simultaneous-source full waveform inversion improves the applicability of full waveform inversion by reducing the computational cost. Since this technique adopts simultaneous multi-source for forward modeling, unwanted events remain in the residual seismograms when the receiver geometry of field acquisition is different from that of numerical modeling. As a result, these events impede the convergence of the full waveform inversion. In particular, the streamer-type data with limited offsets is the most difficult data to apply the simultaneous-source technique. To overcome this problem, the global-correlation-based objective function was suggested and it was successfully applied to the simultaneous-source full waveform inversion in time domain. However, this method distorts residual wavefields due to the modified objective function and has a negative influence on the inversion result. In addition, this method has not been applied to the frequency-domain simultaneous-source full waveform inversion. In this paper, we apply a timedamping function to the observed and modeled data, which are used to compute global correlation, to minimize the distortion of residual wavefields. Since the damped wavefields optimize the performance of the global correlation, it mitigates the distortion of the residual wavefields and improves the inversion result. Our algorithm incorporates the globalcorrelation-based full waveform inversion into the frequency domain by back-propagating the time-domain residual wavefields in the frequency domain. Through the numerical examples using the streamer-type data, we show that our inversion algorithm better describes the velocity structure than the conventional global correlation approach does.

Development of Valuation Framework for Estimating the Market Value of Media Contents (미디어 콘텐츠의 시장가치 산정을 위한 가치평가 프레임워크 개발)

  • Sung, Tae-Eung;Park, Hyun-Woo
    • Journal of Service Research and Studies
    • /
    • v.6 no.3
    • /
    • pp.29-40
    • /
    • 2016
  • Since the late 20th century, there has been much effort to improve the market value of media contents which are commercialized in a digital format, by fusing digital data of video, audio, numerals, characters with IT technology together. Then by what criteria and methodologies could the market value for the drama "Sons of the Sun" or the animated film 'Frozen', often referred to in the meida, be estimated? In the circumstances there has been little or no research on the valuation framework of media contents and the status of their valuation system development to date, we propose a practical valuation models for various purposes such as contents trading, review of investment adequacy, etc., by formalizing and presenting a contents valuation framework for the four types of media of movies, online games, and broadcasting commercials, and animations. Therefore, we develope computational methods of cash flows which includes production cost by media content types, provide reference databases associated with key variables of valuation (economic life cycle, discount rates, contents contribution and royalty rates), and finally propose the valuation framework of media contents based on both income approach and relief-from-royalty method which has been applied to valuation of intangible assets so far.