• 한국시뮬레이션학회논문지
• /
• 제11권2호
• /
• pp.77-88
• /
• 2002

Petri nets is a widely used formalism for specification and analysis of concurrent systems which is a subclass of discrete event systems. The DEVS (Discrete Event System Specification) formalism provides a general framework for specification of discrete event systems in a hierarchical, modular form. Often, modeling a discrete event system may employ both Petri Nets and DEVS formalism. In such a case low-level operational logics are modeled by Petri Nets and high-level managements by the DEVS formalism. Analysis of the system requires simulation of the overall system. This paper presents an algorithm for transformation of Petri Nets to DEVS formalism. The transformation enables modelers to simulate an overall system, which consists of DEVS models and Petri Nets models, in a unified DEVS simulation environment such as DEVSim++. An example for such transformation will be given.

• International Journal of CAD/CAM
• /
• 제2권1호
• /
• pp.45-54
• /
• 2002

Given a set of three generator circles in a plane, we want to find a circumcircle of these generators. This problem is a part of well-known Apollonius' $10^{th}$ Problem and is frequently encountered in various geometric computations such as the Voronoi diagram for circles. It turns out that this seemingly trivial problem is not at all easy to solve in a general setting. In addition, there can be several degenerate configurations of the generators. For example, there may not exist any circumcircle, or there could be one or two circumcircle(s) depending on the generator configuration. Sometimes, a circumcircle itself may degenerate to a line. We show that the problem can be reduced to a point location problem among the regions bounded by two lines and two transformed circles via $M{\ddot{o}}bius$ transformations in a complex space. The presented algorithm is simple and the required computation is negligible. In addition, several degenerate cases are all incorporated into a unified framework.

• 로봇학회논문지
• /
• 제1권1호
• /
• pp.36-45
• /
• 2006

In this paper, we introduce visual contexts in terms of types and utilization methods for robust object recognition with intelligent mobile robots. One of the core technologies for intelligent robots is visual object recognition. Robust techniques are strongly required since there are many sources of visual variations such as geometric, photometric, and noise. For such requirements, we define spatial context, hierarchical context, and temporal context. According to object recognition domain, we can select such visual contexts. We also propose a unified framework which can utilize the whole contexts and validates it in real working environment. Finally, we also discuss the future research directions of object recognition technologies for intelligent robots.

• Journal of the Korean Institute of Landscape Architecture International Edition
• /
• 제2호
• /
• pp.94-101
• /
• 2004

This study aimed at providing suggestions in designing open space so that parks and bordering facilities are well related to each other in terms of the visual access and human activities. The design survey was conducted in the center of Osaka City, using parks there as the study material. The relation between parks and their bordering facilities was evaluated in terms of the visual access and human activities. Through the results of this study, as the design methods for improving relations between parks and their bordering facilities, unified design and creation of square in the boundary area between them, placing access paths to facilities in parks, and planting trees to create Vista, Screen, and Framework landscapes are of great importance.

• 한국언어정보학회지:언어와정보
• /
• 제6권1호
• /
• pp.91-103
• /
• 2002

The temporal structure of events on the discourse level has long been of great interest in both theoretical and computational linguistics. In this paper, we offer a unified approach to the temporal relationships related to a hierarchical discourse structure. We apply the method of pronoun resolution to the interpretation of tense. It is based on an analysis within the framework of the controlled information packaging theory. A unique aspect of our account is that temporal interpretation across discourse segments in global discourse is subject to the same principles as the interpretation of global anaphora, and that there is thus no need to postulate independent principles to account for the discourse behaviour of tense. In this way, we can neatly explain the general view that tense parallels the anaphoric nature of pronouns.

• 한국언어정보학회지:언어와정보
• /
• 제2권1호
• /
• pp.157-176
• /
• 1998

This paper claims that beneficiary adjuncts are best analyzed as involving external predication in a version of grammatical framework called Head-driven Phrase Structure Grammar. This paper also claims that verbal catefories need to include the attribute INDEX among their semantic components in order to account for the external predication proposed in this paper. This paper distinguishes between recipient and beneficiary reles and assumes that the former is a semantic argument of a verb-type relation and that the latter is an adjunct which makes a semantic contribution as a modifier. This approach achives a unified analysis of modification phenomena of nominal and verbal categories and it can also accomodate Parson's(1990) idea that a verbal category denotes a set of events, not just an event.

• 한국멀티미디어학회논문지
• /
• 제19권9호
• /
• pp.1659-1668
• /
• 2016

Understanding 3D structure of scenes is of a great interest in various vision-related tasks. In this paper, we present a unified approach for estimating depth from a single monocular image. The key idea of our approach is to take advantages both of parametric learning and non-parametric sampling method. Using a parametric convolutional network, our approach learns the relation of various monocular cues, which make a coarse global prediction. We also leverage the local prediction to refine the global prediction. It is practically estimated in a non-parametric framework. The integration of local and global predictions is accomplished by concatenating the feature maps of the global prediction with those from local ones. Experimental results demonstrate that the proposed method outperforms state-of-the-art methods both qualitatively and quantitatively.

• 한국정보통신학회논문지
• /
• 제11권3호
• /
• pp.471-478
• /
• 2007

SA 필터는 선형 필터와 순서통계에 기초한 비선형 필터의 특성을 모두 포함하는 광범위한 필터군으로 소개되었다. 이 필터에 대한 최적설계 방법이 소개되면서 선형 필터와 비선형 필터를 통합된 구조하에서 설계할 수 있게 되었다. 본 논문에서는 선형 필터가 최적의 성능을 보이는 가우스 잡음과 비선형 필터가 최적의 성능을 보이는 일펄스 잡음이 동시에 존재하는 혼합 잡음 환경에서 최적 SA 필터를 설계하고 성능 분석을 통하여 이러한 응용에서 SA 필터가 기존의 필터에 비하여 우수한 성능을 나타낸다는 것을 보였다.

• International Journal of Computer Science & Network Security
• /
• 제21권3호
• /
• pp.153-164
• /
• 2021

The increasing importance of such fields as embedded systems, pervasive computing, and hybrid systems control is increasing attention to the time-dependent aspects of system modeling. In this paper, we focus on modeling conceptual time. Conceptual time is time represented in conceptual modeling, where the notion of time does not always play a major role. Time modeling in computing is far from exhibiting a unified and comprehensive framework, and is often handled in an ad hoc manner. This paper contributes to the establishment of a broader understanding of time in conceptual modeling based on a software and system engineering model denoted thinging machine (TM). TM modeling is founded on a one-category ontology called a thimac (thing/machine) that is used to elaborate the design and analysis of ontological presumptions. The issue under study is a sample of abstract modeling domains as exemplified by time. The goal is to provide better understanding of the TM model by supplementing it with a conceptualization of time aspects. The results reveal new characteristics of time and related notions such as space, events, and system behavior.

• Journal of Information Processing Systems
• /
• 제19권1호
• /
• pp.80-88
• /
• 2023

RGB-thermal (RGB-T) tracking using unmanned aerial vehicles (UAVs) involves challenges with regards to the similarity of objects, occlusion, fast motion, and motion blur, among other issues. In this study, we propose dynamic tracking aggregation (DTA) as a unified framework to perform object detection and data association. The proposed approach obtains fused features based a transformer model and an L1-norm strategy. To link the current frame with recent information, a dynamically updated embedding called dynamic tracking identification (DTID) is used to model the iterative tracking process. For object association, we designed a long short-term tracking aggregation module for dynamic feature propagation to match spatial and temporal embeddings. DTA achieved a highly competitive performance in an experimental evaluation on public benchmark datasets.