• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.2
• /
• pp.57-68
• /
• 2004

We present a new parallel algorithm for extending the domain of a UOWHF. Our algorithm is based on non-complete l-ary tree and has the same optimal key length expansion as Shoup's which has the most efficient key length expansion known so far. Using the recent result [8], we can also prove that the key length expansion of this algorithm and Shoup's sequential algorithm are the minimum possible for any algorithms in a large class of "natural" domain extending algorithms. But its prallelizability performance is less efficient than complete tree based constructions. However if l is getting larger then the parallelizability of the construction is also getting near to that of complete tree based constructions.tructions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.6
• /
• pp.1994-2017
• /
• 2022

In view of the past, the mobility of the multicast source in the mobility networks is seldom discussed in the traditional multicast protocols. It is a heavy cost for the traditional multicast protocols to reconstruct the multicast tree in the Network Mobility (NEMO) environment. This article proposes an alternative multicast protocol, referred to as Mobility-Sensitive Multicast protocol (MSM), for the NEMO environment. The MSM can be considered as an alternative version of the Multicast Listener Discovery (MLD) protocol to maintain the multicast tree in the NEMO. There are two obvious contributions for the MSM. Reconstruct mechanism could rebuild the multicast tree for the mobility of the multicast source. Multi-group suppression mechanism reduce the multicast tree maintaining cost for the mobility of the multicast members. Through the performance evaluations and analyses, the MSM has less cost to maintain the multicast tree than the traditional multicast protocols, especially for a large numbers of multicast groups. Moreover, the MSM allows the mobility of the multicast source to reconstruct the multicast tree easily.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.4
• /
• pp.29-37
• /
• 2010

The change detection of XML documents is a major research area. However, though XML becomes a file format for Hangul documents, research on change detection of Hangul documents based on the characteristics of Hangul documents is rather scarce. Since format data in Hangul documents are very large, which is different from ordinary XML documents, it is not proper to apply general XML change detection algorithms such as X-treeDiff+ to Hangul documents without any change. In this paper, we propose new contents-based matching algorithm and implement it in X-treeDiff+. The result of our testing shows better performance for most documents in editing process.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.758-762
• /
• 2008

Embedded systems usually utilize Flash Memories with very nice characteristics of non-volatility, low access time, low power and so on. For the multimedia database systems, R-tree is an indexing tree with nice characteristics for multimedia access. MR-tree, which is an upgraded version of R-tree, has shown better performance in searching, inserting and deleting operations than R-tree. Flash memory has sectors and blocks as a unit of read, write and delete operations. Especially, the delete is done on a unit of 512 byte blocks with very large operation time and it is also known that read and write operations on a unit of block matches caching nature of MT-tree. Our research optimizes MR-tree operations in a unit of Flash memory blocks. Such an adjusting leads in better indexing performance in database accesses. With MR-tree on a 512B block units we achieved fast search time of database indexing with low height of MR-tree as well as faster update time of database indexing with the best fit of flash memory blocks. Thus MR-tree with optimized operations shows good characteristics to be a database index schemes on any systems with flash memory.

• Journal of Forest and Environmental Science
• /
• v.32 no.3
• /
• pp.237-252
• /
• 2016

Improved knowledge of the environmental factors affecting the natural regeneration of tree species in limestone forest is urgently required for species conservation. We examined the environmental factors and tree species characteristics that are important for colonization in diverse forest stands growing on a limestone hill in northern Thailand. Our analysis estimated the relative influence of forest structure and environmental factors on the regeneration traits of tree species. We established sixty-four $100-m^2$ plots in four forest stands on the limestone hill. We determined the species composition of canopy trees, regenerating seedlings, and saplings in relation to the physical environment. The relationships between environmental variables and tree species abundance were assessed by canonical correspondence analysis (CCA), and we used generalized linear mixed models to examine data on seedling/sapling abundances. The CCA ordination indicated that the abundance of tree species within the mixed deciduous forest was closely related to soil depth. The abundances of tree species growing within the sink-hole and hill-slope stands were positively related to the extent of rocky outcropping; light and soil moisture positively influenced the abundance of tree species in the hill-cliff stand. Physical factors had a greater effect on tree regeneration than did factors related to forest structure. Tree species, such as Ficus macleilandii, Dracaena cochinchinensis, and Phyllanthus mirabilis within the hill-cliff or sink-hole stand, colonized well on large rocky outcroppings that were well illuminated and had soft soils. These species regenerated well under conditions prevailing on the limestone hill. The colonization of several species in other stands was negatively influenced by environmental conditions at these sites. We found that natural regeneration of tree species on the limestone hill was difficult because of the prevailing combination of physical and biological factors. The influence of these factors was species dependent, and the magnitude of effects varied across forest stands.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.40 no.6
• /
• pp.140-147
• /
• 2012

