• Title/Summary/Keyword: Feature Feedback

Search Result 147, Processing Time 0.022 seconds

Finite-horizon Tracking Control for Repetitive Systems with Uncertain Initial Condition (불확실한 초기치를 갖는 반복시스템에 대한 유한구간 추종제어)

  • Choi, Yun-Jong;Yun, Sung-Wook;Lee, Chang-Hee;Cho, Jae-Young;Park, Poo-Gyeon
    • Proceedings of the KIEE Conference
    • /
    • 2007.10a
    • /
    • pp.297-298
    • /
    • 2007
  • Repetitive systems stand for a kind of systems that perform a simple task on a fixed pattern repetitively and are widely spread in industrial fields. Hence, those systems have been of much interests by many researchers, especially in the field of iterative learning control (ILC). In this paper, we propose a finite-horizon tracking control scheme for linear time-varying repetitive systems with uncertain initial conditions. The scheme is derived both analytically and numerically for state-feedback systems and only numerically for output-feedback systems. Then, it is extended to stable systems with input constraints. All numerical schemes are developed in the forms of linear matrix inequalities. A distinguished feature of the proposed scheme from the existing iterative learning control is that the scheme guarantees the tracking performance exactly even under uncertain initial conditions. The simulation results demonstrate the good performance of the proposed scheme.

  • PDF

Sparse decision feedback equalization for underwater acoustic channel based on minimum symbol error rate

  • Wang, Zhenzhong;Chen, Fangjiong;Yu, Hua;Shan, Zhilong
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.13 no.1
    • /
    • pp.617-627
    • /
    • 2021
  • Underwater Acoustic Channels (UAC) have inherent sparse characteristics. The traditional adaptive equalization techniques do not utilize this feature to improve the performance. In this paper we consider the Variable Adaptive Subgradient Projection (V-ASPM) method to derive a new sparse equalization algorithm based on the Minimum Symbol Error Rate (MSER) criterion. Compared with the original MSER algorithm, our proposed scheme adds sparse matrix to the iterative formula, which can assign independent step-sizes to the equalizer taps. How to obtain such proper sparse matrix is also analyzed. On this basis, the selection scheme of the sparse matrix is obtained by combining the variable step-sizes and equalizer sparsity measure. We call the new algorithm Sparse-Control Proportional-MSER (SC-PMSER) equalizer. Finally, the proposed SC-PMSER equalizer is embedded into a turbo receiver, which perform turbo decoding, Digital Phase-Locked Loop (DPLL), time-reversal receiving and multi-reception diversity. Simulation and real-field experimental results show that the proposed algorithm has better performance in convergence speed and Bit Error Rate (BER).

A study on MPEG-7 descriptor combining method using borda count method (Borda count 방법을 이용한 다중 MPEG-7 서술자 조합에 관한 연구)

  • Eom, Min-Young;Choe, Yoon-Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.1 s.307
    • /
    • pp.39-44
    • /
    • 2006
  • In this paper, search result list synthesis method is proposed using borda count method for still image retrieval based on MPEG-7 descriptors. MPEG-7 standardizes descriptors that extract feature information from media data. In many cases, using a single descriptor lacks of correctness, it is suggested to use multiple descriptors to enhance retrieval efficiency. In this paper, retrieval efficiency enhancement is achieved by combining multiple search results which are from each descriptor. In combining search result, newly calculated borda count method is proposed. Comparing current frequency compensated calculation, rank considered frequency compensation is used to score animage in database. This combining method is considered in Content based image retrieval system with relevance feedback algorithm which uses high level information from system user. In each relevance iteration step, adoptive borda count method is used to calculate score of images.

Active Frequency with a Positive Feedback Anti-Islanding Method Based on a Robust PLL Algorithm for Grid-Connected PV PCS

  • Lee, Jong-Pil;Min, Byung-Duk;Kim, Tae-Jin;Yoo, Dong-Wook;Yoo, Ji-Yoon
    • Journal of Power Electronics
    • /
    • v.11 no.3
    • /
    • pp.360-368
    • /
    • 2011
  • This paper proposes an active frequency with a positive feedback in the d-q frame anti-islanding method suitable for a robust phase-locked loop (PLL) algorithm using the FFT concept. In general, PLL algorithms for grid-connected PV PCS use d-q transformation and controllers to make zero an imaginary part of the transformed voltage vector. In a real grid system, the grid voltage is not ideal. It may be unbalanced, noisy and have many harmonics. For these reasons, the d-q transformed components do not have a pure DC component. The controller tuning of a PLL algorithm is difficult. The proposed PLL algorithm using the FFT concept can use the strong noise cancelation characteristics of a FFT algorithm without a PI controller. Therefore, the proposed PLL algorithm has no gain-tuning of a PI controller, and it is hardly influenced by voltage drops, phase step changes and harmonics. Islanding prediction is a necessary feature of inverter-based photovoltaic (PV) systems in order to meet the stringent standard requirements for interconnection with an electrical grid. Both passive and active anti-islanding methods exist. Typically, active methods modify a given parameter, which also affects the shape and quality of the grid injected current. In this paper, the active anti-islanding algorithm for a grid-connected PV PCS uses positive feedback control in the d-q frame. The proposed PLL and anti-islanding algorithm are implemented for a 250kW PV PCS. This system has four DC/DC converters each with a 25kW power rating. This is only one-third of the total system power. The experimental results show that the proposed PLL, anti-islanding method and topology demonstrate good performance in a 250kW PV PCS.

