• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.213-224
• /
• 2009

Most of existing routing methods in wireless sensor networks to counter the local eavesdropping-based packet-tracing deal with a single asset and suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. Recently, the author proposed a routing method, GSLP-w(GPSR-based Source-Location Privacy with crew size w), that enhances location privacy of the packet-originating node(i.e., active source) in the presence of multiple assets, yet taking a path of not too long. In this paper, we present a refined routing(i.e., next-hop selection) procedure of it and empirically study privacy strength and delivery latency with varying the crew size w(i.e., the number of packets being sent per path). It turns out that GSLP-w offers the best privacy strength when the number of packets being sent per path is randomly chosen from the range [$1,h_{s-b}/4$] and that further improvements on the privacy are achieved by increasing the random walk length TTLrw or the probability prw that goes into random walk(where, $h_{s-b}$ is the number of hops of the shortest path between packet-originating node s and sink b).

• Korean Journal of Head & Neck Oncology
• /
• v.34 no.1
• /
• pp.49-53
• /
• 2018

Primary non-Hodgkin's lymphoma (NHL) rarely involves the parotid gland and its incidence is only 1.7% to 3.1% of all salivary gland neoplasms. The mucosa associated lymphoid tissue (MALT) is the most common subtype of NHL, followed by follicular lymphoma (FL) and diffuse large B cell lymphoma (DLBCL). However, two distinct types of lymphomas occurring synchronously in the parotid gland and cervical lymph node have not been reported earlier. A 72-year-old man with rubbery-hard and fixed mass on the left parotid area came to our clinic. We performed the left total parotidectomy with ipsilateral excision of lymph node (level II), and he was finally diagnosed as DLBCL in parotid gland and FL in upper neck. It is presumed that the DLBCL appeared to be a transformation from FL. We report the unique and rare disease entity with brief literature review.

• Journal of Korean Society of Steel Construction
• /
• v.23 no.4
• /
• pp.455-464
• /
• 2011

In this study, the buckling analysis of the vertically curved stiffened web plate was conducted through finite-element analysis, using an eight- and nine-node flat shell element with a substitute shear strain field. To investigate the buckling behavior of the vertically curved web plate with a longitudinal or vertical stiffener under in-plane moment loading, parametric studies were conducted for the variation of the width (b) and ratio of the bending stiffness of the stiffener to that of the plate (${\gamma}=EI/bD$). The static behavior of the vertically curved web plate without a stiffener was also investigated, and then the buckling abilities of the longitudinal and vertical stiffeners were compared under moment loading.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.74-90
• /
• 2014

Routing in mobile wireless sensor networks (MWSNs) is an extremely challenging issue due to the features of MWSNs. In this paper, we present a novel bio-inspired trusted routing protocol (B-iTRP) based on artificial immune system (AIS), ant colony optimization (ACO) and Physarum optimization (PO). For trust mechanism, B-iTRP monitors neighbors' behavior in real time and then assesses neighbors' trusts based on AIS. For routing strategy, each node proactively finds routes to the Sink based on ACO. When a backward ant is on the way to return source, it senses the energy residual and trust value of each node on the discovered route, and calculates the link trust and link energy of the route. Moreover, B-iTRP also assesses the availability of route based on PO to maintain the route table. Simulation results show how B-iTRP can achieve the effective performance compared to existing state-of-the-art algorithms.

• Journal of Acupuncture Research
• /
• v.39 no.4
• /
• pp.304-309
• /
• 2022

