基于图论的网络安全分析方法研究与应用

当前，对网络的安全状况进行定量分析和预警日益显得重要，文中通过对漏洞库中的大量漏洞信息进行分析，提出对网络安全脆弱性的威胁程度进行定量分析的层次分析模型和指标体系，采用图论的方法对各种安全脆弱性信息进行关联分析，并在此基础上构造入侵关系图模型，给出基于入侵关系图的网络安全威胁分析方法，最后对整个网络安全分析评估系统的实现原型进行了分析。     

STD-3000污水处理自动化监控系统

本系统以用户需求出发，运用计算机、自动控制、通信网络、人工智能等技术对污水处理的全过程进行控制和调节。对污水处理过程进行集成创新。它把污水处理厂的各种工艺设备有机的结合起来，按照处理工艺的要求，将设备运行工况和工艺运行参数进行实时采集，并进行复杂智能运算，计算出最佳的控制和调节值，对工艺设备进行实时控制和调节，使污水处理过程降低运行费用，并使处理后的污水达标排放。     

UML在教务管理系统设计中的应用

本文在对UML作了简要的介绍和概述后，对教务管理系统的需求和目标进行了分析，介绍了运用UML进行建模的步骤，并对教务管理系统运用UML进行了分析和设计，总结了运用UML建模的优势。     

微器件设计的优化决策规则获取方法研究

针对微器件产品优化评价规则缺乏的现状，采用现代设计方法对微器件优化决策规则进行了研究，有限元方法被用于对微器件进行动态分析，获取大量的信息数据；粗糙集理论和遗传算法被用于属性约简和优化决策规则提取，根据以上方法对相应原型软件进行开发，对热驱动微泵实例进行应用示范，为微器件优化决策规则制定提供了方法和原型软件。     

辨证法在《计算机组装技术》实践课程教学中的应用

本文从自然辨证法的角度对《计算机组装技术》课程的实践教学提出7以下思路和方法：1．以发展的观念进行武装，敢于突破陈旧的概念，对课程教学进行大胆的改革；2．以事物的独立性和特殊性，对实践内容进行分类，对不同的内容采取不同的教学方法；3．建立多样化的应用体制，在实践中进行检验，在应用中进行提高。     

分布式应用程序模式及其在税务征管中的应用研究

结合分布式网络的发展，对分布式应用程序模式及其演变过程进行了介绍和分析，然后以税务征管系统为例，对其采用分布式网络和分布式应用程序的设计思路和发展阶段进行了分析，最后对分布式应用程序模式的发展趋势进行了探讨。     

"电子警察"管理信息系统初探

“电子警察”技术的发展和系统的扩展，到今天，各城市每天会采集大量的交通违法数据，原有的系统是难以对这些数据进行处理和管理，需要用新的系统来对这些数据进行管理。本文通过对广州市“电子警察”管理信息系统的现状及其存在问题进行了分析和探讨，并对系统体系架构和实现手段进行了研究，以供大家商榷。     

卫星网络协议的仿真与模拟技术研究

本文主要对卫星网络中有关协议的模拟与仿真方法进行了研究。首先，对卫星网络中有关协议模拟与仿真的主要内容和指标进行了说明，接着对当前流行的卫星网络模拟仿真工具进行了介绍，然后对仿真工具的工作原理和工作方法进行了简单的解释，最后给出了使用模拟工具模拟卫星网络中路由协议的结果，并对构建自主仿真平台进行了探讨。     

WebCCTV中的流传输服务器的设计和实现

针对传统的CCTV系统，对WebCCTV系统进行了简要介绍和比较，然后对其中流传输服务器的实现以及结构进行了解释，并说明了该系统的技术要点，对该系统的性能和完善方面进行了分析。     

基于Linux的嵌入式数字监控系统的设计和实现

对视频监控的现行方案进行了分析比较，详尽分析和设计了系统框架模型，对系统结构和功能作出了描述，给出了具体的实现，并对未来可进行的拓展工作进行了展望。     

