Generalized null space uncorrelated Fisher discriminant analysis for linear dimensionality reduction

We propose a generalized null space uncorrelated Fisher discriminant analysis (GNUFDA) technique integrating the uncorrelated discriminant analysis and weighted pairwise Fisher criterion. The GNUFDA can effectively deal with the small sample-size problem and perform satisfactorily when the dimensionality of the null space decreases with increase in the number of training samples per class and/or classes, C. The proposed GNUFDA can extract at most C-1 optimal uncorrelated discriminative vectors without being influenced by the null-space dimensionality.     

非线性地基上桩结构物空间分析

本文提出了桩结构物－非线性地基空间相互作用分析的迭代法和非线性有限元法。其中，桩基分析用ｐ－ｙ曲线法。结合实际结构物进行了大量的计算及比较分析，成果是令人满意的，可以付诸应用。     

石油钻机司钻工作空间设计

在对国产石油钻机司钻控制房调查的基础上，本着“以人为本”的设计理念，结合人机工程学理论，对司钻控制系统中的显示、操纵装置进行了分析，并给出了便于人操作的合理空间尺寸。     

Optimized Schwarz methods without overlap for highly heterogeneous media

In this paper an original variant of the Schwarz domain decomposition method is introduced for heterogeneous media. This method uses new optimized interface conditions specially designed to take into account the heterogeneity between the sub-domains on each sides of the interfaces. Numerical experiments illustrate the dependency of the proposed method with respect to several parameters, and confirm the robustness and efficiency of this method based on such optimized interface conditions. Several mesh partitions taking into account multiple cross points are considered in these experiments.     

Optimal search for signals in a multichannel system: Arbitrary initial distribution in state space merging scheme

Markovian and semi-Markovian random processes are used to analyze the problem of optimal search for signals in a multichannel communication system with arbitrarily distributed random outputs. The search efficiency factor is found in explicit form based on state space merging, and a mathematical programming problem is set up to find a numerical suboptimal solution. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 144–150, May–June 2007.     

Gelfand-Yaglom-Perez theorem for generalized relative entropy functionals

The measure-theoretic definition of Kullback-Leibler relative-entropy (or simply KL-entropy) plays a basic role in defining various classical information measures on general spaces. Entropy, mutual information and conditional forms of entropy can be expressed in terms of KL-entropy and hence properties of their measure-theoretic analogs will follow from those of measure-theoretic KL-entropy. These measure-theoretic definitions are key to extending the ergodic theorems of information theory to non-discrete cases. A fundamental theorem in this respect is the Gelfand-Yaglom-Perez (GYP) Theorem [M.S. Pinsker, Information and Information Stability of Random Variables and Process, 1960, Holden-Day, San Francisco, CA (English ed., 1964, translated and edited by Amiel Feinstein), Theorem. 2.4.2] which states that measure-theoretic relative-entropy equals the supremum of relative-entropies over all measurable partitions. This paper states and proves the GYP-theorem for Rényi relative-entropy of order greater than one. Consequently, the result can be easily extended to Tsallis relative-entropy.     

Testing the robustness of CIECAM02

CIE TC8‐01 has adopted a new color appearance model: CIECAM02¹ replaces the CIECAM97s.² The new model consists of a number of refinements and simplifications of the CIECAM97s color appearance model. This article describes further tests to the robustness of the forward and reverse modes. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 99–106, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20087     

浅析朱赛普·特拉尼的代表作法西斯大厦

介绍了法西斯大厦的基本情况，通过对朱赛普·特拉尼的代表作法西斯大厦的空间结构、承重结构、围护结构、立面结构的分析，以使人们更深刻地理解特拉尼的建筑思想，探索其积极的现实意义。     

An Efficient Code-Based Voxel-Traversing Algorithm

The paper considers an efficient approach to traversing a uniformly-subdivided space pierced by a line segment. A voxel, as the basic constituent element of the uniformly subdivided space, is restricted to having the form of a cube. The algorithm works in two steps. In the first step, the so-called Bresenham voxels are identified and, by comparing their position codes, their type of connectivity is determined. To achieve the required connectivity between neighbouring voxels, the second step of the algorithm is applied to find the missing voxels. In this way, the algorithm efficiently switches between face-, edge- and vertex-connectivity. Although the algorithm works with oating-point precision, it is extremely computationally efficient, and tests of speed compared with the Müller, Cleary & Wyvill, Amanatides & Woo, and Zemčik algorithms are described.     

浅述城市规划管理信息系统

阐述了城市规划管理信息系统的内容及其建立的方法和步骤，以及其与管理人员构成和该系统的经济效益，并指出城市规划管理信息系统利用计算机技术，科学地现代化地优化了城市规划设计与城市规划管理，为了城市建设的科学发展应加大投入，跟上时代步伐，进入城市建设的计算机时代。