• East Asian mathematical journal
• /
• v.25 no.4
• /
• pp.469-479
• /
• 2009

Temperley-Lieb algebras had been generalized to web spaces for rank 2 simple Lie algebras which led us to link invariants for these Lie algebras as a generalization of Jones polynomial. Recently, Geer found a new generalization of Jones polynomial for some Lie superalgebras. In this paper, we study the quantum sl(1|1) representation theory using the web space and find a finite presentation of the representation category (for generic q) of the quantum sl(1|1).

• Journal of the Korean Statistical Society
• /
• v.19 no.1
• /
• pp.45-53
• /
• 1990

Factorization models are a generalization of hierarchical loglinear models which apply equally to discrete and continuous distributions. In regular (strictly positive) cases the intersection of two factorization models is another factorization model whose representation is obtained by a simple algorithm. Failure of this result in an irregular case is related to a theorem of Basu on ancillary statistics.

• Honam Mathematical Journal
• /
• v.37 no.3
• /
• pp.269-279
• /
• 2015

Atanassov introduced another fuzzy object, called intu- itionistic fuzzy set as a generalization of the concept of fuzzy subset. The aim of this paper is the elaboration of a representation theory of involutive interval-valued Łukasiewicz-Moisil algebras by using the notion of intuitionistic fuzzy sets.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.24 no.4
• /
• pp.382-391
• /
• 2021

Unsupervised domain adaptation often gives impressive solutions to handle domain shift of data. Most of current approaches assume that unlabeled target data to train is abundant. This assumption is not always true in practices. To tackle this issue, we propose a general solution to solve the domain gap minimization problem without any target data. Our method consists of two regularization steps. The first step is a pixel regularization by arbitrary style transfer. Recently, some methods bring style transfer algorithms to domain adaptation and domain generalization process. They use style transfer algorithms to remove texture bias in source domain data. We also use style transfer algorithms for removing texture bias, but our method depends on neither domain adaptation nor domain generalization paradigm. The second regularization step is a feature regularization by feature alignment. Adding a feature alignment loss term to the model loss, the model learns domain invariant representation more efficiently. We evaluate our regularization methods from several experiments both on small dataset and large dataset. From the experiments, we show that our model can learn domain invariant representation as much as unsupervised domain adaptation methods.

• Journal of the Korean Mathematical Society
• /
• v.49 no.3
• /
• pp.475-491
• /
• 2012

In 1950 a class of generalized Petersen graphs was introduced by Coxeter and around 1970 popularized by Frucht, Graver and Watkins. The family of $I$-graphs mentioned in 1988 by Bouwer et al. represents a slight further albeit important generalization of the renowned Petersen graph. We show that each $I$-graph $I(n,j,k)$ admits a unit-distance representation in the Euclidean plane. This implies that each generalized Petersen graph admits a unit-distance representation in the Euclidean plane. In particular, we show that every $I$-graph $I(n,j,k)$ has an isomorphic $I$-graph that admits a unit-distance representation in the Euclidean plane with a $n$-fold rotational symmetry, with the exception of the families $I(n,j,j)$ and $I(12m,m,5m)$, $m{\geq}1$. We also provide unit-distance representations for these graphs.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.2
• /
• pp.363-368
• /
• 2010

In this paper we construct a subalgebra $L_8$ of $M_8({\mathbb{R}})$ which is a generalization of the algebra of quaternions. Moreover we prove that the algebra $L_8$ is the real Clifford algebra $Cl_3$, and so $L_8$ is a matrix representation of Clifford algebra $Cl_3$.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.73-82
• /
• 2011

Recently, demand for the use of cadastral map is increasing in both public and private area. To use cadastral map in web or mobile environment, construction of the multi-representation database(MRDB) that is the compressed into multiple scale from the original map data is recommended. In this study, the map generalization methodology for the cadastral map by applying overlay with topographic map and polygon generalization technique is suggested. This process is composed of three steps, re-constructing the network data of topographic map, polygon merging of parcel lines according to network degree, and applying line simplification techniques. Proposed methodologies are applied to the cadastral map in Suwon area. The result map was generalized into 1:5,000, 1:20,000, 1:100,000 scale, and data compression ratio was shown in 15% 8% 1% level respectively.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.4
• /
• pp.240-248
• /
• 2014

We present a robust speaker identification algorithm that uses novel features based on soft bag-of-word representation and a simple Naive Bayes classifier. The bag-of-words (BoW) based histogram feature descriptor is typically constructed by summarizing and identifying representative prototypes from low-level spectral features extracted from training data. In this paper, we define a generalization of the standard BoW. In particular, we define three types of BoW that are based on crisp voting, fuzzy memberships, and possibilistic memberships. We analyze our mapping with three common classifiers: Naive Bayes classifier (NB); K-nearest neighbor classifier (KNN); and support vector machines (SVM). The proposed algorithms are evaluated using large datasets that simulate medical crises. We show that the proposed soft bag-of-words feature representation approach achieves a significant improvement when compared to the state-of-art methods.

• Korean Institute of Interior Design Journal
• /
• v.19 no.6
• /
• pp.20-29
• /
• 2010

Art historians and critics have defined the style as common features appeared in a class of objects. Abstract common features from a set of objects have been used as a bench mark for date and location of original works. Commonalities in shapes are identified by relationships as well as physical properties from shape descriptions. This paper will focus on how the computer and human can recognize common shape properties from a class of shape objects to learn design knowledge. Shape representation using schema theory has been explored and possible inductive generalization from shape descriptions has been investigated. Also learned shape knowledge can be used. for new design process as design concept. Several design process such as parametric design, replacement design, analogy design etc. are used for these design processes. Works of Mario Botta and Louis Kahn are analyzed for explicitly clarifying the process from conceptual ideas to final designs. In this paper, theories of computer science, artificial intelligence, cognitive science and linguistics are employed as important bases.

• Journal of the Chungcheong Mathematical Society
• /
• v.18 no.2
• /
• pp.117-129
• /
• 2005

We give a generalization of bilateral mock theta functions of order eight and show that they are $F_q$-functions. We also give an integral representation for these functions. We give a relation between mock theta functions of the first set and bilateral mock theta functions of the second set.