• Journal of the Korean Ceramic Society
• /
• v.38 no.11
• /
• pp.1067-1074
• /
• 2001

Four different composition of autoxidation drying type waterborne coatings (WBC-1, WBC-2, WBC-3, WBC-4) were prepared by the compounding of bentonite (BEN) as a water swellable clay and organometallic soaps as a drier with acrylic binder and coating additives. The solution viscosity, solid content, rheological properties and drying rate of WBCs were investigated. Also the thermal stability, the transmittance and the water-resistance of the films casted by WBCs were measured, and the surface topology of WBC films were investigated by the scanning probe microscopy. As WBC-2, WBC-3 and WBC-4 containing BEN showed the thixotropy with the shear rate, the storage stability of WBC was a excellent. When the driers was mixed in the ratio of Mn/Zn/Ba=1/2/3, the dry ability of WBCs showed maximum as 5.0 sec at 60$\^{C}$. The initial decomposition temperature and the transmittance of WBC films containing BEN increased in range of 32.2∼54.7$\^{C}$ and 5.1∼8.6% than the commercial WBC (MC-21W), respectively. The water resistance of WBC films increased in order of MC-21W

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.643-658
• /
• 2004

Mobile ad hoc networks(MANET) have recently attrarted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on the various problems of MANET in data link and network layers, we consider, in this paper, how to efficiently support applications such as service discovery on top of MANET. Peer-to-Peer(P2P) overlay network can be adopted to service discovery mechanism because P2P and MANET share certain similarities, primarily the fact that both arc instances of self-organizing decentralized systems. Especially, distributed hash table(DHT) systems used for r2r overlay network can be effective in reducing the communication overhead in service discovery. However, since overlay network is independent of physical network topology and existing topology-aware mechanisms are based on the wired network, they are inefficient in MANET. We propose a proximity-based overlay network routing to overcome the inefficiency of routing in overlay network. In the proximity-based overlay network routing, each node collects information of physically close nodes by using one hop broadcast and routes messages to the logically closest node to destination. In a detailed ns-2 simulation study, we show that the proximity-based overlay network routing reduces the number of physical hops comparable to the flooding-based mechanism with low communication overhead. We also find that the proposed scheme works well in the mobile environment.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.16 no.2
• /
• pp.251-258
• /
• 1998

The purpose of this study is to develop the District-level Planning Support System (DPSS) by using GIS. The district-level planning which is related for district-level control of city, needs the various parcel-level information which is composing the urban physical environment. The information has to be stored and analyzed for recognizing the study area, then the district-level planning will be efficiently managed. The use of GIS in the process of district-level planning is restricted for the creation of thematic map. GIS is not used for the analysis of spatial patterns and planning process. This study evaluates the characteristics of current district-level planning and the basic components of urban physical environment. And the database model is built. The topology among components is defined by using the spatial relationship. Then the spatial query machine for district-level planing is developed by using ArcView 3.1, Avenue and Dialog Extension. This spatial query machine is applied for case study. This study shows 1) the possibility of the district-level planning support system for analyzing spatial relationship, 2) the needs of the up-to-date topographic map showing current building's footlines and the complete integration with cadastral maps, it will reduce the uncertainty in the spatial decision making process, 3) the methodology for the construction of spatial decision making rules, 4) the further study for the using of raster, network, image and three dimension data.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.1-6
• /
• 2008

Data grid shares distributed large data via wide-band network. Such grid environment consumes much time for large data transmission. Because it is implemented on internet as physical network. Many replication strategies were proposed for solving this problem, but they are not optimal in real Data grid environments. Because they were proposed that based on logical topology without consideration of real internet architecture. Grid data access time is largely influenced by internet architecture as physical network of Data grid. In this paper, we propose a new data replication strategy RSIA(Replication Strategy based on Internet Architecture) based on internet architecture. The RSIA places replicas considering structural hierarchy in each element of internet, and avoid the performance bottlenecks to reduce system performance degradation when a data transfer. Through simulation, we show that the proposed RSIA data replication strategy improves the performance of Data Grid environment compared with previous strategies.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.83-86
• /
• 1996

In this paper we study the problem of augmenting a physical network to improve the topology for new survivable network architectures. We are given a graph G=(V,E,F), where V is a set of nodes that represents transmission systems which be interconnected by physical links, and E is a collection of edges that represent the possible pairs of nodes between which a direct transmission link can be placed. F, a subset of E is defined as a set of the existing direct links, and E/F is defined as a set of edges for the possible new connection. The cost of establishing network $N_{H}$=(V,H,F) is defined by the sum of the costs of the individual links contained in new link set H. We call that $N_{H}$=(V,H,F) is feasible if certain connectivity constrints can be satisfied in $N_{H}$=(V,H,F). The computational goal for the suggested model is to find a minimum cost network among the feasible solutions. For a k edge (node) connected component S .subeq. F, we charactrize some optimality conditions with respect to S. By this characterization we can find part of the network that formed by only F-edges. We do not need to augment E/F edges for these components in an optimal solution. Hence we shrink the related component into a node. We study some good primal heuristics by considering construction and exchange ideas. For the construction heuristics, we use some greedy methods and relaxation methods. For the improvement heuristics we generalize known exchange heuristics such as two-optimal cycle, three-optimal cycle, pretzel, quezel and one-optimal heuristics. Some computational experiments show that our heuristic is more efficient than some well known heuristics.stics.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2004.11a
• /
• pp.265-271
• /
• 2004

