电气信息试点班人才培养计划的制定与实践

提出了按电气信息类宽口径专业培养人才的思路,并进行了大量的调查研究,提出了改革方案。以西安交通大学电气信息试点班为载体,进行了研究探索与实践,取得了一定的经验和成果。     

干涉多光谱卫星图像序列编码

星载干涉多光谱图像序列通过图像匹配实行定位形成光谱序列,相邻图像之间具有很强的相关性,与一般图像序列不同的是,相邻图像之间具有明显的平移特点。为了充分利用这一特点实现有效的图像压缩,同时减少编码系统复杂度,提出了一种新的图像序列编码方法,通过小波域系数匹配算法检测出相邻图像之间的相对位移量,然后对差值图像进行类似于单幅图像的编码,从而提高了总体编码效率。本算法具有与相同单幅图像编码算法相当的低复杂度特点,只需要对单幅图像与模板的差值进行基于小波变换的编码,从而避免了基于三维小波变换的编码算法对系统存储量要求大以及编码延时大的缺陷。仿真结果表明,本算法比基于三维小波变换的编码算法效果更好。     

基于dsPIC33F系列单片机的应用程序升级方法

为了适应客户需求变化或程序BUG的修改,利用dsPIC33F单片机运行时的自编程特性,实现了基于该单片机的应用程序升级功能。在详细描述基本原理的基础上,给出了引导程序的实现流程图,并提供实现流程中一些关键细节的实现方法,最后对实际应用中的升级正确性及继点续传问题进行了探讨。该方法的实现原理同样适用于其他具备运行时自编程或有应用编程功能的单片机中。     

无线射频中软件解码功能的实现

在消费电子领域中,遥控射频控制一般是由硬件完成的,如PT2262和PT2272的配对使用。这种控制方法固化了其对应关系,对遥控设备要求严格配对使用,无法灵活扩展及参与组网控制。为解决这种控制方式带来的问题,采用MicroChip公司的低功耗自身带有E2PROM的PIC12F675单片机,利用C语言完成软件解码及对码程序的编制。其程序在QL200开发板上调试成功。利用此解码程序的解码产品,具有外围电路简单,抗干扰性强,解码速度快,成本低,代码具有可移植性,可以完全替代硬件解码,弥补了硬件解码的缺陷,适用于任何具有PT2262编码格式的遥控器,可直接参与控制等特点。     

Optimal policy for a two-facility inventory problem with storage constraints and two freight modes

This paper considers a two-facility supply chain for a single product in which facility 1 orders the product from facility 2 and facility 2 orders the product from a supplier in each period. The orders placed by each facility are delivered in two possible nonnegative integer numbers of periods. The difference between them is one period. Random demands in each period arise only at facility 1. There are physical storage constraints at both facilities in each period. The objective of the supply chain is to find an ordering policy that minimizes the expected cost over a finite horizon and the discounted stationary expected cost over an infinite horizon. We characterize the structure of the minimum expected cost and the optimal ordering policy for both the finite and the discounted stationary infinite horizon problems.     

Competitive facility location on decentralized supply chains

This paper addresses a novel competitive facility location problem about a firm that intends to enter an existing decentralized supply chain comprised of three tiers of players with competition: manufacturers, retailers and consumers. It first proposes a variational inequality for the supply chain network equilibrium model with production capacity constraints, and then employs the logarithmic-quadratic proximal prediction–correction method as a solution algorithm. Based on this model, this paper develops a generic mathematical program with equilibrium constraints for the competitive facility location problem, which can simultaneously determine facility locations of the entering firm and the production levels of these facilities so as to optimize an objective. Subsequently, a hybrid genetic algorithm that incorporates with the logarithmic-quadratic proximal prediction–correction method is developed for solving the proposed mathematical program with an equilibrium constraint. Finally, this paper carries out some numerical examples to evaluate proposed models and solution algorithms.     

On a class of binary linear completely transitive codes with arbitrary covering radius

An infinite class of new binary linear completely transitive (and so, completely regular) codes is given. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ≥2, there exist two codes in the constructed class with d=3, covering radius ρ and lengths and , respectively. The corresponding distance-transitive graphs, which can be defined as coset graphs of these completely transitive codes are described.     

There exists no self-dual [24,12,10] code over $${{\mathbb F}_5}$$

Self-dual codes over exist for all even lengths. The smallest length for which the largest minimum weight among self-dual codes has not been determined is 24, and the largest minimum weight is either 9 or 10. In this note, we show that there exists no self-dual [24, 12, 10] code over , using the classification of 24-dimensional odd unimodular lattices due to Borcherds.      

Enumerating and decoding perfect linear Lee codes

Using group theory approach, we determine all numbers q for which there exists a linear 1-error correcting perfect Lee code of block length n over Z _q , and then we enumerate those codes. At the same time this approach allows us to design a linear time decoding algorithm.      

前缀码的嵌入定理

设X*是字母表X上的自由幺半群,以X*为顶点集构造一个语言图Γ(X*),引入语言图Γ(X*)的横截集的概念,给出了前缀码嵌入到极大前缀码的一个构造.