• Title/Summary/Keyword: partitioning approach

Search Result 160, Processing Time 0.023 seconds

Pipelined Parallel CRC (파이프라인 구조를 적용한 병렬 CRC 회로 설계)

  • Kim, Ki-Tae;Yi, Hyun-Bean;Park, Sung-Ju;Park, Chang-Won
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.789-792
    • /
    • 2005
  • In this paper, we propose a method that applies pipeline architecture to parallel CRC circuits. We developed a logic partitioning algorithm for applying pipeline architecture. Our algorithm can be used for the polynomial and the input data width, both of arbitrary length and minimize the logic level. Design experiments show the superiority of our approach in reducing the delay in comparison with previous works.

  • PDF

A Simulated Annealing Method for the Optimization Problem in a Multi-Server and Multi-Class Customer Ssystem

  • Yoo, Seuck-Cheun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.2
    • /
    • pp.83-103
    • /
    • 1993
  • This paper addresses an optimization problem faced by a multi-server and multi-class customer system in manufacturing facilities and service industries. This paper presents a model of an integrated problem of server allocation and customer type partitioning. We approximate the problem through two types of models to make it tractable. As soution approach, the simulated annealing heuristic is constructed based on the general simulated annealing method. Computational results are presented.

  • PDF

A study of a image segmentation by the normalized cut (Normalized cut을 이용한 Image segmentation에 대한 연구)

  • Lee, Kyu-Han;Chung, Chin-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 1998.07g
    • /
    • pp.2243-2245
    • /
    • 1998
  • In this paper, we treat image segmentation as a graph partitioning problem. and use the normalized cut for segmenting the graph. The normalized cut criterion measures both the total dissimilarity between the different graphs as well as the total similarity within the groups. The minimization of this criterion can formulated as a generalized eigenvalues problem. We have applied this approach to segment static image. This criterion can be shown to be computed efficiently by a generalized eigenvalues problem

  • PDF

Hybrid Multicast/Broadcast Algorithm for Highly-Demanded Video Services with Low Complexity (Highly-Demanded 비디오 서비스를 위한 낮은 복잡도의 혼합 멀티캐스트/브로드캐스트 알고리즘)

  • Li, Can;Bahk, Sae-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1B
    • /
    • pp.101-110
    • /
    • 2011
  • With the deployment of broadband networking technology, many clients are enabled to receive various Video on Demand (VoD) services. To support many clients, the network should be designed by considering the following factors: viewer's waiting time, buffer requirement at each client, number of channel required for video delivery, and video segmentation complexity. Among the currently available VoD service approaches, the Polyharmonic and Staircase broadcasting approaches show best performance with respect to each viewer's waiting time and buffer requirement, respectively. However, these approaches have the problem of dividing a video into too many segments, which causes very many channels to be managed and used at a time. To overcome this problem, we propose Polyharmonic-Staircase-Staggered (PSS) broadcasting approach that uses the Polyharmonic and Staircase approaches for the head part transmission and the Staggered approach for the tail part transmission. It is simple and bandwidth efficient. The numerical results demonstrate that our approach shows viewer's waiting time is comparable to that in the Harmonic approach with a slight increase in the bandwidth requirement, and saves the buffer requirement by about 60\% compared to the Harmonic broadcasting approach by simply adjusting the video partitioning coefficient factor. More importantly, our approach shows the best performance in terms of the number of segments and the number of channels managed and used simultaneously, which is a critical factor in real operation of VoD services. Lastly, we present how to configure the system adaptively according to the video partitioning coefficient.

