企业各软件的数据共享和整合分析浅谈

本文主要根据大多数企业存在各种软件各自独立运行,各软件之间数据不能相互共享,一些旧软件或不适用的软件与目前主流操作系统不兼容等问题,分析问题并用接口和整合方法解决,此平台利用云计算技术,解决大多数企业建设信息平台投资大的问题,同时方便企业使用和维护.     

Automatic parallelisation for LTI MIMO state space systems using FPGAs. An optimisation for cost & performance

The parallelism attained by the use of Field Programmable Gate Arrays (FPGAs) has shown remarkable potential for accelerating control systems applications. This comes at a time when well established methods based on inherited serial Central Processor Units (CPUs) cannot guarantee solutions for the increasing execution speed demands. However, the transition from serial to parallel architectures represents a tremendous challenge due to overwhelming numbers of unexplored options and conflicting factors. The work presented achieves a parallelisation characterisation for generic MIMO systems using stand-alone FPGA implementations. The main contribution is that a very fine subset of possible serial/parallel implementations is obtained. This is used to achieve a flexible trade-off between cost and performance. Automatic optimisation of latency, occupied FPGA area and execution speed is attained and justified in respect to most of the feasible scenarios.     

An improved SVD-based watermarking technique for copyright protection

The drawbacks of SVD-based image watermarking are false positive, robust and transparency. The former can be overcome by embedding the principal components of the watermark into the host image, the latter is dependent on how much the quantity (i.e., scaling factor) of the principal components is embedded. For the existing methods, the scaling factor is a fixed value; actually, it is image-dependent. Different watermarks need the different scaling factors, although they are embedded in the same host image. In this paper, two methods are proposed to improve the reliability and robustness. To improve the reliability, for the first method, the principal components of the watermark are embedded into the host image in discrete cosine transform (DCT); and for the second method, those are embedded into the host image in discrete wavelets transform (DWT). To improve the robustness, the particle swarm optimization (PSO) is used for finding the suitable scaling factors. The experimental results demonstrate that the performance of the proposed methods outperforms than those of the existing methods.     

变电站接地网大修改造探讨

变电站接地网改造设计是一项实践性很强的工作,针对兴义供电局开展的系列变电站地网大修改造工程。对地网安全指标评估、土壤结构分析、地网安全性能仿真研究、改造设计方法及施工工艺等实践经验进行了总结,旨在为今后相关单位的类似工作提供必要的参考。     

面向资源共享的信息系统集成

针对信息系统遗留系统的综合集成问题,分析系统需求,研究资源共享的集成目标。围绕该目标总结分析了当前信息系统集成的多种集成策略和方案,结合软件技术发展,提出了面向资源共享的信息系统集成总体框架。通过统一管理软件资源,提供资源访问统一门户,采用面向服务架构(SOA)理念基于消息总线的技术体制实现软件资源分布共享及信息交互。     

Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks

In integrated services networks, the provision of Quality of Service (QoS) guarantees depends critically upon the scheduling algorithm employed at the network layer. In this work we review fundamental results on scheduling, and we focus on Packet Fair Queueing (PFQ) algorithms, which have been proposed for QoS wireline-wireless networking. The basic notion in PFQ is that the bandwidth allocated to a session is proportional to a positive weight _i . Because of the fixed weight assignment, the inherent in PFQ delay-bandwidth coupling imposes limitations on the range of QoS that can be supported. We develop PFQ with deterministic time-varying weight assignments, and we propose a low-overhead algorithm capable of supporting arbitrary piecewise linear service curves which achieve delay-bandwidth decoupling. Unlike existing service-curve based algorithms, our time-varying PFQ scheme does not exhibit the punishment phenomenon, and allows sessions to exploit the extra bandwidth in under-loaded networks.     

基于SSH+Ajax的校园文档资源共享平台设计

针对大学校园文档资源统一管理、交互共享等问题,提出采用SSH框架与Ajax技术,设计交互共享、开放式校园文档资源管理平台。完成平台文档模块接口与类以及平台数据库设计,支持多种格式文档的快速搜索、浏览、上传、下载。实验表明,使用SSH框架可提高文档共享平台的可靠性与复用性,使用Ajax技术提高了资源的共享效率。该平台可有效解决校园文档信息孤岛问题,为高校教学资源的开放共享提供了良好的管理手段。     

判定不是（k,n）门限方案的简易方法

文献［１～４］给出了通信密钥分散管理的几个方案。而经文献［５～７］分析研究，指出这几个方案并不是（ｋ，ｎ）门限方案。本文首先给出了判定不是（ｋ，ｎ）门限方案的简易方法，然后分析这几个方案不是（ｋ，ｎ）门限方案的原因，并对这几个方案给予修改，使得它们确实是（ｋ，ｎ）门限方案。最后对［８～１０］给予讨论，指出它们存在的问题。此外还指出了其中一些方案其实是多密钥的（ｋ，ｎ）ＴＣＳＳＳ。     

Extended Virtual Boundary and Its Application in Dynamic Spectrum Allocation

This paper presents an efficient dynamic spectrum allocation （DSA） scheme in a flexible spectrum licensing environment where multiple networks coexist and interfere with each other. In particular, an extension of virtual boundary concept in DSA is proposed, which is spectrally efficient than the previous virtual boundary concept applied to donor systems only. Here, the same technique is applied to both donor and rental systems so as to further reduce the occurrences where the insertion of guard bands is obligatory and as a result provides better spectral efficiency. The proposed extension improves the spectrum utilization without any compromise on interference and fairness issues.