http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Kajitani, Koji,Ken-Ichi, Honda,Terada, Hiroyuki,Yasui, Tomoyo,Sumi, Toshiyuki,Koyama, Masayasu,Ishiko, Osamu Asian Pacific Journal of Cancer Prevention 2015 Asian Pacific journal of cancer prevention Vol.16 No.18
The p53 gene is inactivated by the human papillomavirus (HPV) E6 protein in the majority of cervical cancers. Treatment of HeLa S3 cells with siRNA for HPV E6 permitted adenovirus-mediated transduction of a p53 gene linked to an upstream estrogen response element (ERE). Our previous study in non-siRNA treated HHUA cells, which are derived from an endometrial cancer and express estrogen receptor ${\beta}$, showed enhancing effects of an upstream ERE on adenovirus-mediated p53 gene transduction. In HeLa S3 cells treated with siRNA for HPV E6, adenovirus-mediated transduction was enhanced by an upstream ERE linked to a p53 gene carrying a proline variant at codon 72, but not for a p53 gene with arginine variant at codon 72. Expression levels of p53 mRNA and Coxsackie/adenovirus receptor (CAR) mRNA after adenovirus-mediated transfer of an ERE-linked p53 gene (proline variant at codon 72) were higher compared with those after non-ERE-linked p53 gene transfer in siRNA-treated HeLa S3 cells. Western blot analysis showed lower ${\beta}$-tubulin levels and comparatively higher p53/${\beta}$-tubulin or CAR/${\beta}$-tubulin ratios in siRNA-treated HeLa S3 cells after adenovirus-mediated ERE-linked p53 gene (proline variant at codon 72) transfer compared with those in non-siRNA-treated cells. Apoptosis, as measured by annexin V binding, was higher after adenovirus-mediated ERE-linked p53 gene (proline variant at codon 72) transfer compared with that after non-ERE-linked p53 gene transfer in siRNA-treated cells.
Cost-Radius Balanced Spanning/Steiner Trees
Mitsubayashi, Hideki,Takahashi, Atsushi,Kajitani, Yoji 대한전자공학회 1996 APCCAS:Asia Pacific Conference on Circuits And Sys Vol.1 No.1
The most crucial factor that degrades a high speed VLSI is the signal propagation delay in a routing tree. It is estimated additively by the amount of the source-to-sink path length and total length. To design a routing tree in which these two are balancingly small, we propose an algorithm to construct a spanning tree, by which a tree is constructed in a hybrid way of the Minimum-Tree and Shortest-Path Tree algorithms. The idea is extended to finding such a rectilinear Steiner tree. Experiments are given to show how these source-to-sink path length and total length are balanced and small.
On l-Locally Optimum Graph Matching
Cho, Jun-Dong,Kajitani, Yoji,Sarrafzadeh, Majid 成均館大學校 科學技術硏究所 1995 論文集 Vol.46 No.2
그라프 G=(V,E), |E|=e, |V|=n,에서 최대 매칭수 M은 M에 있는 어느 두 edge가 공통 vertex에 연결되어 있지 않는 최대 edge수를 말한다. 최대 매칭수 M의 정확한 해를 구하는 문제는 O(n^(5/2))의 계산시간을 요구한다. 본 논문에서는 n이 짝수일 때 매칭수의 하한치가 적어도 e/n-1 이상인 결과를 선형 시간 (O(e+n))내에 구하는 대략 알고리듬을 제안한다. 그 결과는 기존의 결과를 향상시킨 결과이며 최악조건에서는 그 하한치가 최적해를 보인다. 본 논문은 제안된 대략 매칭 알고리듬을 MAXCUT에 응용한 결과가 포함되어 있으며 제안된 그라프 대략 매칭 알고리듬은 그밖에 Vertex Cover, Traveling Saleman Problem 및 VLSI 설계 자동화에 적용하여 사용될 수 있다. For a graph G=(V,E) with |E|=e and |V|=n vertices a maximum cardinality matching of G is a subset M of edges with a maximum cardinality such that no two edges of M are incident at a common vertex. The best known algorithm for solving the maximum cardinality matching problem in general graphs requires O(n5/2) time. We propose a maximum cardinality matching algorithm, running in O(e+n) time, yielding the size of matching at least , e/n-1, when n is even. The results improve the bound known before and the derived lowerbounds are existentially tight for the cardinality case. The problem of approximate maximum matching has a number of applications, for example in, MAXCUT, Vertex Cover TSP, and VLSI physical design problems.