토양내 총 NAPL과 공기접촉 NAPL의 측정을 위한 분별 NAPL 분배 추적자 기술의 개발

  • 최경민;김헌기
    • Proceedings of the Korean Society of Soil and Groundwater Environment Conference
    • /
    • 2004.09a
    • /
    • pp.29-32
    • /
    • 2004
  • Gaseous partitioning tracer test has been used for determining the volume and spatial distribution of residual non-aqueous phase liquid (NAPL) in the unsaturated soils. In this study, an experimental method for measuring the content of gas-exposed NAPL as well as that of total NAPL in a sand during air sparging was developed. Two different gaseous phase NAPL-partitioning tracers were used; n-pentane, with very low water solubility, was used as the tracer that partitions into NAPL that is only in contact with the mobile gas, and chloroform, with fairly good water solubility, was selected for detecting total NAPL content in the sand. Helium and difluromethanewere used as the non- reactive tracer and water-partitioning tracers, respectively. Using n-decane as a model NAPL (NAPL saturation of 0.018), 25.6% of total NAPL was detected by n-pentane at the water saturation of 0.68. Oniy 9.1% of total NAPL was detected by n-pentane at the water saturation of 0.84. This result implies that the quantity of gas-exposed NAPL increased about three times when the water saturation decreased from 0.84 to 0.68. At the water saturation of 0.68, more than 90% of total NAPL was detected by chloroform while 65.8% of total NAPL was detected by chloroform at the water saturation of 0.84. Considering that the removal rate of NAPL during air sparging for NAPL-contaminated aquifer is expected to be greatly dependent upon the spatial arrangement of NAPL phase with respect to the mobile gas, this new approach may provide useful information for investigating the mass transfer process during air-driven remedial processes fer NAPL-contaminated subsurface environment.

  • PDF

Aerial Video Summarization Approach based on Sensor Operation Mode for Real-time Context Recognition (실시간 상황 인식을 위한 센서 운용 모드 기반 항공 영상 요약 기법)

  • Lee, Jun-Pyo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.6
    • /
    • pp.87-97
    • /
    • 2015
  • An Aerial video summarization is not only the key to effective browsing video within a limited time, but also an embedded cue to efficiently congregative situation awareness acquired by unmanned aerial vehicle. Different with previous works, we utilize sensor operation mode of unmanned aerial vehicle, which is global, local, and focused surveillance mode in order for accurately summarizing the aerial video considering flight and surveillance/reconnaissance environments. In focused mode, we propose the moving-react tracking method which utilizes the partitioning motion vector and spatiotemporal saliency map to detect and track the interest moving object continuously. In our simulation result, the key frames are correctly detected for aerial video summarization according to the sensor operation mode of aerial vehicle and finally, we verify the efficiency of video summarization using the proposed mothed.

CHARMS: A Mapping Heuristic to Explore an Optimal Partitioning in HW/SW Co-Design (CHARMS: 하드웨어-소프트웨어 통합설계의 최적 분할 탐색을 위한 매핑 휴리스틱)

  • Adeluyi, Olufemi;Lee, Jeong-A
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.9
    • /
    • pp.1-8
    • /
    • 2010
  • The key challenge in HW/SW co-design is how to choose the appropriate HW/SW partitioning from the vast array of possible options in the mapping set. In this paper we present a unique and efficient approach for addressing this problem known as Customized Heuristic Algorithm for Reducing Mapping Sets(CHARMS). CHARMS uses sensitivity to individual task computational complexity as well the computed weighted values of system performance influencing metrics to streamline the mapping sets and extract the most optimal cases. Using H.263 encoder, we show that CHARMS sieves out 95.17% of the sub-optimal mapping sets, leaving the designer with 4.83% of the best cases to select from for run-time implementation.

