• The Journal of Society for e-Business Studies
• /
• v.15 no.3
• /
• pp.85-98
• /
• 2010

The prevailing infrastructure of ubiquitous computing paradigm on the one hand making significant development for integrating technology in the daily life but on the other hand raising concerns for privacy and confidentiality. This research presents a new privacy-preserving spatio-temporal query processing technique, in which location based services (LBS) can be serviced without revealing specific locations of private users. Existing location cloaking techniques are based on a grid-based structures such as a Quad-tree and a multi-layered grid. Grid-based approaches can suffer a deterioration of the quality in query results since they are based on pre-defined size of grids which cannot be adapted for variations of data distributions. Instead of using a grid, we propose a location-cloaking algorithm which uses the R-tree, a widely adopted spatio-temporal index structure. The proposed algorithm uses the MBRs of leaf nodes as the cloaked locations of users, since each leaf node guarantees having not less than a certain number of objects. Experimental results show the superiority of the proposed method.

• Journal of Korean Society of Water and Wastewater
• /
• v.31 no.5
• /
• pp.389-395
• /
• 2017

In this paper, we investigate the characteristics of membrane fouling caused by water temperature in the Membrane bioreactor(MBR) process and try to derive the membrane fouling control by chemical enhanced backwashing(CEB). The extracellular polymeric substances(EPS) concentration was analyzed according to the water temperature in the MBR, and the membrane fouling characteristics were investigated according to the conditions, with sludge & without sludge, through a lab-scale reactor. As shown in the existing literature the fouling resistance rate was increased within sludge with the water temperature was lowered. However, in the lab-scale test using the synthetic wastewater, the fouling resistance increased with the water temperature. This is because that the protein of the EPS was more easily adsorbed on the membrane surface due to the increase of entropy due to the structural rearrangement of the protein inside the protein as the water temperature increases. In order to control membrane fouling, we tried to derive the cleaning characteristics of CEB by using sodium hypochlorite(NaOCl). We selected the condition with the chemicals and the retention time, and the higher the water temperature and the chemical concentration are the higher the efficiencies. It is considered that the increasing temperature accelerated the chemical reaction such as protein peptide binding and hydrolysis, so that the attached proteinaceous structure was dissolved and the frequency of the reaction collision with the protein with the chemical agent becomes higher. These results suggest that the MBRs operation focus on the fouling control of cake layer on membrane surface in low temperatures. On the other hand, the higher the water temperature is the more the operation strategies of fouling control by soluble EPS adsorption are needed.

• Journal of Microbiology and Biotechnology
• /
• v.24 no.11
• /
• pp.1574-1582
• /
• 2014

Bacteria recognize changes in their population density by sensing the concentration of signal molecules, N-acyl-homoserine lactones (AHLs). AHL-mediated quorum sensing (QS) plays a key role in biofilm formation, so the interference of QS, referred to as quorum quenching (QQ), has received a great deal of attention. A QQ strategy can be applied to membrane bioreactors (MBRs) for advanced wastewater treatment to control biofouling. To isolate QQ bacteria that can inhibit biofilm formation, we isolated diverse AHL-degrading bacteria from a laboratory-scale MBR and sludge from real wastewater treatment plants. A total of 225 AHL-degrading bacteria were isolated from the sludge sample by enrichment culture. Afipia sp., Acinetobacter sp. and Streptococcus sp. strains produced the intracellular QQ enzyme, whereas Pseudomonas sp., Micrococcus sp. and Staphylococcus sp. produced the extracellular QQ enzyme. In case of Microbacterium sp. and Rhodococcus sp., AHL-degrading activities were detected in the whole-cell assay and Rhodococcus sp. showed AHL-degrading activity in cell-free lysate as well. There has been no report for AHL-degrading capability in the case of Streptococcus sp. and Afipia sp. strains. Finally, inhibition of biofilm formation by isolated QQ bacteria or enzymes was observed on glass slides and 96-well microtiter plates using crystal violet staining. QQ strains or enzymes not only inhibited initial biofilm development but also reduced established biofilms.

• 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.

• Advances in nano research
• /
• v.8 no.2
• /
• pp.183-190
• /
• 2020

The objectives of this research were the reduction of membrane fouling and improvement of sludge properties by using synthesized H-ZSM-5 and NH₄-ZSM-5 zeolites. These two nano zeolites were synthesized and added to the membrane bioreactor (MBR). Three similar MBRs with the same operational condition were used in order to evaluate their effect on the mentioned matters. The evaluated parameters were trans-membrane pressure (TMP), Fourier-transform infrared spectroscopy (FTIR), particle size distribution (PSD), soluble microbial product (SMP), extracellular polymeric substances (EPS) and, excitation-emission matrix (EEM). The MBR₀ was without any additional zeolite while 0.4 g/L of H-ZSM-5 and NH₄-ZSM-5 were added to MBR_HZSM-5 and MBR_NH4ZSM-5, respectively. The COD removal of the MBR₀, MBR_H-ZSM-5 and MBR_NH4-ZSM-5 were 87.5%, 93.3% and 94.6%, respectively. The TMP of the MBR_H-ZSM-5 was 45% less than MBR₀ whereas the reduction for MBR_NH4-ZSM-5 was 65.5%. Also results showed that both H-ZSM-5 and NH₄-ZSM-5 caused reduction in protein and polysaccharide related EPS but the NH₄-ZSM-5 had better performance toward the elimination of organic compounds.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.384-394
• /
• 2004

