• BMB Reports
• /
• v.34 no.1
• /
• pp.51-58
• /
• 2001

Attempts using in vitro and in vivo selection procedures have been made to search for hammerhead ribozymes that have higher activities than the wild-type ribozyme and also to determine whether other sequences might be possible in the catalytic core of the hammerhead ribozyme. Active sequences selected in the past conformed broadly to the consensus core sequence except at A9, and no sequences were associated with higher activity than that of the hammerhead with the consensus core, an indication that the consensus sequence derived from viruses and virusoids is probably the optimal sequence [Vaish et al. (1997) Biochemistry 36, 6495-6501]. Recently, during construction of ribozyme expression vectors, we isolated a mutant hammerhead ribozyme, with an insertion of G between A9 and G10.1, that appeared to show significant activity [Kawasaki et al. (1996) Nucleic Acids Res. 24, 3010-3016; Kawasaki et al. (1998) Nature 393, 284-289]. We, therefore, characterized kinetic properties of the G-inserted mutant ribozymes in terms of the NUX rule. We demonstrate that the NUX rule is basically applicable to the G-inserted ribozymes and, more importantly, one type of G-inserted ribozyme was very active with $k_{cat}$, value of $6.4\;min^{-1}$ in 50 mM Tris-HCl (pH 8.0) and 10 mM $MgCl_2$ at $37^{\circ}C$.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.185-190
• /
• 2009

The event sequence of the same type from a set of events having time property can be summarized in one event. But if the event sequence having an interval, It is reasonable to be summarized more than one in independent sub event sequence of each other. In this paper, we suggest a method of temporal data mining that summarizes the interval events based on Allen's interval algebra and finds out interval event association rule from interval events. It provides better knowledge than others by using concept of an independent sub sequence and finding interval event association rules.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.2
• /
• pp.51-64
• /
• 2004

The purpose of this paper is to establish the Standard Korean Vocal Sound into Character Conversion Rule (Standard VSCC Rule) by reversely applying the Korean Standard Pronunciation Rule that regulates the way of reading written Hangeul sentences. The Standard VSCC Rule performs a crucially important role in Korean speech recognition. The general method of speech recognition is to find the most similar pattern among the standard voice patterns to the input voice pattern. Each of the standard voice patterns is an average of several sample voice patterns. If the unit of the standard voice pattern is a word, then the number of entries of the standard voice pattern will be greater than a few millions (taking inflection and postpositional particles into account). This many entries require a huge database and an impractically too many comparisons in the process of finding the most similar pattern. Therefore, the unit of the standard voice pattern should be a syllable. In this case, we have to resolve the problem of the difference between the Korean vocal sounds and the writing characters. The process of converting a sequence of Korean vocal sounds into a sequence of characters requires our Standard VSCC Rule. Making use of our Standard VSCC Rule, we have implemented a Korean vocal sounds into Hangeul character conversion system. The Korean Standard Pronunciation Rule consists of 30 items. In order to show soundness and completeness of our Standard VSCC Rule, we have tested the conversion system with various data sets reflecting all the 30 items. The test results will be presented in this paper.

• Journal of Advanced Navigation Technology
• /
• v.16 no.5
• /
• pp.831-838
• /
• 2012

In the transmission system, the transmission efficiency can be increased by applying the proper character coding method. This paper is to show the character coding rule in computer and information equipment etc to improve the transmission efficiency in datacommunications. The character coding rule showing in this paper was suggested by considering the two view points. First one is FLAG bits in HDLC and PPP protocol on datalink layer in OSI 7 layer. Second one is one of the scrambling method, HDB-3, on physical layer in OSI 7 layer. The former is to prevent the sequence of over 5bits of "1" in the character codes. The latter is to prevent the sequence of over 4bits of "0" in the character codes.

• Speech Sciences
• /
• v.8 no.3
• /
• pp.15-30
• /
• 2001

