• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.699-707
• /
• 2003

RBAC is accepted as a more advanced control method than existing DAC and MAC. Studies on the permission-role part of RBAC model are relatively insufficient compared with those on the user-role part, and researches on symmetric RBAC models to overcome this is also in an incipient stage. Therefore there is much difficulty in assigning permissions suitable for roles. This paper proposes an symmetric RBAC model that supplements the constraints on permission assignment set forth by previous studies. The proposed symmetric RBAC model reflects the conflicts of interests between roles and the sharing and integration of permissions on the assignment of permissions by presenting the constraints on permission assignment that take the separation of duties and role hierarchies into consideration. In addition, by expressing constraints prescribing prerequisite relations between dynamic permissions through AND/OR graphs, it is possible to effectively limit the complicated prerequisite relations of permissions. The constraints on permission assignment for the proposed symmetric RBAC model reduce errors in permission assignment by properly detailing rules to observe at the time of permission assignment.

• Journal of Korean Society of Transportation
• /
• v.25 no.2 s.95
• /
• pp.133-143
• /
• 2007

Previous studies on the transit assignment hardly show its achievement in research but have many limitations not only in theory but also in practice. This paper presents an integrated transit assignment model taking into account cost functions of multiple modes, such as auto, bus and subway, which represent an integrated network. An integrated transit network including cost functions and in-vehicle congestion needs to be developed. In addition, a link fare calculation model needs to be developed and applied to the model to calculate path travel costs. Based on these sub-models, a path-based traffic assignment model, which considers in-vehicle congestion and an integrated distance-based fare system in the integrated traffic network, is developed.

• Journal of the Korean Society for Railway
• /
• v.12 no.4
• /
• pp.488-498
• /
• 2009

The characteristics of intercity rail network are different from those of public transit network in urban area. In this paper, we proposed a new transit assignment model which is generalized form of deterministic assignment model by introducing line selection probability on route section. This model consider various characteristics of intercity rail and simplify network expansion for appling search algorithms developed in road assignment model. We showed the model availability by comparing with existing models using virtual networks. The tests on a small scale network show that this model is superior to existing models for predicting intercity rail demand.

• Journal of Korean Society of Transportation
• /
• v.20 no.4
• /
• pp.135-150
• /
• 2002

The basic assumption of analytical Dynamic Traffic Assignment models is that traffic demand and network conditions are known as a priori and unchanging during the whole planning horizon. This assumption may not be realistic in the practical traffic situation because traffic demand and network conditions nay vary from time to time. The rolling horizon implementation recognizes a fact : The Prediction of origin-destination(OD) matrices and network conditions is usually more accurate in a short period of time, while further into the whole horizon there exists a substantial uncertainty. In the rolling horizon implementation, therefore, rather than assuming time-dependent OD matrices and network conditions are known at the beginning of the horizon, it is assumed that the deterministic information of OD and traffic conditions for a short period are possessed, whereas information beyond this short period will not be available until the time rolls forward. This paper introduces rolling horizon implementation to enable a multi-class analytical DTA model to respond operationally to dynamic variations of both traffic demand and network conditions. In the paper, implementation procedure is discussed in detail, and practical solutions for some raised issues of 1) unfinished trips and 2) rerouting strategy of these trips, are proposed. Computational examples and results are presented and analyzed.

• Journal of KIISE
• /
• v.44 no.11
• /
• pp.1156-1164
• /
• 2017

Existing studies on automatic bug triage were mostly used the method of designing the prediction system based on the machine learning algorithm. Therefore, it can be said that applying a high-performance machine learning model is the core of the performance of the automatic bug triage system. In the related research, machine learning models that have high performance are mainly used, such as SVM and Naïve Bayes. In this paper, we apply Deep Learning, which has recently shown good performance in the field of machine learning, to automatic bug triage and evaluate its performance. Experimental results show that the Deep Learning based Bug Triage system achieves 48% accuracy in active developer experiments, un improvement of up to 69% over than conventional machine learning techniques.

• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.31-40
• /
• 1998

