• Proceedings of the Korean Society for Applied Microbiology Conference
• /
• 2004.06a
• /
• pp.258-265
• /
• 2004

Numerous genes of Escherichia coli have been shown to growth phase-dependent expression throughout growth. The global patterns of growth phase-dependent gene expression of E. coli throughout growth using oligonucleotide microarrays containing a nearly complete set of 4,289 annotated open reading frames. To determine the change of gene expression throughout growth, we compared RNAs taken from timecourses with common reference RNA, which is combined with equal amount of RNA pooled from each time point. The hierarchical clustering of the conditions in accordance with timecourse expression revealed that growth phases were clustered into four classes, consistent with known physiological growth status. We analyzed the differences of expression levels at genome level in both exponential and stationary growth phase cultures. Statistical analysis showed that 213 genes are shown to, growth phase-dependent expression. We also analyzed the expression of 256 known operons and 208 regulatory genes. To assess the global impact of RpoS, we identified 193 genes coregulated with rpoS and their expression levels were examined in the isogenic rpoS mutant. The results revealed that 99 of 193 were novel RpoS-dependent stationary phase-induced genes and the majority of those are functionally unknown. Our data provide that global changes and adjustments of gene expression are coordinately regulated by growth transition in E. coli.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.117-126
• /
• 2011

Recently, AR applications provide location-based spatial information by GPS. Also, the spatial information is displayed by the angle of the camera. So far, traditional spatial indexes in spatial database field retrieve and filter spatial information by the minimum bounding rectangle (MBR) algorithm.(ex. R-tree) MBR strategy is a useful technique in the geographic information systems and location based services. But MBR technique doesn't reflect the characteristics of spatial queries in AR. Spatial queries of AR applications have high possibility of the dead space area between MBRs of non-leaf node and query area. We propose triangle node filtering algorithm that improved efficiency of spatial retrieval used the triangle node filtering techniques by exclusion the dead space. In this paper, the proposed algorithm has been implemented on PostgreSQL/PostGIS. Experimental results show the spatial retrieval that using the proposed algorithm better performance than the spatial retrieval that of the minimum bounding rectangle algorithm.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.147-156
• /
• 2006

Recently, streaming service accounts for large part of internet traffic and it is becoming the most popular service. Because of P2P's scalability, P2P-based streaming system is proposed. There are frequent leave and join of a node. To overcome the group dynamics, Multiple Multicast Trees Methods were suggested. However, since they did not consider discrepancy in peers' capacity, it may cause the trees to be long and unstable. So we suggest Resilient Capacity-Aware Multicast Tree construction scheme (R-CAT) that promotes superior peer to upper position in the tree and construct more stable and short multicast trees. By simulation we can show that R-CAT cost more overhead packets for tree joining process, but it reduce the end-to-end delay of the resulting tree and the number of packets lost during the node joining and leaving processes much more than SplitStream.

• The KIPS Transactions:PartD
• /
• v.8D no.2
• /
• pp.145-153
• /
• 2001

The Pyramid-Technique is based on mapping n-dimensional space data into one-dimensional data and expressing it as B-tree ; and by solving the problem of search time complexity the pyramid technique also prevents the effect \"phenomenon of dimensional curse\" which is caused by treatment of hypercube range query in n-dimensional data space. The Spherical Pyramid-Technique applies the pyramid method’s space division strategy, uses spherical range query and improves the search performance to make it suitable for similarity search. However, depending on the size of data and change in dimensions, the two above technique demonstrate significantly inferior search performance for data sizes greater than one million and dimensions greater than sixteen. In this paper, we propose a new index-structured PdR-Tree to improve the search performance for high dimensional data such as multimedia data. Test results using simulation data as well as real data demonstrate that PdR-Tree surpasses both the Pyramid-Technique and Spherical Pyramid-Technique in terms of search performance.

• Journal of Bio-Environment Control
• /
• v.17 no.4
• /
• pp.306-311
• /
• 2008

Proper tree vigor and crop load were determined for 'Fuji'/M.9 apple trees in high density planting system from 2001 to 2003. Leaf/fruit ratio was highly correlated to mean fruit weight (y=1.715x+205.02, $R^2=0.66^{**}$) and yield (y=-35.l56x+5963.7, $R^2=0.44^{**}$). In addition, there was a significant correlation between the number of leaves per tree and mean fruit weight. However, crop load did not affect tree growth, soluble solids content of fruit, and Hunter a value. To harvest the fruits heavier than 300 g without biennial bearing, it was appropriate to crop 55 to 64 fruits in a tree with 55 leaves per fruit of adult tree. The good indices for proper tree vigor could be 20 to 25 cm of mean shoot length and above 95% of shoot termination rate. Moreover, no secondary growth and 20 to 30% of spur formation could be the indices for highly productive tree vigor.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2294-2304
• /
• 1999