Region-Based Image Retrieval System using Spatial Location Information as Weights for Relevance Feedback (공간 위치 정보를 적합성 피드백을 위한 가중치로 사용하는 영역 기반 이미지 검색 시스템)

  • Song Jae-Won;Kim Deok-Hwan;Lee Ju-Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.4 s.42
    • /
    • pp.1-7
    • /
    • 2006
  • Recently, studies of relevance feedback to increase the performance of image retrieval has been activated. In this Paper a new region weighting method in region based image retrieval with relevance feedback is proposed to reduce the semantic gap between the low level feature representation and the high level concept in a given query image. The new weighting method determines the importance of regions according to the spatial locations of regions in an image. Experimental results demonstrate that the retrieval quality of our method is about 18% in recall better than that of area percentage approach. and about 11% in recall better than that of region frequency weighted by inverse image frequency approach and the retrieval time of our method is a tenth of that of region frequency approach.

  • PDF

Study on Korean Long-lasting Restaurant Model: Use of Qualitative Observation and Research Interview (한국 장수식당의 정성적 모델 연구)

  • Kim, Hee-Sun
    • Journal of the Korean Society of Food Culture
    • /
    • v.26 no.3
    • /
    • pp.211-219
    • /
    • 2011
  • To examine the key success factors for long-lasting restaurants, we visited 10 restaurants with 30 or more than 30 years of tradition, located in Seoul and Gyeonggi-do districts, to research these restaurant menus and customer characteristics by observation and interview. The results were analyzed using descriptive statistics. The outstanding feature noted was that each and every restaurant had its own simple and specialized menu. We found that this feature created a virtuous circle that reinforced itself through a positive feedback loop. The simple and specialized menu increased both the cooking efficiency and food quality while it reduced both food and labor costs, this enabled the customers to eat at an affordable price and have generous servings. This lead to customer satisfaction and revisits to the restaurant, which triggered word-of-mouth referral and expansion of their customer base. This in turn created higher operating profit margins that could be reinvested in the business. The secret recipes for cooking, invented by their founders, were passed on from generation to generation. Their customer base included customers of all ages from children to senior people. And their regular customers consisted of neighboring office workers and families traveling from a long distance. We hope that our findings on long-lasting restaurants, especially of the virtuous cycle created due to the simple and specialized menus with secret recipes, will contribute to the development of Korean style long-lasting restaurant model.

Scalable Collaborative Filtering Technique based on Adaptive Clustering (적응형 군집화 기반 확장 용이한 협업 필터링 기법)

  • Lee, O-Joun;Hong, Min-Sung;Lee, Won-Jin;Lee, Jae-Dong
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.73-92
    • /
    • 2014
  • An Adaptive Clustering-based Collaborative Filtering Technique was proposed to solve the fundamental problems of collaborative filtering, such as cold-start problems, scalability problems and data sparsity problems. Previous collaborative filtering techniques were carried out according to the recommendations based on the predicted preference of the user to a particular item using a similar item subset and a similar user subset composed based on the preference of users to items. For this reason, if the density of the user preference matrix is low, the reliability of the recommendation system will decrease rapidly. Therefore, the difficulty of creating a similar item subset and similar user subset will be increased. In addition, as the scale of service increases, the time needed to create a similar item subset and similar user subset increases geometrically, and the response time of the recommendation system is then increased. To solve these problems, this paper suggests a collaborative filtering technique that adapts a condition actively to the model and adopts the concepts of a context-based filtering technique. This technique consists of four major methodologies. First, items are made, the users are clustered according their feature vectors, and an inter-cluster preference between each item cluster and user cluster is then assumed. According to this method, the run-time for creating a similar item subset or user subset can be economized, the reliability of a recommendation system can be made higher than that using only the user preference information for creating a similar item subset or similar user subset, and the cold start problem can be partially solved. Second, recommendations are made using the prior composed item and user clusters and inter-cluster preference between each item cluster and user cluster. In this phase, a list of items is made for users by examining the item clusters in the order of the size of the inter-cluster preference of the user cluster, in which the user belongs, and selecting and ranking the items according to the predicted or recorded user preference information. Using this method, the creation of a recommendation model phase bears the highest load of the recommendation system, and it minimizes the load of the recommendation system in run-time. Therefore, the scalability problem and large scale recommendation system can be performed with collaborative filtering, which is highly reliable. Third, the missing user preference information is predicted using the item and user clusters. Using this method, the problem caused by the low density of the user preference matrix can be mitigated. Existing studies on this used an item-based prediction or user-based prediction. In this paper, Hao Ji's idea, which uses both an item-based prediction and user-based prediction, was improved. The reliability of the recommendation service can be improved by combining the predictive values of both techniques by applying the condition of the recommendation model. By predicting the user preference based on the item or user clusters, the time required to predict the user preference can be reduced, and missing user preference in run-time can be predicted. Fourth, the item and user feature vector can be made to learn the following input of the user feedback. This phase applied normalized user feedback to the item and user feature vector. This method can mitigate the problems caused by the use of the concepts of context-based filtering, such as the item and user feature vector based on the user profile and item properties. The problems with using the item and user feature vector are due to the limitation of quantifying the qualitative features of the items and users. Therefore, the elements of the user and item feature vectors are made to match one to one, and if user feedback to a particular item is obtained, it will be applied to the feature vector using the opposite one. Verification of this method was accomplished by comparing the performance with existing hybrid filtering techniques. Two methods were used for verification: MAE(Mean Absolute Error) and response time. Using MAE, this technique was confirmed to improve the reliability of the recommendation system. Using the response time, this technique was found to be suitable for a large scaled recommendation system. This paper suggested an Adaptive Clustering-based Collaborative Filtering Technique with high reliability and low time complexity, but it had some limitations. This technique focused on reducing the time complexity. Hence, an improvement in reliability was not expected. The next topic will be to improve this technique by rule-based filtering.

