• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.583-594
• /
• 2002

Assuring the security of group communications such as tole-conference and software distribution requires a common group key be shared among the legal members in a secure manner. Especially for large groups with frequent membership change, efficient rekey mechanism is essential for scalability. One of the most popular ways to provide sealable rekey is to partition the group into several subgroups. In this paper, we propose a two-layered key management scheme which combines DEP and CBT, a protocol in which subgroup manager cannot access the multicast data and another that has a multi-core, respectively. We also select sub-group key management protocols suitable for our structure and design new rekey protocols to exclude the subgroup managers from the multicast data. Compared to previous protocols based on CBT, our scheme provides forward secrecy, backward secrecy and scalability. This would reduce the number of encryption and decryption for a rekey message and would improve the efficiency number of rekey messages and the amount of information related to group members that group managers must maintain compared to DEP.

• Journal of the Korean GEO-environmental Society
• /
• v.10 no.7
• /
• pp.25-32
• /
• 2009

The main objective of this study was to examine the removal properties of Cu from water by inflated vermiculites. The component of vermiculites was analyzed by XRF and the concentration of Copper ion was measured by UV-VIS. Serial batch Kinetic tests and batch sorption tests were conducted to determine the removal characteristics for Cu in aqueous solutions. The result shows that removal rate, $K_{obs}$, of Cu are 0.73, 1.52, and 1.71 for initial pH 3, pH 4, pH 5, respectively, and are 3.19, 1.90, and 0.73 for the initial concentration of $1mg\;L^{-1}$, $5mg\;L^{-1}$, $10mg\;L^{-1}$, respectively. It leads to the conclusion that the removal rates are inversely proportional to the initial Cu concentration and are increased proportionally to the initial pHs. Finally, Sorption data were correlated with both Langmuir and Freundlich isotherms. As a result, Langmuir and Freundlich models were well fitted to batch isotherm data with good values of the determination coefficient. but the determination coefficient value for the Freundlich model fit was slightly higher than that of Langmuir model (0.965 for the Freundlich model and 0.936 for the Langmuir model). Using the Langmuir model, the maximum sorption capacity ($Q_{max}$), Freundlich partition coefficient, and the numerical value of n wrer estimated as $1,250mg\;kg^{-1}$, $635.1L\;kg^{-1}$ and 1.69, respectively. These results show that the inflated vermiculites could be used as an excellent adsorbent for copper contained in various types of aqueous solutions.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.43-50
• /
• 2008

Various studies are being conducted to achieve efficient routing and reduce energy consumption in wireless sensor networks where energy replacement is difficult. Among routing mechanisms, the clustering technique has been known to be most efficient. The clustering technique consists of the elements of cluster construction and data transmission. The elements that construct a cluster are repeated in regular intervals in order to equalize energy consumption among sensor nodes in the cluster. The algorithms for selecting a cluster head node and arranging cluster member nodes optimized for the cluster head node are complex and requires high energy consumption. Furthermore, energy consumption for the data transmission elements is proportional to $d^2$ and $d^4$ around the crossover region. This paper proposes a means of reducing energy consumption by increasing the efficiency of the cluster construction elements that are regularly repeated in the cluster technique. The proposed approach maintains the number of sensor nodes in a cluster at a constant level by equally partitioning the region where nodes with density considerations will be allocated in cluster construction, and reduces energy consumption by selecting head nodes near the center of the cluster. It was confirmed through simulation experiments that the proposed approach consumes less energy than the LEACH algorithm.

• Resources Recycling
• /
• v.28 no.4
• /
• pp.59-64
• /
• 2019

This study suggests a conceptual strategy and methodology for the risk assessment of the domestic abandoned mine fillers with fly ash. The fillers are composed of coal fly ash and solidification materials, and contain little toxic substances such as carbonates but also some heavy metals; therefore, those requires a risk assessment. The risk assessment should primarily focus on estimation of the effects to human health both on carcinogen and non-carcinogen aspects. The significant data such as toxicity and partition coefficients can be obtained from the national soil or mine environmental risk assessment guidelines. Accurate risk assessment of heavy metal contamination in the fillers may consume lots of time and efforts through site survey and instrumental analyses, etc. Moreover, it is inefficient to explore all of the factors as concentrations and categories in every heavy metal in the fillers, due to a high variety and complexity. Therefore, implementation of a preliminary risk assessment is suggested by using the literature data and the basic characteristics of the filler samples prior to the detailed risk assessment. Certainly, this presumes a thorough understanding of reliable sample analysis methods, exposure pathways, and relevant physicochemical and biological mechanisms.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.7
• /
• pp.291-298
• /
• 2024

Despite its wide application, cloud computing raises privacy leakage concerns because users should send their private data to the cloud. Homomorphic encryption (HE) can resolve the concerns by allowing cloud servers to compute on encrypted data without decryption. However, due to the huge computation overhead of HE, simply executing an entire cloud program with HE causes significant computation. Manually partitioning the program and applying HE only to the partitioned program for the cloud can reduce the computation overhead. However, the manual code partitioning and HE-transformation are time-consuming and error-prone. This work proposes a new homomorphic encryption enabled annotation-guided code partitioning compiler, called Heapa, for privacy preserving cloud computing. Heapa allows programmers to annotate a program about the code region for cloud computing. Then, Heapa analyzes the annotated program, makes a partition plan with a variable list that requires communication and encryption, and generates a homomorphic encryptionenabled partitioned programs. Moreover, Heapa provides not only two region-level partitioning annotations, but also two instruction-level annotations, thus enabling a fine-grained partitioning and achieving better performance. For six machine learning and deep learning applications, Heapa achieves a 3.61 times geomean performance speedup compared to the non-partitioned cloud computing scheme.

