• YAKHAK HOEJI
• /
• v.33 no.4
• /
• pp.211-218
• /
• 1989

Twenty-six injectable drug products, many of which are administered by i.v. infusion, were studied for loss from aqueous solutions stored in polyvinyl chloride (PVC) infusion bags for various periods of time. The PVC infusion bags were stored in the dark room at room temperature for up to one month. Drugs stored in glass bottle served as controls. The solutions were assayed Spectrophotometrically at regular intervals. The effect of drug concentration and pH on the loss of drug from solution were studied. Octanol-water partition coefficients were used as a guage of lipid solubility of drugs. The elution of di(2-ethylhexyl)phthalate(DEHT) from PVC infusion bags was studied. For most of the drug studied, minimal loss from the aqueous solutions were observed over periods of storage time. Six of the drug products - Thiopental sodium, Hydralazine HCl, Thioridazine HCl, Trifluoperazine 2HCl, Metronidazole, Chlorpromazine HCl - were found to be lost a substantial extent. DEHP was found to be migrating from PVC infusion bags.

• Proceedings of the Korean Society for Environmental Edudation Conference
• /
• 2004.08a
• /
• pp.48-55
• /
• 2004

In Korea almost all subjects in school teach environmental education. In such situation it is difficult that the environmental subject as a regular stand-alone subject for environmental education establishes its own individuality. In many cases it and the other subjects teach identical contents with the nearly same methods. Such redundancy could make students lose their interest in the topics that were already taught by other subject. And the environmental subject and the other subjects might compete with one another rather than cooperate. To avoid such negative effects we need to partition their roles. For example, the other subjects focus on teaching their own knowledge and skills related to environmental problems. And the environmental subject focuses on encouraging students to possess environmental attitude and to participate in environmental activities. Above all, the environmental subject needs to teach the social nature of environmental problems and the social process through which we make a decision on the problems. It should let students experience highly integrated process of environmental decision. In order to establish the individuality of the environmental subject I discussed its goals and contents. I hope that the related persons in all the subjects start to deeply discuss the partitioning of roles, with open mind, in order to effectively achieve the goal of environmental education in school.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6A
• /
• pp.881-887
• /
• 1999

In this paper, were introduce two types of equalizers, called equalizer-a and equalizer-b, applying to wireless communications having unknown channel characteristics. The equalizer-a, which has the single sample detector with equalizer system, is developed while the equalizer-b has the partition detectors with the same system used in equalizer-a. The methodologiy we adopt for designing the equalizers is that the sample space is partitioned into finite number of regions by using quantiles, which are estimated by robbins-monro stochastic approximation (RMSA) algorithm, and the coefficients of equalizers are calculated based on nonlinear minimum mean, square error (MMSE) algorithm. Through the computer simulation, the equalizers show much better performance in equiprobably partitioned sample subspaces of observations than the single sample detector and the detector, which has the conventional equalizer, in unquantized observation space under various noise environments.

• Journal of Korea Multimedia Society
• /
• v.22 no.6
• /
• pp.684-694
• /
• 2019

Information spread in networks is universal in many real-world phenomena such as propagation of infectious diseases, diffusion of a new technology, computer virus/spam infection in the internet, and tweeting and retweeting of popular topics. The problem of finding the information source is to pick out the true source if information spread. It is of practical importance because harmful diffusion can be mitigated or even blocked e.g., by vaccinating human or installing security updates. This problem has been much studied, where it has been shown that the detection probability cannot be beyond 31% even for regular trees if the number of infected nodes is sufficiently large. In this paper, we study the impact of an anti-information spreading on the original information source detection. We consider an active defender in the network who spreads the anti-information against to the original information simultaneously and propose an inverse Voronoi partition based inference approach, called Voronoi Inference to find the source. We perform various simulations for the proposed method and obtain the detection probability that outperforms to the existing prior work.

• Journal of applied mathematics & informatics
• /
• v.37 no.5_6
• /
• pp.469-480
• /
• 2019

A generalized tiling is defined as a generalization of the properties of tiling a region of ${\mathbb{Z}}^2$ with dominoes, and comprises tiling with rhombus and any other tilings that admits height functions which can be ordered into a distributive lattice. By using properties of the distributive lattice, we prove that the Markov chain consisting of moving from one height function to the next by a flip is fast mixing and the mixing time ${\tau}({\epsilon})$ is given by ${\tau}({\epsilon}){\leq}(kmn)^3(mn\;{\ln}\;k+{\ln}\;{\epsilon}^{-1})$, where mn is the area of the grid ${\Gamma}$ that is a k-regular polycell. This result generalizes the result of the authors (T-tetromino tiling Markov chain is fast mixing, Theor. Comp. Sci. (2018)) and improves on the mixing time obtained by using coupling arguments by N. Destainville and by M. Luby, D. Randall, A. Sinclair.

