• Molecules and Cells
• /
• v.24 no.1
• /
• pp.27-36
• /
• 2007

The hypothetical protein TTC0263 of Thermus thermophilus HB27 is a thermophilic tetratricopeptide repeat (TPR)-containing protein. In the present study, the TPR region (residues 26-230) was resolved at $2.5{\AA}$ with R-factors of $R/R_{free}$ = 23.6%/28.6% $R/R_{free}=23.6%/28.6%$. TTC0263 consists of 11 helices that form five TPR units. Uniquely, it contains one atypical "extended" TPR (eTPR) unit. This comprises extended helical residues near the loop region of TTC0263, such that the helical length of eTPR is longer than that of the canonical TPR sequence. In addition, the hybrid TPR domain of TTC0263 possesses oligomer-forming characteristics. TPR domains are generally involved in forming multi-subunit complexes by interacting with each other or with other subunit proteins. The dynamic structure of TTC0263 described here goes some way to explaining how TPR domains mediate the formation of multi-subunit complexes.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.252-260
• /
• 2004

Recently, the TPR-tree has been proposed to support spatio-temporal queries for moving objects. Subsequently, various methods using the TPR-tree have been intensively studied. However, although the TPR-tree is one of the most popular access methods in spatio-temporal databases, any cost model for the TPR-tree has not yet been proposed. Existing cost models for the spatial index such as the R-tree do not accurately ostinato the number of disk accesses for spatio-temporal queries using the TPR-tree, because they do not consider the future locations of moving objects. In this paper, we propose a cost model of the TPR-tree for moving objects for the first time. Extensive experimental results show that our proposed method accurately estimates the number of disk accesses over various spatio-temporal queries.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.17-25
• /
• 2006

TPR*-tree is the most widely-used index structure for effectively predicting the future positions of moving objects. The TPR*-tree, however, has the problem that both of the dead space in a bounding region and the overlap among hounding legions become larger as the prediction time in the future gets farther. This makes more nodes within the TPR*-tree accessed in query processing time, which incurs the performance degradation. In this paper, we examine the performance problem quantitatively with a series of experiments. First, we show how the performance deteriorates as a prediction time gets farther, and also show how the updates of positions of moving objects alleviates this problem. Our contribution would help provide Important clues to devise strategies improving the performance of TPR*-trees further.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.22 no.2
• /
• pp.266-277
• /
• 2019

In modern warfare, securing time for preemptive response is recognized as an important factor of victory. The naval combat system, the core of naval forces, also strives to increase the effectiveness of engagement by improving its real-time information processing capabilities. As part of that, it is considered to use the TPR-tree in the naval combat system's target indexing because spatio-temporal searches can be performed quickly even as the number of target information increases. However, because the TPR-tree is slow to process updates, there is a limitation to handling frequent updates. In this paper, we present a method for improving the update performance of TPR-tree by applying the bottom-up update scheme, previously proposed for R-tree, to the TPR-tree. In particular, we analyze the causes of overlaps occurring when applying the bottom-up updates and propose ways to limit the MBR expansion to solve it. Our experimental results show that the proposed technique improves the update performance of TPR-tree from 3.5 times to 12 times while maintaining search performance.

• Applied Chemistry for Engineering
• /
• v.10 no.8
• /
• pp.1161-1168
• /
• 1999

The redox property of oxide materials of the 3rd period transition metals(Cr~Zn), V, Mo, and W was studied with temperature-programmed reduction/temperature-programmed oxidation(TPR/TPO) experiment. The peak temperatures of TPO spectra were equal to or lower than those of TPR spectra. And the peak shapes of TPO spectra were broader than those of TPR ones. The activation energies of TPR/TPO for the oxides of the 3rd period transition metals showed in the range of 33~149 kJ/mol, while for the oxides of V, Mo, and W, they showed relatively higher values. The change of activation energies of TPR/TPO with various metal oxides showed a similar trend to the change of their metal-oxygen bond strengths. The change of activation energies of o-xylene oxidation for various metal oxides was proportional to the difference (${\Delta}E_a$) between the activation energy of TPR and that of TPO. From these results, we concluded that the oxidation of o-xylene over various metal oxide catalysts follows the Mars-van Krevelen mechanism including the surface reduction-oxidation of the metal oxide itself.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1053-1055
• /
• 1996

This paper proposes a Fuzzy TPR having the control function to a TPR used for the conversion of electricity in industrial field. The Fuzzy TPR based on the Fuzzy Logic Control technique is composed of the parts to calculate the low-level value and the high-level value. These values are calculated by error and change in error which are refer to the look-up table. To show the usefulness of the proposed Fuzzy TPR, it is applied to industrial temperature control system. In the results of experiment, we see that the system is able to fast reach steady-state, and for our approach to be robust to external disturbance than the method using the conventional TPR.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.95-104
• /
• 2022

