• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.1
• /
• pp.15-25
• /
• 2014

Bus signal priority is a name for various techniques to speed up bus public transport services at intersections with traffic signals. In this study propose methodology to optimize signal times for Early green, Green extension out of the active bus signal priority using deterministic delay model in isolated intersection on median bus lane. Fluctuation is found in the vehicle delay and person delay in the event that using this methodology redistributed to green time and checking slack green time is correct value by sensitivity analysis. As a result of the study, car delay is increased a little and person delay is decreased. As a result of slack green time sensitivity, delay is not much in it if variation of slack green time under 30%. But this methodology effectiveness is under claimed capacity if variation of slack green time over 30%.

• Korean Journal of Construction Engineering and Management
• /
• v.18 no.2
• /
• pp.108-116
• /
• 2017

It is expected that the maintenance cost of domestic bridges will increase considerably due to the increase of bridge service time. In response to this situation, the government and relevant ministries are focusing on developing ways to efficiently allocate limited budgets and to rationally select maintenance bridge. In this study, to develop a risk - based bridge maintenance priority decision model, 14 common risk factors causing damage to bridges were extracted and AHP analysis was performed to select 5 important factors. Based on the existing literature review and expert consultation, we derive the evaluation criteria and the impact weights of the selected factors, and based on this, I presented risk based bridge maintenance priority model. Using this model in combination with existing maintenance priority methods will lead to more reasonable bridge maintenance priorities.

• Journal of Korea Multimedia Society
• /
• v.16 no.4
• /
• pp.493-501
• /
• 2013

A key challenge in massively multiplayer on-line game(MMOG) systems is providing real-time response latencies to the large number of concurrent game players. MMOG systems are a kind of soft real-time systems because requests from many players should be responded within specified time constraints. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to tasks with different priorities on CPU processing. In order to meet their timing constraints, we propose priority scheduling methods that attempt to allocate preferentially more CPU bandwidth to serve an task with the higher priority level in the presence of transient overloading. The proposed scheduling methods are capable of enhancing real-time performance of MMOG system by maximizing the number of tasks with higher priority completed successfully within their deadlines while minimizing total average latency of tasks finished after given deadlines. The performance of these scheduling methods is evaluated through extensive simulation experiments.

• Safety and Health at Work
• /
• v.9 no.2
• /
• pp.133-139
• /
• 2018

Background: Selecting priority occupational carcinogens is important for cancer prevention efforts; however, standardized selection methods are not available. The objective of this paper was to describe the methods used by CAREX Canada in 2015 to establish priorities for preventing occupational cancer, with a focus on exposure estimation and descriptive profiles. Methods: Four criteria were used in an expert assessment process to guide carcinogen prioritization: (1) the likelihood of presence and/or use in Canadian workplaces; (2) toxicity of the substance (strength of evidence for carcinogenicity and other health effects); (3) feasibility of producing a carcinogen profile and/or an occupational estimate; and (4) special interest from the public/scientific community. Carcinogens were ranked as high, medium or low priority based on specific conditions regarding these criteria, and stakeholder input was incorporated. Priorities were set separately for the creation of new carcinogen profiles and for new occupational exposure estimates. Results: Overall, 246 agents were reviewed for inclusion in the occupational priorities list. For carcinogen profile generation, 103 were prioritized (11 high, 33 medium, and 59 low priority), and 36 carcinogens were deemed priorities for occupational exposure estimation (13 high, 17 medium, and 6 low priority). Conclusion: Prioritizing and ranking occupational carcinogens is required for a variety of purposes, including research, resource allocation at different jurisdictional levels, calculations of occupational cancer burden, and planning of CAREX-type projects in different countries. This paper outlines how this process was achieved in Canada; this may provide a model for other countries and jurisdictions as a part of occupational cancer prevention efforts.

• Journal of Soil and Groundwater Environment
• /
• v.18 no.5
• /
• pp.26-38
• /
• 2013

In this study, priority for groundwater contamination management was assessed based on regional vulnerability in Goyang-si area, Gyonggi-do, Korea using analytic hierarchy process (AHP) and geographic information system (GIS). We proposed a concept for regional vulnerability to groundwater contamination with using socio-environmental vulnerability factors, which can be classified into three properties including regional hydrogeological property, contamination property, and groundwater use property. This concept is applied to Goyang-si area. For AHP analysis, an expertise-targeted survey was conducted. Based on the survey, a total of 10 factors (criteria) and corresponding weights for regional vulnerability assessment were determined. The result shows that regional contamination property is the most weighted factor among the three property groups (hydrogeological property: contamination property: groundwater use property = 0.3: 0.4: 0.3). Then, database layers for those factors were constructed, and regional vulnerability to groundwater contamination was assessed by weighted superposition using GIS. Results show that estimated regional vulnerability score is ranged from 22.7 to 94.5. Central and western areas of Goyang-si which have groundwater tables at shallow depths and are mainly occupied by industrial and residential areas are estimated to be relatively highly vulnerable to groundwater contamination. Based on assessed regional vulnerability, we classified areas into 4 categories. Category 1 areas, which are ranked at the top 25% of vulnerability score, take about 2.8% area in Goyang-si and give a high priority for groundwater contamination management. The results can provide useful information when the groundwater management authority decide which areas should be inspected with a high priority for efficient contamination management.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.287-289
• /
• 1998