Fault-Tolerant Hamiltonicity and Hamiltonian Connectivity of BCube with Various Faulty Elements

BCube is one kind of important data center networks. Hamiltonicity and Hamiltonian connectivity have significant applications in communication networks. So far, there have been many results concerning fault-tolerant Hamiltonicity and fault-tolerant Hamiltonian connectivity in some data center networks. However, these results only consider faulty edges and faulty servers. In this paper, we study the fault-tolerant Hamiltonicity and the fault-tolerant Hamiltonian connectivity of BCube(n, k) under considering faulty servers, faulty links/edges, and faulty switches. For any integers n ≥ 2 and k ≥ 0, let BC_n,k be the logic structure of BCube(n, k) and F be the union of faulty elements of BC_n,k. Let f_v, f_e, and f_s be the number of faulty servers, faulty edges, and faulty switches of BCube(n, k), respectively. We show that BC_n,k-F is fault-tolerant Hamiltonian if f_v + f_e + (n-1)f_s ≤ (n-1)(k + 1)-2 and BC_n,k-F is fault-tolerant Hamiltonian-connected if f_v + f_e + (n-1)f_s ≤ (n-1)(k + 1)-3. To the best of our knowledge, this paper is the first work which takes faulty switches into account to study the fault-tolerant Hamiltonicity and the fault-tolerant Hamiltonian connectivity in data center networks.     

Heaps and heapsort on secondary storage

A heap structure designed for secondary storage is suggested that tries to make the best use of the available buffer space in primary memory. The heap is a complete multi-way tree, with multi-page blocks of records as nodes, satisfying a generalized heap property. A special feature of the tree is that the nodes may be partially filled, as in B-trees. The structure is complemented with priority-queue operations insert and delete-max. When handling a sequence of S operations, the number of page transfers performed is shown to be O(∑_{i = 1}^S(1/P) log_(M/P)(N_i/P)), where P denotes the number of records fitting into a page, M the capacity of the buffer space in records, and N_i, the number of records in the heap prior to the ith operation (assuming P 1 and S> M c · P, where c is a small positive constant). The number of comparisons required when handling the sequence is O(∑_{i = 1}^S log₂ N_i). Using the suggested data structure we obtain an optimal external heapsort that performs O((N/P) log_(M/P)(N/P)) page transfers and O(N log₂ N) comparisons in the worst case when sorting N records.     

A complete algebraic solvability test for the nonstrict Lyapunov inequality

For arbitrary equally sized square complex matrices A and Q (Q Hermitian), the paper provides a complete algebraic test for verifying the existence of a Hermitian solution X of the nonstrict Lyapunov inequality A^*X + XA + Q 0. If existing, we exhibit how to construct a solution. Our approach involves the validation problem for the linear matrix inequality Σ_j=1^k (A_j^*X_jB_j + B_j^*X_j^*A_j) + Q> 0 in X_j, for which we provide an algebraic solvability test and a construct solutions if the kernels of A_j or, dually, those of B_j form an isotonic sequence.     

基于中间件的信息系统安全解决方案

C／S结构与B／S结构各有优缺点,怎样结合B／S与C／S结构是开发MIS（Management Information System）普遍关注的问题。在实际应用中,两种结构的有机结合,可以扬长避短,有效地发挥了各自的优势。随着信息系统规模的不断扩大和互联网技术的发展,多层体系结构B／W／S／S、C／S／S应运而生,同时,B／W／S／S与C／S／S混合结构下信息系统的安全性也受到威胁。在综合分析了B／W／S／S和C／S／S混合结构信息系统模式的基础上,提出了一种基于中间件的C／S／S与B／W／S／S混合模型的MIS安全解决方案。     

Properties of Noncentral Dirichlet Distributions

