• Journal of Biomedical Engineering Research
• /
• v.36 no.4
• /
• pp.95-102
• /
• 2015

Epilepsy is a chronic neurological disease which produces repeated seizures. Over 30% of epileptic patients cannot be treated with anti-epileptic drugs, and surgical resection may cause loss of brain functions. Seizure suppression by electrical stimulation is currently being investigated as a new treatment method as clinical evidence has shown that electrical stimulation to brain could suppress seizure activity. In this paper, design of a real-time closed-loop neurostimulation system for epileptic seizure suppression is presented. The system records neural signals, detects seizures and delivers electrical stimulation. The system consists of a 6-channel electrode, front-end amplifiers, a data acquisition board by National Instruments, and a neurostimulator and Generic Osorio-Frei algorithm was applied for seizure detection. The algorithm was verified through simulation using electroencephalogram data, and the operation of whole system was verified through simulation and in- vivo test.

• Industrial Engineering and Management Systems
• /
• v.11 no.3
• /
• pp.233-240
• /
• 2012

The implementation of business process management (BPM) systems in large number of business organizations transforms BPM system into such a level of maturity and tends to collect large repositories of business process (BP) models. This issue encourages BP flexibility that leads to a large number of process variants derived from the same model, but differing in structure, to be stored in the large repositories of BP models. Therefore, the repositories may include thousands of activities and related business objects with variation of requirements and quality of service. It is a common practice to customize processes from reference processes or templates in order to reduce the time and effort required to design and deploy processes on all levels. In order to address redundancy and underutilization problems, a generic process model, called as reference BP, is absolutely necessary to cover the best of process variants. This study aims to develop multiple-objective business process genetic algorithm (MOBPGA) to find a set of non-dominated (Pareto) solutions of business reference model to enhance conventional approach which considered only a single objective on creating BP reference model by using proximity score measurement. A mixed-integer linear program is constructed to evaluate performance of the proposed MOBPGA on small-scale problems by using standard measures for multiple-objective techniques. The results will show the viability of applying MOBPGA in terms of simultaneously maximizing proximity score measurement, minimizing total duration, and total costs of the selected reference model.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.149-154
• /
• 2021

Unlike or common images, Hyperspectral images were taken by continuous electromagnetic spectral into numerous bands according to wavelengths and are high-capacity high-resolution images. It has more information than ordinary images, so it is used to explore objects and materials. To reduce the amount of information in hyper-spectral images to be processed, band selection is utilized. Existing band selection techniques are heuristic techniques based on statistics, which take a long time and often lack generality and universality. To compensate for this, this paper utilizes quantization concept to draw representative bands through Discrete Range, we use them for band selection algorithm. Experimental results showed that the proposed technique performed much faster than conventional band selection methods, and that the performance accuracy was similar to that of the original even though the number of bands was reduced by one-seventh to one-tenth.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5701-5722
• /
• 2018

The continuous increase in the cost of energy production and concerns for environmental sustainability are leading research communities, governments and industries to amass efforts to reduce energy consumption and global $CO_2$ footprint. Players in the information and communication industry are keen on reducing the operational expenditures (OpEx) and maintaining the profitability of cellular networks. Meanwhile, network virtualization has been proposed in this regard as the main enabler for 5G mobile cellular networks. In this paper, we propose a generic framework of slice resource provisioning and customized physical resource allocation for energy-efficiency and quality of service optimization. In resource slicing, we consider user demand and population resources provisioning scheme aiming to satisfy quality of service (QoS). In customized physical resource allocation, we formulate this problem with an integer non-linear programming model, which is solved by a heuristic algorithm based on minimum vertex coverage. The proposed algorithm is compared with the existing approaches, without consideration of slice resource constraints via system-level simulations. From the perspective of infrastructure providers, traffic is scheduled over a limited number of active small-cell base stations (sc-BSs) that significantly reduce the system energy consumption and improve the system's spectral efficiency. From the perspective of virtual network operators and mobile users, the proposed approach can guarantee QoS for mobile users and improve user satisfaction.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.6
• /
• pp.81-92
• /
• 2002

In some practical circumstances, the ability of a signer should be restricted. In group signature schemes, a group member of a group may be allowed to generate signatures up to a certain number of times according to his/her position in the group. In proxy signature schemes, an original signer may want to allow a proxy signer to generate a certain number of signatures on behalf of the original signer. In the paper, we present signature schemes, called c-times signature schemes, that restrict the signing ability of a signer up to c times for pre-defined value c at set-up. The notion of c-times signature schemes are formally defined, and generic transformation from a signature scheme to a c-times signature scheme is suggested. The proposed scheme has a self-enforcement property such that if a signer generates c+1 or more signatures, his/her signature is forged. As a specific example, we present a secure c-times signature scheme $^c$DSA based on the DSA (Digital Signature Algorithm) by using a threshold scheme. Our transformation can be applied to other ElGamal-like signature schemes as well.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.1
• /
• pp.37-44
• /
• 2015

