• Title/Summary/Keyword: Programming Rules

Search Result 149, Processing Time 0.025 seconds

A study on the descriptive cataloging of serial title changes (지명변경자료의 기술목록법에 관한 연구)

  • 윤희윤
    • Journal of Korean Library and Information Science Society
    • /
    • v.22
    • /
    • pp.61-93
    • /
    • 1995
  • This paper discussed which of the three basic entries of serials that changed their titles-earliest, latest, or successive entry cataloging-is the most efficient, informative, and economical in a manual and an online environment. The results of the study are as follow: 1. Earliest entry cataloging or as an alternative, successive entry cataloging advocated by Cutter in 1976 was replaced in ALA Cataloging Rules by latest entry cataloging and with AACR1 and AACR2, latest entry cataloging was replaced by successive entry cataloging again. 2. Entry method of serial cataloging should be determined in consideration of goals of catalog, efficiency of catalog retrieval, theoretical and practical standpoint of entry methods, average cataloging time and cost, the state of adaption. 3. In a card catalog environment, if the numbering and class number of the serial that title proper changed into initials itself continue and the title history must not be too complicated, the serial is desirable to entry under the latest title. Except for above case, successive entry cataloging enables serials to be more quickly and economically made available to users than with either earliest or latest entry cataloging. 4. In an automated catalog environment, successive entry cataloging has more potential of satisfying and impairs the efficiency of both accessing and processing a library's serials collection. However, when initial cataloging by MARC format is done, careful screen design and complex programming will be needed. And subfield containing the local record number should be added to the programming means to link the various records together, i.e., 780 (preceding title) and 785 (succeeding title) fields for all related titles.

  • PDF

GEP-based Framework for Immune-Inspired Intrusion Detection

  • Tang, Wan;Peng, Limei;Yang, Ximin;Xie, Xia;Cao, Yang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.6
    • /
    • pp.1273-1293
    • /
    • 2010
  • Immune-inspired intrusion detection is a promising technology for network security, and well known for its diversity, adaptation, self-tolerance, etc. However, scalability and coverage are two major drawbacks of the immune-inspired intrusion detection systems (IIDSes). In this paper, we propose an IIDS framework, named GEP-IIDS, with improved basic system elements to address these two problems. First, an additional bio-inspired technique, gene expression programming (GEP), is introduced in detector (corresponding to detection rules) representation. In addition, inspired by the avidity model of immunology, new avidity/affinity functions taking the priority of attributes into account are given. Based on the above two improved elements, we also propose a novel immune algorithm that is capable of integrating two bio-inspired mechanisms (i.e., negative selection and positive selection) by using a balance factor. Finally, a pruning algorithm is given to reduce redundant detectors that consume footprint and detection time but do not contribute to improving performance. Our experimental results show the feasibility and effectiveness of our solution to handle the scalability and coverage problems of IIDS.

${\lambda}$-calculus (${\lambda}$-연산 소개)

  • Cheong Kye-Seop
    • Journal for History of Mathematics
    • /
    • v.17 no.4
    • /
    • pp.45-64
    • /
    • 2004
  • The lambda calculus is a mathematical formalism in which functions can be formed, combined and used for computation that is defined as rewriting rules. With the development of the computer science, many programming languages have been based on the lambda calculus (LISP, CAML, MIRANDA) which provides simple and clear views of computation. Furthermore, thanks to the "Curry-Howard correspondence", it is possible to establish correspondence between proofs and computer programming. The purpose of this article is to make available, for didactic purposes, a subject matter that is not well-known to the general public. The impact of the lambda calculus in logic and computer science still remains as an area of further investigation.stigation.

  • PDF

Implementation of SOAP Client in U Programming Environment (nML 프로그래밍 환경에서 SOAP 클라이언트 구현)

  • 권오경;한태숙
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.1_2
    • /
    • pp.164-172
    • /
    • 2003
  • Web service implementations are now rapidly growing. Web services are easily achieved by XML messaging for most programming languages. Applications usually utilize web services through APIs tied to a specific implementation of SOAP. nML is a dialect of SML and OCaml made in ROPAS. The soaptype type in nML is defined for the value of SOAP encoding. SOAP encoding specification defines rules for serialization of a graph of typed objects using XML Schema. XML Schema validates XML SOAP value. The soaptype type is encoded to XML and decoded from XML. It is necessary to guarantee safe encoding and decoding. So, the definitions for element and type definition in XML Schema are specified by element type and typeinfo type, which include the part of the definitions of XML Schema specification.

