全息干板的时间响应特性

全息干板的感光过程涉及到银原子和光电子的动力学过程,这些动力学特性决定了全息干板对不同曝光时间尺度具有不同的感光效率。介绍了用随机过程方法建立的全息干板时间响应理论模型,用该模型分析了SlavichVRP-M型全息干板的时间响应特性并进行了数值模拟。设计了三套不同的曝光实验装置用于时间响应特性的研究,给出了8个时间点的实验数据,在曝光量不变的情况下,曝光时间范围为0.5 ns~10 s。实验结果与理论结果比较吻合,表明全息干板在曝光过程中存在低照度和高照度互易律失效。最后简要分析了互易律失效对全息照相的影响。     

Analysis of fair rate calculations in resilient packet ring aggressive mode

Resilient packet ring (RPR) standardized as IEEE 802.17 is a new medium access control (MAC) protocol for metro-ring networks. RPR supports spatial reuse which increases the achieved throughput but it can also result in congestion and starvation of nodes on the ring. Therefore, it is necessary to employ mechanisms to enforce a fair allocation of the ring bandwidth in RPR. In order to maintain fairness among nodes, a fairness algorithm is deployed at each RPR node. When a node detects congestion, it calculates a fair rate which is advertised to all upstream nodes contributing to congestion. Upon receiving the fair rate, the upstream nodes limit the rate of their injected traffic to the advertised fair rate. Consequently, the congested node can utilize the unused capacity and add its local traffic to the ring. In this paper, we develop an analytical model for fair rate calculation in the RPR aggressive mode fairness algorithm in the parking-lot scenario. This model provides an insight on dynamics of the RPR fairness algorithm and can be used to evaluate its performance. We investigate this problem in two cases. First, we assume that the link propagation delay is zero and derive the fair rate equations for this ideal case. We then consider the link propagation delay and develop a more realistic model. We verify the accuracy of our model by simulation results. Furthermore, we use the developed model to study the impact of various parameters on convergence of the fair rate.     

LMBE法生长Mg0.2Zn0.8O及MSM型紫外探测器的制备

采用激光分子束外延(LMBE)方法在蓝宝石(0001)面生长了高质量的Mg0.2Zn0.8O薄膜,并对薄膜在空气中900℃进行了1h的退火处理,然后采用剥离方法在薄膜表面制作了Al叉指电极,制备出MSM型Mg0.2Zn0.8O光电导紫外探测器.对响应时间的测试表明,探测器的上升时间仅为14.3ns,下降时间为6.5μs.     

"时间窗"对天线时域平面近场测试结果的影响

天线时域近场测试技术是一种新兴的、测试宽带场和工作在窄脉冲激励下天线辐射场的高效的测试技术.因为它可以利用"时间窗"技术进行信号处理,使其相对频域测试具有独特的优势.本文在已建立的天线时域近场测试系统的基础上,从实验的角度,对"时间窗"参数在天线时域平面近场测试中的影响进行验证分析.举例了三个波段标准天线方向图的测试分析结果,并得出初步结论.     

TD-SCDMA系统的一种慢速动态信道分配算法

动态信道分配是TD-SCDMA的关键技术之一,根据网络负载和干扰的变化自适应地调整信道资源,使之达到合理配置。文中针对TD-SCDMA系统的帧结构,分析了双小区模型,并提出了一种采用双小区相同上下行时隙进行信道分配的方法,仿真结果表明:与传统的固定信道分配算法相比,推荐的算法大大提高了频谱利用率及系统容量。     

Multiple resonances with time delays in scale-free networks of Hodgkin-Huxley neurons subjected to non-Gaussian noise

The spiking behavior with varying time delay in scale-free networks of Hodgkin-Huxley neurons with non-Gaussian noise has been studied,and the effect of non-Gaussian noise on the delay-induced spiking behavior is discussed. It was found that multiple spatio-temporal resonances occur when the delay lengths are integer multiples of the spiking periods,and the resonances may be strengthened when the non-Gaussian noise is appropriate. This result shows that time delays can optimize the spiking temporal regulari...     

Inverse chaos synchronization between bidirectionally coupled variable multiple time delay systems

We make first report on inverse chaos synchronization between bidirectionally non-linearly and linearly coupled variable multiple time delay laser systems governed by the Ikeda model. The results are of certain importance in secure chaos-based communication systems.     

现代美声演唱中室内声学系统建设探究

本文根据美声演唱的具体需要，在分析了室内混响时间测量方式的基础上，以VRAS（可变室内声学系统）为例探究了室内声学系统建设的可行性及重要意义。     

Choiceless polynomial time

Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures and compute exactly PTime properties? This question can be recast as follows: Does there exist a logic that captures polynomial time (without presuming the presence of a linear order)? Earlier, one of us conjectured a negative answer. The problem motivated a quest for stronger and stronger PTime logics. All these logics avoid arbitrary choice. Here we attempt to capture the choiceless fragment of PTime. Our computation model is a version of abstract state machines (formerly called evolving algebras). The idea is to replace arbitrary choice with parallel execution. The resulting logic expresses all properties expressible in any other PTime logic in the literature. A more difficult theorem shows that the logic does not capture all of PTime.