• Title/Summary/Keyword: Rule simplification

Search Result 21, Processing Time 0.022 seconds

The Rule Case Simplification Algorithm to be used in a Rule-Based System (규칙기반 시스템에 사용되는 규칙 간소화 알고리즘)

  • Zheng, Baowei;Yeo, Jeong-Mo
    • The KIPS Transactions:PartD
    • /
    • v.17D no.6
    • /
    • pp.405-414
    • /
    • 2010
  • A rule is defined as a case to determine the target values according to combination of various Business factors. The information system is used to represent enterprise's business, which includes and implements the amount of these rules to Rule-Based System. A Rule-Based System can be constructed by using the rules engine method or Relational Database technology. Because the rules engine method has some disadvantages, the Rule-Based System is mostly developed with Relational Database technology. When business scales become larger and more complex, a large number of various rule cases must be operated in system, and processing these rule cases requires additional time, overhead and storage space, and the speed of execution slows down. To solve these problems, we propose a simplification algorithm that converts a large amount of rule cases to simplification rule cases with same effects. The proposed algorithm is applied to hypothetical business rule data and a large number of simplification experiments and tests are conducted. The final results proved that the number of rows can be reduced to some extent. The proposed algorithm can be used to simplify business rule data for improving performance of the Rule-Based System implemented with the Relational Database.

Comparative Study on the Building Outline Simplification Algorithms for the Conversion of Construction Drawings to GIS data (건설도면의 GIS 데이터 변환을 위한 건물외곽선 단순화기법 비교 연구)

  • Park, Woo-Jin;Park, Seung-Yong;Yu, Ki-Yun
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.16 no.3
    • /
    • pp.35-41
    • /
    • 2008
  • Recently needs for the convergence of CAD and GIS data are increasing, and many studies on converting two systems to each other are being carried out. In this study, to revise and update the building data of digital map using CAD data for construction, the outline of building is abstracted from the CAD data and the outline is generalized to the same level of detail with the building data of digital map. Several line simplification algorithms to generalize the outline are adopted and compared, especially at the view of satisfaction to the drawing rule for digital map. Douglas-Peucker algorithm, Lang's algorithm, Reumann-Witkam algorithm, and Opheim algorithm are applied as the line simplification method. To evaluate the results of these algorithms, visual assessment and variation ratio of the number of points, total length of lines, the area of polygon, and satisfaction ratio to the drawing rule of digital map are analyzed. The result of Lang algorithm and Douglas-Peucker algorithm show superior satisfaction ratio. But general satisfaction ratio is 50~60% for all algorithm. Therefore there seems to be a limit to use these algorithms for the simplification method to update the building data in digital map and it is necessary to develop line simplification algorithm which satisfy the drawing rule well.

  • PDF

Simplification of LIDAR Data for Building Extraction Based on Quad-tree Structure

  • Du, Ruoyu;Lee, Hyo Jong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.355-356
    • /
    • 2011
  • LiDAR data is very large, which contains an amount of redundant information. The information not only takes up a lot of storage space but also brings much inconvenience to the LIDAR data transmission and application. Therefore, a simplified method was proposed for LiDAR data based on quad-tree structure in this paper. The boundary contour lines of the buildings are displayed as building extraction. Experimental results show that the method is efficient for point's simplification according to the rule of mapping.

A Study on FTA-related Administrative Efficiency Measures for Verifying the Origin (FTA 원산지검증행정의 효율화 방안에 대한 연구)

  • Chung, Jae-Wan
    • THE INTERNATIONAL COMMERCE & LAW REVIEW
    • /
    • v.55
    • /
    • pp.243-264
    • /
    • 2012
  • This study is aimed to analyze problems related to FTA country of origin of goods verification which is increasing from 2006 and thereby to grope for solution of such problems and seek adequate FTA performance administration. It is found, through comparative analysis and statistics of last 8 FTAs so far Korea has concluded that there are major problems such as excessive verification processing due to complicated country of origin regulation etc. This paper suggests following policies of country of origin administration ; (1) Simplification of FTA country of origin rules (2) reciprocal cooperation between each country's Customs Authorities based on trust (3) rational measurement against corresponding country's Customs Authorities' misbehavior (4) enhancement of transparency in relation to processing rule of country of origin verification (5) securing FTA country of origin verification experts. For these improvements, upcoming FTA shall rule country of origin reasonably, simplification and transparency of rule is needed for established FTAs in relation to FTA performance administration with corresponding countries. Also it is necessary to revise FTA preferential tariff law and its related laws, and carry forward policies in accordance with medium and long term plan.

  • PDF

PWM DC-AC Converter Regulation using a Multi-Loop Single Input Fuzzy PI Controller

  • Ayob, Shahrin Md.;Azli, Naziha Ahmad;Salam, Zainal
    • Journal of Power Electronics
    • /
    • v.9 no.1
    • /
    • pp.124-131
    • /
    • 2009
  • This paper presents a PWM dc-ac converter regulation using a Single Input Fuzzy PI Controller (SIFPIC). The SIFPIC is derived from the signed distanced method, which is a simplification of a conventional fuzzy controller. The simplification results in a one-dimensional rule table, that allows its control surface to be approximated by a piecewise linear relationship. The controller multi-loop structure is comprised of an outer voltage and an inner current feedback loop. To verify the performance of the SIFPIC, a low power PWM dc-ac converter prototype is constructed and the proposed control algorithm is implemented. The experimental results show that the SIFPIC performance is comparable to a conventional Fuzzy PI controller, but with a much reduced computation time.