An Expert System for Short-Term Generation Scheduling of Electric Power Systems (전력계통의 단기 발전계획 기원용 전문가시스템)

  • Yu, In-Keun
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.41 no.8
    • /
    • pp.831-840
    • /
    • 1992
  • This paper presents an efficient short-term generation scheduling method using a rule-based expert/consulting system approach to assist electric energy system operators and planners. The expert system approach is applied to improve the Dynamic Programming(DP) based generation scheduling algorithm. In the selection procedure of the feasible combinations of generating units at each stage, automatic consulting on the manipulation of several constraints such as the minimum up time, the minimum down time and the maximum running time constraints of generating units will be performed by the expert/consulting system. In order to maximize the solution feasibility, the aforementioned constraints are controlled by a rule-based expert system, that is, instead of imposing penalty cost to those constraint violated combinations, which sometimes may become the very reason of no existing solution, several constraints will be manipulated within their flexibilities using the rules and facts that are established by domain experts. In this paper, for the purpose of implementing the consulting of several constraints during the dynamic process of generation scheduling, an expert system named STGSCS is developed. As a building tool of the expert system, C Language Integrated Production System(CLIPS) is used. The effectiveness of the proposed algorithm has been demonstrated by applying it to a model electric energy system.

  • PDF

A Study on the Development of Computer Aided Die Design System for Lead Frame, Semiconductor (반도체 리드 프레임의 금형설계 자동화 시스템 개발에 관한 연구)

  • Choe, Jae-Chan;Kim, Byeong-Min;Kim, Cheol;Kim, Jae-Hun;Kim, Chang-Bong
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.6
    • /
    • pp.123-132
    • /
    • 1999
  • This paper describes a research work of developing computer-aided design of lead frame, semiconductor, with blanking operation which is very precise for progressive working. Approach to the system is based on the knowledge-based rules. Knowledge for the system is formulated from pasticity theories, experimental results and the empirical knowledge of field experts. This system has been written in AutoLISP on the AutoCAD using a personal computer and in I-DEAS Drafting Programming Language on the I-DEAS Master Series Drafting with Workstation, HP9000/715(64). Transference of data between AutoCAD and I-DEAS Master Series Drafting is accomplished by DXF(drawing exchange format) and IGES(initial graphics exchange specification) methods. This system is composed of five modules, which are input and shape treatment, production feasibility check, strip-layout, data-conversion and die-layout modules. The process planning and Die design system is designed by considering several factors, such as complexities of blank geometry, punch profiles, and the availability of a press equipment and standard parts. This system provides its efficiecy for strip-layout, and die design for lead frame, semiconductor.

  • PDF

Intelligent Product Search Agent based on SWRL (시맨틱 웹 규칙 언어를 이용한 지능형 상품 정보 검색 에이전트 개발)

  • Kim, U-Ju;Kim, Jeong-Myeong;Choe, Dae-U
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2005.05a
    • /
    • pp.316-320
    • /
    • 2005
  • We developed Intelligent Product Search Agent based on SWRL, and this agent can search product information with knowledge(facts and rules) on the web, implement price comparison for searched products considering delivery rates. Existing keyword based product search engines is poor at searching intent products though a user has already prefect knowledge about intent produces. Furthermore if a user has insufficient knowledge, it is impossible to implement search. Also, existing price comparison shopping mall gives users comparison service considering total price(product prices, taxes, delivery rates), this service is valid to single product and has limitations of system expansion and up-dating because of not rule base but programming base. If there is appropriate knowledge on the Semantic web and this makes product information retrieval possible, above problems can be solved clearly. In this research, we developed Intelligent Product Search Agent based on SWRL that can search product information efficiently by making agent to handle facts and rules by itself.

  • PDF

