• Kyungpook Mathematical Journal
• /
• 제56권3호
• /
• pp.669-682
• /
• 2016

In this paper, we study the cellular structure of the G-edge colored partition algebras, when G is a finite group. Further, we classified all the irreducible representations of these algebras using their cellular structure whenever G is a finite cyclic group. Also we prove that the ${\mathbb{Z}}/r{\mathbb{Z}}$-Edge colored partition algebras are quasi-hereditary over a field of characteristic zero which contains a primitive $r^{th}$ root of unity.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 추계학술대회 학술발표 논문집
• /
• pp.433-439
• /
• 1998

In this paper, we present an approach to the structure identification based on the input space partition methods and to the parameter identification by hybrid learning method in neuro-fuzzy system. The structure identification can automatically estimate the number of membership function and fuzzy rule using grid partition, tree partition, scatter partition from numerical input-output data. And then the parameter identification is carried out by the hybrid learning scheme using back-propagation and least squares estimate. Finally, we sill show its usefulness for neuro-fuzzy modeling to truck backer-upper control.

• 국제학술발표논문집
• /
• The 2th International Conference on Construction Engineering and Project Management
• /
• pp.573-582
• /
• 2007

Working spaces in the construction site are much more complicated than completed spaces in the building. There are many researches focus on partition of building spaces. However, few discussed partition sequencing in building construction sites. Space syntax is a set of techniques for analyzing spatial configurations. It has become a useful tool in a variety of researches. Partition sequencing of working spaces should be related to the working direction. However, with convex space and axial line, the partition sequencing became unrelated to the working direction. When critical space is blocked, the partition sequencing with axial line will be changed. It is significant to reveal the impact of the entire spatial structure when some of the working spaces are blocked. This paper discussed the improved partition sequencing theory and highlighted the importance of critical space and analyzed the spatial structure of working space. A real case project was demonstrated in this paper.

• 대한수학회보
• /
• 제31권2호
• /
• pp.237-242
• /
• 1994

One of the most well-known geometric lattices is a partition lattice. Every upper interval of a partition lattice is a partition lattice. The whitney numbers of a partition lattices are the Stirling numbers, and the characteristic polynomial is a falling factorial. The set of partitions with a single non-trivial block containing a fixed element is a Boolean sublattice of modular elements, so the partition lattice is supersolvable in the sense of Stanley [6]. In this paper, we rephrase four results due to Heller[1] and Murty [4] in terms of matroids and give several characterizations of partition lattices. Our notation and terminology follow those in [8,9]. To clarify our terminology, let G, be a finte geometric lattice. If S is the set of points (or rank-one flats) in G, the lattice structure of G induces the structure of a (combinatorial) geometry, also denoted by G, on S. The size vertical bar G vertical bar of the geometry G is the number of points in G. Let T be subset of S. The deletion of T from G is the geometry on the point set S/T obtained by restricting G to the subset S/T. The contraction G/T of G by T is the geometry induced by the geometric lattice [cl(T), over ^1] on the set S' of all flats in G covering cl(T). (Here, cl(T) is the closure of T, and over ^ 1 is the maximum of the lattice G.) Thus, by definition, the contraction of a geometry is always a geometry. A geometry which can be obtained from G by deletions and contractions is called a minor of G.

• Bulletin of the Korean Chemical Society
• /
• 제23권3호
• /
• pp.459-468
• /
• 2002

Literature data measured by the author have been processed to report on the effect of solute structure on gas liquid partition coefficients of eleven normal, branched and cyclic alkanes ranging in carbon number from five to nine in sixty nine low molecular weight liquids. The alkane solutes are n-pentane(p), n-hexane(hx), n-heptane(hp), n-octane(o), n-nonane(n), 2-methylpentane(mp), 2,5-dimethylpentane(dp), 2,5-dimethylhexane(dh), 2,3,4-trimethylpentane(tp), cyclohexane(ch), and ethylcyclohexane(ec). The solvent set encompasses most of those studied by Rohrschneider as well as three homologous series of solvents (n-alkanes, 1-alcohols and 1-nitriles) and several perfluorinated alkanes and highly fluorinated alcohols. An excellent linear relationship was observed between lnK and the carbon number of n-alkanes. The effective carbon numbers of branched and cyclic alkanes were determined in a similar fashion to the method of Kovats index. We found that the logarithm of solute vapor pressure multiplied by solute molar volume was a perfect descriptor for the linear relationship with the median effective carbon number.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2018년도 하계학술대회
• /
• pp.175-177
• /
• 2018

