• Biomolecules & Therapeutics
• /
• 제26권5호
• /
• pp.503-511
• /
• 2018

Triclosan (TCS) and bisphenol A (BPA) are endocrine-disrupting chemicals that interfere with the hormone or endocrine system and may cause cancer. Kaempferol (Kaem) and 3,3'-diindolylmethane (DIM) are phytoestrogens that play chemopreventive roles in the inhibition of carcinogenesis and cancer progression. In this study, the influence of TCS, BPA, Kaem, and DIM on proliferation and apoptotic abilities of VM7Luc4E2 breast cancer cells were examined. MTT assay revealed that TCS ($0.1-10{\mu}M$), BPA ($0.1-10{\mu}M$) and E2 ($0.01-0.0001{\mu}M$) induced significant cell proliferation of VM7Luc4E2 cells, which was restored to the control (0.1% DMSO) by co-treatment with Kaem ($30{\mu}M$) or DIM ($15{\mu}M$). Reactive oxygen species (ROS) production assays showed that TCS and BPA inhibited ROS production of VM7Luc4E2 cells similar to E2, but that co-treatment with Kaem or DIM on VM7Luc4E2 cells induced increased ROS production. Based on these results, the effects of TCS, BPA, Kaem, and DIM on protein expression of apoptosis and ROS production-related markers such as Bax and Bcl-xl, as well as endoplasmic reticulum (ER) stress-related markers such as $eIF2{\alpha}$ and CHOP were investigated by Western blot assay. The results revealed that TCS, and BPA induced anti-apoptosis by reducing ROS production and ER stress. However, Kaem and DIM effectively inhibited TCS and BPA-induced anti-apoptotic processes in VM7Luc4E2 cells. Overall, TCS and BPA were revealed to be distinct xenoestrogens that enhanced proliferation and anti-apoptosis, while Kaem and DIM were identified as natural chemopreventive compounds that effectively inhibited breast cancer cell proliferation and increased anti-apoptosis induced by TCS and BPA.

• 대한수학회보
• /
• 제30권1호
• /
• pp.65-70
• /
• 1993

In this paper we will extend some notions of bounded linear operators to some unbounded linear operators. Let H be a complex separable Hilbert space and let B(H) denote the algebra of bounded linear operators. A closed densely defind linear operator S in H, with domain domS, is called subnormal if there is a Hilbert space K containing H and a normal operator N in K(i.e., $N^{*}$N=N $N^*/)such that domS .subeq. domN and Sf=Nf for f .mem. domS. we will show that the Radjavi and Rosenthal theorem holds for some unbounded subnormal operators; if $S_{1}$ and $S_{2}$ are unbounded subnormal operators on H with dom $S_{1}$= dom $S^{*}$$_{1}$ and dom $S_{2}$=dom $S^{*}$$_{2}$ and A .mem. B(H) is injective, has dense range and $S_{1}$A .coneq. A $S^{*}$$_{2}$, then $S_{1}$ and $S_{2}$ are normal and $S_{1}$.iden. $S^{*}$$_{2}$.2}$.X>.

• Kyungpook Mathematical Journal
• /
• 제63권2호
• /
• pp.155-166
• /
• 2023

In 2018, Andrews introduced the partition functions ${\mathfrak{EO}}$(n) and ${\bar{\mathfrak{EO}}}$(n). The first of these denotes the number of partitions of n in which every even part is less than each odd part, and the second counts the number of partitions enumerated by the first in which only the largest even part appears an odd number of times. In 2021, Pore and Fathima introduced a new partition function ${\mathfrak{EO}}_e$(n) which counts the number of partitions of n which are enumerated by ${\bar{\mathfrak{EO}}}$(n) together with the partitions enumerated by ${\bar{\mathfrak{EO}}}$(n) where all parts are odd and the number of parts is even. They also proved some particular congruences for ${\bar{\mathfrak{EO}}}$(n) and ${\mathfrak{EO}}_e$(n). In this paper, we establish infinitely many families of congruences modulo 2, 4, 5 and 8 for ${\bar{\mathfrak{EO}}}$(n) and modulo 4 for ${\mathfrak{EO}}_e$(n). For example, if p ≥ 5 is a prime with Legendre symbol $({\frac{-3}{p}})=-1$, then for all integers n ≥ 0 and α ≥ 0, we have ${\bar{\mathfrak{EO}}}(8{\cdot}p^{2{\alpha}+1}(pn+j)+{\frac{19{\cdot}p^{2{\alpha}+2}-1}{3}}){\equiv}0$ (mod 8); 1 ≤ j ≤ (p - 1).

