Cyclic reduction and FACR methods for piecewise hermite bicubic orthogonal spline collocation

Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N ²log₂ N) andO(N ²log₂log₂ N) arithmetic operations, respectively.     

局部环上正交群中一类子群的扩群

定出了局部环上正交群中一类子群的扩群,得到了如下结果:设R是局部环,M是R的唯一极大理想,O(2m,R)为R上正交群.对R的任意理想S,G(2m,S)表示子群{A BC D∈O(2m,R)|B∈Sm×m}.如果char(R)≠2,m≥3,G(2m,0)≤X≤G(2m,M),那么存在R的理想S,使得X=G(2m,S).     

Perturbed recurrence relations II the general case

In this paper, we give some new explicit relations between two families of polynomials defined by recurrence relations of all order. These relations allow us to analyze, even in the Sobolev case, how some properties of a family of orthogonal polynomials are affected when the coefficients of the recurrence relation and the order are perturbed. In a paper we have already given a method which allows us to study the polynomials defined by a three-term recurrence relation. Also here some generalizations are given.     

Difference Families in Z2d+1⊕Z2d+1 and Infinite Translation Designs in Z⊕Z

We analyse 3-subset difference families of Z_2d+1⊕Z_2d+1 arising as reductions (mod 2d+1) of particular families of 3-subsets of Z⊕Z. The latter structures, namely perfect d-families, can be viewed as 2-dimensional analogues of difference triangle sets having the least scope. Indeed, every perfect d-family is a set of base blocks which, under the natural action of the translation group Z⊕Z, cover all edges {(x,y),(x′,y′)} such that |x−x′|, |y−y′|≤d. In particular, such a family realises a translation invariant (G,K₃)-design, where V(G)=Z⊕Z and the edges satisfy the above constraint. For that reason, we regard perfect families as part of the hereby defined translation designs, which comprise and slightly generalise many structures already existing in the literature. The geometric context allows some suggestive additional definitions. The main result of the paper is the construction of two infinite classes of d-families. Furthermore, we provide two sporadic examples and show that a d-family may exist only if d≡0,3,8,11 (mod 12).     

Vehicle density and velocity estimation on highways for on-ramp metering control

A scheme for vehicle density and velocity estimation in a stretch of highway based on a modified cell transmission model [C. F. Daganzo, Transportation Research, Part B, 28B(4),269–287, 1994. Elsevier is presented. The scheme is intended for use with on-ramp metering control algorithms, providing local knowledge of densities and velocities that is helpful to improve on-ramp metering control performance. Estimation of density is obtained by nonlinear estimators, while velocity estimation is obtained by gradient algorithms. There is one density–velocity estimator for free traffic flow and other for congested traffic flow. Both estimator schemes work in parallel. The final estimation of density and velocity results from a convex combination of the predictions of the two estimators. This combination depends on occupancy or density measurements at the boundaries of the stretch and is produced by a fuzzy inference system. Stability and convergence of the density and velocity estimation scheme is proved by Lyapunov based techniques. Simulation results comparing measured and estimated traffic data are presented. They confirm good performance of the estimators. Research sponsored by grants UNAM PAPIIT IN110403 and CONACYT 47583.     

Survivable network design under optimal and heuristic interdiction scenarios

We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular, we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first to construct a network and transmit an initial set of flows through the network. The enemy acts next to destroy a set of constructed arcs in the designer’s network, and the designer acts last to transmit a final set of flows in the network. Most studies of this nature assume that the enemy will act optimally; however, in real-world scenarios one cannot necessarily assume rationality on the part of the enemy. Hence, we prescribe optimal network design algorithms for three different profiles of enemy action: an enemy destroying arcs based on capacities, based on initial flows, or acting optimally to minimize our maximum profits obtained from transmitting flows.     

对比式离心现象实验装置

为了弥补现行教科书中,离心运动的演示实验装置及离心现象产生实质的知识呈现不足,设计了符合学生认知规律的离心实验装置.该装置通过对比2个物体在相同的角速度下产生相反的运动状态,说明物体做离心运动,不是由角速度产生,而是只有合外为突然消失或是合外力不足以提供向心力时,才能产生离心运动.     

Constructing orthogonal pandiagonal Latin squares and panmagic squares from modular n‐queens solutions

In this article, we show how to construct pairs of orthogonal pandiagonal Latin squares and panmagic squares from certain types of modular n‐queens solutions. We prove that when these modular n‐queens solutions are symmetric, the panmagic squares thus constructed will be associative, where for an n × n associative magic square A = (a_ij), for all i and j it holds that a_ij + an?i?1,n?j?1 = c for a fixed c. We further show how to construct orthogonal Latin squares whose modular difference diagonals are Latin from any modular n‐queens solution. As well, we analyze constructing orthogonal pandiagonal Latin squares from particular classes of non‐linear modular n‐queens solutions. These pandiagonal Latin squares are not row cyclic, giving a partial solution to a problem of Hedayat. © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 221–234, 2007     

On inequalities of Lieb-Thirring type

Applying the method proposed by Kashin for proving inequalities of Lieb-Thirring type for orthonormal systems, we prove a similar inequality in the multidimensional case.     

COMPLETENESS OF THE PARABOLIC SUBGROUPS OF PROJECTIVE ORTHOGONAL GROUPS

All parabolic subgroups and Borel subgroups of PΩ(2m 1, F) over a linear-able field F of characteristic 0 are shown to be complete groups, provided m > 3.