• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.1 s.232
• /
• pp.22-29
• /
• 2005

A material cloud method, which is a new topology optimization method, is presented. In MCM, an optimal structure can be found out by manipulating sizes and positions of material clouds, which are lumps of material with specified properties. A numerical analysis for a specific distribution of material clouds is carried out using fixed background finite element mesh. Optimal material distribution can be element-wisely extracted from material clouds' distribution. In MCM, an expansion-reduction procedure of design domain for finding out better optimal solution can be naturally realized. Also the convergence of material distribution is faster and well-defined material distribution with fewer intermediate densities can be obtained. In addition, the control of minimum-member sizes in the material distribution can be realized to some extent. In this paper, basic concept of MCM is introduced, and formulation and optimization results of MCM are compared with those of the traditional density distribution method(DDM).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.667-681
• /
• 2009

We describe a method to decompose a cube with trilinear interpolation into a collection of tetrahedra with linear interpolation, where the isosurface topology is preserved for all isovalues during decomposition. Visualization algorithms that require input scalar data to be defined on a tetrahedral grid can utilize our method to process 3D rectilinear data with topological correctness. As one of many possible examples, we apply the decomposition method to topologically accurate tetrahedral mesh extraction of an interval volume from trilinear volumetric imaging data. The topological correctness of the resulting mesh can be critical for accurate simulation and visualization.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.2
• /
• pp.132-139
• /
• 2012

Presented in the paper is a procedure to extract simplified triangular mesh from a height map (terrain data). The proposed algorithm works directly on a height map that extracts a simplified triangular mesh. For the simplification, the paper employs an iterative method of edge contractions. To determine an edge to be contracted, the contraction cost of an edge is evaluated through the QEM method. Normally, an edge contraction will remove two triangles sharing the edge. Although the edge contraction can be implemented easily on a triangular mesh, it is not viable to implement the operation on a height map due to the irregular topology. To handle the irregular topology during the simplification procedure, a new algorithm is introduced.

• Journal of Korea Multimedia Society
• /
• v.10 no.6
• /
• pp.760-769
• /
• 2007

In this paper, we consider a group mobility model to formulate a clustering mechanism called Dual Coalescent Energy-Efficient Algorithm (DCEE) which is scalable, distributed and energy-efficient for wireless mesh network. The differences of the network nodes will be distinguished to exploit heterogeneity of the network. Furthermore, a topology control, that is, adjusting the transmission range to further reduce power consumption will be integrated with the cluster formation to improve network lifetime and connectivity. Along with network lifetime and power consumption, clusterhead changes will be measured as a performance metric to evaluate the. effectiveness and robustness of the algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.4
• /
• pp.77-82
• /
• 2004

Being in an internet era, the rapid transmission of 3D mesh models is getting more important and efforts toward the compression of various aspects of mesh models have been provided. Even though a mesh model usually consists of coordinates of vertices and properties such as colors and normals, topology plays the most important part in the compression of other information in the models. Despite the extensive studies on Edgebreaker, the most frequently used and rigorously evaluated topology compressor, the probability distribution of its five op-codes, C, R, E, S, and L, has never been rigorously analyzed yet. In this paper, we present probability distribution of the op-codes which is useful for both the optimization of the compression performance and a priori estimation of compressed file size.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.4
• /
• pp.165-175
• /
• 2019

Networks use relatively slow heartbeat mechanisms, usually in routing protocols, to detect failures when there is no hardware signaling to help out. The time to detect failures available in the existing protocols is no better than a second, which is far too long for some applications and represents a great deal of lost data at 10 Gigabit rates. We compare the convergence time of routing protocol applying Bidirectional Forwarding Detection (BFD) protocol in wired mesh network topology. This paper suggests the combinations of protocols improving fail-over performance. Through the performance analysis, we contribute to reduce convergence time when system is fail-over.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.4
• /
• pp.1-8
• /
• 2001

3D mesh metamorphosis (morphing) deals with two input polyhedral objects and generates an animation in which the source mesh gradually changes to the target through in-between meshes. The basic and common idea of previous mesh morphing techniques can be summarized as the construction and interpolation of a metamesh. However, an approach based on a metamesh has fundamental limitations of complicated in-between meshes and no topology (connectivity) changes in a metamorphosis. This paper presents a novel approach for 3D mesh morphing, which is not based on a metamesh and overcomes the limitations of previous work. The approach simultaneously interpolates the topology and geometry of input meshes. With the approach, an in-between mesh contains only the vertices from the source and target meshes. Since no additional vertices are introduced, the in-between meshes are much simpler than those generated by previous techniques.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.2
• /
• pp.1-10
• /
• 2010

Mapping virtual process topology to physical processor topology is one of the most important design issues in parallel programming. However, the mapping problem is complicated due to the topology irregularity and routing complexity. This paper proposes a new process mapping scheme called adjacency-based mapping (AM) for irregular cluster systems assuming that the two-dimensional mesh process topology is specified as an interprocess communication pattern. The cluster systems have been studied and developed for many years since they provide high interconnection flexibility, scalability, and expandability which are not attainable in traditional regular networks. The proposed AM tries to map neighboring processes in virtual process topology to adjacent processors in physical processor topology. Simulation study shows that the proposed AM results in better mapping quality and shorter interprocess latency compared to the conventional approaches.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.49-57
• /
• 2012

In P2P streaming management, peer's churning and finding efficient topology architecture optimization algorithm that reduces streaming delay is important. This paper studies a topology optimization algorithm based on the P2P streaming using peer's link information. The proposed algorithm is based on the estimation of peer's upload bandwidth using peer's link information on mesh-network. The existing algorithm that uses the information of connected links is efficient to reduce message overload in the point of resource management. But it has a risk of making unreliable topology not considering upload bandwidth. And when some network error occurs in a server-closer-peer, it may make the topology worse. In this paper we propose an algorithm that makes up for the weak point of the existing algorithm. We compare the existing algorithm with the proposed algorithm using test data and analyze each simulation result.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.5
• /
• pp.297-306
• /
• 1986

This paper surveys circuit switching local area networks(LANs) whit topology of ring, mesh, bus and star. Emphasis of this study is given on the conceptual switching technologies of these LANs.