• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.8 no.3
• /
• pp.181-188
• /
• 2010

Metal surface decontamination characteristics were investigated by using a laser ablation method. A second harmonic generation of a Q-switched Nd:YAG laser with a wave length of 532 nm, a pulse energy of 150 mJ and a pulse width of 5 ns was employed to assess the decontamination performance for metal surfaces contaminated with $CsNO_3$, $Co(NH_4)_2(SO_4)_2$, $Eu_2O_3$ and $CeO_2$. The ablation behavior was investigated for the decontamination variables such as a number of laser shots, laser fluence and an irradiation angle. Their optimum values were found to be 8, 13.3 J/$cm^2$ and $30^{\circ}$, respectively. The decontamination efficiency was different depending on the kinds of the contaminated ions, due to their different melting and boiling points and was in the order: $CsNO_3>Co(NH_4)_2(SO_4)_2>Eu_2O_3>CeO_2$. We also evaluated a correlation between the metal ablation thickness and the number of laser shots for the different laser fluences.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.5
• /
• pp.323-330
• /
• 2020

This paper proposes the road roughness based Braking Pressure Calculation System(BPCS) for an Autonomous Vehicle Stability. The system consists of an image normalization module that processes the front image of a vehicle to fit the input of the random forest, a Random Forest based Road Roughness Classification Module that distinguish the roughness of the road on which the vehicle is travelling by using the weather information and the front image of a vehicle as an input, and a brake pressure control module that modifies a friction coefficient applied to the vehicle according to the road roughness and determines the braking strength to maintain optimal driving according to a vehicle ahead. To verify the efficiency of the BPCS experiment was conducted with a random forest model. The result of the experiment shows that the accuracy of the random forest model was about 2% higher than that of the SVM, and that 7 features should be bagged to make an accurate random forest model. Therefore, the BPCS satisfies both real-time and accuracy in situations where the vehicle needs to brake.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.437-441
• /
• 2006

Wireless sensor network consists of sensor nodes which are disseminated closely to each other to collect informations for the various requests of a sensor application applied for sensing phenomenons in real world. Each sensor node delivers sensing informations to an end user by conducting cooperative works such as processing and communicating between sensor nodes. In general, the power supply of a sensor node is depends on a battery so that the power consumption of a sensor node decides the entire life time of a sensor network. To resolve the problem, optimal routing algorithm can be used for prolong the entire life time of a sensor network based on the information on the energy level of each sensor node. In this paper, different from the existing Directed Diffusion and SPTN method, we presents a data dissemination protocol based on lower-power consumption that effectively maximizes the whole life time of a sensor network using the informations on the energy level of a sensor node and shortest-path hops. With the proposed method, a data transfer path is established using the informations on the energy levels and hops, and the collected sensing information from neighboring nodes in the event-occurring area is merged with others and delivered to users through the shortest path.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.563-577
• /
• 2006

A stream processor uses resource sharing method for efficient of limited resource in multiple continuous queries. The previous methods process aggregate queries to consist the level structure. So insert operation needs to reconstruct cost of the level structure. Also a search operation needs to search cost of aggregation information in each size of sliding windows. Therefore this paper uses linear structure for optimization of sliding window aggregations. The method comprises of making decision, generation and deletion of panes in sequence. The decision phase determines optimum pane size for holding accurate aggregate information. The generation phase stores aggregate information of data per pane from stream buffer. At the deletion phase, panes are deleted that are no longer used. The proposed method uses resources less than the method where level structures were used as data structures as it uses linear data format. The input cost of aggregate information is saved by calculating only pane size of data though numerous stream data is arrived, and the search cost of aggregate information is also saved by linear searching though those sliding window size is different each other. In experiment, the proposed method has low usage of memory and the speed of query processing is increased.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.4
• /
• pp.334-348
• /
• 2005

The goal of next generation digital broadcasting is offering the interaction among consumers and providers as well as variety services. One of the important factors for this new broadcasting environment keeps the interoperability among providers and consumers since the environment is distributed. Therefore a standard metadata for digital broadcasting is required and TV-Anytime metadata is one of the metadata standards for digital broadcasting. The terminal nodes of TV-Anytime metadata are defined by using MPEG-7 metadata. MPEG-7 metadata is standard metadata for describing multimedia content. Therefore, if we use the MPEG-7 metadata for describing broadcasting content can offer multimedia search services like content-based search by the extension of metadata. The efficient management system for these metadata is important for offering the services with high Duality on real broadcasting environment TV-Anytime metadata and MPEG-7 metadata are technically defined using a single XML schema, so its instances are XML data. Currently, a lot of systemsfor managing XML data are proposed in many researchers and we can expect to adapt these systems for managing broadcasting metadata. But the methods used in these systems are not specific methods for managing broadcasting metadata because of methods for general-purpose. In this paper, we find the properties of broadcasting metadata and develop an efficient metadata management system that is based on the found properties. Since our systemis implemented on real broadcasting environment, we expect that the system is most efficient and suitable. Also our system is interoperable since we use XQuery as query language for querying broadcasting metadata.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.80-90
• /
• 2002

