• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1533-1539
• /
• 2011

In this paper, a class of nonlinear bilevel programs, i.e. the lower level problem is linear programs, is considered. Aiming at this special structure, we append the duality gap of the lower level problem to the upper level objective with a penalty and obtain a penalized problem. Using the penalty method, we give an existence theorem of solution and propose an algorithm. Then, a numerical example is given to illustrate the algorithm.

• Management Science and Financial Engineering
• /
• v.10 no.2
• /
• pp.89-102
• /
• 2004

In this paper, we deal with a processor assignment problem that minimizes the total traffic load of an ATM switch controller by optimally assigning processors to ATM interface units. We develop an integer programming (IP) model for the problem, and devise an effective tabu search heuristic. Computational results reveal the efficacy of the proposed tabu search procedure, finding a good quality solution within 5% of optimality gap.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.965-966
• /
• 2006

As billion transistors system-on-chip (SoC) design becomes a reality, the productivity gap between rapidly increasing design complexity and designer productivity lagging behind is becoming a more serious problem to be solved. To reduce the gap, we present a system that generates executable transaction level models automatically. It speed up the SoC design space exploration process at various abstraction levels.

• International Journal of Computer Science & Network Security
• /
• v.23 no.2
• /
• pp.55-64
• /
• 2023

The travelling salesman problem (TSP) is an important combinatorial optimization problem that is used in several engineering science branches and has drawn interest to several researchers and scientists. In this problem, a salesman from an arbitrary node, called the warehouse, starts moving and returns to the warehouse after visiting n clients, given that each client is visited only once. The objective in this problem is to find the route with the least cost to the salesman. In this study, a meta-based ant colony system algorithm (ACSA) is suggested to find solution to the TSP that does not use local pheromone update. This algorithm uses the global pheromone update and new heuristic information. Further, pheromone evaporation coefficients are used in search space of the problem as diversification. This modification allows the algorithm to escape local optimization points as much as possible. In addition, 3-opt local search is used as an intensification mechanism for more quality. The effectiveness of the suggested algorithm is assessed on a several standard problem instances. The results show the power of the suggested algorithm which could find quality solutions with a small gap, between obtained solution and optimal solution, of 1%. Additionally, the results in contrast with other algorithms show the appropriate quality of competitiveness of our proposed ACSA.

• Communications for Statistical Applications and Methods
• /
• v.25 no.5
• /
• pp.545-557
• /
• 2018

The inclusion of covariates in the model often affects not only the estimates of meaningful variables of interest but also its statistical significance. Such gap between statistical and subject-matter significance is a critical issue in huge sample studies. A popular huge sample study, the sample cohort data from Korean National Health Insurance Service, showed such gap of significance in the inference for the effect of obesity on cause of mortality, requiring careful consideration. In this regard, this paper proposes a sample size calibration method based on a Monte Carlo t (or z)-test approach without Monte Carlo simulation, and also proposes a test procedure for subject-matter significance using this calibration method in order to complement the deflated p-value in the huge sample size. Our calibration method shows no subject-matter significance of the obesity paradox regardless of race, sex, and age groups, unlike traditional statistical suggestions based on p-values.

• IE interfaces
• /
• v.22 no.3
• /
• pp.263-277
• /
• 2009

This research deals with a task assignment problem to worker group which consists of one master and one assistant. Each task must be assigned to only one worker group and it is possible to make a pair of each master and each assistant to organize a worker group. A worker group may have more than one task assigned to it, but the workloads of each worker group must be balanced within the allowable range. This problem can be formulated mathematically using the Mixed Integer Programming(MIP), where the objective function is to minimize the total assignment cost. A two phase heuristic algorithm is suggested in order to find approximate solutions. The first phase is to obtain an initial solution, where the initial assignment is performed to follow the workload adjustment. In the second phase, the solution is improved through the repeated process of the exchange and the assignment adjustment. Numerical experiments have been performed to evaluate the performance of the heuristic algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.237-240
• /
• 2014

Recent information and technology is strongly targeted at the young generation, but little research has been undertaken on the older generation. The 55~79 age group was over 1,000,000 people in 2012. As a result, the problems of the information gap and of job creation for older people is becoming a critical social challenge. Because of this need, this research aims to suggest study method to reduce the information gap through informatization education for people of advanced age. Through this, older people can be mentors and play a key role in society as well as contributing to reduce social conflicts. This research is undertaken based on elderly IT volunteers, and is expected to solve the information gap problem through advanced age IT education and job creation with talent donation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.6
• /
• pp.149-161
• /
• 2003

Partially blind signature scheme allows the signer to insert non-removable common information into his blind signature. Blind signatures providing with both users privacy and data authenticity are one of key parts of information systems, such anonymous electronic cash and electronic voting as typical examples. Partially blind signature, with which all expired e-cash but for still-alive can be removed from the banks database, copes well with the problem of unlimited growth of the banks' database in an electronic cash system. In this paper we propose an efficient ID-based partially blind signature scheme using the Weil-pairing on Gap Diffie-Hellman group. The security of our scheme relies on the hardness of Computational Diffie-Hellman Problem. The proposed scheme provides higher efficiency than existing partially blind signature schemes by using three-pass protocol between two participants, the signer and requesters also by reducing the computation load. Thus it can be efficiently used in wireless environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.183-188
• /
• 2008

Satellite DMB(Digital Multimedia Broadcasting) uses the Cap Filler(GF) that provides a service to the wave shade area of the satellite signal that is a non-line of sight area. The GF is the repeater and the Satellite DMB Systems certainly must construct the GF Network toguarantee the movement reception of the terminal. As the coverage of the GF is formed the Cell or Sector, when the multiple GF is established to be contiguous, the problem of the interference will be able to occur. This paper describes the Satellite DMB system and the GF, and it investigate the design fundamentals plan of the GF Network that it will be able to reduce this problem. As a result, in case of the distance that GF and terminal unit is above 4.6Km, service is not provided because of quality degradation according to mutual interference.

• Journal of Korea Multimedia Society
• /
• v.22 no.8
• /
• pp.874-886
• /
• 2019

To delve into the semantic gap problem of the automatic video summarization, we focused on an endogenous ERP responses at around 400ms and 600ms after the on-set of audio-visual stimulus. Our experiment included two factors: the topic exploration of experimental conditions (Topic Given vs. Topic Exploring) as a between-subject factor and the topic relevance of the shots (Topic-Relevant vs. Topic-Irrelevant) as a within-subject factor. For the Topic Given condition of 22 subjects, 6 short historical documentaries were shown with their video titles and written summaries, while in the Topic Exploring condition of 25 subjects, they were asked instead to explore topics of the same videos with no given information. EEG data were gathered while they were watching videos in real time. It was hypothesized that the cognitive activities to explore topics of videos while watching individual shots increase the amplitude of endogenous ERP at around 600 ms after the onset of topic relevant shots. The amplitude of endogenous ERP at around 400ms after the onset of topic-irrelevant shots was hypothesized to be lower in the Topic Given condition than that in the Topic Exploring condition. The repeated measure MANOVA test revealed that two hypotheses were acceptable.