• 정보처리학회논문지B
• /
• 제13B권2호
• /
• pp.163-170
• /
• 2006

인터넷의 급속한 성장으로 전자편지는 정보 전달의 중요한 수단으로 사용되고 있다. 그러나 수신자가 원하지 않는 전자편지(쓰레기 편지)들이 무분별하게 배달될 수 있으며, 이로 인해 사회적으로는 물론이고 경제적으로도 큰 문제가 되고 있다. 이와 같이 쓰레기 편지를 차단하거나 여과하기 위해서 많은 연구자와 회사에서 꾸준히 연구를 진행하고 있다. 일반적으로 쓰레기 편지를 결정하는 기준은 수신자에 따라서 조금씩 차이가 있다. 또한 쓰레기 편지와 정보성 편지에 따라서 수신자가 취하는 행동이 다르다. 이 논문은 이런 사용자 행동을 쓰레기 편지 여과 시스템에 반영하여 그 시스템의 성능을 개선한다. 제안된 시스템은 크게 두 단계로 구성된다. 첫 번째 단계는 사용자 행동을 추론하는 단계이고 두 번째 단계는 추론된 사용자 행동을 이용해서 쓰레기 편지를 여과하는 단계이다. 두 단계 모두에서 점진적인 기계학습 방법(TiMBL - IB2)을 이용한다. 제안된 시스템을 평가하기 위해 12명의 사용자로부터 12,000통으로 이루어진 전자편지 말뭉치를 구축하였다. 실험 결과는 사용자에 따라 $81%{\sim}93%$의 분류 정확도를 보였다. 사용자의 행동 정보를 포함하는 편지 분류 결과는 그렇지 않은 결과에 비해 평균 14%의 분류 정확도가 향상되었다.

• 한국정보처리학회논문지
• /
• 제6권8호
• /
• pp.2124-2132
• /
• 1999

