• Title/Summary/Keyword: real number domain

Search Result 120, Processing Time 0.025 seconds

Visualizer for real number domain data and its applications (실수 정의역 데이터 시각화와 그 응용 사례)

  • Lee, Sung-Ho;Park, Tae-Jung;Kam, Hyeong-Ryeol;Kim, Chang-Hun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.16 no.4
    • /
    • pp.17-23
    • /
    • 2010
  • Effective visualizing is an important issue when one processing real number domain volume data such as distance fields, or volume texture. In this paper, we introduce a framework for inspecting, magnifying, cross-section viewing of real number domain volume data from an implementation of a simple interface. The interface can be freely implemented from any kind of existing algorithm, so that we can easily view the result and evaluate the algorithm.

Real-Tim Sound Field Effect Implementation Using Block Filtering and QFT (Block Filtering과 QFT를 이용한 실시간 음장 효과구현)

  • Sohn Sung-Yong;Seo Jeongil;Hahn Minsoo
    • MALSORI
    • /
    • no.51
    • /
    • pp.85-98
    • /
    • 2004
  • It is almost impossible to generate the sound field effect in real time with the time-domain linear convolution because of its large multiplication operation requirement. To solve this, three methods are introduced to reduce the number of multiplication operations in this paper. Firstly, the time-domain linear convolution is replaced with the frequency-domain circular convolution. In other words, the linear convolution result can be derived from that of the circular convolution. This technique reduces the number of multiplication operations remarkably, Secondly, a subframe concept is introduced, i.e., one original frame is divided into several subframes. Then the FFT is executed for each subframe and, as a result, the number of multiplication operations can be reduced. Finally, the QFT is used in stead of the FFT. By combining all the above three methods into our final the SFE generation algorithm, the number of computations are reduced sufficiently and the real-time SFE generation becomes possible with a general PC.

  • PDF

Experimental identification of nonlinear model parameter by frequency domain method (주파수영역방법에 의한 비선형 모델변수의 실험적 규명)

  • Kim, Won-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.22 no.2
    • /
    • pp.458-466
    • /
    • 1998
  • In this work, a frequency domain method is tested numerically and experimentally to improve nonlinear model parameters using the frequency response function at the nonlinear element connected point of structure. This method extends the force-state mapping technique, which fits the nonlinear element forces with time domain response data, into frequency domain manipulations. The force-state mapping method in the time domain has limitations when applying to complex real structures because it needd a time domain lumped parameter model. On the other hand, the frequency domain method is relatively easily applicable to a complex real structure having nonlinear elements since it uses the frequency response function of each substurcture. Since this mehtod is performed in frequency domain, the number of equations required to identify the unknown parameters can be easily increased as many as it needed, just by not only varying excitation amplitude bot also selecting excitation frequency domain method has some advantages over the classical force-state mapping technique in the number of data points needed in curve fit and the sensitivity to response noise.

Diagnosis of a Pump by Frequency Analysis of Operation Sound (펌프의 작동음 주파수 분석에 의한 진단)

  • 이신영;박순재
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2003.10a
    • /
    • pp.137-142
    • /
    • 2003
  • A fundamental study for developing a system of fault diagnosis of a pump is performed by using neural network. The acoustic signals were obtained and converted to frequency domain for normal products and artificially deformed products. The signals were obtained in various driving frequencies in order to obtain many types of data from a limited number of pumps. The acoustic data in frequency domain were managed to multiples of real driving frequency with the aim of easy comparison. The neural network model used in this study was 3-layer type composed of input, hidden, and output layer. The normalized amplitudes at the multiples of real driving frequency were chosen as units of input layer, Various sets of teach signals made from original data by eliminating some random cases were used in the training. The average errors were approximately proportional to the number of untaught data. The results showed neural network trained by acoustic signals can be used as a simple method far a detection of machine malfunction or fault diagnosis.

  • PDF

Diagnosis of a Pump by Frequency Analysis of Operation Sound (펌프의 작동음 주파수 분석에 의한 진단)

  • Lee Sin-Young
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.13 no.5
    • /
    • pp.81-86
    • /
    • 2004
  • A fundamental study for developing a system of fault diagnosis of a pump is performed by using neural network. The acoustic signals were obtained and converted to frequency domain for normal products and artificially deformed products. The signals were obtained in various driving frequencies in order to obtain many types of data from a limited number of pumps. The acoustic data in frequency domain were managed to multiples of real driving frequency with the aim of easy comparison. The neural network model used in this study was 3-layer type composed of input, hidden, and output layer. The normalized amplitudes at the multiples of real driving frequency were chosen as units of input layer. Various sets of teach signals made from original data by eliminating some random cases were used in the training. The average errors were approximately proportional to the number of untaught data. The results showed neural network trained by acoustic signals can be used as a simple method for a detection of machine malfuction or fault diagnosis.

