• Journal of Chest Surgery
• /
• 제25권11호
• /
• pp.1185-1191
• /
• 1992

Cell mediated immunity is depressed following surgical procedure and the degree of immunosuppression is directly related to the magintude of the procedure, blood transfusion, and length of operation. So we would expect cardiac operations to be highly immunosuppressive, although little is konwn about their immunosuppressive effect. The nearly complete consumption of complement factors and decreased levels of IgM and IgG resulting in an impaired opsonizing capacity. Additionally, peripheral blood mononuclear cell counts including T-and B-lymphocytes and T-cell subsets are reduced. Depression of cell-mediated immunity following open-heart surgery is potentially detrimental because it could increase the susceptability of patients to viral and bacterial infection. We reviewed 20 patients after cardiac operation to search for changes in peripheral blood lymphocyte subsets. Lymphocyte subsets were measured by flow cytometer and the preoperative values of lymphocyte subsets were compared with those from the first, fourth, and seventh days after operation. After cardiac operation, total mumbers of T lymphocyte was severely depressed on the first postoperative day and returned to the preoperative level by the seventh day after operation. CD3, CD4, and CD8 lymphocytes were decreased on the first postoperative day and returned to the preoperative level by the seventh day also. There was four cases of wound infection and these patients had increased CD4 lympocyte and more decreased CD19 lymphocyte compared with the non-infected group. It is concluded from these data that cell-mediated immunity is significantly depressed for at least one week following open-heart surgery and this result was closely related to the postoperative infection.

• 핵의학기술
• /
• 제14권1호
• /
• pp.122-126
• /
• 2010

F-18-FPCIT는 뇌 선조체에 주로 분포된 도파민 운반체에 강한 친화력을 보이며, 이는 파킨슨 씨 병의 진단에 유용한 진단적 정보를 제공한다. 본 연구에서는 iteration과 subset에 따른 영상의 변화를 관찰하고 적정한 iteration과 subset의 범위를 제안해 보고자 한다. 영상의 획득은 ACR 팬텀과 뇌 질환이 없는 정상인의 뇌 영상을 획득하였다. 정상인의 뇌영상은 F-18-FPCIT를 정맥주사 후 3시간째 획득하였으며, iteration과 subset의 조건을 5가지로 구분하여 영상을 재구성하였다. 영상의 분석은 동일한 위치에 같은 크기의 ROI를 그려 평균, 최대, 최소의 SUV를 측정하였고, 이를 바탕으로 표준편차, 변이계수를 계산하였다. 또한 팬텀영상에서는 각 조건별 열소와 냉소의 SUV를 비교하여 어떠한 조건에서 실제와 가장 비슷한 SUV ratio를 재현하는지 조사하였다. 위 실험에서 얻어진 값은 Spearman test를 통해 유의성을 유무를 판별하였다. 따라 SUV는 증가하였고 이러한 추세는 Spearman test에서 유의성을 나타내었다. 표준편차 역시 iteration, subset조건이 증가함에 따라 값의 증가를 보였다. 산출된 값들은 통계적으로 유의하였다. 팬텀 연구에서는 6 iteraions, 16 iterations 에서 실제와 가장 비슷한 SUV ratio를 재현하였다. 하지만 iteration, subset 조건별로 얻어진 SUV ratio들은 통계적으로 유의하지 않았다.

• East Asian mathematical journal
• /
• 제16권2호
• /
• pp.355-361
• /
• 2000

• 호남수학학술지
• /
• 제39권4호
• /
• pp.569-574
• /
• 2017

The notion of $I_{BE}$-energetic subsets in BE-algebras is introduced, and several properties are investigated. Characterizations of $I_{BE}$-energetic subsets are discussed, and conditions for a subset to be an $I_{BE}$-energetic subset are provided.

• Journal of applied mathematics & informatics
• /
• 제26권3_4호
• /
• pp.733-738
• /
• 2008

Using an information of dimensions of divergence points, we give full information of dimensions of the completely decomposed class of the lower(upper) distribution sets of a self-similar Cantor set. Further using a relationship between the distribution sets and the subsets generated by the lower(upper) local dimensions of a self-similar measure, we give full information of dimensions of the subsets by the local dimensions.

• 대한수학회논문집
• /
• 제29권4호
• /
• pp.555-568
• /
• 2014

A set with an operation defined on a family of subsets is studied. The operation is used to generalize the topological space itself. The operation defines the operation-open subsets in the set. Relations are studied among two types of the interiors and the closures of subsets. Some properties of maximal operation-open sets are obtained. Semi-open sets and pre-open sets are defined in the sets with operations and some relations among them are proved.

• Kyungpook Mathematical Journal
• /
• 제54권2호
• /
• pp.263-269
• /
• 2014

As a further study on reflexive families of subsets, we introduce the reflexive index for a family of subsets of a given set and show that the index of a finite family of subsets of a finite or countably infinite set is always finite. The reflexive indices of some special families are also considered.

• 대한수학회논문집
• /
• 제22권4호
• /
• pp.547-552
• /
• 2007

The unit interval is not homeomorphic to a self-similar Cantor set in which we studied the dimensions of distribution subsets. However we show that similar results regarding dimensions of the distribution subsets also hold for the unit interval since the distribution subsets have similar structures with those in a self-similar Cantor set.

• 대한수학회보
• /
• 제58권1호
• /
• pp.253-267
• /
• 2021

We study linearly dependent subsets with prescribed cardinality s of a multiprojective space. If the set S is a circuit, there is an upper bound on the number of factors of the minimal multiprojective space containing S. B. Lovitz gave a sharp upper bound for this number. If S has higher dependency, this may be not true without strong assumptions (and we give examples and suitable assumptions). We describe the dependent subsets S with #S = 6.

• 디지털산업정보학회논문지
• /
• 제9권3호
• /
• pp.21-30
• /
• 2013

Powell-Miller theory is a good method to express or treat incorrect information. But it has limitation that requires too much time to apply to actual situation because computational complexity increases in exponential and functional way. Accordingly, there have been several attempts to reduce computational complexity but side effect followed - certainty factor fell. This study suggested expanded Approximation Algorithm. Expanded Approximation Algorithm is a method to consider both smallest supersets and largest subsets to expand basic space into a space including inverse set and to reduce Approximation error. By using expanded Approximation Algorithm suggested in the study, basic probability assignment function value of subsets was alloted and added to basic probability assignment function value of sets related to the subsets. This made subsets newly created become Approximation more efficiently. As a result, it could be known that certain function value which is based on basic probability assignment function is closely near actual optimal result. And certainty in correctness can be obtained while computational complexity could be reduced. by using Algorithm suggested in the study, exact information necessary for a system can be obtained.