• Title/Summary/Keyword: SEQUENTIAL METHOD

Search Result 1,781, Processing Time 0.022 seconds

Development of a Programming System for Sequential Control Using a Graphic Organization Language (그래픽 조직 언어를 이용한 순차 제어용 프로그래밍 시스템 개발)

  • Kuk, Kum-Hoan
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.13 no.4
    • /
    • pp.24-33
    • /
    • 1996
  • PLCs are vital components of modern automation systems, which have penetrated into almost every industry. Many industries have a demand for facilitation of PLC programming. In this study, a programning system for sequential control is developed on a personal computer. This programming system consists of two main parts, a GRAFCET editor and a GRAFCET compiler. The GRAFCET editor enables us to model an actual sequential process by a GRAFCET diagram. This GRAFCET editor is developed by the menu-driven method based on specific menus and graphic symbols. The GRAFCET compiler consists of two parts, a GRAFCET parser and a code generator. The possible errors in a drawn GRAFCET diagram are first checked by the GRAFCET parser which generates finally an intermediate code from a verified CRAFCET diagram. Then the intermediate code is converted into a control code of an actual sequential controller by the code generator. To show the usefulness of this programming system, this system is applied to a pneumatically controlled handling robot. For this robot, a Z-80 microprocessor is used as the actual sequential controller.

  • PDF

Using the Finite Element Method, 3 Dimensional FE Analysis of Residual Stress by Cold Expansion Method in the Plate Baying Adjacent Holes (인접홀에서 홀확장법 적용시, 유한요소법을 이용한 잔류응력해석)

  • Yang Won-Ho;Cho Myoung-Rae;Jang Jae-Soon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.5 s.248
    • /
    • pp.528-532
    • /
    • 2006
  • In the aerospace industry, Cold expansion has been used the most important method that is retarded of crack initiation from fastener hole surface. Cold expansion method(CEM) is that a oversized tapered mandrel goes through the hole in order to develop a compressive residual stress as the passing of the mandrel around the hole. Therefore, because of characteristic of mandrel inserting, Residual Stress Distributions (RSD) are differently generated form Entry, Mid and Exit position of the plate. Also, it is respected that RSD are changed as distances between holes. In this paper, It is performed a FE analysis of RSD by CEM and it is respectively shown RSD in the Entry, Mid and Exit position. It is compared residual stress results form the cold expansion in these two cases: the concurrent CEM and the sequential CEM. From this research, it has been found that compressive residual stress of Entry position is lower than other positions. Also, the concurrent CE of adjacent holes leads to much higher compressive residual stress than the sequential CE. In addition, in the sequential CE case, a compressive RSD of 1 step's hole around is lower than compressive RSD of 2 step's hole around.

Sequential Approximate Optimization Based on a Pure Quadratic Response Surface Method with Noise Filtering (노이즈 필터링을 적용한 반응표면 기반 순차적 근사 최적화)

  • Lee Yongbin;Lee Ho-Jun;Kim Min-Soo;Choi Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.6 s.237
    • /
    • pp.842-851
    • /
    • 2005
  • In this paper, a new method for constrained optimization of noisy functions is proposed. In approximate optimization using response surface methods, if constraints have severe noise, the approximate feasible region defined by approximate constraints is apt to include some of the infeasible region defined by actual constraints. This can cause the approximate optimum to converge into the infeasible region. In the proposed method, the approximate optimization is performed with the approximate constraints shifted by their deviations, which are calculated using a diagonal quadratic response surface method. This can prevent the approximate optimum from converging into the infeasible region. To fit the objective and constraints into diagonal quadratic models, we select the center and 4 additional points along each axis of design variables as experimental points. The deviation of each function is calculated using the differences between the real and approximate function values at the experimental points. A sequential approximate optimization technique based on the trust region algorithm is adopted to manage approximate models. The proposed approach is validated by solving some design problems. The results of the problems show the effectiveness of the proposed method.