Our research purpose in this paper is to improve the performance of query processing in GIS(Geographic Information System) by enhancing the I/O performance exploiting parallel I/O and efficient disk access. By packing adjacent spatial data, which are very likely to be referenced concurrently, into one block or continuous disk blocks, the number of disk accesses and the disk access overhead for query processing can be decreased, and this eventually leads to the I/O time decrease. So, in this paper, we proposes EPR(Enhanced Parallel R-tree) indexing method which integrates the parallel I/O method of the previous Parallel R-tree method and a packing-based clustering method. The major characteristics of EPR method are as follows. First, EPR method arranges spatial data in the increasing order of proximity by using Hilbert space filling curve, and builds a packed R-tree by bottom-up manner. Second, with packing-based clustering in which arranged spatial data are clustered into continuous disk blocks, EPR method generates spatial data clusters. Third, EPR method distributes EPR index nodes and spatial data clusters on multiple disks through round-robin striping. Experimental results show that EPR method achieves up to 30% or more gains over PR method in query processing speed. In particular, the larger the size of disk blocks is and the smaller the size of spatial data objects is, the better the performance of query processing by EPR method is.

• Proceedings of the KIEE Conference
• /
• 1994.07b
• /
• pp.1550-1552
• /
• 1994

In order to investigate the effect of electrolyte solutions on the activities of bow-tie water trees in XLPE insulated power cable, we have tried to observe the characteristics on water treeing ( bow-tie type ) using several electrolyte solutions such as $CH_3COOH$, $MgCl_2$,HCl and NaCl solution and tap water. Bow-tie tree density in $CH_3COOH$ and $MgCl_2$ solution was higher than in any other solution, and the growth of tree was stimulated in NaCl and $CH_3COOH$ solution, and diffusion of bow-tie trees into insulation in $MgCl_2$, HCl and NaCl solutions was faster than in $CH_3COOH$ solution and water. Also, although the increase of applied voltage caused bow-tie tree density to be high, it didn't affect the growth of tree maximum length noticeably.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.1-10
• /
• 2009

One of major purposes of a RFID system is to track moving objects using tags attached to the objects. Because a tagged object has both location and time information expressed as the location of the reader, we can index the trajectory of the object like existing spatiotemporal objects. More efficient tracking may be possible if a spatiotemporal trajectory can be formed of a tag, but there has not been much research on tag trajectory indexes. A characteristic that distinguishes tags from existing spatiotemporal objects is that a tag creates a separate trajectory in each reader by entering and then leaving the reader. As a result, there is a trajectory interruption interval between readers, in which the tag cannot be located, and this makes it difficult to track the tag. In addition, the point tags that only enter and don't leave readers do not create trajectories, so cannot be tracked. To solve this problem, we propose a tag trajectory index called TR-tree (tag trajectory R-tree in RFID system) that can track a tag by combining separate trajectories among readers into one trajectory. The results show that TR-tree, which overcomes the trajectory interruption superior performance than TPIR-tree and R-tree.

• Journal of Information Processing Systems
• /
• v.14 no.2
• /
• pp.396-417
• /
• 2018

GR-tree and query aggregation techniques have been proposed for spatial query processing in conventional spatial query processing for wireless sensor networks. Although these spatial query processing techniques consider spatial query optimization, time query optimization is not taken into consideration. The index reorganization cost and communication cost for the parent sensor nodes increase the energy consumption that is required to ensure the most efficient operation in the wireless sensor node. This paper proposes itinerary-based R-tree (IR-tree) for more efficient spatial-temporal query processing in wireless sensor networks. This paper analyzes the performance of previous studies and IR-tree, which are the conventional spatial query processing techniques, with regard to the accuracy, energy consumption, and query processing time of the query results using the wireless sensor data with Uniform, Gauss, and Skew distributions. This paper proves the superiority of the proposed IR-tree-based space-time indexing.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.8-23
• /
• 2008

The purpose of this study is to develop a Cross Impact System Alternatives Tree(CISAT) model necessary for selecting the interdependent R&D planning system alternatives. This model modifies System Alternatives Tree(SAT) model developed by Kwon et al.. The SAT model is composed of several functions necessary for the achievement of a final goal and several subsystems for satisfying each function. In case that the relationship of technology alternatives is interdependent, this model overlooked a relative importance derived from occurrence or nonoccurrence of the technology alternatives in the future time varience. However, a complex evaluation process within the ballot system is another disadvantage of the SAT. To solve such problems, the Cross Impact Analysis(CIA) model is applied in the SAT model so as to consider the cross impact among interdependent system alternatives.