http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Double-layer Fabry-P$\acute{e}$rot filter interferometric modulator display
Chen, Chao Ping,Xiong, Yuan,Yang, Yuxing,Li, Xiao,Li, Hongjing,He, Gufeng,Lu, Jiangang,Su, Yikai 한국정보디스플레이학회 2013 Journal of information display Vol.14 No.4
Presented is an interferometric modulator display characterized by double layers of liquid crystal (LC) Fabry-P$\acute{e}$rot filters. With this design, no polarizers and color filters are needed, and both the color and amplitude can be tuned by electrically controlling the LC's birefringence. Instead of the conventional RGB trisubpixel color scheme, a bisubpixel structure is proposed to render a super-wide color gamut. Through simulations, the device performance was numerically studied. The device was proven to be quite suitable for green-display application.
LOCAL AND MEAN k-RAMSEY NUMBERS FOR THE FAMILY OF GRAPHS
Zhanjun Su,Hongjing Chen,Ren Ding 한국전산응용수학회 2009 Journal of applied mathematics & informatics Vol.27 No.3
For a family of graphs H and an integer k, we denote by Rk(H) the corresponding k-Ramsey number, which is defined to be the smallest integer n such that every k-coloring of the edges of Kn contains a monochromatic copy of a graph in H. The local k- Ramsey number Rk loc(H) and the mean k-Ramsey number Rk mean(H) are defined analogously. Let G be the family of non-bipartite graphs and Tn be the family of all trees on n vertices. In this paper we prove that Rk loc(G) =Rk mean(G), and R2(T n) < R2 loc(T n) = R2 mean(T n) for all ≥ 3. For a family of graphs H and an integer k, we denote by Rk(H) the corresponding k-Ramsey number, which is defined to be the smallest integer n such that every k-coloring of the edges of Kn contains a monochromatic copy of a graph in H. The local k- Ramsey number Rk loc(H) and the mean k-Ramsey number Rk mean(H) are defined analogously. Let G be the family of non-bipartite graphs and Tn be the family of all trees on n vertices. In this paper we prove that Rk loc(G) =Rk mean(G), and R2(T n) < R2 loc(T n) = R2 mean(T n) for all ≥ 3.
Double-layer Fabry–Pérot filter interferometric modulator display
Chao Ping Chen,Yuan Xiong,Yuxing Yang,Xiao Li,Hongjing Li,Gufeng He,Jiangang Lu,Yikai Su 한국정보디스플레이학회 2013 Journal of information display Vol.14 No.4
Presented is an interferometric modulator display characterized by double layers of liquid crystal (LC) Fabry–Pérot filters. With this design, no polarizers and color filters are needed, and both the color and amplitude can be tuned by electrically controlling the LC’s birefringence. Instead of the conventional RGB trisubpixel color scheme, a bisubpixel structure is proposed to render a super-wide color gamut. Through simulations, the device performance was numerically studied. The device was proven to be quite suitable for green-display application.
LOCAL AND MEAN k-RAMSEY NUMBERS FOR THE FAMILY OF GRAPHS
Su, Zhanjun,Chen, Hongjing,Ding, Ren The Korean Society for Computational and Applied M 2009 Journal of applied mathematics & informatics Vol.27 No.3
For a family of graphs $\mathcal{H}$ and an integer k, we denote by $R^k(\mathcal{H})$ the corresponding k-Ramsey number, which is defined to be the smallest integer n such that every k-coloring of the edges of $K_n$ contains a monochromatic copy of a graph in $\mathcal{H}$. The local k-Ramsey number $R^k_{loc}(\mathcal{H})$ and the mean k-Ramsey number $R^k_{mean}(\mathcal{H})$ are defined analogously. Let $\mathcal{G}$ be the family of non-bipartite graphs and $T_n$ be the family of all trees on n vertices. In this paper we prove that $R^k_{loc}(\mathcal{G})=R^k_{mean}(\mathcal{G})$, and $R^2(T_n)$ < $R^2_{loc}(T_n)4 = $R^2_{mean}(T_n)$ for all $n\;{\ge}\;3$.