• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권5호
• /
• pp.527-547
• /
• 2009

Moving object management is widely used in traffic, logistic and data mining applications in ubiquitous environments. It is required to analyze spatio-temporal data and trajectories for moving object management. In this paper, we proposed a novel index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using a constraint network-based index and it also supports direction of trajectory. An aCN-RB-tree consists of an aR-tree in its center and an extended B-tree. In this structure, an aR-tree is similar to a Min/Max R-tree, which stores the child nodes' max aggregation value in the parent node. Also, the proposed index structure is based on a constrained network structure such as a FNR-tree, so that it can decrease the dead space of index nodes. Each leaf node of an aR-tree has an extended B-tree which can store timestamp-based aggregation values. As it considers the direction of trajectory, the extended B-tree has a structure with direction. So this kind of aCN-RB-tree index can support efficient search for trajectory and traffic zone. The aCN-RB-tree can find a moving object trajectory in a given time interval efficiently. It can support traffic management systems and mining systems in ubiquitous environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.597-618
• /
• 2019

Categorical range aggregation, which is conceptually equivalent to running a range aggregation query separately on multiple datasets, returns the query result on each dataset. The challenge is when the number of dataset is as large as hundreds or thousands, it takes a lot of computation time and I/O. In previous work, only a single dimension of the range restriction has been solved, and in practice, more applications are being used to calculate multiple range restriction statistics. We proposed MCRI-Tree, an index structure designed to solve multi-dimensional categorical range aggregation queries, which can utilize main memory to maximize the efficiency of CRA queries. Specifically, the MCRI-Tree answers any query in $O(nk^{n-1})$ I/Os (where n is the number of dimensions, and k denotes the maximum number of pages covered in one dimension among all the n dimensions during a query). The practical efficiency of our technique is demonstrated with extensive experiments.

• 한국식품저장유통학회:학술대회논문집
• /
• 한국식품저장유통학회 2003년도 제23차 추계총회 및 국제학술심포지움
• /
• pp.135.1-135
• /
• 2003

To elucidate the effect of gamma-irradiation on the molecular properties of hemoglobin, the secondary, tertiary structure, and the molecular weight size of the protein were examined after irradiation at 0.5, 1, 5, and 10 kGy. Gamma-irradiation of hemoglobin solutions caused the disruption of the ordered structure of the protein molecules, as well as degradation, cross-linking, and aggregation of the polypeptide chains. A SDS-PAGE study indicated that irradiation caused initial fragmentation of the proteins and subsequent aggregation due to cross-linking of the protein molecules. The effect of irradiation on the protein was more significant at lower protein concentrations. Ascorbic acid decreased the degradation and aggregation of proteins by scavenging oxygen radicals that were produced by irradiation. A circular dichroism study showed that irradiation decreased the helical content of hemoglobin with a concurrent increase of the aperiodic structure content. Fluorescence spectroscopy indicated that irradiation decreased the emission intensity that was excited at 280 nm.

• 한국진공학회지
• /
• 제14권3호
• /
• pp.115-118
• /
• 2005

