• Title/Summary/Keyword: Merging method

Search Result 468, Processing Time 0.024 seconds

Abundance Anomalies and Star Formation History of merging BCDs

  • Jeong, Ji-Won;Seong, Eon-Chang;Lee, Su-Chang;Gyeong, Jae-Man
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.36 no.1
    • /
    • pp.58.1-58.1
    • /
    • 2011
  • We present elemental abundances of 95 blue compact dwarf galaxies (BCDs) at z=0.2~0.35 using the Sloan Digital Sky Survey (SDSS) DR7. We derived element abundances using Te method. We found that nitrogen abundance of merging BCDs are more enriched than normal BCDs by fast rotating young massive star. On the other hand, neon and oxygen abundances for merging BCDs are slightly lower than the normal BCDs. This might be result from the dilution by metal-poor gas infall during the interaction. This means that merging BCDs undergone star formation event for a long time than normal BCDs and we trying to explain using STARLIGHT code and various star formation rates (SFRs) ratios. At a result, merging BCDs have older stellar population (>10 Myr) more than normal BCDs and have clear distinction in elements abundances versus Ha/UV diagram. We also discuss the characteristics of post merger candidate using FUV to NUV ratios.

  • PDF

Cell-interleavd VC merging scheme for multipoint-to-multipoint communication in ATM network (ATM 망에서의 다자간 통신을 위한 cell-interleaved VC merging 기법)

  • 신상헌
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.9A
    • /
    • pp.1431-1440
    • /
    • 2000
  • In order to support efficiently the multimedia applications, such as virtual classroom, video conferencing and tele-medical, the efficient multipoint-to-multipoint(MP-to-MP) connection management function is essential. Shared tree is reported as the most useful method for this purpose. In this paper we propose a new MP-to-MP connection setup & management scheme, called CIMA(Cell Interleaved Multiplexing on ATM) scheme,which is a VC merging method for MP-to-MP communication using shared tree. In the CIMA scheme,MRM cell delivers the cell merging information to the next node. The receiving node can identfy cells which arrived through a channel using the same VPI/VCI by the merging information in the MRM cell. Therefore the CIMA scheme can solve easily the Cell Interleaving Problem(CIP) that happens in VC merging. We analyzed the overhead of the proposed CIMA by mathematical analysis,and simulated the buffer usage of CIMA with OPNET. As the result of analysis,we found that the CIMA scheme has acceptable merging overhead and doesn't cause the buffer scare problem.

  • PDF

Data Prefetching Effect of the Stride Merging-Arrays Method (스트라이드 배열 병합 방법의 데이터 선인출 효과)

  • Jeong, In-Beom;Lee, Jun-Won
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.11
    • /
    • pp.1429-1436
    • /
    • 1999
  • 데이타들에 대한 선인출 효과를 얻기 위하여 캐쉬 메모리의 캐쉬 블록은 다중 워드로 구성된다. 그러나 선인출된 데이타들이 사용되지 않을 경우 캐쉬 메모리가 낭비되고 따라서 캐쉬 실패율이 증가한다. 데이타 배열 병합 방법은 캐쉬 실패 원인의 하나인 캐쉬 충돌 실패를 감소시키기 위하여 사용되고 있다. 그러나 기존의 배열 병합 방법은 유용하지 못한 데이타들을 캐쉬 블록에 선인출하는 현상을 보인다. 본 논문에서는 이러한 현상을 개선한 스트라이드 배열 병합을 제안한다. 모의시험에서 캐쉬 블록이 다중 워드로 구성된 경우 스트라이드 배열 병합은 캐쉬 충돌 실패를 감소시킬 뿐 만 아니라 유용한 데이타 선인출을 증가 시키므로 캐쉬 성능을 향상시킴을 보여준다. 또한 이렇게 향상된 캐쉬 성능은 프로세서 증가에 따른 확장성 있는 프로그램 성능을 나타낸다.Abstract The cache memory is composed of cache lines with multiple words to achieve the effect of data prefetching. However, if the prefetched data are not used, the spaces of the cache memory are wasted and thus the cache miss rate increases. The data merging-arrays method is used for the sake of the reduction of the cache conflict misses. However, the existing merging-arrays method results in the useless data prefetching. In this paper, a stride merging-arrays method is suggested for improving this phenomenon. Simulation results show that when a cache line is composed of multiple words, the stride merging-arrays method increases the cache performance due to not only the reduction of cache conflict misses but also the useful data prefetching. This enhanced cache performance also represents the more scalable performance of parallel applications according to increasing the number of processors.

