On the rotating Navier-Stokes equations with mixed boundary conditions

The stationary and nonstationary rotating Navier-Stokes equations with mixed boundary conditions are investigated in this paper. The existence and uniqueness of the solutions are obtained by the Galerkin approximation method. Next, θ-scheme of operator splitting algorithm is applied to rotating Navier-Stokes equations and two subproblems are derived. Finally, the computational algorithms for these subproblems are provided.     

多产品单层能力受限批量问题的前向启发式算法的可行性过程

本文讨论多产品、单层、能力受限批量问题的前向启发式算法，指出了这类算法中现有算法的一些不足之处。为了克服这些不足，我们给出了可行解存在的充分必要条件，并在此基础上提出一个可行化算法。     

An efficient algorithm for accelerating the convergence of oscillatory series,useful for computing the polylogarithm and Hurwitz zeta functions

This paper sketches a technique for improving the rate of convergence of a general oscillatory sequence, and then applies this series acceleration algorithm to the polylogarithm and the Hurwitz zeta function. As such, it may be taken as an extension of the techniques given by Borwein’s “An efficient algorithm for computing the Riemann zeta function” by Borwein for computing the Riemann zeta function, to more general series. The algorithm provides a rapid means of evaluating Li _s (z) for general values of complex s and a kidney-shaped region of complex z values given by ∣z ²/(z–1)∣<4. By using the duplication formula and the inversion formula, the range of convergence for the polylogarithm may be extended to the entire complex z-plane, and so the algorithms described here allow for the evaluation of the polylogarithm for all complex s and z values. Alternatively, the Hurwitz zeta can be very rapidly evaluated by means of an Euler–Maclaurin series. The polylogarithm and the Hurwitz zeta are related, in that two evaluations of the one can be used to obtain a value of the other; thus, either algorithm can be used to evaluate either function. The Euler–Maclaurin series is a clear performance winner for the Hurwitz zeta, while the Borwein algorithm is superior for evaluating the polylogarithm in the kidney-shaped region. Both algorithms are superior to the simple Taylor’s series or direct summation. The primary, concrete result of this paper is an algorithm allows the exploration of the Hurwitz zeta in the critical strip, where fast algorithms are otherwise unavailable. A discussion of the monodromy group of the polylogarithm is included.      

A new characterization of HH-free graphs

We show that a graph G has no houses and no holes if and only if for every connected induced subgraph H of G and every vertex in H, either the vertex is adjacent to all the other vertices in H, or it forms a 2-pair of H with some other vertex in H. As a consequence, there is a simple linear time algorithm to find a 2-pair in HH-free graphs. We also note that the class of Meyniel graphs admits an analogous characterization.     

On the noniterative multiproduct multiperiod production planning method

Bahl and Zionts [H.C. Bahl, S. Zionts, A noniterative multiproduct multiperiod production planning method, Operations Research Letters 1 (1982) 219-221] formulated a problem for planning multiproduct multiperiod production on a single facility. They developed a column-minima noniterative method and claimed that it gave an optimal solution. We show that the claim is incorrect.     

A taylor weak-statement algorithm for hyperbolic conservation laws

Finite element analysis, applied to computational fluid dynamics (CFD) problem classes, presents a formal procedure for establishing the ingredients of a discrete approximation numerical solution algorithm. A classical Galerkin weak-statement formulation, formed on a Taylor series extension of the conservation law system, is developed herein that embeds a set of parameters eligible for constraint according to specification of suitable norms. The derived family of Taylor weak statements is shown to contain, as special cases, over one dozen independently derived CFD algorithms published over the past several decades for the high speed flow problem class. A theoretical analysis is completed that facilitates direct qualitative comparisons. Numerical results for definitive linear and non-linear test problems permit direct quantitative performance comparisons.     

Elucidation of triacylglycerols in cod liver oil by liquid chromatography electrospray tandem ion-trap mass spectrometry

Though liquid chromatography electrospray tandem mass spectrometry (LC-ESI-MS²) has been widely used in the structural elucidation of triacylglycerols (TAG) in vegetable oils, its potentiality for the identification of TAG molecules in omega-3 rich oils remains unexplored till date. Hence, this article investigates the applicability of LC-ESI-MS² for the structural characterization of naturally occurring TAG in cod liver oil without the TAG fractionation during the sample preparation. A computational algorithm was developed to automatically interpret the mass spectra and elucidate the TAG structures respectively. The results were compared against the lipase benchmark method. A principal component analysis study revealed that it is possible to discriminate genuine from adulterated cod liver oil.     

SSCA算法中FFT模块的设计与实现

该文介绍了高效循环谱估计算法SSCA（Strip Spectral Correlation Algorithm）中FFT模块的重要作用,给出了一种FFT模块的设计和实现方案。该方案采用定常构形算法,可以很好地满足SSCA算法对FFT核心模块的并行化以及高速运算要求,同时数据处理采用流水线工作方式,大大提高了FFT模块的连续处理数据能力。仿真测试表明,该方案能够满足SSCA算法对FFT模块的运算要求。     

二进制堆排序算法的改进研究

基于对网络服务质量中队列调度算法的介绍和分析,从队列的优先级角度出发,对经典的二进制堆Heap调度排序算法进行了改进,提出了一种新的Heap＋算法,该算法充分利用原算法出队、入队操作数固定的特点,使其在保证硬件实现复杂度低的情况下能够做到出队、入队操作的流水化,从而达到高度的并行性。且具备很高的资源利用率和可扩展性,可用于高速链路上高精度虚拟时间的排序操作。     

基于FPGA的MD5算法设计与实现

MD5算法在网络安全的诸多方面都得到广泛的应用,在一些特殊场合要求计算具有高处理速度、低资源占用率的特点。文中首先介绍了MD5算法的发展历程和算法原理,然后描述了该算法在FPGA上实现的整体架构,分析了其各模块的功能,最后给出了基于Altera公司Stratix Ⅱ GX系列FPGA的实现结果。通过实验结果可以看出基于FPGA的MD5算法实现具有较高的处理速度和较少的资源占用,并可对设计进行适当修改来实现其它的摘要算法,具有一定的实用价值。