• 대한수학회보
• /
• 제32권2호
• /
• pp.215-219
• /
• 1995

The most fundamental examples of (combinatorial) geometries are projective geometries PG(n - 1,q) of dimension n - 1, representable over GF(q), where q is a prime power. Every upper interval of a projective geometry is a projective geometry. The Whitney numbers of the second kind are Gaussian coefficients. Every flat of a projective geometry is modular, so the projective geometry is supersolvable in the sense of Stanley [6].

• ETRI Journal
• /
• 제39권1호
• /
• pp.1-12
• /
• 2017

In this paper, we present a new approach for the progressive compression of three-dimensional (3D) mesh geometry using redundant frame dictionaries and sparse approximation techniques. We construct the proposed frames from redundant linear combinations of the eigenvectors of a combinatorial mesh Laplacian matrix. We achieve a sparse synthesis of the mesh geometry by selecting atoms from a frame using matching pursuit. Experimental results show that the resulting rate-distortion performance compares favorably with other progressive mesh compression algorithms in the same category, even when a very simple, sub-optimal encoding strategy is used for the transmitted data. The proposed frames also have the desirable property of being able to be applied directly to a manifold mesh having arbitrary topology and connectivity types; thus, no initial remeshing is required and the original mesh connectivity is preserved.

• 대한수학회보
• /
• 제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.

• 호남수학학술지
• /
• 제31권3호
• /
• pp.315-321
• /
• 2009

Erd$\"{o}$s posed the problem of determining the minimum number g(n) such that any set of g(n) points in general position in the plane contains an empty convex n-gon. In 1978, Harborth proved that g(5) = 10. We reprove the result in a geometric approach.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.529-532
• /
• 1988

This paper proposes a graph matching algorithm based on simulated annealing, which assures the globally optimal solution for circuit partitioning for the placement in the rectilinear region occurring as a result of the pre-placement of some macro cells, or onto the nonplanar surface in some military or space applications. The circuit graph ($G_{C}$) denoting the circuit topology is formed by a hierarchical bottom-up clustering of cells, while another graph called region graph ($G_{R}$) represents the geometry of a planar rectilinear region or a nonplanar surface for circuit placement. Finding the optimal many-to-one vertex mapping function from $G_{C}$ to $G_{R}$, such that the total mismatch cost between two graphs is minimal, is a combinatorial optimization problem which was solved in this work for various examples using simulated annealing.

• 한국진공학회:학술대회논문집
• /
• 한국진공학회 2013년도 제45회 하계 정기학술대회 초록집
• /
• pp.277.2-277.2
• /
• 2013

Petri dishes and glass slides have been widely used as general substrates for in vitro mammalian cell cultures due to their culture viability, optical transparency, experimental convenience, and relatively low cost. Despite the aforementioned benefit, however, the flat two-dimensional substrates exhibit limited capability in terms of realistically mimicking cellular polarization, intercellular interaction, and differentiation in the non-physiological culture environment. Here, we report a protocol of culturing embryonic rat hippocampal neurons on the electro-spun polymeric network and the results from examination of neuronal cell behavior and network formation on this culture platform. A combinatorial method of laser-scanning confocal fluorescence microscopy and live-cell imaging technique was employed to track axonal outgrowth and synaptic connectivity of the neuronal cells deposited on this model culture environment. The present microfiber-based scaffold supports the prolonged viability of three-dimensionally-formed neuronal networks and their microscopic geometric parameters (i.e., microfiber diameter) strongly influence the axonal outgrowth and synaptic connection pattern. These results implies that electro-spun fiber scaffolds with fine control over surface chemistry and nano/microscopic geometry may be used as an economic and general platform for three-dimensional mammalian culture systems, particularly, neuronal lineage and other network forming cell lines.

• Journal of Radiation Protection and Research
• /
• 제26권2호
• /
• pp.93-99
• /
• 2001

해부학적으로 단순한 수학적인형팬텀의 한계를 극복하기 위한 voxel 머리팬텀을 제작하고 BNCT(Boron Neutron Capture Therapy) 시행 시 선량분포를 계산하였다. 일반목적 몬테칼로 코드인 MCNP4B의 반복구조 알고리즘을 이용하여 voxel 몬테칼로 계산체계를 수립하였고 두 가지 물질로 구성된 예시적 voxel 팬텀과 기하체조합팬텀의 계산값 비교를 통해 계산체계를 검증하였다. 미국 NLM(National Library of Medicine)에서 제공하는 VHP man 인체단층사진에 대한 분할 및 색인작업을 통해 voxel 머리팬텀을 제작하여 AP 및 PA 방향에서 입사하는 넓고 평행한 광자 및 중성자빔에 대한 선량값을 MIRD 팬텀의 계산값과 비교한 결과 중성자빔 AP 방향조사 시 MIRD 팬텀에서는 볼 수 없는 안구로 인한 중성자 감쇠현상을 확인할 수 있었다. 3차원 정밀계산이 필요한 BNCT 시술시 선량분포계산을 위해 뇌 중앙에 직경 5cm의 구형 뇌종양 체적을 정의하고 뇌와 종양의 붕소 함량을 조정하여 10keV 및 40keV 상부입사 중성자에 의한 장기별 흡수선량을 계산한 결과 종양에 $30{\mu}g/g$, 정상세포에 $3{\mu}g/g$의 붕소를 주입한 경우 붕소함량이 없을 때에 비해 2배 가량 큰 선량을 보였다. 본 연구를 통해 voxel몬테칼로기법을 이용한 선량평가체계를 수립하였고 정밀한 선량계산을 필요로 하는 치료방사선분야 선량계산에 실제 인체에 가까운 voxel팬텀의 응용가능성을 제시하였다.