• 음성과학
• /
• 제15권3호
• /
• pp.53-63
• /
• 2008

This paper examined the acoustic differences in English speech production between English native speakers and Korean learners. Korean speakers seem to produce errors by over-applying the Korean phonological rules(nasalization and lateralization) to English speech under the conditions comparable to those of Korean which contain nasal+lateral or lateral+nasal sequences. Being based on this prediction, the experimental data is grouped into three sets, [n]+[l] sequence, [l]+[n]sequence, and [m]+[l] sequence. The result shows that, Korean speakers usually nasalize or lateralize the target words or phrases in every three categories while English natives don't. In set A([n]+[l] sequence), both nasalization and lateralization were found in [n]+[l] sequence, the same circumstances where both nasalization and lateralization can be placed as in Korean. In the case of set B([l]+[n] sequence), only lateralization is observed. It is because the nasalization never occurs in the sequence of l-n in Korean. There is no lateralization in set C([m]+[l] sequence), because only nasalization occurs in the sequence of m-l in Korean. This results reconfirmed that the nasalization and lateralization rules in Korean deeply influence on the English production data. Korean speakers need to be taught not to over-apply Korean phonological rule to English production for accurate pronunciation.

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제23권3호
• /
• pp.183-187
• /
• 2017

스마트폰 사용자들은 텍스트를 쉽게 읽고 빠르게 입력하기를 원한다. 이런 흐름에 따라 사용자들은 채팅 용어에서부터 전문 분야, 뉴스 기사에 이르기까지 여러 단어로 이루어진 어휘를 축약한 약어를 많이 사용한다. 그러므로 약어를 모아 데이터를 구축한다면 정보 검색과 추천 시스템 등에 유용하게 사용될 수 있다. 하지만 약어는 새로운 콘텐츠가 등장할 때마다 계속해서 생겨나기 때문에 수동으로 모으는 일은 쉽지 않으므로, 약어를 자동으로 생성하는 방법이 필요하다. 기존 연구들은 약어를 자동으로 생성하기 위해 규칙 기반 방법을 사용하였으나, 불규칙한 약어들은 생성할 수 없다는 한계점이 있다. 또한 규칙에 의해 생성된 후보 약어들 중에서 올바른 약어를 결정해야하는 문제도 발생한다. 따라서 본 논문에서는 이런 한계점을 극복하기 위해 시퀀스 투 시퀀스 학습 방법을 사용하여 약어를 자동으로 생성한다. 시퀀스투 시퀀스 학습 방법은 심층 신경망으로 기존의 규칙 기반 방법으로 생성할 수 없던 불규칙한 약어들을 생성할 수 있다. 게다가 후보 약어들 중 올바른 약어를 결정할 문제가 발생하지 않기 때문에 자동으로 약어를 생성하는 문제에 적합하다. 본 논문에서는 제안한 방법을 평가한 결과, 기존의 연구에서 생성할 수 없던 불규칙적인 약어를 생성하여 제안한 모델이 효과적임을 증명하였다.

• 한국통신학회논문지
• /
• 제27권7A호
• /
• pp.635-640
• /
• 2002

이 논문에서는 직접 수열 대역 확산 (DS/SS) 통신에서 비동기 서명 수열의 병렬 부호 획득을 위한 최적 및 준 최적의 결정법을 다룬다. 기존의 병렬 부호 획득 기법은 수신기에서 상관기 출력이 가장 큰 신호를 선택하는 것인데, 이 방법은 비동기 서명 수열에 대해 최적의 성능을 내지 못한다고 알려져 있다. 이 논문에서는 비동기 서명수열에 맞는 최적의 결정법을 최대 우도비 기준에 바탕을 두고 유도한다. 또한 이보다 간단하게 구현할 수 있는 준최적 결정법도 제안한다. 최적 및 준최적 결정법의 성능은 비동기 서명 수열에 대해 기존의 결정법을 능가함을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.242-259
• /
• 2015

Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제23권9호
• /
• pp.542-549
• /
• 2017