Comparison of Different Methods to Merge IRS-1C PAN and Landsat TM Data (IRS-1C PAN 데이터와 Landsat TM 데이터의 종합방법 비교분석)

  • 안기원;서두천
    • Korean Journal of Remote Sensing
    • /
    • v.14 no.2
    • /
    • pp.149-164
    • /
    • 1998
  • The main object of this study was to prove the effectiveness of different merging methods by using the high resolution IRS(Indian Remote Sensing Satellite)-1C panchromatic data and the multispectral Landsat TM data. The five methods used to merging the information contents of each of the satellite data were the intensity-hue-saturation(IHS), principal component analysis(PCA), high pass filter(HPF), ratio enhancement method and look-up-table(LUT) procedures. Two measures are used to evaluate the merging method. These measures include visual inspection and comparisons of the mean, standard deviation and root mean square error between merged image and original image data values of each band. The ratio enhancement method was well preserved the spectral characteristics of the data. From visual inspection, PCA method provide the best result, HPF next, ratio enhancement, IHS and LUT method the worst for the preservation of spatial resolution.

3D Visualization for Extremely Dark Scenes Using Merging Reconstruction and Maximum Likelihood Estimation

  • Lee, Jaehoon;Cho, Myungjin;Lee, Min-Chul
    • Journal of information and communication convergence engineering
    • /
    • v.19 no.2
    • /
    • pp.102-107
    • /
    • 2021
  • In this paper, we propose a new three-dimensional (3D) photon-counting integral imaging reconstruction method using a merging reconstruction process and maximum likelihood estimation (MLE). The conventional 3D photon-counting reconstruction method extracts photons from elemental images using a Poisson random process and estimates the scene using statistical methods such as MLE. However, it can reduce the photon levels because of an average overlapping calculation. Thus, it may not visualize 3D objects in severely low light environments. In addition, it may not generate high-quality reconstructed 3D images when the number of elemental images is insufficient. To solve these problems, we propose a new 3D photon-counting merging reconstruction method using MLE. It can visualize 3D objects without photon-level loss through a proposed overlapping calculation during the reconstruction process. We confirmed the image quality of our proposed method by performing optical experiments.

Reusable HEVC Design in 3D-HEVC

  • Heo, Young Su;Bang, Gun;Park, Gwang Hoon
    • ETRI Journal
    • /
    • v.38 no.5
    • /
    • pp.818-828
    • /
    • 2016
  • This paper proposes a reusable design for the merging process used in three-dimensional High Efficiency Video Coding (3D-HEVC), which can significantly reduce the implementation complexity by eliminating duplicated module redundancies. The majority of inter-prediction coding tools used in 3D-HEVC are utilized through a merge mode, whose extended merging process is based on built-in integration to completely wrap around the HEVC merging process. Consequently, the implementation complexity is unavoidably very high. To facilitate easy market implementation, the design of a legacy codec should be reused in an extended codec if possible. The proposed 3D-HEVC merging process is divided into the base merging process of reusing HEVC modules and reprocessing process of refining the existing processes that have been newly introduced or modified for 3D-HEVC. To create a reusable design, the causal and mutual dependencies between the newly added modules for 3D-HEVC and the reused HEVC modules are eliminated, and the ineffective methods are simplified. In an application of the proposed reusable design, the duplicated reimplementation of HEVC modules, which account for 50.7% of the 3D-HEVC merging process, can be eliminated while maintaining the same coding efficiency. The proposed method has been adopted as a normative coding tool in the 3D-HEVC international standard.

