• 한국시뮬레이션학회논문지
• /
• 제11권3호
• /
• pp.23-34
• /
• 2002

Dynamic storage allocation (DSA) is a field fairly well studied for a long time as a basic problem of system software area. Due to memory fragmentation problem of DSA and its unpredictable worst case execution time, real-time system designers have believed that DSA may not be promising for real-time application service. Recently, the need for an efficient DSA algorithm is widely discussed and the algorithm is considered to be very important in the real-time system. This paper proposes an efficient DSA algorithm called QSB (quick semi-buddy) which is designed to be suitable for real-time environment. QSB scheme effectively maintains free lists based on quick-fit approach to quickly accommodate small and frequent memory requests, and the other free lists devised with adaptation upon a typical binary buddy mechanism for bigger requests in harmony for the .improved performance. Comprehensive simulation results show that the proposed scheme outperforms QHF which is known to be effective in terms of memory fragmentation up to about 16%. Furthermore, the memory allocation failure ratio is significantly decreased and the worst case execution time is predictable.

• Restorative Dentistry and Endodontics
• /
• 제38권2호
• /
• pp.59-64
• /
• 2013

Apical surgery cuts off the apical root and the crown-to-root ratio becomes unfavorable. Crown-to-root ratio has been applied to periodontally compromised teeth. Apical root resection is a different matter from periodontal bone loss. The purpose of this paper is to review the validity of crown-to-root ratio in the apically resected teeth. Most roots have conical shape and the root surface area of coronal part is wider than apical part of the same length. Therefore loss of alveolar bone support from apical resection is much less than its linear length.The maximum stress from mastication concentrates on the cervical area and the minimum stress was found on the apical 1/3 area. Therefore apical root resection is not so harmful as periodontal bone loss. Osteotomy for apical resection reduces longitudinal width of the buccal bone and increases the risk of endo-perio communication which leads to failure. Endodontic microsurgery is able to realize 0 degree or shallow bevel and precise length of root resection, and minimize the longitudinal width of osteotomy. The crown-to-root ratio is not valid in evaluating the prosthodontic prognosis of the apically resected teeth. Accurate execution of endodontic microsurgery to preserve the buccal bone is essential to avoid endo-perio communication.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권11호
• /
• pp.658-672
• /
• 2004

멀티미디어 응용 프로그램은 방대한 양의 데이타를 실시간으로 고속 처리해야 한다. 적재/저장과 같은 메모리 참조 명령어는 프로세서의 고속 수행을 방해하는 주요인이다. 메모리 참조 속도를 향상시키기 위하여, 다음에 참조될 것으로 예상되는 데이타를 미리 캐시로 인출함으로써, 캐시 미스율과 전체 수행시간을 감소시키는 캐시 선인출 방법이 활용되고 있다. 본 연구에서는 기존의 참조예측표(RPT: Reference Prediction Table)를 사용하는 방법을 개선한 데이타 캐시 선인출 방법을 제시한다. 동일한 명령어가 참조하는 데이타의 주소간격을 계산할 때 캐시의 라인크기 단위의 주소간격을 사용하고, 규칙적인 주소간격에 불규칙한 간격이 하나 포함하더라도 선인출 효과를 유지할 수 있도록 선인출 알고리즘을 개선하였다. 일반적으로 많이 사용되는 멀티미디어 프로그램에 대하여 실험한 결과, 기존의 RPT 방식에 비하여 버스 사용량은 약 0.03% 증가한 반면에 캐시 미스율은 평균적으로 29% 정도 향상되었다.

• 한국IT서비스학회지
• /
• 제17권4호
• /
• pp.101-117
• /
• 2018

Companies are responding appropriately to the rapidly changing business environment and striving to lead those changes. As part of that, we are meeting our strategic goals through IT projects, which increase the number of simultaneous projects and the importance of project portfolio management for successful project execution. It also strives for efficient deployment of human resources that have the greatest impact on project portfolio management. In the early stages of project portfolio management, it is very important to establish a reasonable manpower plan and allocate performance personnel. This problem is a problem that can not be solved by linear programming because it is calculated through the standard deviation of the input ratio of professional manpower considering the uniformity of load allocated to the input development manpower and the importance of each project. In this study, genetic algorithm, one of the heuristic methods, was applied to solve this problem. As the objective function, we used the proper input ratio of projects, the input rate of specialist manpower for important projects, and the equal load of workload by manpower. Constraints were not able to input duplicate manpower, Was used as a condition. We also developed a program for efficient application of genetic algorithms and confirmed the execution results. In addition, the parameters of the genetic algorithm were variously changed and repeated test results were selected through the independent sample t test to select optimal parameters, and the improvement effect of about 31.2% was confirmed.

• 한국정보통신학회논문지
• /
• 제25권1호
• /
• pp.20-26
• /
• 2021

오늘날의 시스템들은 더 빠른 실행 속도와 더 적은 전력 소모를 위해 하드웨어와 소프트웨어 요소를 함께 포함하고 있다. 기존 하드웨어 및 소프트웨어 공동 설계에서 소프트웨어와 하드웨어의 비율은 설계자의 경험적 지식에 의해 나뉘었다. 설계자들은 반복적으로 가속기와 응용 프로그램을 재구성하고 시뮬레이션하며 최적의 결과를 찾는다. 설계를 변경하며 반복적으로 시뮬레이션하는 것은 시간이 많이 소모되는 일이다. 본 논문에서는 에너지 효율적인 FPGA 가속기 설계를 위한 하드웨어 및 소프트웨어 공동 설계 플랫폼을 제안한다. 제안하는 플랫폼은 가속기를 구성하는 주요 성분을 변수화해 응용 프로그램 코드와 하드웨어 코드를 자동으로 생성하여 설계자가 적절한 하드웨어 비율을 쉽게 찾을 수 있도록 한다. 공동 설계 플랫폼은 Xilinx Alveo U200 FPGA가 탑재된 서버에서 Vitis 플랫폼을 기반으로 동작한다. 공동 설계 플랫폼을 통해 1000개의 행을 가지는 두 행렬의 곱셈 연산 가속기를 최적화한 결과 응용프로그램보다 실행 시간이 90.7%, 전력 소모가 56.3% 감소하였다.

