• Journal of the Korean Chemical Society
• /
• v.8 no.2
• /
• pp.68-74
• /
• 1964

Water has the melting point, the boiling point, the heat of fusion, and the heat of vaporization all much higher than would be normally expected from the hydrogen compounds of the other members of the oxygen family. Another unique characteristic of ice-Ⅰ is its volume decrease which takes place in its melting. A number of significant efforts have been made in the past to explain these properties quantitatively. The authors, reasoning from the unusually great free surface energy of water and the characteristic volume change on melting, propose the structural model of liquid water as follows. On melting, fluidized vacancies of a molecular size are introduced. Thereupon, for the unusually great surface energy density, molecules surrounding the vacancies become to have close packed arrangement. But molecules not in direct contact with vacancies should still possess the original structure i. e., ice-Ⅰ. When a molecule adjacent to a vacancy jumps into the vacancy, the molecule attains the gaslike degree of freedom. Using the above model, the authors had developed the liquid partition function of water by applying the theory of significant structures in liquids. Molar volume, vapor pressure, entropy of fusion and entropy of vaporization were calculated over a wide temperature range. The results show good agreement with experimental observations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.4
• /
• pp.65-69
• /
• 2019

This paper presents an optimized adoption of NVM for the storage system considering application characteristics. To do so, we first characterize the storage access patterns for different application types, and make two prominent observations that can be exploited in allocating NVM storage efficiently. The first observation is that a bulk of I/O does not happen on a single storage partition, but it is varied significantly for different application categories. Our second observation is that there exists a large proportion of single accessing in storage data. Based on these observations, we show that maximizing the storage performance with NVM is not obtained by fixing it as a specific storage partition but by allocating it adaptively for different applications. Specifically, for graph, database, and web applications, using NVM as a swap, a journal, and a file system partitions, respectively, performs well.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1011-1020
• /
• 2004

A lot of work has been done to improve the I/O performance of such a system that store and manage a massive amount of data by distributing them across multiple disks and access them in parallel. Most of the previous work has focused on an efficient mapping from a grid ceil, which is determined bY the interval number of each dimension, to a disk number on the assumption that each dimension is split into disjoint intervals such that entire data space is GRID-like partitioned. However, they have ignored the effects of a GRID partitioning scheme on declustering performance. In this paper, we enhance the performance of mapping function based declustering algorithms by applying a good GRID par-titioning method. For this, we propose an estimation model to count the number of grid cells intersected by a range query and apply a GRID partitioning scheme which minimizes query result size among the possible schemes. While it is common to do binary partition for high-dimensional data, we choose less number of dimensions than needed for binary partition and split several times along that dimensions so that we can reduce the number of grid cells touched by a query. Several experimental results show that the proposed estimation model gives accuracy within 0.5% error ratio regardless of query size and dimension. We can also improve the performance of declustering algorithm based on mapping function, called Kronecker Sequence, which has been known to be the best among the mapping functions for high-dimensional data, up to 23 times by applying an efficient GRID partitioning scheme.

• 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.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.9
• /
• pp.532-540
• /
• 2019

PET microfibers with various diameters (0.5, 0.2, 0.06, and 0.01 dpf) were dyed with a dispersed dye (C.I. Disperse Blue 56) at various temperatures. The dyeing process was conducted under infinite dyebath conditions at constant temperatures. The effects of the dyeing temperature and diameter on the partition coefficient, affinity, and diffusion coefficient of disperse dyes were studied. The curve of isotherms was fitted well to Nernst-type model in a large range of initial dye concentrations. At the same temperature, the partition coefficient and affinity decreased with increasing sample diameter due to the increase in surface area. At all deniers, the partition coefficient and affinity decreased with increasing temperature because the dyeing process is an exothermic reaction. In addition, the decrease in radius of the sample gives rise to a decrease in the heat of dyeing. The fine diameter of the sample resulted in an increased surface area but decreased space between the microfibers. Consequently, decreasing the diameter of the microfibers leads to a decrease in the diffusion coefficient. At the same diameter, the diffusion coefficient increased with increasing temperature because of rapid dye movement and the large free volume of the sample inside. In addition, thermal dependence of the diffusion coefficient increased when the diameter of the sample increased.

