• Journal of the Korea Society for Simulation
• /
• v.21 no.2
• /
• pp.69-78
• /
• 2012

In this paper, a study on finding an appropriate helper node that can help increase effective frame transmission rate for cooperative communications at ad hoc networks is carried out. Those researches from reference use the reactive helper node selection mechanism which starts its role after exchanging RTS and CTS frames between source and destination nodes, and are implemented into our simulator for performance comparison. System throughput and average channel access delay are used for performance measures and all communicating nodes are assumed to move independently within the communication range. It is anticipated that this research result can be used as basic information for designing a new efficient helper node selection scheme.

• Journal of the East Asian Society of Dietary Life
• /
• v.15 no.2
• /
• pp.235-245
• /
• 2005

This study was conducted to investigate the eating out behavior and its factors in restaurant selection by students in Incheon area. Self administered questionnaires were collected from 297 students. Statistical data analysis was completed using a SPSS v. 10.0 program. The results are summarized as follows: The average age, weight, height, BMI and male and female students were $24.31,\;67.96\cal{kg},\;174.93\cal{cm},\;22.17\;;\;20.55,\;51.99\cal{kg},\;165.44\cal{cm},\;19.00$ reflectively. About $54.2\%$ of male students and $38.0\%$ of female students responded to eat out at least once a day. And lunch was most frequent meal for eating out. About $57\%$ of students responded to have eat at restaurants around campus, and $19.5\%$ of students used the university foodservice system. Korean-style food was most favorite dish when they ate out. Major source of restaurants information was recommended action by friends or family. But the use of internet or magazine was negligible. The factor of restaurants choice was in order 'taste', 'price', 'atmosphere' and 'hygienic'.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.4
• /
• pp.219-226
• /
• 2013

Feature selection is the one of important issues in the field of machine learning and pattern recognition. It is the technique to find a subset from the source data and can give the best classification performance. Ie, it is the technique to extract the subset closely related to the purpose of the classification. In this paper, we experimented to select the best feature subset for improving classification accuracy when classify success and failure factors in software reuse. And we compared with existing studies. As a result, we found that a feature subset was selected in this study showed the better classification accuracy.

• Publications of The Korean Astronomical Society
• /
• v.32 no.1
• /
• pp.49-53
• /
• 2017

The point sources in the Bright Source Catalogue of the AKARI Far-Infrared Surveyor (FIS) were classified based on their FIR and mid-IR fluxes and colours into young stellar object (YSO) and extragalactic source types using a Quadratic Discriminant Analysis method (QDA) and Support Vector Machines (SVM). The reliability of the selection of YSO candidates is high, and the number of known YSO candidates were increased significantly, that we demonstrate in the case of the nearby open cluster IC348. Our results show that we can separate galactic and extragalactic AKARI point sources in the multidimensioal space of FIR fluxes and colours with high reliability, however, differentiating among the extragalactic sub-types needs further information.

• Journal of Communications and Networks
• /
• v.12 no.6
• /
• pp.577-581
• /
• 2010

We introduce a novel packet retransmission technique which improves the efficiency of automatic retransmission query (ARQ) protocols in the context of satellite broadcast/multicast systems. The proposed coded ARQ technique, similarly to fountain coding, performs transmission of redundant packets, which are made by linear combinations of the packets composing the source block. Differently from fountain codes, the packets for the linear combinations are selected on the basis of the retransmission requests coming from the user terminals. The selection is performed in a way that, at the terminals, the source packets can be recovered iteratively by means of simple back-substitutions. This work aims at providing a simple and efficient alternative to reliable multicast protocols based on erasure correction coding techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3275-3295
• /
• 2012

In this paper, we analyze the performance of an amplify-and-forward (AF) two-way relaying system, where two sources exchange information via the aid of an intermediate relay that is selected among multiple relays according to max-min criterion. We consider a practical scenario, where one source-relay link undergoes Rician fading, and the other source-relay link is subject to Rayleigh fading. To be specific, we derive a tight lower bound for the outage probability. From this lower bound, the asymptotic outage probability and average symbol error rate (SER) expressions are derived to gain insight into the system performance at high signal-to-noise ratio (SNR) region. Furthermore, we investigate the optimal power allocation (PA) with fixed relay location (RL), optimal RL with fixed PA and joint optimization of PA and RL to minimize the outage probability and average SER. The analytical expressions are verified through Monte Carlo simulations, where the positive impact of Rician factor on the system performance is also illustrated. Simulation results also validate the effectiveness of the proposed PA and relay positioning schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.294-300
• /
• 2017

This paper proposes a method for 3-D sound source localization (SSL) using region selection and TDOA. 3-D SSL involves the estimation of an azimuth angle and an elevation angle. With the aim of reducing the computation time, we compare signal energies to select one out of three regions. In the selected region, we compute only one TDOA value for the azimuth angle estimation. Also, to estimate the vertical angle, we choose the higher energy signal from the selected region and pair it up with the elevated microphone's signal for TDOA computation and elevation angle estimation. Our experimental results show that the proposed method achieves average error values of $0.778^{\circ}$ in azimuth and $1.296^{\circ}$ in elevation, which is similar to other methods. The method uses one energy comparison and two TDOA computations therefore, the total processing time is reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4738-4753
• /
• 2018

Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.433-439
• /
• 2019

Artificial bee colony algorithm is a strong global search algorithm which exhibits excellent exploration ability. The conventional ABC algorithm adopts employed bees, onlooker bees and scouts to cooperate with each other. However, its one dimension and greedy search strategy causes slow convergence speed. To enhance its performance, in this paper, we abandon the greedy selection method and propose an artificial bee colony algorithm with special division and intellective search (ABCIS). For the purpose of higher food source research efficiency, different search strategies are adopted with different employed bees and onlooker bees. Experimental results on a series of benchmarks algorithms demonstrate its effectiveness.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.294-306
• /
• 2005

Group oriented multicast applications are becoming increasingly popular in mobile ad hoc networks (MANETs). Due to dynamic topology of MANETs, stateless multicast protocols are finding increased acceptance since they do not require maintenance of state information at intermediate nodes. Recently, several multicast schemes have been proposed which scale better' with the number of multicast sessions than traditional multicast strategies. These schemes are also known as explicit multicast (Xcast; explicit list of destinations in the packet header) or small group multicast (SGM). In this paper, we propose a new scheme for small group' multicast in MANETs named extended explicit multicast (E2M), which is implemented on top of Xcast and introduces mechanisms to make it scalable with number of group members for a given multicast session. Unlike other schemes, E2M does not make any assumptions related to network topology or node location. It is based on the novel concept of dynamic selection of Xcast forwarders (XFs) between a source and its potential destinations. The XF selection is based on group membership and the processing overhead involved in supporting the Xcast protocol at a given node. If the number of members in a given session is small, E2M behaves just like the basic Xcast scheme with no intermediate XFs. As group membership increases, nodes may dynamically decide to become an XF. This scheme, which can work with few E2M aware nodes in the network, provides transparency of stateless multicast, reduces header processing overhead, minimizes Xcast control traffic, and makes Xcast scalable with the number of group members.