• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.427-434
• /
• 1996

Hypercube has some advantages such as small diameter between nodes and relatively simple routing scheme, so it is one of the most popular interconnection networks used in real systems. But to make this structure more practical, it is required to reduce its diameter and to be able to expand it to any number of nodes. In this study, we proposed a Crossed Incomplete Hypercube structure. This scheme is based on the previous Crossed Hypercube topology that reduces the diameter about 50% and has the same complexity with general hypercube and is able to expand to any number of nodes. We also proposed a fixed routing scheme for this structure. In the repect of the average path and the average routing time, this structure shows an enhanced performance about 30% and it is enhanced about 20% ifn the average traffic density.

• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.27-35
• /
• 2001

This paper presents the assignment motion algorithm unrestricted for code optimization computationally. So, this algorithm is suppressed the unnecessary code motion in order to avoid the superfluous register pressure, we propose the assignment motion algorithm added to the final optimization phase. This paper improves an ambiguous meaning of the predicated. For mixing the basic block level analysis with the instruction level analysis, an ambiguity occurred in knoop’s algorithm. Also, we eliminate an ambiguity of it. Our proposal algorithm improves the runtime efficiency of a program by avoiding the unnecessary recomputations and reexecutions of expressions and assignment statements.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.01a
• /
• pp.327-329
• /
• 2023

순서 의존적 준비시간을 갖는 단일기계 생산라인에서 주어진 작업들을 효율적으로 수행하기 위해서는 최대한 동일하거나 유사한 유형의 작업물들을 연속적으로 처리하여 다음 번 작업물의 처리를 시작하기 전에 발생하는 준비시간을 최소화하여야 한다. 따라서, 대기 중인 것들 중 기계에 투입할 작업물을 적절히 선택하는 것이 중요하며, 이를 위해 작업 배정 규칙과 같은 휴리스틱을 사용할 수도 있지만, 이러한 해법들은 일반적으로 다양한 상황을 동적으로 고려하지 못하는 한계점을 갖는다. 따라서, 본 논문에서는 상용 3D 시뮬레이션 소프트웨어인 FlexSim을 사용하여 모형을 구성한 다음, 강화학습을 적용하여 대기 중인 작업물 중 최적의 후보를 선택하기 위한 작업 배정 모형을 개발하고자 한다. 세부적으로는 강화학습의 상태 및 보상을 달리 설정하면서 학습된 모형의 성능을 비교하고자 한다. 실험 결과를 통해 적절한 시뮬레이션 모형 구성과 강화학습의 파라미터 변수들을 적절히 조합하여 적절한 작업 배정 모형의 개발이 가능하다는 점을 알 수 있었다.

• Journal of Advanced Marine Engineering and Technology
• /
• v.35 no.8
• /
• pp.1098-1104
• /
• 2011

Data communications networks at sea can be modelled by multi-layered networks with traditional carriers (RF, satellites), and BWA (wireless LAN, WiBro, LTE), which partially makes it possible the high speed communication services (WWW, VoIP) at sea. In this paper, a novel routing scheme (CPR) is proposed which selects an optimal carrier for each hop in routes based on carrier preferences (CP). The carrier preferences are measured proactively depending on the feasibility of transmission characteristics (transmission rate, cost, and latency time) of the carriers for each application. Performance was compared with that of the OMH-MW (Optimal Medium per Hop based on Max-Win) routing scheme.

• Journal of Korean Society of Transportation
• /
• v.26 no.2
• /
• pp.89-100
• /
• 2008

In an urban network controlled by traffic signals, there is an interaction between the signal timing and the routes chosen by individual road users. This study develops a bi level programming model for traffic signal optimization in networks with path based traffic assignment. In the bi level programming model, genetic algorithm approach has been proposed to solve upper level problem for a signalized road network. Path based traffic assignment using column generation technique which is proposed by M.H. Xu, is applied at the lower-level. Genetic Algorithm provieds a feasible set of signal timings within specified lower and upper bounds signal timing variables and feeds into lower level problem. The performance of this model is investigated in numerical experiment in a sample network. In result, optimal signal settings and user equilibrium flows are made.