Trend-based Sequential Pattern Discovery from Time-Series Data (시계열 데이터로부터의 경향성 기반 순차패턴 탐색)

  • 오용생;이동하;남도원;이전영
    • Journal of Intelligence and Information Systems
    • /
    • v.7 no.1
    • /
    • pp.27-45
    • /
    • 2001
  • Sequential discovery from time series data has mainly concerned about events or item sets. Recently, the research has stated to applied to the numerical data. An example is sensor information generated by checking a machine state. The numerical data hardly have the same valuers while making patterns. So, it is important to extract suitable number of pattern features, which can be transformed to events or item sets and be applied to sequential pattern mining tasks. The popular methods to extract the patterns are sliding window and clustering. The results of these methods are sensitive to window sine or clustering parameters; that makes users to apply data mining task repeatedly and to interpret the results. This paper suggests the method to retrieve pattern features making numerical data into vector of an angle and a magnitude. The retrieved pattern features using this method make the result easy to understand and sequential patterns finding fast. We define an inclusion relation among pattern features using angles and magnitudes of vectors. Using this relation, we can fad sequential patterns faster than other methods, which use all data by reducing the data size.

  • PDF

Sequential Extraction of Heavy Metals in Soils and A Case Study (토양중의 중금속 연속추출방법과 사례연구)

  • Jung, Myung Chae
    • Economic and Environmental Geology
    • /
    • v.27 no.5
    • /
    • pp.469-477
    • /
    • 1994
  • Many researchers have investigated most representative sequential extraction method using various reagents for determining the chemical forms of metals in soils and sediments. In this paper, a newly modified method for sequential extraction scheme based on Tessier's method by Environmental Geochemistry Research, Centre for Environmental Technology, Imperial College, was introduced and examined. In comparison with Tessier's method, originally designed for sediment analysis by Atomic Absorption Spectrophotometry (AAS), the sequential extraction scheme has been developed for the multi-element analysis by Inductively Coupled Plasma Atomic Emission Spectrometry (ICP-AES). The partitioning of particulate trace elements was classified into five fractions: (i) exchangeable, (ii) bound to carbonates or specially adsorbed, (iii) bound to Fe and Mn oxides, (iv) bound to organic matter and sulphides and (v) residuals. The experimental results of the pilot study for in-house reference material (HRM2) and certified international standard reference material (SRM2711) using the modified method showed not only reasonable precision and accuracy but also acceptable overall recovery rates. In addition, mine dump soils sampled in the Dalsung Cu-W mine, Korea were prepared and sequentially extracted using the method. Most of Cu was bound to organic matter/sulphides and residual fractions. The dominant fraction of soil Pb and Zn in the study area was found in the residuals. The fraction of Cd showed a wide variation between samples and could be found bound to the carbonates or specially adsorbed, oxides, organic fraction and residuals. The recovery rates of Cd, however, were poor due to relatively low Cd concentrations in soils. The heavy metals in these mine dumps appear to be in the more inert forms and should not be readily bioavailable. The soils, however, had very low pH values (average 4.1) and had sandy textures; consequently, rapid infiltration of rainfall may increase leaching of Zn and Cd which were found to be around 5 to 10% of the exchangeable fraction. As a result of the investigation of this study, it has been strongly recommended that these mine waste materials should still be considered a significant contaminant source and will need environmental remediation to prevent pollutants from being released into the environment.

  • PDF

A Personalized Automatic TV Program Scheduler using Sequential Pattern Mining (순차 패턴 마이닝 기법을 이용한 개인 맞춤형 TV 프로그램 스케줄러)

  • Pyo, Shin-Jee;Kim, Eun-Hui;Kim, Mun-Churl
    • Journal of Broadcast Engineering
    • /
    • v.14 no.5
    • /
    • pp.625-637
    • /
    • 2009
  • With advent of TV environment and increasing of variety of program contents, users are able to experience more various and complex environment for watching TV contents. According to the change of content watching environment, users have to make more efforts to choose his/her interested TV program contents or TV channels than before. Also, the users usually watch the TV program contents with their own regular way. So, in this paper, we suggests personalized TV program schedule recommendation system based on the analyzing users' TV watching history data. And we extract the users' watched program patterns using the sequential pattern mining method. Also, we proposed a new sequential pattern mining which is suitable for TV watching environment and verify our proposed method have better performance than existing sequential pattern mining method in our application area. In the future, we will consider a VoD characteristic for extending to IPTV program schedule recommendation system.

