• Korean Journal of Construction Engineering and Management
• /
• v.12 no.6
• /
• pp.42-53
• /
• 2011

This study is to present a method of compiling consistently accurate construction cost estimates in minimum of time. There are two kind of applications for estimating system based on quantity-per-unit and the daily work-crew. The former system is still applied 45% as a estimating method to construction job site by the second half of 2010. However, it is necessary for quantity-per-unit to complement the defect of standard integrating specification and improve the integrating method to the various construction conditions. The later system is intended to represent a standard or basic core which can be adopted in many type of construction estimating used across the wide variety of construction in advanced countries. In this study daily work-crew based on productivity is applied to the representative B.O.Q Item in road project. These results are compared to productivity of Japan and U.S.A estimated under the similar circumstances.

• The Journal of Bigdata
• /
• v.7 no.1
• /
• pp.1-14
• /
• 2022

The proof-of-work consensus algorithm used by most blockchains is causing a massive waste of computing resources in the form of mining. A useful proof-of-work consensus algorithm has been studied to reduce the waste of computing resources in proof-of-work, but there are still resource waste and mining centralization problems when creating blocks. In this paper, the problem of resource waste in block generation was solved by replacing the relatively inefficient computation process for block generation with distributed artificial intelligence model learning. In addition, by providing fair rewards to nodes participating in the learning process, nodes with weak computing power were motivated to participate, and performance similar to the existing centralized AI learning method was maintained. To show the validity of the proposed methodology, we implemented a blockchain network capable of distributed AI learning and experimented with reward distribution through resource verification, and compared the results of the existing centralized learning method and the blockchain distributed AI learning method. In addition, as a future study, the thesis was concluded by suggesting problems and development directions that may occur when expanding the blockchain main network and artificial intelligence model.

• KIISE Transactions on Computing Practices
• /
• v.23 no.9
• /
• pp.572-577
• /
• 2017

Virtualization allows multiple virtual machines to share the resources of a physical machine in order to utilize idle resources. The purpose of virtualization is the efficient allocation of resources among virtual machines. However, the efficient allocation of resources is difficult because the workload characteristics of each virtual machine cannot be understood in the current virtualization environment. This causes performance interference among virtual machines, which leads to performance degradation of the virtual machine. Previous works have been carried out to develop a method of solving such performance interference. This paper introduces a representative method, a CPU scheduling method that guarantees I/O performance by using feedback control to solve performance interference. In addition, we compare and analyze a model-based feedback control method and a dynamic feedback control method.

• Journal of KIISE:Information Networking
• /
• v.37 no.4
• /
• pp.255-262
• /
• 2010

Recently, automated signature generation systems(ASGSs) have been developed in order to cope with zero-day attacks with malicious codes exploiting vulnerabilities which are not yet publically noticed. To enhance the usefulness of the signatures generated by (ASGSs) it is essential to identify signatures only with the high accuracy of intrusion detection among a number of generated signatures and to provide them to target security systems in a timely manner. This automated signature exchange, distribution, and update operations have to be performed in a secure and universal manner beyond the border of network administrations, and also should be able to eliminate the noise in a signature set which causes performance degradation of the security systems. In this paper, we present a system architecture to support the identification of high quality signatures and to share them among security systems through a scheme which can evaluate the detection accuracy of individual signatures, and also propose a set of algorithms dealing with exchanging, distributing and updating signatures. Though the experiment on a test-bed, we have confirmed that the high quality signatures are automatically saved at the level that the noise rate of a signature set is reduced. The system architecture and the algorithm proposed in the paper can be adopted to a automated signature sharing framework.

• The Journal of the Korea Contents Association
• /
• v.10 no.10
• /
• pp.78-85
• /
• 2010

Map/Reduce is the programing model which can implement the Cloud Computing recently has been noticed. The model operates an application program processing amount of data using a lot of computers. It is important to plan the mechanism of separating the data in proper size and distributing that to a cluster consisted of computing node in efficient for using the computing nodes very well. Besides that, planning a process of Map phases and Reduce phases also influences the performance of Map/Reduce. This paper suggests the effectively distributing scheme that separates a huge data and operates Map task in the considering the performance of computing node and network status. And we make the Reduce task can be processed quickly through the tuning the mechanism of Map and Reduce task operation. Using the two Map/Reduce sample application, we experimented the suggestion and we evaluate suggestion considered it in how impact the Map/Reduce performance.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.809-814
• /
• 2003

The multicast transmitting the real-time data to groups may easily have many attacks from abnormal attacks because it has many links as compared to the unicast. The existing group key management architectures for preventing these problems are designed for protocols suitable for a large scale. Thus these architectures applied to a small scale routing protocols may have many overheads with key distribution and a constant core tree. Therefore this paper proposes a groups key management protocol for a secure multicast in PIM-SM multicast group communication. The proposed method divide multicast groups with RO(Rendezvous-Point), and subgroup key managers are established in each RP and can be transmitted groups keys between senders and receivers, so the security cannel is set up for secure data transfer, And this does not have needs of the data translation for group keys and the new key distribution for path change. As a result of this, the data transmission time can be reduced.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.29-38
• /
• 2009

In the computing environment with heterogeneous resources, a job scheduling model is necessary for effective resource utilization and high-speed data processing. And, the job scheduling model has to cope with a dynamic change in the condition of resources. There have been lots of researches on resource estimation methods and heuristic algorithms about how to distribute and allocate jobs to heterogeneous resources. But, existing researches have a weakness for system compatibility and scalability because they do not support the standard language. Also, they are impossible to process jobs effectively and deal with a variety of computing situations in which the condition of resources is dynamically changed in real-time. In order to solve the problems of existing researches, this paper proposes a semantic computing-based dynamic job scheduling model that defines various knowledge-based rules for job scheduling methods adaptable to changes in resource condition and allocate a job to the best suited resource through inference. This paper also constructs a resource ontology to manage information about heterogeneous resources without difficulty as using the OWL, the standard ontology language established by W3C. Experimental results shows that the proposed scheduling model outperforms existing scheduling models, in terms of throughput, job loss, and turn around time.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1223-1226
• /
• 2006

