• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.4
• /
• pp.89-97
• /
• 2024

The problem of the spokes puzzle(SP), which connects the spokes(edges) required by the wheel axis (hub, vertex) without intersection to form a network in which all the hubs are connected, can be said to be a wasteland of research. For this problem, there is no algorithm that presents a brute-force search or branch-and-bound method that takes exponential time. This paper proposes an algorithm to plot a lattice graph with cross-diagonal lines of m×n for a given SP and to pruning(delete) the surplus edges(spokes). The proposed algorithm is a simple way to select an edge of a hub whose number of edges matches the hub requirement and delete the edge crossing it. If there is no hub with an edge that meets the hub requirement, a strategy was adopted to preferentially delete(pruning) the edge of the hub with the maximum amount of spare. As a result of applying the proposed algorithm to 20 benchmarking experimental data, it was shown that a solution that minimizes the number of trials and errors can be obtained for all problems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2087-2093
• /
• 2014

In this paper, an orthogonal matching pursuit (OMP) method combined with genetic algorithm (GA), named GAOMP, is proposed for sparse signal recovery. Some recent greedy algorithms such as SP, CoSaMP, and gOMP improved the reconstruction performance by deleting unsuitable atoms at each iteration. However they still often fail to converge to the solution because the support set could not avoid the local minimum during the iterations. Mutating the candidate support set chosen by the OMP algorithm, GAOMP is able to escape from the local minimum and hence recovers the sparse signal. Experimental results show that GAOMP outperforms several OMP based algorithms and the $l_1$ optimization method in terms of exact reconstruction probability.

• International Journal of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.71-75
• /
• 2019

Sleep apnea is a disease that causes various complications, and the polysomnography is expensive and difficult to measure. The purpose of this study is to develop an unrestricted wearable monitoring system so that patients can be examined in a familiar environment. We used a method to detect sleep apnea events and to determine sleep satisfaction by non-constrained method using SpO2 measurement sensor and 3-axis acceleration sensor. Heart rate and SpO2 were measured at the finger using max30100. After acquiring the SpO2 data of the user in real time, the apnea measurement algorithm was used to transmit the number of apnea events of the user to the mobile phone using Bluetooth (HC-06) on the wrist. Using the three-axis acceleration sensor (mpu6050) attached to the upper body, the number of times of tossing and turning during sleep was measured. Based on this data, this algorithm evaluates the patient's tossing and turning during sleep and transmits the data to the mobile phone via Bluetooth. The power source used 9 volts battery to operate Arduino UNO and sensors for portability and stability, and the data received from each sensor can be used to check the various degree between sleep apnea and sleep tossing and turning on the mobile phone. Through thisstudy, we have developed a wearable sleep apnea measurement system that can be easily used at home for the problem of low sleep efficiency of sleep apnea patients.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1638-1653
• /
• 2014

A sequential optimization algorithm (SOA) for resource allocation in a cyclic-prefixed single-carrier cognitive relay system is proposed in this study. Both subcarrier pairing (SP) and power allocation are performed subject to a primary user interference constraint to minimize the mean squared error of frequency-domain equalization at the secondary destination receiver. Under uniform power allocation at the secondary source and optimal power allocation at the secondary relay, the ordered SP is proven to be asymptotically optimal in maximizing the matched filter bound on the signal-to-interference-plus-noise ratio. SOA implements the ordered SP before power allocation optimization by decoupling the ordered SP from the power allocation. Simulation results show that SOA can optimize resource allocation efficiently by significantly reducing complexity.

• KNOM Review
• /
• v.22 no.1
• /
• pp.42-51
• /
• 2019

Recently, the amount of internet traffic is increasing due to the increase in speed and capacity of the network environment, and protocol data is increasing due to mobile, IoT, application, and malicious behavior. Most of these private protocols are unknown in structure. For efficient network management and security, analysis of the structure of private protocols must be performed. Many protocol reverse engineering methodologies have been proposed for this purpose, but there are disadvantages to applying them. In this paper, we propose a methodology for inferring a detailed protocol structure based on network trace analysis by hierarchically combining CSP (Contiguous Sequential Pattern) and SP (Sequential Pattern) Algorithm. The proposed methodology is designed and implemented in a way that improves the preceeding study, A²PRE, We describe performance index for comparing methodologies and demonstrate the superiority of the proposed methodology through the example of HTTP, DNS protocol.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.231-232
• /
• 2007