Sequence-to-sequence 모델과 이와 유사한 포인터 네트워크는 입력이 여러 문장으로 이루어 지거나 입력 문장의 길이가 길어지면 성능이 저하되는 문제가 있다. 이러한 문제를 해결하기 위해 본 논문에서는 여러 문장으로 이루어진 입력열을 단어 레벨과 문장 레벨로 인코딩을 수행하고, 디코딩에서 단어 레벨과 문장 레벨 정보를 모두 이용하는 계층적 포인터 네트워크 모델을 제안하고, 이를 이용하여 모든 멘션(mention)에 대한 상호참조해결을 수행하는 계층적 포인터 네트워크 기반 상호참조해결을 제안한다. 실험 결과, 본 논문에서 제안한 모델이 정확률 87.07%, 재현율 65.39%, CoNLL F1 74.61%의 성능을 보였으며, 기존 규칙기반 모델 대비 24.01%의 성능 향상을 보였다.

• Industrial Engineering and Management Systems
• /
• 제3권2호
• /
• pp.100-115
• /
• 2004

The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.825-827
• /
• 1989

A heuristic model which determines the scheduling of serial flowshops with minimization of the makespan is proposed for an idealized batch chemical plant. It generates an initial sequence by heuristic reasoning and improves it recursively until no improvement is possible. The heuristic reasoning is based on Johnson's Rule which gives the sequence with the minimum makespan for a two-unit flowshop. The evolutionary step searches the neighborhood of the current sequence for sequences with lower makespan. The robustness of this model is also examined by comparing the minimum makespan of literature examples with the theoretical one.

• Journal of Mechanical Science and Technology
• /
• 제18권12호
• /
• pp.2095-2103
• /
• 2004

A macro-level CAPP system is proposed to plan the complicated mechanical prismatic parts efficiently. The system creates the efficient machining sequence of the features in a part by analyzing the feature information. Because the planning with the individual features is very complicated, feature groups are formed for effective planning using the nested relations of the features of a part, and special feature groups are determined for sequencing. The process plan is generated based on the sequences of the feature groups and features. When multiple machines are required, efficient machine assignment is performed. A series of heuristic rules are developed to accomplish it.

• Industrial Engineering and Management Systems
• /
• 제4권1호
• /
• pp.1-22
• /
• 2005

This paper presents new scheduling heuristics, namely Mean Progressive Weighted Tardiness Estimator (MPWT) Heuristic Method and modified priority rules with sequence-dependent setup times consideration. These are designed to solve job shop scheduling problems with new performance measures - progressive weighted tardiness penalties. More realistic constraints, which are inter-machine overlapping sequence-dependent setup times, are considered. In real production environments, inter-machine overlapping sequence-dependent setups are significant. Therefore, modified scheduling generation algorithms of active and nondelay schedules for job shop problems with inter-machine overlapping sequence-dependent setup times are proposed in this paper. In addition, new customer-based measures of performance, which are total earliness and progressive weighted tardiness, and total progressive weighted tardiness, are proposed. The objective of the first experiment is to compare the proposed priority rules with the consideration of sequence-dependent setup times and the standard priority rules without setup times consideration. The results indicate that the proposed priority rules with setup times consideration are superior to the standard priority rules without the consideration of setup times. From the second experiment and the third experiment to compare the proposed MPWT heuristic approach with the efficient priority rules with setup times consideration, the MPWT heuristic method is significantly superior to the Batched Apparent Tardiness Cost with Sequence-dependent Setups (BATCS) rule, and other priority rules based on total earliness and progressive weighted tardiness, and total earliness and tardiness.

• 품질경영학회지
• /
• 제47권4호
• /
• pp.823-835
• /
• 2019

Purpose: This study deals with a production planning and scheduling problem to minimize the total weighted tardiness on hybrid flow shop with sets of non-identical parallel machines on stages, where parallel machines in the set are dedicated to perform specific subsets of jobs and sequence-dependent setup times are also considered. Methods: A two-stage approach, that applies MILP model in the 1st stage and dispatching rules in the 2nd stage, is proposed in this paper. The MILP model is used to assign jobs to a specific machine in order to equalize the workload of the machines at each stage, while new dispatching rules are proposed and applied to sequence jobs in the queue at each stage. Results: The proposed two-stage approach was implemented by using a commercial MILP solver and a commercial simulation software and a case study was developed based on the spark plug manufacturing process, which is an automotive component, and verified using the company's actual production history. The computational experiment shows that it can reduce the tardiness when used in conjunction with the dispatching rule. Conclusion: This proposed two-stage approach can be used for HFS systems with dedicated machines, which can be evaluated in terms of tardiness and makespan. The method is expected to be used for the aggregated production planning or shop floor-level production scheduling.