실시간 스케줄러는 대역폭, 필요 버퍼량 등과 같은 네트워크 자원을 효율적으로 이용하면서 한정된 통신지연(bounded delay)을 제공해야 한다. 최근 이러한 제한 조건을 만족시키기 위해서 많은 스케줄링 방법론이 제시되었다. 그중EDF 스케줄링 방법론이 최적의 성능을 갖는 것으로 알려져있다. 그러나 EDF스케줄링 방법론은 "sort"나 "search"와 같은 연산작업을 수행함으로서, 과다한 오버헤드를 발생시킨다. Rotating Priority Queues(RPQ) 스케줄러는 EDF 연산 작업 없이 EDF스케줄러에 근접한 성능을 갖는 스케줄러이다. 그러나 RPQ스케줄러는 과다한 버퍼량을 필요로 한다. 본 논문에서는 이러한 문제저？ㄹ 해결하기위해서 Multiple Rotating Priority Queues(MRPQ)스케줄러를 제시한다. MRPQ스케줄러는"blick queue"라는 새로운 개념을 이용하여 회전 우선 순위 queue를 다중 계츨으로 구성한다. 이렇게 구성된 MRPQ 스케줄러는 RPQ스케줄러에서 필요한 버퍼량의 반정도의 버퍼량만을 사용하여 RPQ스케줄러와 동일한 동작을 수행한다. 또한 MRPQ스케줄러는 RPQ스케줄러와 동일한 최대 지연시간을 제공한다.러는 RPQ스케줄러와 동일한 최대 지연시간을 제공한다.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.196-204
• /
• 1996

This paper presents a new scheduling algorithm, which is the most improtant subtask in the high level synthesis. The proposed algorithm performs scheduling in consideration of resource sharing concept based on characteristics of conditionsla bransches in the intermediate data structure. CDFG (control data flow graph) generated by a VHDL analyzer. This algorithm constructs a conditon graph based on time frame of each operation using both the ASAP and the ALAP scheduling algorithm. The conditon priority is obtained from the condition graph constructed from each conditional brance. The determined condition priority implies the sequential order of transforming the CDFG with conditonal branches into the CDFG without conditional branches. To minimize resource cost, the CDFG with conditional branches are transformed into the CDFG without conditonal brancehs according to the condition priority. Considering the data dependency, the hardware constraints, and the data execution time constraints, each operation in the transformed CDFG is assigned ot control steps. Such assigning of unscheduled operations into contorl steps implies the performance of the scheduling in the consecutive movement of operations. The effectiveness of this algorithm is hsown by the experiment for the benchmark circuits.

• Journal of the military operations research society of Korea
• /
• v.17 no.2
• /
• pp.113-122
• /
• 1991

This paper presents the Allocation Priority Scheme (APS) for multiprocessor system. The objective of APS is to reduce the time-complexity on a Physical Mapping Scheme(PMS). The PMS is to allocate the nodes of the Data Dependency Graph (DDG) to the multprocessors efficiently and effectively. The APS provides the priority to each node (vertex) in the DDG. In other words, the goal of the APS is to find a request resource mapping such that the total cost (time-complexity) is minimized. The special case in which all requests have equal priorities and all resoruces have equal precedences, and the comparisons between our APS and other schems are discussed in the paper. The APS provides the heuristic rules which are based on maximum height (MH), number of children nodes ($N_c$), number of father nodes ($N_f$), and computation time ($T_c$). The estimation moth of the computaion time is in the paper.

• Journal of the Korean housing association
• /
• v.14 no.4
• /
• pp.121-130
• /
• 2003

This study is to evaluate T-apartment housing located in Inchon by the occupants. The purpose of the study is extracting the design guideline to improve the physical environment in apartment housing from understanding and analyzing the residents'satisfaction and their needs. In this study, the strategy for environmental improvements is suggested to raise the occupants'overall satisfaction from finding the improvement priority. The results of this study are as follows: - The satisfaction level of the occupants is above the moderate level (3.31/3.00). - The construction quality is the 1 st factor in the improvement priority. - The characteristics of the occupants in this survey are that they are conservative in their present physical environment, but that they also need new trends in the unit plan.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.2
• /
• pp.101-111
• /
• 2009

This paper considers two-sided assembly line balancing with preemptive multiple goals. In the problem, three goals are taken into account in the following priority order : minimizing the number of mated-stations, achieving the goal level of workload smoothness, and maximizing the work relatedness. An evolutionary algorithm is used to solve the multiple goal problems. A new structure is presented in the algorithm, which is helpful to searching the solution satisfying the goals in the order of the priority. The proper evolutionary components such as encoding and decoding method, evaluation scheme, and genetic operators, which are specific to the problem being solved, are designed in order to improve the algorithm's performance. The computational results show that the proposed algorithm is premising in the solution quality.