• 제목/요약/키워드: Level subset

검색결과 116건 처리시간 0.254초

ON FUZZY IDBALS OF LIE ALGEBRAS

  • Jun, Young-Bae;Kim, Kyung-Ho;Roh, Eun-Hwan
    • Journal of applied mathematics & informatics
    • /
    • 제10권1_2호
    • /
    • pp.251-259
    • /
    • 2002
  • The fuzzification of an ideal in a Lie algebra is considered. Using a level subset of a fuzzy subset of a Lie algebra, we give a characterization of a fuzzy ideal, and using a family of ideals of a Lie algebra, we establish a fuzzy ideal. With relation to the ascending chain of ideals, a characterization for the set of values of any fuzzy ideal to be a well-ordered subset of the closed unit interval [0,1] is stated.

Scanner and Analyzer of ALGOL-60(Subset) for IBM II30 (IBM 1130을 위한 ALGOL-60(Subset)의 스캐너와 어낼라이저)

  • 朴永文;Choy, 崔燕 =-Youn
    • Communications of the Korean Institute of Information Scientists and Engineers
    • /
    • 제3권1호
    • /
    • pp.12-17
    • /
    • 1985
  • This pape rdeals with the first half of ALGOL-60(Subset) compiler -scanner and analyzer-, which is writter in FORTRAN IV. As the original syntax description of ALGOL-60 is too complex to use, real number array, and procedures are omitted. And a subset of ALGOL-60 is defined.

(Restrictions and translation rules of ANSI-C language for analyzing integrity of C program using SPARK Examiner) (SPARK Examiner를 이용해 ANSI-C프로그램의 안전성을 분석하기 위한 C언어의 제약 조건과 변환 방법)

  • 김진섭;차성덕
    • Journal of KIISE:Software and Applications
    • /
    • 제30권5_6호
    • /
    • pp.587-597
    • /
    • 2003
  • The C language is widely adopted for safety-critical systems. However, it is known that the C language is an unsuitable choice for safety-critical system since the C language includes several bad language features such as heavy use of pointers. The aim of this work is to define safe subset of the C language and translate the subset into the SPARK Ada so that we can verify the program's safety using SPARK analysis tools. SPARK is a safe subset of Ada and has been successfully applied to high integrity system development. The C program translated into SPARK has the same integrity level as SPARK, and the program correctness can be verified by using Examiner which is a SPARK analysis tool. An elevator controller case study is presented and is used to demonstrate the potential use of our approach to implement a realistic system. We also developed a translator that automatically translates C code into SPARK in accordance with the translation rules.

Parallel processing in structural reliability

  • Pellissetti, M.F.
    • Structural Engineering and Mechanics
    • /
    • 제32권1호
    • /
    • pp.95-126
    • /
    • 2009
  • The present contribution addresses the parallelization of advanced simulation methods for structural reliability analysis, which have recently been developed for large-scale structures with a high number of uncertain parameters. In particular, the Line Sampling method and the Subset Simulation method are considered. The proposed parallel algorithms exploit the parallelism associated with the possibility to simultaneously perform independent FE analyses. For the Line Sampling method a parallelization scheme is proposed both for the actual sampling process, and for the statistical gradient estimation method used to identify the so-called important direction of the Line Sampling scheme. Two parallelization strategies are investigated for the Subset Simulation method: the first one consists in the embarrassingly parallel advancement of distinct Markov chains; in this case the speedup is bounded by the number of chains advanced simultaneously. The second parallel Subset Simulation algorithm utilizes the concept of speculative computing. Speedup measurements in context with the FE model of a multistory building (24,000 DOFs) show the reduction of the wall-clock time to a very viable amount (<10 minutes for Line Sampling and ${\approx}$ 1 hour for Subset Simulation). The measurements, conducted on clusters of multi-core nodes, also indicate a strong sensitivity of the parallel performance to the load level of the nodes, in terms of the number of simultaneously used cores. This performance degradation is related to memory bottlenecks during the modal analysis required during each FE analysis.

A Study on the Balise Failure Analysis & Effects for ETCS Application (ETCS 적용 구간에서의 발리스 고장 분석 및 영향에 관한 연구)

  • Lee, Myoung-Chol;Kim, Chang-Hoon;Ji, Jung-Gun;Lee, Jong-Woo
    • Proceedings of the KSR Conference
    • /
    • 한국철도학회 2011년도 정기총회 및 추계학술대회 논문집
    • /
    • pp.717-723
    • /
    • 2011
  • When the Balise(the device to transmit information between the on-board equipment and the wayside equipment) failure occurs, it may not be able to transmit data(Telegram) required for the train running. And in some cases, it may be able to cause an accident. Therefore, both the Balise failure affecting train safety running and the hazard in accordance with Balise failure require some activities to establish them. General failure mode & hazard analysis associated with the Balise are described in UNISIG SUBSET-036 spec & UNISIG SUBSET-088 spec. And, with reference to these specifications, safety activities are being performed. In recent domestic railway, the train control system applying ETCS(European Train Control System) Level 1, 2 is being serviced and is being planned, and as part of this system, the Balise is being applied. The design-method of the Balise device for each manufacturer are different, therefore the Balise failure mode & failure rate are different, either. But the functionalities & transmission-data format(Telegram) of the Balise in ETCS Level 1, 2 application for each manufacturer are identical. Accordingly, the hazard caused by function-fail can be identical, either. In order to establish these hazard, in this paper, we analyzed the detailed functions of the Balise. And we analyzed the Balise failure types & failure effects in accordance with the detailed functions.

  • PDF

