• ETRI Journal
• /
• v.30 no.4
• /
• pp.495-505
• /
• 2008

This paper presents a parallel processing searcher structure for the initial synchronization of a direct sequence ultra-wideband (DS-UWB) system, which is suitable for the digital implementation of baseband functionalities with a 1.32 Gsample/s chip rate analog-to-digital converter. An initial timing acquisition algorithm and a data demodulation method are also studied. The proposed searcher effectively acquires initial symbol and frame timing during the preamble transmission period. A hardware efficient receiver structure using 24 parallel digital correlators for binary phase-shift keying DS-UWB transmission is presented. The proposed correlator structure operating at 55 MHz is shared for correlation operations in a searcher, a channel estimator, and the demodulator of a RAKE receiver. We also present a pseudo-random noise sequence generated with a primitive polynomial, $1+x^2+x^5$, for packet detection, automatic gain control, and initial timing acquisition. Simulation results show that the performance of the proposed parallel processing searcher employing the presented pseudo-random noise sequence outperforms that employing a preamble sequence in the IEEE 802.15.3a DS-UWB proposal.

• The Pure and Applied Mathematics
• /
• v.8 no.2
• /
• pp.185-191
• /
• 2001

A k-hypertournament is a complete k-hypergraph with all k-edges endowed with orientations, i.e., orderings of the vertices in the edges. The incidence matrix associated with a k-hypertournament is called a 7-hypertournament matrix, where each row stands for a vertex of the hypertournament. Some properties of the hypertournament matrices are investigated. The sequences of the numbers of 1＇s and -1＇s of rows of a k-hypertournament matrix are respectively called the score sequence (resp. losing score sequence) of the matrix and so of the corresponding hypertournament. A necessary and sufficient condition for a sequence to be the score sequence (resp. the losing score sequence) of a k-hypertournament is proved.

• Journal of KIISE
• /
• v.45 no.2
• /
• pp.134-140
• /
• 2018

A chat system is a computer program that understands user's miscellaneous utterances and generates appropriate responses. Sometimes a chat system needs to answer users' simple information-seeking questions. However, previous generative chat systems do not consider how to embed knowledge entities (i.e., subjects and objects in triple knowledge), essential elements for question-answering. The previous chat models have a disadvantage that they generate same responses although knowledge entities in users' utterances are changed. To alleviate this problem, we propose a knowledge entity embedding method for improving question-answering accuracies of a generative chat system. The proposed method uses a Siamese recurrent neural network for embedding knowledge entities and their synonyms. For experiments, we implemented a sequence-to-sequence model in which subjects and predicates are encoded and objects are decoded. The proposed embedding method showed 12.48% higher accuracies than the conventional embedding method based on a convolutional neural network.

• Journal of KIISE:Software and Applications
• /
• v.30 no.9
• /
• pp.803-811
• /
• 2003

Multiple sequence alignment is a useful tool to identify the relationships among protein sequences. Dynamic programming is the most widely used algorithm to obtain multiple sequence alignment with optimal cost. However, dynamic programming cannot be applied to certain cost function due to its drawback and cannot be used to produce optimal multiple sequence alignment. We propose sub-alignment refinement algorithm to overcome the problem of dynamic programming. Also we show proposed algorithm can solve the problem of dynamic programming efficiently.

• Archives of Craniofacial Surgery
• /
• v.17 no.4
• /
• pp.181-185
• /
• 2016

Panfacial bone fracture is challenging. Even experienced surgeons find restoration of original facial architecture difficult because of the severe degree of fragmentation and loss of reference segments that could guide the start of facial reconstruction. To restore the facial contour, surgeons usually follow a general sequence for panfacial bone reduction. Among the sequences, the bottom-to-top and outside-in sequence is reported to be the most widely used in recent publications. However, a single sequence cannot be applied to all cases of panfacial fractures because of the variations in panfacial bone fracture patterns. In this article, we intend to find the reference and discuss the efficacy of inside-out sequence in facial bone fracture reconstruction.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.9
• /
• pp.188-196
• /
• 2003

In order to increase competitiveness and to gain economic benefit, companies ask more and more how to recycle their products in a efficient way. So far, to answer this question, companies are not sufficiently supported by suitable methods specially in the area of disassembly process planning. For this reason, we develop in collaboration with an industrial partner a new method for generating an optimal disassembly sequence. In the presented paper this method will be described in detail by considering the exiting assembly information, disassembly method and disassembly depth. PLM (Profit-Loss Margin) curve that is used to determine disassembly depth consists of profit value, disassembly cost and disassembly effect. Using assessment parameters, generated alternative disassembly sequences are evaluated and optimal disassembly sequence is proposed. This method is applied to generate the optimal disassembly sequence of Door Trim as an example.

• Journal of the Chungcheong Mathematical Society
• /
• v.9 no.1
• /
• pp.89-99
• /
• 1996

We introduce and study certain subgroups of homotopy groups which contain evaluation subgroups and use these subgroups to obtain a sequence similar to homotopy sequence of fibration. We use the sequence to calculate evaluation subgroups or generalized evaluation subgroups of some topological pair.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.7-12
• /
• 1994

This paper describes an outline of pseudorandom M-sequence and its applications to measurement and control engineering. At first, generation and properties of M-sequence is briefly described and then its applications to delay time measurement, information transmission by use of M-array, two dimensional positioning, fault detection of logical circuit, fault detection of RAM, linear and nonlinear system identification.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.10
• /
• pp.1364-1370
• /
• 2014

Power system fault analysis has been based on symmetrical component method, which describes power system elements by positive, negative and zero sequence impedance. Obtaining accurate line impedances as possible are very important for estimating fault current magnitude and setting distance relay accurately. Especially, accurate calculation of zero sequence impedance is important because most of transmission line faults are line-to-ground faults, not balanced three-phase fault. Since KEPCO has started measuring of transmission line impedance at 2005, it has been revealed that the measured and calculated line impedances are well agreed within reasonable accuracy. In case of underground transmission lines, however, large discrepancies in zero sequence impedance were observed occasionally. Since zero sequence impedance is an important input data for distance relay to locate faulted point correctly, it is urgently required to analyze, detect and consider countermeasures to the source of these discrepancies. In this paper, development of pre/post processor to ATP (Alternative Transient Program) version of EMTP (Electro-Magnetic Transient Program) for sequence impedance calculation was described. With the developed processor ATP-cable, effects of ground resistance and ECC (Earth Continuity Conductor) on sequence impedance were analyzed.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.12 no.19
• /
• pp.25-30
• /
• 1989

This study is concerned with a job sequencing method using the concept of sampling technique. This sampling technique has never been applied to develop the scheduling algorithms. The most job sequencing algorithms have been developed to determine the best or good solution under the special conditions. Thus, it is not only very difficult, but also taken too much time to develop the appropriate job schedules that satisfy the complex work conditions. The application areas of these algorithms are also very narrow. Under these circumstances it is very desirable to develop a simple job sequencing method which can produce the good solution with the short tine period under any complex work conditions. It is called a sampling job sequencing method in this study. This study is to examine the selection of the good job sequence of 1%-5% upper group by the sampling method. The result shows that there is the set of 0.5%-5% job sequence group which has to same amount of performance measure with the optimal job sequence in the case of experiment of 2/n/F/F max. This indicates that the sampling job sequencing method is a useful job sequencing method to find the optimal or good job sequence with a little effort and time consuming. The results of ANOVA show that the two factors, number of jobs and the range of processing time are the significant factors for determining the job sequence at $\alpha$=0.01. This study is extended to 3 machines to machines job shop problems further.