无锡惠山泥人的造型特征研究

无锡惠山泥人历史悠久,造型优美传神,是我国民间工艺的精粹。论文通过对无锡惠山泥人的造型特征进行分析,总结出其造型、色彩、及构图上的规律,以此为实例分析推动传统工艺文化的保护和发展。     

从语用学的角度探析文化建筑的空间形式

随着创意产业以及艺术产业的蓬勃发展,新型文化建筑近年来在世界各地不断涌现,这些建筑以其独特的造型给人们留下深刻的印象。本文通过分析文化建筑的空间形式与建筑使用者之间的关系,从语用学的角度对文化建筑的空间形式进行分类并分析其特点。     

建筑空间的符号学意义

论文系统分析了符号学与建筑空间设计的关系。在此基础上依照建筑符号学的基本框架,结合实例探讨了中国传统建筑形式的规律、意义及其表达方式。探索中国建筑空间形式的符号学意义上的规律。     

试论数字化博物馆空间艺术形态设计构思

数字化博物馆设计基于现代电子技术的发展,作为一种视听艺术,在二维的界面载体上构建出多维的视听虚拟空间的几种空间艺术形态的探讨。数字化博物馆的空间艺术形态表现形式本身就具有鲜明的空间性。设计师对虚拟空间形态的运用,会给观众带来更多趣味性和艺术性。对于设计师而言,设计创作的关键是从二维到多维空间思考角度的转变,并赋予其全新的审美趣味交流。     

论两汉文化影响下的徐州公共艺术设计

本文通过分析两汉文化相关的徐州公共艺术建设现状,对两汉文化在徐州公共艺术创作中形式的运用进行深入的论证,立足本土,寻求与城市历史文化相适应的城市公共艺术形式。确立徐州公共艺术布局和主题风格的定位,指出当代徐州公共艺术设计要注重发掘和利用地域文化资源,设计高水平的公共艺术作品。     

A local construction of the Smith normal form of a matrix polynomial

We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant separately and then combines them into a global Smith form, whereas other algorithms apply a sequence of unimodular row and column operations to the original matrix. The performance of the algorithm in exact arithmetic is reported for several test cases.     

New exact solutions for the KdV equation with higher order nonlinearity by using the variational method

The Korteweg-de Vries (KdV) equation with higher order nonlinearity models the wave propagation in one-dimensional nonlinear lattice. A higher-order extension of the familiar KdV equation is produced for internal solitary waves in a density and current stratified shear flow with a free surface. The variational approximation method is applied to obtain the solutions for the well-known KdV equation. Explicit solutions are presented and compared with the exact solutions. Very good agreement is achieved, demonstrating the high efficiency of variational approximation method. The existence of a Lagrangian and the invariant variational principle for the higher order KdV equation are discussed. The simplest version of the variational approximation, based on trial functions with two free parameters is demonstrated. The jost functions by quadratic, cubic and fourth order polynomials are approximated. Also, we choose the trial jost functions in the form of exponential and sinh solutions. All solutions are exact and stable, and have applications in physics.     

On path bipancyclicity of hypercubes

Assume that P is any path in a bipartite graph G of length k with 2?k?h, G is said to be h-path bipancyclic if there exists a cycle C in G of every even length from 2k to |V(G)| such that P lies in C. Based on Lemma 5, the authors of [C.-H. Tsai, S.-Y. Jiang, Path bipancyclicity of hypercubes, Inform. Process. Lett. 101 (2007) 93-97] showed that the n-cube Qn with n?3 is (2n−4)-path bipancyclicity. In this paper, counterexamples to the lemma are given, therefore, their proof fails. And we show the following result: The n-cube Qn with n?3 is (2n−4)-path bipancyclicity but is not (2n−2)-path bipancyclicity, moreover, and a path P of length k with 2?k?2n−4 lies in a cycle of length 2k−2 if and only if P contains two edges of dimension i for some i, 1?i?n. We conjecture that if 2n−4 is replaced by 2n−3, then the above result also holds.     

Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb tori

Generalized honeycomb torus (GHT) is recognized as an attractive alternative to existing torus interconnection networks in parallel computing systems. Assume that m and d are integers with m ? 2 and d ? 8. This paper addresses the fault-tolerant hamiltonicity of GHT(m, 2d, d) with fault set F = {(w, y), (x, y)}, where w < x, w + y is even and x + y is odd. We show that such a faulty GHT is hamiltonian by presenting a systematic method for constructing a fault-free hamiltonian cycle. This result reveals another appealing feature of GHTs.     

一种联盟博弈频谱感知机制

为了在主用户具有异构性且认知用户处于多路径衰减、阴影效应等低感知性能的认知环境中,使认知用户公平有效地进行频谱感知,提出一种联盟博弈频谱感知机制,将频谱感知问题建模为效用不可转移的联盟博弈。首先,将认知用户划分成多个子联盟,根据头结点选取原则选出各个子联盟的头结点;其次,根据规则进行子联盟合并或分裂;最后,子联盟头结点利用“OR”规则进行数据融合,得到最终感知结果并广播给子联盟内的所有认知用户。仿真实现和性能评价结果表明,该机制具有好的性能。