모델 고분자 미셀(서로 결합하거나, 결합하지 않는 두 경우)의 구조를 분석하기 위해 중성자 소각 산란(small angle neutron scattering)법을 이용하였다. 소수성 결합체의 응집수와 농도의 증가에 따른 정렬상태의 변화를 폴리에틸렌글라이콜(PEG, 6 K나 10 K고몰 분자량) 끝에 불화알킬그룹(pefluoroalkyl groups $(-(CH_2)_2C_OnF_{2n+1}$, (n = 6, 8,혹은 10)이 붙은 고분자용액을 이용하여 분석하였다. 결합체의 응집수는 소수성 말단기의 길이에 의해서만 주로 결정이 되고, 고분자의 농도나 온도에 의해 영향을 받지 않는다. 또한, 서로 결합하는 고분자 미셀과, 서로 결합하지 않는 고분자 미셀간에도 결합수에는 차이가 없다. 이러한 모델계는 농도가 증가함에 따라서 체심 입방구조로 정렬된다.

• 한국산학기술학회논문지
• /
• 제4권4호
• /
• pp.357-360
• /
• 2003

작약의 methanol 추출물은 혈소판 활성 실험에서 혈소판 응집에 대해 강한 억제를 보였다. 활성성분은 chromatography방법을 사용하여 정제하였고 NMR과 기존의 Data로 분석하였다. Compound 1b는 benzoyloxypaeoniflorin과 동일한 구조임을 확인하였으며. compound 2e는 작약의 주성분인 paeoniflorin과 동일한 화학구조를 가졌으며 , compound 3a의 분석결과 구조적 유사성은 있으나 동일한 구조식은 확인 할 수 없었지만 collagen에서 응집억제활성이 90％이상의 뛰어난 활성을 나타내어 benzoyloxypaeoniflorin과 유사하게 benzoyl 기가 다른 작용기로 치환되었거나 Rl group이 다른 작용기로 치환된 형태로 추측하였다. Paeoniflorin이 collagen보다 thrombin에서 강한 억제를 보이는 것은 Ca/sup 2＋/ chelate를 형성함으로 인해 calcium 대사산물이 파괴된 것으로 추측했다. Compound 3a는 paeoniflorin의 benzoyl 기에 있는 OH기나 paeoniflorin의 glycoside 5-carbon위치의 OH기 대신에 다른 작용기가 대사산물로의 역할을 수행했을 것으로 추정했다.

• Genomics & Informatics
• /
• 제9권2호
• /
• pp.74-78
• /
• 2011

Numerous restraints and simplifications have been developed for methods that anticipate protein structure to reduce the colossal magnitude of possible conformational states. In this study, we investigated if globularity is a general characteristic of proteins and whether they can be applied as a valid constraint in protein structure simulations with approximated measurements (Gb-index). Unexpectedly, most of the proteins showed strong structural globularity (i.e., mode of approximately 76% similarity to the perfect globe) with only a few percent of proteins being outliers. Small proteins tended to be significantly non-globular ($R^2$=0.79) and the minimum Gb-index showed a logarithmic increase with the increase in protein size ($R^2$=0.62), strongly implying that the non-globular characteristics might be more acceptable for smaller proteins than larger ones. The strong perfect globe-like character and the relationship between small size and the loss of globular structure of a protein may imply that living organisms have mechanisms to aid folding into the globular structure to reduce irreversible aggregation. This also implies the possible mechanisms of diseases caused by protein aggregation, including some forms of trinucleotide repeat expansion-mediated diseases.

• 한국멀티미디어학회논문지
• /
• 제9권12호
• /
• pp.1529-1541
• /
• 2006

Moving objects have been widely employed in traffic and logistic applications. Spatio-temporal aggregations mainly describe the moving object's behavior in the spatial data warehouse. The previous works usually express the object moving in some certain region, but ignore the object often moving along as the trajectory. Other researches focus on aggregation and comparison of trajectories. They divide the spatial region into units which records how many times the trajectories passed in the unit time. It not only makes the storage space quite ineffective, but also can not maintain spatial data property. In this paper, a spatio-temporal aggregation index structure for moving object trajectory in constrained network is proposed. An extended B-tree node contains the information of timestamp and the aggregation values of trajectories with two directions. The network is divided into segments and then the spatial index structure is constructed. There are the leaf node and the non leaf node. The leaf node contains the aggregation values of moving object's trajectory and the pointer to the extended B-tree. And the non leaf node contains the MBR(Minimum Bounding Rectangle), MSAV(Max Segment Aggregation Value) and its segment ID. The proposed technique overcomes previous problems efficiently and makes it practicable finding moving object trajectory in the time interval. It improves the shortcoming of R-tree, and makes some improvement to the spatio-temporal data in query processing and storage.

• Journal of Information Processing Systems
• /
• 제10권3호
• /
• pp.412-428
• /
• 2014

Request oriented sensor networks have stricter requirements than conventional event-driven or periodic report models. Therefore, in this paper we propose a minimum energy data aggregation (MEDA), which meets the requirements for request oriented sensor networks by exploiting a low power real-time scheduler, on-demand time synchronization, variable response frame structure, and adaptive retransmission. In addition we introduce a test bed consisting of a number of MEDA prototypes, which support near real-time bidirectional sensor networks. The experimental results also demonstrate that the MEDA guarantees deterministic aggregation time, enables minimum energy operation, and provides a reliable data aggregation service.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2015년도 춘계학술발표대회
• /
• pp.212-213
• /
• 2015

Data aggregation is a fundamental problem in wireless sensor networks that has attracted great attention in recent years. On constructing a robust algorithm for minimizing data aggregation delay in wireless sensor networks, we consider limited transmission range sensors and approximate the minimum-delay data aggregation tree which can only be built in networks of unlimited transmission range sensors. The paper proposes an adaptive method that can be applied to maintain the network structure in case of a sensor node fails. The data aggregation tree built by the proposed scheme is therefore self-healing and robust. Intensive simulations are carried out and the results show that the scheme could adapt well to network topology changes compared with other approaches.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2012년도 춘계학술발표대회
• /
• pp.607-608
• /
• 2012

Data aggregation is a fundamental problem in wireless sensor networks which attracts great attention in recent years. Delay and energy efficiencies are two crucial issues of designing a data aggregation scheme. In this paper, we propose a distributed, energy efficient algorithm for collecting data from all sensor nodes with the minimum latency called Delay-aware Power-efficient Data Aggregation algorithm (DPDA). The DPDA algorithm minimizes the latency in data collection process by building a time efficient data aggregation network structure. It also saves sensor energy by decreasing node transmission distances. Energy is also well-balanced between sensors to achieve acceptable network lifetime. From intensive experiments, the DPDA scheme could significantly decrease the data collection latency and obtain reasonable network lifetime compared with other approaches.