位移阶跃SH波对半圆形凹陷地形的散射

本文利用积分变换和波函数展开方法求解位移阶跃的平面ＳＨ波对半圆形凹陷地形的散射问题，导出了散射位移场的解析表达式，，并给出了在凹陷地形表面上各点位移时程反应的数值结果。本文的结果可做为Ｄｕｈａｍｅｌ积分的影响系数求解一个随时间任意变化的平面ＳＨ波被半圆形凹陷地形散射的问题。     

层状压电压磁弹性介质空间问题的数据分析与处理

从横观各向同性层状压电压磁弹性介质空间问题出发，利用状态变量法和0层面的边界条件，得到适用于计算不同状态变量的关系矩阵，以及状态变量表示的多层压电压磁弹性介质在Hankel变换空间中的解。在选择性计算的基础上，对不同的状态变量分别采用各自的方式修正关系矩阵，有效地避免了直接计算所产生的计算结果失真现象。为解决诸如此类的更复杂的问题奠定了理论基础。     

Application of multi-layered polyurethane foams for flat-walled anechoic linings

Previous work demonstrated that a multi-objective evolutionary algorithm could be successfully employed as an optimiser to make the design of flat-walled multi-layered anechoic linings more efficient. In the present work, such an algorithm is employed to investigate the practical aspects of the application of multi-layered polyurethane foams as the flat-walled anechoic lining. The investigation includes aspects such as the efficacy of a single layer of material, the minimum number of layers of linings to achieve the minimum overall thickness for low (100 Hz), mid (250 Hz) and high (500 Hz) cut-off frequencies, the use of the three-layered lining composite for low to mid cut-off frequencies and the effect of air gaps.     

Hopfield神经网络中的数学问题

Ｈｏｐｆｉｅｌｄ人工神经网络和多层网络模型中有许多基本的数学问题，其中，最重要的是存储容量的问题，即吸引子的个数，在以往的文章中，大多数都以概率模型为背景，本文从组合论的角度提供了几个问题，我们把Ｈｏｐｆｉｅｌｄ网络中的状态按连接矩阵所构成的变换分类，网络的容量就是类的个数，我们得出了一些基本结果，还有一些有意义的问题，如多层网络中的结果是否可交换等问题，还有待进一步研究。     

Characterizations and recognition of circular-arc graphs and subclasses: A survey

Circular graphs are intersection graphs of arcs on a circle. These graphs are reported to have been studied since 1964, and they have been receiving considerable attention since a series of papers by Tucker in the 1970s. Various subclasses of circular-arc graphs have also been studied. Among these are the proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and co-bipartite circular-arc graphs. Several characterizations and recognition algorithms have been formulated for circular-arc graphs and its subclasses. In particular, it should be mentioned that linear time algorithms are known for all these classes of graphs. In the present paper, we survey these characterizations and recognition algorithms, with emphasis on the linear time algorithms.     

Effect of the open roof on low frequency acoustic propagation in street canyons

This paper presents an experimental, numerical and analytical study of the open roof effect on acoustic propagation along a 3D urban canyon. The experimental study is led by means of a street scale model. The numerical results are performed with a 2D-Finite Difference in Time Domain approach adapted to take into account the acoustic radiation losses due to the street open roof. An analytical model, based on the modal decomposition of the pressure field in the street width mixed with a 2D image sources model including the reflection by the open roof, is also presented. Results are given for several frequencies in the low frequency domain. The comparison of these approaches shows a quite good agreement until f = 100 Hz at full scale. For higher frequency, experimental results show that the leakage, due to the street open roof, is not anymore uniformly distributed on all modes of the street. The notion of leaky modes must be introduced to model the acoustic propagation in a street canyon.     

The clique operator on circular-arc graphs

A circular-arc graphG is the intersection graph of a collection of arcs on the circle and such a collection is called a model of G. Say that the model is proper when no arc of the collection contains another one, it is Helly when the arcs satisfy the Helly Property, while the model is proper Helly when it is simultaneously proper and Helly. A graph admitting a Helly (resp. proper Helly) model is called a Helly (resp. proper Helly) circular-arc graph. The clique graphK(G) of a graph G is the intersection graph of its cliques. The iterated clique graphKⁱ(G) of G is defined by K⁰(G)=G and Kⁱ⁺¹(G)=K(Kⁱ(G)). In this paper, we consider two problems on clique graphs of circular-arc graphs. The first is to characterize clique graphs of Helly circular-arc graphs and proper Helly circular-arc graphs. The second is to characterize the graph to which a general circular-arc graph K-converges, if it is K-convergent. We propose complete solutions to both problems, extending the partial results known so far. The methods lead to linear time recognition algorithms, for both problems.     

Photoactive Thin-Film Structures of Curcumin,TiO2 and ZnO

Curcumin is known as a biologically active compound and a possible antimicrobial agent. Here, we combine it with TiO₂ and ZnO semiconductors, known for their photocatalytic properties, with an eye towards synergistic photo-harvesting and/or antimicrobial effects. We deposit different nanoscale multi-layer structures of curcumin, TiO₂ and ZnO, by combining the solution-based spin-coating (S-C) technique and the gas-phase atomic layer deposition (ALD) and molecular layer deposition (MLD) thin-film techniques. As one of the highlights, we demonstrate for these multi-layer structures a red-shift in the absorbance maximum and an expansion of the absorbance edge as far as the longest visible wavelength region, which activates them for the visible light harvesting. The novel fabrication approaches introduced here should be compatible with, e.g., textile substrates, opening up new horizons for novel applications such as new types of protective masks with thin conformal antimicrobial coatings.     

Obstructions for acyclic local tournament orientation completions

The orientation completion problem for a fixed class of oriented graphs asks whether a given partially oriented graph can be completed to an oriented graph in the class. Orientation completion problems have been studied recently for several classes of oriented graphs, including local tournaments. Local tournaments are intimately related to proper circular-arc graphs and proper interval graphs. In particular, proper interval graphs are precisely those which can be oriented as acyclic local tournaments. In this paper we determine all obstructions for acyclic local tournament orientation completions. These are in a sense minimal partially oriented graphs that cannot be completed to acyclic local tournaments. Our results imply that a polynomial time certifying algorithm exists for the acyclic local tournament orientation completion problem.     

集中弯矩作用下圆弧裂纹的弯曲问题

Ｓｃｈｗａｒｚ对称原理结合复应力函数的奇异性分析的方法，对于分析集中载荷问题有独特的优越性。本文利用这个方法研究了任意位置的集中弯矩作用下含共圆圆弧裂纹板的弯曲问题，获得了一般问题解答，给出一个实际重要情形的封闭形式解；最后求得弯曲应力强度因子公式。本文公式的特殊情形，与现有经典结果吻合。