Synthesis,structure, CO oxidation,and H2 production activities of CaCu3−xMnxTi4−xMnxO12 (x = 0, 0.5, and 1.0)

Synthesis of nanocrystalline pristine and Mn-doped calcium copper titanate quadruple perovskites, CaCu_3?xMn_xTi_4?xMn_xO₁₂ (x = 0, 0.5, and 1.0) by modified citrate solution combustion method has been reported. Powder X-ray diffraction patterns attest the phase purity of the perovskite materials. Average particle sizes of all the materials obtained from the Scherrer's formula are in the range of 55–70 nm. The specific surface areas for all the perovskites obtained from BET isotherms are found to be low as expected for the condensed oxide systems and fall in the range of 13–17 m² g^?1. Transmission electron microscopy studies show a reduction in particle size of CaCu₃Ti₄O₁₂ with increase in Mn doping. Ca and Ti are present in +2 and +4 oxidation states in all the materials as demonstrated by X-ray photoelectron spectroscopy analyses. Cu²⁺ gets reduced in CaCu₃Ti₄O₁₂ with higher Mn content. Mn is observed to be present only in +3 oxidation state. All the materials have been examined to be active in CO oxidation as well as H₂ production from methanol steam reforming. CaCu₃Ti₄O₁₂ with ~14 at.% Mn is found to show best catalytic activities among these materials. A comprehensive analysis of the catalytic activities of these perovskites toward CO oxidation and H₂ production from MSR reveal the cooperative activity of copper-manganese in the doped perovskites and it is more effective at lower manganese content.     

以用户为中心的可见光通信协作传输中训练资源分配算法

以用户为中心的可见光通信协作传输是近年来出现的新架构,这导致虚拟小区之间出现重叠。为避免导频污染问题,每个虚拟小区中的光接入点(AP)或者虚拟小区中选择相同AP的用户发送的训练序列应该是正交的。针对可见光通信中以用户为中心的协作网络,研究训练资源的正交分配问题,提出了一种新的导频分配算法,联合导频分配和用户选择问题,以期最大限度地增加虚拟小区内可被接入的用户数。分析和仿真结果表明,该导频分配方案可以有效改善导频污染问题,提高训练资源利用率,并且相比已有的导频分配方案,性能有所改进。     

A Novel Approach to Analyzing the Occupancy of the Geo/Geo/∞ Queueing System

Discrete time queueing systems have been successfully used to model packet queues in computer and digital communications systems. In this article we introduce a novel approach to analyzing the Geo^X/Geo^Y/∞ queueing system, which is suitable for modelling high speed computer and communications systems. The approach is based on characterizing the system by a functional equation which is then solved recursively to give identical results to those obtained using other approaches.     

Scheduling Algorithms for Packet-Oriented MAC Protocols in Wireless Multimedia Systems

Future generation wireless multimediacommunications will require efficient Medium AccessControl (MAC) protocols able to guarantee suitable Qualityof Service (QoS) levels for different traffic classes whileachieving a high utilization of radio resources. This paperproposes a new scheduling technique to be adopted at the MAClevel in wireless access systems, named Dynamic Scheduling-Time DivisionDuplexing (DS-TDD), that efficiently managesvideo, voice, Web and background traffics. A theoretical approachis proposed in this paper to evaluate the DS-TDD performance withvoice and Web traffics. Simulation results have permitted tohighlight the following promising characteristics of the DS-TDDscheme: (i) a high capacity of real-time traffics isattained with a QoS insensitive to Web and background trafficloads; (ii) a high throughput can be guaranteed whilepreserving the QoS levels of the different traffic classes;(iii) heavier downlink traffic loads do not modify the QoSof uplink traffics. Finally, extensive comparisons with differentscheduling schemes proposed in the literature have permitted tohighlight the better performanceof DS-TDD.     

协同作战能力简析

协同作战能力(CEC)是一种充分利用网络技术的新型海岸防空技术，给系统的作战能力带来了革命性的交破。本文对协同作战能力的产生、功能、组成以及未来的发展趋势作了详细的介绍，阐述了CEC系统的总体设计思想。在此基础上，将CEC系统与传统的作战系统的性能和设计思想在各方面进行了比较，交出了CEC系统各方面的优越性能。协同作战能力是现代和未来作战系统的发展方向，CEC系统的发展必将成为衡量各国国防科技现代化的重要指标。     

A Neural Network Approach for Signal Detection in Digital Communications

In this paper, we propose a new approach for signal detection in wireless digital communications based on the neural network with transient chaos and time-varying gain (NNTCTG), and give a concrete model of the signal detector after appropriate transformations and mappings. It is well known that the problem of the maximum likelihood signal detection can be described as a complex optimization problem that has so many local optima that conventional Hopfield-type neural networks fail to solve. By refraining from the serious local optima problem of Hopfield-type neural networks, the NNTCTG makes use of the time-varying parameters of the recurrent neural network to control the evolving behavior of the network so that the network undergoes the transition from chaotic behavior to gradient convergence. It has richer and more flexible dynamics rather than conventional neural networks only with point attractors, so that it can be expected to have much ability to search for globally optimal or near-optimal solutions. After going through a transiently inverse-bifurcation process, the NNTCTG can approach the global optimum or the neighborhood of global optimum of our problem. Simulation experiments have been performed to show the effectiveness and validation of the proposed neural network based method for the signal detection in digital communications.     

移动IP综述

论述了移动IP的概念和发展过程，分析了国内外对移动IP研究的重点问题及其方法，对移动IP的发展方向进行了归纳和总结，并提出了有关用的问题。     

VC++实现的串口通讯数据处理

说明了在异步串行通信(RS-232)的工作方式下,对所接收的数据进行接收、处理,丢弃乱码,并进行保存的可靠方法,并给出了相关的VC 语言程序.     

The Minimum PAPR Code for OFDM Systems

In this letter, a block code that minimizes the peak‐to‐average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals is proposed. It is shown that peak envelope power is invariant to cyclic shift and codeword inversion. The systematic encoding rule for the proposed code is composed of searching for a seed codeword, shifting the register elements, and determining codeword inversion. This eliminates the look‐up table for one‐to‐one correspondence between the source and the coded data. Computer simulation confirms that OFDM systems with the proposed code always have the minimum PAPR.     

Affine Dependence Classification for Communications Minimization

This paper introduces results on placement and communications minimization for systems of affine recurrence equations. We show how to classify the dependences according to the number and nature of communications they may result in. We give both communication-free conditions and conditions for an efficient use of broadcast or neighbor-to-neighbor communication primitives. Since the dependences of a problem can generally not be all communication-free, we finally introduce a heuristic to globally minimize the communications based on the classification of dependences.