欧氏空间和球面子流形中Yang-Mills场的一类不稳定性结果

本文就欧氏空间和球面中紧致子流形的Yang-Mills场进行了讨论.得到了一类不稳定性结果.     

Duality Principles in Frame Theory

Duality principles in Gabor theory such as the Ron–Shen duality principle and the Wexler–Raz biorthogonality relations play a fundamental role for analyzing Gabor systems. In this article we present a general approach to derive duality principles in abstract frame theory. For each sequence in a separable Hilbert space we define a corresponding sequence dependent only on two orthonormal bases. Then we characterize exactly properties of the first sequence in terms of the associated one, which yields duality relations for the abstract frame setting. In the last part we apply our results to Gabor systems.     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Learning to See: Making Sense of the Mathematics of Change in Middle School

In this article, we will describe the results of a study of 6th grade students learning about the mathematics of change. The students in this study worked with software environments for the computer and the graphing calculator that included a simulation of a moving elevator, linked to a graph of its velocity vs. time. We will describe how the students and their teacher negotiated the mathematical meanings of these representations, in interaction with the software and other representational tools available in the classroom. The class developed ways of selectively attending to specific features of stacks of centimeter cubes, hand-drawn graphs, and graphs (labeled velocity vs. time) on the computer screen. In addition, the class became adept at imagining the motions that corresponded to various velocity vs. time graphs. In this article, we describe this development as a process of learning to see mathematical representations of motion. The main question this article addresses is: How do students learn to see mathematical representations in ways that are consistent with the discipline of mathematics? This revised version was published online in July 2006 with corrections to the Cover Date.     

Photoluminescence characteristics of ZnTiO3: Bi nanocrystals

The photoluminescence properties of the Bi³⁺ in sol-gel derived ZnTiO₃ nanocrystals have been investigated. An ultra-violet emission at 360 nm and a visible emission band at 506 nm have been observed, originating from two kinds of emission centers. The former is ascribed to the ³P₁-¹S₀ transition of Bi³⁺ and the latter to the recombination of the electrons with the photo-generated holes trapped in the zinc vacancies. In all cases the latter contribution is predominant.     

双光束相干控制产生多次谐波的实验验证

利用两束相干度可改变的飞秒脉冲光对产生的五次谐波的强度特性进行了研究，发现谐波信号的强度随相干程度的增大而增加，谐波信号的最大值相对于相干零点(双光束相干度最大处)是非对称的，从而证明了合成的激光脉冲波形变化对谐波信号的影响.同时对谐波的受激放大理论进行了初步的实验探索和展望. 关键词： 五次谐波 波形变化 相干 受激放大     

通过直线拟合的截距发现系统误差

通过对直线拟合中截距的分析发现系统误差.     

Synthesis and Raman analysis of 1D-ZnO nanostructure via vapor phase growth

1D-nanostructural zinc oxide (ZnO) with different shapes have been synthesized on p-type Si(1 0 0) and glass substrates via vapor phase growth by heating pure zinc powder at temperatures between 480 and 570 °C. The different ZnO nanostructures depend on the substrates and the growth temperatures. Scanning electron microscopy and X-ray diffraction revealed that a well-aligned nanowires array, which are vertical to the substrate of Si(1 0 0) with 18 sides on their heads, but six sides on their stems, has been formed at 480 °C. Raman study on the ZnO nanostructures shows that the coupling strength between electron and phonon determined by the ratio of the second- to the first-order Raman scattering cross-sections declines with decreasing diameter of the nanowires. However, a little changes of the coupling strength in terms of the width of the nanobelts have been observed.     

障碍平方期权的定价

本讨论了一种变异期权——收益结构为平方的障碍期权，在股票价格服从几何布朗运动的模型下，由带单侧吸收壁的布朗运动的密度和分布函数得到连续障碍平方期权的定价公式．