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.     

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

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

用傅里叶变换计算单缝衍射的光强分布

现代光学和通讯理论由于引入了傅里叶变换的方法，使计算光学系统和通讯系统的物像的对应关系简洁、清晰。该文用傅氏变换计算长为２ａ、照度为Ａ的均匀缝光源在观察面上的光强分布为Ｉ（ｘ）＝│Ｅ（ｘ）│＾２＝ＡＡ＾２ａ＾２（ｓｉｎ２πｆａ／２πｆａ）此方法也可运用于矩形孔、圆孔等。     

Comparisons of Urban Travel Forecasts Prepared with the Sequential Procedure and a Combined Model

Detailed analyses and comparisons of urban travel forecasts prepared by applying the state-of-practice sequential procedure and the solution of a combined network equilibrium model are presented. The sequential procedure for solving the trip distribution, mode choice and assignment problems with feedback is the current practice in most transportation planning agencies, although its important limitations are well known. The solution of a combined model, in contrast, results from a single mathematical formulation, which ensures a well-converged and consistent result. Using a real network, several methods for solving the sequential procedure with feedback are compared to the solution of the combined model ESTRAUS. The results of these methods are shown to have various levels of instability. The paper concludes with a call for a new paradigm of travel forecasting practice based on an internally consistent model formulation that can be solved to a level of precision suitable for comparing alternative scenarios.