• Textile Coloration and Finishing
• /
• v.5 no.3
• /
• pp.182-187
• /
• 1993

The binding isotherms of Methylene Blue with Poly(vinyl pyrrolidone) (PVP) were determined in a Mcllvaine buffer of pH 8.0 at 3$0^{\circ}C$ by a dynamic dialysis methods. The isotherms showed a partition binding which was increase linearly with the increase of free dye concentration in solution. The Scatchard plots for Poly(vinyl pyrrolidone)-Methylene Blue gave a constant value. The results were interpreted by the McGhee and von Hippel theory considering non-cooperative binding. The intrinsic binding constant k, for Poly(vinyl pyrrolidone)-Methylene Blue was 6.02$\ell$/base mol.

• Journal of the Korean Institute of Educational Facilities
• /
• v.17 no.3
• /
• pp.13-20
• /
• 2010

Seattle Public School Authority implements Inclusive Education which allows handicapped children to study in ordinary schools. This research is to analyze Inclusive Education system and find characteristics of school network and school planning. Survey was performed on 9 school districts and 54 public schools. The found results are following; 1) 54 schools adopt special education programs and legal barrier free design. All handicapped children groups are divided into level I through Ⅳ including mild level (level I,II) at all schools and multi-handicapped(severe level, level III, IV) at schools specified by school district or Seattle City. 2) Each school groups are transformed into self-contained classroom, therapy room and general room as a set in consideration of user communication and special education program. Also, existing classrooms are rearranged into small study spaces by using partition system. It allows ordinary schools to accomodate Inclusive Education through school network, classroom rearrangement and space partitioning.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.1
• /
• pp.70-77
• /
• 2002

This paper describes a design driven approach to drive intelligent test plan generation based on adaptive use case (3,5). Its foundation is an object-oriented software design approach which partitions design schema into design architecture of functional components called “design component”. A use case software development methodology of adaptive use case approach developed in I.I .T is employed which preserves this unit architecture on through to the actual code structure. Based on the partition design schema produced during the design phase of this methodology, a test plan is generated which includes a set of component and scenario based test. A software metric is introduced which produces an ordering of this set to enhance productivity and both promote and capitalize on test case reusability, This paper contains an application that illustrates the proposed approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.165.2-165
• /
• 2001

A number of previous researches in evolutionary algorithm are based on the study of facets we observe in natural evolution. The individuals of species in natural evolution occupy their own niche that is a subdivision of the habitat. This means that two species with the similar requirements cannot live together in the same niche. This is known as the competitive exclusion principle, i.e., complete competitors cannot coexist. In this paper, a new evolutionary programming algorithm adopting this concept is presented. Similarly in the case of natural evolution , the algorithm Includes the concept of niche obtained by partitioning a search space and the competitive exclusion principle performed by migrating individuals. Cell partition and individual migration strategies are used to preserve search diversity as well as to speed up convergence of an ...

• Bulletin of the Korean Mathematical Society
• /
• v.40 no.1
• /
• pp.29-51
• /
• 2003

In this paper we construct a natural filtration associated to the plethysm $S_{r}(\wedge^2 \varphi)$ over arbitrary commutative ring R. Let $\phi$ : G longrightarrow F be a morphism of finite free R-modules. We construct the natural filtration of $S_{r}(\wedge^2 \varphi)$ as a $GL(F){\times}GL(G)$- complex such that its associated graded complex is ${\Sigma}_{{\lambda}{\in}{\Omega}_{\gamma}}=L_{2{\lambda}{\varphi}$, where ${{\Omega}_{\gamma}}^{-}$ is a set of partitions such that $│\wedge│\;=;{\gamma}\;and\;2{\wedge}$ is a partition of which i-th term is $2{\wedge}_{i}$. Specializing our result, we obtain the filtrations of $S_{r}(\wedge^2 F)\;and\;D_{r}(D_2G).