• Nuclear Engineering and Technology
• /
• v.28 no.3
• /
• pp.247-256
• /
• 1996

This paper presents a new approach for assessing accident management strategies using containment event trees (CETs) developed during an individual plant examination (IPE) for a reference plant (CE type, 950 MWe PWR). Various accident management strategies to reduce risk have been proposed through IPE. Three strategies for the station blackout sequence are used as an example : 1) reactor cavity flooding only, 2) primary system depressurization only, and 3) doing both. These strategies are assumed to be initiated at about the time of core uncovery. The station blackout (SBO) sequence is selected in this paper since it is identified as one of the most threatening sequences to safety of the reference plant. The effectiveness and adverse effects of each accident management strategy are considered synthetically in the CETs. A best estimate assessment for the developed CETs using data obtained from NUREG-1150, other PRA results, and the MAAP code calculations is performed. The strategies are ranked with respect to minimizing the frequencies of Various containment failure modes. The proposed approach is demonstrated to be very flexible in that it can be applied to any kind of accident management strategy for any sequence.

• Bioinformatics and Biosystems
• /
• v.1 no.1
• /
• pp.46-50
• /
• 2006

According to the advancement of experimental techniques in molecular biology, genomic and protein sequence databases are increasing in size exponentially, and mean sequence lengths are also increasing. Because the sizes of these databases become larger, it is difficult to search similar sequences in biological databases with significant homologies to a query sequence. In this paper, we present the N-gram indexing method to retrieve similar sequences fast, precisely and comparably. This method regards a protein sequence as a text written in language of 20 amino acid codes, adapts N-gram tokens of fixed-length as its indexing scheme for sequence strings. After such tokens are indexed for all the sequences in the database, sequences can be searched with information retrieval algorithms. Using this new method, we have developed a protein sequence search system named as ProSeS (PROtein Sequence Search). ProSeS is a protein sequence analysis system which provides overall analysis results such as similar sequences with significant homologies, predicted subcellular locations of the query sequence, and major keywords extracted from annotations of similar sequences. We show experimentally that the N-gram indexing approach saves the retrieval time significantly, and that it is as accurate as current popular search tool BLAST.

• Interdisciplinary Bio Central
• /
• v.6 no.4
• /
• pp.3.1-3.10
• /
• 2014

Amino acid substitution matrices are essential tools for protein sequence analysis, homology sequence search in protein databases and multiple sequence alignment. The PAM matrix was the first widely used amino acid substitution matrix. The BLOSUM series then succeeded the PAM matrix. Most substitution matrixes were developed by using the statistical frequency of substitution between each amino acid at blocks representing groups of protein families or related proteins. However, substitution of amino acids is based on the similarity of physiochemical properties of each amino acid. In this study, a new approach was used to obtain major physiochemical properties in multiple sequence alignment. Frequency of amino acid substitution in multiple sequence alignment database and selected attributes of amino acids in physiochemical properties database were merged. This merged data showed the major physiochemical properties through principle components analysis. Using factor analysis, these four principle components were interpreted as flexibility of electronic movement, polarity, negative charge and structural flexibility. Applying these four components, BAPS was constructed and validated for accuracy. When comparing receiver operated characteristic ($ROC_{50}$) values, BAPS scored slightly lower than BLOSUM and PAM. However, when evaluating for accuracy by comparing results from multiple sequence alignment with the structural alignment results of two test data sets with known three-dimensional structure in the homologous structure alignment database, the result of the test for BAPS was comparatively equivalent or better than results for prior matrices including PAM, Gonnet, Identity and Genetic code matrix.

• Archives of Craniofacial Surgery
• /
• v.23 no.6
• /
• pp.256-261
• /
• 2022

Background: Treating panfacial fractures (PFFs) can be extremely difficult even for experienced surgeons. Although several authors have attempted to systemize the surgical approach, performing surgery by applying a unidirectional sequence is much more difficult in practice. The purpose of this study was to review the literature on PFF surgery sequence and to understand how different surgical specialists-plastic reconstructive surgery (PRS) and oral maxillofacial surgery (OMS)-chose sequence and review PFFs fixation sequence in clinical cases. Methods: The PubMed and Google Scholar databases were scoured for publications published up until May 2020. Data extracted from the studies using standard templates included fracture part, fixation sequence, originating specialist, and the countries. Bibliographic details like author and year of publication were also extracted. Also, we reviewed the data for PFFs patients in the Trauma Registry System of Dankook University Hospital from 2011 to 2021. Results: In total, 240 articles were identified. This study comprised 22 studies after screening and full-text analysis. Sixteen studies (12 OMS specialists and 4 PRS specialists) used a "bottom-top" approach, whereas three studies (1 OMS specialist and 2 PRS specialists) used a "top-bottom" method. However, three studies (only OMS specialists) reported on both sequences. In our hospital, there were a total of 124 patients with PFF who were treated during 2011 to 2021; 64 (51.6%) were in upper-middle parts, 52 (41.9%) were in mid-lower parts, and eight (6.5%) were in three parts. Conclusion: Bottom-top sequencing was mainly used in OMS specialists, and top-bottom sequencing was used at a similar rate by two specialists in literature review. In our experience, however, it was hard to consistently implement unidirectional sequence suggested by a literature review. We realigned the reliable and stable buttresses first with tailoring individually for each patient, rather than proceeding in the unidirectional sequence like bottom-top or top-bottom.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.751-753
• /
• 2001

