• Molecules and Cells
• /
• v.40 no.3
• /
• pp.230-242
• /
• 2017

In the Arabidopsis genome, approximately 80 MAP3Ks (mitogen-activated protein kinase kinase kinases) have been identified. However, only a few of them have been characterized, and the functions of most MAP3Ks are largely unknown. In this paper, we report the function of MAP3K16 and several other MAP3Ks, MAP3K14/15/17/18, whose expression is salt-inducible. We prepared MAP3K16 overexpression (OX) lines and analyzed their phenotypes. The result showed that the transgenic plants were ABA-insensitive during seed germination and cotyledon greening stage but their root growth was ABA-hypersensitive. The OX lines were more susceptible to water-deficit condition at later growth stage in soil. A MAP3K16 knockout (KO) line, on the other hand, exhibited opposite phenotypes. In similar transgenic analyses, we found that MAP3K14/15/17/18 OX and KO lines displayed similar phenotypes to those of MA3K16, suggesting the functional redundancy among them. MAP3K16 possesses in vitro kinase activity, and we carried out two-hybrid analyses to identify MAP3K16 substrates. Our results indicate that MAP3K16 interacts with MKK3 and the negative regulator of ABA response, ABR1, in yeast. Furthermore, MAP3K16 recombinant protein could phosphorylate MKK3 and ABR1, suggesting that they might be MAP3K16 substrates. Collectively, our results demonstrate that MAP3K16 and MAP3K14/15/17/18 are involved in ABA response, playing negative or positive roles depending on developmental stage and that MAP3K16 may function via MKK3 and ABR1.

• Asian-Australasian Journal of Animal Sciences
• /
• v.27 no.8
• /
• pp.1157-1163
• /
• 2014

This study was conducted to observe the effects of gas composition in modified atmosphere packaging (MAP) on the shelf-life of Longissimus dorsi of Korean Native Black Pigs-Duroc Crossbred ($KNP{\times}D$) during refrigerated storage. Muscle sample was obtained from the left side of carcass of seven months old of $KNP{\times}D$ barrow. The sample was sliced into 1 cm in thickness, placed on trays (two slices/tray) and filled with different gas composition, i.e. 0:20:80/$O_2:CO_2:N_2$ (MAP1), 30:20:50/$O_2:CO_2:N_2$ (MAP2) and 70:20:10/$O_2:CO_2:N_2$ (MAP3). Other slices of sample were vacuum packed (VP) as a control. All packs were stored at $5{\pm}1^{\circ}C$. At 12 d of storage, pH value of MAP2 and MAP3 were higher (p<0.05) than that of MAP1 and pH value of MAP1 was higher (p<0.05) than that of VP. At 6 d of storage, redness ($a^*$) value of MAP2 and MAP3 were higher (p<0.05) than that of VP and MAP1 and, at 9 and 12 d of storage, redness value of MAP3 was higher (p<0.05) than that of VP, MAP1, and MAP2. At 3, 6, 9, and 12 d of storage, the 2- thiobarbituric acid reactive substances (TBARS) value of MAP3 was higher than that of MAP2 and TBARS value of MAP2 was higher than that of VP and MAP1. At 3, 6, 9, and 12 d of storage, volatile basic nitrogen values of MAP2 and MAP3 were higher (p<0.05) than those of VP and MAP1. At 3 d of storage, total aerobic plate counts of MAP2 and MAP3 were higher (p<0.05) than those of VP and MAP1 and, at 6 d of storage, total aerobic plate counts of MAP3 was higher (p<0.05) than that of MAP1 and MAP2. However, there was no significant different total aerobic plate count among MAP1, MAP2, and MAP3 at 9 and 12 d of storage. There was no significant different total anaerobic plate count among MAP1, MAP2, and MAP3 during storage. It is concluded that the MAP containing 30:20:50/$O_2:CO_2:N_2$ gas composition (MAP2) might be ideal for better meat quality for $KNP{\times}D$ meat.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.65-68
• /
• 2007

DOCSIS 3.0 MAC protocol regulate CM and CMTS Channel transfer times through MAP message. Standards does not include the details of MAP Inter-arrival Time affecting the performance of MAC protocols for DOCSIS 3.0. In this paper, we evaluationed the performance of protocol follow in MAP Inter-arrival Time on DOCSIS 3.0. Based on the evaluation results, we propose the optimal MAP Inter-arrival Time. We found that the protocol shows best performance when the MAP Inter-arrival Time is 0.05sec. The research results can apply to performance element which important for the construction of DOCSIS 3.0 base cable networks.

• Journal of Advanced Navigation Technology
• /
• v.13 no.1
• /
• pp.142-150
• /
• 2009