A Deep Belief Network for Electricity Utilisation Feature Analysis of Air Conditioners Using a Smart IoT Platform

  • Song, Wei;Feng, Ning;Tian, Yifei;Fong, Simon;Cho, Kyungeun
    • Journal of Information Processing Systems
    • /
    • v.14 no.1
    • /
    • pp.162-175
    • /
    • 2018
  • Currently, electricity consumption and feedback mechanisms are being widely researched in Internet of Things (IoT) areas to realise power consumption monitoring and management through the remote control of appliances. This paper aims to develop a smart electricity utilisation IoT platform with a deep belief network for electricity utilisation feature modelling. In the end node of electricity utilisation, a smart monitoring and control module is developed for automatically operating air conditioners with a gateway, which connects and controls the appliances through an embedded ZigBee solution. To collect electricity consumption data, a programmable smart IoT gateway is developed to connect an IoT cloud server of smart electricity utilisation via the Internet and report the operational parameters and working states. The cloud platform manages the behaviour planning functions of the energy-saving strategies based on the power consumption features analysed by a deep belief network algorithm, which enables the automatic classification of the electricity utilisation situation. Besides increasing the user's comfort and improving the user's experience, the established feature models provide reliable information and effective control suggestions for power reduction by refining the air conditioner operation habits of each house. In addition, several data visualisation technologies are utilised to present the power consumption datasets intuitively.

Learning Source Code Context with Feature-Wise Linear Modulation to Support Online Judge System (온라인 저지 시스템 지원을 위한 Feature-Wise Linear Modulation 기반 소스코드 문맥 학습 모델 설계)

  • Hyun, Kyeong-Seok;Choi, Woosung;Chung, Jaehwa
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.11 no.11
    • /
    • pp.473-478
    • /
    • 2022
  • Evaluation learning based on code testing is becoming a popular solution in programming education via Online judge(OJ). In the recent past, many papers have been published on how to detect plagiarism through source code similarity analysis to support OJ. However, deep learning-based research to support automated tutoring is insufficient. In this paper, we propose Input & Output side FiLM models to predict whether the input code will pass or fail. By applying Feature-wise Linear Modulation(FiLM) technique to GRU, our model can learn combined information of Java byte codes and problem information that it tries to solve. On experimental design, a balanced sampling technique was applied to evenly distribute the data due to the occurrence of asymmetry in data collected by OJ. Among the proposed models, the Input Side FiLM model showed the highest performance of 73.63%. Based on result, it has been shown that students can check whether their codes will pass or fail before receiving the OJ evaluation which could provide basic feedback for improvements.

Design of an Intelligent Tutoring System based on Web Learning Assessment (웹 학습 평가에 기반한 지능형 교수 시스템의 설계)

  • 최숙영
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.6 no.3
    • /
    • pp.71-78
    • /
    • 2001
  • Since web-based tutoring systems are generally composed with passive and static hypertext, they could not provide adaptive learning environments according to learning ability of each student. In this study, we suggest an intelligent tutoring system, which grasps the learning state of student and provides each student with dynamic learning materials suitable to individual feature based on learning result. It is an agent based system, in which, courseware knowledge for learning is effectively constructed, the proper feedback according to learning assessment is inferred, and it is given to each student.

  • PDF