• Title/Summary/Keyword: adaptive model

Search Result 2,837, Processing Time 0.032 seconds

Parameter Estimation and Control for Apparatus of Container Crane;An Experimental Approach (모형 컨테이너 크레인의 파라미터 추정 및 제어;실험적 접근)

  • Lee, Yun-Hyung;Jin, Gang-Gyoo;So, Myung-Ok
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2007.12a
    • /
    • pp.304-306
    • /
    • 2007
  • In this paper, we presents a scheme for the parameter estimation and optimal control scheme for apparatus of container crane system. For parameter estimation, first, we construct the open loop of the container crane system and estimate its parameters based on input-output data, a real-coded genetic algorithm(RCGA) and the model adjustment technique. The RCGA plays an important role in parameter estimation as an adaptive mechanism. For controller design, state feedback gain matrix is searched by another RCGA and the estimated model. The performance of the proposed methods are demonstrated through a set of simulation and experiments of the experimental apparatus.

  • PDF

Development of an Interface Module with a Microscopic Simulation Model for COSMOS Evaluation (미시적 시뮬레이터를 이용한 실시간 신호제어시스템(COSMOS) 평가 시뮬레이션 환경 개발)

  • Song, Sung-Ju;Lee, Seung-Hwan;Lee, Sang-Soo
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.2 s.73
    • /
    • pp.95-102
    • /
    • 2004
  • The COSMOS is an adaptive traffic control systems that can adjust signal timing parameters in response to various traffic conditions. To evaluate the performance of the COSMOS systems, the field study is only practical option because any evaluation tools are not available. To overcome this limitation, a newly integrated interfacing simulator between a microscopic simulation program and COSMOS was developed. In this paper, a detector module and a signal timing module as well as general feature of the simulator were described. A validation test was performed to verify the accuracy of the data flow within the simulator. It was shown that the accuracy level of information from the simulator was high enough for real application. Several practical comments on further studies were also included to enhance the functional specifications of the simulator.

3D Markov chain based multi-priority path selection in the heterogeneous Internet of Things

  • Wu, Huan;Wen, Xiangming;Lu, Zhaoming;Nie, Yao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5276-5298
    • /
    • 2019
  • Internet of Things (IoT) based sensor networks have gained unprecedented popularity in recent years. With the exponential explosion of the objects (sensors and mobiles), the bandwidth and the speed of data transmission are dwarfed by the anticipated emergence of IoT. In this paper, we propose a novel heterogeneous IoT model integrated the power line communication (PLC) and WiFi network to increase the network capacity and cope with the rapid growth of the objects. We firstly propose the mean transmission delay calculation algorithm based the 3D Markov chain according to the multi-priority of the objects. Then, the attractor selection algorithm, which is based on the adaptive behavior of the biological system, is exploited. The combined the 3D Markov chain and the attractor selection model, named MASM, can select the optimal path adaptively in the heterogeneous IoT according to the environment. Furthermore, we verify that the MASM improves the transmission efficiency and reduce the transmission delay effectively. The simulation results show that the MASM is stable to changes in the environment and more applicable for the heterogeneous IoT, compared with the other algorithms.

An evolutionary fuzzy modelling approach and comparison of different methods for shear strength prediction of high-strength concrete beams without stirrups

  • Mohammadhassani, Mohammad;Nezamabadi-pour, Hossein;Suhatril, Meldi;shariati, Mahdi
    • Smart Structures and Systems
    • /
    • v.14 no.5
    • /
    • pp.785-809
    • /
    • 2014
  • In this paper, an Adaptive nerou-based inference system (ANFIS) is being used for the prediction of shear strength of high strength concrete (HSC) beams without stirrups. The input parameters comprise of tensile reinforcement ratio, concrete compressive strength and shear span to depth ratio. Additionally, 122 experimental datasets were extracted from the literature review on the HSC beams with some comparable cross sectional dimensions and loading conditions. A comparative analysis has been carried out on the predicted shear strength of HSC beams without stirrups via the ANFIS method with those from the CEB-FIP Model Code (1990), AASHTO LRFD 1994 and CSA A23.3 - 94 codes of design. The shear strength prediction with ANFIS is discovered to be superior to CEB-FIP Model Code (1990), AASHTO LRFD 1994 and CSA A23.3 - 94. The predictions obtained from the ANFIS are harmonious with the test results not accounting for the shear span to depth ratio, tensile reinforcement ratio and concrete compressive strength; the data of the average, variance, correlation coefficient and coefficient of variation (CV) of the ratio between the shear strength predicted using the ANFIS method and the real shear strength are 0.995, 0.014, 0.969 and 11.97%, respectively. Taking a look at the CV index, the shear strength prediction shows better in nonlinear iterations such as the ANFIS for shear strength prediction of HSC beams without stirrups.

Hierarchical Ann Classification Model Combined with the Adaptive Searching Strategy (적응적 탐색 전략을 갖춘 계층적 ART2 분류 모델)

  • 김도현;차의영
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.7_8
    • /
    • pp.649-658
    • /
    • 2003
  • We propose a hierarchical architecture of ART2 Network for performance improvement and fast pattern classification model using fitness selection. This hierarchical network creates coarse clusters as first ART2 network layer by unsupervised learning, then creates fine clusters of the each first layer as second network layer by supervised learning. First, it compares input pattern with each clusters of first layer and select candidate clusters by fitness measure. We design a optimized fitness function for pruning clusters by measuring relative distance ratio between a input pattern and clusters. This makes it possible to improve speed and accuracy. Next, it compares input pattern with each clusters connected with selected clusters and finds winner cluster. Finally it classifies the pattern by a label of the winner cluster. Results of our experiments show that the proposed method is more accurate and fast than other approaches.

