• Journal of the Korean Society of Safety
• /
• v.20 no.4 s.72
• /
• pp.171-179
• /
• 2005

It is essential to understand the role of wall lining materials when they are exposed to a fire from an ignition source. Full-scale test methods permit an assessment of the performance of a wall lining material. Fire growth models have been developed due to the costly expense associated with full-scale testing. The models require heat flux maps from the ignition burner flame as input data. Work to date was impeded by a lack of detailed spatial characterization of the heat flux maps due to the use of limited instrumentation. To increase the power of fire modeling, accurate and detailed heat flux maps from the ignition burner are essential. High level spatial resolution for surface temperature can be provided from an infrared camera. The objective of this study was to develop a heat flux mapping procedure for a room test burner flame to a wall configuration with surface temperature information taken from an infrared camera. A prototype experiment was performed using the ISO 9705 test burner to demonstrate the developed heat flux mapping procedure. The results of the experiment allow the heat flux and spatial resolutions of the method to be determined and compared to the methods currently available.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.495-500
• /
• 2006

Satellite systems for objects positioning appeared indispensable for performing basic tasks of maritime navigation. Navigation, understood as safe and effective conducting a vehicle from one point to another, within a specific physical-geographical environment. [Kopacz, $Urba{\acute{n}}ski$, 1998]. However, the systems have not solved the problem of accessibility to reliable and highly accurate information about a position of an object, especially if surveyed toward on-shore navigational signs or in sea depth. And it's of considerable significance for many navigational tasks, carried out within the frameworks of special works performance and submarine navigation. In addition, positioning precisely the objects other than vessels, while executing hydrographical works, is not always possible with a use of any satellite system. Difficulties with GPS application show up also while positioning such off-lying dangers as wrecks, underwater and aquatic rocks also other naturaland artificial obstacles. It is caused by impossibility of surveyors approaching directly any such object while its positioning. Moreover, determination of vessels positions mutually (mutual geometrical relations) by teams carrying out one common tasks at sea, demands applying the navigational techniques other than the satellite ones. Vessels'staying precisely on specified positions is of special importance in, among the others, the cases as follows: - surveying vessels while carrying out bathymetric works, wire dragging; - special tasks watercraft in course of carrying out scientific research, sea bottom exploration etc. The problems are essential for maritime economy and the Country defence readiness. Resolving them requires applying not only the satellite navigation methods, but also the terrestrial ones. The condition for implementation of the geo-navigation methods is at present the methods development both: in aspects of their techniques and technologies as well as survey data evaluation. Now, the classical geo-navigation comprises procedures, which meet out-of-date accuracy standards. To enable meeting the present-day requirements, the methods should refer to well-recognised and still developed methods of contemporary geodesy. Moreover, in a time of computerization and automation of calculating, it is feasible to create also such software, which could be applied in the integrated navigational systems, allowing carrying out navigation, provided with combinatory systems as well as with the new positioning methods. Whereas, as regards data evaluation, there should be applied the most advanced achievements in that subject; first of all the newest, although theoretically well-recognised estimation methods, including estimation [Hampel et al. 1986; $Wi{\acute{s}}niewski$ 2005; Yang 1997; Yang et al. 1999]. Such approach to the problem consisting in positioning a vehicle in motion and solid objects under observation enables an opportunity of creating dynamic and interactive navigational structures. The main subject of the theoretical suggested in this paper is the Interactive Navigational Structure. In this paper, the Structure will stand for the existing navigational signs systems, any observed solid objects and also vehicles, carrying out navigation (submarines inclusive), which, owing to mutual dependencies, (geometrical and physical) allow to determine coordinates of this new Structure's elements and to correct the already known coordinates of other elements.

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.467-477
• /
• 2004