Simplification of Covering Transformation into LL Grammars (LL 문법으로의 커버링 변환의 단순화)

  • Lee, Gyung-Ok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.6
    • /
    • pp.319-322
    • /
    • 2010
  • Extended PLR grammars are currently the largest subclass of LR grammars whose grammars are transformed into LL grammars satisfying covering property. This paper suggests a simplified covering transformation of the original covering transformation for extended PLR grammars. The proposed covering transformation reduces the original four rule types to the three rule types.

An Analysis on T-shirts Design (티셔츠 디자인에 대한 분석)

  • Choi Jung-Hwa
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.29 no.11
    • /
    • pp.1410-1420
    • /
    • 2005
  • The purpose of this study was to analyze characteristics of effective expression on T-shirts pattern by peirce's semiotic theory. The methods of this study was to analyze 721 T-shirts patterns in designer's collection from 2000 to 2004. The results of this study were as follows: First of all, iconic expression showed high frequency after 2000. Characteristics of effective expression were as follows: In geometric expression, repetition was presented as a symbolic sign by regular proportion and rule of dot, line, plane, irregularity, mixture of irregular dot, line, plane. Mixed expression was presented as a iconic and symbolic sign by collage, mixture of dot, line, plane, icon and letter. In iconic expression, simplification of iconic sigrl was presented as a iconic sign by simplification of form, color, texture, realistic expression using digital as a iconic sign, and symbolic face, body as a symbolic sign. Pop art's expression was presented as a iconic sign by a cartoon and commercial character and illusion was presented as a iconic sign. In letter's expression, brand logo was presented as a symbolic sign by transformation of letter's design, a symbolic sign of numeral by transformation of size, thickness, form, color. Symbolic message phrase was presented by slogan, fashion trend, brand image, descriptive indication message as a index sign by using icon or singleness. In conclusion, characteristics of effective expression on T-shirts pattern will present not only the theoretical foundation to raise the value added, but also the information about beauty sense of times, political and social value.

Vital Area Identification Rule Development and Its Application for the Physical Protection of Nuclear Power Plants (원자력발전소의 물리적방호를 위한 핵심구역파악 규칙 개발 및 적용)

  • Jung, Woo Sik;Hwang, Mee-Jeong;Kang, Minho
    • Journal of the Korean Society of Safety
    • /
    • v.32 no.3
    • /
    • pp.160-171
    • /
    • 2017
  • US national research laboratories developed the first Vital Area Identification (VAI) method for the physical protection of nuclear power plants that is based on Event Tree Analysis (ETA) and Fault Tree Analysis (FTA) techniques in 1970s. Then, Korea Atomic Energy Research Institute proposed advanced VAI method that takes advantage of fire and flooding Probabilistic Safety Assessment (PSA) results. In this study, in order to minimize the burden and difficulty of VAI, (1) a set of streamlined VAI rules were developed, and (2) this set of rules was applied to PSA fault tree and event tree at the initial stage of VAI process. This new rule-based VAI method is explained, and its efficiency and correctness are demonstrated throughout this paper. This new rule-based VAI method drastically reduces problem size by (1) performing PSA event tree simplification by applying VAI rules to the PSA event tree, (2) calculating preliminary prevention sets with event tree headings, (3) converting the shortest preliminary prevention set into a sabotage fault tree, and (4) performing usual VAI procedure. Since this new rule-based VAI method drastically reduces VAI problem size, it provides very quick and economical VAI procedure. In spite of an extremely reduced sabotage fault tree, this method generates identical vital areas to those by traditional VAI method. It is strongly recommended that this new rule-based VAI method be applied to the physical protection of nuclear power plants and other complex safety-critical systems such as chemical and military systems.

A Study on the Evaluation of Simplification Algorithms Based on Map Generalization (지도 일반화에 따른 단순화 알고리즘의 평가에 관한 연구)

  • Kim, Kam-Lae;Lee, Ho-Nam;Park, In-Hae
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.10 no.2
    • /
    • pp.63-71
    • /
    • 1992
  • The digital map database is often produced for multiple purposes, including mapping at multiple scales; it is increasingly rare that a base map is digitized for mapping at a single scale. The most important problems in process of line simplification in map generalization and multiple representation is that tolerance value selected for simplifying base map information must be modified as feature geometry varies within the digital file to ensure both accuracy and recognizability of graphic details on a generalized map. In this study, we explored various algorithms regarding to line simplication at many scales from a single digital file, and presents a rule by which to determine those scale at which line feature geometry might be expected to change in map representation. By applying two measured of displacement between a digitized line and its simplification, five algorithms have been evaluated. The results indicate that, of the five, the Douglas-Peucker routine produced less displacement between a line and its simplification. The research has proved to automating map simplification, incorporating numeric guidelines into digital environment about what magnitude and variation in geometric detail should be preserved as the digital data is simplified for representation at reduced map scales.

  • PDF

A similarity measure of fuzzy sets

  • Kwon, Soon H.
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.3
    • /
    • pp.270-274
    • /
    • 2001
  • Conventional similarity measures suggested so far can be classified into three categories: (i) geometric similarity measures, (ij) set-theoretic similarity measures, and (iii) matching function-based similarity measures. On the basis of the characteristics of the conventional similarity measures, in this paper, we propose a new similarity measure of fuzzy sets and investigate its properLies. Finally, numelical examples are provided for the comparison of characteristics of the proposed similarity measure and other previous similarity measures.

  • PDF