Recently, to relieve the performance degradation caused by the bottleneck between CPU and main memory, cache conscious multi-dimensional index structures have been proposed. The ultimate goal of them is to reduce the space for entries so as to widen index trees and minimize the number of cache misses. The existing index structures can be classified into two approaches according to their entry reduction methods. One approach is to compress MBR keys by quantizing coordinate values to the fixed number of bits. The other approach is to store only the sides of minimum bounding regions (MBRs) that are different from their parents partially. In this paper, we propose a new index structure that exploits the properties of the both techniques. Then, we investigate the existing multi-dimensional index structures for main memory database system through experiments under the various work loads. We perform various experiments to show that our approach outperforms others.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.339-346
• /
• 2003

In this paper, we propose a new method in which interpolation images are created by using a small number of axiai T2-weighted images instead of using many sectional images for 3D visualization of brain MR images. For image Interpolation, an important part of this process, we first segment a region of interest (ROI) that we wish to apply 3D reconstruction and extract the boundaries of segmented ROIs and MBR information. After the image size of interpolation layer is determined according to the changing rate of MBR size between top slice and bottom slice of segmented ROI, we find the corresponding pixels in segmented ROI images. Then we calculate a pixel's intensity of interpolation image by assigning to each pixel intensity weights detected by cube interpolation method. Finally, 3D reconstruction is accomplished by exploiting feature points and 3D voxels in the created interpolation images.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.503-517
• /
• 2007

In this paper we address the MBR-safe property of Piecewise Aggregation Approximation(PAA), and propose an of efficient subsequence matching method based on the MBR-safe PAA. A transformation is said to be MBR-safe if a low-dimensional MBR to which a high- dimensional MBR is transformed by the transformation contains every individual low-dimensional sequence to which a high-dimensional sequence is transformed. Using an MBR-safe transformation we can reduce the number of lower-dimensional transformations required in similar sequence matching, since it transforms a high-dimensional MBR itself to a low-dimensional MBR directly. Furthermore, PAA is known as an excellent lower-dimensional transformation single its computation is very simple, and its performance is superior to other transformations. Thus, to integrate these advantages of PAA and MBR-safeness, we first formally confirm the MBR-safe property of PAA, and then improve subsequence matching performance using the MBR-safe PAA. Contributions of the paper can be summarized as follows. First, we propose a PAA-based MBR-safe transformation, called mbrPAA, and formally prove the MBR-safeness of mbrPAA. Second, we propose an mbrPAA-based subsequence matching method, and formally prove its correctness of the proposed method. Third, we present the notion of entry reuse property, and by using the property, we propose an efficient method of constructing high-dimensional MBRs in subsequence matching. Fourth, we show the superiority of mbrPAA through extensive experiments. Experimental results show that, compared with the previous approach, our mbrPAA is 24.2 times faster in the low-dimensional MBR construction and improves subsequence matching performance by up to 65.9%.

• Spatial Information Research
• /
• v.18 no.4
• /
• pp.109-120
• /
• 2010

Recently, due to rapid increasement of spatial data collected from various geosensors in u-GIS environments, the importance of spatial index for efficient search of large spatial data is rising gradually. Especially, researches based R-Tree to improve search performance of spatial data have been actively performed. These previous researches focus on reducing overlaps between nodes or the height of the R -Tree. However, these can not solve an unnecessary node access problem efficiently occurred in tree traversal. In this paper, we propose a MR-Tree(Mapping-based R-Tree) to solve this problem and to support efficient search of large spatial data. The MR-Tree can improve search performance by using a mapping tree for direct access to leaf nodes of the R-Tree without tree traversal. The mapping tree is composed with MBRs and pointers of R-Tree leaf nodes associating each partition which is made by splitting data area repeatedly along dimensions. Especially, the MR-Tree can be adopted in various variations of the R-Tree easily without a modification of the R-Tree structure. In addition, because the mapping tree is constructed in main memory, search time can be greatly reduced. Finally, we proved superiority of MR-Tree performance through experiments.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.53-73
• /
• 2006

Recently, the need for Location-Based Services (LBS) has increased due to the development of mobile devices, such as PDAs, cellular phones and GPS. As a moving object database that stores and manages the positions of moving objects is the core technology of LBS, the scheme for maintaining the main memory DBMS to the server is necessary to store and process frequent reported positions of moving objects efficiently. However, previous works on a moving object database have studied mostly a disk based moving object index that is not guaranteed to work efficiently in the main memory DBMS because these indexes did not consider characteristics of the main memory. It is necessary to study the main memory index scheme for a moving object database. In this paper, we propose the main memory index scheme based on the R-tree for storing and processing positions of moving objects efficiently in the main memory DBMS. The proposed index scheme, which uses a growing node structure, prevents the splitting cost from increasing by delaying the node splitting when a node overflows. The proposed scheme also improves the search performance by using a MergeAndSplit policy for reducing overlaps between nodes and a LargeDomainNodeSplit policy for reducing a ratio of a domain size occupied by node's MBRs. Our experiments show that the proposed index scheme outperforms the existing index scheme on the maximum 30% for range queries.