본 연구의 목적은 기존의 Cell Transmission(1994, Daganzo) 교통류 이론을 기반으로 동적통행배정 모형을 개발하는 것이다. 이 모형은 동적 O-D 발생모듈, HOV 차선모듈, 분류부 분할모델, 링크비용함수 모듈, 최단경로 탐색 모듈등으로 구성된다. 이 모델에서 적용하는 교통류 모델은 각 링크를 동일한 특성을 가지는 셀로 구분하여 셀내의 진입시간과 진출시간을 계산하여 링크비용을 계산하는데 이것은 비용의 과대·과소 추정을 피할 수 있으며 교통지체 현상을 현실적으로 표현해 줄 수 있는 장점이 있다. 또한 HOV 차선 모듈에 의해 수단별 교통류 진행 및 비용고려가 가능하며 HOV 차선의 평가 및 분석이 가능하다. 기존의 동적통행배정모형은 매 시간대별 출발지에서 균형상태를 추구하는 통행배정기법을 사용하고 있지만 이 모델은 분류되는 노드를 가상의 출발점이라고 가정하여 각 시간대별로 최단경로를 탐색하여 균형상태를 추구해나가는 기법을 적용하고 있다. 각 셀별 차량을 목적지별, 차종별, 대기시간별로 추적하여 진행시키며 분류부에서는 최단경로를 탐색하여 배분된다. 또한 진행하고자 하는 셀의 용량과 현재 셀의 밀도를 고려함으로서 용량제약 하에서의 동적통행배정모형을 적용하고 있다. 이 모형은 고속로의 합류부 및 분류부의 교통특성을 세밀히 분석할 수 있으며, TCS 및 램프미터링과 접목하여 고속도로 운영에 이용될 수 있으며, 고속도로 중·장기적인 계획에 이용될 수 있다.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.55-67
• /
• 2008

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 predicate. 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.

• Journal of the Korean Society for Railway
• /
• v.17 no.2
• /
• pp.140-147
• /
• 2014

Line planning is an important step to determine the optimal frequencies of trains given the forecasted demand for each train type. The main input data for line planning is the leg traffic demand which can be derived using suitable traffic assignment models. However most assignment models require a line plan, in other words, train frequencies or headways, so that inconsistent results just by the procedural approach to find an optimal line plan after determining leg traffic can be avoided. This paper suggests a unified model that can consider the traffic assignment and line planning, simultaneously. We further provide an elaborated approximation algorithm and, finally, provide experimental results determined for the Korean railway network.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.5
• /
• pp.3093-3099
• /
• 2014

Modern graphic processors, multimedia processors and audio processors mostly use floating-point number. Meanwhile, high-level language such as C and Java uses both single-precision and double precision floating-point number. In this paper, an algorithm which computes the reciprocal of double precision floating-point number using a 32 bit multiplier is proposed. It divides the mantissa of double precision floating-point number to upper part and lower part, and calculates the reciprocal of the upper part with Goldschmidt's algorithm, and computes the reciprocal of double precision floating-point number with calculated upper part reciprocal as the initial value is proposed. Since the number of multiplications performed by the proposed algorithm is dependent on the mantissa of floating-point number, the average number of multiplications per an operation is derived from some reciprocal tables with varying sizes.

• Journal of Intelligence and Information Systems
• /
• v.6 no.2
• /
• pp.99-110
• /
• 2000

오늘날의 기업은 상품을 판매하는 것 뿐만 아니라 기업의 신용과 이미지를 위해 그 상품에 대한 사후처리(After Service) 업무에 많은 투자를 하고 있다. 이러한 양질의 사후서비스를 고객에게 공급하기 위해서는 많은 인력을 합리적으로 관리해야 하며 요청되는 고장수리 서비스 업무의 신속한 해결을 위해 업무를 인력에게 합리적으로 배정을 해야 한다. 그러므로, 회사의 비용을 최소화하면서 정해진 시간에 요청된 작업을 처리하기 위해서는 인력들에게 작업을 배정하고 스케줄링하는 문제가 발생된다. 본 논문에서는 이러한 문제를 해결하기 위해서 화학계기의 A/S작업을 인력에게 합리적으로 배정 하는 스케줄링 시스템에 관한 연구이다. 먼저 스케줄링 모델을 HP사의 화학분석 및 시스템을 판매, 유지보수 해주는 Y사의 작업 스케줄을 분석하여 필요한 도메인과 고객서비스전략과 인력관리전략에서 제약조건을 추출하였고 여기에 스케줄링 문제를 해결하기 위한 방법으로 제약만족문제(CSP) 해결기법인 도메인 여과기법을 적용하였다. 도메인 여과기법은 제약조건에 의해 변수가 갖는 도메인의 불필요한 부분을 여과하는 것으로 제약조건과 관련되어 있는 변수의 도매인 크기가 축소되는 것이다. 또한, 스케줄링을 하는데에 있어서 비용적인 측면에서의 스케줄링방법과 고객만족도에서의 스케줄링 방법을 비교하여 가장 이상적인 해를 찾는데 트래이드오프(Trade-off)를 이용하여 최적의 해를 구했으며 실험을 통해 인력에게 더욱 효율적으로 작업들을 배정 할 수 있었고 또한, 정해진 시간에 많은 작업을 처리 할 수 있었으며 작업을 처리하는데 있어 소요되는 비용을 감소하는 결과를 얻을 수 있었다.