Clustering is a useful technique for grouping data points such that points within a single group/cluster have similar characteristics. Many clustering algorithms have been developed and used in engineering applications including pattern recognition and image processing etc. Recently, it has drawn increasing attention as one of important techniques in data mining. However, clustering algorithms such as K-means and Fuzzy C-means suffer from difficulties. Those are the needs to determine the number of clusters apriori and the clustering results depending on the initial set of clusters which fails to gain desirable results. In this paper, we propose a new clustering algorithm, which solves mentioned problems. In our method we use evolutionary algorithm to solve the local optima problem that clustering converges to an undesirable state starting with an inappropriate set of clusters. We also adopt a new measure that represents how well data are clustered. The measure is determined in terms of both intra-cluster dispersion and inter-cluster separability. Using the measure, in our method the number of clusters is automatically determined as the result of optimization process. And also, we combine heuristic that is problem-specific knowledge with a evolutionary algorithm to speed evolutionary algorithm search. We have experimented our algorithm with several sets of multi-dimensional data and it has been shown that one algorithm outperforms the existing algorithms.

• The KIPS Transactions:PartB
• /
• v.15B no.1
• /
• pp.45-52
• /
• 2008

As the recent development of the IT services, there is a urgent need of effective diagnosis system to present appropriate solution for the complicated problems of breakdown control, a cause analysis of breakdown and others. So we propose an intelligent diagnosis system that integrates the case-based reasoning and the artificial neural network to improve the system performance and to achieve optimal diagnosis. The case-based reasoning is a reasoning method that resolves the problems presented in current time through the past cases (experience). And it enables to make efficient reasoning by means of less complicated knowledge acquisition process, especially in the domain where it is difficult to extract formal rules. However, reasoning by using the case-based reasoning alone in diagnosis problem domain causes a problem of suggesting multiple causes on a given symptom. Since the suggested multiple causes of given symptom has the same weight, the unnecessary causes are also examined as well. In order to resolve such problems, the back-propagation learning algorithm of the artificial neural network is used to train the pairs of the causes and associated symptoms and find out the cause with the highest weight for occurrence to make more clarified and reliable diagnosis.

• Resources Recycling
• /
• v.7 no.3
• /
• pp.3-10
• /
• 1998

Simulated waste liquid containing 50 ppm cobalt ion was treated by adsorbing colloidal flotation using Fe(III) or Al(IlI) as flocclant and a sodium lamyl sulfate as a collector. Parameters such as pH, surfactant concentration, Fe(III) or Al(III) concentration, gas flow rate, etc., W앙e considered. The flotation with Fe(III) showed 99.8% removal efficiency of cohalt on the conditions of initial cobalt ion concentration 50 ppm, pH 9.5, gas flow rate 70 ml/min, and flotation time 30 min. When the waste solution, was treated with 35% $H_2O_2$ prior to adsorbing colloidal flotation, the optimal pH for removing cobalt shifted m to weak alkaline range and flotation could be applied in wider range of pH as compared to non-use of $H_2O_2$. Additional use of 20 ppm Al(III) after precipitation of 50 ppm Co(II) with 50 ppm Fe(III) made the optimal pH range for preferable flotation w wider. Foreign ions such as, $NO_3^-$, $SO_4^{2-}$, $Na^+$, $Ca^{2+}$ were adopted and their effects were observed. Of which sulfate ion was f found to be detrimental to removal of cob퍼t ion by flotation. Coprecipitation of Co ion with Fe(III) and Al(III) resulted in b better removal efficiency of cobalt IOn 피 the presence of sulfate ion.

• Resources Recycling
• /
• v.7 no.3
• /
• pp.11-16
• /
• 1998

Simulated waste liquid containing 50 ppm cobalt ion was t$\xi$sted by precipitate flotation using a sodium lauryl sulfate as a c collector. The effects of initial cobalt ion concentration, pH, surfactant concentration, flotation time, gas flow rate and foreign i ions on removal efficiency of cobalt ion were studied. Pretreatment of the waste liquid with 35% $H_2O_2$, prior to precipitate f flotation made shin of optimal flotation pH from the strong alkalinity to weak alkaline range and made a favorable flotation of c cobalt ion in wide range of pH. For the result of this experiment, 99.8% removal efficiency was obtained on the conditions of initial coball ion concentration 50 ppm, pH 9.5 gas flow rate 70 mllmin, flotation time 30 min. The simulate ion was fanned t to be the most harmful ion against removal of cobalt by precipitate flotation of the species which were tested The presence of 0.1 M of $SO_4^{2-}$ ion decreased remo,때 $\xi$폐iciency of cobalt to 90% while the cobalt were almost entirely removed in the a absence of sulfate ion.

• Resources Recycling
• /
• v.13 no.2
• /
• pp.39-46
• /
• 2004

The amount of electric furnace dust has been steadily increasing due to the increase of iron scraps which are usually recycled by electric furnace melting process. To date, this electric furnace dust has usually been treated by landfilling, however, because of shortage of landfill sites and heavy metal leaching more desirable treatment schemes are urgently needed. Among several possible schemes for the proper treatment of electric furnace dust, its recycling can be said to be most desirable. In present study, the triboelectrostatic separation of zinc and zinc-containing components from electric furnace dust was attempted based on its physicochemical properties such as particle shape, size distribution, and chemical assay. The dust was found to be mixed with spherical and non-spherical shaped particles and its major component materials were $ZnFe_2$$O_4$, ZnO, Fe, Zn, and FeO. The content of zinc-containing components in the entire dust was observed to be in the range of 15～30 wt%, which reasonably justified that zinc is recyclable. The triboelectrostatic characteristic of each component material was found to be different each other since their work functions were different, and based on this characteristic zinc and zinc-containing component could be flirty separated from the dust. After selecting a proper tribo-elec-trification material, the separation features of zinc and zinc-containing component were examined by taking the distance of electrodes, electric field strength, and scavenging as the experimental variables. The highest zinc-content obtained under the optimal separating condition was found to be up to 50wt%.