• Molecules and Cells
• /
• v.20 no.2
• /
• pp.201-209
• /
• 2005

We have constructed an AFLP-based linkage map of Japanese red pine (Pinus densiflora Siebold et Zucc.) using haploid DNA samples of 96 megagametophytes from a single maternal tree, selection clone Kyungbuk 4. Twenty-eight primer pairs generated a total of 5,780 AFLP fragments. Five hundreds and thirteen fragments were verified as genetic markers with two alleles by their Mendelian segregation. At the linkage criteria LOD 4.0 and maximum recombination fraction 0.25(${\theta}$), a total of 152 markers constituted 25 framework maps for 19 major linkage groups. The maps spanned a total length of 2,341 cM with an average framework marker spacing of 18.4 cM. The estimated genome size was 2,662 cM. With an assumption of equal marker density, 82.2% of the estimated genome would be within 10 cM of one of the 230 linked markers, and 68.1% would be within 10 cM of one of the 152 framework markers. We evaluated map completeness in terms of LOD value, marker density, genome length, and map coverage. The resulting map will provide crucial information for future genomic studies of the Japanese red pine, in particular for QTL mapping of economically important breeding target traits.

• Investigative Magnetic Resonance Imaging
• /
• v.7 no.2
• /
• pp.116-123
• /
• 2003

Purpose : The present study was undertaken to evaluate the usefulness of cerebral diffusion (DWI) and perfusion MR imaging (PWI) in rabbit models with hyperacute cerebral ischemic infarction. Materials and Methods : Experimental cerebral infarction were induced by direct injection of mixture of Histoacryl glue, lipiodol, and tungsten powder into the internal cerebral artery of 6 New-Zealand white rabbits, and they underwent conventional T1 and T2 weighted MR imaging, DWI, and PWI within 1 hour after the occlusion of internal cerebral artery. The PWI scan for each rabbit was obtained at the level of lateral ventricle and 1cm cranial to the basal ganglia. By postprocessing using special imaging software, perfusion images including cerebral blood volume (CBV), cerebral blood flow (CBF), and mean transit time (MTT) maps were obtained. The detection of infarcted lesion were evaluated on both perfusion maps and DWI. MTT difference time were measured in the perfusion defect lesion and symmetric contralateral normal cerebral hemisphere. Results : In all rabbits, there was no abnormal signal intensity on T2WI. But on DWI, abnormal high signal intensity, suggesting cerebral infarction, were detected in all rabbits. PWI (rCBV, CBF and MTT map) also showed perfusion defect in all rabbits. In four rabbits, the calculated square of perfusion defect in MTT map is larger than that of CBF map and in two rabbits, the calculated size of perfusion defect in MTT map and CBF map is same. Any rabbits do not show larger perfusion defect on CBF map than MTT map. In comparison between CBF map and DWI, 3 rabbits show larger square of lesion on CBF map than on DWI. The others shows same square of lesion on both technique. The size of lesion shown in 6 MTT map were larger than DWI. In three cases, the size of lesion shown in CBF map is equal to DWI. But these were smaller than MTT map. The calculated square of lesion in CBF map, equal to that of DWI and smaller than MTT map was three. And in one case, the calculated square of perfusion defect in MTT map was largest, and that of DWI was smallest. Conclusion : DWI and PWI may be useful in diagnosing hyperacute cerebral ischemic infarction and in e-valuating the cerebral hemodynamics in the rabbits.

• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.507-517
• /
• 2003

Self-organizing map (SOM) has been developed mainly by T. Kohonen and his colleagues as a unsupervised learning neural network. Because of its topological ordering property, SOM is known to be very useful in pattern recognition and text information retrieval areas. Recently, data miners use Kohonen´s mapping method frequently in exploratory analyses of large data sets. One problem facing SOM builder is that there exists no sensible criterion for evaluating goodness-of-fit of the map at hand. In this short communication, we propose valid evaluation procedures for the Kohonen SOM of any size. The methods can be used in selecting the best map among several candidates.

• Journal of Microbiology
• /
• v.33 no.2
• /
• pp.149-153
• /
• 1995

Mitochondrial DNA has been isolated from Trimorphomyces papilionaceus. By analyzing DNA fragments digested by restriction enzymes, a restriction site map has been constructured. The mtDNA of T. papilionaceus amounts to 48.5 kb in size and is circular in structure. Entire mitochondrial DNA was cloned in E coli plasmids and Northern blot hybridization was done using cloned and subcloned DNAs as probes. Based on hybridization results of mitochondrial RNA transcripts, a transcription map was prepared.

• Journal of the Korean Ceramic Society
• /
• v.33 no.6
• /
• pp.718-724
• /
• 1996