In traditional social network analysis, the betweenness centrality measure has been heavily used to identify the relative importance of nodes. Since the time complexity to calculate the betweenness centrality is very high, however, it is difficult to get it of each node in large-scale social network where there are so many nodes and edges. In our past study, we defined a new type of network, called the expanded ego network, which is built only with each node's local information, i.e., neighbor information of the node's neighbor nodes, and also defined a new measure, called the expanded ego betweenness centrality. In this paper, We propose algorithm that quickly computes expanded ego betweenness centrality by exploiting structural properties of expanded ego network. Through the experiment with virtual network used Barab$\acute{a}$si-Albert network model to represent the generic social network and facebook network to represent actual social network, We show that the node's importance rank based on the expanded ego betweenness centrality has high similarity with that the node's importance rank based on the existing betweenness centrality. We also show that the proposed algorithm computes the expanded ego betweenness centrality quickly than existing algorithm.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.25 no.3
• /
• pp.129-141
• /
• 2023

Crop models have been used to predict yield under diverse environmental and cultivation conditions, which can be used to support decisions on the management of forage crop. Cultivar parameters are one of required inputs to crop models in order to represent genetic properties for a given forage cultivar. The objectives of this study were to compare calibration and ensemble approaches in order to minimize the uncertainty of crop yield estimates using the SIMPLE crop model. Cultivar parameters were calibrated using Log-likelihood (LL) and Generic Composite Similarity Measure (GCSM) as an objective function for Metropolis-Hastings (MH) algorithm. In total, 20 sets of cultivar parameters were generated for each method. Two types of ensemble approach. First type of ensemble approach was the average of model outputs (E_em), using individual parameters. The second ensemble approach was model output (E_pm) of cultivar parameter obtained by averaging given 20 sets of parameters. Comparison was done for each cultivar and for each error calculation methods. 'Jowoo' and 'Yeongwoo', which are forage rice cultivars used in Korea, were subject to the parameter calibration. Yield data were obtained from experiment fields at Suwon, Jeonju, Naju and I ksan. Data for 2013, 2014 and 2016 were used for parameter calibration. For validation, yield data reported from 2016 to 2018 at Suwon was used. Initial calibration indicated that genetic coefficients obtained by LL were distributed in a narrower range than coefficients obtained by GCSM. A two-sample t-test was performed to compare between different methods of ensemble approaches and no significant difference was found between them. Uncertainty of GCSM can be neutralized by adjusting the acceptance probability. The other ensemble method (E_pm) indicates that the uncertainty can be reduced with less computation using ensemble approach.

• Tunnel and Underground Space
• /
• v.29 no.4
• /
• pp.243-261
• /
• 2019

Microseismic monitoring technologies have been recognized for its superiority over traditional methods and are used in domestic and overseas underground mines. However, the complex gangway layout of underground mines in Korea and the mixed structure of excavated space and rock masses make it difficult to estimate the microseismic propagation and to determine the arrival time of microseismic wave. In this paper, experimental studies were carried out to determine the source location according to various arrival picking methods and dimensional conditions. The arrival picking methods used were FTC (First Threshold Cross), Picking window, AIC (Akaike Information Criterion), and 2-D and 3-D source generation experiments were performed, respectively, under the 2-D sensor array. In each experiment, source location algorithm used iterative method and genetic algorithm. The iterative method was effective when the sensor array and source generation were the same dimension, but it was not suitable to apply when the source generation was higher dimension. On the other hand, in case of source location using RCGA, the higher dimensional source location could be determined, but it took longer time to calculate. The accuracy of the arrival picking methods differed according to the source location algorithms, but picking window method showed high accuracy in overall.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.3166-3187
• /
• 2017

For "generic" multivariate public key cryptography (MPKC) systems, experts believe that the Unbalanced Oil-Vinegar (UOV) scheme is a feasible signature scheme with good efficiency and acceptable security. In this paper, we address two problems that are to find inversion solution of quadratic multivariate equations and find another structure with some random Oil-Oil terms for UOV, then propose a novel signature scheme based on hyper-sphere (HS-Sign for short) which directly answers these two problems. HS-Sign is characterized by its adding Oil-Oil terms and more advantages compared to UOV. On the one side, HS-Sign is based on a new inversion algorithm from hyper-sphere over finite field, and is shown to be a more secure UOV-like scheme. More precisely, according to the security analysis, HS-Sign achieves higher security level, so that it has larger security parameters choice ranges. On the other side, HS-Sign is beneficial from both the key side and computing complexity under the same security level compared to many baseline schemes. To further support our view, we have implemented 5 different attack experiments for the security analysis and we make comparison of our new scheme and the baseline schemes with simulation programs so as to show the efficiencies. The results show that HS-Sign has exponential attack complexity and HS-Sign is competitive with other signature schemes in terms of the length of the message, length of the signature, size of the public key, size of the secret key, signing time and verification time.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2334-2344
• /
• 1998

Appliciltion systems focusing class units, as component abstraction based on source code, has insufficient benefit of independency and reuse of elements. Only few effects are acquired, because it is only inclined implementation. We need design pattern to represent not only the problem abstraction but also information and relationship between system elements for generic solutions of specific domain Also, it is essential to software reverse engineering to catch the correct system through examming the cxisting system and utilizing the acquired knowledges as reusable resource. Namely, software reverse engineering for extracting the design pattern is very important because it improves the understand ability for system analysis and design through extracting the design structure of object-oriented system, and provides rich and high leIel reusabilitv through grasping the standard idioms and relationships between components. In this paper, we defined the extraction algorithm for design patterns with standardized, packaged and quantitative measlIIul thruugh applying reyerse engineering into existing ubject Olicnted system. And we designed the reengineering toul including reverse engineering for autumatic extractiun of design patterns ami reuse fur retrieval. editing and rebuilding oi design patterns. Also we applied the algorithms into Java applications.