• Structural Engineering and Mechanics
• /
• v.17 no.5
• /
• pp.671-690
• /
• 2004

A meshless method with novel variation of point collocation by finite mixture approximation is developed in this paper, termed the meshless finite mixture (MFM) method. It is based on the finite mixture theorem and consists of two or more existing meshless techniques for exploitation of their respective merits for the numerical solution of partial differential boundary value (PDBV) problems. In this representation, the classical reproducing kernel particle and differential quadrature techniques are mixed in a point collocation framework. The least-square method is used to optimize the value of the weight coefficient to construct the final finite mixture approximation with higher accuracy and numerical stability. In order to validate the developed MFM method, several one- and two-dimensional PDBV problems are studied with different mixed boundary conditions. From the numerical results, it is observed that the optimized MFM weight coefficient can improve significantly the numerical stability and accuracy of the newly developed MFM method for the various PDBV problems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.1
• /
• pp.81-89
• /
• 1992

After much research on qualitative reasoning, the problem of ambiguities still hampers the practicality of this important AI tool. In this paper, the sources of ambiguities are examined in depth with a systems engineering point of view and possible directions to disambiguation are suggested. This includes some modeling strategies and an architecture of temporal inference for building unambiguous qualitative models of practical complexity. It is argued that knowledge of multiple levels in abstraction hierarchy must be reflected in the modeling to resolve ambiguities by introducing the designer's decisions. The inference engine must be able to integrate two different types of temporal knowledge representation to determine the partial ordering of future events. As an independent quantity management system that supports the suggested modeling approach, LIQUIDS(Linear Quantity-Information Deriving System) is described. The inference scheme can be conjoined with ordinary rule-based reasoning systems and hence generalized into many different domains.

• Journal of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.353-385
• /
• 2019

In this paper, we introduce the notion of combinatorial Auslander-Reiten (AR) quivers for commutation classes [${\tilde{w}}]$ of w in a finite Weyl group. This combinatorial object is the Hasse diagram of the convex partial order ${\prec}_{[{\tilde{w}}]}$ on the subset ${\Phi}(w)$ of positive roots. By analyzing properties of the combinatorial AR-quivers with labelings and reflection functors, we can apply their properties to the representation theory of KLR algebras and dual PBW-basis associated to any commutation class [${\tilde{w}}_0$] of the longest element $w_0$ of any finite type.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.38 no.2
• /
• pp.37-52
• /
• 2010

The main purpose of this study is to examine how place representation is related to the formation of urban parks in Seoul, which began at the end of the 19th century. In order to grasp place representation, the hypothesis of this study is that most urban parks are undertaken with the idea of monumentality and symbolism or memories of the place itself. Diverse ways of representation through physical or non-physical aspects of symbolism, monumentality, and place memory are summarized as follows. First, in the case of the physical aspects of representation in the parks, monumentality and symbolism are expressed mostly through monuments or statues. In the case that the intention of the park is commemorative, celebrative elements are more actively utilized. In other cases, symbolic sculptures or statues, which are randomly designated by the government, are so often used regardless of the overarching concept of the urban park. In addition, in the case of place memory, monumentality or symbolism are commonly represented through bronze statues or partial remnants of the past. Recently, however, the site in itself has been constructed to coordinate the memories of a certain place into the configuration of the park. Secondly, in relation to the non-physical representation elements, many urban parks tend to reveal monumentality or symbolism through the names they are given. Recently, this tendency has significantly dropped, but some places of parksare frequently denominated in consideration of place memory. In the case of events held in parks, parks which were constructed in the beginning of the park movement, such as Tapgol Park, hold certain events to commemorate certain causes that took place in those days. On the other hand, the main purpose of recently-constructed urban parks relating to place memory is to encourage citizens to participate in events in a variety of ways.

• Journal of KIISE:Software and Applications
• /
• v.26 no.10
• /
• pp.1247-1259
• /
• 1999

본 논문에서는 한국어 문장형성원리를 간결하게 제시할 수 있도록 X-바 이론의 중심어 개념을 도입한 한국어 자질기반 문법을 제안한다. 제안하는 문법은 어절에 관계없이 나타나는 한국어의 문법현상을 명확히 설명할 수 있도록 어절 대신 형태소를 기본단위로 한다. 그리고, 한국어의 구문범주가 지닌 의미정보와 기능정보를 자질을 이용하여 독립적으로 표현하며, 구문범주간의 결합관계를 바탕으로 하는 자질연산을 수행하여 문장을 분석한다. 또한, 한국어의 부분자유어순과 생략현상에 대해 견고하게 분석할 수 있도록 자질연산을 이진결합중심의 CNF(Chomsky Normal Form)로 제한한다. 이렇게 구성된 한국어 자질기반 문법은 규칙을 직관적이고도 간단하게 기술하며, 한국어의 다양한 문장들을 견고하게 분석한다. SERI Test Suites 97과 신문기사에서 746문장을 추출하여 실험한 결과 94%~99%의 적용율을 보였다.Abstract In this paper, we propose a Korean feature-based grammar(KFG) which adopts the X-bar theoretic notion of headedness for a precise representation of Korean syntactic structure. In order to explain various language phenomena in a given sentence, we use not the word but the morpheme as a constituent unit of KFG. We use features manifesting both the syntactic information and the semantic information of Korean syntactic categories, and feature operations based on the association relationship between two categories. In addition, we restrict feature operations to CNF(Chomsky Normal Form) binary form, which provides a robust representation for properties in Korean such as the frequent ellipsis and the partial free-order. The KFG is intuitive, simple, and versatile in representing most Korean sentences. The experimental result shows 94%~99% coverage on 746 sentences extracted from SERI Test Suites 97 and newspaper sentences.