Adaptive Initial QP Determination Algorithm for Low Bit Rate Video Coding (저전송률 비디오 압축에서 적응적 초기 QP 결정 알고리즘)

  • Park, Sang-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.1957-1964
    • /
    • 2010
  • In Video coding, the first frame is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the intial QP for the first frame of GOP affects the first frame as well as the following frames. Traditionally, the initial QP of a GOP is determined by the initial QP of the previous GOP and the average QP of the inter mode frames. In case of JM, the initial QP of a GOP is adjusted as the initial QP being less than the average QP of inter mode frames by two. However, this method is not suitable for the low bit rate video coding. In this paper, the linear relationship between the optimal QP and the ratio of the PSNR of the first frame and the average PSNR of the inter mode frames is first investigated and the linear model is proposed based on the results of the investigation. The proposed model calculate the optimal initial QP using the encoding results of the previous GOP. It is shown by experimental results that the new algorithm can predict the optimal initial QP more accurately and generate the PSNR performance better than that of the existing JM algorithm.

Memory Management Model Using Combined ART and Fuzzy Logic (ART와 퍼지를 이용한 메모리 관리 모델)

  • Kim, Joo-Hoon;Kim, Seong-Joo;Choi, Woo-Kyung;Kim, Jong-Soo;Jeon, Hong-Tae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.7
    • /
    • pp.920-926
    • /
    • 2004
  • The human being receives a new information from outside and the information shows gradual oblivion with time. But the information remains in memory and isn't forgotten for a long time if the information is read several times over. For example, we assume that we memorize a telephone number when we listen and never remind we may forget it soon, but we commit to memory long time by repeating. If the human being received new information with strong stimulus, it could remain in memory without recalling repeatedly. The moments of almost losing one's life in an accident or getting a stroke of luck are rarely forgiven. The human being can keep memory for a long time in spite of the limit of memory for the mechanism mentioned above. In this paper, we propose a model to explain the mechanism mentioned above using a neural network and fuzzy.

Performance Evaluation of Deferrd Locking for Maintaining Transactional Cache Consistency (트랜잭션 캐쉬 일관성을 유지하기 위한 지연 로킹 기법의 성능 평가)

  • Kwon, Hyeok-Min
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2310-2326
    • /
    • 2000
  • Client-server DBMS based on a data-shipping model can exploit e1ient resources effectively by allowing inter-transaction caching. However, inter-transaction caching raises the need of transactional cache consistency maintenancetTCCM protocol. since each client is able to cache a portion of the database dynamically. Deferred locking(DL) is a new detection-based TCCM scheme designed on the basis of a primary copy locking algorithm. In DL, a number of lock ,ujuests and a data shipping request are combined into a single message packet to minimize the communication overhead required for consistency checking. Lsing a simulation model. the performance of the prolxlsed scheme is compared with those of two representative detection based schemes, the adaptive optimistic concurrency control and the caching two-phase locking. The performance results indicate that DL improves the overall system throughput with a reasonable transaction abort ratio over other detection - based schemes.

  • PDF

Face and Hand Tracking Algorithm for Sign Language Recognition (수화 인식을 위한 얼굴과 손 추적 알고리즘)

  • Park, Ho-Sik;Bae, Cheol-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11C
    • /
    • pp.1071-1076
    • /
    • 2006
  • In this paper, we develop face and hand tracking for sign language recognition system. The system is divided into two stages; the initial and tracking stages. In initial stage, we use the skin feature to localize face and hands of signer. The ellipse model on CbCr space is constructed and used to detect skin color. After the skin regions have been segmented, face and hand blobs are defined by using size and facial feature with the assumption that the movement of face is less than that of hands in this signing scenario. In tracking stage, the motion estimation is applied only hand blobs, in which first and second derivative are used to compute the position of prediction of hands. We observed that there are errors in the value of tracking position between two consecutive frames in which velocity has changed abruptly. To improve the tracking performance, our proposed algorithm compensates the error of tracking position by using adaptive search area to re-compute the hand blobs. The experimental results indicate that our proposed method is able to decrease the prediction error up to 96.87% with negligible increase in computational complexity of up to 4%.

A Fast Inter Prediction Encoding Technique for Real-time Compression of H.264/AVC (H.264/AVC의 실시간 압축을 위한 고속 인터 예측 부호화 기술)

  • Kim, Young-Hyun;Choi, Hyun-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11C
    • /
    • pp.1077-1084
    • /
    • 2006
  • This paper proposed a fast algorithm to reduce the amount of calculation for inter prediction which takes a great deal of the operational time in H.264/AVC. This algorithm decides a search range according to the direction of predicted motion vector, and then performs an adaptive spiral search for the candidates with JM(Joint Model) FME(Fast Motion Estimation) which employs the rate-distortion optimization(RDO) method. Simultaneously, it decides a threshold cost value for each of the variable block sizes and performs the motion estimation for the variable search ranges with the threshold. These activities reduce the great amount of the complexity in inter prediction encoding. Experimental results by applying the proposed method .to various video sequences showed that the process time was decreased up to 80% comparing to the previous prediction methods. The degradation of video quality was only from 0.05dB to 0.19dB and the compression ratio decreased as small as 0.58% in average. Therefore, we are sure that the proposed method is an efficient method for the fast inter prediction.