• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2002.05a
• /
• pp.666-671
• /
• 2002

For a large structure, substructure based SDM(structural dynamics modification) method is very effective to raise its dynamic characteristics. Dividing into smaller substructures has a major advantage in the aspect of computation especially for getting sensitivities, which are in the core of SDM process. But quite often, non-matching nodes problem occurs in the process of synthesizing substructures. The reason is that, in general, each substructure is modelled separately, then later combined together to form a entire structure model under interface constraint conditions. Without solving the non-matching nodes problem, the substructure based SDM can not be processed. In this work, virtual node concept is introduced. Lagrange multipliers are used to enforce the interface compatibility constraint. The governing equation of whole structure is derived using hybrid variational principle. The eigenvalues of whole structure are calculated using determinant search method. The number of degrees of freedom of the eigenvalue problem can be drastically reduced to just the number of interface degree of freedom. Thus, the eigenvalue sensitivities can be easily calculated, and further SDM can be efficiently performed. Some numerical problems are tested to show the effectiveness of handling non-matching nodes.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.11a
• /
• pp.155-160
• /
• 2001

Actual engineering structure is frequently very complex, and parts of structure are designed independently by different engineers. Also each structure contains so many degree of freedom. For these reason, methods have been developed which permits the structure to be divided into components or substructures, with analysis being done on a small substructure in order to obtain a full structural system. In such case, because of different mesh size among finite element model (FEM) or different matching points among FEM models and experimentally obtained models, their interfacing points may be non-matching. Solving this non-matching problem is useful to other application such as structural dynamic modification or model updating. In this work, virtual node concept is introduced. Lagrange multipliers are used to enforce the interface compatibility constraint, and interface displacement is approximated by polynomial presentation. The governing equation of whole structure is derived using hybrid variational principle. The eigenvalue of whole structure are calculated using the determinant search method. The number of degree of freedom in the eigenvalue problem can be drastically reduced to just the number of interface degree of freedom. Some numerical simulation is performed to show usefulness of synthesis method.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.830-833
• /
• 2005

SDM(Structural Dynamics Modification) is to improve dynamic characteristics of a structure, more specifically of a base structure, by adding or deleting auxiliary(modifying) structures. In this paper, I will focus on the optimal layout of the stiffeners which are attached to the plate to maximize 1st natural frequency. Recently, a new topology method was proposed by yamazaki. He uses growing and branching tree model. I modified the growing and branching tree model. The method is designated modified tree model. To expand the layout of stiffeners, I will consider non-matching problem. The problem is solved by using local lagrange multiplier without the mesh regeneration. Moreover The CMS(Component mode synthesis) method is employed to reduce the computing time of eigen reanalysis using reduced componet models.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.536-543
• /
• 2011

The heterogeneous postal delivery model assumes that each intermediate node in the multicasting tree incurs a constant switching time for each message that is sent. We have proposed a new model where we assume a more generalized switching time at intermediate nodes. In our model, a child node v of a parent u has a switching delay vector, where the ith element of the vector indicates the switching delay incurred by u for sending the message to v after sending the message to i-1 other children of u. Given a multicast tree and switching delay vectors at each non-root node 5 in the tree, we provide an O(n$^{\frac{5}{2}}$) optimal algorithm that will decide the order in which the internal (non-leaf) nodes have to send the multicast message to its children in order to minimize the maximum end-to-end delay due to multicasting. We also show an important lower bound result that optimal multicast switching delay problem is as hard as min-max matching problem on weighted bipartite graphs and hence O(n$^{\frac{5}{2}}$) running time is tight.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.05a
• /
• pp.77-81
• /
• 2003

SDM (Structural Dynamics Modification) is a tool to improve dynamic characteristics of a structure, more specifically of a base structure, by adding or deleting auxiliary (modifying) structures. In this paper, the goal of the optimal SDM is set to maximize the natural frequency of a base plate structure by attaching serially-connected beam stiffeners. The design variables are chosen as positions of the attaching beam stiffeners, where the number of stiffeners is considered as a design space. The problem of non-matching interface nodes between the base plate and beam stiffeners is solved by using localized Lagrange multipliers, which act to glue the two structures with non-matching interface nodes. As fer the cases of non-matching interface nodes problem, the governing equation of motion of a structure can be considered from the viewpoint of a topological modification, which involves the change of the number of structural members and DOFs. Consequently, the eigenpairs of the beam-stiffened plate structure are obtained by using an eigen reanalysis technique of topological modifications. Evolution Strategies (ES), which is a probabilistic population-based optimization technique that mimics the principles from biological evolution in nature, is utilized as a mean for the optimization.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.442-447
• /
• 2008

