• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1507-1514
• /
• 2016

Full-image guided filter reflects all pixels of image in filtering by using weight propagation and two-pass model, whereas the existing guide filter is processed based on the kernel window. Therefore the computational complexity can be improved while maintaining characteristics of guide filter, such as edge-preserving, smoothing, and so on. In this paper, we propose an efficient VLSI architecture for the full-image guided filter by analyzing the data dependency, the data frequency and the PSNR analysis of the image in order to achieve enough speed for various applications such as stereo vision, real-time systems, etc. In addition, the proposed efficient scheduling enables the realtime process by minimizing the idle period in weight computation. The proposed VLSI architecture shows 214MHz of maximum operating frequency (image size: 384*288, 965 fps) and 76K of gates (internal memory excluded).

• Journal of the Korea Institute of Building Construction
• /
• v.11 no.1
• /
• pp.1-8
• /
• 2011

Linear scheduling method limits to present works of work breakdown structure as a form of lines and was often developed manually. In other words, linear schedule could not utilize activity, work breakdown structure, and etc. information of network schedule such as CPM(Critical Path Method) and has been used only for reporting or confirming construction master plan. Therefore, it is necessary to develop system which can automatically generating the linear schedule based on the network schedule having many accumulated and useful construction schedule information. Thus, this research has an effort to establish data process model, data flow diagram, and data model in order to make linear schedule. In addition, this research addresses the system solution structure, user interface class diagram and logic diagram, and data type schema. The results of this paper can be used as a preliminary research for developing linear schedule generating system prototype by utilizing the network schedule information.

• Korean Journal of Construction Engineering and Management
• /
• v.8 no.1 s.35
• /
• pp.78-86
• /
• 2007

Top priority to manage construction projects is given to the planning and scheduling in order to keep the project duration, which is one of the most important factors in construction management. However, recently most of public construction projects especially for civil projects are delays and preventive research, many efforts were made concerning construction delays and preventive management methods. But analysis of delay causation, which is a main key to solve the problems is not done, yet. Therefore, in this research causation delays are analyzed by characteristics of construction projects, which are type of projects, type of contracts, project participants, and general condition. As a result of the analysis, delay causation are proved to be different by characteristics of the projects. The research results will be used for prevention of time extension and dispute resolution.

• Information Systems Review
• /
• v.7 no.2
• /
• pp.195-211
• /
• 2005

The purpose of this case study is to suggest the indicators of an informatization maturity level and critical success factors in small and medium automotive parts manufacturers. To achieve this goal, literature reviews and case studies on 7 automotive parts manufacturers that confirmed to implement information systems successfully, were conducted. Based on literature review, the six functional processes including development, production scheduling, purchase, production, order, and support process, were defined. Each process has 5 levels from 1(low level) to 5(high level) depending on the degree of informatization maturity. In addition, critical success factors were discovered with interviews of CEO or CIO. The results of this study can be applied to any companies which are implementing or intended to the information systems near future.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.531-534
• /
• 2002

Complexity in construction projects has increased over the years, which has led to an increase in the number of organizations involved in those projects. In today's environment, these organizations operate in different parts of the world requiring their personnel to be geographically distributed. So, these organizations construct and utilize the information systems. However, looking into this systems' content, those use two-dimensional planes such as pictures and drawings to check the scheduling etc., which cause the defect of communication and problems such as change order. Accordingly, this study introduces the Web 3Ds and 3D Libraries, intends to present the effect on modeling of three-dimensional work structure using Web 3D in cyberspace.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1366-1372
• /
• 2006

After the import liberalization of agricultural products, The Imported agricultural products rapidly increased market share of domestic agricultural products. But Imported agricultural products include various agricultural chemicals and food additives. In order to improve competitiveness in domestic markets of farmhouses and to secure food safety, the farmers needs to introduce Systematic support and various system. In this paper, established system that use Monitoring technology, to inform production information and management information about agricultural products to consumer by real time. Therefore unused analog camera such as CCTV(Closed-Circuit Television) for real time Monitoring. This system Used web camera that offer picture quality that is good than CCTV at place that consists network without distinction in the place. An advantage of real time Monitoring system designed multi-vision interface showing multi images on single screen and, for the purpose of the improvement in efficiency, the functions of saving images and of scheduling the time to save the images.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.729-736
• /
• 2003

With the rapid growth of the Internet, popular Web sites are visited so frequently that these cannot be constructed with a single server or mirror site of high performance. The rapid increase of Internet uses and uses raised the problems of overweighted transmission traffic and difficult load balancing. To solve these, various schemes of server clustering have been surveyed. Especially, in order to fully utilize the performance of computer systems in a cluster, a good scheduling method that distributes user requests evenly to servers in required. In this paper, we propose a new method for reducing the service latency. In our method, each Web server in the cluster has different content. This helps to reduce the complexity of load balancing algorithm and the service latency The Web server that received a request from the load balancer responds to the client directly without passing through the load balancer. Simulation studies show that our method performs better than other traditional methods. In terms of response time, our method shows shorter latency than RR (Round Robin) and LC (Least Connection) by about 16%, 14% respectively.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.170-186
• /
• 2004

Recently, for real-time applications such as multimedia and signal processing, it becomes increasingly important to provide a probabilistic guarantee that each task in the application meets its deadline with a given probability. To provide the probabilistic guarantee, an analysis method is needed that can accurately predict the deadline miss probability for each task in a given system. This paper proposes a stochastic analysis method for real-time systems that use priority-driven scheduling, such as Rate Monotonic and Earliest Deadline First, in order to accurately compute the deadline miss probability of each task in the system. The proposed method accurately computes the response time distributions for tasks with arbitrary execution time distributions, and thus makes it possible to determine the deadline miss probability of individual tasks. In the paper. through experiments, we show that the proposed method is highly accurate and outperforms exisiting methods proposed in the literature.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.6
• /
• pp.318-330
• /
• 2002

This paper discusses the design and implementation of a video server which uses tertiary device, such as magneto-optical jukebox or tape library, as a source of media archiving. In order to handle the tertiary device in the framework of disk-based stream service model, a sophisticated streaming model is required for server and it should consider the device-specific performance characteristics of tertiary storage. We have carefully designed the streaming mechanism for server whose key functionalities include stream scheduling, disk caching and admission control. The proposed system has been implemented on Windows 2000 platform which is equipped with a magneto-optical jukebox. The design principles of the server are validated with the experiments and the performance characteristics is analyzed.

• The Journal of the Korea Contents Association
• /
• v.16 no.2
• /
• pp.163-173
• /
• 2016

Recently, massive amounts of stream data have been studied for distributed processing. In this paper, we propose an incremental stream data processing method based on in-memory in big data environments. The proposed method stores input data in a temporary queue and compare them with data in a master node. If the data is in the master node, the proposed method reuses the previous processing results located in the node chosen by the master node. If there are no previous results of data in the node, the proposed method processes the data and stores the result in a separate node. We also propose a job scheduling technique considering the load and performance of a node. In order to show the superiority of the proposed method, we compare it with the existing method in terms of query processing time. Our experimental results show that our method outperforms the existing method in terms of query processing time.