• Structural Engineering and Mechanics
• /
• v.16 no.4
• /
• pp.479-492
• /
• 2003

Non-conforming membrane elements which have variable number of mid-side nodes with drilling degrees of freedom and which is designated as NMDx have been presented in this paper. The non-conforming elements with variable number of mid-side nodes can be efficiently used in the local mesh refinement for the in-plane structures. To guarantee the developed elements always pass the patch test, the direct modification method is incorporated into the element formulation. Detailed numerical tests in this study show the validity of the variable node NC elements developed in this study and a wide applicability of these elements to practical problems.

• Structural Engineering and Mechanics
• /
• v.14 no.6
• /
• pp.699-712
• /
• 2002

In this paper, a new quadrilateral 5-node non-conforming membrane element with drilling degrees of freedom is presented. The main advantage of these elements is the relatively small number of integration points to evaluate a stiffness matrix comparing to the existing transition membrane elements (CLM elements). Moreover, the presented elements pass the patch test by virtue of the Direct Modification Method incorporated into the element formulation. The presented 5-node elements are proved to be very efficient when used in the local mesh refinement for the in-plane structures which have stress concentrations. And some numerical studies also show the good performance of the new element developed in this study.

• Journal of Korea Multimedia Society
• /
• v.18 no.9
• /
• pp.1083-1090
• /
• 2015

A generalized recursive circulant network(GR) is widely used in the design and implementation of local area networks and parallel processing architectures. In this paper, we investigate the routing of a message on this network, that is a key to the performance of this network. We would like to transmit maximum number of packets from a source node to a destination node simultaneously along paths on this network, where the i^th packet traverses along the i^th path. In order for all packets to arrive at the destination node securely, the i^th path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of (n x n) matrices, we present O(n²) parallel routing algorithm on generalized recursive circulant networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.1
• /
• pp.5-21
• /
• 2008

In order to securely transmit multicast data packets in a mobile environment where frequent join/leave events are a characteristic of the environment, there is a need for a new secure and efficient group key management solution. We propose a secure group key generation/distribution solution providing scalability and reliability. Using this solution, when a mobile node, which is in a multicast session, enters a new domain, the agent of the domain joins the multicast session and coordinates its data packets with the mobile node. The agent encrypts and transmits subsequent data packets to the mobile node, using a local one-time pad key. This key is generated with FI sequences, enabling the mobile node to regenerate the same data packet, based on the information sent by the agent. Our performance analysis demonstrates that the proposed solution can significantly reduce the number of key generations and distributions, when it is applied to the hierarchical mobile IPv6 network.

• Radiation Oncology Journal
• /
• v.32 no.3
• /
• pp.132-137
• /
• 2014

Purpose: To evaluate non-sentinel lymph node (LN) status after sentinel lymph node biopsy (SNB) in patients with breast cancer and to identify the predictive factors for disease failure. Materials and Methods: From January 2006 to December 2007, axillary lymph node (ALN) dissection after SNB was performed for patients with primary invasive breast cancer who had no clinical evidence of LN metastasis. A total of 320 patients were treated with breast-conserving surgery and radiotherapy. Results: The median age of patients was 48 years, and the median follow-up time was 72.8 months. Close resection margin (RM) was observed in 13 patients. The median number of dissected SNB was two, and that of total retrieved ALNs was 11. Sentinel node accuracy was 94.7%, and the overall false negative rate (FNR) was 5.3%. Eleven patients experienced treatment failure. Local recurrence, regional LN recurrence, and distant metastasis were identified in 0.9%, 1.9%, and 2.8% of these patients, respectively. Sentinel LN status were not associated with locoregional recurrence (p > 0.05). Close RM was the only significant factor for disease-free survival (DFS) in univariate and multivariate analysis. The 5-year overall survival, DFS, and locoregional DFS were 100%, 96.8%, and 98.1%, respectively. Conclusion: In this study, SNB was performed with high accuracy and low FNR and high locoregional control was achieved.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.589-598
• /
• 2009

