http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Computing the $$L_1$$ Geodesic Diameter and Center of a Polygonal Domain
Bae, Sang Won,Korman, Matias,Mitchell, Joseph S. B.,Okamoto, Yoshio,Polishchuk, Valentin,Wang, Haitao Springer-Verlag 2017 Discrete & Computational Geometry Vol.57 No.3
<P>For a polygonal domain with h holes and a total of n vertices, we present algorithms that compute the geodesic diameter in time and the geodesic center in time, respectively, where denotes the inverse Ackermann function. No algorithms were known for these problems before. For the Euclidean counterpart, the best algorithms compute the geodesic diameter in or time, and compute the geodesic center in time. Therefore, our algorithms are significantly faster than the algorithms for the Euclidean problems. Our algorithms are based on several interesting observations on shortest paths in polygonal domains.</P>
Genetic risk factors for rheumatoid arthritis differ in caucasian and Korean populations
Lee, Hye-Soon,Korman, Benjamin D.,Le, Julie M.,Kastner, Daniel L.,Remmers, Elaine F.,Gregersen, Peter K.,Bae, Sang-Cheol Wiley Subscription Services, Inc., A Wiley Company 2009 Vol.60 No.2
<B>Objective</B><P>Recent studies have identified a number of novel rheumatoid arthritis (RA) susceptibility loci in Caucasian populations. The aim of this study was to determine whether the genetic variants at 4q27, 6q23, CCL21, TRAF1/C5, and CD40 identified in Caucasians are also associated with RA in a Korean case–control collection. We also comprehensively evaluated the genetic variation within PTPN22, a well-established autoimmune disease–associated gene.</P><B>Methods</B><P>We designed an experiment to thoroughly evaluate the PTPN22 linkage disequilibrium region, using tag single-nucleotide polymorphisms (SNPs) and disease-associated SNPs at 5 RA-associated loci recently identified in Caucasians, in 1,128 Korean patients with RA and 1,022 ethnically matched control subjects. We also resequenced the PTPN22 gene to seek novel coding variants that might be contributing to disease in this population.</P><B>Results</B><P>None of the susceptibility loci identified in Caucasian patients with RA contributed significantly to disease in Koreans. Although tag SNPs covering the PTPN22 linkage disequilibrium block were polymorphic, they did not reveal any disease association, and resequencing did not identify any new common coding region variants in this population. The 6q23 and 4q27 SNPs assayed were nonpolymorphic in this population, and the TRAF1/C5, CD40, and CCL21 SNPs did not show any evidence for association with RA in this population of Korean patients.</P><B>Conclusion</B><P>The genetic risk factors for RA are different in Caucasian and Korean patients. Although patients of different ethnic groups share the HLA region as a major genetic risk locus, most other genes shown to be significantly associated with disease in Caucasians appear not to play a role in Korean patients with RA.</P>
교수와 학생의 문화지능 개발을 통한 대학 네트워킹과 협력 - 남부연방대학교 사례를 중심으로 -
카르포프스카야 나탈리아(Natalia V Karpovskaya),코르만 예카테리나(Ekaterina A Korman),이지은(Ji Eun Lee) 부산대학교 지역혁신역량교육연구센터 2019 교육공동체연구와실천 Vol.1 No.2
연구목적: 이 논문에서 학생 및 교수와 관련하여 러시아 남부연방대학에 적용된 문화지능(CQ)개발 방법에대해 다루고 있다. 연구방법: 제시한 CQ 개발 방법에는 여러 혁신적 교육기술(예를 들면, Galaxia Espiral), 디지털 교육〮학술 자료가 포함된다. 교수와 학생의 CQ를 개발하는 데 가장 성공적인 방법으로 인터렉티브학술 강연, 국제 학생 온라인 포럼, 번역 워크숍 등을 고려할 수 있다. 논의 및 결론: CQ 개발은 공동의관심사, 공유된 가치, 강력한 상호보완성을 기반으로 한 대학 네트워크 확장, 새로운 국제협력 가능성에 기여한다. Purpose: The article is dedicated to the description of some methods of cultural intelligence (CQ) development applied in Southern Federal University in Russia both regarding students and teachers. Method: The proposed methods of CQ include a number of innovative educational technologies (p.ej. Galaxia Espiral), digital educational and scientific resources. Among the most successful ways to develop teachers and students CQ we consider the organization of interactive academic lectures, international student on-line forums, translation workshops, etc. Results & Conclusion: CQ development contributes to University networking development and new international cooperation perspectives based on common interests, shared values and strong complementarities.
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
Ahn, H. K.,Barba, L.,Bose, P.,Carufel, J. L.,Korman, M.,Oh, E. Springer Science + Business Media 2016 Discrete & Computational Geometry Vol.56 No.4
<P>Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance between them is the length of the shortest path that connects them among all paths contained in P. The geodesic center of P is the unique point in P that minimizes the largest geodesic distance to all other points of P. In 1989, Pollack et al. (Discrete Comput Geom 4(1): 611-626, 1989) showed an -time algorithm that computes the geodesic center of P. Since then, a longstanding question has been whether this running time can be improved. In this paper we affirmatively answer this question and present a deterministic linear-time algorithm to solve this problem.</P>
Faster algorithms for growing prioritized disks and rectangles
Ahn, Hee-Kap,Bae, Sang Won,Choi, Jongmin,Korman, Matias,Mulzer, Wolfgang,Oh, Eunjin,Park, Ji-won,van Renssen, André,Vigneron, Antoine Elsevier 2019 Computational geometry Vol.80 No.-
<P><B>Abstract</B></P> <P>Motivated by map labeling, Funke, Krumpe, and Storandt [IWOCA 2016] introduced the following problem: we are given a sequence of <I>n</I> disks in the plane. Initially, all disks have radius 0, and they grow at constant, but possibly different, speeds. Whenever two disks touch, the one with the higher index disappears. The goal is to determine the elimination order, i.e., the order in which the disks disappear. We provide the first general subquadratic algorithm for this problem. Our solution extends to other shapes (e.g., rectangles), and it works in any fixed dimension.</P> <P>We also describe an alternative algorithm that is based on quadtrees. Its running time is O ( n ( log n + min { log Δ , log Φ } ) ) , where Δ is the ratio of the fastest and the slowest growth rate and Φ is the ratio of the largest and the smallest distance between two disk centers. This improves the running times of previous algorithms by Funke, Krumpe, and Storandt [IWOCA 2016], Bahrdt et al. [ALENEX 2017], and Funke and Storandt [EuroCG 2017].</P> <P>Finally, we give an Ω ( n log n ) lower bound, showing that our quadtree algorithms are almost tight.</P>
Bae, Sang Won,Baffier, Jean-Francois,Chun, Jinhee,Eades, Peter,Eickmeyer, Kord,Grilli, Luca,Hong, Seok-Hee,Korman, Matias,Montecchiani, Fabrizio,Rutter, Ignaz,Tó,th, Csaba D. Elsevier 2018 Theoretical computer science Vol.745 No.-
<P><B>Abstract</B></P> <P>We introduce the family of <I>k-gap-planar graphs</I> for k ≥ 0 , i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most <I>k</I> of its crossings. This definition is motivated by applications in edge casing, as a <I>k</I>-gap-planar graph can be drawn crossing-free after introducing at most <I>k</I> local gaps per edge. We present results on the maximum density of <I>k</I>-gap-planar graphs, their relationship to other classes of beyond-planar graphs, characterization of <I>k</I>-gap-planar complete graphs, and the computational complexity of recognizing <I>k</I>-gap-planar graphs.</P>
Covering points by disjoint boxes with outliers
Ahn, H.K.,Bae, S.W.,Demaine, E.D.,Demaine, M.L.,Kim, S.S.,Korman, M.,Reinbacher, I.,Son, W. Elsevier 2011 Computational Geometry Vol.44 No.3
For a set of n points in the plane, we consider the axis-aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n-k points. In this paper, we consider the boxes to be either squares or rectangles, and we want to minimize the area of the largest box. For general p we show that the problem is NP-hard for both squares and rectangles. For a small, fixed number p, we give algorithms that find the solution in the following running times: For squares we have O(n+klogk) time for p=1, and O(nlogn+k<SUP>p</SUP>log<SUP>p</SUP>k) time for p=2,3. For rectangles we get O(n+k<SUP>3</SUP>) for p=1 and O(nlogn+k<SUP>2+p</SUP>log<SUP>p-1</SUP>k) time for p=2,3. In all cases, our algorithms use O(n) space.