This paper proposes an algorithm to speed up block structure partition of quad tree plus binary tree (QTBT) in Joint Exploration Test Model (JEM) encoder. The proposed fast encoding of QTBT block partition employs three spatially neighbor coded blocks, such as left, top-left, and top of current block, to early terminate QTBT block structure pruning. The propose algorithm is organized based on statistical similarity of those spatially neighboring blocks, such as block depths and coded block types, which are coded with overlapped block motion compensation (OBMC) and adaptive multi transform (AMT). The experimental results demonstrate about 30% encoding time reduction with 1.3% BD-rate loss on average compared to the anchor JEM-7.1 software under random access configuration.

• 한국조경학회지
• /
• 제28권3호
• /
• pp.97-104
• /
• 2000

Studies on the principle of traditional moulding techniques of architecture or structure are very important in the point of the work could accomplish succession to modern design. As an attempt of these work, this study tried to examine traditional moulding techniques applied in planes of ancient architecture and structure closely. The major findings of this study are summarized as follows; It was verified that planes of ancient Korean architectures and structures analyzed in this study was moulded by its multiple partitions with the six or eight partitions of circumference as the fundamental form. The well unearthed in kyong-bok palace recently was moulded by a concentric circle assumed form of 4 circle which was extended with equal interval and divided into multiple of 8 partition of circumference. Chon-duk-jung in chang-duk palace also was moulded by a concentric circle assumed form of 3 circle extended with equal interval, but circle were divide by 6 partitions. It was also found that 6$^{\circ}$§8 partitions of circumference(or its multiple partition) was applied to not only above structures but also the moulding planes of ancient architecture, and as a results, figures revealed in architectures analyzed is classified into three classes. And, this study analyzed arrangements of two temples. As a results, it is discovered that the Grid used in moulding planes of each building fixed the arrangement of buildings. Therefore, moulding by equal partition of circumference decided the form of each building and the relation of element at the same time.

• 한국주거학회논문집
• /
• 제21권6호
• /
• pp.91-98
• /
• 2010

The purpose of this study is to develop the feasibility of movable partition wall components that are able to correspond changes of structure system and spatial configuration by the needs of residents for the activation of long-life housing. The key element of various movable partition wall components, a movable partition wall, was analyzed for problems through both as-is analysis and field installation in Korea and Japan, and then its feasibility was verified. The movable partition wall can break the uniformity of a fixed one, can integrate and separate limited space by changes in the demands of residents, can be easy to separate, and can be independent. The development of the movable partition wall is important for the realization of diverse residential space, ease of remodeling, environment adaptation, promotion of modularization, etc. It is comprised of surfacing materials, core materials, structural materials, and movable parts. The domestic movable partition wall was verified regarding the feasibility of an apartment house through on-site inspections and sound insulation tests by KOHP21, KICT. In conclusion, the construction of long-life housing that has sustainable values in the use of housing is nationally an important assignment, so as to secure good housing stock.

• 한국정보처리학회논문지
• /
• 제6권6호
• /
• pp.1571-1580
• /
• 1999

데이터 마이닝 또는 기계학습을 위한 무감독 학습 알고리즘인 개념적 클러스터링을 이용하여 계층적 구조를 유도해낼 때 자료를 처리하는 순서에 따라 서로 다른 결과에 도달하는 양상을 보인다. 이 순서 바이어스 문제를 해결하는 방안으로 먼저 주어진 자료 세트에 분류를 시행하여 초기 분류를 형성한다. 이 분류를 통해 최종 분류의 가능한 클래스 수를 예측하고 이 정보에 기반하여 자료 분석과 중심 정렬을 통해 자료 처리 순서를 새로이 결정한다. 재배열된 자료 세트에 ITERATE 분류 과정을 적용해 새로운 분류를 생성한다. 본 논문에서는 이 과정을 반복하여 안정적이고 최적의 분류 점수를 갖도록 하는 알고리즘 REIT를 제안하였다. 이 알고리즘을 여러 자료 세트에 적용하고 순서 바이어스의 영향을 최소화하는지 여부를 실험을 통해 비교 분석하였다.

• 산업공학
• /
• 제21권1호
• /
• pp.1-7
• /
• 2008

In this paper we study the Minimum Edge Addition Problem(MEAP) to decrease the diameter of a graph. MEAP can be used for improving the serviceability of telecommunication networks with a minimum investment. MEAP is an NP-hard optimization problem. We present two mathematical programming models : One is a multi-commodity flow formulation and the other is a path partition formulation. We propose a branch-and-price algorithm to solve the path partition formulation to the optimality. We develop a polynomial time column generation sub-routine conserving the mathematical structure of a sub problem for the path partition formulation. Computational experiments show that the path partition formulation is better than the multi-commodity flow formulation. The branch-and-price algorithm can find the optimal solutions for the immediate size graphs within reasonable time.