• Title/Summary/Keyword: 축소 시스템 기법

Search Result 244, Processing Time 0.026 seconds

Substructuring-Based Structural Reanalysis by Global-Local Approximations (전역-부분 근사화에 의한 부구조화 기반 구조재해석)

  • 서상구;김경일;황충열;황진하
    • Computational Structural Engineering
    • /
    • v.9 no.1
    • /
    • pp.141-149
    • /
    • 1996
  • Efficient approximate reanalysis techniques based on substructuring are presented. In most optimal design problems, the analysis precedure must be repeated many times. In particular, one of the main obstacles in the structural optimization systems is high computational cost and time required for the repeated analysis of large-scale structural systems. The purpose of this paper is to show how to evaluate efficiently the sturctural behavior of new designs using information from the previous ones, instead of the multiple repeated analysis of basic equations for successive modification in the optimal design. The proposed reanalysis method is a combined Taylor series expansion and reduced basis method based on substructuring. Several numerical examples illustrate the effectiveness of the method.

  • PDF

Study on the Development of Diagnosis Algorithm for Induction Motor Using Current and Magnetic Flux Sensors (전류 및 자속센서를 이용한 유도전동기 예방진단 알고리즘 개발에 관한 연구)

  • Han, Sang-Bo
    • Journal of IKEEE
    • /
    • v.23 no.4
    • /
    • pp.1157-1165
    • /
    • 2019
  • This paper discussed the results of the development and application of the machine learning algorithm to the induction motor for the preventive diagnostic system using current and magnetic flux signals. The optimal 29 features were extracted for identifying faulted types of induction motor. In particular, any load rate was derived using the tendency of the difference value from the center of the 7th harmonic frequency to the sideband of the current signal, and the corresponding classification accuracy showed about 84.6% by the KPCA feature reduction technique and the k-NN determination algorithm.

A Study on Trend Sharing in Segmental-feature HMM (분절 특징 은닉 마코프 모델에서의 경향 공유에 관한 연구)

  • 윤영선
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.7
    • /
    • pp.641-647
    • /
    • 2002
  • In this paper, we propose the reduction method of the number of parameters in the segmental-feature HMM using trend quantization method. The proposed method shares the trend information of the polynomial trajectories by quantization. The trajectory is obtained by the sequence of feature vectors of speech signals and can be divided by trend and location information. The trend indicates the variation of consequent frame features, while the location points to the positional difference of the trajectories. Since the trend occupies the large portion of SFHMM, if the trend is shared, the number of parameters maybe decreases. To exploit the proposed system the experiments are performed on TIMIT corpus. The experimental results show that the performance of the proposed system is roughly similar to that of previous system. Therefore, the proposed system can be considered one of parameter reduction method.

Classifying Windows Executables using API-based Information and Machine Learning (API 정보와 기계학습을 통한 윈도우 실행파일 분류)

  • Cho, DaeHee;Lim, Kyeonghwan;Cho, Seong-je;Han, Sangchul;Hwang, Young-sup
    • Journal of KIISE
    • /
    • v.43 no.12
    • /
    • pp.1325-1333
    • /
    • 2016
  • Software classification has several applications such as copyright infringement detection, malware classification, and software automatic categorization in software repositories. It can be also employed by software filtering systems to prevent the transmission of illegal software. If illegal software is identified by measuring software similarity in software filtering systems, the average number of comparisons can be reduced by shrinking the search space. In this study, we focused on the classification of Windows executables using API call information and machine learning. We evaluated the classification performance of machine learning-based classifier according to the refinement method for API information and machine learning algorithm. The results showed that the classification success rate of SVM (Support Vector Machine) with PolyKernel was higher than other algorithms. Since the API call information can be extracted from binary executables and machine learning-based classifier can identify tampered executables, API call information and machine learning-based software classifiers are suitable for software filtering systems.

Robust Speed Control Scheme for Torsional Vibration Suppression of Two Mass System (이관성계 전동기 구동시스템의 축진동억제를 위한 강인한 속도제어기법)

  • 박태식;유지윤
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.8 no.1
    • /
    • pp.80-88
    • /
    • 2003
  • In this paper, the new robust torsional vibration suppression control scheme is proposed for the two mass system. A reduced order state feedback controller where the motor speed and the observed torsional torque are fed back and the PI controller are proposed as the torsional vibration suppression controller. Using the estimated mechanical parameters by off-line RLS(Recursive Least Square) algorithms, the speed controller for torsional vibration suppression is designed and its gains are determined using the Kharitonov robust control theory. The Kharitonov robust control theory can obtain the robust stability with a specified stability margin and a damping limit and the good performance of vibration suppression although if the parameters are varied within some specified limit. The effectiveness and usefulness of the proposed schemes are verified with the simulation and the experimental results on the fully-digitalized 5.5kW two mass system.

