Clinical outcomes and pathological characteristics of immunoglobulin G4-related ophthalmic disease versus orbital inflammatory pseudotumor

( Hong Ki Min ),( Youn Soo Lee ),( Suk-woo Yang ),( Jennifer Lee ),( Seung-ki Kwok ),( Ji Hyeon Ju ),( Wan-uk Kim ),( Sung-hwan Park ) 대한내과학회 2019 The Korean Journal of Internal Medicine Vol.34 No.1

Background/Aims: This study investigated the clinical and pathological features of immunoglobulin G4 (IgG4)-related ophthalmic disease. To clarify the features, we compared IgG4-related ophthalmic disease and orbital inflammatory pseudotumor. Methods: We retrospectively reviewed the medical records of 103 patients who were initially diagnosed with orbital inflammatory pseudotumor, and identified 16 cases in which the diagnosis was based on surgical biopsy and for which data in medical records were sufficient for analysis. Immunohistochemical staining of pathological specimens for IgG and IgG4 was performed. Finally, six of IgG4-related ophthalmic disease patient and 10 of orbital inflammatory pseudotumor patient were analyzed. Results: The IgG4-related ophthalmic disease group had more IgG4-positive plasma cells and a higher IgG4/IgG plasma cell ratio than the orbital inflammatory pseudotumor group. Collagenous fibrosis and lacrimal gland involvement were significantly more frequent in the IgG4-related ophthalmic disease group. Dense lymphocyte infiltration, obliterative phlebitis, and bilateral lesions were more frequent in IgG4-related ophthalmic disease, but the differences were not significant. The recurrence-free period was shorter in the IgG4-related ophthalmic disease group (p = 0.035). Conclusions: The location of the lesion (lacrimal gland), count and ratio of IgG4-positive plasma cells, and collagenous fibrosis aid the diagnosis of IgG4-related ophthalmic disease in patients with idiopathic orbital mass-like lesions. In addition, maintenance therapy should be considered in patients with IgG4-related ophthalmic disease to prevent recurrence.

암 생존자의 암 재발 두려움 및 관련 요인

박소영,박아경 한국보건사회연구원 2023 保健社會硏究 Vol.43 No.1

This study aimed to examine the levels of fear of cancer recurrence (FCR), cancer-related characteristics and psychosocial characteristics among adult cancer survivors and to explore the associated risk factors for FCR. The subjects of this study were 93 adult cancer survivors aged 19 or over who had completed active cancer treatment and were on follow-up care. The data were collected from May 2022 to September 2022 through an online survey and descriptive statistics, correlation, t-test, ANOVA, and hierarchical multiple regression were used for data analyses. Some of the key findings are as follows. First, the average score of FCR was 18.96 out of 36 and more than a quarter of study participants (26.9%) reported moderate symptoms of depression. Second, after controlling socio-demographic factors, the explanatory power of the final model of hierarchical multiple regression was 23%, and it showed that diagnosis of multiple cancers (β=0.21, p<0.05) and depressive symptoms (β=0.25, p<0.05) were statistically significantly associated with FCR. In other words, being diagnosed with more than two cancers or having depressive symptoms were associated with higher fear of cancer recurrence. This study emphasized the importance of intervention for reducing FCR, cancer-related characteristics and psychosocial difficulties among cancer survivors with complex issues. 본 연구의 목적은 성인 암 생존자의 암 재발 두려움, 암 관련 건강 특성, 심리사회적 특성을 살펴보고 암 재발 두려움과 관련된 위험요인을 탐색하는 데 있다. 본 연구는 적극적인 암 치료를 마치고 사후관리 중인 만 19세 이상 성인 암 생존자 93명을 대상으로 하였다. 2022년 5월부터 2022년 9월까지 온라인 설문조사 방식으로 자료를 수집하였고, 기술통계, 상관관계, t-test, ANOVA, 위계적 다중 회귀분석 방법으로 자료를 분석하였다. 본 연구의 주요 결과는 다음과 같다. 첫째, 암 재발 두려움 평균은 36점 중 18.96점이었고, 전체 연구 참여자의 4분의 1 이상(26.9%)이 중간 정도 이상의 우울 증상을 보고하였다. 둘째, 인구사회학적 요인을 통제한 위계적 다중 회귀분석의 최종모형의 설명력은 23%였고, 중복 암 진단(β=0.21, p<0.05)과 우울 증상(β=0.25, p<0.05)이 암 재발 두려움과 통계적으로 유의하게 관련되었다. 다시 말하면, 2가지 이상의 암 진단이나 우울 증상이 높은 암 재발 두려움 수준과 연관되는 것으로 나타났다. 본 연구 결과는 복합적인 어려움을 지닌 암 생존자의 암 재발 두려움과 암 관련 건강 특성 그리고 심리사회적 어려움 감소를 위한 개입의 중요성을 강조한다.

