• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2012.04a
• /
• pp.929-932
• /
• 2012

Beat map shows the distribution property of the beating sound in the bell structure. Using the beat map, beat control and beat estimation are available. To draw the beat map, mode pair parameters of the bell are required. However, in case of large bell which is struck by a heavy wooden hammer, it is very difficult to measure the excitation force and to obtain the mode pair parameters. In this paper, we determined the mode pair parameters of the bell from the transmissibility between the roving signal and reference signal, using ODS(operational deflection shape) method. The mode pair data are input to the theoretical model of the beat response and beating waves are generated on the bell circumference. All the numerical and beat map drawing procedures are automatized using Matlab. Finally, the reliability of the beat map generated by the program is verified.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.9 no.2
• /
• pp.101-107
• /
• 2014

Mobile robots use an environment map of its workspace to complete the surveillance task. However grid-based maps that are commonly used map format for mobile robot navigation use a large size of memory for accurate representation of environment. In this reason, grid-based maps are not suitable for path planning of mobile robots using embedded board. In this paper, we present the path planning algorithm that produce a secure path rapidly. The proposed approach utilizes a hybrid map that uses less memory than grid map and has same efficiency of a topological map. Experimental results show that the fast path planning uses only 1.5% of the time that a grid map based path planning requires. And the results show a secure path for mobile robot.

• Microbiology and Biotechnology Letters
• /
• v.51 no.1
• /
• pp.26-31
• /
• 2023

A map gene encoding methionyl-specific aminopeptidase (MAP; EC 3.4.11.18) was cloned from Tetragenococcus halophilus CY54. Translated amino acid sequence of CY54 MAP showed high similarities with those from Enterococcus faecalis (83.8%) and Streptococcus salivarius (62.2%) but low similarities with MAPs from Lactobacillus and Lactococcus genera. The map gene was overexpressed in E. coli BL21(DE3) using pET26b(+),pET26b(+), and the recombinant MAP was purified by using an Ni-NTA column. The size of recombinant MAP was 29 kDa as determined by SDS-PAGE. The optimum pH and temperature of CY54 MAP were pH 5.0 and 60℃, respectively. The activity of CY54 MAP was most significantly increased by Co²⁺ ion (159%), and showed the highest activity at 12% NaCl. K_m and V_max were 0.64 ± 0.006 mM and 10.12 ± 0.014 U/mg protein, respectively when met-pNA was used as the substrate. This is the first report on a MAP from Tetragenococcus species.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.4
• /
• pp.89-96
• /
• 2012

A 3D map provides useful information for intelligent services. Traditional 3D maps, however, consist of a raw image data and are not suitable for real-time applications. In this paper, we propose the Block-based 3D map, that represents three dimensional spaces in a collection of square blocks. The Block_based 3D map has two major variables: an object ratio and a block size. The object ratio is defined as the proportion of object pixels to space pixels in a block and determines the type of the block. The block size is defined as the number of pixels of the side of a block and determines the size of the block. Experiments show the advantage of the Block-based 3D map in reducing noise, and in saving the amount of processing data. With the block size of $40{\times}40$ and the object ratio of 30% to 50% we can get the most matched Block-based 3D map for the $320{\times}240$ depthmap. The Block-based 3D map provides useful information, that can produce a variety of new services with high added value in intelligent environments.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.901-905
• /
• 2005

Monte Carlo localization is known to be one of the most reliable methods for pose estimation of a mobile robot. Much research has been done to improve performance of MCL so far. Although MCL is capable of estimating the robot pose even for a completely unknown initial pose in the known environment, it takes considerable time to give an initial estimate because the number of random samples is usually very large especially for a large-scale environment. For practical implementation of the MCL, therefore, a reduction in sample size is desirable. This paper presents a novel approach to reducing the number of samples used in the particle filter for efficient implementation of MCL. To this end, the topological information generated off- line using a thinning method, which is commonly used in image processing, is employed. The topological map is first created from the given grid map for the environment. The robot scans the local environment using a laser rangefinder and generates a local topological map. The robot then navigates only on this local topological edge, which is likely to be the same as the one obtained off- line from the given grid map. Random samples are drawn near the off-line topological edge instead of being taken with uniform distribution, since the robot traverses along the edge. In this way, the sample size required for MCL can be drastically reduced, thus leading to reduced initial operation time. Experimental results using the proposed method show that the number of samples can be reduced considerably, and the time required for robot pose estimation can also be substantially decreased.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.7
• /
• pp.693-699
• /
• 2006

