• Journal of the Korea Safety Management & Science
• /
• v.13 no.3
• /
• pp.55-61
• /
• 2011

Unit cost for asbestos removal work which have been made out at government contract award for recent three years has been reviewed and shown with table. And the cost have been compared with ones made out by two agencies, American asbestos removal specialists, government ministry for making out comparison tables. First, legal and practical work status survey have been made to determine reasonability of introducing separate contract-awarding system, as a part of ensuring reasonable unit work cost. And then, two different status have been compared and there in introduction possibility of separate contract-awarding system, it is found out. In interior removal work case, it is thought that 50% by owner, 60% unit work cost by the expert of which removal specialist think as reasonable unit cost. the results for exterior and spray work method are shown with almost same context. Impact factors for determining unit work cost such as project mount, project kind, contract-awarding method, subcontract method have been compared with parties. Removal specialist and expert group have almost same ideas for project amount which has been hightestly weighed but owner's recognition has partially lower than specialists idea. There are almost no difference of recognition between three(3) parties for project kind. Idea comparison of reasonable unit work cost for asbestos removal work between three concerned parties has been analyzed and found out that expert group do unit work cost, 65% of which removal specialists estimate, in interior tex removal. And there is almost no difference between them in exterior roof slate removal. But there is considerable difference between them that owner estimates 50% unit cost of specialist one while expert group estimate 50% of specialist idea of unit removal cost.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.8
• /
• pp.1485-1495
• /
• 2009

This paper presents a novel approach to economic dispatch (ED) with nonconvex fuel cost function as combinatorial optimization problems (COP) while most of the conventional researches have been developed as function optimization problems (FOP). One nonconvex fuel cost function can be divided into several convex fuel cost functions, and each convex function can be regarded as a generation type (G-type). In that case, ED with nonconvex fuel cost function can be considered as COP finding the best case among all feasible combinations of G-types. In this paper, a genetic algorithm is applied to solve the COP, and the ${\lambda}-P$ function method is used to calculate ED for the fitness function of GA. The ${\lambda}-P$ function method is reviewed briefly and the GA procedure for COP is explained in detail. This paper deals with two kinds of ED problems, namely ED with multiple fuel units (EDMF) and ED with prohibited operating zones (EDPOZ). The proposed method is tested for all the ED problems, and the test results show an improvement in solution cost compared to the results obtained from conventional algorithms.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.628-645
• /
• 2014

In past few years, distributed hash table (DHT)-based P2P systems have been proven to be a promising way to manage decentralized index information and provide efficient lookup services. However, the skewness of users' preferences regarding keywords contained in a multi-keyword query causes a query load imbalance that combines both routing and response load. This imbalance means long file retrieval latency that negatively influences the overall system performance. Although index replication has a great potential for alleviating this problem, existing schemes did not explicitly address it or incurred high cost. To overcome this issue, we propose, in this paper, an integrated solution that consists of three replication schemes to alleviate query load imbalance while minimizing the cost. The first scheme is an active index replication that is used in order to decrease routing load in the system and to distribute response load of an index among peers that store replicas of the index. The second scheme is a proactive pointer replication that places location information of each index to a predetermined number of peers for reducing maintenance cost between the index and its replicas. The third scheme is a passive index replication that guarantees the maximum query load of peers. The result of simulations indicates that the proposed schemes can help alleviate the query load imbalance of peers. Moreover, it was found by comparison that our schemes are more cost-effective on placing replicas than PCache and EAD.

• Proceedings of the KIPE Conference
• /
• 2004.07b
• /
• pp.976-980
• /
• 2004

This paper presents a position sensorless control system of Switched Reluctance Motor (SRM) using neural network. The control of SRM depends on the commutation of the stator phases in synchronism with the rotor position. The position sensing requirement increases the overall cost and complexity. In this paper, the current-flux-rotor position lookup table based position sensorless operation of SRM is presented. Neural network is used to construct the current-flux-rotor position lookup table, and is trained by sufficient experimental data. Experimental results for a 1-hp SRM is presented for the verification of the proposed sensorless algorithm.

• ETRI Journal
• /
• v.34 no.1
• /
• pp.66-75
• /
• 2012

This paper proposes a privacy-preserving database encryption scheme that provides access pattern hiding against a service provider. The proposed scheme uses a session key to permute indices of database records each time they are accessed. The proposed scheme can achieve access pattern hiding in situations in which an adversary cannot access the inside of the database directly, by separating the entity with an index table and data table and permuting both the index and position where the data are stored. Moreover, it is very efficient since only O(1) server computation and communication cost are required in terms of the number of the data stored. It can be applied to cloud computing, where the intermediate entities such as cloud computing service provider can violate the privacy of users or patients.

• Journal of Industrial Technology
• /
• v.26 no.B
• /
• pp.199-206
• /
• 2006

Internet telephony provides voice communication services with added flexibility for multimedia extension at a lower cost compared to traditional telephone systems. We implemented an internet telephony system as an overlay network without a centralized server, using a distributed hash table (DHT). Compared to the current server-based internet telephony system, our system is fault-tolerant, scalable, and can be flexible extended to various services and advanced to integrated service. To demonstrate the high flexibility of our DHT-based internet telephony system, we made our system cooperate with web servers. Web users can check up others' online stales and establish voice communication sessions to online users at a mouse click. This technology can be applied to more complex services such as multimedia messaging or video conference service.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4599-4617
• /
• 2018

Abusing the Simple Server Discovery Protocol (SSDP) can induce an SSDP attack (including SSDP DoS, DDoS, DRDoS) posing a significant threat to UPnP devices. Rapid and extensive developments in computer technology, especially in regards to IoT, have made Upnp devices an indispensable part of our daily lives - but also render them susceptible to a variety of SSDP attacks without suitable countermeasures. This paper proposes the Two-dimensional table scheme, which provides high security at a reasonable computational cost. The feasibility and effectiveness of the proposed scheme are also validated by comparison against four other schemes (Stateless connections, Failing-together, Cookie, and Client puzzle).

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.425-426
• /
• 2006

Overdriving schemes are used to improve the response time of liquid crystal display. Typically they are implemented by using LUTs (look-up table) within an image processor. However, the size of LUT is limited by the physical memory size and system cost. In this paper, we present an improved method for LUT implementation using linear interpolation and piecewise least-square polynomial regression. Using the proposed method, the performance of LUT can be improved and memory size of that can be reduced.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.3
• /
• pp.134-138
• /
• 2009

We present a flash memory system with low cost and high performance for solid-state disk. The proposed flash system is constructed as a SLC with hot blocks and a MLC with cold blocks. Either the SLC or the MLC is selectively accessed on the basis of a position bit in a mapping table. Our results show that the system enables the SLC size to be reduced by about 80% relative to a conventional SLC while maintaining similar performance. And also, our system can improve a performance by above 60% comparing with a conventional MLC.

• Korean Journal of Remote Sensing
• /
• v.12 no.1
• /
• pp.17-25
• /
• 1996

This paper presents a GCP marking technique using scanned maps. Twelve maps with a scale of 1:250, 000 were scanned and stored as raster images. The distortion factors of scanned maps were modelled by polynomials. The coefficients of the polynomials were determined by a least squre fit. This technique does not require a bulky and expensive digitizing table so that it is suitable for a low-cost pre-processing system. The GCP marking using this technique showed a sufficient accuracy for KITSAT1, 2 narrow camera images.