A New Complexity Analysis of the SymMerge Algorithm

Pok-Son Kim(김복선) 한국지능시스템학회 2015 한국지능시스템학회논문지 Vol.25 No.5

SymMerge 알고리즘은 두 입력수열 υ와 ν (?υ?=m, ?ν?=n, m ≤ n)에 대한 효율적 병합 알고리즘이다. SymMerge 알고리즘의 비교횟수와 관련한 복잡도 분석을 하고자 하며 지금까지의 복잡도 분석은 복잡도의 상계값을 찾으므로 점근적 계산방법을 통해 이루어졌다. 이 논문에서는 지금까지의 분석방법과는 달리 SymMerge 알고리즘의 대표적 두 special case에 해당하는 “Symmetric case”와 “Maximum spanning case”에 있어서 병합을 위해 요구되는 정확한 비교횟수를 즉 비교횟수의 최소상계 값을 계산해 보이고자 한다. “Symmetric case”의 경우 사이즈 m=2<SUP>κ</SUP>, n-2<SUP>ι</SUP>, ι≥κ인 임의의 입력수열에 대해 SymMerge 알고리즘이 필요로 하는 비교횟수는 정확하게 m ? n/m+4m-? m-3이고 “Maximum spanning case”의 경우 사이즈 m=2<SUP>κ</SUP>, n=2<SUP>m</SUP>-m인 임의의 입력수열에 대해 SymMerge 알고리즘이 필요로 하는 비교횟수는 정확하게 1/2m²+(m+1)? m-3/2m+2임을 계산해 보인다. 추가로 이들 두 special case에 있어서 요구되는 비교횟수가 재귀적 함수에 의해 정의될 수 있음을 보인다. The SymMerge algorithm is an efficient merging algorithm for input sequences υ and ν of sizes ?υ?=m and ?ν?=n, m ≤ n. We consider complexity analysis for SymMerge algorithm regarding to the required number of comparisons. The focus of the previous complexity analysis was on finding the values of upper bounds, i.e. showing the asymptotical optimality. In this paper, in a different way from the previous complexity analysis, we show that the overall required number of comparisons for two representative special cases “symmetric case” and “maximum spanning case” can be calculated exactly i.e. the least upper bounds regarding to the required number of comparisons are calculated. Symmerge requires exactly m ? n/m+4m-? m-3 comparisons for symmetric case of sizes m=2<SUP>κ</SUP>, n-2<SUP>ι</SUP>, ι≥κ of input sequences and exactly 1/2m²+(m+1)? m-3/2m+2 comparisons for maximum spanning case of sizes m=2<SUP>κ</SUP>, n=2<SUP>m</SUP>-m of input sequences. Additionally we show that the complexity of the Symmerge algorithm regarding to the overall required number of comparisons for these special cases can be defined by recurrence relations.

SymMerge 알고리즘의 새로운 복잡도 분석

김복선 한국지능시스템학회 2015 한국지능시스템학회논문지 Vol.25 No.5

The SymMerge algorithm is an efficient merging algorithm for input sequences υ and ν of sizes |υ|=m and |ν|=n, m ≤ n. We consider complexity analysis for SymMerge algorithm regarding to the required number of comparisons. The focus of the previous complexity analysis was on finding the values of upper bounds, i.e. showing the asymptotical optimality. In this paper, in a different way from the previous complexity analysis, we show that the overall required number of comparisons for two representative special cases “symmetric case” and “maximum spanning case” can be calculated exactly i.e. the least upper bounds regarding to the required number of comparisons are calculated. Symmerge requires exactly m logn/m+4m-logm-3 comparisons for symmetric case of sizes m=2κ, n-2ι, ι≥κ of input sequences and exactly 1/2m²+(m+1)logm-3/2m+2 comparisons for maximum spanning case of sizes m=2κ, n=2m-m of input sequences. Additionally we show that the complexity of the Symmerge algorithm regarding to the overall required number of comparisons for these special cases can be defined by recurrence relations. SymMerge 알고리즘은 두 입력수열 υ와 ν (|υ|=m, |ν|=n, m ≤ n)에 대한 효율적 병합 알고리즘이다. SymMerge 알고리즘의 비교횟수와 관련한 복잡도 분석을 하고자 하며 지금까지의 복잡도 분석은 복잡도의 상계값을 찾으므로 점근적 계산방법을 통해 이루어졌다. 이 논문에서는 지금까지의 분석방법과는 달리 SymMerge 알고리즘의 대표적 두 special case에 해당하는 “Symmetric case”와 “Maximum spanning case”에 있어서 병합을 위해 요구되는 정확한 비교횟수를 즉 비교횟수의 최소상계 값을 계산해 보이고자 한다. “Symmetric case”의 경우 사이즈 m=2κ, n-2ι, ι≥κ인 임의의 입력수열에 대해 SymMerge 알고리즘이 필요로 하는 비교횟수는 정확하게 m log n/m+4m-logm-3이고 “Maximum spanning case”의 경우 사이즈 m=2κ, n=2m-m인 임의의 입력수열에 대해 SymMerge 알고리즘이 필요로 하는 비교횟수는 정확하게 1/2m²+(m+1)log m-3/2m+2임을 계산해 보인다. 추가로 이들 두 special case에 있어서 요구되는 비교횟수가 재귀적 함수에 의해 정의될 수 있음을 보인다.

