• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.733-738
• /
• 2008

Serial Music, introduced by A. Sch nberg, is a one of the important composition techniques. This music style has features of pantonality and atonality, so it generates unique atmosphere of modern music. In this paper, we introduce an method of generating serial music using mathematical algorithm. This method generates music that satisfy the requirement that the number of pitches belonged to each pitch class are exactly same, though the requirement is less strict than Sch nberg's definition. To do this, our method uses space-filling curves traversing the twelve tone matrix, which is constructed by the serial series, its inversion and its transpose. Using these curves, we can generate a music that has all notes in the matrix exactly once and adequate repeatness because of the curve's locality. Result music, therefore, can be more suitable for people that are not familiar with modern music, while maintaining the features of pantonality and atonality. This paper also introduces a method of generating extended serial music that uses serialism of duration and dynamic of notes, using multi-dimensional space-filling curves.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.13-38
• /
• 2006

Range query is one of the most important operations for spatial objects, it retrieves all spatial objects that overlap a given query region in multi-dimensional space. The DOT(DOuble Transformation) is known as an efficient indexing methods, it transforms the MBR of a spatial object into a single numeric value using a space filling curve, and stores the value in a $B^+$-tree. The DOT index is possible to be employed as a primary index for spatial objects. However, the range query processing based on the DOT index requires much overhead for spatial transformations to get the query region in the final space. Also, the detailed range query processing method for 2-dimensional spatial objects has not been studied yet in this paper, we propose an efficient multi-dimensional range query processing technique based on the DOT index. The proposed technique exploits the regularities in the moving patterns of space filling curves to divide a query region into a set of maximal sub-legions within which space filling curves traverse without interruption. Such division reduces the number of spatial transformations required to perform the range query and thus improves the performance of range query processing. A visual simulator is developed to show the evaluation method and the performance of our technique.

• Bulletin of the Korean Space Science Society
• /
• 1992.10a
• /
• pp.15-15
• /
• 1992