P2P(Peer to Peer) 기술은 1990년대 후반기부터 산업계 및 학계에 주목을 받고 있는 기술 분야중의 하나로 이 기술의 장점은 인터넷 환경에 산재하여 있는 컴퓨팅 파워, 공간, 네트워크 대역을 인터넷 기반으로 효과적으로 활용하여 협력작업을 가능하게 한다는데 있다. 최근에는 모바일 환경 응용을 위한 P2P 디바이스 탐색 분야에 관심사가 증대되고 있으며, P2P 시스템은 중앙통제 장치가 결여 되어 있기 때문에 중앙통제 장치 개입을 최소로 하면서 P2P를 운영하기 위한 효율적인 기법 및 체계가 요구되고 있다. 본 논문에서는 기존의 접근방법을 검토하여 FFNN(feed forward neural network)을 이용한 디바이스 탐색 기법을 제시한다. 제시한 FFNN은 BP(back propagation) 알고리즘을 통해 훈련하고 디바이스를 탐색한다. 제시한 시스템의 성능을 보이기 위해 일정한 계산량을 가지는 작업을 에이전트를 활용, 탐색된 디바이스간에 분배하여 처리한다. 본 논문에서는 제한된 자원을 가지는 디바이스 간에 P2P를 사용하는 기법에 대해 제시하였다.

• ETRI Journal
• /
• v.5 no.3
• /
• pp.39-47
• /
• 1983

수작업에 의한 보전관리방식은 고장신고에 의하여 수행되는 사후 관리방식으로서 가입자 회선의 급속한 증가에 따라 필요한 보전 인력 확충이 어렵고 보전 작업량의 예측이 힘들어 정확한 보전계획 수립이 불가능하다. 또한 고도로 숙련된 운용요원을 요구하는 수동식 시험대는 교환기종마다 상이하여 획일적인 보전관리가 이루어지지 않는다. 이러한 문제점을 해결하기 위하여 가입자 시설 집중보전 시스템 (SLMOS)을 개발하였다. SLMOS구성은 일정 지역별로 지역보전 센터를설치, 여러 전화국을 수용하는 형태로서, 가입자 고장신고 접수 및 수리시험 요원을 집중시켜 인력절감을 꾀하며 각종 보전업무의 전산화로 가입자 서어비스의 질적 향상 및 능률적인 보전관리를 도모한다. 가입자 고장신고는 집중화된 접수요원이 담당하며 전화번호만 key-in시키면 고장원인 및 수리약속 시간이 CRT화면에 나타나므로 가입자에게 정화한 정보를 제공한다. 지역보전 센터의 프린터에는 접수요원이 받은 고장신고 내용 및 심야에 실시된 예방시험의 결과가 출력되므로 통제석에서 이를 분석, 해당 수리 시험석으로 분배한다. 모든 요원의 작업내용은 고장기연 data base에 저장되므로 지역보전 센터 의 관리자는 원하는 각종 통계, 분석 자료를 출력시킬 수가 있어 보전업무의 효율적 운영을 할 수 있게된다. SLMOS의 software개발에 UNIX 0S를 사용함으로써 machine independence와 시스템의 융통성 및 Portability를 추구하고있으며 신고접수, 수리에 mask기법및 한글사용으로 용이하게 시스템을 사용할 수 있도록 하였다. 자동 선로시험 장치에 $\mu$-processor를 내장시켜 예방시험 기능의 추가와 자동 고장판정으로 운용요원의 기량에 의존하는 방식의 탈피를 시도하였다. 본 연구개발은 81년에 착수하여 84년에 완료할 예정이며 82년말 중앙전화국 시험실에서 연구소 computer와 on-line 방식으로 시험 운용을실시하였다. 83연도에 시스템기능을 보완 및 추가 개발하고 84년도에 현장 및 실용화 시험을거쳐 한국전기통신공사에 공급할 계획이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.557-562
• /
• 2006

최근 기업환경에서는 분산되어 있는 정보를 통합하여 정보 공유의 필요성이 증가함에 따라 기존 레거시 시스템간의 협업을 하기 위한 상호 운용이 강조되고 있다. 독립적인 레거시 시스템의 상호 연결을 위해서는 플랫폼 이질성, 의미 이질성 등을 극복할 필요가 있다. 이러한 문제를 해결하기 위해 ISO/IEC 11179에서 진행하고 있는 XMDR을 이용하여 미들웨어를 설계하였다. 설계한 미들웨어를 레거시 시스템에 적용하여 데이터 공유 및 통합의 일관성을 유지할 수 있게 되었다. 하지만 설계된 미들웨어는 각 노드의 자원 상황과 작업 상황에 대한 조정기능이 없기 때문에 정보 활용의 효율성을 보장할 수 없다. 따라서 레거시 시스템을 관리하고 조정하는 방안이 필요하다. 본 논문에서는 정보를 요청하는 요청 에이전트와 정보를 제공하는 정보 에이전트간의 정확한 정보 교환을 할 수 있도록 조정하고, 각 레거시 시스템의 정보 모니터링과 작업 분배 및 로컬 노드의 자원 관리를 담당하는 협력 에이전트를 설계함으로써 통합된 정보를 효율적으로 활용할 수 있도록 한다.