습성 나이관련황반변성에서 안축장이 초기 항혈관내피성장인자 치료 후 재발에 미치는 영향

조수연,이윤곤,한상윤,태기선,김종우,김철구,이동원,김재휘 대한안과학회 2019 대한안과학회지 Vol.60 No.1

Purpose: To evaluate the influence of axial length on the recurrence of wet age-related macular degeneration (AMD) after anti- vascular endothelial growth factor therapy. Methods: A retrospective review of the medical records for 45 eyes of 45 patients, who were diagnosed with neovascular AMD and treated with three ranibizumab injections per month, was performed. Axial length was compared between eyes with (recurrence group) and without (no recurrence group) recurrence of fluid during a 12-month follow-up period. In eyes with recurrence, the association between axial length and the time between the third injection and the first recurrence was also evaluated. Results: The axial length was measured at a mean of 20.6 ± 10.1 months after the diagnosis of neovascular AMD. The mean axial length at that time was 23.33 ± 0.90 mm. The mean axial length was 23.29 ± 0.96 mm in the recurrence group (n = 30) and 23.40 ± 0.79 mm in the no-recurrence group (n = 15). There was no difference in the axial length between the two groups (p = 0.709). In the recurrence group, the period between the third injection and the first recurrence was not associated with axial length (p =0.582). Conclusions: There was no significant difference in axial length between eyes with and without recurrence after initial treatment for wet AMD. In addition, the time to first recurrence was not significantly associated with axial length. Because the present study was retrospective and the sample size was small, further prospective studies with a better design are needed to more accurately assess the influence of axial length. 목적: 안축장이 습성 나이관련황반변성에서 항혈관내피성장인자 치료 후 재발에 미치는 영향에 대해 알아보고자 한다. 대상과 방법: 습성 나이관련황반변성으로 진단된 후 1개월 간격 ranibizumab 3회 주입술을 시행받은 45안을 대상으로 후향적 의무기록 분석을 시행하였다. 12개월의 경과 관찰기간 동안 재발을 보인 군을 ‘재발한 군’, 재발하지 않은 경우를 ‘재발하지 않은 군’으로 나누어 양 군 간에 안축장을 비교하였다. 재발한 군의 경우 안축장과 첫 재발까지의 기간 사이의 연관관계를 추가로 분석하였다. 결과: 습성 나이관련황반변성 진단 후 평균 20.6 ± 10.1개월에 안축장을 측정하였으며, 평균 안축장은 23.33 ± 0.90 mm였다. 재발한 군(n=30)과 재발하지 않은 군(n=15)을 비교하였을 때, 평균 안축장은 재발한 군에서의 23.29 ± 0.96 mm, 재발하지 않은 군에서 23.40 ± 0.79 mm로 양 군 사이에 유의한 차이는 없었다(p=0.709). 재발한 군에서 3회 주사로부터 첫 재발까지의 기간은 평균 6.3 ± 2.3개월이었으며, 상기 기간과 안축장 사이의 연관관계는 유의하지 않았다(p=0.582). 결론: 본 연구의 결과 습성 나이관련황반변성에 대한 초기 치료 후 재발한 군과 그렇지 않은 군 사이에 안축장의 유의한 차이는 없었으며, 재발까지의 기간 역시 안축장과 연관관계가 나타나지 않았다. 그러나 본 연구가 소수의 안을 대상으로 한 후향적 연구라는 점을 고려하였을 때, 향후 보다 잘 설계된 전향적 연구를 통해 안축장의 영향을 보다 더 정확하게 평가하고자 하는 시도가 필요할 것이다.

SOME RECURRENCE RELATIONS OF MULTIPLE ORTHOGONAL POLYNOMIALS

Lee, Dong-Won Korean Mathematical Society 2005 대한수학회지 Vol.42 No.4