• The KIPS Transactions:PartA
• /
• v.11A no.4
• /
• pp.277-284
• /
• 2004

This paper presents a facial expression control method of 3D avatar that enables the user to select a sequence of facial frames from the facial expression space, whose level of details the user can select hierarchically. Our system creates the facial expression spare from about 2,400 captured facial frames. But because there are too many facial expressions to select from, the user faces difficulty in navigating the space. So, we visualize the space hierarchically. To partition the space into a hierarchy of subspaces, we use fuzzy clustering. In the beginning, the system creates about 11 clusters from the space of 2,400 facial expressions. The cluster centers are displayed on 2D screen and are used as candidate key frames for key frame animation. When the user zooms in (zoom is discrete), it means that the user wants to see mort details. So, the system creates more clusters for the new level of zoom-in. Every time the level of zoom-in increases, the system doubles the number of clusters. The user selects new key frames along the navigation path of the previous level. At the maximum zoom-in, the user completes facial expression control specification. At the maximum, the user can go back to previous level by zooming out, and update the navigation path. We let users use the system to control facial expression of 3D avatar, and evaluate the system based on the results.

• The Journal of the Korea Contents Association
• /
• v.16 no.10
• /
• pp.608-616
• /
• 2016

The Smith-Watrman (SW) algorithm is a local alignment algorithm which is one of important operations in DNA sequence analysis. The SW algorithm finds the optimal local alignment with respect to the scoring system being used, but it has a problem to demand long execution time. To solve the problem of SW, some methods to perform SW in distributed and parallel manner have been proposed. The ADAM which is a distributed and parallel processing framework for DNA sequence has parallel SW. However, the parallel SW of the ADAM does not consider that the SW is a dynamic programming method, so the parallel SW of the ADAM has the limit of its performance. In this paper, we propose a method to enhance the parallel SW of ADAM. The proposed parallel SW (PSW) is performed in two phases. In the first phase, the PSW splits a DNA sequence into the number of partitions and assigns them to multiple nodes. Then, the original Smith-Waterman algorithm is performed in parallel at each node. In the second phase, the PSW estimates the portion of data sequence that should be recalculated, and the recalculation is performed on the portions in parallel at each node. In the experiment, we compare the proposed PSW to the parallel SW of the ADAM to show the superiority of the PSW.

• The Journal of the Korea Contents Association
• /
• v.16 no.10
• /
• pp.477-482
• /
• 2016

This paper presents a new method of parity storing for ECC(error correcting code) in SSD (solid-state drive) and suitable structure of the controller. In general usage of NAND flash memory, we partition a page into data and spare area. ECC parity is stored in the spare area. The method has overhead on area and timing due to access of the page memory discontinuously. This paper proposes a new parity policy storing method that reduces overhead and R(read)/W(write) timing by using whole page area continuously without partitioning. We analyzed overhead and R/W timing. As a result, the proposed parity storing has 13.6% less read access time than the conventional parity policy with 16KB page size. For 4GB video file transfer, it has about a minute less than the conventional parity policy. It will enhance the system performance because the read operation is key function in SSD.

• Applied Biological Chemistry
• /
• v.40 no.4
• /
• pp.334-341
• /
• 1997

In the laboratory experiment, concentration and rate of runoff of 7 pesticides were measured under the simulated rainfall. Total runoff rate of metolachlor, alachlor, chlorothalonil, chlorpyrifos, EPN, phorate and captafol were 57.0, 14.2, 13.2, 7.9, 7.2, 7.1 and 2.8%, respectively, and the average runoff concentrations were 940, 399, 55, 7.0, 9.3, 151 and 7.0 ppb, respectively. Significant relationship was observed between the runoff rate and water solubility in the laboratory experiment(r=0.923). Even though not very high, relatively significant results were obtained in other experimental conditions. Based on the results, runoff rate prediction$[Y=0.2812{\times}10exp(0.261logWS-0.366)+0.3594{\times}10exp(-0.545logKoc+1.747)+0.3594{\times}10exp(-0.362log\;Kow+1.105]$ and conversion equations were calculated to investigate the possibility of estimating runoff rate in the field by natural rain. Calculated runoff rate by conversion equation was similar to experimental result with captafol in the field while 6 times higher result was obtained by the prediction equation. Therefore, those prediction and conversion equations derived from the laboratory experiment data and physicochemical properties of the pesticides could be used for the prediction of field runoff rate of pesticides by natural rainfall.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2627-2640
• /
• 1998

In this paper, we analyze the performance of the virtual cell system[1] for the transmission of IP datagrams in mobile computer communications. A virtual cell consistsof a group of physical cells shose base stationsl are implemented b recote bridges and interconnected via high speed datagram packet switched networks. Host mobility is supported at the data link layer using the distributed hierachical location information of mobile hosts. Given mobility and communication ptems among physical cells, the problem of deploying virtual cells is equivalent to the optimization cost for the entire system where interclster communication is more expesive than intracluster communication[2]. Once an iptimal partitionof disjoint clusters is obtained, we deploy the virtual cell system according to the topology of the optimal partition such that each virtual cell correspods to a cluser. To analyze the performance of the virtual cell system, we adopt a BCMP open multipel class queueing network model. In addition to mobility and communication patterns, among physical cells, the topology of the virtual cell system is used to determine service transition probabilities of the queueing network model. With various system parameters, we conduct interesting sensitivity analyses to determine network design tradeoffs. The first application of the proposed model is to determine an adequate network bandwidth for base station networking such that the networks would not become an bottleneck. We also evaluate the network vlilization and system response time due to various types of messages. For instance, when the mobile hosts begin moving fast, the migration rate will be increased. This results of the performance analysis provide a good evidence in demonsratc the sysem effciency under different assumptions of mobility and communication patterns.