Syntax directed Compiler for Subset of PASCAL

  • 이태경
    • Communications of the Korean Institute of Information Scientists and Engineers
    • /
    • 제4권2호
    • /
    • pp.65-73
    • /
    • 1986
  • The PM language is a Compiler writing language which syntax- directly translates a high level language into a intermediate language of matrix form. The PM assembler translates the PM language into recursive subroutines which test input strings or output intermediate terms or call another subroutines. A large subset of PASCAL compiler was written in the PM language.

HYPER PERMEABLE VALUES AND ENERGETIC SETS IN BCK/BCI-ALGEBRAS

  • Jun, Young Bae;Kim, Seon Jeong;Song, Seok-Zun
    • Honam Mathematical Journal
    • /
    • 제42권2호
    • /
    • pp.197-211
    • /
    • 2020
  • The notions of hyper permeable subalgebraic value and hyper permeable idealistic value are introduced, and related properties are investigated. Given a pair of two numbers in a unit interval, conditions for the pair to be hyper permeable subalgebraic value and hyper permeable idealistic value are discussed. Given hyperfuzzy structures, conditions for their level sets to be subalgebraic energetic, idealistic energetic, right stable and right vanished are considered. Relations between hyper permeable subalgebraic value and hyper permeable idealistic value are studied.

SOME RESULTS ON D-ADMISSIBLE (Є, Є Vq)-Fuzzy SUBGROUPS

  • Kim, Dae-Sig
    • Bulletin of the Korean Mathematical Society
    • /
    • 제41권4호
    • /
    • pp.723-730
    • /
    • 2004
  • The definition of a D-admissible fuzzy subset for an operator domain D on a group G is modified to obtain new kinds of (${\in},\;{\in}\;{\vee}q$)-fuzzy subgroups such as an (${\in},\;{\in}\;{\vee}q$)-fuzzy normal subgroup, an (<${\in},\;{\in}\;{\vee}q$)-fuzzy characteristic subgroup, an (<${\in},\;{\in}\;{\vee}q$)-fuzzy fully invariant subgroup which are invariant under D. As results, some of the fundamental properties of such (${\in},\;{\in}\;{\vee}q$)-fuzzy subgroups are obtained.

Detection and quantification of structural damage under ambient vibration environment

  • Yun, Gun Jin
    • Structural Engineering and Mechanics
    • /
    • 제42권3호
    • /
    • pp.425-448
    • /
    • 2012
  • In this paper, a new damage detection and quantification method has been presented to perform detection and quantification of structural damage under ambient vibration loadings. To extract modal properties of the structural system under ambient excitation, natural excitation technique (NExT) and eigensystem realization algorithm (ERA) are employed. Sensitivity matrices of the dynamic residual force vector have been derived and used in the parameter subset selection method to identify multiple damaged locations. In the sequel, the steady state genetic algorithm (SSGA) is used to determine quantified levels of the identified damage by minimizing errors in the modal flexibility matrix. In this study, performance of the proposed damage detection and quantification methodology is evaluated using a finite element model of a truss structure with considerations of possible experimental errors and noises. A series of numerical examples with five different damage scenarios including a challengingly small damage level demonstrates that the proposed methodology can efficaciously detect and quantify damage under noisy ambient vibrations.

Optimization Model for Planning of Experiments in Test and Evaluation Process (시험평가 실험계획을 위한 최적화 모형)

  • Cho, Namsuk
    • Journal of Applied Reliability
    • /
    • 제18권2호
    • /
    • pp.173-183
    • /
    • 2018
  • Purpose: It is critical to design a set of experiments in Test and Evaluation Process for a weapon system. Because there is no sufficient resources in real-world, one must choose a subset of experiments which is considered to be more important. Methods: We introduce an optimization model for choosing the subset of experiments by considering a priority of experimental variable and level and restrictions of resources. We describe in detail how we construct objective function and constraints which must be a right realization of our logic and assumption. Conclusion: Since our optimization model turns out to be computationally difficult to solve, we introduce an algorithm for reducing the size of problem. Various computational results follows.