Lateralization, the change of a coronal nasal into a lateral in an l-n sequence, has been considered to be prosodically unrestricted, e.g. an utterance-span rule, in Korean (Han 1993, Park 1990). However, aerodynamic data of the nasal do not corroborate their claims. In the paper, I look at how lateralization can best be characterized. Specifically, I ask whether its domain is best treated via a syntax-based (Nespor & Vogel 1986, Selkirk 1984) or an intonation-based approach (Pierrehumbert 1980, Jun 1993) to prosodic structure. Based on nasal airflow data as a means of monitoring velum activity coincident with a nasal stop in an l-n sequence, combined with pitch tracks to define an accentual phrase, I argue that lateralization is neither an utterance-span rule nor a syntax-based rule. Sentences recorded with a potential environment for lateralization show that lateralization occurs within an accentural phrase but is blocked between accentual phrase boundaries. When intonation-based and syntax-based models disagree about phrase boundaries, lateralization only occurs where the intonation-based model predicts it will. This indicates that lateralization is best defined as an accentual pheonomenon, being sensitive to the accentual phrase. This finding lends further support to an intonation-based model for Korean prosodic structure (Jun 1993).

• ETRI Journal
• /
• v.39 no.5
• /
• pp.652-661
• /
• 2017

A mention has a noun or noun phrase as its head and constructs a chunk that defines any meaning, including a modifier. Mention detection refers to the extraction of mentions from a document. In mentions, coreference resolution refers to determining any mentions that have the same meaning. Pointer networks, which are models based on a recurrent neural network encoder-decoder, outputs a list of elements corresponding to an input sequence. In this paper, we propose mention detection using pointer networks. This approach can solve the problem of overlapped mention detection, which cannot be solved by a sequence labeling approach. The experimental results show that the performance of the proposed mention detection approach is F1 of 80.75%, which is 8% higher than rule-based mention detection, and the performance of the coreference resolution has a CoNLL F1 of 56.67% (mention boundary), which is 7.68% higher than coreference resolution using rule-based mention detection.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.44
• /
• pp.135-151
• /
• 1997

In this paper, we propose a simple and relatively efficient heuristic method to determine job sequencing in the flow-shop considering multiple criteria such as processing time, due date and cost. The proposed method is applicable to the flow- shop where the jobs are released simultaneously and their processing sequence is predetermined and not changed until the whole jobs are processed. To develop this method, we mixed and modified some well-known multi-attribute decision heuristics such as the simple linear weighting scheme, the lexicographic rule and the 'elimination by aspect' rule. Some computer simulations were conducted to test the efficiency of the proposed method and it has been compared with the SWPT (Shortest Working Processing Time) rule and EDD (Earliest Due Date) rule. The results show that our method is as effective as the traditional ones in terms of mean flow time, tardiness, makespan, cycle time, machine utilization, etc., and proved to be much simpler and more flexible to be used in real situations.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1235-1238
• /
• 2003

A rule-based CAPP(computer aided process planning) system is proposed in this research to develop integrated manufacturing process of machining and inspection using OMM(On-Machine Measurement) device. Generally workpiece composed of many primitive form features. This features are determined optimum inspection sequence by analyzing the feature information such as features-relationship, probe approach direction and etc. Proposed paper is more efficient method of CAIP(computer aided inspection planning) considered machining process

• ETRI Journal
• /
• v.34 no.2
• /
• pp.272-275
• /
• 2012

This letter studies the problem of exploiting multichannel diversity in a spectrum sharing system, where the secondary user (SU) sequentially explores channel state information on the licensed channels with time consumption. To maximize the expected achievable throughput for the SU, we formulate this problem as an optimal stopping problem, whose objective is to choose the right channel to stop exploration based on the observed signal-to-noise ratio sequence. Moreover, we propose a myopic but optimal rule, called one-stage look-ahead rule, to solve the stopping problem.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.11a
• /
• pp.51-57
• /
• 2003

In operating distributed systems, proactive management is one of the major concerns for better quality of service and future capacity planning. In order to handle this management problem effectively, it is necessary to analyze performances of the distributed system and events generated by components in the system. This paper provides a rule-based event parsing engine for proactive management. Our event parsing engine uses object hooking-based and event-token approaches. The object hooking-based approach prepares new conditions and actions in Java classes and allows dynamically exchange them as hook objects in run time. The event-token approach allows the event parsing engine consider a proper sequence and relationship among events as an event token to trigger an action. We analyze the performance of our event parsing engine with two different implementations of rule structure; one is table-based and the other is tree-based.