• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.844-847
• /
• 2011

Wireless mesh network (WMN) is a type of mobile ad-hoc network consists of wireless router, mobile clients and gateway which connects the network with the Internet. To provide security in the network it is required to encrypt the message sent among the communicating nodes in such way so that only legitimate user can retrieve the original data. Several security mechanisms have been proposed so far to enhance the security of WMN. However, there still exists a need for a comprehensive mechanism to prevent attacks in data communication. Considering the characteristic of mesh network, in this paper we proposed a public key cryptography based security architecture to establish a secure key agreement among communicating nodes in mesh network. The proposed security architecture consists of two major sections: client data protection and network data protection. Client data protection deals with the mutual authentication between the client and the access router and provide client to access router encryption for data confidentiality using standard IEEE 802.11i protocol. On the other hand, network data protection ensures encrypted routing and data transfer in the multi hop backbone network. For the network data protection, we used the pre-distributed public key to form a secure backbone infrastructure.

• Structural Engineering and Mechanics
• /
• v.14 no.6
• /
• pp.625-647
• /
• 2002

Parallel execution of computational mechanics codes requires efficient mesh-partitioning techniques. These mesh-partitioning techniques divide the mesh into specified number of submeshes of approximately the same size and at the same time, minimise the interface nodes of the submeshes. This paper describes a new mesh partitioning technique, employing Genetic Algorithms. The proposed algorithm operates on the deduced graph (dual or nodal graph) of the given finite element mesh rather than directly on the mesh itself. The algorithm works by first constructing a coarse graph approximation using an automatic graph coarsening method. The coarse graph is partitioned and the results are interpolated onto the original graph to initialise an optimisation of the graph partition problem. In practice, hierarchy of (usually more than two) graphs are used to obtain the final graph partition. The proposed partitioning algorithm is applied to graphs derived from unstructured finite element meshes describing practical engineering problems and also several example graphs related to finite element meshes given in the literature. The test results indicate that the proposed GA based graph partitioning algorithm generates high quality partitions and are superior to spectral and multilevel graph partitioning algorithms.

• Resources Recycling
• /
• v.7 no.5
• /
• pp.13-18
• /
• 1998

This study was carried out to understand the properties of the E.A.F. steel-making dusts for stabilization processing. The properties are related to mincral composition, shape, particle size, magnetism, density, porosity and leaching characteristic. the dust particles, the size of which ranges from sub-micron to tens-micron, were mainly spherical like balls that were agglomerated each other: the large particles were generally Fe-rich and the small particles were spherical like balls that were agglomerated each other: the large particles were franklinite (ZnFe$_{2}O_{4}$), magnetite (Fe$_{3}O_{4}$) and zincite (ZnO) by XRD analysis. When the dusts were sieved by a wet process, the particle fraction over 200 mesh had 1.5 wt.% with magnetite and quartz. The particles in the size range of 200-500 mesh consisted of magnetite, franklinite. The 82 wt.% of the steel-making dusts were occupied by the particles finer than 500 mesh and contained franklinite and zincite as main mineralogical compositions. When the dusts of around 78% porosity compressed under the load of approximately 1 KPa, the porosity decreased to 68% and to 535 under around 13 KPa. When the E.A.F. dusts were leached according to the Korea standard leaching procedure on the waster, the heavy metals exceeding the leaching criteria were cadmium, lead and mercury.

• Journal of the Mineralogical Society of Korea
• /
• v.23 no.4
• /
• pp.297-303
• /
• 2010

We report the particle-size distribution and comminution charactersitics of dolomite depending upon crushing equipment (hammer crusher and roll crusher) and crushing circuit (open and closed). The quantity of fine particles (< 100 mesh) produced by hammer crusher was 34 wt.% which is about three times that by roll crusher. The quantity of 14~25 mesh size fraction by roll crusher was 20 wt.% higher than that produced by hammer crusher. 80 wt.% of the crushing products by hammer crushing was under 35 mesh in size, while the particles produced by roll crushing were relatively coarse. The particle size of both the hammer and roll crushers decreased by employing closed crusing circuit in comparison to open circuit. Products of required particle-size were obtained effectively depending on appropriate crushing equipment and crushing circuit.

• The KIPS Transactions:PartA
• /
• v.15A no.6
• /
• pp.301-308
• /
• 2008

