基于i.MX35的工程机械显示终端设计

工程机械显示终端是重要的人机交互界面,随着工程机械控制系统信息化和智能化水平的不断提高,对车载显示终端也提出了越来越高的要求。为了满足需求,研制了基于i.MX35的工程机械显示终端,该显示终端以i.MX35多媒体应用处理器为核心,采用CODESYS作为应用编程平台,实现了人机界面显示、CAN总线通信、摄像头视频采集、大容量数据存储等功能,具有显示性能强大、启动速度快、应用编程灵活、易于扩展等特点,可以广泛应用于各种工程机械控制系统中。     

Robust Optimal Service Analysis of Single-Server Re-Entrant Queues

We generalize the analysis of J.A. Ball, M.V. Day, and P. Kachroo (Mathematics of Control, Signals, and Systems, vol. 12, pp. 307–345, 1999) to a fluid model of a single server re-entrant queue. The approach is to solve the Hamilton-Jacobi-Isaacs equation associated with optimal robust control of the system. The method of staged characteristics is generalized from Ball et al. (1999) to construct the solution explicitly. Formulas are developed allowing explicit calculations for the Skorokhod problem involved in the system equations. Such formulas are particularly important for numerical verification of conditions on the boundary of the nonnegative orthant. The optimal control (server) strategy is shown to be of linear-index type. Dai-type stability properties are discussed. A modification of the model in which new customers are allowed only at a specified entry queue is considered in 2 dimensions. The same optimal strategy is found in that case as well.     

Some Upper Bounds on the Covering Radii of Linear Codes Over Fq and Their Applications

We show that the covering radius R of an [n,k,d] code over F_q is bounded above by R n-n _q(k, d/q). We strengthen this bound when R d and find conditions under which equality holds.As applications of this and other bounds, we show that all binary linear codes of lengths up to 15, or codimension up to 9, are normal. We also establish the normality of most codes of length 16 and many of codimension 10. These results have applications in the construction of codes that attain t[n,k,/it>], the smallest covering radius of any binary linear [n,k].We also prove some new results on the amalgamated direct sum (ADS) construction of Graham and Sloane. We find new conditions assuring normality of the ADS; covering radius 1 less than previously guaranteed for ADS of codes with even norms; good covering codes as ADS without the hypothesis of normality, from concepts p- stable and s- stable; codes with best known covering radii as ADS of two, often cyclic, codes (thus retaining structure so as to be suitable for practical applications).     

On a kind of integrals of empirical processes concerning insurance risk

This paper proves the strong consistence and the central limit theorems for empirical right tail deviations.     

Lattice tensor products. III - Congruences

G. Grätzer and F. Wehrung introduced the lattice tensor product, A?B, of the lattices Aand B. In Part I of this paper, we showed that for any finite lattice A, we can "coordinatize" A?B, that is, represent A?,B as a subset A of B ^A, and provide an effective criteria to recognize the A-tuples of elements of B that occur in this representation. To show the utility of this coordinatization, we prove, for a finite lattice A and a bounded lattice B, the isomorphism Con A ≌ (Con A)B>, which is a special case of a recent result of G. Grätzer and F. Wehrung and a generalization of a 1981 result of G. Grätzer, H. Lakser, and R.W. Quackenbush.     

There Exists a Simple Non Trivial t-design with an Arbitrarily Large Automorphism Group for Every t

In 1987, Teirlinckproved that if t and are two integers such that v t(mod(t + 1)!^(2t+1) and v t + 1 >0, then there exists a t - (v, t + 1, (t + 1)!^(2t+1)) design. We prove that if there exists a (t+1)-(v,k,)design and a t-(v-1,k-2, (k-t-1)/(v-k+1))design with t 2, then there exists a t-(v+1,k, (v-t+1)(v-t)/ (v-k+1)(k-t))design. Using this recursive construction, we prove that forany pair (t,n) of integers (t 2and n 0), there exists a simple non trivial t-(v,k,) design having an automorphism groupisomorphic to ⁿ ₂.     

光信息科学与技术专业的建设

就光信息科学与技术专业建设的专业定位、课程设置、学生毕业后的去向等问题发表了个人的看法。介绍了在这方面的一些做法,提供了有关数据,可供同类专业的建设参考。     

一种计算工作时间参数新方法

为了编制和优化施工进度计划,计算构成施工项目的各项工作最早开始时间、最迟开始时间、最早完成时间、最迟完成时间、总时差和自由时差等时间参数十分重要.提出了一种计算工作时间参数新方法.该方法以工作完成时间为决策变量,通过建立和求解线性规划模型来得到各种工作时间参数.其建模思路清晰,不需绘制网络图,能用通用办公软件EXCEL求解.模拟计算表明,用该方法与用标准网络计划技术计算出的工作时间参数完全一致.