Best L1 Piecewise Monotonic Data Modelling

Let us consider n data measurements of a univariate process that have been altered by random errors. We assume that an underlying model function has a substantially smaller number of turning points than the observed ones. We propose algorithms that make least the sum of the moduli of the errors by requiring k monotonic sections, alternately increasing and decreasing, in the sequence of the smoothed values. The main difficulty in this calculation is that the optimal positions of the joins of the monotonic sections have to be found automatically among so many combinations that it is impossible to test each one separately. Moreover, the calculation seems to be very intractable to general optimization techniques because O(n^k) local minima can occur. It is shown that dynamic programming can be used for separating the data into optimal disjoint sections of adjacent data, where each section requires a single L₁ monotonic calculation. This procedure is highly efficient, requiring at most O(kn²) computer operations and O(n) best L₁ monotonic calculations to subranges of data for a global minimum.     

A feasibility study of a direct-mapping parallel processing method to solve linear equations in load-flow calculation

With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix.     

Material state remapping in computational solid mechanics

A computational procedure for remapping material state information from one finite element mesh to another is described. The procedure is useful in connection with evolving meshes for inelastic problems, as for example occur in the context of fracture simulation and adaptive mesh refinement. The proposed method is based on weak enforcement of equality between corresponding fields on the two meshes, where piecewise‐constant fields on both meshes are generalized from the quadrature‐point values. The essential algorithmic problem is that of calculating the volume partition of an arbitrary convex region with respect to a covering set of disjoint convex regions. Instead of geometrically resolving the associated intersections, the problem is herein approximated by a constrained optimization problem, which may be readily and efficiently solved computationally. This formulation is a main contribution of the paper. Computational examples are given that illustrate the effectiveness of the proposed procedure. Copyright © 2002 John Wiley & Sons, Ltd.     

合成直链烷基苯环境友好固体酸催化剂的研究 Ⅲ .催化剂失活原因分析

采用固定床反应器,对催化剂的稳定性进行了初步评价。在120℃、空速相同、液固反应条件下,高苯烯比时催化剂的稳定性明显高于低苯烯比时;在苯烯比和空速相同、液固反应条件下,相对低温反应时,催化剂的稳定性明显高于高温反应。IR分析结果表明,同新鲜和反应后未失活的催化剂相比,失活后催化剂的活性组分特征衍射峰消失,出现的新的特征衍射峰可能同—CH基的振动有关。TG分析结果表明,失活后催化剂在空气流中焙烧,失重幅度比新鲜催化剂大。     

线性分组码的神经网络译码

介绍了神经网络与线性分组码之间的关系，并在文献[1]的基础上证明了软判决译码与求解能量函数最大值之间的等价性，然后以(7，4，3)汉明码为例介绍了神经网络在循环码硬判决、软判决译码中的应用。     

Prediction of spectral reflectance factor distribution of automotive paint finishes

It is necessary to determine the accurate reflectance of painted surfaces for the review of paint finishes by computer graphics (CG) before actual painting of the exterior color of automobiles, and for quality control during production and inspection processes. We have optimized a method for measuring reflectance by using a statistical technique. We have found that the reflectance of a painted surface is best measured at an incident angle of 60° and at five aspecular angles of 10°, 18°, 28°, 40°, and 90°. Our method makes it possible to accurately reproduce reflection characteristics of paint finishes containing special flake pigments, such as pearl mica. Also it was proved that our method can apply not only to solid and metallic coatings but to all painted surfaces. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 275–282, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20125     

基于CCD的激光微位移测量系统研究

介绍了一种基于多普勒效应的可进行动态微位移测量的激光微位移测量系统。该系统以He-Ne激光器为光源,配以干涉系统移动方向判别及分频系统、CCD视频信号的高速动态采集系统、微机处理系统及干涉图处理软件包等。与传统测量方法相比,其精度、灵敏度及稳定性都有较大提高,并实现了微位移的全自动测量。     

Kripke Semantics for Modal Substructural Logics

We introduce Kripke semantics for modal substructural logics, and provethe completeness theorems with respect to the semantics. Thecompleteness theorems are proved using an extended Ishihara's method ofcanonical model construction (Ishihara, 2000). The framework presentedcan deal with a broad range of modal substructural logics, including afragment of modal intuitionistic linear logic, and modal versions ofCorsi's logics, Visser's logic, Méndez's logics and relevant logics.