• Journal of Astronomy and Space Sciences
• /
• v.37 no.4
• /
• pp.237-247
• /
• 2020

The ground tracking support is a critical factor for the navigation performance of spacecraft orbiting around the Moon. Because of the tracking limit of antennas, only a small number of facilities can support lunar missions. Therefore, case studies for various ground tracking support conditions are needed for lunar missions on the stage of preliminary mission analysis. This study analyzes the ground supporting condition effect on orbit determination (OD) of Korea Pathfinder Lunar Orbiter (KPLO) in the lunar orbit. For the assumption of ground support conditions, daily tracking frequency, cut-off angle for low elevation, tracking measurement accuracy, and tracking failure situations were considered. Two antennas of deep space network (DSN) and Korea Deep Space Antenna (KDSA) are utilized for various tracking conditions configuration. For the investigation of the daily tracking frequency effect, three cases (full support, DSN 4 pass/day and KDSA 4 pass/day, and DSN 2 pass/day and KDSA 2 pass/day) are prepared. For the elevation cut-off angle effect, two situations, which are 5 deg and 10 deg, are assumed. Three cases (0%, 30%, and 50% of degradation) were considered for the tracking measurement accuracy effect. Three cases such as no missing, 1-day KDSA missing, and 2-day KDSA missing are assumed for tracking failure effect. For OD, a sequential estimation algorithm was used, and for the OD performance evaluation, position uncertainty, position differences between true and estimated orbits, and orbit overlap precision according to various ground supporting conditions were investigated. Orbit prediction accuracy variations due to ground tracking conditions were also demonstrated. This study provides a guideline for selecting ground tracking support levels and preparing a backup plan for the KPLO lunar mission phase.

• Journal of the Korean Physical Society
• /
• v.73 no.9
• /
• pp.1393-1398
• /
• 2018

In conventional single-photon emission computed tomography (SPECT), only the photoelectric events in the detectors are used for image reconstruction. However, if the $^{131}I$ isotope, which emits high-energy radiations (364, 637, and 723 keV), is used in nuclear medicine, both photoelectric and Compton scattering events can be used for image reconstruction. The purpose of our work is to perform simulations for Compton SPECT by using the Geant4 application for tomographic emission (GATE). The performance of Compton SPECT is evaluated and compared with that of conventional SPECT. The Compton SPECT unit has an area of $12cm{\times}12cm$ with four gantry heads. Each head is composed of a 2-cm tungsten collimator and a $40{\times}40$ array of CdZnTe (CZT) crystals with a $3{\times}3mm^2$ area and a 6-mm thickness. Compton SPECT can use not only the photoelectric effect but also the Compton scattering effect for image reconstruction. The correct sequential order of the interactions used for image reconstruction is determined using the angular resolution measurement (ARM) method and the energies deposited in each detector. In all the results of simulations using spherical volume sources of various diameters, the reconstructed images of Compton SPECT show higher signal-to-noise ratios (SNRs) without degradation of the image resolution when compared to those of conventional SPECT because the effective count for image reconstruction is higher. For a Derenzo-like phantom, the reconstructed images for different modalities are compared by visual inspection and by using their projected histograms in the X-direction of the reconstructed images.

• Korean Journal of Food Science and Technology
• /
• v.29 no.6
• /
• pp.1105-1112
• /
• 1997

