Finding an Euclidean anti--centrum location of a set of points

An obnoxious facility is to be located inside a polygonal region of the plane, maximizing the sum of the k smallest weighted Euclidean distances to n given points, each protected by some polygonal forbidden region. For the unweighted case and k fixed an O(n²logn) time algorithm is presented. For the weighted case a thorough study of the relevant structure of the multiplicatively weighted order-k-Voronoi diagram leads to the design of an O(kn³+n³logn) time algorithm for finding an optimal solution to the anti-t-centrum problem for every t=1,…,k, simultaneously.     

PostgreSQL存储过程移植方法

在对PostgreSQL存储过程处理机制进行研究的基础上,分析了Oracle存储过程移植到PostgreSQL时的语法、参数默认值、out参数、事务回滚、游标和内置函数等问题,并从成本、收益和技术难度的角度比较了两种存储过程移植方法--改写存储过程方法和扩展PostgreSQL的存储过程功能方法.深入研究了通过扩展PL/pgSQL源码来调整PostgreSQL存储过程功能的PLSE方法.     

量子密码在无线局域网中的安全研究

本文通过对量子密码BB84协议及IEEE802.11i认证协议的分析与讨论,深入研究了802.11i密钥管理机制中的4次握手,利用量子密码安全的优势与IEEE802.11i无线网络相结合,提出量子握手,为无线网络中数据的通信安全提供保障。     

基于ARM-Linux的钢丝绳损伤检测系统设计

针对现有钢丝绳检测系统实时性与适应性差、自动化程度低的问题,提出了一种基于ARM-Linux的高性能钢丝绳损伤检测系统的设计方案,详细介绍了该系统的硬件组成、工作原理、软件实现方法及实时采样曲线绘制的设计与实现。该系统结合嵌入式Linux技术和漏磁无损检测技术,可独立完成检测任务,实时显示检测波形,提高了检测效率。     

韶钢汽车运输管理系统开发与应用

韶钢汽车运输网络系统是自主开发的大型数据库应用系统,建立一套舍括汽车设备、运输、成本及考核等高度信息化的管理系统．提升韶钢的汽车运输管理水平,使其更好地适应韶钢的发展需要。     

On a new class of analytic functions associated with conic domain

The aim of this paper is to generalize the conic domain defined by Kanas and Wisniowska, and define the class of functions which map the open unit disk E onto this generalized conic domain. A brief comparison between these conic domains is the main motivation of this paper. A correction is made in selecting the range interval of order of conic domain.     

An inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities

In this paper, we investigate an inexact hybrid projection-proximal method for solving a class of generalized mixed variational inequalities in Hilbert spaces. We construct a general inexact hybrid projection-proximal point algorithm, in which an inexact relaxed proximal point step is followed by a suitable orthogonal projection onto a hyperplane. Under some suitable conditions concerned with the pseudomonotone set-valued mapping T, the nonsmooth convex function f and the step size λ_k, we prove the convergence of the inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities in Hilbert spaces.     

Algorithms to Separate $\{0,\frac{1}{2}\}$ -Chvátal-Gomory Cuts

Chvátal-Gomory cuts are among the most well-known classes of cutting planes for general integer linear programs (ILPs). In case the constraint multipliers are either 0 or , such cuts are known as -cuts. It has been proven by Caprara and Fischetti (Math. Program. 74:221–235, 1996) that separation of -cuts is -hard. In this paper, we study ways to separate -cuts effectively in practice. We propose a range of preprocessing rules to reduce the size of the separation problem. The core of the preprocessing builds a Gaussian elimination-like procedure. To separate the most violated -cut, we formulate the (reduced) problem as integer linear program. Some simple heuristic separation routines complete the algorithmic framework. Computational experiments on benchmark instances show that the combination of preprocessing with exact and/or heuristic separation is a very vital idea to generate strong generic cutting planes for integer linear programs and to reduce the overall computation times of state-of-the-art ILP-solvers.     

从MC9S12D到MC9S12XS

从第四届全国大学生"飞思卡尔"杯智能车竞赛开始,竞赛组委会推荐使用MC9S12XS128单片机替代前三届竞赛中使用的MC9S12DG128。S12X是新一代双核单片机,制造工艺从0.25μm进步到0.18μm;总线频率从25MHz提高到40MHz;S12XS单片机保留了S12X CPU,去掉了另一个CPU-XGate,保留了技术进步,提高了性能,简化了操作。