• Title/Summary/Keyword: Iterative refinement

Search Result 36, Processing Time 0.022 seconds

Evolutionary Design and Re-design Using Design Parameters and Goals (설계 인자와 설계 목표를 이용한 진화 설계 및 재설계)

  • Lee, Kang-Soo;Lee, Kun-Woo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.11
    • /
    • pp.106-115
    • /
    • 1999
  • Design parameters and goals play important roles in design. Design goals are the required functions of the design elements and explicitly expressed by design parameters. Design parameters also indicate the relations among design elements, by which constraint networks can be constructed and some useful information can be induced. In this study, the mechanical design process is assumed to be the assignment of design goals and their realization through the evolutionary refinement of the design parameters. Thus an integrated design system is proposed to support the process of assigning the design goals and refining the values of the design parameters. In the design system, a genetic engine that utilizes a genetic algorithm is installed to simulate an iterative design process, which leads to an evolutionary design. The genetic engine treats design parameters as genes and design goals as evaluation function. Re-design and design modification are facilitated by the design parameters. The re-design can be activated in the design system by using the information stored in the design parameters when design parameters or goals are changed.

  • PDF

Sensor Deployment Simulator for Designing Sensor Fields (센서 필드 설계를 위한 배치 시뮬레이터)

  • Kwon, Oh-Heum;Song, Ha-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.3
    • /
    • pp.354-365
    • /
    • 2013
  • Node deployment is one of the important problems in achieving good quality of service in wireless sensor network. The purpose of this paper is to develop an interactive system that supports user's decision makings in designing sensor fields. The system provides grid-based initial deployment algorithm supporting three types of node deployment pattern, area-fill, path-cover, and barrier-cover deployment pattern. After initial deployment, an iterative refinement algorithm can be applied, which takes care of the irregularity of the deployment area and the heterogeneity of sensors. The proposed system helps users to effectively deploy nodes in the sensor field, analyse the detection performance of the deployment, and perform network simulations. The developed system can be utilized as a part of the development environment of the surveillance sensor network system.

Disjunctive Process Patterns Refinement and Probability Extraction from Workflow Logs

  • Kim, Kyoungsook;Ham, Seonghun;Ahn, Hyun;Kim, Kwanghoon Pio
    • Journal of Internet Computing and Services
    • /
    • v.20 no.3
    • /
    • pp.85-92
    • /
    • 2019
  • In this paper, we extract the quantitative relation data of activities from the workflow event log file recorded in the XES standard format and connect them to rediscover the workflow process model. Extract the workflow process patterns and proportions with the rediscovered model. There are four types of control-flow elements that should be used to extract workflow process patterns and portions with log files: linear (sequential) routing, disjunctive (selective) routing, conjunctive (parallel) routing, and iterative routing patterns. In this paper, we focus on four of the factors, disjunctive routing, and conjunctive path. A framework implemented by the authors' research group extracts and arranges the activity data from the log and converts the iteration of duplicate relationships into a quantitative value. Also, for accurate analysis, a parallel process is recorded in the log file based on execution time, and algorithms for finding and eliminating information distortion are designed and implemented. With these refined data, we rediscover the workflow process model following the relationship between the activities. This series of experiments are conducted using the Large Bank Transaction Process Model provided by 4TU and visualizes the experiment process and results.