The crossed cube has received great attention because it has equal or superior properties to the hypercube that is widely known as a versatile parallel processing system. It has been known that a mesh of size $2{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 and a mesh of size $4{\times}2^m$ with dilation 1 and expansion 2. However, as we know, it has been a conjecture that a mesh with more than eight rows and columns can be embedded into a crossed cube with dilation 1. In this paper, we show that a mesh of size $2^n{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion $2^{n-1}$ where $n{\geq}1$ and $m{\geq}3$.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.5
• /
• pp.29-38
• /
• 2017

We propose a method for tree-inspired chair modeling that can generate a tree-branch pattern in the skeleton of an arbitrary chair shape. Unlike existing methods that merge multiple-input models, the proposed method requires only one mesh as input, namely the contour mesh of the user's desired part, to model the chair with a branch pattern generated by tree-growth simulation. We propose a new method for the efficient extraction of the contour-mesh region in the tree-branch pattern. First, we extract the contour mesh based on the face area of the input mesh. We then use the front and back mesh information to generate a skeleton mesh that reconstructs the connection information. In addition, to obtain the tree-branch pattern matching the shape of the input model, we propose a three-way tree-growth simulation method that considers the tangent vector of the shape surface. The proposed method reveals a new type of furniture modeling by using an existing furniture model and simple parameter values to model tree branches shaped appropriately for the input model skeleton. Our experiments demonstrate the performance and effectiveness of the proposed method.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.435-442
• /
• 2007

This paper is concerned with the mesh segmentation problem that can be applied to diverse applications such as texture mapping, simplification, morphing, compression, and shape matching for 3D mesh models. The mesh segmentation is the process of dividing a given mesh into the disjoint set of sub-meshes. We propose a method for segmenting meshes by simultaneously reflecting global and local geometric characteristics of the meshes. First, we extract sharp vertices over mesh vertices by interpreting the curvatures and convexity of a given mesh, which are respectively contained in the local and global geometric characteristics of the mesh. Next, we partition the sharp vertices into the $\kappa$ number of clusters by adopting the $\kappa$-means clustering method [29] based on the Euclidean distances between all pairs of the sharp vertices. Other vertices excluding the sharp vertices are merged into the nearest clusters by Euclidean distances. Also we implement the proposed method and visualize its experimental results on several 3D mesh models.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.91-96
• /
• 2009

In this paper, interoperability in heterogeneous wireless mesh network, and mesh nodes for providing efficient IP mobility technique offers multi-hop ARP. Heterogeneous wireless mesh networks to MANETs based on a wireless mesh network backbone and non-MANET architecture is based on a client wireless mesh network and the two mobile networks, combined with a hybrid wireless mesh network are separate. In two different hybrid wireless mesh network routing protocols used to connect the two protocols in the protocol conversion at the gateway to parallel processing problems seriously overload occurs. All of the network reliability and stability are factors that reduce. Therefore, for efficient integration with L3 routing protocols, design techniques to build ARP multi-hop go through the experiment to increase the number of mesh nodes, the packet forwarding rate and an increased hop number of the node was to ensure reliability and stability.

• Transactions of Materials Processing
• /
• v.15 no.6 s.87
• /
• pp.459-466
• /
• 2006

Trimming line design plays an important role in obtaining accurate edge profile after flanging. Compared to the traditional section-based method, simulation-based method can produce more accurate trimming line by considering deformation mechanics. Recently, the use of a finite element inverse method is proposed to obtain optimal trimming line. By analyzing flanging inversely from the final mesh after flanging, trimming line can be obtained from initial mesh on the drawing die surface. Initial guess generation fer finite element inverse method is obtained by developing the final mesh onto drawing tool mesh. Incremental development method is adopted to handle irregular mesh with various size and undercut. In this study, improved incremental development algorithm to handle complex shape is suggested. When developing the final mesh layer by layer, the algorithm which can define the development sequence and the position of developing nodes is thoroughly described. Flanging of front fender is analyzed to demonstrate the effectiveness of the present method. By using section-based trimming line and simulation-based trimming line, incremental finite element simulations are carried out. In comparison with experiment, it is clearly shown that the present method yields more accurate edge profile than section-based method.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.248-251
• /
• 2007

In this paper, we are propose a method to estimate the 2-D mesh from structured light image for reconstruction of 3-D face image. To acquire the structured light image, we are project structured light on the face using the projector. we are extract the projected cross points from the acquire image. The 2-D mesh image is extracted from the position and angle of cross points. In the extraction processing, the error was fixed to extract the correct 2-D mesh.