지금까지 인간이나 다른 생물체의 전체 유전체 염기서열을 밝혀내는 작업은 크게 세가지 방법으로 진행되었다. Clone-by-clone approach, sequence tagged connector approach, random shotgun approach[1]가 그것인데 마지막의 random shotgun approach는 fragment assembly problem을 비롯한 여러 가지 전산학적인 문제들을 수반한다. 미생물체의 전체 염기서열을 random shotgun approach를 이용하여 밝혀낼 때 몇 가지 전산학적인 문제가 테크닉이 필요하며 그 중에서도 서열간의 forward, reverse의 mating 정보를 이용하는 것이 중요하다. 본 논문은 이러한 mating 작업을 한 눈에 볼 수 있게 하는 소프트웨어 페키지 “Mater”에 대해 소개하고자 하며 그 의미에 대해 논하고자 한다.

• Journal of the Korea Safety Management & Science
• /
• v.3 no.4
• /
• pp.103-112
• /
• 2001

In Factory, as the number of machine is increased the more maintenance efforts are necessary. Multi maintenance issues may occur at a certain time and the determination of maintenance sequence is needed. In this study, we first compare the priority of machines and the impact value using modified FMEA(Failure Mode Effect and Analysis) method. Also, CBR(Case-based Reasoning) approach is applied to retrieve similar fault cases of current machine problem. The proposed methodology will be useful to implement decision support system of maintenance sequence for CMMS/EAM (Computerized Maintenance Management System/Enterprise Asset Management).

• The Korean Journal of Applied Statistics
• /
• v.22 no.5
• /
• pp.1103-1113
• /
• 2009

We know that the first digits sequence of fibonacci numbers obey Benford's law. For the sequence in which the first two numbers are the arbitrary integers and the recurrence relation $a_{n+2}=a_{n+1}+a_n$ is satisfied, we can find that the first digits sequence of this sequence obey Benford's law. Also, we can find the stucture of the first digits sequence of this sequence with the exploratory data analysis tools.

• Composites Research
• /
• v.28 no.4
• /
• pp.182-190
• /
• 2015

The phenomenological evolution laws of damage can be defined either based on residual life or residual strength. The failure of a specimen can be defined immediately after or before fracture. The former is called in this paper by "failure defined by approach I" and the latter "failure defined by approach II." Usually at failure there is a discontinuity of loading variables and, because of this, damage at failure is discontinuous. Therefore the values of damage at failure by two different approaches are not the same. Based on this idea the sequence effects of the phenomenological evolution law of damage given by $dD/dN=g(D)f({\Phi})$ were studied. Thin-walled graphite/epoxy tubes consisting of four of $[{\pm}45]_s$ laminates were used for the experimental study of sequence effects and the effects of mean stress on fatigue life. It was found that the sequence effects in two step uniaxial fatigue for $[{\pm}45]_s$ graphite/epoxy tubular specimen showed that a high-low block loading sequence was less damaging than a low-high one.

• ETRI Journal
• /
• v.32 no.5
• /
• pp.676-686
• /
• 2010

Mining sequential patterns is an important research issue in data mining and knowledge discovery with broad applications. However, the existing sequential pattern mining approaches consider only binary frequency values of items in sequences and equal importance/significance values of distinct items. Therefore, they are not applicable to actually represent many real-world scenarios. In this paper, we propose a novel framework for mining high-utility sequential patterns for more real-life applicable information extraction from sequence databases with non-binary frequency values of items in sequences and different importance/significance values for distinct items. Moreover, for mining high-utility sequential patterns, we propose two new algorithms: UtilityLevel is a high-utility sequential pattern mining with a level-wise candidate generation approach, and UtilitySpan is a high-utility sequential pattern mining with a pattern growth approach. Extensive performance analyses show that our algorithms are very efficient and scalable for mining high-utility sequential patterns.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.155-166
• /
• 2001

This paper deals with the subsequence searching problem under time-warping. Our work is motivated by the observation that subsequence searches slow down quadratically as the average length of data sequences increases. To resolve this problem, the Segment-Based Approach for Subsequence Searches (SBASS) is proposed. The SBASS divides data and query sequences into a series of segments, and retrieves all data subsequences. Our segmentation scheme allows segments to have different lengths; thus we employ the time warping distance as a similarity measure for each segment pair. For efficient retrieval of similar subsequences, we extract feature vectors from all data segments exploiting their monotonically changing properties, and build a spatial index using feature vectors. The effectiveness of our approach is verified through extensive experiments.