• Communications for Statistical Applications and Methods
• /
• 제22권1호
• /
• pp.69-80
• /
• 2015

In this paper, the probability that a given point is covered by a random convex hull generated by independent and identically-distributed random points in a plane is studied. It is shown that such probability can be expressed in terms of an integral that can be approximated numerically by function-evaluations over the grid-points in a 2-dimensional space. The new integral representation allows such probability be computed efficiently. The computational burdens under the proposed integral representation and those in the existing literature are compared. The proposed method is illustrated through numerical examples where the random points are drawn from (i) uniform distribution over a square and (ii) bivariate normal distribution over the two-dimensional Euclidean space. The applications of the proposed method in statistics are are discussed.

• 대한수학회지
• /
• 제49권5호
• /
• pp.993-1015
• /
• 2012

In this paper, we study the quantum sl($n$) representation category using the web space. Specially, we extend sl($n$) web space for $n{\geq}4$ as generalized Temperley-Lieb algebras. As an application of our study, we find that the HOMFLY polynomial $P_n(q)$ specialized to a one variable polynomial can be computed by a linear expansion with respect to a presentation of the quantum representation category of sl($n$). Moreover, we correct the false conjecture [30] given by Chbili, which addresses the relation between some link polynomials of a periodic link and its factor link such as Alexander polynomial ($n=0$) and Jones polynomial ($n=2$) and prove the corrected conjecture not only for HOMFLY polynomial but also for the colored HOMFLY polynomial specialized to a one variable polynomial.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2003년도 춘계학술대회논문집
• /
• pp.73-78
• /
• 2003

This paper proposes the simulator synthesis scheme which is based on the exploration of the total design space in attributed AND-OR graph. Attributed AND-OR graph is a systematic design space representation formalism which enables to represent all the design space by decomposition rule and specialization rule. In addition, attributes attached to the design entity provides flexible modeling. Based on this design space representation scheme, a pruning algorithm which can transform the total design space into sub-design space that satisfies the user requirements is given. We have shown the effectiveness of our framework by (ⅰ) constructing the design space of superscalar processor in attributed AND-OR graph (ⅱ) pruning it to obtain the ARM9 processor architecture. (ⅲ) modeling the components of the architecture and (ⅳ) simulating the ARM9 model.

• ETRI Journal
• /
• 제11권1호
• /
• pp.109-122
• /
• 1989

We developed new quadtree and octree representation schemes which reduce the storage requirements from exponential to polynomial. The new schemes not only lessen the large storage requirements of the existing quadtree and octree representation schemes but guarantee an exact representation of the original object. These are made possible by adopting a new set of termination conditions that ensure finiteness of the quadtree and octree during the decomposition. These new data structures are analyzed theoretically and tested empirically. For space complexity, we analyzed its best case, worst case, and average case. Given an $n_e$-gon, we show that the expected number of nodes in our quadtree isO($$$n_e^1.292$) For a polyhedron with $n_f$ faces, the expected number of nodes in the new octree is O($$$n_f^1.667$). For time complexity, we again analyzed the best, worst, and average cases for constructing such quadtree and octree and find the average to be the same as those of the space complexity. Finally, random $n_e$- gons are generated as test data. Regression equations are fitted and are shown to support the claims on the average case performance.

• 대한수학회지
• /
• 제35권1호
• /
• pp.177-189
• /
• 1998

In this paper, weighted Bloch spaces $B_q (q > 0)$ are considered on the open unit ball in $C^n$. These spaces extend the notion of Bloch spaces to wider classes of holomorphic functions. It is proved that the functions in a weighted Bloch space admit certain integral representation. This representation formula is then used to determine the degree of growth of the functions in the space $B_q$. It is also proved that weighted Bloch space is a Banach space for each weight q > 0, and the little Bloch space $B_q,0$ associated with $B_q$ is a separable subspace of $B_q$ which is the closure of the polynomials for each $q \geq 1$.

• 한국실내디자인학회논문집
• /
• 제15권1호
• /
• pp.79-87
• /
• 2006

'Fantasy' in this study is Not something fantastic in the used to be-way we can Imagine easily. This study is to figure out 'fantasy' and 'the fantastic' as a significant measure to interpret the contemporary space-time. In particular, it analyzed that fantasy have influenced on some kind of specific trend what is expressed a tendency to contemporary interior designs of informal, indeterminacy and unpredictability. Fantasy is represented as 'the fantastic space' through spatial revealing, concealing, distorting, and connoting. Representation becomes a major issue in almost many kinds of knowledge-system that start from the mind to go out to the world in a realistic or idealistic way. Therefore, the fantastic space reconstructs the reality while making itself through to representational creation-process. It is Important for fantasy and the fantastic space to help detect behind beneath the reality more than what we know.