It is very important to generate a simplified model from a complex 3D character in computer game. We propose a new method of extracting feature lines from a 3D game character. Given an unstructured 3D character model containing texture information, we use model feature map (MFM), which is a 2D map that abstracts the variation of texture and curvature in the 3D character model. The MFM is created from both a texture map and a curvature map, which are produced separately by edge-detection to locate line features. The MFM can be edited interactively using standard image-processing tools. We demonstrate the technique on several data sets, including, but not limited to facial character.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.914-916
• /
• 2003

Most current 3D digital maps are 2.5 dimension models based on DEM, which can only be recognized, browsed and operated by a special software, far from meeting the needs of a modern digital city (global) with the distributed, isomerous and multiple application on the real 3D representation and open sharing models. In this paper, a new generation digital city oriented 3D digital map is studied. Firstly, a real 3D digital map representation is presented. And then, some key techniques and methods for browser-based 3D digital map’s representation, display and operation are introduced, which can realized the open sharing of 3D map in distributed, isomerous and multiple application environment. Furthermore, the scale driving technique of proposed 3D digital map is also studied. And currently, some developments based on some of the above methods are being carried to provide key and general platform for other application software’s development.

• The Pure and Applied Mathematics
• /
• v.5 no.1
• /
• pp.55-63
• /
• 1998

A Gauss map of m-dimensional distribution on a Riemannian manifold M is called a harmonic Gauss map if it is a harmonic map from the manifold into its Grassmann bundle $G_m$(TM) of m-dimensional tangent subspace. We calculate the tension field of the Gauss map of m-dimensional distribution and especially show that the Hopf fibrations on $S^{4n＋3}$ are the harmonic Gauss map of 3-dimensional distribution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2175-2190
• /
• 2011

This paper presents the effects of depth map quantization for multiview intermediate image generation using depth image-based rendering (DIBR). DIBR synthesizes multiple virtual views of a 3D scene from a 2D image and its associated depth map. However, it needs precise depth information in order to generate reliable and accurate intermediate view images for use in multiview 3D display systems. Previous work has extensively studied the pre-processing of the depth map, but little is known about depth map quantization. In this paper, we conduct an experiment to estimate the depth map quantization that affords acceptable image quality to generate DIBR-based multiview intermediate images. The experiment uses computer-generated 3D scenes, in which the multiview images captured directly from the scene are compared to the multiview intermediate images constructed by DIBR with a number of quantized depth maps. The results showed that there was no significant effect on depth map quantization from 16-bit to 7-bit (and more specifically 96-scale) on DIBR. Hence, a depth map above 7-bit is needed to maintain sufficient image quality for a DIBR-based multiview 3D system.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.9
• /
• pp.745-752
• /
• 2016

We suggest an efficient Simultaneous Localization and 3D Polygon Map Building (SLAM) method with Kinect depth sensor for mobile robots in indoor environments. In this method, Kinect depth data is separated into row planes so that scan line segments are on each row plane. After grouping all scan line segments from all row planes into line groups, a set of 3D Scan polygons are fitted from each line group. A map matching algorithm then figures out pairs of scan polygons and existing map polygons in 3D, and localization is performed to record correct pose of the mobile robot. For 3D map-building, each 3D map polygon is created or updated by merging each matched 3D scan polygon, which considers scan and map edges efficiently. The validity of the proposed 3D SLAM algorithm is revealed via experiments.

• Honam Mathematical Journal
• /
• v.38 no.3
• /
• pp.625-642
• /
• 2016

The recent papers [7, 12] developed two maps named by an LA- [7] and an LMA-map [12]. The present paper studies their properties and further, develops generalized versions of an LA- and an LMA-map, which makes the LA- [7] and the LMA-map [12] improved.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.537-545
• /
• 2005

The aim of this paper is to solve the open problem on product properties of digital covering maps raised from [5]. Namely, let us consider the digital images $X_1 {\subset}Z^{n_{0}}$ with $k_0-adjacency$, $Y_1{\subset}Z^{n_{1}}$ with $k_3-adjacency$, $X_2{\subset}Z^{n_{2}}$ with $k_2-adjacency$ and $Y_2{\subset}Z^{n_{3}}$ with $k_3-adjacency$. Then the reasonable $k_4-adjacency$ of the product image $X_1{\times}X_2$ is determined by the $k_0-$ and $k_2-adjacency$ and the suitable k_5-adjacency$ is assumed on $Y_1{\times}Y_2$ via the $k_1-$ and $k_3-adjacency$ [3] such that each of the projection maps is a digitally continuous map, e.g., $p_1\;:\;X_1{\times}X_2{\rightarrow}X_1$ is a digitally ($k_4,\;k_1$)-continuous map and so on. Let us assume $h_1\;:\;X_1{\rightarrow}Y_1$ to be a digital $(k_0, k_1)$-covering map and $h_2\;:\;X_2{\rightarrow}Y_2$ to be a digital $(k_2,\;k_3)$-covering map. Then we show that the product map $h_1{\times}h_2\;:\;X_1{\times}X_2{\rightarrow}Y_1{\times}Y_2$ need not be a digital $(k_4,k_5)$-covering map.