树鼩细胞周期蛋白T1 cDNA的克隆和序列分析

树鼩细胞不能感染 HIV-1, 但支持 HIV-1进入靶细胞后的转录, 可能是因为树鼩细胞周期蛋白T1(tsCycT1)能结合HIV-1的 Tat 蛋白. 通过设计引物, 用 RT-PCR 技术, 获得全长为2175bpts CycT1 基因的cD NA. 其核苷酸序列与人的 CycT1(hCycT1) 基因的 cDNA 有92.6%的相似性; 由此推导出的氨基酸序列有94.1%相似性. 其中, hCycT1 和 tsCycT1 氨基端的1～272个氨基酸的相似性高达98.8%, 氨基酸第261位点为半胱氨酸. 这些结果提示, tsCycT1 会和 HIV-1 的 Tat 结合, 形成高亲和的、锌依赖的复合物, 支持 HIV-1转录。

Multimode polymer waveguide components for complex on-board optical topologies

Multimode polymer waveguides are an attractive transmission medium for board-level optical links as they provide high bandwidth, relaxed alignment tolerances, and can be directly integrated onto conventional printed circuit boards. However, the performance of multimode waveguide components depends on the launch conditions at the component input, complicating their use in topologies that require the concatenation of multiple multimode components. This paper presents key polymer components for a multichannel optical bus and reports their performance under different launch conditions, enabling useful rules that can be used to design complex interconnection topologies to be derived. The components studied are multimode signal splitters and combiners, 90°-crossings, S-bends, and 90°-bends. By varying the width of the splitter arms, a splitting ratio between 1% and 95% is achieved from the 1 × 2 splitters, while low-loss signal combining is demonstrated with the waveguide combiners. It is shown that a 3 dB improvement in the combiner excess loss can be achieved by increasing the bus width by 50 μm. The worst-case insertion loss of 50 × 100 μm waveguide crossings is measured to be 0.1 dB/crossing. An empirical method is proposed and used to estimate the insertion losses of on-board optical paths of a polymeric four-channel optical bus module. Good agreement is achieved between the predicted and measured values. Although the components and empirical method have been tailored for use in a multichannel optical bus architecture, they can be used for any on-board optical interconnection topology. © 1983-2012 IEEE.

CsI(T1)晶体探测器APD读出的温度效应

对中国科学院近代物理研究所自行生长的铊激活碘化铯闪烁晶体CsI(T1)光输出及Hamamtsu公司生产的S8664-1010型雪崩光二极管(APD)增益对温度的依赖关系做了系统研究.结果表明,CsI(T1)晶体光产额在室温范围内随着温度的增加而增加,在-2℃—8℃温度范围内的平均温度系数为0.67%/℃,在8℃—25℃温度范围内的平均温度系数为0.33%/℃.而对所使用的APD,其增益在室温范围内的温度系数为-3.68%/℃(工作电压400V).APD结合CsI(T1)晶体在室温下对~(137)Cs的662keYγ射线的能量分辨可达5.1%.

固体ASm_2I_5的d-f跃迁荧光和反射光谱(A=K,Rb,Cs,T1)

本文系统地研究了化合物ASm_2I_5(A=K,Rb,Cs,T1)固体粉末的荧光光谱和反射光谱.讨论了Sm~(2+)在立方晶体场中的分裂能随着碱金属离子半径的增大而减小和f-d激发能随着A-I(A=Rb,T1)键的共价性增加而明显降低的现象.并从晶场效应和化学键性质两个方面解释了ASm_2I_5(A=K,Rb,Cs)和ASm_2I_5(A=Rb,T1)中的Sm~(2+)荧光光谱分别发生蓝移和红移的现象.

Adaptive Routing of QoS-constrained Media Streams over Scalable Overlay Topologies

Current research on Internet-based distributed systems emphasizes the scalability of overlay topologies for efficient search and retrieval of data items, as well as routing amongst peers. However, most existing approaches fail to address the transport of data across these logical networks in accordance with quality of service (QoS) constraints. Consequently, this paper investigates the use of scalable overlay topologies for routing real-time media streams between publishers and potentially many thousands of subscribers. Specifically, we analyze the costs of using k-ary n-cubes for QoS-constrained routing. Given a number of nodes in a distributed system, we calculate the optimal k-ary n-cube structure for minimizing the average distance between any pair of nodes. Using this structure, we describe a greedy algorithm that selects paths between nodes in accordance with the real-time delays along physical links. We show this method improves the routing latencies by as much as 67%, compared to approaches that do not consider physical link costs. We are in the process of developing a method for adaptive node placement in the overlay topology, based upon the locations of publishers, subscribers, physical link costs and per-subscriber QoS constraints. One such method for repositioning nodes in logical space is discussed, to improve the likelihood of meeting service requirements on data routed between publishers and subscribers. Future work will evaluate the benefits of such techniques more thoroughly.

Inference and Labeling of Metric-Induced Network Topologies

