• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.246-253
• /
• 2010

In this paper, a method of removing the space skew and cross-talk cancellation is proposed where the self-generated signals from the subject are used to obtain the subject's location. In the proposed method, the good spatial sound image is maintained even when the listener moves from the sweet spot. Two major parts of the proposed method are as follows: listener position tracking using the stimuli from the subject and removal of the space skew and cross-talk signals. Listener position tracking is achieved by estimation of the time difference of arrival (TDoA). The position of the listener is then computed using the Talyer-series estimation method. The head-related transfer functions (HRTF) are used to remove the space skew and cross-talk signals, where the direction of the HRTF is given by the one estimated from the listener position tracking. The performance evaluation is carried out on the signals from the 100 subjects that are composed of the 50 female and 50 male subjects. The positioning accuracy is achieved by 70%~90%, under the condition that the mean squared positioning error is less than $0.07m^2$. The subjective listening test is also conducted where the 27 out of the 30 subjects are participated. According to the results, 70% of the subjects indicates that the overall quality of the reproduced sound from the proposed method are improved, regardless of the subject's position.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.6
• /
• pp.607-613
• /
• 2009

In this paper, we made a simple paper feeding system which is one of MTS (media transport system) and controllers. The plant has a flexible paper and two driving rollers and two driven rollers. The control system has two conventional PID controllers. Skew angle and feeding speed of MTS deteriorate the quality of feeding system. In order to control a feeding speed and skew of feeding paper, we control rotational velocity of two driving rollers. Therefore, this controller has two inputs and two outputs as MIMO (multi-input and multi-output) system. The control inputs were the feeding speed and the skew displacement of the paper. The control outputs were the rotational velocity to each driving roller. To find appropriate PID gains of two controllers, we proposed an optimization technique. We assume the system variables and performance of a whole system as follows. PID gains of two controllers for skew and feeding speed are system variables. System performance is both skew and feeding speed. We simulates to making mathematical correlation using global Kriging interpolation. To find appropriate value of system variables, optimization method is simulation in sequence as following method. First, the optimization solver simulates with DOE (design of experiment) tables to find correlation equation of both system variable and performances. Then, the solver guesses the appropriate values and simulates if the system variables are appropriate or not. If the result of validation doesn't satisfy the convergence and iteration tolerance, the solver makes a new Kriging models and iterates this sequence until satisfy the tolerances.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.836-837
• /
• 2008

현재 화석에너지 고갈에 따른 다양한 신재생에너지의 활용에 대한 연구가 활발히 진행되고 있다. 본 논문은 영구자석을 사용한 수력용 영구자석 다극형 동기발전기의 기동토크 저감을 위한 최적설계 방안에 대해 연구를 수행하였다. 먼저 FEA 해석기법을 이용한 수력용 영구자석 다극형 동기발전기의 설계 및 발전기 기동토크에 가장 큰 영향을 주는 코깅토크 저감 방안에 대해 연구하였다. 코깅토크 저감을 위해 고정자 skew비에 따른 코깅토크의 변화를 FEA해석기법을 통해 알아보았으며, 실제 고정자에 skew를 적용하였을 때, 코깅토크의 최소화에 가장 적합함을 알 수 있었다. 또한 실제 설계된 영구자석 다극형 동발전기의 출력 및 코깅토크 측정 결과와 FEA해석결과를 비교 및 분석하여 FEA해석방법의 타당성을 입증하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.796-799
• /
• 2006

This paper presents a new method for automatic detection of skew in a document image using mathematical morphology. To speed up processing, we use reduced image but it still requires long time to estimate the skew angle so the proposed method works with region of interest, not with whole image. Character strings are connected by using morphological closing operation and a component labeling is used to select region of interest. The method considers the lowermost pixels of characters in candidate regions in the binary image of original document image. Experimental results shows that the proposed method is extremely fast and robust as well as independent of script forms.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.11
• /
• pp.64-74
• /
• 1999