In wireless sensor networks, a node that reports information gathered from adjacent assets should relay packets appropriately so that its location context is kept private, and thereby helping ensure the security of the assets that are being monitored. Unfortunately, existing routing methods that counter the local eavesdropping-based tracing deal with a single asset, and most of them suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. In this paper, we propose a routing method, greedy perimeter stateless routing-based source-location privacy with crew size w (GSLP-w), that enhances location privacy of the packet-originating node (i.e., active source) in the presence of multiple assets. GSLP-w is a hybrid method, in which the next-hop node is chosen in one of four modes, namely greedy, random, perimeter, and retreat modes. Random forwarding brings the path diversity, while greedy forwarding refrains from taking an excessively long path and leads to convergence to the destination. Perimeter routing makes detours that avoid the nodes near assets so that they cannot be located by an adversary tracing up the route path. We study the performance of GSLP-w with respect to crew size w (the number of packets being sent per path) and the number of sources. GSLP-w is compared with phantom routing-single path (PR-SP), which is a notable routing method for source-location privacy and our simulation results show that improvements from the point of the ratio of safety period and delivery latency become significant as the number of source nodes increases.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.371-377
• /
• 2014

Localized topology control is attractive for obtaining reduced network graphs with desirable features such as sparser connectivity and reduced transmit powers. In this paper, we focus on studying how to prolong network lifetime in the context of localized topology control for wireless multi-hop networks. For this purpose, we propose an energy efficient localized topology control algorithm. In our algorithm, each node is required to maintain its one-hop neighborhood topology. In order to achieve long network lifetime, we introduce a new metric for characterizing the energy criticality status of each link in the network. Each node independently builds a local energy-efficient spanning tree for finding a reduced neighbor set while maximally avoiding using energy-critical links in its neighborhood for the local spanning tree construction. We present the detailed design description of our algorithm. The computational complexity of the proposed algorithm is deduced to be O(mlog n), where m and n represent the number of links and nodes in a node's one-hop neighborhood, respectively. Simulation results show that our algorithm significantly outperforms existing work in terms of network lifetime.

• ETRI Journal
• /
• v.27 no.1
• /
• pp.1-12
• /
• 2005

We propose a heuristic buffer management scheme that uses both positive and negative acknowledgments to provide scalability and reliability. Under our scheme, most receiver nodes only send negative acknowledgments to their repair nodes to request packet retransmissions while some representative nodes also send positive acknowledgments to indicate which packets can be discarded from the repair node's buffer. Our scheme provides scalability because it significantly reduces the number of feedbacks sent by the receiver nodes. In addition, it provides fast recovery of transmission errors since the packets requested from the receiver nodes are almost always available in their buffers. Our scheme also reduces the number of additional retransmissions from the original sender node or upstream repair nodes. These features satisfy the original goal of treebased protocols since most packet retransmissions are performed within a local group.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.301-304
• /
• 2002

Powertrain simulation is important fur the analysis of a vehicle performance. Automotive powertrain has been considered as the unified system and should be remodeled, whenever a powertrain system is changed. In this study, a new method is proposed for the synthetic modeling for the automotive powertrain. Components are separated from the powertrain system and constructed the matrix through dynamic relationships. The dynamic equation of the total powertrain system can be driven from the combination of each component. In order to combine each component, the superposition method is modified for the powertrain composition.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.439-442
• /
• 2002

Powertrain simulation is important far the analysis of a vehicle performance. Automotive powertrain has been considered as the unified system and should be remodeled, whenever a powertrain system is changed. In this study, a new method is proposed far the synthetic modeling for the automotive powertrain. Components are separated from the powertrain system and constructed the matrix through dynamic relationships. The dynamic equation of the total powertrain system can be driven from the combination of each component. In order to combine each component, the superposition method is modified for the powertrain composition.