In this paper, a fault diagnosis and control integrated system (FDCIS) was developed to control the thermoelectric (TE) power in the SP-100 space reactor. The objectives of the proposed model predictive control were to minimize both the difference between the predicted TE power and the desired power, and the variation of control drum angle that adjusts the control reactivity. Also, the objectives were subject to maximum and minimum control drum angle and maximum drum angle variation speed. A genetic algorithm was used to optimize the model predictive controller. The model predictive controller was integrated with a fault detection and diagnostics algorithm so that the controller can work properly even under input and output measurement faults. With the presence of faults, the control law was reconfigured using online estimates of the measurements. Simulation results of the proposed controller showed that the TE generator power level controlled by the proposed controller could track the target power level effectively even under measurement faults, satisfying all control constraints.

• Environmental Engineering Research
• /
• v.24 no.3
• /
• pp.397-403
• /
• 2019

Microcystis sp. is one of the most common harmful cyanobacteria that release toxic substances. Counting algal cells is often used for effective control of harmful algal blooms. However, Microcystis sp. is commonly observed as a colony, so counting individual cells is challenging, as it requires significant time and labor. It is urgent to develop an accurate, simple, and rapid method for counting algal cells for regulatory purposes, estimating the status of blooms, and practicing proper management of water resources. The flow cytometer and microscope (FlowCAM), which is a dynamic imaging particle analyzer, can provide a promising alternative for rapid and simple cell counting. However, there is no accurate method for counting individual cells within a Microcystis colony. Furthermore, cell counting based on two-dimensional images may yield inaccurate results and underestimate the number of algal cells in a colony. In this study, a three-dimensional cell counting approach using a novel model algorithm was developed for counting individual cells in a Microcystis colony using a FlowCAM. The developed model algorithm showed satisfactory performance for Microcystis sp. cell counting in water samples collected from two rivers, and can be used for algal management in fresh water systems.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.3
• /
• pp.224-230
• /
• 2002

In this paper, a counting algorithm hybridized with an adaptive automatic thresholding method based on Otsu's method and the algorithm that elongates markers obtained by the well-known watershed algorithm is proposed to enhance the exactness of the microcell counting in microscopic images. The proposed counting algorithm can be stated as follows. The transformed full image captured by CCD camera set up at microscope is divided into cropped images of m$\times$n blocks with an appropriate size. The thresholding value of the cropped image is obtained by Otsu's method and the image is transformed into binary image. The microbial cell images below prespecified pixels are regarded as noise and are removed in tile binary image. The smoothing procedure is done by the area opening and the morphological filter. Watershed algorithm and the elongating marker algorithm are applied. By repeating the above stated procedure for m$\times$n blocks, the m$\times$n segmented images are obtained. A superposed image with the size of 640$\times$480 pixels as same as original image is obtained from the m$\times$n segmented block images. By labeling the superposed image, the counting result on the image of microbial cells is achieved. To prove the effectiveness of the proposed mettled in counting the microbial cell on the image, we used Acinetobacter sp., a kind of ammonia-oxidizing bacteria, and compared the proposed method with the global Otsu's method the traditional watershed algorithm based on global thresholding value and human visual method. The result counted by the proposed method shows more approximated result to the human visual counting method than the result counted by any other method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2105-2112
• /
• 2009

Recently RFID system has been adopted in various fields rapidly. However, we ought to solve the problem of privacy invasion that can be occurred by obtaining information of RFID Tag without any permission for popularization of RFID system To solve the problems, it is Ohkubo et al.'s Hash-Chain Scheme which is the safest method. However, this method has a problem that requesting lots of computing process because of increasing numbers of Tag. Therefore, We suggest the way (process) satisfied with all necessary security of Privacy Protection Shreme and decreased in Tag Identification Time in this paper. First, We'll suggest the SP-Division Algorithm seperating SPs using the Performance Measurement consequence of each node after framing the program to create Hash-Chain Calculated table to get optimized performance because of character of the grid environment comprised of heterogeneous system. If we compare consequence fixed the number of nodes to 4 with a single node, equal partition, and SP partition, when the total number of SPs is 1000, 40%, 49%, when the total number of SPs is 2000, 42%, 51%, when the total number of SPs is 3000, 39%, 49%, and when the total number of SPs is 4000, 46%, 56% is improved.

• Proceedings of the IEEK Conference
• /
• 2000.06e
• /
• pp.117-120
• /
• 2000

Pulse oximetry is a well established non-invasive optical technique for monitoring the SpO$_2$ during anaesthesia, recovery and intensive care. Pulse oximeters determine the oxygen saturation level of blood by measuring the light absorption of arterial blood. The sensors consists of red and infrared light sources and photodetectors. In the measurement of the hemoglobin oxygen saturation, conventional method has required the technique of filtering of remove the noise, and of complex signal processing algorithm. So much time have required to signal processing. In this research, we separate AC signal and DC signal in the stage of signal detection. We filter the noise from each signal and convert A/D. We obtain the SpO$_2$ using the DSP algorithm.