• Title/Summary/Keyword: Duplication

Search Result 803, Processing Time 0.03 seconds

A Case of Short Arm Deletion and Long Arm Duplication at Chromosome 3 (3번 염색체 단완 결실과 장완 중복을 동반한 1례)

  • Kong, Seung Hyun;Seo, Jeong Il;Kang, Jang Hui;Jung, So Young;Mok, Ji Sun
    • Clinical and Experimental Pediatrics
    • /
    • v.48 no.12
    • /
    • pp.1389-1389
    • /
    • 2005
  • The long arm duplication of chromosome 3 was reported for the first time in 1966 by Falek et al., and Hirschhorn et al. came to identify the duplication of 3q21${\rightarrow}$qter region in 1973. In most cases of duplication 3q syndrome patients, pure duplication of 3qter is believed to be rare and is often reported accompanied with deletion of another segment of the chromosome. Approximately 75 percent of parents of the patient in the meantime have been demonstrated to have unbalanced translocations or inversions of the chromosome. Partial deletion of the distal part of the short arm of chromosome 3 was first reported by Verjaal and De Nef in 1978 and terminal deletion of chromosome 3 (3p25-qter) has been observed in most cases. In karyotyping of chromosomes of immature infants showing the manifestations of flat occiputs, low set ears, hypertelorism, broad nasal roots, thin lips, web necks, hypotonia, hypertrichosis skin, cryptorchidism etc, we experienced a case diagnosed as 46,XY, rec(3)dup(3)(q21)del(3)(p25)inv(3)(p25q21).

A Task Prioritizing Algorithm Optimized for Task Duplication Based Processor Allocation Method (태스크 복제 기반 프로세서 할당 방법에 최적화된 태스크 우선순위 결정 알고리즘)

  • Song, In-Seong;Yoon, Wan-Oh;Lee, Chang-Ho;Choi, Sang-Bang
    • Journal of Internet Computing and Services
    • /
    • v.12 no.6
    • /
    • pp.1-17
    • /
    • 2011
  • The performance of DHCS depends on the algorithm which schedules input DAG. However, as the task scheduling problem in DHCS is an NP-complete problem, heuristic approach has to be made. Task scheduling algorithm consists of task prioritizing phase and processor allocation phase, and most of studies are considering both phases together. In this paper, we focus on task prioritizing phase and propose a WPD algorithm which is optimized for task duplication based processor allocation method. For an evaluation of the proposed WPD algorithm, we combined WPD algorithm with processor allocation phase of HMPID, HCPFD, HCT algorithms, which are using task duplication based processor allocation method. The results show that WPD algorithm makes a better use of task duplication than conventional task prioritizing methods and provides 9.58% better performance than HCPFD algorithm, 1.31% than HCT algorithm.

Quantitative Safety Assessment and Effectiveness Analysis for Duplication of ATS Routes (복선 항공로에 대한 정량적 안전평가 및 효과에 관한 분석)

  • Se-eun Park;Sun-min Park;Hui-yang Kim
    • Journal of Advanced Navigation Technology
    • /
    • v.28 no.4
    • /
    • pp.480-489
    • /
    • 2024
  • The Ministry of Land, Infrastructure and Transport duplicated a section of ATS Route Y579 connecting Jeju and Busan in 2022 to enhance aviation safety and operational efficiency. Before duplication, an offset procedure was applied to separate aircraft flying in opposite direction by deviating them to the right of their intended flight paths. However, on December 1, 2022, this offset procedure was abolished and replaced with two parallel route, Y571(towards Busan) and Y572(towards Jeju), to improve safety and efficiency. The duplication of ATS Routes has significant implications in various aspects. This study analyzes the safety of the newly established ATS Routes and compares their safety with the previously applied offset procedure to evaluate the effectiveness of the duplication. Additionally, it presents the significance from the perspective of airspace operation. A safety assessment has conducted using a modified version of the Reich CRM (collision risk model). The analysis results confirms that the level of safety improves after the duplication and that there were benefits in terms of airspace utilization.

Implementation and Fault-tolerance Tests of Load Balanced and Duplicated Active-Active Web Servers (로드 밸런싱 Active-Active 방식의 웹 서버 이중화 구축 및 결함내성 시험)

  • Choi, Jae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.1
    • /
    • pp.63-71
    • /
    • 2014
  • In this paper we researched on the Duplication Techniques for Active-Active Web Servers. Rsync and crontab utilities make copy periodically between web servers and maintain the same status. Load Balancing Server makes web servers load balanced and fast servicing by executing web servers alternatively. Even though one web server stops due to some critical errors, the remaining web server can take over and provide services continuously.

Esophageal Duplication Cyst -A Case Report- (식도 중복 낭종 -수술 치험 1례-)

  • 이현석
    • Journal of Chest Surgery
    • /
    • v.28 no.9
    • /
    • pp.869-871
    • /
    • 1995
  • Esophageal duplication cysts are uncommon, benign lesions of the esophagus. They are rare congenital foregut anomalies. To be considered an esophageal duplication cyst, a lesion must meet the following criteria:1 the cyst in the esophageal wall 2 the cyst is covered with a muscularis propria,generally of two layers and 3 the cyst has an epithelial lining consistent with that of the 4 week embryo, which may be columnar or pseudostratified columnar, and may be ciliated. Herein we report a case of an esophageal cyst located within the thoracic cavity, which is, to the best of our knowledge, the first case reported in Korea. Surgery is generally the treatment of choice for esophageal cyst, and was indicated in this case for the diagnosis and management of symptoms attributable to the cyst.

  • PDF