The development and deployment of distributed network-aware applications and services over the Internet require the ability to compile and maintain a model of the underlying network resources with respect to (one or more) characteristic properties of interest. To be manageable, such models must be compact, and must enable a representation of properties along temporal, spatial, and measurement resolution dimensions. In this paper, we propose a general framework for the construction of such metric-induced models using end-to-end measurements. We instantiate our approach using one such property, packet loss rates, and present an analytical framework for the characterization of Internet loss topologies. From the perspective of a server the loss topology is a logical tree rooted at the server with clients at its leaves, in which edges represent lossy paths between a pair of internal network nodes. We show how end-to-end unicast packet probing techniques could b e used to (1) infer a loss topology and (2) identify the loss rates of links in an existing loss topology. Correct, efficient inference of loss topology information enables new techniques for aggregate congestion control, QoS admission control, connection scheduling and mirror site selection. We report on simulation, implementation, and Internet deployment results that show the effectiveness of our approach and its robustness in terms of its accuracy and convergence over a wide range of network conditions.

Small-World Internet Topologies: Possible Causes and Implications on Scalability of End-System Multicast

Recent work has shown the prevalence of small-world phenomena [28] in many networks. Small-world graphs exhibit a high degree of clustering, yet have typically short path lengths between arbitrary vertices. Internet AS-level graphs have been shown to exhibit small-world behaviors [9]. In this paper, we show that both Internet AS-level and router-level graphs exhibit small-world behavior. We attribute such behavior to two possible causes–namely the high variability of vertex degree distributions (which were found to follow approximately a power law [15]) and the preference of vertices to have local connections. We show that both factors contribute with different relative degrees to the small-world behavior of AS-level and router-level topologies. Our findings underscore the inefficacy of the Barabasi-Albert model [6] in explaining the growth process of the Internet, and provide a basis for more promising approaches to the development of Internet topology generators. We present such a generator and show the resemblance of the synthetic graphs it generates to real Internet AS-level and router-level graphs. Using these graphs, we have examined how small-world behaviors affect the scalability of end-system multicast. Our findings indicate that lower variability of vertex degree and stronger preference for local connectivity in small-world graphs results in slower network neighborhood expansion, and in longer average path length between two arbitrary vertices, which in turn results in better scaling of end system multicast.

Unicast-based Characterization of Network Loss Topologies

Current Internet transport protocols make end-to-end measurements and maintain per-connection state to regulate the use of shared network resources. When a number of such connections share a common endpoint, that endpoint has the opportunity to correlate these end-to-end measurements to better diagnose and control the use of shared resources. A valuable characterization of such shared resources is the "loss topology". From the perspective of a server with concurrent connections to multiple clients, the loss topology is a logical tree rooted at the server in which edges represent lossy paths between a pair of internal network nodes. We develop an end-to-end unicast packet probing technique and an associated analytical framework to: (1) infer loss topologies, (2) identify loss rates of links in an existing loss topology, and (3) augment a topology to incorporate the arrival of a new connection. Correct, efficient inference of loss topology information enables new techniques for aggregate congestion control, QoS admission control, connection scheduling and mirror site selection. Our extensive simulation results demonstrate that our approach is robust in terms of its accuracy and convergence over a wide range of network conditions.

Resonant power conversion topologies for inductive charging of electrical vehicle batteries

This thesis is concerned with inductive charging of electric vehicle batteries. Rectified power form the 50/60 Hz utility feeds a dc-ac converter which delivers high-frequency ac power to the electric vehicle inductive coupling inlet. The inlet configuration has been defined by the Society of Automotive Engineers in Recommended Practice J-1773. This thesis studies converter topologies related to the series resonant converter. When coupled to the vehicle inlet, the frequency-controlled series-resonant converter results in a capacitively-filtered series-parallel LCLC (SP-LCLC) resonant converter topology with zero voltage switching and many other desirable features. A novel time-domain transformation analysis, termed Modal Analysis, is developed, using a state variable transformation, to analyze and characterize this multi-resonant fourth-orderconverter. Next, Fundamental Mode Approximation (FMA) Analysis, based on a voltage-source model of the load, and its novel extension, Rectifier-Compensated FMA (RCFMA) Analysis, are developed and applied to the SP-LCLC converter. The RCFMA Analysis is a simpler and more intuitive analysis than the Modal Analysis, and provides a relatively accurate closed-form solution for the converter behavior. Phase control of the SP-LCLC converter is investigated as a control option. FMA and RCFMA Analyses are used for detailed characterization. The analyses identify areas of operation, which are also validated experimentally, where it is advantageous to phase control the converter. A novel hybrid control scheme is proposed which integrates frequency and phase control and achieves reduced operating frequency range and improved partial-load efficiency. The phase-controlled SP-LCLC converter can also be configured with a parallel load and is an excellent option for the application. The resulting topology implements soft-switching over the entire load range and has high full-load and partial-load efficiencies. RCFMA Analysis is used to analyze and characterize the new converter topology, and good correlation is shown with experimental results. Finally, a novel single-stage power-factor-corrected ac-dc converter is introduced, which uses the current-source characteristic of the SP-LCLC topology to provide power factor correction over a wide output power range from zero to full load. This converter exhibits all the advantageous characteristics of its dc-dc counterpart, with a reduced parts count and cost. Simulation and experimental results verify the operation of the new converter.