• Bulletin of the Korean Mathematical Society
• /
• v.31 no.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.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.9
• /
• pp.1-8
• /
• 2017

The purpose of this study is to propose a cache structure for processing large-volume building information modeling (BIM) geometry data,whereit is difficult to allocate physical memory. As the number of BIM orders has increased in the public sector, it is becoming more common to visualize and calculate large-volume BIM geometry data. Design and review collaboration can require a lot of time to download large-volume BIM data through the network. If the BIM data exceeds the physical free-memory limit, visualization and geometry computation cannot be possible. In order to utilize large amounts of BIM data on insufficient physical memory or a low-bandwidth network, it is advantageous to cache only the data necessary for BIM geometry rendering and calculation time. Thisstudy proposes acache structure for efficiently rendering and calculating large-volume BIM geometry data where it is difficult to allocate enough physical memory.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.153-158
• /
• 2009

Analysis of 3-dimensional (3D) protein structure plays an important role of structural bioinformatics. The protein structure visualization is the one of the structural bioinformatics and the most fundamental problem. As the number of known protein structure increases rapidly and the study of protein-protein interaction is prevalent, the fast visualization of large scale protein structure becomes essential. The fast protein structure visualization system we proposed is sophisticated and well designed visualization system using geometry instancing technique. Because this system is optimized for recent 3D graphics hardware using geometry instancing technique, its rendering speed is faster than other visualization tools.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1993.10a
• /
• pp.139-147
• /
• 1993

The rapid industrial growth, the consequent shortage of farm labour and increase in their wage level have facilitated more capitalized agricultural mechanization pattern in Korea. The efficiency of capital intensive machine is highly dependent on farm land structure. This paper describes a model explaining the relationship between farmland structure and required inputs for machine operation and to estimate required inputs for machine operation on the national basis for Korea for its paddy production system. The machine cost is closely related to operation area, but the required labour-hours are more related to machine type adopted . From the technology introduction point of view, if capital intensive machine is introduced, less labour-hours are required but machine kW-hours increase rapidly. From the plot geometry point of view, on good geometry plots, machine kW-hour and labour-hour required are less than that on the poor geometry plots. The kW-jhour per hectare of mechani al energy input id better indicator of mechanization level than kW per hectare or number of machine. If the adopted technology is more capital intensive and plot geometry is good, the cost reduction effect is highly significant.

• Journal of Fashion Business
• /
• v.18 no.1
• /
• pp.164-181
• /
• 2014

As the boundary between fashion and architecture is getting blurred, the interactions of the two fields are turning out abundant as well as essential. This study investigates the tectonic strategies in architectural fashion design as a novel aesthetic in the 21st century by combining literary survey and case analysis on architecture and contemporary fashion. The tectonic strategies in the works of architectural fashion designers were categorized as follows: organic geometry, technological garment construction, and independent space. Organic geometry transforms basic geometric shapes into subtle organic forms after being thrown on the body. Technological garment construction explores the garment structure and volume by applying the structural principle of suspension and fractal geometry. Independent space refers to maintaining the firm three-dimensionality of garment structure which keeps the distance from the body, assuming the similarity to architecture.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.7
• /
• pp.20-29
• /
• 1998

As the packing density of ICs in recent submicron IC design increases, interconnects gain importance. Because interconnects directly affect on two major components of circuit performance, power dissipation and operating speed, circuit engineers are concerned with the optimal design of interconnects and the aid tool to design them. When circuit models of interconnects are given (including geometry and material information), the analysis process for the given structure is not an easy task, but conversely, it is much more difficult to design an interconnect structure with given circuit characteristics. This paper focuses on the latter process that has not been foucsed on much till now due to the complexity of the problem, and prsents a design aid tool(DATOIS) to synthesize interconnects. this tool stroes the circuit performance parameters for normalized interconnect geometries, and has two oeprational modes:analysis mode and synthesis mode. In the analysis mode, circuit performance parameters are obtained by searching the internal database for a given geometry and interpolates results if necessary . In thesynthesis mode, when a given circuit performance parameter satisfies a set of geometry condition in the database, those geometry structures are printed out.

• Journal of IKEEE
• /
• v.14 no.2
• /
• pp.69-75
• /
• 2010

A 3D graphics pipeline is largely divided into geometry stage and rendering stage. In this paper, we propose a method that accelerates a geometry processing in multi-core GP-GPU, using dual-phase structure. It can be improved by parallel data processing using SIMD of GP-GPU, dual-phase structure and memory prefetch. The proposed architecture improves approximately 19% of performance when it use all the features.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.989-990
• /
• 2006

This paper presents a design of 3D Graphics Geometry processor. A geometry processor needs to cope with a large amount of computation and consists of transformation processor and lighting processor. To deal with the huge computation, a vector processing structure based on pipeline chaining is proposed. The proposed geometry processor performs 4.3M vertices/sec at 100MHz using 11 floating-point units.

• Journal of computational fluids engineering
• /
• v.2 no.2
• /
• pp.97-103
• /
• 1997

A modified Delaunay triangulation technique is tested for complicated computational domain. While a simple geometry. both in topology and geometry, has been well discretized into triangular elements, a complex geometry having difficulty in triangulation had to be divided into small sub-domains of simpler shape. The present study presents a modified Delaunay triangulation method based on the data structure of geometric modeller. This approach greatly enhances the reliability of triangulation, especially in complicated computational domain. We have shown that efficiency of Delaunay triangulation can be much improved by using both the GUI (Graphic User Interface) and OOP (Object-Oriented Programming).

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.30 no.2
• /
• pp.103-110
• /
• 2017

In this paper, it is covered in detail the process of generating structural alternatives with geometry change and its optimization by StrAuto. The main roof structure of the Exhibition Center is modelled parametrically and the optimal alt is derived by observing volume changes according to geometry change of main roof truss. Existing studies performed optimization process through sections and properties due to the limitations of shape change, but this study have meaning of performing the optimization with geometry changes which is the most critical skills of StrAuto. By the process of securing a sufficient margin by geometry changes and reducing volume with the optimization of sections, despite of a partial optimization of large space structure, it could be reduced by 11.7% of the total volume.