• Proceedings of the Korean Vacuum Society Conference
• /
• 2012.08a
• /
• pp.411-411
• /
• 2012

Over the recent years, surface enhanced Raman spectroscopy (SERS) has dramatically grown as a label-free detecting technique with the high level of selectivity and sensitivity. Conventional SERS-active nanostructured layers have been deposited or patterned on rigid substrates such as silicon wafers and glass slides. Such devices fabricated on a flexible platform may offer additional functionalities and potential applications. For example, flexible SERS-active substrates can be integrated into microfluidic diagnostic devices with round-shaped micro-channel, which has large surface area compared to the area of flat SERS-active substrates so that we may anticipate high sensitivity in a conformable device form. We demonstrate fabrication of flexible SERS-active nanostructured substrates based on soft-lithography for simple, low-cost processing. The SERS-active nanostructured substrates are fabricated using conventional Si fabrication process and inkjet printing methods. A Si mold is patterned by photolithography with an average height of 700 nm and an average pitch of 200 nm. Polydimethylsiloxane (PDMS), a mixture of Sylgard 184 elastomer and curing agnet (wt/wt = 10:1), is poured onto the mold that is coated with trichlorosilane for separating the PDMS easily from the mold. Then, the nano-pattern is transferred to the thin PDMS substrates. The soft lithographic methods enable the SERS-active nanostructured substrates to be repeatedly replicated. Silver layer is physically deposited on the PDMS. Then, gold nanoparticle (AuNP) inks are applied on the nanostructured PDMS using inkjet printer (Dimatix DMP 2831) to deposit AuNPs on the substrates. The characteristics of SERS-active substrates are measured; topology is provided by atomic force microscope (AFM, Park Systems XE-100) and Raman spectra are collected by Raman spectroscopy (Horiba LabRAM ARAMIS Spectrometer). We anticipate that the results may open up various possibilities of applying flexible platform to highly sensitive Raman detection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2895-2921
• /
• 2018

Security has become one of the major concerns in mobile adhoc networks (MANETs). Data and voice communication amongst roaming battlefield entities (such as platoon of soldiers, inter-battlefield tanks and military aircrafts) served by MANETs throw several challenges. It requires complex securing strategy to address threats such as unauthorized network access, man in the middle attacks, denial of service etc., to provide highly reliable communication amongst the nodes. Intrusion Detection and Prevention System (IDPS) undoubtedly is a crucial ingredient to address these threats. IDPS in MANET is managed by Command Control Communication and Intelligence (C3I) system. It consists of networked computers in the tactical battle area that facilitates comprehensive situation awareness by the commanders for timely and optimum decision-making. Key issue in such IDPS mechanism is lack of Smart Learning Engine. We propose a novel behavioral based "Smart Multi-Instance Multi-Label Intrusion Detection and Prevention System (MIML-IDPS)" that follows a distributed and centralized architecture to support a Robust C3I System. This protocol is deployed in a virtually clustered non-uniform network topology with dynamic election of several virtual head nodes acting as a client Intrusion Detection agent connected to a centralized server IDPS located at Command and Control Center. Distributed virtual client nodes serve as the intelligent decision processing unit and centralized IDPS server act as a Smart MIML decision making unit. Simulation and experimental analysis shows the proposed protocol exhibits computational intelligence with counter attacks, efficient memory utilization, classification accuracy and decision convergence in securing C3I System in a Tactical Battlefield environment.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.9
• /
• pp.385-392
• /
• 2015

In IoT(Internet of Things), it is important for wireless networks to communicate data created among resource-constrained wireless nodes, where time synchronization is needed for meaningful data creation and transmission. Time Synchronization by flooding is one of the mostly used protocols for WSN(Wireless Sensor Networks). Even though this type of scheme has some advantages over other types (i.e. a simple algorithm and independency of topology and so on), too many data transmission is required, leading to large power consumption. So, reducing transmission data is an important issue for energy efficiency in this kind of networks. In this paper, a new Flooding-based time synchronization protocol is proposed to use energy efficiently by reducing a transmitted traffic. The proposed scheme's performance has been evaluated and compared with an representative scheme, FTSP(Flooding Time Synchronization Protocol) by simulation. The results are shown that the proposed scheme is better than FTSP.

• The KIPS Transactions:PartB
• /
• v.16B no.4
• /
• pp.319-326
• /
• 2009

PSO(Particle Swarm Optimization) is an optimization algorithm in which simple particles search an optimal solution using shared information acquired through their own experiences. PSO applications are so numerous and diverse. Lots of researches have been made mainly on the parameter settings, topology, particle's movement in order to achieve fast convergence to proper regions of search space for optimization. In standard PSO, since each particle uses only information of its and best neighbor, swarm does not explore diverse regions and intended to premature to local optima. In this paper, we propose a new particle's movement strategy in order to explore diverse regions of search space. The strategy is that each particle moves according to relative weights of several better neighbors. The strategy of exploring diverse regions is effective and produces less local optimizations and accelerating of the optimization speed and higher success rates than standard PSO. Also, in order to raise success rates, we propose a strategy for checking whether swarm falls into local optimum. The new PSO algorithm with these two strategies shows the improvement in the search speed and success rate in the test of benchmark functions.