Probability-based Pre-fetching Method for Multi-level Abstracted Data in Web GIS (웹 지리정보시스템에서 다단계 추상화 데이터의 확률기반 프리페칭 기법)

  • 황병연;박연원;김유성
    • Spatial Information Research
    • /
    • v.11 no.3
    • /
    • pp.261-274
    • /
    • 2003
  • The effective probability-based tile pre-fetching algorithm and the collaborative cache replacement algorithm are able to reduce the response time for user's requests by transferring tiles which will be used in advance and determining tiles which should be removed from the restrictive cache space of a client based on the future access probabilities in Web GISs(Geographical Information Systems). The Web GISs have multi-level abstracted data for the quick response time when zoom-in and zoom-out queries are requested. But, the previous pre-fetching algorithm is applied on only two-dimensional pre-fetching space, and doesn't consider expanded pre-fetching space for multi-level abstracted data in Web GISs. In this thesis, a probability-based pre-fetching algorithm for multi-level abstracted in Web GISs was proposed. This algorithm expanded the previous two-dimensional pre-fetching space into three-dimensional one for pre-fetching tiles of the upper levels or lower levels. Moreover, we evaluated the effect of the proposed pre-fetching algorithm by using a simulation method. Through the experimental results, the response time for user requests was improved 1.8%∼21.6% on the average. Consequently, in Web GISs with multi-level abstracted data, the proposed pre-fetching algorithm and the collaborative cache replacement algorithm can reduce the response time for user requests substantially.

  • PDF

A New Face Tracking Method Using Block Difference Image and Kalman Filter in Moving Picture (동영상에서 칼만 예측기와 블록 차영상을 이용한 얼굴영역 검출기법)

  • Jang, Hee-Jun;Ko, Hye-Sun;Choi, Young-Woo;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.2
    • /
    • pp.163-172
    • /
    • 2005
  • When tracking a human face in the moving pictures with complex background under irregular lighting conditions, the detected face can be larger including background or smaller including only a part of the face. Even background can be detected as a face area. To solve these problems, this paper proposes a new face tracking method using a block difference image and a Kalman estimator. The block difference image allows us to detect even a small motion of a human and the face area is selected using the skin color inside the detected motion area. If the pixels with skin color inside the detected motion area, the boundary of the area is represented by a code sequence using the 8-neighbor window and the head area is detected analysing this code. The pixels in the head area is segmented by colors and the region most similar with the skin color is considered as a face area. The detected face area is represented by a rectangle including the area and its four vertices are used as the states of the Kalman estimator to trace the motion of the face area. It is proved by the experiments that the proposed method increases the accuracy of face detection and reduces the fare detection time significantly.

A Location Management Scheme Using Gateway in PCN (PCN에서 VLR 게이트웨이를 이용한 위치관리 기법)

  • 박남식;유영철;남궁한;진성일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.8B
    • /
    • pp.1444-1455
    • /
    • 1999
  • In the standard location strategy such as IS-41 and GSM, Home Location Register(HLR) and Visitor Location Register(VLR) databases are used to manage the location of mobile terminals. The primary goal that location management schemes investigate is to reduce the cost of database access and the traffic for signaling network. When mobile terminals move frequently, one of problems in the standard location management scheme is that HLR database is highly updated and the traffic in signaling network can be occurred significantly due to high message transfer rate between HRL and VLR. As a solution to these problems, this paper proposes the location management scheme using VLR Gateway(VG) to reduce the both traffics of HLR update and signaling network which are resulted from location registration requirements of mobile terminals whenever they cross their registration area boundary. VG is a kind of database that is placed between HLR and VLR. It integrates one or more registration area defined in a system into one group and plays a role on behalf of HLR in a integrated registration scope so that the call delivery and the movement of mobile terminals are possible without HLR access in the scope. In order to evaluate performance of IS-41 and proposed scheme, we simulate two schemes based on wide range of call to mobility ratio. Its experiment result shows that in the proposed scheme total database cost increased slightly whereas HLR and signaling traffic decreased remarkably.

  • PDF

Code Size Reduction Through Efficient use of Multiple Load/store Instructions (복수의 메모리 접근 명령어의 효율적인 이용을 통한 코드 크기의 감소)

  • Ahn Minwook;Cho Doosan;Paek Yunheung;Cho Jeonghun
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.8
    • /
    • pp.819-833
    • /
    • 2005
  • Code size reduction is ever becoming more important for compilers targeting embedded processors because these processors are often severely limited by storage constraints and thus the reduced code size can have a positively significant Impact on their performance. Various code size reduction techniques have different motivations and a variety of application contexts utilizing special hardware features of their target processors. In this work, we propose a novel technique that fully utilizes a set of hardware instructions, called the multiple load/store (MLS), that are specially featured for reducing code size by minimizing the number of memory operations in the code. To take advantage of this feature, many microprocessors support the MLS instructions, whereas no existing compilers fully exploit the potential benefit of these instructions but only use them for some limited cases. This is mainly because optimizing memory accesses with MLS instructions for general cases is an NP-hard problem that necessitates complex assignments of registers and memory off-sets for variables in a stack frame. Our technique uses a couple of heuristics to efficiently handle this problem in a polynomial time bound.

A Study on Parallel Operation of PWM Converter for Auxiliary Power Supply of High Speed Train (고속전철 보조전원장치용 PWM 컨버터의 병렬운전에 관한 연구)

  • Kim, Yeon-Chung;O, Geun-U;Won, Chung-Yeon;Choe, Jong-Muk;Gi, Sang-U
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.37 no.6
    • /
    • pp.64-72
    • /
    • 2000
  • This paper deals with the parallel operation of two PWM converters for auxiliary block of high speed train. The parallel operation of AC/DC PWM converter controlled by 3-level PWM switching method to operate switching devices to realize a high power factor and reduce the primary side of the transformer current harmonics is proposed. In this paper, it is presented the phase shift technique between two converters switching phase, solution to eliminate the coupling effects due to the transformer and zero crossing detection method for synchronized with the source and controller. Experimental results for laboratory system with TMS320C31 microprocessor and 10[kVA]PWM converter confirm the validity of the proposed algorithm.

  • PDF