A new clock skew optimization for clock routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevent the total wire length from increasing. As the clock skew is the major constraint for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization can increase total wire length, therefore clock routing is performed within the given skew bound which can not induce the malfunction. Clock routing under the specified skew bound can decrease total wire length Not only total wire length and delay time minimization algorithm using merging point relocation method but also clock skew reduction algorithm using link-edge insertion technique between two nodes whose delay difference is large is proposed. The proposed algorithm construct a new clock routing topology which is generalized graph model while previous methods uses only tree-structured routing topology. A new cost function is designed in order to select two nodes which constitute link-edge. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance difference is short. Furthermore, routing topology construction and wire sizing algorithm is developed to reduce clock delay. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the delay reduction under the given skew bound.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.13 no.6
• /
• pp.1070-1081
• /
• 1989

본 논문의 목적은 일반적인 곡면을 갖는 냉간단조 공정을 컴퓨터 시뮬레이션 을 통해 해석하고자 강소성 유한요소법의 프로그램을 개발하고, 이를 축대칭 및 평면 변형 단조성형에 적용하고자 한다. 축대칭 문제로는 산업적으로 이용이 많은 치차 블랭크(gear blank) 형태의 예제를 선택하였고 평면변형으 경우 정밀 단조품의 하나인 터어빈 블레이드(turbine blade)를 평면변형 문제로 보아 해석하였다. 한편 심한 변형을 하는 후방압출과 같은 문제의 수렴성을 향상시키고 공정을 계속적으로 해석하 기 위하여 격자 재구성기법을 도입함으로서 냉간단조 문제의 일반적인 해석을 하도록 한다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.7
• /
• pp.74-80
• /
• 2002

VLSI intergrated circuits like SOC(system on chip) often require a multi-clock design style for functional or performance reasons. The problems of the clock domain transition due to clock skew and clock ordering within a test cycle may result in wrong results. This paper describes a new BIST(Built-in Self Test) architecture for multi-clock systems. In the new scheme, a clock skew is eliminated by a multi-capture. Therfore, it is possible to perform at-speed test for both clock inter-domain and clock intra-domain.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.180-192
• /
• 2002

We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new harsh join methods in the shared-nothing multiprocessor environment. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets dynamically via a frequency distribution. Using harsh-based joins, multiple joins can be pipelined to that the early results from a join, before the whole join is completed, are sent to the next join processing without staying in disks. Shared nothing multiprocessor architecture is known to be more scalable to support very large databases. However, this hardware structure is very sensitive to the data skew. Unless the pipelining execution of multiple hash joins includes some dynamic load balancing mechanism, the skew effect can severely deteriorate the system performance. In this parer, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.

• The Korean Journal of Applied Statistics
• /
• v.17 no.1
• /
• pp.119-134
• /
• 2004

Generally to estimate the priority vector in AHP, an eigen-vector method or a log-arithmic least square method is applied to pairwise comparison matrix itself. In this paper an estimating method is suggested, which is applied to pairwise comparison matrix adjusted by using the eigen-decomposition of skew-symmetric matrix. We also show theoretical background, meanings, and several advantages of this method by example. This method may be useful in case that pairwise comparison matrix is quite inconsistent.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.219-231
• /
• 2005

Many applications in cluster computing require QoS (Quality of Service) services. Since performance predictability is essential to provide QoS service, underlying systems must provide predictable performance guarantees. One way to ensure such guarantees from network subsystems is to generate global schedules from applications'network requests and to execute the local portion of the schedules at each network interface. To ensure accurate execution of the schedules, it is essential that a global time base must be maintained by local clocks at each network interface. The task of providing a single time base is called a synchronization problem and this paper addresses the problem for system area networks. To solve the synchronization problem, FM-QoS (1) proposed a simple synchronization mechanism called FBS(Feedback-Based Synchronization) which uses built-in How control signals. This paper extends the basic notion of FM-QoS to a theoretical framework and generalizes it: 1) to identify a set of built-in network flow control signals for synchrony and to formalize it as a synchronizing schedule, and 2) to analyze the synchronization precision of FBS in terms of flow control parameters. Based on generalization, two application classes are studied for a single switch network and a multiple switch network. For each class, a synchroniring schedule is proposed and its bounded skew is analyzed. Unlike FM-QoS, the synchronizing schedule is proven to minimize the bounded skew value for a single switch network. To understand the analysis results in practical networks, skew values are obtained with flow control parameters of Myrinet-1280/SAN. We observed that the maximum bounded skew of FBS is 9.2 Usec or less over all our experiments. Based on this result, we came to a conclusion that FBS was a feasible synchronization mechanism in system area networks.