Dietary composition of two coexisting bat species, Myotis ikonnikovi and Plecotus ognevi, in the Mt. Jumbong forests, South Korea

  • Sungbae Joo;Injung An;Sun-Sook Kim
    • Journal of Ecology and Environment
    • /
    • v.47 no.4
    • /
    • pp.168-176
    • /
    • 2023
  • Background: Many insectivorous bats have flexible diets, and the difference in prey item consumption among species is one of the key mechanisms that allows for the avoidance of interspecies competition and promotes coexistence within a microhabitat. In Korea, of the 24 bat species that are known to be distributed, eight insectivorous bats use forest areas as both roosting and foraging sites. Here, we aimed to understand the resource partitioning and coexistence strategies between two bat species, Myotis ikonnikovi and Plecotus ognevi, cohabiting the Mt. Jumbong forests, by comparing the differences in dietary consumption based on habitat utilization. Results: Upon examining their dietary composition using the DNA meta-barcoding approach, we identified 403 prey items (amplicon sequence variants). A greater prey diversity including Lepidoptera, Diptera, Coleoptera, and Ephemeroptera, was detected from M. ikonnikovi, whereas most prey items identified from P. ognevi belonged to Lepidoptera. The diversity index of prey items was higher for M. ikonnikovi (H': 5.67, D: 0.995) than that for P. ognevi (H': 4.31, D: 0.985). Pianka's index value was 0.207, indicating little overlap in the dietary composition of these bat species. Our results suggest that M. ikonnikovi has a wider diet composition than P. ognevi. Conclusions: Based on the dietary analysis results, our results suggests the possibility of differences in foraging site preferences or microhabitat utilization between two bat species cohabiting the Mt. Jumbong. In addition, these differences may represent one of the important mechanism in reducing interspecific competition and enabling coexistence between the two bat species. We expected that our results will be valuable for understanding resource partitioning and the coexistence of bats inhabiting the Korean forests.

Characteristic Factors of Air-Plant Partitioning of PCBs (PCBs의 대기-식물간 분배 특성 인자들)

  • 여현구;최민규;천만영;김태욱;선우영
    • Journal of Korean Society for Atmospheric Environment
    • /
    • v.17 no.5
    • /
    • pp.415-424
    • /
    • 2001
  • The concentrations of PCBs (polychlorinated biphenyls) in air and plants (MOrus allba, Allum turberosum) were measured every other week at Hankyong University located in Ansung, Kyoung-ki province, Korea from July to November in 1999. Total concentrations of PCBs in air ranged from 19.8 to 71.9 pg/ $m^3$. It was observed in air that the concentrations of tai-chlorinated biphenyls(CBs) were higher than those of other PCB homologs probably due to their higher vapor pressure. Total concentrations of PCBs in plants ranged from 24.5 to 1,287 pg/g dry weight for Morus allba and 26.5 to 337 pg/g dry weight for Allum turberosum. A positive linear correlation was observed between log plant-air partition coefficients ( $m^3$air/g plant dry weight-defined here as the scavenging coefficient[S.C]) and log octanol-air partition coefficients ( $K_{oa}$ ) for each plant. In this study, slope of log S.C and log $K_{oa}$ for Morus allba, Allum turberosum were 1.07 ($R^2$= 0.83, p<0.01), 0.84 ($R^2$=0.53, p<0.05), respectively. This means that these plants may approach to equilibrium for air-plant partitioning.

  • PDF

Designing a Distribution Network for Faster Delivery of Online Retailing : A Case Study in Bangkok, Thailand

  • Amchang, Chompoonut;Song, Sang-Hwa
    • The Journal of Industrial Distribution & Business
    • /
    • v.9 no.5
    • /
    • pp.25-35
    • /
    • 2018
  • Purpose - The purpose of this paper is to partition a last-mile delivery network into zones and to determine locations of last mile delivery centers (LMDCs) in Bangkok, Thailand. Research design, data, and methodology - As online shopping has become popular, parcel companies need to improve their delivery services as fast as possible. A network partition has been applied to evaluate suitable service areas by using METIS algorithm to solve this scenario and a facility location problem is used to address LMDC in a partitioned area. Research design, data, and methodology - Clustering and mixed integer programming algorithms are applied to partition the network and to locate facilities in the network. Results - Network partition improves last mile delivery service. METIS algorithm divided the area into 25 partitions by minimizing the inter-network links. To serve short-haul deliveries, this paper located 96 LMDCs in compact partitioning to satisfy customer demands. Conclusions -The computational results from the case study showed that the proposed two-phase algorithm with network partitioning and facility location can efficiently design a last-mile delivery network. It improves parcel delivery services when sending parcels to customers and reduces the overall delivery time. It is expected that the proposed two-phase approach can help parcel delivery companies minimize investment while providing faster delivery services.