• 한국콘크리트학회:학술대회논문집
• /
• 한국콘크리트학회 2001년도 봄 학술발표회 논문집
• /
• pp.839-844
• /
• 2001

The length-depth ratio of the preflex and PSC girder is very important variable. But PSC girder is very difficult to reduce the depth. If the bridge that girder depth is most important variable, then generally the great part of engineers are use the preflex girder that more expensive method then PSC girder. This paper introduce the design example that replace the preflex girder with the IPC girder The bridge span is 44m, and depth is 1.15m. The depth is restrained in 1.15m by several conditions. And it is compare preflex with IPC girder in semi condition. These two girders are very different in economy and execution. So, this paper present more economic and easy construction method.

• 대한안전경영과학회지
• /
• 제19권3호
• /
• pp.49-58
• /
• 2017

This paper suggests a specific model that could efficiently improve the interaction and the interface between MES(Manufacturing Execution System) server and POP(Point of Production) terminal through electronic document server and electronic pen, bluetooth receiver and form paper in disassembly and process inspection works. The proposed model shows that the new method by electronic document automation system can more efficiently perform to reduce processing time for maintenance work, compared with the current approach by handwritten processing system. It is noted in case of the method by electronic document automation system that the effects of proposed model are as follows; (a) While the processing time per equipment for maintenance by the current method was 300 minutes, the processing time by the new method was 50 minutes. (b) While the processing error ratio by the current method was 20%, the error ratio by the new method was 1%.

• 한국정보통신학회논문지
• /
• 제21권2호
• /
• pp.468-474
• /
• 2017

무기체계 평가를 위한 시험업무는 무기체계 획득 또는 개발 전 수명주기 동안 수행되는 프로세스 중 가장 중요한 프로세스 중 하나이다. 무기체계 개발완료 전, 무기체계에 대한 적절한 평가시험을 수행할 경우, 무기체계 개발과정 중 발생할 수 있는 결함을 조기에 발견함으로써, 개발위험과 소요비용을 크게 감소시킬 수 있다. 본 연구에서는 연초 계획된 무기체계 평가시험 물량을 연말까지 달성할 확률이 얼마나 되는지 파악하기 위한 방법으로 몬테카를로 시뮬레이션 기반의 확률적 예측 기법을 제안하였다. 또한 연말 달성 확률 예측 결과를 바탕으로 시험일정 수립 담당자가 월간 시험 수행건수를 조정하기 위한 의사결정에 도움을 줄 수 있는 정량적 관리방안을 제시하였다. 상기와 같이 제안된 예측 및 관리 기법은 국방과학연구소 제 8기술연구본부의 실제 시험계획 및 실적 데이터에 적용하였으며, 그 적용 결과를 고찰하였다.

• 한국멀티미디어학회논문지
• /
• 제12권6호
• /
• pp.815-823
• /
• 2009

Most of existing watermarking schemes insert and extract a watermark, focusing on the visual conservation of an original image. However, existing watermarking schemes could be difficult for a watermark detection in case of various distortion caused by display-capture devices. Therefore, we propose a new display-capture based mobile watermarking scheme. The proposed watermarking scheme is a new concept for embedding a watermark, which uses the generated image instead of a given original image. For effective watermark decoding, we also present a method for detecting the background image whose error bit can not be corrected because of various heavy distortion and for avoiding it from the decoding process. For this scheme, we adopt distortion coefficients of camera calibration when we separate a background image from a captured image. For finding available correction bits of ECC through the decoding process, we capture 30,000 images and then calculate the separation ratio of a background image and the average error bits per an image. As experimental result, the separation ratio of a background image is about 96.5% in 30,000 captured image. And the false alarm ratio shows about $5.18{\times}10^{-4}$ in the separated background image. And also we can confirm the availability of real-time processing because the mean execution time is about 82ms per an image for capturing and decoding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권11호
• /
• pp.3603-3618
• /
• 2022

The offloading method is important when there are multiple mobile nodes and multiple edge servers. In the environment, those mobile nodes connect with edge servers with different bandwidths, thus taking different time and energy for offloading tasks. Considering the system load of edge servers and the attributes (the number of instructions, the size of files, deadlines, and so on) of tasks, the energy-aware offloading problem becomes difficult under our mobile edge environment (MCE). Most of the past work mainly offloads tasks by judging where the job consumes less energy. But sometimes, one task needs more energy because the preferred edge servers have been overloaded. Those methods always do not pay attention to the influence of the scheduling on the future tasks. In this paper, first, we try to execute the job locally when the job costs a lower energy consumption executed on the MD. We suppose that every task is submitted to the mobile server which has the highest bandwidth efficiency. Bandwidth efficiency is defined by the sending ratio, the receiving ratio, and their related power consumption. We sort the task in the descending order of the ratio between the energy consumption executed on the mobile server node and on the MD. Then, we give a "suffrage" definition for the energy consumption executed on different mobile servers for offloading tasks. The task selects the mobile server with the largest suffrage. Simulations show that our method reduces the execution time and the related energy consumption, while keeping a lower value in the number of uncompleted tasks.