The interaction network of protein -protein plays an important role to understand the various biological functions of cells. Currently, the high -throughput experimental techniques (two -dimensional gel electrophoresis, mass spectroscopy, yeast two -hybrid assay) provide us with the vast amount of data for protein-protein interaction at the proteome scale. In order to recognize the role of each protein in their network, the efficient bioinformatical and computational analysis methods are required. We propose a systematic and mathematical method which can analyze the protein -protein interaction network rigorously and enable us to capture the biological and physical essence of a topological character and stability of protein -protein network, and sensitivity of each protein along the biological pathway of their network. We set up a Laplacian matrix of spectral graph theory based on the protein-protein network of yeast proteome, and perform an eigenvalue analysis and apply a perturbation method on a Laplacian matrix, which result in recognizing the center of protein cluster, the identity of hub proteins around it and their relative sensitivities. Identifying the topology of protein -protein network via a Laplacian matrix, we can recognize the important relation between the biological pathway of yeast proteome and the formalism of master equation. The results of our systematic and mathematical analysis agree well with the experimental findings of yeast proteome. The biological function and meaning of each protein cluster can be explained easily. Our rigorous analysis method is robust for understanding various kinds of networks whether they are biological, social, economical...etc

• Journal of The Korean Astronomical Society
• /
• v.44 no.5
• /
• pp.143-150
• /
• 2011

This paper reports a characteristic motion of a polarity inversion line (PIL) formed at the solar surface, which is newly found by performing a three-dimensional magnetohydrodynamic simulation of flux emergence in the Sun. A magnetic flux tube composed of twisted field lines is assumed to emerge below the surface, forming a bipolar region with a PIL at the surface. A key finding is the successive half-turn rotation of the PIL, leading to the formation of a quadrupolar-like region at the surface and a magnetic configuration in the corona; this configuration is reminiscent of, but essentially different from the so-called inverse-polarity configuration of a filament magnetic field. We discuss a physical mechanism for producing the half-turn rotation of a PIL, which gives new insights into the magnetic structure formed via flux emergence. This presents a reasonable explanation of the configuration of a filament magnetic field suggested by observations.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.12
• /
• pp.100-108
• /
• 2004

In reverse engineering, data acquisition methodology can generally be categorized into contacting and non-contacting types. Recently, researches on hybrid or sensor fusion of the two types have been increasing. In addition, efficient construction of a geometric model from the measurement data is required, where considerable amount of user interaction to classify and localize regions of interest is inevitable. Our research focuses on the classification of each bounded region into a pre-defined feature shape fer a hybrid measuring scheme, where the overall procedures are described as fellows. Firstly, the physical model is digitized by a non-contacting laser scanner which rapidly provides cloud-of-points data. Secondly, the overall digitized data are approximated to a z-map model. Each bounding curve of a region of interest (featured area) can be 1.aced out based on our previous research. Then each confined area is systematically classified into one of the pre-defined feature types such as floor, wall, strip or volume, followed by a more accurate measuring step via a contacting probe. Assigned to each feature is a specific digitizing path topology which may reflect its own geometric character. The research can play an important role in minimizing user interaction at the stage of digitizing path planning.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.4
• /
• pp.57-63
• /
• 2004

This paper describes a method for digitizing the compound surfaces which are comprised of several unknown feature shapes such as base surface, and draft wall. From the reverse engineering's point of view, the main step is to digitize or gather three-dimensional points on an object rapidly and precisely. As well known, the non-contact digitizing apparatus using a laser or structured light can rapidly obtain a great bulk of digitized points, while the touch or scanning probe gives higher accuracy by directly contacting its stylus onto the part surface. By combining those two methods, unknown features can be digitized efficiently. The paper proposes a digitizing methodology using the approximated surface model obtained from laser-scanned data, followed by the use of a scanning probe. Each surface boundary curve and the confining area is investigated to select the most suitable digitizing path topology, which is similar to generating NC tool-paths. The methodology was tested with a simple physical model whose shape is comprised of a base surface, draft walls and cavity volumes.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.3
• /
• pp.213-223
• /
• 2004

We consider the traffic grooming problem for the design of SONET/WDM(Synchronous Optical NETwork/Wavelength Division Multiplexing) ring networks. Given a physical network with ring topology and a set of traffic demands between pairs of nodes, we are to obtain a stack of rings with the objective of minimizing the number of ADMs installed at the nodes. This problem arises when a single ring capacity is not large enough to accommodate all the demands. As a solution method, an efficient algorithm based on the branch-and-price approach has been reported in the literature for the problem in which only unidirecional path switched ring (UPSR) was considered. In this study, we suggest integer programming models and the algorithms based on the same approach as the above one, considering two-fiber bidirectional line switched ring(BLSR/2), and BLSR/4 additionally. Using the results, we compare the number of required ADMs for all types of the ring architecture.