In this paper, we first find a necessary and sufficient condition for the existence of multiple orthogonal polynomials by the moments of a pair of measures $(d{\mu},\;dv)$ and then give representations for multiple orthogonal polynomials. We also prove four term recurrence relations for multiple orthogonal polynomials of type II and several interesting relations for multiple orthogonal polynomials are given. A generalized recurrence relation for multiple orthogonal polynomials of type I is found and then four term recurrence relations are obtained as a special case.

A RECURRENCE RELATION ASSOCIATED WITH UNIT-PRIMITIVE MATRICES

( Byeong-gil Choe ),( Hyeong-kwan Ju ) 호남수학회 2024 호남수학학술지 Vol.46 No.1

In this paper we obtained several properties that the characteristic polynomial of the unit-primitive matrix satisfies. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In fact, Xin and Zhong ([4]) showed it earlier. However, we provide a simpler method here.

Investigation of Lithium Transference Number in PMMA Composite Polymer Electrolytes Using Monte Carlo (MC) Simulation and Recurrence Relation

Koh, Renwei Eric,Sun, Cha Chee,Yap, Yee Ling,Cheang, Pei Ling,You, Ah Heng The Korean Electrochemical Society 2021 Journal of electrochemical science and technology Vol.12 No.2

In this study, Monte Carlo (MC) simulation is conducted with recurrence relation to study the effect of SiO₂ with different particle size and their roles in enhancing the ionic conductivity and lithium transference number of PMMA composite polymer electrolytes (CPEs). The MC simulated ionic conductivity is verified with the measurements from Electrochemical Impedance Spectroscopy (EIS). Then, the lithium transference number of CPEs is calculated using recurrence relation with the MC simulated current density and the reference transference number obtained. Incorporation of micron-size SiO₂ (≤10 ㎛) fillers into the mixture improves the ionic conductivity from 8.60×10^-5 S/cm to 2.35×10^-4 S/cm. The improvement is also observed on the lithium transference number, where it increases from 0.088 to 0.3757. Furthermore, the addition of nano-sized SiO₂ (≤12 nm) fillers further increases the ionic conductivity up towards 3.79×10^-4 S/cm and lithium transference number of 0.4105. The large effective surface area of SiO₂ fillers is responsible for the improvement in ionic conductivity and the transference number in PMMA composite polymer electrolytes.

A FAMILY OF NEW RECURRENCE RELATIONS FOR THE JACOBI POLYNOMIALS P_n ^ (α, β) (x)

Shine Raj S.N.,최준상,Arjun K. Rathie 호남수학회 2018 호남수학학술지 Vol.40 No.1

The objective of this paper is to present 87 recurrencerelations for the Jacobi polynomials P( ; )n (x). The results presentedhere most of which are presumably new are obtained withthe help of Gauss's fteen contiguous function relations and someother identities recently recorded in the literature.

RECURRENCE RELATIONS FOR QUOTIENT MOMENTS OF THE EXPONENTIAL DISTRIBUTION BY RECORD VALUES

LEE, MIN-YOUNG,CHANG, SE-KYUNG The Honam Mathematical Society 2004 호남수학학술지 Vol.26 No.4

In this paper we establish some recurrence relations satisfied by quotient moments of upper record values from the exponential distribution. Let $\{X_n,\;n{\geq}1\}$ be a sequence of independent and identically distributed random variables with a common continuous distribution function F(x) and probability density function(pdf) f(x). Let $Y_n=max\{X_1,\;X_2,\;{\cdots},\;X_n\}$ for $n{\geq}1$. We say $X_j$ is an upper record value of $\{X_n,\;n{\geq}1\}$, if $Y_j>Y_{j-1}$, j > 1. The indices at which the upper record values occur are given by the record times {u(n)}, $n{\geq}1$, where u(n)=min\{j{\mid}j>u(n-1),\;X_j>X_{u(n-1)},\;n{\geq}2\} and u(1) = 1. Suppose $X{\in}Exp(1)$. Then $\Large{E\;\left.{\frac{X^r_{u(m)}}{X^{s+1}_{u(n)}}}\right)=\frac{1}{s}E\;\left.{\frac{X^r_{u(m)}}{X^s_{u(n-1)}}}\right)-\frac{1}{s}E\;\left.{\frac{X^r_{u(m)}}{X^s_{u(n)}}}\right)}$ and $\Large{E\;\left.{\frac{X^{r+1}_{u(m)}}{X^s_{u(n)}}}\right)=\frac{1}{(r+2)}E\;\left.{\frac{X^{r+2}_{u(m)}}{X^s_{u(n-1)}}}\right)-\frac{1}{(r+2)}E\;\left.{\frac{X^{r+2}_{u(m-1)}}{X^s_{u(n-1)}}}\right)}$.