Given a graph G=(V,E), Ld(2,1)-labeling of G is a function f : V(G)$\longrightarrow$[0,$\infty$) such that, if v1,v2$\in$V are adjacent, $\mid$ f(x)-f(y) $\mid$$\geq$2d, and, if the distance between and is two, $\mid$ f(x)-f(y) $\mid$$\geq$d, where dG(,v2) is shortest distance between v1 and in G. The L(2,1)-labeling number (G) is the smallest number m such that G has an L(2,1)-labeling f with maximum m of f(v) for v$\in$V. This problem has been studied by Griggs, Yeh and Sakai for the various classes of graphs. In this paper, we discuss the upper-bound of ${\lambda}$ (G) for a chordal graph G and that of ${\lambda}$(G') for a permutation graph G'.

• Macromolecular Research
• /
• 제14권2호
• /
• pp.140-145
• /
• 2006

E-science refers to the large-scale science that will increasingly be carried out through distributed global collaborations enabled by the Internet. The Grid is a service-oriented architecture proposed to provide access to very large data collections, very large scale computing resources and remote facilities. Web services, which are server applications, enable online access to service providers. Web portal interfaces can further hide the complexity of accessing facility's services. The main use of synchrotron radiation (SR) facilities by protein crystallographers is to collect the best possible diffraction data for reasonably well defined problems. Significant effort is therefore being made throughout the world to automate SR protein crystallography facilities so scientists can achieve high throughput, even if they are not expert in all the techniques. By applying the above technologies, the e-HTPX project, a distributed computing infrastructure, was designed to help scientists remotely plan, initiate and monitor experiments for protein crystallographic structure determination. A description of both the hardware and control software is given together in this paper.

• BMB Reports
• /
• 제36권1호
• /
• pp.28-34
• /
• 2003

Breast cancer is the most prevalent cancer among women in Western countries, and its prevalence is also increasing in Asia. The major risk factor for breast cancer can be traced to reproductive events that influence the lifetime levels of hormones. However, a large percentage of breast cancer cases cannot, be explained by these risk factors. The identification of susceptibility factors that predispose individuals to breast cancer (for instance, if they are exposed to particular environmental agents) could possibly give further insight into the etiology of this malignancy and provide targets for the future development of therapeutics. The most interesting candidate genes include those that mediate a range of functions. These include carcinogen metabolism, DNA repair, steroid hormone metabolism, signal transduction, and cell cycle control. We conducted a hospital-based case-control study in South Korea to evaluate the potential modifying role of the genetic polymorphisms of selected low penetrance genes that are involved in carcinogen metabolisms (i.e., CYP1A1, CYP2E1, GSTM1/T1/P1, NAT1/2, etc.), estrogen synthesis and metabolism (i.e., CYP19, CYP17, CYP1B1, COMT, ER-$\alpha$, etc.), DNA repair (i.e., XRCC1/3, ERCC2/4, ATM, AGT, etc.), and signal transduction as well as others (i.e., TGF-$\beta$, IGF-1, TNF-$\beta$, IL-1B, IL-1RN, etc.). We also took into account the potential interaction between these and the known risk factors of breast cancer. The results of selected genes will be presented in this mini-review.

• Restorative Dentistry and Endodontics
• /
• 제15권1호
• /
• pp.129-139
• /
• 1990

In order to determine if GK-101E(N-monochloro-DL-2-aminobutyrate) solution was effective in the removal of carious dentin, this study was conducted on 75 extracted human carious teeth. GK-101E solution was compared in effectiveness to saline solution.75 extracted human carious teeth were randomly assigned to two groups accordingly : (1) 50 teeth were treated with GK-101E solution : and (2) 25 teeth were treated with saline solution. Teeth in each group were divided into the medium or medium-hard consistency. Treatment consisted of directing the pulsating stream of each coded test solution utilizing the Caridex$^{TM}$ Caries Removal System against the carious surface for 4 mimutes. One operator treated all teeth with corded solution, and four investigators scored on the treated teeth based on visual examination and tactile evaluation with a dental explorer in conjunction with staining method with Caries Detector$^{TM}$ The results were as follows : 1. All groups showed various effect of carious dentin removal. 2. GK-101E solution was statistically superior to physiologic saline solution in the removal of carious dentin, regardless of carious consistency. 3. GK-101E solution in the medium-hard consistency was statistically superior to that in the medium consistency in the caries removal(p=0.001). 4. Saline solution in the medium consistency was equivalent to that in the medium-hard consistency in caries removal(p>0.1).

• Journal of Applied and Pure Mathematics
• /
• 제6권1_2호
• /
• pp.55-69
• /
• 2024

Let a graph G = (V, E) be a (p, q) graph. Define $${\rho}=\{\array{{\frac{p}{2}} && p\;\text{is even} \\ {\frac{p-1}{2}} && p\;\text{is odd,}}$$ and M = {±1, ±2, … ± 𝜌} called the set of labels. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling $\frac{{\lambda}(u)+{\lambda}(v)}{2}$ if λ(u) + λ(v) is even and $\frac{{\lambda}(u)+{\lambda}(v)+1}{2}$ if λ(u) + λ(v) is odd such that ${\mid}\bar{\mathbb{s}}_{{\lambda}_1}-\bar{\mathbb{s}}_{{\lambda}^c_1}{\mid}\,{\leq}\,1$ where $\bar{\mathbb{s}}_{{\lambda}_1}$ and $\bar{\mathbb{s}}_{{\lambda}^c_1}$ respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G with a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling behavior of some union of graphs.

• 충청수학회지
• /
• 제13권2호
• /
• pp.9-17
• /
• 2001

A ring R is called right mininjective if every isomorphsim between simple right ideals is given by left multiplication by an element of R. In this paper we consider that the necessary and sufficient condition for that Trivial extension of R by V, i.e. T(R; V ) is mininjective. We also study the split null extension R and S by V.