一种反射式扭曲向列型液晶显示优化设计的新方法

基于扭曲向列型液晶的显示器件通过调制光波的偏振态实现显示的目的,因此光波的偏振状态在其中起了极为关键的作用.本文结合琼斯矩阵和表示光波偏振态的斯托克斯参量j-circle方法,提出了一种优化反射式扭曲向列型液晶显示器件的新方法.该方法与原有的空间参量方法不同的是采用了追踪光波在传播过程中偏振态变化的办法得到反射式液晶显示器件中各光学元件的参数.该方法简单直观并且可以对多个参数同时进行优化,实现了显示性能的最优化设计并得到了新的显示模式.     

三维迷宫的设计与建模

三维迷宫在难度和趣味性上达到了一个更高的水平.通过改进二维迷宫的生成算法,提出了循环迷宫的概念和迷宫复杂度公式.进而,提出一种基于四边形网格曲面的三维迷宫设计算法.该算法分3个步骤:首先,将给定的三维曲面四边形网格化;再确定迷宫的起点和终点,采用基于生成树的二维迷宫生成算法,在网格表面生成迷宫路径;最后,将迷宫实体化为三维结构,并与原始三维模型做布尔运算,得到三维迷宫.通过3D打印机制造出个性化的三维迷宫玩具,大大增强了迷宫的趣味性,改善了用户体验.     

Hydrophobically modified chitosan/gold nanoparticles for DNA delivery

Present study dealt an application of modified chitosan gold nanoparticles (Nac-6-Au) for the immobilization of necked plasmid DNA. Gold nanoparticles stabilized with N-acylated chitosan were prepared by graft-onto approach. The stabilized gold nanoparticles were characterized by different physico-chemical techniques such as UV-vis, TEM, ELS and DLS. MTT assay was used for in vitro cytotoxicity of the nanoparticles into three different cell lines (NIH 3T3, CT-26 and MCF-7). The formulation of plasmid DNA with the nanoparticles corresponds to the complex forming capacity and in-vitro/in-vivo transfection efficiency was studied via gel electrophoresis and transfection methods, respectively. Results showed the modified chitosan gold nanoparticles were well-dispersed and spherical in shape with average size around 10～12 nm in triple distilled water at pH 7.4, and showed relatively no cytotoxicity at low concentration. Addition of plasmid DNA on the aqueous solution of the nanoparticles markedly reduced surface potential (50.0～66.6%) as well as resulted in a 13.33% increase in hydrodynamic diameters of the formulated nanoparticles. Transfection efficiency of Nac-6-Au/DNA was dependent on cell type, and higher β-galactosidase activity was observed on MCF-7 breast cancer cell. Typically, this activity was 5 times higher in 4.5 mg/ml nanoparticles concentration than that achieved by the nanoparticles of other concentrations (and/or control). However, this activity was lower in in-vitro and dramatically higher in in-vivo than that of commercially available transfection kit (Lipofectin®) and DNA. From these results, it can be expected to develop alternative new vectors for gene delivery.     

[12]aneN3-based single aliphatic chain modified cationic lipids as gene delivery vectors

A series of aliphatic chain modified [12]aneN₃ cationic lipids, 1a-1f, were synthesized and fully characterized with ¹H NMR, ¹³C NMR, IR and high-resolution mass spectrometry. The liposomes formed from 1a-1f and dioleoylphosphatidyl ethanolamine could effectively retard DNA migration, and condense DNA into spherical nanoparticles with an average size of 130–220?nm. Furthermore, the cytotoxicity of these liposomes assayed by MTT indicated their good biocompatibility in A549 and HepG2 cells. Results from cell transfection experiments proved that 1c and 1f exhibited higher transfection efficiency in A549?cells, which were higher than commercially reagent lipofectamine 2000. In order to study the interaction between 1c, 1f and DNA, ionic strength effects and DNA release experiments were carried out,indicating that the DNA condensation induced by 1c and 1f was reversible, and electrostatic interaction played important roles. These results suggested that 1c and 1f have great potential to be efficient non-viral gene vectors.     

微波连续变量极化纠缠

极化微波作为当前被广泛应用的信息载体,具有许多独特的优势.随着超导技术的发展,量子微波技术逐渐兴起,将量子纠缠应用于极化微波将具有广阔的应用前景.本文阐述了连续变量极化纠缠的原理,提出了极化纠缠微波方案并进行了仿真分析,利用归一化的不可分度I作为判据,分析了在整个约瑟夫森混合器100 MHz工作带宽内斯托克斯参量的不可分度I(S_1,S_2),I(S_2,S_3),并进一步分析了I分别与压缩度r、振幅比值Q的关系,发现I(S_1,S_2),I(S_2,S_3)分别对振幅比值Q、压缩度r的变化敏感,且在本文研究的条件下I(S_1,S_2)始终大于1,I(S_2,S_3)始终小于1,斯托克斯参量S_2,S_3构成不可分态,方案产生的两个微波信号E_a和E_b存在二组分极化纠缠,最佳纠缠出现在70 MHz附近,此时I(S_2,S_3)取得最小值0.25.     

The Law of the Iterated Logarithm for Matrix-Normed Sums of Independent Random Variables and Its Applications

In the paper, the law of the iterated logarithm in for sums of independent random vectors subjected to matrix transformations is studied. Application to multidimensional linear regression is considered.     

Fair allocation on a network

The adjusted marginal allocation method which was proposed by Claus and Kleitman to allocate costs in a network is modified. Using the modified method, we obtain that if the final allocation is in the imputation set, it must be in the core. All three and four users cases are studied.The authors are grateful to two anonymous referees for many helpful suggestions.     

Spanning 2‐trails from degree sum conditions

Suppose G is a simple connected n‐vertex graph. Let σ₃(G) denote the minimum degree sum of three independent vertices in G (which is ∞ if G has no set of three independent vertices). A 2‐trail is a trail that uses every vertex at most twice. Spanning 2‐trails generalize hamilton paths and cycles. We prove three main results. First, if σ₃G)≥ n ‐ 1, then G has a spanning 2‐trail, unless G ? K_1,3. Second, if σ₃(G) ≥ n, then G has either a hamilton path or a closed spanning 2‐trail. Third, if G is 2‐edge‐connected and σ₃(G) ≥ n, then G has a closed spanning 2‐trail, unless G ? K_2,3 or K (the 6‐vertex graph obtained from K_2,3 by subdividing one edge). All three results are sharp. These results are related to the study of connected and 2‐edge‐connected factors, spanning k‐walks, even factors, and supereulerian graphs. In particular, a closed spanning 2‐trail may be regarded as a connected (and 2‐edge‐connected) even [2,4]‐factor. © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 298–319, 2004     

Approximating k-hop minimum-spanning trees

Given a complete graph on~n nodes with metric edge costs, the minimum-costk-hop spanning tree (kHMST) problem asks for a spanning tree of minimum total cost such that the longest root-leaf-path in the tree has at most k edges. We present an algorithm that computes such a tree of total expected cost times that of a minimum-cost k-hop spanning-tree.