Numerical solution of two-sided space-fractional wave equation using finite difference method

In this paper, a class of finite difference method for solving two-sided space-fractional wave equation is considered. The stability and consistency of the method are discussed by means of Gerschgorin theorem and using the stability matrix analysis. Numerical solutions of some wave fractional partial differential equation models are presented. The results obtained are compared to exact solutions.     

Twisted Semigroup Crossed Products and Twisted Toeplitz Algebras of Ordered Groups

Let г^＋ be the positive cone of a totally ordered abelian group г, and σa cocycle in г. We study the twisted crossed products by actions of г＋ as endomorphisms of C^＊-algebras, and use this to generalize the theorem of Ji.     

基于道格拉斯格式的宽角有限差分光束传播法分析大角度交叉波导

交叉波导是集成光学中的一种重要的器件单元，针对大角度交叉波导的结构及折射率分布，运用基于广义道格拉斯算子的宽角多步有限差分光束传播法模拟大角度交叉波导的传输特性，数值计算出波导中的光场的分布。与Crank-Nicholson格式的有限差分光束传播法相比，该算法在几乎不增加计算时间和计算机内存资源的情况下，结合了广义道格拉斯格式的有限差分光束传播法截断误差小[只有o(△x)^4]和宽角多步法所具有较高精度的优点，是光波导器件理想的数值模拟工具。在此基础上计算分析了大角度交叉波导的输出分支波导的能量与交叉角度的关系，以及交叉角度对波导间能量耦合的影响。这为实际的设计制作光器件的工作提供了极好的基础。     

作用在n维欧氏空间R~n上的离散交叉积

主要研究作用在n维欧氏空间R~n上的离散交叉积■_n■_αG_A,b_1,…,b_n的代数性质与因子分类.首先证明了该交叉积是内射的;其次给出了该交叉积为因子的一些充要条件;最后讨论该交叉积为因子时究竟是几型因子.     

Non-Abelian Cohomology of Groups

Following Guin's approach to non-abelian cohomology [4] and, using the notion of a crossed bimodule, a second pointed set of cohomology is defined with coefficients in a crossed module, and Guin's six-term exact cohomology sequence is extended to a nine-term exact sequence of cohomology up to dimension 2     

On Blocks with Nilpotent Coefficient Extensions

For modular group algebras over an arbitrary field we define new type of blocks: blocks with nilpotent extensions, and describe their source algebras. To do it, a general pattern is proposed for relations between the source algebra of a block and the source algebra of a block appearing in its decomposition in a suitable extension of the field of coefficients.     

Associativity of crossed products by partial actions, enveloping actions and partial representations

Given a partial action of a group on an associative algebra , we consider the crossed product . Using the algebras of multipliers, we generalize a result of Exel (1997) on the associativity of obtained in the context of -algebras. In particular, we prove that is associative, provided that is semiprime. We also give a criterion for the existence of a global extension of a given partial action on an algebra, and use crossed products to study relations between partial actions of groups on algebras and partial representations. As an application we endow partial group algebras with a crossed product structure.

     

The real rank zero property of crossed product

Let be a unital -algebra, and let be a -dynamical system with abelian and discrete. In this paper, we introduce the continuous affine map from the trace state space of the crossed product to the -invariant trace state space of . If is of real rank zero and is connected, we have proved that is homeomorphic. Conversely, if is homeomorphic, we also get some properties and real rank zero characterization of . In particular, in that case, is of real rank zero if and only if each unitary element in with the form can be approximated by the unitary elements in with finite spectrum, where , , and if moreover is a unital inductive limit of the direct sums of non-elementary simple -algebras of real rank zero, then the above can be cancelled.

     

A branch-and-bound algorithm to minimize the line length of a two-sided assembly line

A new branch-and-bound algorithm is presented to solve the two-sided assembly line balancing problem of type 1 (TALB-1). First, a pair of two directly facing station is defined as a position, and then the two-sided assembly line (TAL) is relaxed to a one-sided assembly line (OAL). Some new lower bound on positions are computed, and dominance rules and reduction rules for the one-sided assembly line balancing problem of type 1 (OALB-1) are extended and incorporated into a station-oriented assignment procedure for the TALB-1 problem. Finally, the tests are carried out on a well-known benchmark set of problem instances, and experimental results demonstrate that the proposed procedure is efficient.