• Korean Journal of Construction Engineering and Management
• /
• v.15 no.6
• /
• pp.63-70
• /
• 2014

Deconstruction of the building must be applied firstly in order to improve recycling and reuse of construction wastes. In this study have done a case study for deconstruction of an apartment. All construction waste(CW) which will be generated during deconstruction was examined in each part of the building. Because drawing did not exist in most of the old building, we drew up floor plans of buildings. After analyzing these drawings, estimated quantities of CW. It was measured working time of labor and equipments for deconstruction and general demolition on each building of the apartment. In addition, it was proposed in the volume and weight per unit after analyzing detailed measurement of CW which was generated in the process of deconstruction and traditional demolition. It suggested recovery rate at a site, volume and weight conversion factors, and waste basic unit per area that based on the results of comparative analysis on the amount of CW which is calculated from drawing and generated at a site. These factors will be used fundamental materials for estimating quantities and treatment cost of CW, and scheduling of works.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.56-63
• /
• 2012

The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. Mobile sink node distribute energy consumption therefore network life time was increased than fixed sink node. The energy efficient is important matter in wireless body area network because energy resource was limited on sensor node. In this paper we proposed cluster topology algorithm for efficient data transmission in wireless body area network based mobile sink. The proposed algorithm show good performance under the advantage of grid routing protocol and TDMA scheduling that minimized overlap area on cluster and reduced amount of data on cluster header in error prone wireless sensor network based on mobile sink.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.348-357
• /
• 2007

Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.86-94
• /
• 2012

In this paper we propose a hardware architecture of high-speed CGH (computer generated hologram) generation processor, which particularly reduces the number of memory access times to avoid the bottle-neck in the memory access operation. For this, we use three main schemes. The first is pixel-by-pixel calculation rather than light source-by-source calculation. The second is parallel calculation scheme extracted by modifying the previous recursive calculation scheme. The last one is a fully pipelined calculation scheme and exactly structured timing scheduling by adjusting the hardware. The proposed hardware is structured to calculate a row of a CGH in parallel and each hologram pixel in a row is calculated independently. It consists of input interface, initial parameter calculator, hologram pixel calculators, line buffer, and memory controller. The implemented hardware to calculate a row of a $1,920{\times}1,080$ CGH in parallel uses 168,960 LUTs, 153,944 registers, and 19,212 DSP blocks in an Altera FPGA environment. It can stably operate at 198MHz. Because of the three schemes, the time to access the external memory is reduced to about 1/20,000 of the previous ones at the same calculation speed.

• Journal of The Korean Association For Science Education
• /
• v.39 no.5
• /
• pp.669-679
• /
• 2019

In this study, we investigated how 'Scientific Inquiry Experiment,' a newly introduced subject under the 2015 revised curriculum, was implemented to identify the difficulties that science teachers face in the process of teaching the subject and to explore how to support them through online survey and interview methods. A questionnaire of the survey, which consisted of environmental factors of class, preparation and execution of class, teacher self-evaluation of class, and direction for the subject, was developed, and the online survey was requested with a response from one teacher per school from 1674 high schools nationwide. We analyzed the results from 814 teachers who answered all required questions, and we also conducted interviews and online advisory discussions to ensure the validity of our analysis. In the results of the study, teachers complained of lack of time for preparation and execution of the subject, and they demanded laboratory assistants and quality teaching materials. In addition, in order to achieve the goal of the subject, they agreed the necessity of using the 'block scheduling' though they also agreed the difficulties of its implementation. Meanwhile, the alteration of guidelines for evaluation, which was changed from 9-grade system to 3-grade system, was positively recognized by teachers. As a result of this change, the percentage of performance assessment increased in 2019 compared to 2018, but there were no significant changes in the number of 'hands-on activity.' Finally, we proposed ways to support 'scientific inquiry experiment'.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.231-242
• /
• 2007

