• Title/Summary/Keyword: tree map

Search Result 317, Processing Time 0.021 seconds

An In-Depth Analysis and Improvement on Cache Mechanisms of SSD FTL (SSD FTL의 캐시 메커니즘에 대한 심층 분석 및 개선)

  • Lee, Hyung-Bong;Chung, Tae-Yun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.15 no.1
    • /
    • pp.9-16
    • /
    • 2020
  • Recently, the capacity of SSD has been increasing rapidly due to the improvement of flash memory density. To take full advantage of these SSDs, first of all, FTL's prompt adaptation is necessary. The FTL is a translation layer existing in SSDs to overcome the drawback of the SSD that cannot be modified in place, and has garbage collection and caching functions in addition to the map table management function. In this study, we focus on caching function, compare and analyze the cache implementation methodologies, and propose improved methods. Typical cache implementations divide the cache into groups, manage and retrieve the caches in the group as a linked list. Thus, searches are made in the order of the linked list. In contrast, we propose a method of sequential searching using the search area group of a cache registered in the map table regardless of the linked list and cache group. Experimental results show that the proposed method has a 2.5 times improvement over the conventional method.

The Present Conditions and Remedial Measures of Street Trees in Miryang City (밀양시 가로수 현황과 개선방안)

  • 백재봉;조재우;최송현
    • Journal of Environmental Science International
    • /
    • v.12 no.6
    • /
    • pp.565-572
    • /
    • 2003
  • The aim of this research is to survey the census of street trees and to provide remedial measures for street trees management to Miryang City. To do this, survey was carried out 16 region units in Miryang City. Through the survey, the current status of street trees’ map was made using automated map. From the results, it is turned out that 17,079 trees have been planted in Miryang City. The major species of street trees are Prunus serrulata var. spontanea(41.6%), Ginkgo biloba(26.1%), Pinus thunbergiana(13.3%) and the others are 12 species(19.0%). By the region units, Samrangjin-Eub is the most that 2,308 street trees are planted, and the next is Chodong-Myon(2,206 trees). The littlest street trees planted region is Cheongdo-Myon. In the results of comparison the component of street trees with other municipal cities, e.g. Seoul, Incheon, Kwangyang etc., only a few street trees have been planted so many in Miryang City. So, Miryang City indicated high proportionate street trees planting ratio. The suggested remedial measures are consisted with identifying the each street, increasing the green area by accepting the suitable street tree planting model, improving the physiological growth condition and systematic management with GIS.

Land Surface Classification With Airborne Multi-spectral Scanner Image Using A Neuro-Fuzzy Model (뉴로-퍼지 모델을 이용한 항공다중분광주사기 영상의 지표면 분류)

  • Han, Jong-Gyu;Ryu, Keun-Ho;Yeon, Yeon-Kwang;Chi, Kwang-Hoon
    • The KIPS Transactions:PartD
    • /
    • v.9D no.5
    • /
    • pp.939-944
    • /
    • 2002
  • In this paper, we propose and apply new classification method to the remotely sensed image acquired from airborne multi-spectral scanner. This is a neuro-fuzzy image classifier derived from the generic model of a 3-layer fuzzy perceptron. We implement a classification software system with the proposed method for land cover image classification. Comparisons with the proposed and maximum-likelihood classifiers are also presented. The results show that the neuro-fuzzy classification method classifies more accurately than the maximum likelihood method. In comparing the maximum-likelihood classification map with the neuro-fuzzy classification map, it is apparent that there is more different as amount as 7.96% in the overall accuracy. Most of the differences are in the "Building" and "Pine tree", for which the neuro-fuzzy classifier was considerably more accurate. However, the "Bare soil" is classified more correctly with the maximum-likelihood classifier rather than the neuro-fuzzy classifier.

