水面船舶操纵,航海和机舱仿真器

酬本文对水面重用操纵、航海和机舱仿真器的特点、构成和数学模型作了介绍，同时对 其视景系统也作了一般性的描述。     

全球信息基础设施(GII)动态

文中简要介绍GII的产生背景,相关的标准化工作、GII的发展方向和目标,并对GII参考模型作了一般性介绍,作者从GII的发展对中国信息基础设施的建设提出一些见解。     

基于Web的数据库应用系统的技术探讨

本文介绍了开发Ｗｅｂ数据库系统时应着重注意的几个方面,特别是对目前流行的几种主要Ｗｅｂ数据库接口方式作了较深入的分析,并给出了一般性的选择建议;还对ＷｅｂＤＢ的安全性作了较详细的分析。     

用多线程枝术实现Winsock编程

本文在对Ｗｉｎｄｏｗｓ网络（ＷｉｎＳｏｃＫ）编程作一般性介绍的基础上,对在ＶｉｓｕａｌＣ＋＋６．０环境下的如何进行网络编程以及如何使用多线程进行网络编程作了介绍和示范,通过本文读者可以掌握简单的网络编程,并学会使用多线程来进行网络编程。     

CIPS 多机系统数据通信网的链路控制网

本文对一个多机系统中数据通信网的链路层作了一般性介绍。重点围绕局部计算机网的数据链路层所应完成的功能与任务进行了几个方面的讨论和介绍,它们包括:介质访问控制,差错控制,链路层协议等。在程序实现方面也给出了一些说明。     

呼叫中心接入的解决方案

本文中作者探讨了小型呼叫中心的基本构成,着重介绍了呼叫中心与电话、传真、人工坐席和Web服务器接入方法,并对系统安全性作了一般性讨论.     

呼叫中心接入的解决方案

本文中作者探讨了小型呼叫中心的基本构成着重介绍了呼叫中心与电话、传真、人工坐席和Web服务器接入方法并对系统安全性作了一般性讨论。     

呼叫中心接入的解决方案

呼叫中心技术是一门新兴的多学科交叉的技术,于９０年代迅速崛起并在国外得到了广泛地应用．对呼叫中心的开发作了一般性探讨,并着重介绍了呼叫中心同外围设备（包括电话、传真、人工座席和Ｗｅｂ服务器）的接入。     

P2P对等网络的关键技术及应用

首先对P2P对等网络做了一般性的介绍,然后重点讨论了影响P2P对等网络的关键技术、主要应用及应用实例,最后作了总结和展望.相信随着技术的不断进步及P2P网络的不断完善,P2P将会给我们带来更多的惊喜.     

建立在RMX86操作系统基础上的SCC级实时系统

本文首先对 Intel 公司的 iRMX86实时操实系统作了一般性介绍,然后介绍攀钢初轧厂均热炉分布式微机控制系统中 SCC 级的系统设计.该级是一个建立在 Intel 86/330十六位微机基础上的,在 RMX86操作系统支持下的多任务系统.文中对如何在实时操作系统的支持下设计实时应用系统进行了较详细的讨论.     

Problems and algorithms of text decomposition by clauses

The features of different types of decomposition that are employed in preliminary text processing are considered. Linguistic problems of decomposition by clauses via the transformation of communicative and modal planes of a text are discussed. The grammar and algorithms that are required to perform decomposition by clauses are described.     

基于Krogager分解和SVM的极化SAR图像分类

目标分解包括基于Sinclair矩阵的相干目标分解和基于Mueller矩阵的部分相干目标分解,Krogager分解即属于相干目标分解,它可以将任一对称Sinclair矩阵分解为球散射体、二面角散射体和螺旋体3个分量,这是极化合成孔径雷达(Synthetic Aperture Radar,SAR)图像特征提取的有效途径。把3个分量的分解系数作为极化散射特征,由其组成样本向量,运用基于统计学习理论的支持向量机(Support Vector Machines,SVM)设计多类分类器,提出了一种极化SAR图像分类算法,并对实测极化SAR数据进行分类实验。结果表明,将Krogager分解和SVM分类器结合起来,对极化SAR图像进行分类是可行和有效的,并且选择不同的参数得到的分类结果差别很大,验证了参数选择在SVM分类器中的重要作用。     

On Morse decompositions of control systems

In this article both notions of Morse decomposition and dynamic Morse decomposition of control systems are studied. The main objective is to present the basic conditions which assure that a Morse decomposition is a dynamic Morse decomposition, and vice-versa.     

混合像元分解的理论与方法-以神木县为例

识别分类是遥感技术应用中的重要一环,而混合像元是影响识别分类精度的主要因素之一。为了提高识别分类精度,本文提出了四种混合像元分解方法,它们是匹配像元分解、折半像元分解、双邻像元分解、相关像元分解。混合像元分解前,计算机分类识别精度仅为63.65％,混合像元分解后,其识别分类精度达88.67％,可见混合像元分解的效果是很显著的。     

Image-Space Decomposition Algorithms for Sort-First Parallel Volume Rendering of Unstructured Grids