This paper presents a new approach to simulate fluid-solid interaction problems involving non-matching interfaces. The coupling between fluid and solid domains with dissimilar finite element meshes consisting of 4-node quadrilateral elements is achieved by using the interface element method (IEM). Conditions of compatibility between fluid and solid meshes are satisfied exactly by introducing the interface elements defined on interfacing regions. Importantly, a consistent transfer of loads through matching interface element meshes guarantees the present method to be an efficient approach of the solution strategy to fluid-solid interaction problems. An arbitrary Lagrangian-Eulerian (ALE) description is adopted for the fluid domain, while for the solid domain an updated Lagrangian formulation is considered to accommodate finite deformations of an elastic structure. The stabilized equal order velocity-pressure elements for incompressible flows are used in the motion of fluids. Fully coupled equations are solved simultaneously in a single computational domain. Numerical results are presented for fluid-solid interaction problems involving nonmatching interfaces to demonstrate the effectiveness of the methodology.

• Journal of Gastric Cancer
• /
• v.19 no.2
• /
• pp.212-224
• /
• 2019

Purpose: Splenic hilar lymph node dissection (LND) during total gastrectomy is regarded as the standard treatment for proximal advanced gastric cancer (AGC). This study aimed to investigate whether splenic hilar LND or D2 LND is essential for proximal AGC of pT2- 4aN0M0 stage. Materials and Methods: Data of curative total gastrectomies (n=370) performed from 2000 to 2010 for proximal AGC of pT2-4aN0 stage were retrospectively reviewed. Clinicopathological characteristics and long-term outcomes were compared using propensity score matching between patients who underwent splenectomy (n=43) and those who did not (n=327) and between patients who underwent D2 LND (n=122) and those who underwent D1+ LND (n=248). Results: Tumors of larger size and a more advanced T stage and significantly lower overall and relapse-free survival (P<0.001) were observed in the splenectomy group than in the 2 spleen-preserving groups. Before propensity score matching, worse overall and relapse-free survival (P<0.001) was observed in the splenectomy group than in the non-splenectomy group. After matching, although the overall survival became similar (P=0.123), relapse-free survival was worse in the splenectomy group (P=0.021). Compared with D1+ LND, D2 LND had no positive impact on the overall (P=0.619) and relapse-free survival (P=0.112) after propensity score matching. Conclusions: Splenic hilar LND with or without splenectomy may not have an oncological benefit for patients with pathological AGC with no LN metastasis.

• Journal of Computing Science and Engineering
• /
• v.6 no.3
• /
• pp.179-192
• /
• 2012

This paper presents novel statistical algorithms for protecting the iTrust information retrieval network against malicious attacks. In iTrust, metadata describing documents, and requests containing keywords, are randomly distributed to multiple participating nodes. The nodes that receive the requests try to match the keywords in the requests with the metadata they hold. If a node finds a match, the matching node returns the URL of the associated information to the requesting node. The requesting node then uses the URL to retrieve the information from the source node. The novel detection algorithm determines empirically the probabilities of the specific number of matches based on the number of responses that the requesting node receives. It also calculates the analytical probabilities of the specific numbers of matches. It compares the observed and the analytical probabilities to estimate the proportion of subverted or non-operational nodes in the iTrust network using a window-based method and the chi-squared statistic. If the detection algorithm determines that some of the nodes in the iTrust network are subverted or non-operational, then the novel defensive adaptation algorithm increases the number of nodes to which the requests are distributed to maintain the same probability of a match when some of the nodes are subverted or non-operational as compared to when all of the nodes are operational. Experimental results substantiate the effectiveness of the detection and defensive adaptation algorithms for protecting the iTrust information retrieval network against malicious attacks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3950-3964
• /
• 2017

With the increasing popularity of 3D technology such as 3D printing, 3D modeling, etc., there is a growing need to search for similar models on the internet. Matching non-rigid shapes has become an active research field in computer graphics. In this paper, we present an efficient and effective non-rigid model retrieval method based on topological structure and local volume. The integral geodesic distances are first calculated for each vertex on a mesh to construct the topological structure. Next, each node on the topological structure is assigned a local volume that is calculated using the shape diameter function (SDF). Finally, we utilize the Hungarian algorithm to measure similarity between two non-rigid models. Experimental results on the latest benchmark (SHREC' 15 Non-rigid 3D Shape Retrieval) demonstrate that our method works well compared to the state-of-the-art.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1-4
• /
• 1996

It is difficult that a non-translational motion in a block is estimated by the block matching algorithm (BMA). In this paper, a nodal-displacement-based deformation model is used for this reason. This model assumes that a selected number of control nodes move freely in a block and that displacement of any interior point can be interpolated from nodal displacements. As a special case with a single node this model is equivalent to a translational model. And this model can represent more complex deformation using more nodes. We used an iterative gradient based search algorithm to estimate nodal displacement. Each iteration involves the solution of a simple linear equation. This method is called the deformable block matching algorithm (DBMA).