Construction of Roads for Vehicle Simulator Using GIS Map (GIS 데이터를 이용한 차량 시뮬레이터용 도로 구축에 관한 연구)

  • 임형은;성원석;황원걸;주승원
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.4
    • /
    • pp.88-94
    • /
    • 2004
  • Recently, vehicle simulators are widely used to evaluate driver's responses and driver assistance systems. It needs much effort to construct the virtual driving environment for a vehicle simulator. In this study, it is described how to make effectively the roads and the driving environment for a vehicle simulator. The GIS (Geographic Information System) is used to construct the roads and the environment effectively. Because the GIS is the integrated system of geographical data, it contains useful data to make virtual driving environment. First, the outline and centerline of roads is abstracted from the GIS. From the road outline, the road width is calculated. Using the centerline, the grid model of roads is constructed. The final graphic model of roads is constructed by mapping road image to the grid model according to the number of lanes and the kind of surface. Data of buildings from the GIS are abstracted. Each shape and height of buildings is determined according to kind of buildings, the final graphic model of buildings is constructed. Then, the graphic model of roadside tree is also constructed. Finally, the driving environment for driving simulator is constructed by converting the three graphic models with the graphic format of Direct-X and by joining the three graphic models.

Opinion-Mining Methodology for Social Media Analytics

  • Kim, Yoosin;Jeong, Seung Ryul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.391-406
    • /
    • 2015
  • Social media have emerged as new communication channels between consumers and companies that generate a large volume of unstructured text data. This social media content, which contains consumers' opinions and interests, is recognized as valuable material from which businesses can mine useful information; consequently, many researchers have reported on opinion-mining frameworks, methods, techniques, and tools for business intelligence over various industries. These studies sometimes focused on how to use opinion mining in business fields or emphasized methods of analyzing content to achieve results that are more accurate. They also considered how to visualize the results to ensure easier understanding. However, we found that such approaches are often technically complex and insufficiently user-friendly to help with business decisions and planning. Therefore, in this study we attempt to formulate a more comprehensive and practical methodology to conduct social media opinion mining and apply our methodology to a case study of the oldest instant noodle product in Korea. We also present graphical tools and visualized outputs that include volume and sentiment graphs, time-series graphs, a topic word cloud, a heat map, and a valence tree map with a classification. Our resources are from public-domain social media content such as blogs, forum messages, and news articles that we analyze with natural language processing, statistics, and graphics packages in the freeware R project environment. We believe our methodology and visualization outputs can provide a practical and reliable guide for immediate use, not just in the food industry but other industries as well.

Data Sampling-based Angular Space Partitioning for Parallel Skyline Query Processing (데이터 샘플링을 통한 각 기반 공간 분할 병렬 스카이라인 질의처리 기법)

  • Chung, Jaehwa
    • The Journal of Korean Association of Computer Education
    • /
    • v.18 no.5
    • /
    • pp.63-70
    • /
    • 2015
  • In the environment that the complex conditions need to be satisfied, skyline query have been applied to various field. To processing a skyline query in centralized scheme, several techniques have been suggested and recently map/reduce platform based approaches has been proposed which divides data space into multiple partitions for the vast volume of multidimensional data. However, the performances of these approaches are fluctuated due to the uneven data loading between servers and redundant tasks. Motivated by these issues, this paper suggests a novel technique called MR-DEAP which solves the uneven data loading using the random sampling. The experimental result gains the proposed MR-DEAP outperforms MR-Angular and MR-BNL scheme.

Molecular Cloning of a Pepper Gene that Is Homologous to SELF-PRUNING

  • Kim, Dong Hwan;Han, Myeong Suk;Cho, Hyun Wooh;Jo, Yeong Deuk;Cho, Myeong Cheoul;Kim, Byung-Dong
    • Molecules and Cells
    • /
    • v.22 no.1
    • /
    • pp.89-96
    • /
    • 2006
  • "Determinate" and "indeterminate" inflorescences in plants are controlled by a single recessive gene, for example, SELF-PRUNING (SP) in Solanum lycopersicum, TERMINAL FLOWER1 in Arabidopsis, CENTRORADIALIS in Antirrhinum, and CENTRORADIALIS-like gene in tobacco. Pepper (Capsicum annuum L.) is an indeterminate species in which shoots grow indefinitely. In this study, we cloned and characterized the pepper SP-like gene (CaSP). RT-PCR revealed that the CaSP transcript accumulates to higher levels in floral buds than in other organs. Comparison of genomic DNA and cDNA sequences from indeterminate and determinate pepper plants revealed the insertion of a single base in the first exon of CaSP in the determinate pepper plants. CaSP is annotated in linkage group 8 (chromosome 6) of the SNU2 pepper genetic map and showed similar synteny to SP in tomato. Transgenic tobacco plants overexpressing CaSP displayed late-flowering phenotypes similar to the phenotypes caused by overexpression of CaSP orthologs in other plants. Collectively, these results suggest that pepper CaSP is an ortholog of SP in tomato.