Let X₁,…, X_r+1 be independent random variables, X_iGa (a_i, θ, δ_i), i = 1,…, r + 1. Define and V_i = X_i/X_r+1, i = 1,…, r. Then, (U₁,…, U_r) and (V₁,…, V_r) follow noncentral Dirichlet Type 1 and Type 2 distributions, respectively. In this article several properties of these distributions and their connections with the uniform, the noncentral multivariate-F and the noncentral multivariate-t distributions are discussed.     

Confluent general-factorial difference and derivative operators and polynomial-exponential interpolation

A previous application of the Newton divided difference series of the displacement function E^z = (1 + Δ)^z = e ^Dz, where the operators Δ and D are the variables, to purely exponential interpolation employing general-factorial differences and derivatives, {Pi;^m_i=0 (Δ - S_i)}f(0) and {Pi;^m_i=0 (D - t_i)}f(0), in which the s_i's and t_i's are distinct[1], is here extended to mixed polynomial-exponential interpolation where the s_i's and t_i's are no longer distinct.     

Efficient algorithms for the all nearest neighbor and closest pair problems on the linear array with a reconfigurable pipelined bus system

We present two O(1)-time algorithms for solving the 2D all nearest neighbor (2D/spl I.bar/ANN) problem, the 2D closest pair (2D/spl I.bar/CP) problem, the 3D all nearest neighbor (3D/spl I.bar/ANN) problem and the 3D-closest pair (3D/spl I.bar/CP) problem of n points on the linear array with a reconfigurable pipelined bus system (LARPBS) from the computational geometry perspective. The first O(1) time algorithm, which invokes the ANN properties (introduced in this paper) only once, can solve the 2D/spl I.bar/ANN and 2D/spl I.bar/CP problems of n points on an LARPBS of size 1/2n/sup 5/3+c/, and the 3D/spl I.bar/ANN and 3D/spl I.bar/CP problems pf n points on an LARPBS of size 1/2n/sup 7/4+c/, where 0 < /spl epsi/ = 1/2/sup c+1/-1 /spl Lt/ 1, c is a constant and positive integer. The second O(1) time algorithm, which recursively invokes the ANN properties k times, can solve the kD/spl I.bar/ANN, and kD/spl I.bar/CP problems of n points on an LARPBS of size 1/2n/sup 3/2+c/, where k = 2 or 3, 0 < /spl epsi/ = 1/2/sup n+1/-1 /spl Lt/ 1, and c is a constant and positive integer. To the best of our knowledge, all results derived above are the best O(1) time ANN algorithms known.     

AM/FM/GIS应用系统建设中若干问题的探讨

在进行多项AM／FM／GIS应用系统建设实践和对AM／FM／GIS的深入研究的基础上,阐述了AM／FM／GIS的特点,指出了当前AM／FM／GIS建设过程中存在的一系列问题,并从AM／FM／GIS标准,平台建设,模型集成,知识与规则的应用,多层体系结构,分布式计算等几个方面对AM／FM／GIS进行了较为详细的探讨,提出了解决相关问题的思路。     

A note on nearest neighbour error rates

Let A_k,l,E_k,l denote the acceptance and error rates in the (k,l) case of the nearest neighbour decision rule. We show that if q>k and A_q,m = A_k,l then E_q,m ≤ E_k,l.     

Moments of conjugacy classes of binary words

For each nonempty binary word w=c₁c₂c_q, where c_i{0,1}, the nonnegative integer ∑_i=1^q (q+1−i)c_i is called the moment of w and is denoted by M(w). Let [w] denote the conjugacy class of w. Define M([w])={M(u): u[w]}, N(w)={M(u)−M(w): u[w]} and δ(w)=max{M(u)−M(v): u,v[w]}. Using these objects, we obtain equivalent conditions for a binary word to be an -word (respectively, a power of an -word). For instance, we prove that the following statements are equivalent for any binary word w with |w|2: (a) w is an -word, (b) δ(w)=|w|−1, (c) w is a cyclic balanced primitive word, (d) M([w]) is a set of |w| consecutive positive integers, (e) N(w) is a set of |w| consecutive integers and 0N(w), (f) w is primitive and [w]St.