Sinc-Galerkin method for solving linear sixth-order boundary-value problems

There are few techniques available to numerically solve sixth-order boundary-value problems with two-point boundary conditions. In this paper we show that the Sinc-Galerkin method is a very effective tool in numerically solving such problems. The method is then tested on examples with homogeneous and nonhomogeneous boundary conditions and a comparison with the modified decomposition method is made. It is shown that the Sinc-Galerkin method yields better results.

     

The Two-Body Interaction with a Circle in Time

We complete our previous^{(1, 2)} demonstration that there is a family of new solutions to the photon and Dirac equations using spatial and temporal circles and four-vector behaviour of the Dirac bispinor. We analyse one solution for a bound state, which is equivalent to the attractive two-body interaction between a charged point particle and a second, which remains at rest. We show this yields energy and angular momentum eigenvalues that are identical to those found by the usual method of solving of the Dirac equation,⁽⁴⁾ including fine structure. We complete our previous derivation⁽²⁾ of QED from a set of rules for the two-body interaction and generalise these. We show that QED may be decomposed into a two-body interaction at every point in spacetime.     

Potent New Heterogeneous Asymmetric Catalysts

A set of new, air‐stable, Rh^I‐based heterogeneous asymmetric hydrogenation catalysts have been synthesised, characterised, and tested. Individual members of this new family all exhibit good enantioselectivity.     

High-resolution infrared spectra of NCCN and NCCN

High-resolution spectra of ¹⁵N¹²C¹²C¹⁵N and ¹⁴N¹³C¹³C¹⁴N have been measured and analyzed from 200 to 3600 cm⁻¹. All the vibrational levels below 900 cm⁻¹ have been observed and characterized. The Fermi resonance between ν₂ and 2ν₄ has been studied and the resonance constant has been determined for several cases. Several Σ⁻ states have been directly observed for the first time for each isotopomer, the (0001111)0f, (0011111)0f, and (0002222)0f states. The pattern of the energy levels for clusters of l-type resonance coupled levels, such as 0001131,3, has been determined for cyanogen for the first time. Among other things this involved the determination of the vibrational l-type resonance constant, r₄₅. Many of the power series constants, α_i and x_ij, and higher order constants have been determined.     

Mechanism in homogeneous catalysis; NMR as a prime mover

An overview of the contribution of NMR to the development of our understanding of homogeneous catalysis is presented, with an emphasis on work from the author’s research group.     

闪存器与移动电子设备

闪存器技术于上世纪80年代中期面世,在不到20年的时间里,就出现了迅猛增长,其应用范围从个人电脑的引导代码存储一直到近期出现的PDA、数码相机和手机中的代码和数据存储。随着移动电子的持续增长,我们对在移动电子中获得成功应用的闪存器功能和优点进行一次回顾。闪存器的历史沿革“闪存(Flash)”这一名称,是源于该存储器件只需单步操作即能擦除其中所有内容的能力。军用装备很早就从这一能力中获益,军用装备都包含机密信息,一旦即将落入敌手,就应该迅速予以破坏。与EEPROM类似,Flash的数据存储也是通过向其晶体管栅区存入电荷来实现…     

Active-constraint variable ordering for faster feasibility of mixed integer linear programs

The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branching variable selection rely on estimating the effect of the candidate variables on the objective function. We present a new approach that relies on estimating the impact of the candidate variables on the active constraints in the current LP relaxation. We apply this method to the problem of finding the first feasible solution as quickly as possible. Empirical experiments demonstrate a significant improvement compared to a state-of-the art commercial MIP solver.     

Unique satisfiability of Horn sets can be solved in nearly linear time

If a Horn set I has a single satisfying truth assignment or model then that model is said to be unique for I. The question of determining whether a unique model exists for a given Horn set I is shown to be solved in O((L)*L) time, where L is the sum of the lengths of the clauses in I and is the inverse Ackermann function. It is also shown that if LA*log (A) where A is the number of distinct proposition letters then unique satisfiability can be determined in O(L) time.