Application of Constraint Algorithm for High Speed A/D Converters

  • Nguyen, Minh Son;Yeo, Soo-A;Kim, Man-Ho;Kim, Jong-Soo
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.3
    • /
    • pp.224-229
    • /
    • 2008
  • In the paper, a new Constraint algorithm is proposed to solve the fan-in problem occurred in the encoding circuitry of an ADC. The Flash ADC architecture uses a Double-Base Number System(DBNS). The DBNS has been known to represent the Multidimensional Logarithmic Number System (MDLNS) used for implementing the multiplier accumulator architecture of FIR filter in Digital Signal Processing (DSP) applications. The authors use the DBNS with the base 2 and 3 in designing ADC encoder circuits, which is called as Double Base Integer Encoder(DBIE). A symmetric map is analyzed first, and then asymmetric map is followed to provide addition ready DBNS for DSP circuitry. The simulation results of the DBIE circuits in 6-bit and 8-bit ADC show the effectiveness of the Constraint algorithm with $0.18{\mu}m$ CMOS technology. The DBIE yields faster processing speed compared to the speed of Fat Tree Encoder (FAT) circuits by 17% at more power consumption by 39%.

  • PDF

Reconstitution of CB Trie for the Efficient Hangul Retrieval (효율적인 한글 탐색을 위한 CB 트라이의 재구성)

  • Jung, Kyu-Cheol
    • Convergence Security Journal
    • /
    • v.7 no.4
    • /
    • pp.29-34
    • /
    • 2007
  • This paper proposes RCB(Reduced Compact Binary) trie to correct faults of CB(Compact Binary) trie. First, in the case of CB trie, a compact structure was tried for the first time, but as the amount of data was increasing, that of inputted data gained and much difficulty was experienced in insertion due to the dummy nods used in balancing trees. On the other hand, if the HCB trie realized hierarchically, given certain depth to prevent the map from increasing on the right, reached the depth, the method for making new trees and connecting to them was used. Eventually, fast progress could be made in the inputting and searching speed, but this had a disadvantage of the storage space becoming bigger because of the use of dummy nods like CB trie and of many tree links. In the case of RCB trie in this thesis, a capacity is increased by about 60% by completely cutting down dummy nods.

  • PDF

Maximum A Posteriori Estimation-based Adaptive Search Range Decision for Accelerating HEVC Motion Estimation on GPU

  • Oh, Seoung-Jun;Lee, Dongkyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.9
    • /
    • pp.4587-4605
    • /
    • 2019
  • High Efficiency Video Coding (HEVC) suffers from high computational complexity due to its quad-tree structure in motion estimation (ME). This paper exposes an adaptive search range decision algorithm for accelerating HEVC integer-pel ME on GPU which estimates the optimal search range (SR) using a MAP (Maximum A Posteriori) estimator. There are three main contributions; First, we define the motion feature as the standard deviation of motion vector difference values in a CTU. Second, a MAP estimator is proposed, which theoretically estimates the motion feature of the current CTU using the motion feature of a temporally adjacent CTU and its SR without any data dependency. Thus, the SR for the current CTU is parallelly determined. Finally, the values of the prior distribution and the likelihood for each discretized motion feature are computed in advance and stored at a look-up table to further save the computational complexity. Experimental results show in conventional HEVC test sequences that the proposed algorithm can achieves high average time reductions without any subjective quality loss as well as with little BD-bitrate increase.