While recommender systems were used by a few E-commerce sites former days, they are now becoming serious business tools that are re-shaping the world of I-commerce. And collaborative filtering has been a very successful recommendation technique in both research and practice. But there are two problems in personalized recommender systems, it is First-Rating problem and Sparsity problem. In this paper, we solve these problems using the associative relation clustering and “Lift” of association rules. We produce “Lift” between items using user's rating data. And we apply Threshold by -cut to the association between items. To make an efficiency of associative relation cluster higher, we use not only the existing Hypergraph Clique Clustering algorithm but also the suggested Split Cluster method. If the cluster is completed, we calculate a similarity iten in each inner cluster. And the index is saved in the database for the fast access. We apply the creating index to predict the preference for new items. To estimate the Performance, the suggested method is compared with existing collaborative filtering techniques. As a result, the proposed method is efficient for improving the accuracy of prediction through solving problems of existing collaborative filtering techniques.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.1
• /
• pp.15-22
• /
• 2017

With the advance of Internet Technology, various social network services are created and used by users. Especially, the use of smart devices makes that multimedia contents can be used and distributed on social network services. However, since the crime rate also is increased by users with illegal purposes, there are needs to protect contents and block illegal usage of contents with multimedia forensics. In this paper, we propose a multimedia forensic technique which is identifying the video source. First, the scheme to acquire the sensor pattern noise (SPN) using morphology filtering is presented, which comes from the imperfection of photon detector. Using this scheme, the SPN of reference videos from the reference device is estimated and the SPN of an unknown video is estimated. Then, the similarity between two SPNs is measured to identify whether the unknown video is acquired using the reference device. For the performance analysis of the proposed technique, 30 devices including DSLR camera, compact camera, camcorder, action cam and smart phone are tested and quantitatively analyzed. Based on the results, the proposed technique can achieve the 96% accuracy in identification.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.219-226
• /
• 2018

One of the systematic ways to generate the number of all cases is a combination to construct a combination tree, and its time complexity is O($2^n$). A combination tree is used for various purposes such as the graph homogeneity problem, the initial model for calculating frequent item sets, and so on. However, algorithms that must search the number of all cases of a combination are difficult to use realistically due to high time complexity. Nevertheless, as the amount of data becomes large and various studies are being carried out to utilize the data, the number of cases of searching all cases is increasing. Recently, as the GPU environment becomes popular and can be easily accessed, various attempts have been made to reduce time by parallelizing algorithms having high time complexity in a serial environment. Because the method of generating the number of all cases in combination is sequential and the size of sub-task is biased, it is not suitable for parallel implementation. The efficiency of parallel algorithms can be maximized when all threads have tasks with similar size. In this paper, we propose a method to efficiently collaborate between CPU and GPU to parallelize the problem of finding the number of all cases. In order to evaluate the performance of the proposed algorithm, we analyze the time complexity in the theoretical aspect, and compare the experimental time of the proposed algorithm with other algorithms in CPU and GPU environment. Experimental results show that the proposed CPU and GPU collaboration algorithm maintains a balance between the execution time of the CPU and GPU compared to the previous algorithms, and the execution time is improved remarkable as the number of elements increases.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.287-296
• /
• 2003

There has been much research focused on collaborative filtering technique in Recommender System. However, these studies have shown the First-Rater Problem and the Sparsity Problem. The main purpose of this Paper is to solve these Problems. In this Paper, we suggest the user's predicting preference method using Bayesian estimated value and the associative user clustering for the recalculation of preference. In addition to this method, to complement a shortcoming, which doesn't regard the attribution of item, we use Representative Attribute-Neighborhood method that is used for the prediction when we find the similar neighborhood through extracting the representative attribution, which most affect the preference. We improved the efficiency by using the associative user's clustering analysis in order to calculate the preference of specific item within the cluster item vector to the collaborative filtering algorithm. Besides, for the problem of the Sparsity and First-Rater, through using Association Rule Hypergraph Partitioning algorithm associative users are clustered according to the genre. New users are classified into one of these genres by Naive Bayes classifier. In addition, in order to get the similarity value between users belonged to the classified genre and new users, and this paper allows the different estimated value to item which user evaluated through Naive Bayes learning. As applying the preference granted the estimated value to Pearson correlation coefficient, it can make the higher accuracy because the errors that cause the missing value come less. We evaluate our method on a large collaborative filtering database of user rating and it significantly outperforms previous proposed method.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.935-944
• /
• 2002