AQ Cassiopeiae (BD+61`0242, uv=10, Sp=B3+Bg) is a totally eclipsing binary system with the obital period of about 12 days. 71 was observed for 15 nights in 1985 with the1.8-m telescope at the DAO, employing a Reticon and a three-stage image tube attached to the spectrograph. And also, photometric observations of AQ Cas had been made inUBv for six years from 1982 to 1988 at Yonsei University Observatory(YUO). This work includes UBV observations obtained at YUO as a part of The Ten-Year Observing Program(1982-1992). Double lined radial, velocity curves and Ufv light curves of AQC as are constructed. The light curves and radial velocity curves show a strong evidence of circumstellar matter or mass stream. It is clear at the phases of just outside externaleclipse contacts, particularly at phase 0.8-0.9, shown in Figures 1 and 2. A solution by combining the radial velocity and photometric curves of the binary was obtained with the Wilson-Devinney Code. We found that the system is semi-detached with the coolcomponent filling its Roche lobe. The absolute dimensions of AQ Cas are calculated. The result shows that this system consists of two massive and subgiant stars.

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

In this paper, we prove that infinite-dimensional vector spaces of -dense curves are generated by means of the functional equations f(x)+f(2x)+${\cdots}$+f(nx) = 0, with $n{\geq}2$, which are related to the partial sums of the Riemann zeta function. These curves ${\alpha}$-densify a large class of compact sets of the plane for arbitrary small ${\alpha}$, extending the known result that this holds for the cases n = 2, 3. Finally, we prove the existence of a family of solutions of such functional equation which has the property of quadrature in the compact that densifies, that is, the product of the length of the curve by the $n^{th}$ power of the density approaches the Jordan content of the compact set which the curve densifies.

• The Bulletin of The Korean Astronomical Society
• /
• v.43 no.2
• /
• pp.60-60
• /
• 2018

It has been known that XZ CMi is a near-contact binary composed of a hotter and more massive main-sequence primary star close to its Roche-lobe and a Roche-lobe filling giant/subgiant secondary star. There still exist, however, many discordant matters among the previous investigators: diverse mass ratios and temperatures ranging from 0.38 to 0.83 and from 7,000 K to 8,876 K, respectively. In order to make a contribution to the two confusions we conducted spectroscopic and photometric observations. A total of 34 high-resolution spectra were obtained during 4 nights from 2010 and 2018 with the Bohyunsan Optical Echelle Spectrograph (BOES) at the Bohyunsan Optical Astronomy Observatory (BOAO). In parallel, BVRI multi-band photometric observations were carried out 5 nights in 2010 at Sobaeksan Optical Astronomy Observatory (SOAO). In this presentation, we present physical parameters of XZ CMi through the simultaneous analyses of new double-lined radial velocity curves and new light curves. We will also briefly discuss the evolutionary status of the system.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.420-436
• /
• 2007

The choice of an effective indexing method is crucial to guarantee the performance of the spatial join operator which is heavily used in geographical information systems. The $R^*$-tree based method is renowned as one of the most representative indexing methods. In this paper, we propose an efficient spatial join technique based on the DOT(Double Transformation) index, and compare it with the spatial Join technique based on the $R^*$-tree index. The DOT index transforms the MBR of an spatial object into a single numeric value using a space filling curve, and builds the $B^+$-tree from a set of numeric values transformed as such. The DOT index is possible to be employed as a primary index for spatial objects. The proposed spatial join technique exploits the regularities in the moving patterns of space filling curves to divide a query region into a set of maximal sub-regions within which space filling curves traverse without interruption. Such division reduces the number of spatial transformations required to perform the spatial join and thus improves the performance of join processing. The experiments with the data sets of various distributions and sizes revealed that the proposed join technique is up to three times faster than the spatial join method based on the $R^*$-tree index.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.345-361
• /
• 2005

A transform-space index indexes objects represented as points in the transform space An advantage of a transform-space index is that optimization of join algorithms using these indexes becomes relatively simple. However, the disadvantage is that these algorithms cannot be applied to original-space indexes such as the R-tree. As a way of overcoming this disadvantages, the authors earlier proposed the transform-space view join algorithm that joins two original- space indexes in the transform space through the notion of the transform-space view. A transform-space view is a virtual transform-space index that allows us to perform join in the transform space using original-space indexes. In a transform-space view join algorithm, the order of accessing disk pages -for which various space filling curves could be used -makes a significant impact on the performance of joins. In this paper, we Propose a new space filling curve called the adaptive row major order (ARM order). The ARM order adaptively controls the order of accessing pages and significantly reduces the one-pass buffer size (the minimum buffer size required for guaranteeing one disk access per page) and the number of disk accesses for a given buffer size. Through analysis and experiments, we verify the excellence of the ARM order when used with the transform-space view join. The transform-space view join with the ARM order always outperforms existing ones in terms of both measures used: the one-pass buffer size and the number of disk accesses for a given buffer size. Compared to other conventional space filling curves used with the transform-space view join, it reduces the one-pass buffer size by up to 21.3 times and the number of disk accesses by up to $74.6\%$. In addition, compared to existing spatial join algorithms that use R-trees in the original space, it reduces the one-pass buffer size by up to 15.7 times and the number of disk accesses by up to $65.3\%$.

• Journal of Astronomy and Space Sciences
• /
• v.20 no.4
• /
• pp.239-248
• /
• 2003

We completed the light curves of near-contact binary system AX Dra for 11 nights from March 2001 to May using the 61-cm reflector and VR filters at Sobaeksan Optical Astronomy Observatory. From our observations, seven new times of minimum light (three timings to. primary eclipse, four. for. secondary) and the light elements consistent with recent observations were determined. Using the Wilson-Devinney binary code and the q-search method, we analyzed our VR light curves for various Roche configurations and mass ratios. As the results, we found the eclipsing binary AX Dra to be the FO Vir-type near-contact binary system interpreted as a detached or a semi-detached system, with the secondary filling its Roche lobe and the primary almost. Unlike the statistical study(Shaw 1994) of the FO Vir-type near-contact binary system, our VR light curves showed the O'Connell effect of all the same type and it's dimensions was about $0^{m}.008$.

• Journal of Astronomy and Space Sciences
• /
• v.16 no.2
• /
• pp.217-266
• /
• 1999

The light curves of the representative 6 contact binary stars observed by OGLE Project of searching for dark matter in our Galaxy have been analyzed by the method of the Wilson and Devinney Differential Correction to find photometric solutions. The orbital inclinations of these Devinney Differential Correction to find photometric solutions. The orbital inclinations of these binaries are in the range of $52^{circ}-69^{\circ}$ which is lower than that of the solar neighborhood binaries. The Roche lobe filling factor of these binaries are distributed in large range of 0.12 - 0.90. Since absence of spectroscopic observations for these binaries we have found masses of the 6 binary systems based on the intersection between Kepler locus and locus derived from Vandenberg isochrones in the mass - luminosity plane. Then absolute dimensions and distances have been found by combining the masses and the photometric solutions. The distances of the 6 binary systems are distributed in the range of 1 kpc- 6 kpc. This distance range is the limiting range where the contact binaries which have period shorter than a day are visible. Most contact binaries discovered in the Baade window do not belong to the Galactic bulge.

• Journal of Information Technology and Architecture
• /
• v.10 no.1
• /
• pp.79-91
• /
• 2013

This paper proposes a systematic methodology that could be used to decide which one shows the best performance among space filling curves (SFCs) in applying lower-dimensional transformations to histogram sequences. A histogram sequence represents a time-series converted from an image by the given SFC. Due to the high-dimensionality nature, histogram sequences are very difficult to be stored and searched in their original form. To solve this problem, we generally use lower-dimensional transformations, which produce lower bounds among high dimensional sequences, but the tightness of those lower-bounds is highly affected by the types of SFC. In this paper, we attack a challenging problem of evaluating which SFC shows the better performance when we apply the lower-dimensional transformation to histogram sequences. For this, we first present a concept of spatial locality, which comes from an intuition of "if the entries are adjacent in a histogram sequence, their corresponding cells should also be adjacent in its original image." We also propose spatial locality preservation metric (slpm in short) that quantitatively evaluates spatial locality and present its formal computation method. We then evaluate five SFCs from the perspective of slpm and verify that this evaluation result concurs with the performance evaluation of lower-dimensional transformations in real image matching. Finally, we perform k-NN (k-nearest neighbors) search based on lower-dimensional transformations and validate accuracy of the proposed slpm by providing that the Hilbert-order with the highest slpm also shows the best performance in k-NN search.