Deformation mechanism map of Langdon-Mohammed type for YBa2Cu3O7-x superconducting ceramic was constructed by considering mechanisms of Nabarro-Herring Coble and powder-law creep and grain boundary sliding (GBS) with an accommodation by grain boundary diffusion. The map was found consistent with experi-mental results not only of the creep the also of the superplastic deformation. It showed the transition from interface reaction-controlled to the grain boundary diffusion-controlled GBS mechanism at about 1 ${\mu}{\textrm}{m}$ grain size and 100 MPa flow stress in agreement with the experimental results.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2729-2731
• /
• 2001

In this paper, we studied on the real-time environment map building for the mobile robot navigation using the stereo camera system. Distance measurement are necessary to build the environment map. We used a area-based stereo matching for the distance measurement with the stereo camera system. To reduce the computation time, we used DSP processor on the vision board, took a suitable area size for stereo matching, and used hierarchical search method. Using the fast acquired distance values, the environment map was built.

• Journal of Internet of Things and Convergence
• /
• v.1 no.1
• /
• pp.11-19
• /
• 2015

The mobile and ubiquitous environment is experiencing a rapid development of information and communications technology as it provides an ever increasing flow of information. Particularly, GIS is now widely applied in daily life due to its high accuracy and functionality. GIS information is utilized through the tiling method, which divides and manages large-scale map information. The tiling method manages map information and additional information to allow overlay, so as to facilitate quick access to tiled data. Unlike past studies, this paper proposes a new architecture and algorithms for tile searching and indexing management to optimize map information and additional information for GIS mobile applications. Since this involves the processing of large-scale information and continuous information changes, information is clustered for rapid processing. In addition, data size is minimized to overcome the constrained performance associated with mobile devices. Our system has been implemented in actual services, leading to a twofold increase in performance in terms of processing speed and mobile bandwidth.

• The Bulletin of The Korean Astronomical Society
• /
• v.44 no.2
• /
• pp.78.3-78.3
• /
• 2019

We develop a novel technique that can constrain the evolutionary track of the epoch of reionization (EoR) by applying the convolutional neural network (CNN) to the 21-cm differential brightness temperature. We use 21cmFAST, a fast semi-numerical cosmological 21-cm signal simulator, to produce mock 21-cm map between z=6-13. We design a CNN architecture that predicts the volume-averaged neutral hydrogen fraction from the given 21-cm map. The estimated neutral fraction has a good agreement with its truth value even after smoothing the 21-cm map with somewhat realistic choices of beam size and the frequency bandwidth of the Square Kilometre Array (SKA). Our technique could be further utilized to denoise the 21-cm map or constrain the properties of the radiation sources.

• Asian-Australasian Journal of Animal Sciences
• /
• v.19 no.12
• /
• pp.1702-1705
• /
• 2006

A simulation study was conducted to evaluate a fine-mapping method exploiting population-wide linkage disequilibrium. Data were simulated according to the pedigree structure based on a large paternal half-sib family population with a total of 1,034 or 2,068 progeny. Twenty autosomes of 100 cM were generated with 5 cM or 1 cM marker intervals for all founder individuals in the pedigree, and marker alleles and a number of quantitative trait loci (QTL) explaining a total of 70% phenotypic variance were generated and randomly assigned across the whole chromosomes, assuming linkage equilibrium between the markers. The founder chromosomes were then descended through the pedigree to the current offspring generation, including recombinants that were generated by recombination between adjacent markers. Power to detect QTL was high for the QTL with at least moderate size, which was more pronounced with larger sample size and denser marker map. However, sample size contributed much more significantly to power to detect QTL than map density to the precise estimate of QTL position. No QTL was detected on the test chromosomes in which QTL was not assigned, which did not allow detection of false positive QTL. For the multiple QTL that were closely located, the estimates of the QTL positions were biased, except when the QTL were located on the right marker positions. Our fine mapping simulation results indicate that construction of dense maps and large sample size is needed to increase power to detect QTL and mapping precision for QTL position.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.3
• /
• pp.609-619
• /
• 2016

RHadoop is a collection of R packages that allow users to manage and analyze data with Hadoop. In this paper, we implement K-Means algorithm based on MapReduce framework with RHadoop to make the clustering method applicable to large scale data. The main idea introduces a combiner as a function of our map output to decrease the amount of data needed to be processed by reducers. We showed that our K-Means algorithm using RHadoop with combiner was faster than regular algorithm without combiner as the size of data set increases. We also implemented Elbow method with MapReduce for finding the optimum number of clusters for K-Means clustering on large dataset. Comparison with our MapReduce implementation of Elbow method and classical kmeans() in R with small data showed similar results.