Development and Validation of Reservoir Operation Rules for Integrated Water Resources Management in the Geum River Basin (금강유역의 유역통합수자원관리를 위한 저수지 운영률 개발 및 적용성 검토)

  • Cheong, Tae-Sung;Kang, Sin-Uk;Hwang, Man-Ha;Ko, Ick-Hwan
    • Journal of Korea Water Resources Association
    • /
    • v.41 no.4
    • /
    • pp.433-444
    • /
    • 2008
  • In recent, the integrated water resources management should consider not only existing management objects such as water supply, power generation, and instream flows but also new management objects such as water quantity, water quality, and water habitats which management system is large and complex. Moreover, integrated basin plan or operation are needed for solving conflicts problems between basins and between water usages and to maximize water resources usages. To increase use of optimization method for actual operation and apply various objects, a reservoir operation rule was developed and the KModSim's hydrologic states for integrated water resources management were tested in this study. The simulation results show that the developed operation rules applied in hydrologic states good represent the actual storages of both the Yongdam and the Daecheong Reservoirs so, it is possible to improve the water allocation method usually used in the basin management and manage the integrated basin water resources if new operating rules are applied in optimized programming.

A Coevolution of Artificial-Organism Using Classification Rule And Enhanced Backpropagation Neural Network (분류규칙과 강화 역전파 신경망을 이용한 이종 인공유기체의 공진화)

  • Cho Nam-Deok;Kim Ki-Tae
    • The KIPS Transactions:PartB
    • /
    • v.12B no.3 s.99
    • /
    • pp.349-356
    • /
    • 2005
  • Artificial Organism-used application areas are expanding at a break-neck speed with a view to getting things done in a dynamic and Informal environment. A use of general programming or traditional hi methods as the representation of Artificial Organism behavior knowledge in these areas can cause problems related to frequent modifications and bad response in an unpredictable situation. Strategies aimed at solving these problems in a machine-learning fashion includes Genetic Programming and Evolving Neural Networks. But the learning method of Artificial-Organism is not good yet, and can't represent life in the environment. With this in mind, this research is designed to come up with a new behavior evolution model. The model represents behavior knowledge with Classification Rules and Enhanced Backpropation Neural Networks and discriminate the denomination. To evaluate the model, the researcher applied it to problems with the competition of Artificial-Organism in the Simulator and compared with other system. The survey shows that the model prevails in terms of the speed and Qualify of learning. The model is characterized by the simultaneous learning of classification rules and neural networks represented on chromosomes with the help of Genetic Algorithm and the consolidation of learning ability caused by the hybrid processing of the classification rules and Enhanced Backpropagation Neural Network.

Multi-Dimensional Dynamic Programming Algorithm for Input Lot Formation in a Semiconductor Wafer Fabrication Facility (반도체 팹에서의 투입 로트 구성을 위한 다차원 동적계획 알고리듬)

  • Bang, June-Young;Lim, Seung-Kil;Kim, Jae-Gon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.1
    • /
    • pp.73-80
    • /
    • 2016
  • This study focuses on the formation of input release lots in a semiconductor wafer fabrication facility. After the order-lot pegging process assigns lots in the fab to orders and calculates the required quantity of wafers for each product type to meet customers' orders, the decisions on the formation of input release lots should be made to minimize the production costs of the release lots. Since the number of lots being processed in the wafer fab directly is related to the productivity of the wafer fab, the input lot formation is crucial process to reduce the production costs as well as to improve the efficiency of the wafer fab. Here, the input lot formation occurs before every shift begins in the semiconductor wafer fab. When input quantities (of wafers) for product types are given from results of the order-lot pegging process, lots to be released into the wafer fab should be formed satisfying the lot size requirements. Here, the production cost of a homogeneous lot of the same type of product is less than that of a heterogeneous lot that will be split into the number of lots according to their product types after passing the branch point during the wafer fabrication process. Also, more production cost occurs if a lot becomes more heterogeneous. We developed a multi-dimensional dynamic programming algorithm for the input lot formation problem and showed how to apply the algorithm to solve the problem optimally with an example problem instance. It is necessary to reduce the number of states at each stage in the DP algorithm for practical use. Also, we can apply the proposed DP algorithm together with lot release rules such as CONWIP and UNIFORM.