The existing pattern mining methods[1,2,3,4,5,6,11,12,13] do not use location generalization method on the set of location history data of moving object, but even so they simply do extract only frequent patterns which have no spatio-temporal constraint in moving patterns on specific space. Therefore, it is difficult for those methods to apply to frequent pattern mining which has spatio-temporal constraint such as optimal moving or scheduling paths among the specific points. And also, those methods are required more large memory space due to using pattern tree on memory for reducing repeated scan database. Therefore, more effective pattern mining technique is required for solving these problems. In this paper, in order to develop more effective pattern mining technique, we propose new location generalization method that converts data of detailed level into meaningful spatial information for reducing the processing time for pattern mining of a massive history data set of moving object and space saving. The proposed method can lead the efficient spatial moving pattern mining of moving object using by creating moving sequences through generalizing the location attributes of moving object into 2D spatial area based on $R^*$-Tree and Area Grid Hash Table(AGHT) in preprocessing stage of pattern mining.

• Journal of Korea Water Resources Association
• /
• v.50 no.12
• /
• pp.803-813
• /
• 2017

Recently, various studies have been conducted to optimize the pump operation scheduling and/or the pump/tank size minimizing the system cost of water distribution network. Prior to that, it is important to understand the sensitivity of pump/tank size on the system cost and overall water quality. Here, we have performed the sensitivity analysis to investigate the effect of pump/tank size on the economic cost (construction and operation) and water quality (water age). The analysis was applied on a real, large-scale water transmission network currently operating in South Korea. The results revealed that the pump/tank size has a strong influence on system construction/operation costs. Especially, the tank size has a significant effect on the system-wide water quality. In the case of applied networks, the operating cost decreases as the capacity of the facility increases, but the design cost increases. Using a sensitivity analysis, a suitable range of pump/tank size could be suggested to minimize costs and stabilize the water quality at the same time prior to a system design.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4A
• /
• pp.336-344
• /
• 2005

Discrete Wavelet Transform(DWT) is the oncoming generation of compression technique that has been selected for MPEG4 and JEPG2000, because it has no blocking effects and efficiently determines frequency property of temporary time. In this paper, we propose an efficient bit-serial architecture for the low-power and low-complexity DWT filter, employing two-channel QMF(Qudracture Mirror Filter) PR(Perfect Reconstruction) lattice filter. The filter consists of four lattices(filter length=8) and we determine the quantization bit for the coefficients by the fixed-length PSNR(peak-signal-to-noise ratio) analysis and propose the architecture of the bit-serial multiplier with the fixed coefficient. The CSD encoding for the coefficients is adopted to minimize the number of non-zero bits, thus reduces the hardware complexity. The proposed folded 1D DWT architecture processes the other resolution levels during idle periods by decimations and its efficient scheduling is proposed. The proposed architecture requires only flip-flops and full-adders. The proposed architecture has been designed and verified by VerilogHDL and synthesized by Synopsys Design Compiler with a Hynix 0.35$\mu$m STD cell library. The maximum operating frequency is 200MHz and the throughput is 175Mbps with 16 clock latencies.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.12
• /
• pp.5622-5632
• /
• 2011

This paper presents the simulation design and analysis of Integrated Logistics System(ILS) which is operated by using the AGV(Automated Guided Vehicle). To maximize the operation performances of ILS with AGV, many parameters should be considered such as the number, velocity, and dispatching rule of AGV, part types, scheduling, and buffer sizes. We established the design of experiment in a way of Orthogonal Array in order to consider (1)maximizing the throughput; (2)maximizing the vehicle utilization; (3)minimizing the congestion; and (4)maximizing the Automated Storage and Retrieval System(AS/RS) utilization among various critical factors. Furthermore, we performed the optimization by using the simulation-based analysis and Evolution Strategy(ES). As a result, Orthogonal Array which is conducted far fewer than ES significantly saved not only the time but the same outcome when compared after validation test on the result from the two methods. Therefore, this approach ensures the confidence and provides better process for quick analysis by specifying exact experiment outcome even though it provides small number of experiment.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3447-3455
• /
• 1999

Database correctness is guaranteed by standard transaction scheduling schemes like two-phase locking for the context of concurrent execution environment in which short-lived ones are normally mixed with long-lived ones. Traditional syntax-oriented serializability notions are considered to be not enough to handle in particular various types of transaction in terms of duration of execution. To deal with this situation, altruistic locking has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed in extended altruistic locking in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. In this paper, we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature. The idea of two-way donation locking(2DL) has then been experimented to see the effect of more than single donation in distributed database systems. Simulation experiments shows that 2DL outperforms the conventional two-phase locking in terms of the degree of concurrency and average transaction waiting time under the circumstances that the size of long-transaction is in between 5 and 9.