• Journal of Satellite, Information and Communications
• /
• v.9 no.3
• /
• pp.33-40
• /
• 2014

One of the most important requirements for the Ethernet-based automobile is the reliability. In order to achieve this goal, we propose using the High-availability Seamless Redundancy (HSR) protocol (IEC 62439-3 clause 5) in these networks. The HSR protocol provides duplicated frame copies for each sent frame, which means that the destination node will receive at least one copy in case the second copy is lost due to a failure. In other words, there will be no network stoppage even if failure occurs. Moreover, the destination node will receive at least one frame copy with zero-recovery time (seamless) and it will not need to wait to receive the other copy if the first one is lost, which occurs it in the Ethernet standard, as a result of reconfiguration of the network paths. However, the main drawback of the HSR protocol is the unnecessary redundant traffic that is caused by the duplicated frames. Several solutions, including QR, VRing, RURT, and DVP, have already been proposed to improve the traffic performance of the HSR protocol. In this paper, we propose three automobile network topologies. each of which has pros and cons depending on the automobile requirements. Then we applied the HSR protocol with and without the QR and VRing approaches to each scenario. The comparison among these topologies depend on the traffic performance result for each of them. The QR and VRing approaches give a better traffic reduction percentage, ranging from 48% to 75% compared to the standard HSR protocol. Therefore they could limit the redundant traffic in automobile networks when the HSR protocol is used instead of the Ethernet network, which does not provide any seamless recovery if a failure occurs.

• Koreanishche Zeitschrift fur Deutsche Sprachwissenschaft
• /
• v.6
• /
• pp.79-98
• /
• 2002

지금까지 우리는 한국어와 독일어를 비교하면서 동사의 정형과 부정형을 관찰해 왔다. 이 부정성(역으로 말하면 비구속성)은 한국어 동사에는 전반적으로 통용되는 데 반해 독일어에는 부정형/동사원형과 분사가 그러할 뿐이다. 동사의 특성 연구는 어느 자연어/개별언어의 상이한 기능을 위해서 뿐만이 아니라 외국어 학습/습득을 위해서도 큰 의미를 갖는다. 이러한 중요성에도 불구하고 독특한 한국어 동사의 부정성, 그 연구는 거의 찾아볼 수가 없다. 한국어와 독일어 동사의 부정성 비교에서 드러난 문제점은 대체로 다음과 같이 요약될 수 있을 것이다. $\ast$ 한국어 동사의 특징인 부정성은 우리의 운명으로 간주해야 할 것이다. 왜냐하면 우리가 어떤 면에서는 유익함을, 그리고 어떤 다른 면에서는 문제점을 감수해야 하기 때문이다. 특히 전형적인 전치성 언어인 유럽언어를 습득할 때 언어간섭현상을 통해 그러하다. $\ast$ 독일어의 부정사/분사 및 한국어 동사가 인칭변화를 하지 않는다는 것은 그들이 주어를 갖지 않고 있거나 (독일어의 경우), 아니면 그것이 어떤 문법/통사적 역할을 하는가 (한국어의 경우)에 주된 원인이 있다. $\ast$ 비교 대상의 양쪽은 생략가능성, 즉 원자가 요구에 대한 자유/비구속성을 누린다. 핵(성분), 즉 독일어의 부정형 및 분사 그리고 한국어 동사는 혼자 남을 때까지 생략이 계속될 수 있다. 이러한 의미에서 부정성은 <비한정성/비구속성>과 관련된 것 같으며, 반면에 정동사의 특성은 <한정성/구속성>과 관계되어 있다. $\ast$ 원자가 요구/충족에 대한 자유/비구속성은 한국어 동사/술어가 문장 끝에 고정되어 있다는 사실은, 직접 또는 간접으로 본동사 앞에 놓여 있어야 되는 모든 문장성분과 부문장 때문에, 즉 한국어의 전면적인 전위수식 현상으로 흔히 큰 부담/복잡함을 야기한다는 데에 그 원인이 있다. 이러한 상황에서 동사는 가능한 한 그의 문장성분을 줄이려 한다. 통사적으로 보장되어 이미 있으니 말이다. 그래서 한국어 동사의 부정성은 일종의 부담해소 대책으로 간주될 수 있을 것이다. $\ast$ 두 비교 대상에서의 핵 및 최소문장 가능성은 역시 원자가에 대한 비구속성에서 비롯된다. $\ast$ 우리 한국인이 빨리 말할 때 흔히 범하는 부정성으로 인한 인칭변화에서의 오류는 무엇보다도 정형성/제한성을 지닌 독일어 정동사가 인칭 변화하는 데 반해 한국어에서는 부정성/비구속성을 지닌 동사가 그것과는 무관한 페 기인한다. 동사의 속성을 철저히 분석함으로써 이런 과오를 극복해야 할 것이다. 한국어 동사의 부정성은 지금까지 거의 연구되지 않았다. 이 문제는 또한 지속적으로 수많은 다른 자연어들과의 비교분석을 통해 관찰돼야 할 것이다. 이 논문이 이런 연구와 언어습득을 위한 작업에 도움이 되기를 바란다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3874-3884
• /
• 2000