• Applied Biological Chemistry
• /
• v.9
• /
• pp.59-64
• /
• 1968

Takju (Korean native Sake) was mashed with two different materials. One of the material was polished rice and Nuruk(mold wheat), the other one was corn and Nuruk. The amino acids in those fermenting mashes were identified by paper partition chromatography at regular intervals. The results were summarized as follows; a) Following 14 kinds of amino acids were identified in the mash of rice material; lysine, valine, proline, leucine, serine, glycine, aspartic acid, alanine, cystine, tyrosine, histidine, glutamic acid, tryptophan and phenylalanine b) Following 12 kinds of amino acids were identified in the mash of corn material; lysine, valine, proline, leucine, serine, glycine, aspartic acid, alanine, cystine, histidine, argrinine and tryptophan. c) The main amino acids in the Takju mash according to the color density of the each amino acid spot on the paper chromatograms were checked as lysine, valine, leucine, serine, proline and glycine.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.320-330
• /
• 2004

Query languages for XML use paths in a data graph to represent queries. Actually, paths in a data graph are used as a basic constructor of an XML query. User can write more expressive Queries by using Patterns (e.g. regular expressions) for paths. There are many identical paths in a data graph because of the feature of semi-structured data. Current researches for indexing XML utilize identical paths in a data graph, but such an index can grow larger than source data graph and cannot guarantee efficient access path. In this paper we propose a partitioning technique that can partition all the paths in a data graph. We develop an index graph that can find appropriate partitions for a path query efficiently. The size of our index graph can be adjusted regardless of the source data. So, we can significantly improve the cost for index graph traversals. In the performance study, we show our index much faster than other graph based indexes.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.596-608
• /
• 2004

A lot of work has been done to reduce disk access time in I/O intensive systems, which store and handle massive amount of data, by distributing data across multiple disks and accessing them in parallel. Most of the previous work has focused on an efficient mapping from a grid cell to a disk number on the assumption that data space is regular grid-like partitioned. Although we can achieve good performance for low-dimensional data by grid-like partitioning, its performance becomes degenerate as grows the dimension of data even with a good disk allocation scheme. This comes from the fact that they partition entire data space equally regardless of distribution ratio of data objects. Most of the data in high-dimensional space exist around the surface of space. For that reason, we propose a new declustering algorithm based on the partitioning scheme which partition data space from the surface. With an unbalanced partitioning scheme, several experimental results show that we can remarkably reduce the number of data blocks touched by a query as grows the dimension of data and a query size. In this paper, we propose disk allocation schemes based on the layout of the resultant data blocks after partitioning. To show the performance of the proposed algorithm, we have performed several experiments with different dimensional data and for a wide range of number of disks. Our proposed disk allocation method gives a performance within 10 additive disk accesses compared with strictly optimal allocation scheme. We compared our algorithm with Kronecker sequence based declustering algorithm, which is reported to be the best among the grid partition and mapping function based declustering algorithms. We can improve declustering performance up to 14 times as grows dimension of data.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2823-2834
• /
• 1998

This paper deals with the problem of one-to-one mapping of $2^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize to total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. We first propose a graph modification technique which transfers the mapping problem in a hypercube multicomputer into the problem of finding a set of maximum cutsets on a given task graph. Using the graph modification technique, we then propose a repeated mapping scheme which efficiently finds a one-to-one mapping of task modules to a hypercube multicomputer by repeatedly applying an existing bipartitioning algorithm on the modified graph. The repeated mapping scheme is shown to be highly effective on a number of test task graphs, it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increase. The proposed algorithm is shown to be very effective for regular graph, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mapping on almost all the regular task graphs considered.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.147-157
• /
• 2017

In recent years, Super-pixels have become very popular for use in computer vision applications. Super-pixel algorithm transforms pixels into perceptually feasible regions to reduce stiff features of grid pixel. In particular, super-pixels are useful to depth estimation, skeleton works, body labeling, and feature localization, etc. But, it is not easy to generate a good super-pixel partition for doing these tasks. Especially, super-pixels do not satisfy more meaningful features in view of the gestalt aspects such as non-sum, continuation, closure, perceptual constancy. In this paper, we suggest an advanced algorithm which combines simple linear iterative clustering with fuzzy clustering concepts. Simple linear iterative clustering technique has high adherence to image boundaries, speed, memory efficient than conventional methods. But, it does not suggest good compact and regular property to the super-pixel shapes in context of gestalt aspects. Fuzzy similarity measures provide a reasonable graph in view of bounded size and few neighbors. Thus, more compact and regular pixels are obtained, and can extract locally relevant features. Simulation shows that fuzzy similarity based super-pixel building represents natural features as the manner in which humans decompose images.