• 한국건축시공학회지
• /
• 제15권3호
• /
• pp.317-327
• /
• 2015

국내외 건설사업에 BIM적용이 활발하게 진행되고 있으며, 이에 따라 국가적 차원에서의 제도 및 기준이 개발되어 BIM기반 건설사업에 적용되고 있다. 하지만, 국내에서 건물에 포함된 공간객체에 대한 면적을 산출하기 위한 기준은 주택법과 건축법으로 이원화 되어 적용되고 있으며, BIM기반 소프트웨어에서 생성된 IFC파일은 적용되는 기준과 상관없이 항상 동일한 공간객체의 형상정보가 생성되고 있는 실정이다. 이에 본 연구에서는 IFC기반 공간객체 및 경계객체의 속성정보를 활용하여, 적정한 면적산정 기준을 산정하고 이에 따라 해당 공간객체 형상정보의 좌표 값을 자동으로 변환시켜 줄 수 있는 IFC기반 공간형상정보 좌표 변환 자동화 알고리즘을 제안하고자 한다.

• 한국통신학회논문지
• /
• 제19권9호
• /
• pp.1702-1709
• /
• 1994

한글인식 후처리에서 문맥정보의 저장구조는 인식율 및 인식속도를 결정짓는 중요한 요소이다. 단어사전의 형태로 문맥정보를 표현하기 위해서는 트라이(trie)를 주로 이용하지만, 기억공간 이용효율이 저조하다는 단점이 있다. 따라서 이 논문에서는 트라이의 장점을 유지하면서 공간효율을 향상시키는 기억구조를 제안한다. 한글은 조합문자이기 때문에 자모나 문자별로 기억시킬 수 있다. 그런데 자모단위로 기억시키면(P-모드) 검색시간은 빠르지만 공간효율이 나쁘고, 또한 문자단위로 기억시키면(C-모드) 공간효율은 좋지만 검색시간이 길어진다. 따라서 노드이용율과 분산율로 최적레벨을 선정한 다음, 입력단어의 시작자모부터 최적레벨까지는 자모 단위의 트라이로 기억시키고, 그 이상은 문자단위의 순차연결구조로 저장시켰다. (H-모드). 6가지 단어집합에 대하여 실험한 결과, H-모드에서의 검색시간은 P-모드만큼 빠르면서, 공간효율은 C-모드와 같게 되어 그 효용성을 확인할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권6호
• /
• pp.2709-2729
• /
• 2016

Representation based classification, kernel method and sparse representation have received much attention in the field of face recognition. In this paper, we proposed an improved kernel principal component analysis method based on sparse representation to improve the accuracy and robustness for face recognition. First, the distances between the test sample and all training samples in kernel space are estimated based on collaborative representation. Second, S training samples with the smallest distances are selected, and Kernel Principal Component Analysis (KPCA) is used to extract the features that are exploited for classification. The proposed method implements the sparse representation under ℓ₂ regularization and performs feature extraction twice to improve the robustness. Also, we investigate the relationship between the accuracy and the sparseness coefficient, the relationship between the accuracy and the dimensionality respectively. The comparative experiments are conducted on the ORL, the GT and the UMIST face database. The experimental results show that the proposed method is more effective and robust than several state-of-the-art methods including Sparse Representation based Classification (SRC), Collaborative Representation based Classification (CRC), KCRC and Two Phase Test samples Sparse Representation (TPTSR).

• 한국실내디자인학회논문집
• /
• 제23권5호
• /
• pp.41-50
• /
• 2014

In relation to spatial expression, the remediation theory of Jay David Bolter & Richard Grusin shows a sufficient possibility of providing extended idea and experience through the space of critical representation. The remediation theory discussed in the scope of new media says about the existence method and the development process of media through immersion into media and awakening, and one attribute of remediation which aims at the extension of another realistic experience and recognition through various media, contains common denominators which display diversity and complexity of installation space, and use the audience as expression elements. Therefore, this study aims to apply the remediation theory in order to interpret space using more diverse and multisensory expression methods. For achieving this purpose, this study found the connection among characteristics of hypermediacy which is an axis of installation and remediation theory, and analyzed diverse cases regarding installation space and characteristics of hypermediacy, depending on external aspects of form and expression and internal aspects of experience and cognition. The method of hypermediation expression in installation space converts the recognition about the basic custom of new experience, space and representation. This means that the logic of remediation could approach space by leading to more extended form and recognition. In conclusion, the characteristics of space and the possibility of extended expression revealed in the relationship between installation space and hypermediacy logic would provide another developmental significance for research on space design.