An information retrieval system has to retrieve all and only documents which are relevant to a user query, even if index terms and query terms are not matched exactly. However, term mismatches between index terms and qucry terms have been a serious obstacle to the enhancement of retrieval performance. In this paper, we discuss automatic term normalization between words in text corpora and their application to a Korean information retrieval system. We perform two types of term normalizations to alleviate semantic term mismatches: equivalence class and co-occurrence cluster. First, transliterations, spelling errors, and synonyms are normalized into equivalence classes bv using contextual similarity. Second, context-based terms are normalized by using a combination of mutual information and word context to establish word similarities. Next, unsupervised clustering is done by using K-means algorithm and co-occurrence clusters are identified. In this paper, these normalized term products are used in the query expansion to alleviate semantic tem1 mismatches. In other words, we utilize two kinds of tcrm normalizations, equivalence class and co-occurrence cluster, to expand user's queries with new tcrms, in an attempt to make user's queries more comprehensive (adding transliterations) or more specific (adding spc'Cializationsl. For query expansion, we employ two complementary methods: term suggestion and term relevance feedback. The experimental results show that our proposed system can alleviatl' semantic term mismatches and can also provide the appropriate similarity measurements. As a result, we know that our system can improve the rctrieval efficiency of the information retrieval system.

• Journal of KIISE
• /
• v.42 no.5
• /
• pp.642-651
• /
• 2015

A vanishing point is a point where parallel lines converge, and they become evident when a camera's lenses are used to project 3D space onto a 2D image plane. Vanishing point detection is the use of the information contained within an image to detect the vanishing point, and can be utilized to infer the relative distance between certain points in the image or for understanding the geometry of a 3D scene. Since parallel lines generally exist for the artificial structures within images, line-detection-based vanishing point-detection techniques aim to find the point where the parallel lines of artificial structures converge. To detect parallel lines in an image, we detect edge pixels through edge detection and then find the lines by using the Hough transform. However, the various textures and noise in an image can hamper the line-detection process so that not all of the lines converging toward the vanishing point are obvious. To overcome this difficulty, it is necessary to assign a different weight to each line according to the degree of possibility that the line passes through the vanishing point. While previous research studies assigned equal weight or adopted a simple weighting calculation, in this paper, we are proposing a new method of assigning weights to lines after noticing that the lines that pass through vanishing points typically belong to artificial structures. Experimental results show that our proposed method reduces the vanishing point-estimation error rate by 65% when compared to existing methods.

• Journal of Intelligence and Information Systems
• /
• v.29 no.1
• /
• pp.265-288
• /
• 2023

Process mining has generally analyzed the default logs of Information Systems such as SAP ERP, but as the use of automation software called RPA expands, the logs by RPA bots can be utilized. In this study, the actual status of RPA automation in the field was identified by applying RPA bots to the work of three domestic manufacturing companies (cosmetic field) and analyzing them after leaving logs. Using Uipath and Python, we implemented RPA bots and wrote logs. We used Disco, a software dedicated to process mining to analyze the bot logs. As a result of log analysis in two aspects of bot utilization and performance through process mining, improvement requirements were found. In particular, we found that there was a point of improvement in all cases in that the utilization of the bot and errors or exceptions were found in many cases of process. Our approach is very scientific and empirical in that it analyzes the automation status and performance of bots using data rather than existing qualitative methods such as surveys or interviews. Furthermore, our study will be a meaningful basic step for bot behavior optimization, and can be seen as the foundation for ultimately performing process management.

• Korean Association for Visual Culture
• /
• v.35
• /
• pp.5-33
• /
• 2019

This paper examines the problems of the concept of 'analogon' which occupies an important place in Jean-Paul Sartre's theory of imagination and his 'aesthetic of the unreal', focusing on Michel Dufrenne's objection to the concept. In the Imaginary (1940), Sartre offers a phenomenological account of the imaginative experience and his theory of imagination provides the basis for his account of experience of art. Sartre distinguishes the imagining consciousness from the realizing consciousness of perception. The work of art, for Sartre, is transformed into an irreal thing ("The work of art is irreality."), i.e. it appears only as aesthetic object, and only under the condition that the spectator's consciousness changes into an imagining consciousness. Some claim that Sartre underemphasizes the function of materiality in artworks. Mikel Dufrenne, in his The Phenomenology of Aesthetic Experience (1953), criticizes Sartre's thesis of irreality. Dufrenne argues that the aesthetic object is the work of art accomplished by aesthetic perception, the meaning of the aesthetic object is given as a whole in the sensuous and does not refer to something that lies outside the object as with imagination or irreality. An affective a priori is the condition of possibility for the occurrence of aesthetic experience.

• Journal of The Korean Association For Science Education
• /
• v.26 no.6
• /
• pp.703-722
• /
• 2006

The purpose of this study is to investigate the characteristics of abduction suggested by C. S. Peirce, and to discuss its implications in science education. Peirce's abduction is the logic of generating hypothesis. Abduction is a kind of logical inference, which colligates general rule and the observed result, and then it makes us judge the observed result as a case of the general rule on the basis of their resemblance. The process of abduction is also the logic of inquiry. In a Peirce's view, inquiry is a struggle for escaping from the condition of 'doubt' and to 'belief the nature of which is the establishment of habits. Because what habit an object has is its whole meaning, in his views, the fixation of belief is the way of attaining the truth related to it. The beliefs of individuals, however, are always fallible. So, to attain a truth, we need the terminal opinion of community of inquiry that could conduct infinite inquiry. These characteristics of Peirce's abduction give suggestions in science education as follows; firstly, hypothesis generating which transforms the condition of 'doubt' into the 'belief by considering practical effects should be highlighted, secondly, logical inference which makes us judge the observed result as a case of the general rule on the basis of resemblance should be highlighted, and thirdly, communities of inquiry which stand on the view of modest realism should be intended toward. These results could be expected in playing a role in critical discussion on science education relating to abduction.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.2
• /
• pp.155-163
• /
• 2009

In text-to-speech systems, the conversion of text into prosodic parameters is necessarily composed of three steps. These are the placement of prosodic boundaries. the determination of segmental durations, and the specification of fundamental frequency contours. Prosodic boundaries. as the most important and basic parameter. affect the estimation of durations and fundamental frequency. Break prediction is an important step in text-to-speech systems as break indices (BIs) have a great influence on how to correctly represent prosodic phrase boundaries, However. an accurate prediction is difficult since BIs are often chosen according to the meaning of a sentence or the reading style of the speaker. In Japanese, the prediction of an accentual phrase boundary (APB) and major phrase boundary (MPB) is particularly difficult. Thus, this paper presents a method to complement the prediction errors of an APB and MPB. First, we define a subtle BI in which it is difficult to decide between an APB and MPB clearly as a variable break (VB), and an explicit BI as a fixed break (FB). The VB is chosen using the classification and regression tree, and multiple prosodic targets in relation to the pith and duration are then generated. Finally. unit-selection is conducted using multiple prosodic targets. In the MOS test result. the original speech scored a 4,99. while proposed method scored a 4.25 and conventional method scored a 4.01. The experimental results show that the proposed method improves the naturalness of synthesized speech.

• Journal of the Korean association of regional geographers
• /
• v.13 no.4
• /
• pp.454-460
• /
• 2007

Korean War resulted in the fact that Demilitarized Zone (DMZ) on the neck of Korean peninsular was totally forgotten by people for more than half a century. But recently, as the concern in this DMZ has been rising inside and outside of Korea, the researches on this subject have been gradually quickening. However, the practical studies about spatial extent of DMZ are very feeble. Even the analysis of the previous studies shows that the most of researches had mistakes in the spatial description of MDL and DMZ, neutral territory of Han River estuary, and NLL. In this study the length of MDL, stretching till the estuary of western Lim- Jin River in Myung-Ho Ri of Goseong region on East Coast, was measured to be about Z38km (l48miles); the area of corresponding DMZ was proved to be approximately $903.8km^2$ ($907.3km^2$ in the previous studies). Such results show that it is necessary to decide the terms for calling the space dividing North and South Korea, similarly to "155-mile truce line".

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.68-70
• /
• 1998

본 논문에서는 클록들을 주기적으로 동기화하는 분산 실시간 시스템에서 주어진 태스크의 시간 제약(timing constraint)을 변환시는 구가지 기법을 제안한다. 전형적인 이산 클록 동기화(discrete clock synchronization)알고리즘은 클록의 값을 순간적으로 보정(correct)하여 클록의 시간이 불연속적으로 진행학 한다. 이러한 시간상의 불연속성은 태스크의 시작제한시간(release time)이나 종료시한(deadline)과 같은 이벤트를 잃어버리거나 다시 발생시키는 오류를 범하게 한다. 클록 시간의 불연속성을 피하기 위해 일반적으로 연속 클록 동기화(continuous clock synchronization) 기법이제안되었지만 소프트웨어적으로 구현되기에는 많은 오버헤드를 유발시키는 문제점이 있다. 이에 따라 연속 클록 동기화는 PLL (Phase-Locked Loop)을 이용한 별도의 하드웨어를 사용하는 것이 보통이다. 본 논문에서는 연속 클록 동기화 기법을 사용하는 대신, 태스크의 시간 제약을 동적으로 변환시키는 DCT (Dynamic Constraint Transformation) 기법을 제안하였다. DCT는 소프트웨어 으로 구현이 가능하여 새로운 하드웨어를 필요로 하지 않으며, 이를 통해 기존의 이산적으로 동기화된 시스템에서 클록 시간의 불연속성에 의한 문제점들을 해결할 수 있다. 또 다른 문제점으로서, 클록의 물리적인 특성으로 인해 동기화된 클록들이 상한된(bounded from the above)오차(skew)를 갖는다는 것이다. 이러한 오차는 지역 클록(local clock)에 대해 만족될 수 있는 임의의 실기간 제약 조건이 전역 클록(global clock)에 대해서는 만족되지 않을 수 있음을 의미한다. 본 논문에서는 이를 위해 먼저 두 가지의 스케줄링 가능성, 지역적 스케줄링 가능서(local schedulability)과 전역적 스케줄링 가능성(global schedulability)을 정의하고, 실시간 제약을 정적으로 변환시키는 SCT (Static Constraint Transformation)기법을 제안하였다. SCT를 통해 지역적으로 스케줄링 가능한 태스크는 전역적으로 스케줄링이 가능하므로, 단지 지역적 스케줄링 가능성만을 검사하면서 스케줄링 문제를 해결할 수 있도록 하였다.