Temperature and junction-type dependency of Andreev reflection in MgB2

We studied the voltage and temperature dependency of the dynamic conductance of normal metal-MgB₂ junctions obtained either with the point-contact technique (with Au and Pt tips) or by making Ag-paint spots on the surface of MgB₂ samples. The fit of the conductance curves with the generalized BTK model gives evidence of pure s-wave gap symmetry. The temperature dependency of the gap, measured in Ag-paint junctions (dirty limit), follows the standard BCS curve with 2Δ/k_BT_c=3.3. In out-of-plane, high-pressure point-contacts we obtained almost ideal Andreev reflection characteristics showing a single small s-wave gap Δ=2.6±0.2 meV (clean limit).     

In situ neutron diffraction study (300-1273 K) of non-stoichiometric strontium ferrite SrFeOx

The high-temperature cubic phase of non-stoichiometric strontium ferrite SrFeO_x (2.5≤x≤3.0) has been studied by in situ neutron powder diffraction in air over the temperature range 300-1273 K. The composition of SrFeO_x changes within the range 2.56≤x≤2.81 from 1273 to 673 K, respectively.Rietveld refinements of the diffraction patterns show that the high-temperature cubic phase of SrFeO_x is consistent with a face-centred Fm3c structure. This structure leads to agreement with previous density measurements. This cell allows the high-temperature structure of SrFeO_x to be described in terms of a solid solution of the composition end members. Cubic SrFeO_x at high temperature is found to closely obey Vegard's law. The density of cubic SrFeO_x is also found to exhibit a linear relationship with composition.     

HDTV信源解码器

本论文提出一种基于TMS320C6701 DSP实现HDTV信源解码器的方案。用C6701实现系统控制、解复用、AC-3音频解码,用STi7000视频解码。与现有的HDTV信源解码方案相比,本方案将核心芯片由三片(系统控制+解复用、视频解码和音频解码)减少到两片,有利于系统集成,代表了HDTV信源解码器的发展方向之一。     

掺钕聚甲基丙烯酸甲酯的光学特性

研究了制备的掺钕螯合物Nd(DBM)3Phen材料的吸收光谱、激发光谱、荧光光谱,应用Judd-Ofelt理论计算了该材料的强度参量．分析了钕离子激发态4F3／2的辐射寿命(631 μs)和4F3／2→4IJ′跃迁的受激发射截面和荧光分支比．     

基于旋转描述的三维几何造型方法

提出了一种能用凸四边形表示并可作平面展开的三维实体造型的设计方法。该方法用旋转描述表把二维平面展开图和三维实体联系起来，模拟人工折叠过程，由二维平面展开图逐次旋转变换完成三维造型重建。造型重建后，再通过纹理映射将平面设计图案映射到实体的各个面上，完成对实体着色渲染，生成具有真实感的三维实体。     

3COM三层交换机在城域网中的应用

介绍了3Com三层交换机Switch4900SX在城域网中的具体应用，包括用它进行路由交换、vlan划分等。     

Acoustic Analysis of Pathological Voices Compressedwith MPEG System

The MPEG-1 Layer 3 compression schema of audio signal, commonly known as mp3, has caused a great impact in recent years as it has reached high compression rates while conserving a high sound quality. Music and speech samples compressed at high bitrates are perceptually indistinguishable from the original samples, but very little was known about how compression acoustically affects the voice signal. A previous work with normal voices showed a high fidelity at high-bitrate compressions both in voice parameters and the amplitude-frequency spectrum. In the present work, dysphonic voices were tested through two studies. In the first study, spectrograms, long-term average spectra (LTAS), and fast Fourier transform (FFT) spectra of compressed and original samples of running speech were compared. In the second study, intensities, formant frequencies, formant bandwidths, and a multidimensional set of voice parameters were tested in a set of sustained phonations. Results showed that compression at high bitrates (96 and 128 kbps) preserved the relevant acoustic properties of the pathological voices. With compressions at lower bitrates, fidelity decreases, introducing some important alterations. Results from both works, Gonzalez and Cervera and this paper, open up the possibility of using MPEG-compression at high bitrates to store or transmit high-quality speech recordings, without altering their acoustic properties.     

Unavoidable Traces Of Set Systems

Sauer, Shelah, Vapnik and Chervonenkis proved that if a set system on n vertices contains many sets, then the set system has full trace on a large set. Although the restriction on the size of the groundset cannot be lifted, Frankl and Pach found a trace structure that is guaranteed to occur in uniform set systems even if we do not bound the size of the groundset. In this note we shall give three sequences of structures such that every set system consisting of sufficiently many sets contains at least one of these structures with many sets.     

On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance

The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004