• Journal of Broadcast Engineering
• /
• v.15 no.2
• /
• pp.236-247
• /
• 2010

Recently, mean shift tracking algorithms have been proposed which use the information of color histogram together with some spatial information provided by the kernel. In spite of their fast speed, the algorithms are suffer from an inherent instability problem which is due to the use of an isotropic kernel for spatiality and the use of the Bhattacharyya coefficient as a similarity function. In this paper, we analyze how the kernel and the Bhattacharyya coefficient can arouse the instability problem. Based on the analysis, we propose a novel tracking scheme that uses a new representation of the location of the target which is constrained by the color, the area, and the spatiality information of the target in a more stable way than the mean shift algorithm. With this representation, the target localization in the next frame can be achieved by one step computation, which makes the tracking stable, even in difficult situations such as low-rate-frame environment, and partial occlusion.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.6 s.109
• /
• pp.562-573
• /
• 2006

It is required to reduce the peak-to-average power ratio(PAPR) in an orthogonal frequency division multiplexing system or a multicarrier system. And it is needed to eliminate the transmission of the side information in the Partial Transmit Sequences. So, in this paper, a new technique is proposed, where the subcarriers used for the multiple signal representation are only utilized for the reduction of PAPR to eliminate the burden of transmitting the side information. That is, it is proposed by taking the modified minimization criteria of partial transmit sequences scheme instead of using the convex optimization or the fast algorithm of tone reservation(TR) technique As the result of simulation, the PAPR reduction capability of the proposed method is improved by 3.2 dB dB, 3.4 dB, 3.6 dB with M=2, 4, 8(M is the number of partition in the so-called partial transmit reduction sequences(PTRS)), when the iteration number of fast algorithm of TR is 10 and the data rate loss is 5 %. But it is degraded in the capability of PAPR reduction by 3.4 dB, 3.1 dB, 2.2 dB, comparing to the TR when the data rate loss is 20 %. Therefore, the proposed method is outperformed the TR technique with respect to the complexity and PAPR reduction capability when M=2.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.36 no.3
• /
• pp.253-258
• /
• 2012

The Cartesian grid system has generally been used in casting simulations, even though it does not represent sloped and curved surfaces very well. These distorted boundaries cause several problems, and special treatment is necessary to resolve them. A cut cell method on a Cartesian grid has been developed for the simulation of threedimensional mold filling. Cut cells at a cast/mold interface are generated on Cartesian grids, and the governing equations are computed using the volume and areas of the cast at the cut cells. In this paper, we propose a new method based on the partial cell treatment (PCT) that can consider the cutting cells which are cut by the cast and the mold. This method provides a better representation of the surface geometry, and will be used in the computation of velocities that are defined on the cell boundaries in the Cartesian gird system. Various test examples for several casting process are computed and validated.

• 한국HCI학회:학술대회논문집
• /
• 2008.02b
• /
• pp.268-273
• /
• 2008

This work defines user intention according to intention range, and also proposes an interactive sound installation which reflects and varies above features. User intention consists of several decomposition concepts, which are elemental intentions, partial intentions, and a universal intention. And also, each concept is defined as inclusion/affiliation relationship with other concepts. For the representation of elemental intention, we implemented an musical interface, Color note, which represents the colors and notes according to response of participants. We also propose Harmonic Defragmentation (HD), which arranges the partial intentions with harmonic rule. Finally, the universal intention is inferred to the comprehensive direction of elemental intentions. We used Karhunen-Lo$\`{e}$ve(K-L) Transform for the inference. For verifying the validity of our proposed interface, the "Color Note," and the various techniques, we installed our work and surveyed various users for the evaluation of HD and statistical techniques. Also, we commissioned another survey to find out satisfaction measurement which was used for expressing universal intention.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.12
• /
• pp.1062-1070
• /
• 2002

In this paper, variable radix-two multibit coding algorithm is presented and applied in the implementation of discrete cosine transform(DCT) and inverse discrete cosine transform(IDCT). Variable radix-two multibit coding means the 2k SD (signed digit) representation of overlapped multibit scanning with variable shift method. SD represented by 2k generates partial products, which can be easily implemented with shifters and adders. This algorithm is most powerful for the hardware implementation of DCT/IDCT with constant coefficient matrix multiplication. This paper introduces the suggested algorithm, it's proof and the implementation of DCT/IDCT The implemented IDCT chip with 8 PEs(Processing Elements) and one transpose memory runs at a tate of 400 Mpixels/sec at 54MHz frequency for high speed parallel signal processing, and it's verified in HDTV and MPEG decoder.