This study was conducted to investigate optimum planting density for apartment complex. The validity of Landscape Architecture Criteria of Korea was checked for it. We compared our field data with Landscape Architecture Criteria. In this step, the tree density of urban forest was regarded as standard. Field study was examined in 3 apartment complexes located in capital area, especially completed during these 10 years. 10 sites in each complex were selected and tree density per unit area were calculated. This field study data was divided standard size and large size which received weight. And, it was compared and analyzed. And crown projected area(CPA) was calculated considering proper growth of low vegetation and sufficient shade. The outcome shows that minimum size of Landscape Architecture Criteria is rational. But, in the case of planting large size tree received weight, tree density was short comparing with the tree density of urban forest and CPA was less than 50%. By the result of field study in 3 apartment complex, the tree density of apartment complex satisfied or exceeded Landscape Architecture Criteria. But, in the case of planting large size tree, tree density and CPA show high density due to addition planting for deficient landscape. Therefore, the revision of the Landscape Architecture Criteria was required such as deletion or minimization of the weighted clause about the large size tree and regulate the limit CPA not less than 50% and not more than 100%.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.7
• /
• pp.87-95
• /
• 2012

In this paper, PTAS three-dimensional Steiner minimum tree connecting numerous input nodes rapidly in 3D space is proposed. Steiner minimum tree problem belongs to NP problem domain, and when properly devised heuristic introduces, it is generally superior to other algorithms as minimum spanning tree affiliated with P problem domain. But when the number of input nodes is very large, the problem requires excessive execution time. In this paper, a method using PTAS is proposed to solve the difficulty. In experiments for 70,000 input nodes in 3D space, the tree produced by the proposed 8 space partitioned PTAS method reduced 86.88% execution time, compared with the tree by naive 3D steiner minimum tree method, though increased 0.81% tree length. This affirms the proposed method can work well for applications that many nodes of three dimensions are need to connect swifty, enduring slight increase of tree length.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.7
• /
• pp.89-95
• /
• 2009

This paper proposes a tag indexing scheme for RFID tag using spatial index. The tag being used for the inventory management and the tag's location is determined by the position of readers. Therefore, the reader recognizes the tag, which is attached products and thereby their positions can be traced down. In this paper, we propose hTag-tree( Hybrid Tag index) which manages RFID tag attached products. hTag-tree is a new index, which is based on tag's attributes with fast searching, and this tag index manages RFID tags using reader's location. This tag index accesses rapidly to tags for insertion, deletion and updating in dynamic environment. This can minimize the number of node accesses in tag searching comparing to previous techniques. Also, by the extension of MER in present tag index, it is helpful to stop the lowering of capacity which can be caused by parent node approach. The proposed index experiment deals with the comparison of tag index. Fixed Interval R-tree, and present spatial index, R-tree comparison. As a result, the amount of searching time is significantly shortened through hTag-tree node access in data search. This shows that the use of proposed index improves the capacity of effective management of a large amount of RFID tag.

• Wind and Structures
• /
• v.5 no.2_3_4
• /
• pp.291-300
• /
• 2002

An efficient large eddy simulation algorithm is used to compute surface pressure distributions on an eleven story (target) building on the NIST campus. Local meteorology, neighboring buildings, topography and large vegetation (trees) all play an important part in determining the flows and therefore the pressures experienced by the target. The wind profile imposed at the upstream surface of the computational domain follows a power law with an exponent representing a suburban terrain. This profile accounts for the flow retardation due to friction from the surface of the earth, but does not include fluctuations that would naturally occur in this flow. The effect of neighboring buildings on the time dependent surface pressures experienced by the target is examined. Comparison of the pressure fluctuations on the single target building alone with those on the target building in situ show that, owing to vortices shed by the upstream buildings, fluctuations are larger when such buildings are present. Even when buildings are lateral to or behind the target, the pressure disturbances generate significantly different flows around this building. A simple grid-free mathematical model of a tree is presented in which the trunk and the branches are each represented by a collection of spherical particles strung together like beads on a string. The drag from the tree, determined as the sum of the drags of the component particles, produces an oscillatory, spreading wake of slower fluid, suggesting that the behavior of trees as wind breakers can be modeled usefully.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.91-98
• /
• 2004

DHP mining association rules algorithm maintains previously independent direct hash table to reduce the sire of hash tree containing the frequency number of each candidate large itemset. It performs pruning by using the direct hash table when the hash tree is constructed. The mort large the size of direct hash table increases, the higher the effort of pruning becomes. Especially, the effect of pruning in phase 2 which generate 2-large itemsets is so high that it dominates the overall performance of DHP algorithm. So, following the speedy trends of producing VLM(Very Large Memory) systems, extreme increment of direct hash table size is being tried and one of those trials is perfect hash table in phase 2. In case of using perfect hash table in phase 2, we found that some rearrangement of DHP algorithm got about 20% performance improvement compared to simply ｜H$_2$｜ reconfigured DHP algorithm. In this paper, we examine the feasibility of perfect hash table in phase 2 and propose PHP algorithm, a rearranged DHP algorithm, which uses the characteristics of perfect hash table sufficiently, then make an analysis on the results in experimental environment.