A Metrics-Based Approach to the Reorganization of Class Hierarchy Structures (클래스계층구조의 품질평가척도를 기반으로 하는 재구성기법)

  • Hwang, Sun-Hyung;Yang, Hea-Sool;Hwang, Young-Sub
    • The KIPS Transactions:PartD
    • /
    • v.10D no.5
    • /
    • pp.859-872
    • /
    • 2003
  • Class hierarchies often constitute the backbone of object-oriented software. Their quality is therefore quite crucial. Building class hierarchies with good qualify is a very important and common tasks on the object oriented software development, but such hierarchies are not so easy to build. Moreover, the class hierarchy structure under construction is frequently restructured and refined until it becomes suitable for the requirement on the iterative and incremental development lifecycle. Therefore, there has been renewal of interest in all methodologies and tools to assist the object oriented developers in this task. In this paper, we define a set of quantitative metrics which provide a wav of capturing features of a rough estimation of complexity of class hierarchy structure. In addition to, we suggest a set of algorithms that transform a original class hierarchy structure into reorganized one based on the proposed metrics for class hierarchy structure. Furthermore, we also prove that each algorithm is "object-preserving". That is, we prove that the set of objects are never changed before and after applying the algorithm on a class hierarchy. The technique presented in this paper can be used as a guidelines of the construction, restructuring and refinement of class hierarchies. Moreover, the proposed set of algorithms based on metrics can be helpful for developers as an useful instrument for the object-oriented software development.velopment.

RSSI-based Location Determination via Segmentation-based Linear Spline Interpolation Method (분할기반의 선형 호 보간법에 의한 RSSI기반의 위치 인식)

  • Lau, Erin-Ee-Lin;Chung, Wan-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.473-476
    • /
    • 2007
  • Location determination of mobile user via RSSI approach has received ample attention from researchers lately. However, it remains a challenging issue due to the complexities of RSSI signal propagation characteristics, which are easily exacerbated by the mobility of user. Hence, a segmentation-based linear spline interpolation method is proposed to cater for the dynamic fluctuation pattern of radio signal in complex environment. This optimization algorithm is proposed in addition to the current radiolocation's (CC2431, Chipcon, Norway) algorithm, which runs on IEEE802.15.4 standard. The enhancement algorithm involves four phases. First phase consists of calibration model in which RSSI values at different static locations are collected and processed to obtain the mean and standard deviation value for the predefined distance. RSSI smoothing algorithm is proposed to minimize the dynamic fluctuation of radio signal received from each reference node when the user is moving. Distances are computed using the segmentation formula obtain in the first phase. In situation where RSSI value falls in more than one segment, the ambiguity of distance is solved by probability approach. The distance probability distribution function(pdf) for each distances are computed and distance with the highest pdf at a particular RSSI is the estimated distance. Finally, with the distances obtained from each reference node, an iterative trilateration algorithm is used for position estimation. Experiment results obtained position the proposed algorithm as a viable alternative for location tracking.

  • PDF

Reproduction of Shallow Tides and Tidal Asymmetry by Using Finely Resolved Grid on the West Coast of Korea (서해연안 상세해상을 통한 천해조석 및 조석비대칭 재현)

  • Suh, Seung-Won
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.23 no.4
    • /
    • pp.313-325
    • /
    • 2011
  • Finite element grid system using h-refinement on the Yellow Sea was constructed based on previous study (Suh, 1999b) from 14 K to 210 K and special attention was concentrated on refining the coastal zone. In grid generation, depth change between adjacent points and non-dimensional tidal wave length ratio were considered. As a result approximately a quarter of the total nodes are located nearby 5 m of shallow area. Accurate bathymetry data using 30's and ETOPO1 with open boundary conditions of 8 major tidal constituents extracted automatically from FES2004 have been applied. In tidal simulation a 3-dimensional nonlinear harmonic model was setup and tidal amplification due to changes in vertical turbulent and bottom friction were simulated. In this study not only 8 major tidal constituents but also nonlinear shallow tides $M_4,$, $MS_4$ and long period $M_f,$, $M_{sf}$ were reproduced. It is found that implication of spatial variation of friction coefficient plays a very important role in reproduction of astronomical and shallow tides which are computed by iterative computation of nonlinear terms. Also it should be considered differently with respect to tidal periods. To understand the distribution of tidal asymmetry, amplitude ratio of $M_4/M_2$ and phase differences $2g(M_2)-g(M_4)$ were calculated. Tidal distortion ratio marks up to 0.2 on the west coast showing shallow coastal characteristics and somewhat wide range of ebb-dominances in front of Mokpo area are reproduced.