Sequential Approximate Optimization by Dual Method Based on Two-Point Diagonal Quadratic Approximation (이점 대각 이차 근사화 기법을 쌍대기법에 적용한 순차적 근사 최적설계)

  • Park, Seon-Ho;Jung, Sang-Jin;Jeong, Seung-Hyun;Choi, Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.3
    • /
    • pp.259-266
    • /
    • 2011
  • We present a new dual sequential approximate optimization (SAO) algorithm called SD-TDQAO (sequential dual two-point diagonal quadratic approximate optimization). This algorithm solves engineering optimization problems with a nonlinear objective and nonlinear inequality constraints. The two-point diagonal quadratic approximation (TDQA) was originally non-convex and inseparable quadratic approximation in the primal design variable space. To use the dual method, SD-TDQAO uses diagonal quadratic explicit separable approximation; this can easily ensure convexity and separability. An important feature is that the second-derivative terms of the quadratic approximation are approximated by TDQA, which uses only information on the function and the derivative values at two consecutive iteration points. The algorithm will be illustrated using mathematical and topological test problems, and its performance will be compared with that of the MMA algorithm.

A Comparison of Orbit Determination Performance for the KOMPSAT-2 using Batch Filter and Sequential Filter (아리랑위성 2호 데이터를 이용한 연속추정필터와 배치필터 처리 결과 비교)

  • Cho, Dong-Hyun;Kim, Hae-Dong
    • Aerospace Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.149-157
    • /
    • 2012
  • In this paper, the performance of the sequential filter for a space debris collision management system is analyzed by using the flight data of KOMPSAT-2. To analyze the performance of the sequential filter, the results of batch filter used in the orbit determination system of the KOMPSAT-2 ground station is used as reference data. The overlap method is also used to evaluate the orbit accuracy. This paper shows that the orbit determination accuracy of the sequential filter is similar to that of the KOMPSAT-2 ground station, but dissimilar characteristics exist due to the filter difference. In addition, it is also shown that the orbit determination accuracy is order of 1m root mean square by using 30 hour GPS navigation solutions and 6 hour comparison period for the overlap method.

Construction of Sequential Digital Systems over Finite Fields (유한체상의 순차디지털시스템 구성)

  • Park, Chun-Myoung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.12
    • /
    • pp.2724-2729
    • /
    • 2010
  • This paper presents a method of constructing the sequential digital systems over finite fields. We assign all elements in finite fields to digit codes using mathematical properties of finite fields. Also, we discuss the operational characteristics and properties of the building block T-gate which is used to implement the sequential digital systems over finite fields. Then, we implemented sequential digital systems without feed-back. The sequential digital systems without feed-back is constructed as following steps. First, we assign the states in state-transition diagram to state digit codes, then obtain the state function and predecessor table which is explaining the relationship between present states and previous states. Next, we obtained the next-state function from state function and predecessor table. Finally we realize the circuit using T-gate and decoder. The proposed method is more efficiency and systematic than previous method.

A Sequential Pattern Mining based on Dynamic Weight in Data Stream (스트림 데이터에서 동적 가중치를 이용한 순차 패턴 탐사 기법)

  • Choi, Pilsun;Kim, Hwan;Kim, Daein;Hwang, Buhyun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.2
    • /
    • pp.137-144
    • /
    • 2013
  • A sequential pattern mining is finding out frequent patterns from the data set in time order. In this field, a dynamic weighted sequential pattern mining is applied to a computing environment that changes depending on the time and it can be utilized in a variety of environments applying changes of dynamic weight. In this paper, we propose a new sequence data mining method to explore the stream data by applying the dynamic weight. This method reduces the candidate patterns that must be navigated by using the dynamic weight according to the relative time sequence, and it can find out frequent sequence patterns quickly as the data input and output using a hash structure. Using this method reduces the memory usage and processing time more than applying the existing methods. We show the importance of dynamic weighted mining through the comparison of different weighting sequential pattern mining techniques.