• Journal of the Korean Society for Library and Information Science
• /
• v.51 no.4
• /
• pp.77-97
• /
• 2017

A recent sharp increase of the biomedical literature causes researchers to struggle to grasp the current research trends and conduct creative studies based on the previous results. In order to alleviate their difficulties in keeping up with the latest scholarly trends, numerous attempts have been made to develop specialized analytic services that can provide direct, intuitive and formalized scholarly information by using various text mining technologies such as information extraction and event detection. This paper introduces and evaluates total 8 Convolutional Neural Network (CNN) models for extracting biomedical events from academic abstracts by applying various feature utilization approaches. Also, this paper conducts performance comparison evaluation for the proposed models. As a result of the comparison, we confirmed that the Entity-Type-Fully-Connected model, one of the introduced models in the paper, showed the most promising performance (72.09% in F-score) in the event classification task while it achieved a relatively low but comparable result (21.81%) in the entire event extraction process due to the imbalance problem of the training collections and event identify model's low performance.

• The Journal of the Korea Contents Association
• /
• v.11 no.7
• /
• pp.70-79
• /
• 2011

The multi-path routing schemes that assigns labels to sensor nodes for the reliability of data transmission and the accuracy of an aggregation query over the sensor networks where data transfer is prone to defect have been proposed. However, the existing schemes have high costs for reassigning labels to nodes when the network topology is changed. In this paper, we propose a novel routing method that avoids duplicated data and reduces the update cost of a sensor node. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through the various experiments. Our experimental results show that our proposed method reduces about 95% the amount of the transmitted data for restoration to node failure and about 220% the amount of the transmitted data for query processing over the existing method on average.

• The KIPS Transactions:PartC
• /
• v.15C no.5
• /
• pp.419-428
• /
• 2008

IEEE 802.15.4 reserves transmission time to support real-time transport by sending GTS request packets to the PAN coordinator in advance. This paper introduces GTS-FAT technique to reduce the reservation time by giving a higher sending priority to GTS request packets than data packets. Differently from the conventional scheme where these two kinds of packets share a single transmission queue, GTS-FAT scheme allocates two queues with two different contention window sizes like IEEE 802.11e. This paper also proposes an analytical GTS delay model by combining the two legacy models for 802.15.4 and 802.11e to accurately predict the GTS-FAT delay over a given network topology. Our analysis shows that GTS-FAT reduces GTS service delay by up to 50% at the expense of the data delay by only up to 6.1% when GTS request packets four times outnumber data packets.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.171-176
• /
• 2004

This paper presents the design of a certain highly efficient security policy negotiation of SPS(Security Policy System) for secure network management using mobile agent system. The conventional IP security systems for secure network management have some problems. A drawback to these systems is that the required policy between each security area is different. Another problem is not possible to guarantee whether a packet is transmitted through the same path by both directions and is protected by the same policy due to the topology of the network. Unlike conventional systems, the model developed herein can be resolved by using a mobile agent technology. If each domain needs a negotiation of security policy, a mobile agent manages the result of the negotiation in the form of a passport and guarantees the authentication and reliability each other by using the passport.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.163-170
• /
• 2007

The next generation communication environment consists of various wireless access networks with distinct features that are configured as an overlay topology. In the network environments, the frequency of hand overs should be minimized and the error propagation should be solved in order to provide high-quality multimedia services to mobile users. Therefore, we propose an performance enhancement approach, based on mSCTP, that provides high quality multimedia services to mobile users by ameliorating the error propagation problem. We utilizes the following four functions: 1) the separation of transmission paths according to the types of frames. 2) retransmission strategy to minimize the loss rate of frames, 3) Foced vertical handover execution by utilizing bicasting, 4) using the stability period in order to reduce the effect of the ping pong phenomenon. The simulation results show that the proposed approach provides seamless multimedia service to mobile users by achieving error resilience.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.191-198
• /
• 2007

A mobile ad-hoc network (MANET) is an autonomous, infrastructure-less system that consists of mobile nodes. In MANET, on demand routing protocols are usually used because network topology changes frequently. AODV, which is a representative on demand routing protocol, operates using the routing table of each node that includes next hop of a route for forwarding packets. It maintains the established route if there is not an expiration of route or any link break. In the paper, we propose a partially adaptive route maintenance scheme (AODV-PA) based on AODV, which provides dynamic route modification of initial route for selecting the effective route using not only next hop but also next-hop of next-hop (i.e. 2-hop next node) acquired through route discovery process. In addition, the proposed scheme additionally manages the routing table for preventing exceptional link breaks by route modification using HELLO messages. We use NS 2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio, latency, routing overhead.