• Journal of Digital Convergence
• /
• v.16 no.3
• /
• pp.487-495
• /
• 2018

The purpose of this study is to diagnose problems of the permanent judge system by examining the cases of practical running of the permanent judge system, and to provide basic materials for the settlement of fair and transparent judge culture. The findings of the case studies are as follows. First, the difficulties in selection, allocation, and education of judges caused by the operation of the permanent judge system. The problems in allocation are forceful allocation, conflict over allocation with general judges. The problems in evaluation are individual evaluation and limits of fairness, lack of evaluation rules. Second, the unpredictability of whether the permanent judge system survive or not. Third, there are some environmental constraints of the permanent judge system. Lack of protective apparatus is lack of rescue method and solution for intentional protest. Forth, there is a problem of low recognition of the permanent judge system. As the federation has been not active in publicizing the permanent judge system, the system is not well known.

• KDI Journal of Economic Policy
• /
• v.37 no.sup
• /
• pp.65-85
• /
• 2015

Park et al. (2012) examined the impacts of coeducation in high school on the college scholastic ability test using random assignment in Seoul high schools. However, the student random assignment in Seoul within a school district was performed only within 30 min commutable areas using public transportation and Park et al. (2012) did not aware of this rule. This paper reexamines the question by matching nearest two single sex schools with a coeducation school within a school district. We found single sex school students achieve higher test score than that of coeducation school for both male and female. The magnitude of test score improvement for female is smaller than that of Park et al. (2012). However, the magnitude for male is bigger than that of Park et al. (2012).

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.3
• /
• pp.1087-1094
• /
• 2013

This study aims at enhancing the objective estimation of social cost of air quality due to mobile emission. More specifically, it examines the difference between the daily oriented and hourly oriented estimation results of social air quality cost and draws implications from the comparative analysis. The result indicates that the social cost of air quality differs up to approximately 24 times depending on the analysis time period. Moneywise, the difference between daily and hourly assignments amounts to the average of 653.5 billion won whereas only 1% of error occurred in the estimation result based on peak and nonpeak based hourly assignment. This study reaffirms the need for time-based travel demand management for emission reduction, and confirms the feasibility of emission estimation by travel demand forecasting method over the conventional method employed by the CAPSS.

• Journal of Korea Game Society
• /
• v.16 no.3
• /
• pp.97-108
• /
• 2016

Multi-client online games usually employ multi-serve architectures. For group play, if the user response time deviation between the clients in a group is large, the fairness and attractions of the game will be degraded. In this paper, given new clients, we propose a method for assigning the clients to servers to minimize the deviation of client-server distance which plays a major role in the user response time. This method also supports client matching for group play and server load balancing. We formulate the client-server assignment problem as an IP one, and present a GA(Genetic Algorithm)-based algorithm to solve it. We experimented our method under various settings and analyzed its features. To our survey, little research has been previously performed on client-server assignment under consideration of client matching, distance deviation minimization and server load balancing.

• Journal of Korea Game Society
• /
• v.17 no.4
• /
• pp.137-148
• /
• 2017

Since the power consumption of data centers is large and computer serves take a large portion of it, there have been much research on the power saving of servers in various ways recently. Among the units of severs CPU is one of major power consuming units. In this paper, a method of client-server assignment for minimizing the CPU power consumption of servers in a game server cluster is proposed. We model the client-server assignment problem as an optimization problem, and find a solution to the problem using a simulated annealing-based technique. One of major features of our method is to select a proper operating frequency according to the amount of load on a server. The selection of a lower frequency in case of low load will result in reducing power consumption. To our survey, little research on client-server assignment in consideration of power consumption has been carried out.