It is the Mobile Ad Hoc Networks that constituted with serveral mobile node that can communicate with other mobile nodes. Until now, there were no routing protocols considering such as Multimediadata, VOD (Video On Demand), which is required of lots of bandwidth in Mobile Ad Hoc Network, io we are in the need of QoS (Quality of Service)routing protocol to transmit the data packets faster and more accurate. Also, there are an unidirectional links due to asymmetric property of mobile terminals or current wireless environments on practical mobile ad hoc networks. However, at present, the existing mobile ad hoc routing protocols are implemented to support only bidirectional links. In this paper, we propose the Advanced Routing routing protocol in order to implement a new routing protocol, which is fit to mobile ad hoc networks containing unidirectional links and to support QoS service. For the performance evaluation, we use NS-2 simulator of U.C. Berkeley. We could get not only increased received data rate and decreased average route discovery time, but also network load decreases with compared Best effort service.

• Journal of Sensor Science and Technology
• /
• v.14 no.2
• /
• pp.69-77
• /
• 2005

The electronic nose (e-nose) has been used in food industry and quality controls in plastic packaging. Recently it finds its applications in medical diagnosis, specifically on detection of diabetes, pulmonary or gastrointestinal problem, or infections by examining odors in the breath or tissues with its odor characterizing ability. Moreover, the use of portable e-nose enables the on-site measurements and analysis of vapors without extra gas-sampling units. This is expected to widen the application of the e-nose in various fields including point-of-care-test or e-health. In this study, a PDA-based portable e-nose was developed using micro-machined gas sensor array and miniaturized electronic interfaces. The rich capacities of the PDA in its computing power and various interfaces are expected to provide the rapid and application specific development of the diagnostic devices, and easy connection to other facilities through information technology (IT) infra. For performance verification of the developed portable e-nose system, Six different vapors were measured using the system. Seven different carbon-black polymer composites were used for the sensor array. The results showed the reproducibility of the measured data and the distinguishable patterns between the vapor species. Additionally, the application of two typical pattern recognition algorithms verified the possibility of the automatic vapor recognition from the portable measurements. These validated the portable e-nose based on PDA developed in this study.

• Journal of Biomedical Engineering Research
• /
• v.29 no.1
• /
• pp.32-39
• /
• 2008

This paper reports on a realtime OS based master-slave configuration robot control system for laparoscopic surgery robot which enables telesurgery and overcomes shortcomings with conventional laparoscopic surgery. Surgery robot system requires control system that can process large volume information such as medical image data and video signal from endoscope in real-time manner, as well as precisely control the robot with high reliability. To meet the complex requirements, the use of high-level real-time OS (Operating System) in surgery robot controller is a must, which is as common as in many of modem robot controllers that adopt real-time OS as a base system software on which specific functional modules are implemened for more reliable and stable system. The control system consists of joint controllers, host controllers, and user interface units. The robot features a compact slave robot with 5 DOF (Degree-Of-Freedom) expanding the workspace of each tool and increasing the number of tools operating simultaneously. Each master, slave and Gill (Graphical User Interface) host runs a dedicated RTOS (Real-time OS), RTLinux-Pro (FSMLabs Inc., U.S.A.) on which functional modules such as motion control, communication, video signal integration and etc, are implemented, and all the hosts are in a gigabit Ethernet network for inter-host communication. Each master and slave controller set has a dedicated CAN (Controller Area Network) channel for control and monitoring signal communication with the joint controllers. Total 4 pairs of the master/slave manipulators as current are controlled by one host controller. The system showed satisfactory performance in both position control precision and master-slave motion synchronization in both bench test and animal experiment, and is now under further development for better safety and control fidelity for clinically applicable prototype.