A TPR-tree is a well-known indexing structure that is developed to answer queries about the current or future time locations of moving objects. For the purpose of space efficiency, the TPR-tree employs the notion of VBR (velocity bounding rectangle)so that a regionalrectangle presents varying positions of a group of moving objects. Since the rectangle computed from a VBR always encloses the possible maximum range of an indexed object group, a search process only has to follow VBR-based rectangles overlapped with a given query range, while searching toward candidate leaf nodes. Although the TPR-tree index shows up its space efficiency, it easily suffers from the problem of dead space that results from fast and constant expansions of VBR-based rectangles. Against this, the TPR-tree index is enforced to update leaf nodes for reducing dead spaces within them. Such an update-prone feature of the TPR-tree becomes more problematic when the tree is saved in flash storage. This is because flash storage has very expensive update costs. To solve this problem, we propose a new Bloom filter based caching scheme that is useful for reducing updates in a flash TPR-tree. Since the proposed scheme can efficiently control the frequency of updates on a leaf node, it can offer good performance for indexing moving objects in modern flash storage.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.23-31
• /
• 2010

With the advances in the information technology and mobile communications, we now face increasing demands for various services based on both of position tracking of moving objects and their efficient index scheme. Accordingly, the $TPR^*$-tree, which were proposed for efficiently tracking moving objects and predicting their positions in the future time, has drawn much intention. As the $TPR^*$-tree came from the R-tree that is suitable for indexing static objects, it does not support cheap update costs. Therefore, it seems to be very costly to index moving objects if there are frequent occurrences of node updates caused by continuously changing velocities and positions. If some moving objects with high velocities have node updates, in particular, then the $TPR^*$-tree may suffer from many unnecessary updates in the wide range of tree regions. To avoid such a problem, we propose a method that can keep fast-moving objects in the child nodes of the root node, thereby saving node update costs in the $TPR^*$-tree. To show our performance advantages and retaining $TPR^*$-tree features, we performed some performance experiments using a simulation technique.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.332-335
• /
• 2011

GPS 칩을 내장한 다양한 이동 통신 기기의 사용으로 위치 정보를 이용한 응용이 점차 확산될 전망이다. 위치 정보를 기반으로 한 응용 시스템에서는 다수 이동 객체의 위치 정보를 실시간으로 기록하고, 미래 시점의 객체 위치를 추정할 수 있어야 한다. 이런 요구에 따라 효과적인 이동 객체 색인에 고안된 기법이 TPR*-트리이다. 하지만 TPR*-트리는 고정 위치 색인에 최적화된 R-트리에 기본을 두었기 때문에 갱신 비용이 매우 커질 수 있다는 문제가 있다. R-트리에서는 갱신 연산이 빈번하지 않을 수 있지만 TPR*-트리의 경우는 이동 객체가 속도를 변화시킬 때마다 갱신 연산이 요구되기 때문에 상대적으로 매우 큰 갱신 비용이 발생할 수 있다. 이런 문제점을 부분적으로 해결하기 위해 본 논문에서는 쿨링다운 노드를 사용한 TPR*-트리를 제안한다. 제안된 트리는 트리의 상위 계층에 일부 이동 객체를 버퍼링함으로써 갱신 연산을 최소화 할 수 있다. 또한 지나친 사장 영역(dead space)의 확대를 방지함으로써 검색 성능 저하를 효과적으로 줄일 수 있다.

• Journal of Preventive Medicine and Public Health
• /
• v.56 no.4
• /
• pp.377-383
• /
• 2023

Objectives: Korea and Japan have managed the spread of coronavirus disease 2019 (COVID-19) using markedly different policies, referred to as the "3T" and "3C" strategies, respectively. This study examined these differences to assess the roles of active testing and contact tracing as non-pharmaceutical interventions (NPIs). We compared the proportion of unlinked cases (UCs) and test positivity rate (TPR) as indicators of tracing and testing capacities. Methods: We outlined the evolution of NPI policies and investigated temporal trends in their correlations with UCs, confirmed cases, and TPR prior to the Omicron peak. Spearman correlation coefficients were reported between the proportion of UCs, confirmed cases, and TPR. The Fisher r-to-z transformation was employed to examine the significance of differences between correlation coefficients. Results: The proportion of UCs was significantly correlated with confirmed cases (r=0.995, p<0.001) and TPR (r=0.659, p<0.001) in Korea and with confirmed cases (r=0.437, p<0.001) and TPR (r=0.429, p<0.001) in Japan. The Fisher r-to-z test revealed significant differences in correlation coefficients between the proportion of UCs and confirmed cases (z=16.07, p<0.001) and between the proportion of UCs and TPR (z=2.12, p=0.034) in Korea and Japan. Conclusions: Higher UCs were associated with increases in confirmed cases and TPR, indicating the importance of combining testing and contact tracing in controlling COVID-19. The implementation of stricter policies led to stronger correlations between these indicators. The proportion of UCs and TPR effectively indicated the effectiveness of NPIs. If the proportion of UCs shows an upward trend, more testing and contact tracing may be required.