Design of Semantic Search System for the Search of Duplicated Geospatial Projects (공간정보사업의 중복사업 검색을 위한 의미기반검색 시스템의 설계)

  • Park, Sangun;Lim, Jay Ick;Kang, Juyoung
    • Journal of Information Technology Services
    • /
    • v.12 no.3
    • /
    • pp.389-404
    • /
    • 2013
  • Geospatial information, which is one of social overhead capital, is predicted as a core growing industry for the future. The production of geospatial information requires a huge budget, so it is very important objective of the policy for geospatial information to prevent the duplication of geospatial projects. In this paper, we proposed a semantic search system which extracts possible duplication of geospatial projects by using ontology for geospatial project administration. In order to achieve our goal, we suggested how to construct and utilize geospatial project ontology, and designed the architecture and process of the semantic search. Moreover, we showed how the suggested semantic search works with a duplicated projects search scenario. The suggested system enables a nonprofessional can easily search for duplicated projects, therefore we expect that our research contributes to effective and efficient duplication review process for geospatial projects.

AMALGAMATED DUPLICATION OF SOME SPECIAL RINGS

  • Tavasoli, Elham;Salimi, Maryam;Tehranian, Abolfazl
    • Bulletin of the Korean Mathematical Society
    • /
    • v.49 no.5
    • /
    • pp.989-996
    • /
    • 2012
  • Let R be a commutative Noetherian ring and let I be an ideal of R. In this paper we study the amalgamated duplication ring $R{\bowtie}I$ which is introduced by D'Anna and Fontana. It is shown that if R is generically Cohen-Macaulay (resp. generically Gorenstein) and I is generically maximal Cohen-Macaulay (resp. generically canonical module), then $R{\bowtie}I$ is generically Cohen-Macaulay (resp. generically Gorenstein). We also de ned generically quasi-Gorenstein ring and we investigate when $R{\bowtie}I$ is generically quasi-Gorenstein. In addition, it is shown that $R{\bowtie}I$ is approximately Cohen-Macaulay if and only if R is approximately Cohen-Macaulay, provided some special conditions. Finally it is shown that if R is approximately Gorenstein, then $R{\bowtie}I$ is approximately Gorenstein.

Keyword Analysis Based Document Compression System

  • Cao, Kerang;Lee, Jongwon;Jung, Hoekyung
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.1
    • /
    • pp.48-51
    • /
    • 2018
  • The traditional documents analysis was centered on words based system was implemented using a morpheme analyzer. These traditional systems can classify used words in the document but, cannot help to user's document understanding or analysis. In this problem solved, System needs extract for most valuable paragraphs what can help to user understanding documents. In this paper, we propose system extracts paragraphs of normalized XML document. User insert to system what filename when wants for analyze XML document. Then, system is search for keyword of the document. And system shows results searched keyword. When user choice and inserts keyword for user wants then, extracting for paragraph including keyword. After extracting paragraph, system operating maintenance paragraph sequence and check duplication. If exist duplication then, system deletes paragraph of duplication. And system informs result to user what counting each keyword frequency and weight to user, sorted paragraphs.

A Fault-tolerant Task Scheduling Algorithm Supporting the Minimum Schedule Length (최소의 스케줄 길이를 유지하는 결함 허용 태스크 스케줄링 알고리즘)

  • Min, Byeong-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.4
    • /
    • pp.1201-1210
    • /
    • 2000
  • In order to tolerate faults which may occur during the execution of distributed tasks in high-performance parallel computer systems, tasks are duplicated on different processors. In this paper, by utilizing the task duplication based scheduling algorithm, a new task scheduling algorithm which duplicates each task on more than two different processors with the minimum schedule length is presented, and the number of processors required for the duplication is analyzed with the ratio of communication cost to computation time and the workload of the system. A simulation with various task graphs reveals that the number of processors required for the full-duplex fault-tolerant task scheduling with the obtainable minimum schedule length increases about 30% to 75% when compared with that of the task duplication based scheduling algorithm.

  • PDF

c-Cbl Acts as an E3 Ligase Against DDA3 for Spindle Dynamics and Centriole Duplication during Mitosis

  • Gwon, Dasom;Hong, Jihee;Jang, Chang-Young
    • Molecules and Cells
    • /
    • v.42 no.12
    • /
    • pp.840-849
    • /
    • 2019
  • The spatiotemporal mitotic processes are controlled qualitatively by phosphorylation and qualitatively by ubiquitination. Although the SKP1-CUL1-F-box protein (SCF) complex and the anaphase-promoting complex/cyclosome (APC/C) mainly mediate ubiquitin-dependent proteolysis of mitotic regulators, the E3 ligase for a large portion of mitotic proteins has yet to be identified. Here, we report c-Cbl as an E3 ligase that degrades DDA3, a protein involved in spindle dynamics. Depletion of c-Cbl led to increased DDA3 protein levels, resulting in increased recruitment of Kif2a to the mitotic spindle, a concomitant reduction in spindle formation, and chromosome alignment defects. Furthermore, c-Cbl depletion induced centrosome over-duplication and centriole amplification. Therefore, we concluded that c-Cbl controls spindle dynamics and centriole duplication through its E3 ligase activity against DDA3.