• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2531-2533
• /
• 2005

The proposed neural network technique is the real time computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objects during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of objects. All of therm request much memory space and time. Therefore the most reliable neural-network algorithm is drived for real-time matching of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques in moving objects.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2001.04a
• /
• pp.77-80
• /
• 2001

The element-free Galerkin (EFG) method is one of meshless methods, which is an efficient method of modeling problems of fluid or solid mechanics with complex boundary shapes and large changes in boundary conditions. This paper discusses the theory of the EFG method and its applications to modeling of groundwater flow. In the EFG method, shape functions are constructed based on the moving least square (MLS) approximation, which requires only set of nodes. The EFG method can eliminate time-consuming mesh generation procedure with irregular shaped boundaries because it does not require any elements. The coupled EFG-FEM technique was introduced to treat Dirichlet boundary conditions. A computer code EFGG was developed and tested for the problems of steady-state and transient groundwater flow in homogeneous or heterogeneous aquifers. The accuracy of solutions by the EFG method was similar to that by the FEM. The EFG method has the advantages in convenient node generation and flexible boundary condition implementation.

• Journal of Mechanical Science and Technology
• /
• v.16 no.5
• /
• pp.720-731
• /
• 2002

Flow with moving free surfaces is analyzed with an the Eulerian coordinate system. This study proposes a semi-implicit filling algorithm using VOF in which the PLIC (Piecewise Linear Interface Calculation) -type interface reconstruction method and the donor-acceptor-type front advancing scheme are adopted. Also, a new scheme using extrapolation of the stream function is proposed to find the velocity of the node that newly enters the computational domain. The effect of wall boundary conditions on the flow field and temperature field is examined by numerically solving a two-dimensional casting process.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.2
• /
• pp.41-47
• /
• 2012

MANET has vulnerable structure on security owing to structural characteristics as follows. MANET consisted of moving nodes is that every nodes have to perform function of router. Every node has to provide reliable routing service in cooperation each other. These properties are caused by expose to various attacks. But, it is difficult that position of environment intrusion detection system is established, information is collected, and particularly attack is detected because of moving of nodes in MANET environment. It is not easy that important profile is constructed also. In this paper, conformal predictor - support vector machine(CP-SVM) based intrusion detection technique was proposed in order to do more accurate and efficient intrusion detection. In this study, IDS-agents calculate p value from collected packet and transmit to cluster head, and then other all cluster head have same value and detect abnormal behavior using the value. Cluster form of hierarchical structure was used to reduce consumption of nodes also. Effectiveness of proposed method was confirmed through experiment.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.4
• /
• pp.31-37
• /
• 2011

Recently, MANET(Mobile Ad-hoc Network) is developing increasingly in the wireless network. MANET has weakness because phases change frequently and MANET doesn't have middle management system. Every node which consists of MANET has to perform data forwarding, but traceback is not reliable if these nodes do malicious action owing to attack. It also is not easy to find location of attacker when it is attacked as moving of nodes. In this paper, we propose a hierarchical-based traceback method that reduce waste of memory and can manage path information efficiently. In order to manage trace path information and reduce using resource in the cluster head after network is formed to cluster, method which recomposes the path efficiently is proposed. Proposed method in this paper can reduce path trace failure rate remarkably due to moving of nodes. It can also reduce the cost for traceback and time it takes to collect information.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.8
• /
• pp.166-174
• /
• 2003

Hydrostatic bearings are widely used in precision machines due to their high motion guide accuracy, low friction and high load carrying capacity. It is very useful to estimate the moving characteristics of hydrostatic bearings in the design stage. A new method is suggested for the analysis of fluid film in hydrostatic bearings. A combined mesh of 8 node solid elements with negligible deformation resistance and spring-dashpot elements is used in conjunction with the user subroutine of ABAQUS to represent the fluid film. The mesh can be used to capture the deformation of the bearing structure as well as the varying properties of fluid film. Analysis results from the finite element model are compared with theoretical solutions, results from FLUENT analysis and some previous works. With this method, static and dynamic analyses of the system containing the bearings can be performed efficiently.

• Structural Engineering and Mechanics
• /
• v.35 no.4
• /
• pp.511-533
• /
• 2010

As a truly meshfree method, meshless equilibrium on line method (MELM), for 2D elasticity problems is presented. In MELM, the problem domain is represented by a set of distributed nodes, and equilibrium is satisfied on lines for any node within this domain. In contrary to conventional meshfree methods, test domains are lines in this method, and all integrals can be easily evaluated over straight lines along x and y directions. Proposed weak formulation has the same concept as the equilibrium on line method which was previously used by the authors for enforcement of the Neumann boundary conditions in the strong-form meshless methods. In this paper, the idea of the equilibrium on line method is developed to use as the weak forms of the governing equations at inner nodes of the problem domain. The moving least squares (MLS) approximation is used to interpolate solution variables in this paper. Numerical studies have shown that this method is simple to implement, while leading to accurate results.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.4 s.235
• /
• pp.534-539
• /
• 2005

Nodal displacements are referred to the initial configuration in the total Lagrangian formulation and to the last converged configuration in the updated Lagrangian furmulation. This research proposes a relative nodal displacement method to represent the position and orientation for a node in truss structures. Since the proposed method measures the relative nodal displacements relative to its adjacent nodal reference frame, they are still small for a truss structure undergoing large deformations for the small size elements. As a consequence, element formulations developed under the small deformation assumption are still valid for structures undergoing large deformations, which significantly simplifies the equations of equilibrium. A structural system is represented by a graph to systematically develop the governing equations of equilibrium for general systems. A node and an element are represented by a node and an edge in graph representation, respectively. Closed loops are opened to form a spanning tree by cutting edges. Two computational sequences are defined in the graph representation. One is the forward path sequence that is used to recover the Cartesian nodal displacements from relative nodal displacement sand traverses a graph from the base node towards the terminal nodes. The other is the backward path sequence that is used to recover the nodal forces in the relative coordinate system from the known nodal forces in the absolute coordinate system and traverses from the terminal nodes towards the base node. One open loop and one closed loop structure undergoing large deformations are analyzed to demonstrate the efficiency and validity of the proposed method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3176-3182
• /
• 2009

The PBNM on MANET is being researched to ensure the reliability and efficiency between mobile nodes. Therefore, it is essential to determine the cluster effectively which will perceive the movements of nodes and distribute the policies. In PBNM mechanism, to determine the node cluster for PDP and manage PEP nodes, Active PDP Discovery Protocol is proposed as a mechanism which is more efficient than preexistent techniques. While k-hop cluster selects the PEP nodes which PDP node manages, Active PDP Discovery actively selects the PDP node among the moving PEP node. This method prevents orphan nodes that are not connected to PDP and reduces continual broadcasting messages. This paper implements Active PDP Discovery which determines cluster in the real networks and analyzes its capability, expanding COPS-PR to detect the movement of nodes and adding MNL to PDP node.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.111-118
• /
• 2014

In mobile sensor networks, a large number of sensor nodes with battery powered are deployed randomly in a region. They monitor the environmental states and transmit data to its neighboring nodes. For mobile sensor networks, It is needed to maintain the connectivity autonomously among nodes as the sensor node moves. However, the existing works have focused on the energy savings in the fixed sensor networks. A specific algorithm considering node mobility is required in the mobile sensor networks. Along with energy efficiency, the transmission delay should be considered. In this paper, we propose an autonomous configuration scheme and a node scheduling algorithm when a moving node joins into the existing network. Through simulations, we show a superior performance of the proposed algorithm to the existing protocol.