Computational Complexity Comparison of Second-Order Volterrra Filtering Algorithms

  • Im, Sungin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.2E
    • /
    • pp.38-46
    • /
    • 1997
  • The objective of the paper is to compare the computational complexity of five algorithms for computing time-domain second-order Volterra filter outputs in terms of number of real multiplication and addition operations required for implementation. This study shows that if the filter memory length is greater that or equal to 16, the fast algorithm using the overlap-save method and the frequency-domain symmetry properties of the quadratic coefficients is the most efficient among the algorithms investigated in this paper, When the filter memory length is less than 16, the algorithm using the time-domain symmetry properties is better than any other algorithm.

  • PDF

Selecting and scaling ground motion time histories according to Eurocode 8 and ASCE 7-05

  • Ergun, Mustafa;Ates, Sevket
    • Earthquakes and Structures
    • /
    • v.5 no.2
    • /
    • pp.129-142
    • /
    • 2013
  • Linear and nonlinear time history analyses have been becoming more common in seismic analysis and design of structures with advances in computer technology and earthquake engineering. One of the most important issues for such analyses is the selection of appropriate acceleration time histories and matching these histories to a code design acceleration spectrum. In literature, there are three sources of acceleration time histories: artificial records, synthetic records obtained from seismological models and accelerograms recorded in real earthquakes. Because of the increase of the number of strong ground motion database, using and scaling real earthquake records for seismic analysis has been becoming one of the most popular research issues in earthquake engineering. In general, two methods are used for scaling actual earthquake records: scaling in time domain and frequency domain. The objective of this study is twofold: the first is to discuss and summarize basic methodologies and criteria for selecting and scaling ground motion time histories. The second is to analyze scaling results of time domain method according to ASCE 7-05 and Eurocode 8 (1998-1:2004) criteria. Differences between time domain method and frequency domain method are mentioned briefly. The time domain scaling procedure is utilized to scale the available real records obtained from near fault motions and far fault motions to match the proposed elastic design acceleration spectrum given in the Eurocode 8. Why the time domain method is preferred in this study is stated. The best fitted ground motion time histories are selected and these histories are analyzed according to Eurocode 8 (1998-1:2004) and ASCE 7-05 criteria. Also, characteristics of both near fault ground motions and far fault ground motions are presented by the help of figures. Hence, we can compare the effects of near fault ground motions on structures with far fault ground motions' effects.

Derivation of Real Values from Imaginary Roots by Altering Prescribed Positions in the Precision Point Synthesis of Mechanisms (정밀점 기구합성시 지정위치의 변경을 이용한 허근의 실수화 방법)

  • 이태영;심재경;이재길
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.7
    • /
    • pp.196-202
    • /
    • 2000
  • In the precision point synthesis of mechanisms, it is usually required to solve a system of polynomial equations. With the aid of efficient algorithms such as elimination, it is possible to obtain all the solutions of the equations in the complex domain. But among these solutions only real values can be used fur real mechanisms, while imaginary ones are liable to be discarded. In this article, a method is presented, which leads the imaginary solutions to real domain permitting slight alteration of prescribed positions and eventually increases the number of feasible mechanisms satisfying the desired motion approximately. Two synthesis problems of planar 4-bar path generation and spatial 7-bar motion generation are given to verify the proposed method.

  • PDF

Recognition of Car License Plate using Kohonen Algorithm

  • Lim, Eun-Kyoung;Yang, Hwang-Kyu;Kwang Baek kim
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.785-788
    • /
    • 2000
  • The recognition system of a car plate is largely classified as the extraction and recognition of number plate. In this paper, we extract the number plate domain by using a thresholding method as a preprocess step. The computation of the density in a given mask provides a clue of a candidate domain whose density ratio corresponds to the properties of the number plate obtained in the best condition. The contour of the number plate for the recognition of the texts of number plate is extracted by operating Kohonen Algorithm in a localized region. The algorithm reduces noises around the contour. The recognition system with the density computation and Kohonen Algorithm shows a high performance in the real system in connection with a car number plate.

  • PDF

Automatic Acquisition of Domain Concepts for Ontology Learning using Affinity Propagation (온톨로지 학습을 위한 Affinity Propagation 기반의 도메인 컨셉 자동 획득 기법에 관한 연구)

  • Qasim, Iqbal;Jeong, Jin-Woo;Lee, Dong-Ho
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06c
    • /
    • pp.168-171
    • /
    • 2011
  • One important issue in semantic web is identification and selection of domain concepts for domain ontology learning when several hundreds or even thousands of terms are extracted and available from relevant text documents shared among the members of a domain. We present a novel domain concept acquisition and selection approach for ontology learning that uses affinity propagation algorithm, which takes as input semantic and structural similarity between pairs of extracted terms called data points. Real-valued messages are passed between data points (terms) until high quality set of exemplars (concepts) and cluster iteratively emerges. All exemplars will be considered as domain concepts for learning domain ontologies. Our empirical results show that our approach achieves high precision and recall in selection of domain concepts using less number of iterations.