Background: This study was conducted to determine the anti-inflammatory effect of astaxanthin, on atopic dermatitis. Methods: Changes in mouse body weight, lymph node weight, and the degree of improvement in symptoms were measured to determine the inflammatory response. Real-time reverse transcription-polymerase chain reaction tests were performed to determine the degree of expression of inflammation-related cytokines (IL-31 and IL-33 and chemokines such as CCL17 and CCL22), and western blot analysis was performed to evaluate the expression of inflammation-related factors (iNOS, COX-2, and NF-kB signaling molecules p-IkBα, p50, p-65 and pSTAT3). Results: The degree of symptoms significantly improved in the PA+AX group. Lymph node weight in the PA+AX group was lower than the PA group. Inflammatory cytokines (IL-31, IL-33, and inflammatory chemokines such as CCL17 and CCL22) were significantly reduced in the PA+AX group compared with the PA group. The expression of inflammatory genes (iNOS, COX-2, NF-kB and signaling molecules (p-IkBα, p50, p65, and p-STAT 3) was lower in the PA+AX group compared with the PA group. Conclusion: Astaxanthin may modulate the inflammatory response in a mouse model of atopic dermatitis and has an anti-inflammatory effect.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.1023-1043
• /
• 2010

As main memory get cheaper, it becomes increasingly affordable to load entire index of DBMS and to access the index. Since speed gap between CPU and main memory is growing bigger, many researches to reduce a cost of main memory access are under the progress. As one of those, cache conscious trees can reduce the cost of main memory access. Since cache conscious trees reduce the number of cache miss by compressing data in node, cache conscious trees can reduce the cost of main memory. Existing cache conscious trees use only fixed one compression technique without consideration of properties of data in node. First, this paper proposes the DC-tree that uses various compression techniques and change data layout in a node according to properties of data in order to reduce cache miss. Second, this paper proposes the level of compression locality that describes properties of data in node by formula. Third, this paper proposes Forced Partial Decomposition (FPD) that reduces the nutter of cache miss. DC-trees outperform 1.7X than B+-tree, 1.5X than simple prefix B+-tree, and 1.3X than pkB-tree, in terms of the number of cache misses. Since proposed DC-trees can be adopted in commercial main memory database system, we believe that DC-trees are practical result.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.12
• /
• pp.239-246
• /
• 2014

In this paper, we propose a method to decide the additional edges in order to integrate two communitites A,B($${\mid}A{\mid}{\geq_-}{\mid}B{\mid}$$, ${\mid}{\cdot}{\mid}$ is the size of the set). The proposed algorithm uses a fitness function that shows the property of a community and the fitness function is defined by the number of edges which exist in the community and connect two nodes, one is in the community and the other is out of the community. The community has a strong property when the function has a large value. The proposed algorithm is a kind of greedy method and when a node of B is merged to A, the minimum number of additional edges is decided to increase the fitness function value of A. After determining the number of additional edges, we define the community connectivity measures using the node centrality to determine the edges locations. The connections of the new edges are fixed to maximize the connectivity measure of the combined community. The procedure is applied for all nodes in B to integrate A and B. The effectiveness of the proposed algorithm is shown by solving the Zachary Karate Club network.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.54 no.10
• /
• pp.477-482
• /
• 2005

In this paper, detent force is minimized using notch and slot-aputure width adjustment in a slotted PMLSM. This time, the moving model node technique has used to reduce the time and the effort for calculation according to changing design parameters. As the result, the detent force of proposed model is decreased from 9.44[N] to 0.97[N] compare with it of basic model greatly. The thrust Is decreased 1.3[$\%$] from 342.07[N] to 337.48[N] a little. The notch is applied to PMLSM simply, the detent force is reduced greatly.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.6
• /
• pp.922-931
• /
• 1995

In this paper, we propose a modified error function to improve the EBP(Error Back-Propagation) algorithm of Multi-Layer Perceptrons. Using the modified error function, the output node of MLP generates a strong error signal in the case that the output node is far from the desired value, and generates a weak error signal in the opposite case. This accelerates the learning speed of EBP algorothm in the initial stage and prevents overspecialization for training patterns in the final stage. The effectiveness of our modification is verified through the simulation of handwritten digit recognition.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.26 no.11
• /
• pp.1521-1530
• /
• 2002

This article proposes a pressure based method for predicting flows at all speeds. The compressible SIMPLE algorithm is extended to unstructured grid framework. Convection terms are discretized using second-order scheme with deferred correction approach. Diffusion term discretization is based on structured grid analogy that can be easily adopted to hybrid unstructured grid solver. This method also uses node centered scheme with edge based data structure for memory and computing time efficiency of arbitrary grid types. Both incompressible and compressible benchmark problems are solved using the above methodology. The demonstration of this method is extended to slip flow problem that has low Reynolds number but compressibility effect. It is shown that the proposed method can improve efficiency in memory usage and computing time without losing any accuracy.