An accurate and compact map is essential to an autonomous mobile robot system. For navigation, it is efficient to use an occupancy grid map because the environment is represented by probability distribution. But it is difficult to apply it to the large environment since it needs a large amount of memory proportional to the environment size. As an alternative, a topological map can be used to represent it in terms of the discrete nodes with edges connecting them. It is usually constructed by the Voronoi-like graphs, but in this paper the topological map is incrementally built based on the local grid map using the thinning algorithm. This algorithm can extract only meaningful topological information by using the C-obstacle concept in real-time and is robust to the environment change, because its underlying local grid map is constructed based on the Bayesian update formula. In this paper, the position probability is defined to evaluate the quantitative reliability of the end nodes of this thinning-based topological map (TTM). The global TTM can be constructed by merging each local TTM by matching the reliable end nodes determined by the position probability. It is shown that the proposed TTM can represent the environment accurately in real-time and it is readily extended to the global TTM.

• Transactions of Materials Processing
• /
• v.17 no.2
• /
• pp.117-123
• /
• 2008

In this study, optimum processing condition of rolled AZ31 Mg alloy was investigated by utilizing processing map and constitutive equation considering microstructure evolution(dynamic recrystallization) occurring during hot-working. A series of mechanical tests were conducted at various temperatures and strain rates to construct a processing map and to formulate the recrystallization kinetics in terms of grain size. Dynamic recrystallization(DRX) was observed to occur at a domain of $250^{\circ}C$ and 1/s(maximum dissipation-efficiency region). The effect of DRX kinetics on microstructure evolution was implemented in a commercial FEM code followed by remapping of the state variables. The volume fraction and grain size of deformed part were predicted using a modified FEM code and were compared with those of actual hot forged part. A good agreement was observed between the experimented results and predicted ones.

• Genomics & Informatics
• /
• v.4 no.2
• /
• pp.80-86
• /
• 2006

It is clear that the construction of large insert DNA libraries is important for map-based gene cloning, the assembly of physical maps, and simple screening for specific genomic sequences. The bacterial artificial chromosome (BAC) system is likely to be an important tool for map-based cloning of genes since BAC libraries can be constructed simply and analyzed more efficiently than yeast artificial chromosome (YAC) libraries. BACs have significantly expanded the size of fragments from eukaryotic genomes that can be cloned in Escherichia coli as plasmid molecules. To facilitate the isolation of molecular-biologically important genes in Ashbya gossypii, we constructed Ashbya chromosome-specific BAC libraries using pBeloBAC11 and pBACwich vectors with an average insert size of 100 kb, which is equivalent to 19.8X genomic coverage. pBACwich was developed to streamline map-based cloning by providing a tool to integrate large DNA fragments into specific sites in chromosomes. These chromosome-specific libraries have provided a useful tool for the further characterization of the Ashbya genome including positional cloning and genome sequencing.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.04a
• /
• pp.321-328
• /
• 2004

Since National Geographic Information System was started, topographic maps have been made with computer aided editing of digital map, instead of etching map-size negative film. topographic mapping system's necessity is growing more and more, because digital map has changed into Ver.2.0 which include attributes of feature. On the basis of the previous study for analyzing correlation between the digital map feature code and the 1/5,000 topographic map specifications and trying to develop fundamental modules which will play a core role in topographic mapping system, in this study, we apply some 1/5,000 digital maps Ver.2.0 to topographic mapping system have implemented and try to analyze the result.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.5
• /
• pp.511-518
• /
• 2015

As the cost-per-byte of SSDs dramatically decreases, the introduction of SSDs to Hadoop becomes an attractive choice for high performance data processing. In this paper the cost-per-performance of SSD-based Hadoop cluster (SSD-Hadoop) and HDD-based Hadoop cluster (HDD-Hadoop) are evaluated. For this, we propose a MapReduce performance model using queuing network to simulate the execution time of MapReduce job with varying cluster size. To achieve an accurate model, the execution time distribution of MapReduce job is carefully profiled. The developed model can precisely predict the execution time of MapReduce jobs with less than 7% difference for most cases. It is also found that SSD-Hadoop is 20% more cost efficient than HDD-Hadoop because SSD-Hadoop needs a smaller number of nodes than HDD-Hadoop to achieve a comparable performance, according to the results of simulation with varying the number of cluster nodes.