• Journal of Broadcast Engineering
• /
• v.13 no.2
• /
• pp.214-221
• /
• 2008

In this paper, we proposed a new mesh editing algorithm based on the motion between two sample meshes. First, the motion vectors are defined as the derivation vector of the corresponding vertices on the sample meshes. Then, the motion feature vectors are extracted between the motion vectors. The motion feature vectors represent the similarity of the vertex motion in a local mesh surface. When a mesh structure is forced by an external motion of anchor vertices, the deformed mesh geometry is obtained by minimizing the cost function with preserving the motion feature vectors. Simulation results demonstrated that the proposed algorithm yields visually pleasing editing results.

• International Journal of Aeronautical and Space Sciences
• /
• v.8 no.1
• /
• pp.95-104
• /
• 2007

A new design approach of complex geometries such as wing/body configuration is arranged by using overset mesh techniques under large scale computing environment. For an in-depth study of the flow physics and highly accurate design, several special overlapped structured blocks such as collar grid, tip-cap grid, and etc. which are commonly used in refined drag prediction are adopted to consider the applicability of the present design tools to practical problems. Various pre- and post-processing techniques for overset flow analysis and sensitivity analysis are devised or implemented to resolve overset mesh techniques into the design optimization problem based on Gradient Based Optimization Method (GBOM). In the pre-processing, the convergence characteristics of the flow solver and sensitivity analysis are improved by overlap optimization method. Moreover, a new post-processing method, Spline-Boundary Intersecting Grid (S-BIG) scheme, is proposed by considering the ratio of cell area for more refined prediction of aerodynamic coefficients and efficient evaluation of their sensitivities under parallel computing environment. With respect to the sensitivity analysis, discrete adjoint formulations for overset boundary conditions are derived by a full hand-differentiation. A smooth geometric modification on the overlapped surface boundaries and evaluation of grid sensitivities can be performed by mapping from planform coordinate to the surface meshes with Hicks-Henne function. Careful design works for the drag minimization problems of a transonic wing and a wing/body configuration are performed by using the newly-developed and -applied overset mesh techniques. The results from design applications demonstrate the capability of the present design approach successfully.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.230-235
• /
• 2009

This paper describes an automatic finite element mesh generation for finite element analysis of three-dimensional structures. It is consisting of fuzzy knowledge processing, bubble meshing and solid geometry modeler. This novel mesh generation process consists of three subprocesses: (a) definition of geometric model, i.e. analysis model, (b) generation of bubbles, and (c) generation of elements. One of commercial solid modelers is employed for three-dimensional solid structures. Bubble is generated if its distance from existing bubble points is similar to the bubble spacing function at the point. The bubble spacing function is well controlled by the fuzzy knowledge processing. The Delaunay method is introduced as a basic tool for element generation. Automatic generation of finite element for three-dimensional solid structures holds great benefits for analyses. Practical performances of the present system are demonstrated through several mesh generations for 3D geometry.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1852-1860
• /
• 2000

Distinct from the Markov random field or pseudo 2D HMM models for image analysis, this paper proposes a new model of 2D hidden Markov mesh chain(HMMM) model which subsumes the definitions of and the assumptions underlying the conventional HMM. The proposed model is a new theoretical realization of 2D HMM with the causality of top-down and left-right progression and the complete lattice constraint. These two conditions enable an efficient mesh decoding for model estimation and a recursive maximum likelihood estimation of model parameters. Those algorithms are developed in theoretical perspective and, in particular, the training algorithm, it is proved, attains the optimal set of parameters.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.511-513
• /
• 2011

기존의 Wireless Mesh Network(WMN)에서 제안된 EFMP DSDV 기법은 우회 경로 이후의 잉여 대역폭이 좋지 않을 경우 우회하지 않았을 때보다 성능이 더 좋지 않은 경우가 발생한다. 이 같은 단점을 보완하기 위하여 본 논문에서는 우회 경로 다음 홉 간의 경로 정보인 Hop수와 잉여대역폭에 대한 정보를 획득하여 수식으로 유도된 Bypass값을 통해 각 우회경로의 비교를 제안한다.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.65-75
• /
• 1996

This paper describes an automatic finite element(FE) mesh generation for three-dimensional structures consisting of free-form surfaces. This mesh generation process consists of three subprocesses: (a) definition of geometric model, i.e. analysis model, (b) generation of nodes, and (c) generation of elements. One of commercial solid modelers is employed for three-dimensional solid and shell structures. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay method is introduced as a basic tool for element generation. Automatic generation of FE meshes for three-dimensional solid and shell structures holds great benefits for analyses. Practical performances of the present system are demonstrated through several mesh generations for three-dimensional complex geometry.

• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.365-378
• /
• 2013

In Wireless Mesh Networks (WMNs), we usually deploy multiple Internet Gateways (IGWs) to improve the capacity of WMNs. As most of the traffic is oriented towards the Internet and may not be distributed evenly among different IGWs, some IGWs may suffer from bottleneck problem. To solve the IGW bottleneck problem, we propose an efficient scheme to balance the load among different IGWs within a WMN. Our proposed load-balancing scheme consists of two parts: a traffic load calculation module and a traffic load migration algorithm. The IGW can judge whether the congestion has occurred or will occur by using a linear smoothing forecasting method. When the IGW detects that the congestion has occurred or will occur, it will firstly select another available IGW that has the lightest traffic load as the secondary IGW and then inform some mesh routers (MPs) which have been selected by using the Knapsack Algorithm to change to the secondary IGW. The MPs can return to their primary IGW by using a regression algorithm. Our Qualnet 5.0 experiment results show that our proposed scheme gives up to 18% end-to-end delay improvement compared with the existing schemes.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2332-2342
• /
• 1999

Multicast is an important system-level one-to-many collective communication service. A key issue in designing software multicast algorithms is to consider the trade-off between performance and portability. Based on the LogP model, the proposed parameterized communication model can more accurately characterize the communication network of parallel platforms, Under the parameterized model, we propose an efficient architecture-independent method. OPT-tree algorithm, to construct optimal multicast trees and also investigate architecture-dependent tuning on performance of the multicast algorithm to achieve the truly optimal performance when implemented in real networks. Specifically, OPT-mesh which is the optimized version of the parameterized multicast algorithm for wormhole-switched mesh networks is developed and compared with two other well-known network-dependent algorithms.

• The KIPS Transactions:PartA
• /
• v.12A no.4 s.94
• /
• pp.281-288
• /
• 2005

Efficient utilization of processing resources in a large multicomputer system with the possibility of fault occurrence depends on the reliable processor management scheme. This paper presents a dynamic and reliable processor allocation strategy to increase the performance of mesh-connected parallel systems with faulty processors The basic idea is to reconfigure a faulty mesh system into a maximum convex system using the fault-free upper or lower boundary nodes to compensate for the non-boundary faulty nodes. To utilize the non-rectangular shaped system parts, our strategy tries to allocate L-shaped submeshes instead of signaling the allocation failure. Extensive simulations show that the strategy performs more efficiently than other strategies in terms of the job response time md the system utilization.

• 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.