By sequential degradation using partial acid hydrolysis of a weakly acidic polysaccharide (GL-4IIb2'), two acidic oligosaccharide fragments, PA-2' and PA-1-III were isolated and their structures were characterized. PA-2' consisted of almost equal proportion of a rhamnose (Rha) and an unusual sugar, 3-deoxy-D-manno-2-octurosonic acid (Kdo). When permethylated oligosaccharide-alditol derived from PA-2' was analyzed by GC-MS, the peak gave the fragment ions at m/z 189 $(bA_1,\;6-deoxyhexose)$ and at m/z 308 $(aJ_2,\;alditol\;from\;Kdo)$. The peak also gave the characteristic ion at m/z 162 but it did not give the fragment ion at m/z 177, suggesting that Kdo is substituted at C5 but not at C4. Methylation analysis also indicated that PA-2' was composed mainly of terminal Rhap and 5-substituted Kdo. When the reduced product from PA-2' was analyzed by $^1H-NMR$, it gave a signal at 5.09 ppm due to an anomeric proton of ${\alpha}-L-Rha$. These results indicated that PA-2' mainly contained ${\alpha}-L-Rhap-(1{\rightarrow}5)-Kdo$. On the other hand, PA-1-III mainly comprised Rha and Kdo in addition to small proportions of arabinose (Ara) and 3-deoxy-D-lyxo-2-heptulosaric acid (Dha). MS analysis of permethylated oligosaccharide-alditols from PA-1-III suggested that the major peak 1P was $Rhap-(1{\rightarrow}5)-Kdo$ whereas the minor peaks 2P and 3P possessed $Araf-(1{\rightarrow}5)-Dha$ unit and these peaks were produced as epimers during reduction of carbonyl groups in Dha.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.42-55
• /
• 2006

We propose a single Index approach for subsequence matching that supports moving average transform of arbitrary order in time-series databases. Using the single index approach, we can reduce both storage space overhead and index maintenance overhead. Moving average transform is known to reduce the effect of noise and has been used in many areas such as econometrics since it is useful in finding overall trends. However, the previous research results have a problem of occurring index overhead both in storage space and in update maintenance since tile methods build several indexes to support arbitrary orders. In this paper, we first propose the concept of poly-order moving average transform, which uses a set of order values rather than one order value, by extending the original definition of moving average transform. That is, the poly-order transform makes a set of transformed windows from each original window since it transforms each window not for just one order value but for a set of order values. We then present theorems to formally prove the correctness of the poly-order transform based subsequence matching methods. Moreover, we propose two different subsequence matching methods supporting moving average transform of arbitrary order by applying the poly-order transform to the previous subsequence matching methods. Experimental results show that, for all the cases, the proposed methods improve performance significantly over the sequential scan. For real stock data, the proposed methods improve average performance by 22.4${\~}$33.8 times over the sequential scan. And, when comparing with the cases of building each index for all moving average orders, the proposed methods reduce the storage space required for indexes significantly by sacrificing only a little performance degradation(when we use 7 orders, the methods reduce the space by up to 1/7.0 while the performance degradation is only $9\%{\~}42\%$ on the average). In addition to the superiority in performance, index space, and index maintenance, the proposed methods have an advantage of being generalized to many sorts of other transforms including moving average transform. Therefore, we believe that our work can be widely and practically used in many sort of transform based subsequence matching methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.6
• /
• pp.445-452
• /
• 2019

In this study, parallel processing codes of k-means clustering algorithm were developed and implemented in a PC-cluster for unsupervised classification of large satellite images. We implemented intra-node code using multicores of CPU (Central Processing Unit) based on OpenMP (Open Multi-Processing), inter-nodes code using a PC-cluster based on message passing interface, and hybrid code using both. The PC-cluster consists of one master node and eight slave nodes, and each node is equipped with eight multicores. Two operating systems, Microsoft Windows and Canonical Ubuntu, were installed in the PC-cluster in turn and tested to compare parallel processing performance. Two multispectral satellite images were tested, which are a medium-capacity LANDSAT 8 OLI (Operational Land Imager) image and a high-capacity Sentinel 2A image. To evaluate the performance of parallel processing, speedup and efficiency were measured. Overall, the speedup was over N / 2 and the efficiency was over 0.5. From the comparison of the two operating systems, the Ubuntu system showed two to three times faster performance. To confirm that the results of the sequential and parallel processing coincide with the other, the center value of each band and the number of classified pixels were compared, and result images were examined by pixel to pixel comparison. It was found that care should be taken to avoid false sharing of OpenMP in intra-node implementation. To process large satellite images in a PC-cluster, code and hardware should be designed to reduce performance degradation caused by file I / O. Also, it was found that performance can differ depending on the operating system installed in a PC-cluster.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.9 no.2
• /
• pp.73-82
• /
• 1989

When the flood occurs in the alluvial rivers, the rivers adjust to the flood by means of the mechanism of the river bed variations and its morphological changes to pass that safely, the numerical model was developed to simulate the process of the alluvial river bed variation due to flood wave and carried out by the flood routing for flood wave and the sediment routing for river bed variation. The flood wave, river bed variation, and bed material size distribution may be analysed and predicted by this model. The ability of this model to predict the process of river bed response was proved by the application to the reach from Paldang dam to Indogyo site. In view of the flood analysis considering the sediment process, the effects of river bed variation for the flood routing may be negligible because the river bed variation is smaller than the unsteady flow variation during the same period. By the application of this model, it is shown that, in occurring of sequential flood events, the variation of the river bed and bed material size distribution due to flood wave is more dependent on the first flood event than the latter flood events, and that the river bed variation in this reach of the downstream Han river is dependent on the degradation and the coarsening of bed materials.

• KIISE Transactions on Computing Practices
• /
• v.22 no.6
• /
• pp.284-289
• /
• 2016

In the Hadoop-based Big Data analysis model, the data movement between the legacy system and the analysis system is difficult to avoid. To overcome this problem, a unified Big Data file system is introduced so that a unified platform can support the legacy service as well as the analysis service. However, major challenges in avoiding the performance degradation problem due to the interference of two services remain. In order to solve this problem, we first performed a real-life simulation and observed resource utilization, workload characteristics and I/O balanced level. Based on this analysis, two solutions were proposed both for the system level and for the technical level. In the system level, we divide I/O path into the legacy I/O path and the analysis I/O path. In the technical level, we introduce an aggressive prefetch method for analysis service which requires the sequential read. Also, we introduce experimental results that shows the outstanding performance gain comparing the previous system.

• The KIPS Transactions:PartC
• /
• v.15C no.3
• /
• pp.149-156
• /
• 2008

JPEG2000 is the upcoming image coding standard that provides better compression rate and image quality compared with JPEG. Lazy-mode steganography guarantees the safe communication under the two information loss stages in JPEG2000. However, it causes the severe changes of the code-block noise variance sequence after embedding and that is detectable under the steganalysis using the Hilbert-Huang transform (HHT) based sequential analysis. In this paper, a JPEG2000 lazy-mode steganography method is presented. The code blocks which produce the sudden variation of the noise variance after embedding are estimated by calculating low precision code-block variance (LPV) and low precision code-block noise variance (LPNV). By avoiding those code-blocks from embedding, our algorithm preserves the sequence and makes stego images secure under the HHT-based steganalytic detection. In addition, it prevents a severe degradation of image quality by using JPEG2000 quality layer information. On various 2048 images, experiments are performed to show the effective reduction of the noise variation after message embedding and the stable performance against HHT-based steganalysis.

• Journal of Korean Ophthalmic Optics Society
• /
• v.20 no.1
• /
• pp.1-7
• /
• 2015

Purpose: For optimizing properties of final glasses frame, the aim of this study is to examine the correlation of processing conditions and properties of cellulose acetate (CA) sheets through the investigation of properties of CA sheets prepared under processing steps. Methods: The properties of CA sheets were investigated in terms of different glasses frame processing conditions, bending process, barrel process, and ultrasonic cleaning process. CA sheets prepared through the sequential processing were examined by various analysis: gloss, mechanical properties, thermal properties. Results: After barrel process, hardness and tensile strength of CA sheet were increased. However, bending strength and impact strength were decreased. It is suggested the CA sheet had became rather stiff state (brittle). Also, in degradation temperature region of plasticizer, about 3% of reduction in plasticizer weight was confirmed upon TGA analysis. Conclusions: Glasses frame process, especially in the barrel process have a profound influence on the properties of CA sheet owing to reduction of total amount of plasticizer.

• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.75-82
• /
• 2015

Major corporations and portals have implemented a link server that connects Content Management Systems (CMS) to the physical address of content in a database (DB) to support efficient content use in web-based environments. In particular, a link server automatically connects the physical address of content in a DB to the content URL shown through a web browser screen, and re-connects the URL and the physical address when either is modified. In recent years, the number of users of digital content over the web has increased significantly because of the advent of the Big Data environment, which has also increased the number of link validity checks that should be performed in a CMS and a link server. If the link validity check is performed through an existing URL-based sequential method instead of petabyte or even etabyte environments, the identification rate of dead links decreases because of the degradation of validity check performance; moreover, frequent link checks add a large amount of workload to the DB. Hence, this study is aimed at providing a link server that can recognize URL link deletion or addition through analysis on the B-tree-based Information Identifier count per interval based on a large amount of URLs in order to resolve the existing problems. Through this study, the dead link check that is faster and adds lower loads than the existing method can be performed.