An Efficient VPI/VCI Allocation Algorithm for ABR Multipoint-to-point Connection in ATM Networks (ATM 망에서의 ABR 다점 대 점 연결을 위한 효과적인 VPI/VCI 할당 알고리즘)

  • 천상훈;곽경섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9B
    • /
    • pp.1661-1667
    • /
    • 1999
  • In this paper, we propose an efficient VP extension algorithm for ABR multipoint-to-point connection in ATM networks. The VC merging or VP merging is used to implement ABR multipoint-to-point connection. We use the VP merging technique. To solve the scarcity problem of VP resources, we propose an efficient VP extension algorithm. Since the proposed scheme follows the standard VPI/VCI format, it doesn’t require another table according to the VP extension. We compare the proposed scheme with VC merging algorithm. The result shows that the proposed method can provide fair bandwidth allocation among the sources in multipoint-to-point connection.

  • PDF

Merging technique for evapotranspiration based on in-situ, satellite, and reanalysis data using modifed KGE fusion method (수정된 KGE 방법을 활용한 지점, 인공위성, 재분석 자료 기반 증발산 융합 기술)

  • Baik, Jongjin;Jeong, Jaehwan;Park, Jongmin;Choi, Minha
    • Journal of Korea Water Resources Association
    • /
    • v.52 no.1
    • /
    • pp.61-70
    • /
    • 2019
  • The modified Kling-Gupta efficiency fusion method to merge actual evapotranspiration was proposed and compared with the simple Taylor skill's score method using Global Land Data Assimilation System (GLDAS), Global Land Evaporation Amsterdam Model (GLEAM), MODIS Global Evapotranspiration Project (MOD16), and the flux tower on three different land cover types over the Korean peninsula and China. In the results of the weights estimated from two actual evapotranspiration merging techniques (i.e., STS and KGF), the weights of reanalysis data (i.e, GLDAS and GLEAM) in cropland and grassland showed similar performance, while the results of weights are different according to the merging techniques in forest. Both two merging techniques showed better results than original dataset in grassland and forest. However, there were no improvement in cropland compared to the other land cover types. The results of the KGF method slightly improved compared to those of the STS in grassland and forest.

Automatic Merging of Distributed Topic Maps based on T-MERGE Operator (T-MERGE 연산자에 기반한 분산 토픽맵의 자동 통합)

  • Kim Jung-Min;Shin Hyo-Pil;Kim Hyoung-Joo
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.9
    • /
    • pp.787-801
    • /
    • 2006
  • Ontology merging describes the process of integrating two ontologies into a new ontology. How this is done best is a subject of ongoing research in the Semantic Web, Data Integration, Knowledge Management System, and other ontology-related application systems. Earlier research on ontology merging, however, has studied for developing effective ontology matching approaches but missed analyzing and solving methods of problems of merging two ontologies given correspondences between them. In this paper, we propose a specific ontology merging process and a generic operator, T-MERGE, for integrating two source ontologies into a new ontology. Also, we define a taxonomy of merging conflicts which is derived from differing representations between input ontologies and a method for detecting and resolving them. Our T-MERGE operator encapsulates the process of detection and resolution of conflicts and merging two entities based on given correspondences between them. We define a data structure, MergeLog, for logging the execution of T-MERGE operator. MergeLog is used to inform detailed results of execution of merging to users or recover errors. For our experiments, we used oriental philosophy ontologies, western philosophy ontologies, Yahoo western philosophy dictionary, and Naver philosophy dictionary as input ontologies. Our experiments show that the automatic merging module compared with manual merging by a expert has advantages in terms of time and effort.

Simple and Highly Efficient Droplet Merging Method Using a Microfluidic Device (미세유체소자를 이용한 간단하고 효율적인 액적의 병합)

  • Jin, Byung-Ju;Kim, Young-Won;Yoo, Jung-Yul
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.33 no.3
    • /
    • pp.178-185
    • /
    • 2009
  • Simple and highly efficient droplet merging method is proposed, which enables two nanoliter or picoliter droplets to merge regularly in a straight microchannel. Using a cross channel with inflows of one oil phase through the main channel and two water phases through the side channels, two droplets of different sizes can be generated alternatingly in accordance with flow rate difference of the water phases. It is shown that for a fixed oil phase flow rate, the flow rate of one water phase required for alternating droplet generation increases linearly with the flow rate of another water phase. By this method, the droplets are merged with 100 % efficiency without any additional driving forces.