Twelve adaptive image-space decomposition algorithms are presented for sort-first parallel direct volume rendering (DVR) of unstructured grids on distributed-memory architectures. The algorithms are presented under a novel taxonomy based on the dimension of the screen decomposition, the dimension of the workload arrays used in the decomposition, and the scheme used for workload-array creation and querying the workload of a region. For the 2D decomposition schemes using 2D workload arrays, a novel scheme is proposed to query the exact number of screen-space bounding boxes of the primitives in a screen region in constant time. A probe-based chains-on-chains partitioning algorithm is exploited for load balancing in optimal 1D decomposition and iterative 2D rectilinear decomposition (RD). A new probe-based optimal 2D jagged decomposition (OJD) is proposed which is much faster than the dynamic-programming based OJD scheme proposed in the literature. The summed-area table is successfully exploited to query the workload of a rectangular region in constant time in both OJD and RD schemes for the subdivision of general 2D workload arrays. Two orthogonal recursive bisection (ORB) variants are adapted to relax the straight-line division restriction in conventional ORB through using the medians-of-medians approach on regular mesh and quadtree superimposed on the screen. Two approaches based on the Hilbert space-filling curve and graph-partitioning are also proposed. An efficient primitive classification scheme is proposed for redistribution in 1D, and 2D rectilinear and jagged decompositions. The performance comparison of the decomposition algorithms is modeled by establishing appropriate quality measures for load-balancing, amount of primitive replication and parallel execution time. The experimental results on a Parsytec CC system using a set of benchmark volumetric datasets verify the validity of the proposed performance models. The performance evaluation of the decomposition algorithms is also carried out through the sort-first parallelization of an efficient DVR algorithm.     

Unsupervised classification using polarimetric interferometric decomposition and Wishart classifier

ABSTRACT

In this paper, a decomposition scheme of the coherency matrix is presented to parse the information of polarimetric interferometric synthetic aperture radar (PolInSAR) images in detail. First, the decomposition method is improved by the polarimetric interferometric similarity parameter (PISP) to relief the overestimation occurred in the traditional four-component decomposition method. Second, after using the improved four-component decomposition results as the original inputs, the decomposition method is applied to retrieve scattering mechanisms or identify scatters, with the image separated into seven subsections. Finally, based on the modified decomposition results, the basic classification results are regarded as the feature training sets, and the Wishart classifier is then used as an optimized classification process. The applications of the decomposition and classification scheme are shown with typical representative L-band E-SAR images, which are used to show the robustness of the method, as well as with the first published airborne C-band PolInSAR data collected by the Institute of Electronics, Chinese Academy of Sciences, in November 2017. Experimental results demonstrate that the obtained decomposition and classification results are in good agreement with the actual physical scattering mechanisms.     

Decompositions of finite games: From weighted inner product to standard inner product

To investigate the topological structure of finite games, various decomposions of finite games have been proposed. The inner product of vectors plays a key role in the decomposition of finite games. This paper considers the effect of different inner products on the orthogonal decomposition of finite games. We found that only when the compatible condition is satisfied, a common decomposition can be induced by the standard inner product and the weighted inner product simultaneously. To explain the result, we studied the existing decompositions, including potential based decomposition, zero‐sum based decomposition, and normalization based decomposition. For zero‐sum based decomposition and normalization based decomposition, we redefine their subspaces in a linear algebraic framework, which shows their physical meanings clearly. Bases of subspaces in these two decompositions are constructed.     

大型决策表分解方法研究

数据的海量性和复杂性是当前决策表数据分析中面临的难题,分解是处理大型决策表复杂特性、提高分析效率和质量的有效手段.讨论了大型决策表分析存在的问题和决策表分解的必要性,提出了评价分解方法的三条标准,重点对几种决策表分解方法进行了分析和比较,指出了其特点与不足,提出了进一步研究的方向.     

基于线性变换的计算与数据动态分解方法

在并行优化编译器的并行识别过程中,许多串行代码无法找到全局一致的分解结果,数据重分布无可避免,有必要寻找一种有效的方法求解计算和数据的动态分解。该文研究了单个嵌套循环计算与数据分解算法以及分解结果表示方法,提出一种在多个嵌套循环间求解数据线性一致分布的动态分解算法,结合程序的结构分析和程序的控制流信息,用于通用串行代码的并行分解过程,可以同时给出串行代码的计算划分和数据分布结果。     

管道泄漏模拟声发射的压缩感知及经验模态分解

管道泄漏监测中常用到声发射信号检测技术。压缩感知理论是一种高效的信号采集压缩处理方法,将其应用到模拟声发射信号的采样重构中,可以使信号采样不再受Nyquist采样定理的限制,降低了数据采集成本,通过重构算法实现对原始信号的精确重构。进而对重构声发射信号进行分解,通过对比信号的经验模态分解,集合经验模态分解和掩膜信号法分解结果,表明掩膜信号法能有效抑制分解过程中存在的模态混叠现象,使分解结果更加精确有效。为声发射信号的特征提取打下坚实基础。