A logarithmic complexity floating frame of reference formulation with interpolating splines for articulated multi-flexible-body dynamics

An interpolating spline-based approach is presented for modeling multi-flexible-body systems in the divide-and-conquer (DCA) scheme. This algorithm uses the floating frame of reference formulation and piecewise spline functions to construct and solve the non-linear equations of motion of the multi-flexible-body system undergoing large rotations and translations. The new approach is compared with the flexible DCA (FDCA) that uses the assumed modes method [1]. The FDCA, in many cases, must resort to sub-structuring to accurately model the deformation of the system. We demonstrate, through numerical examples, that the interpolating spline-based approach is comparable in accuracy and superior in efficiency to the FDCA. The present approach is appropriate for modeling flexible mechanisms with thin 1D bodies undergoing large rotations and translations, including those with irregular shapes. As such, the present approach extends the current capability of the DCA to model deformable systems. The algorithm retains the theoretical logarithmic complexity inherent in the DCA when implemented in parallel.     

The polynomial reconstruction problem: The first 50 years

The problem of reconstructing the characteristic polynomial of a graph of order at least 3 from the collection of characteristic polynomials of its vertex-deleted subgraphs was posed by Cvetkovi? in 1973 as a spectral counter part to the well-known Ulam's reconstruction conjecture. Over the last 50 years, this problem has received notable attention, many positive results have been obtained, but in the general case the problem is still unresolved. In particular, no counter example is found in literature. In this expository paper we survey classical and some more recent results concerning the polynomial reconstruction problem, discuss some related problems, variations and generalizations.     

Dimension polynomials of difference local algebras

We extend the concept of the difference dimension polynomial of a difference field extension to difference local algebras. The main theorem of the paper establishes the existence and form of the dimension polynomial associated with the localization of a finitely generated well-mixed difference algebra at a prime reflexive difference ideal.     

IMPORTANCE MEASURE OF CORRELATED VARIABLES IN POLYNOMIAL OUTPUT

为了解决一般工程问题中输出量为多项式情况下相关正态输入变量的贡献识别问题，以二次不含交叉项的多项输出量为例，利用多维相关正态分布及其条件分布的性质，解析地推导了相关正态输入变量对输出量总方差的独立贡献及相关贡献，采用算例验证了所推导的解析表达式的正确性．文中所推导的相关正态变量独立贡献和相关贡献的表达式可直接用于输出量为二次不含交叉项多项式或一次多项式情况下的输入变量贡献的识别，并且为其他新的算法提供了对照解，另外此方法亦可以推广至含交叉项的高阶多项式，解决更为复杂输出量情况下输入量的贡献识别问题．     

Dual Template Engaged Synthesis of Hollow Ball‐in‐Tube Asymmetrical Structured Ceria

Hollow materials with different configurations are of interest due to their unique structural features, which induce interesting properties e.g. catalysis. Here, the synthesis of asymmetrical hollow ball‐in‐tube (HBT) structured CeO₂ is reported, which is achieved using a dual template engaged solid–liquid interfacial reaction. In this reaction, the SiO₂ sphere (hard template)‐embedded Ce(OH)CO₃ nanorod (sacrificial template) composite is first treated with NaOH solution, followed by an acid wash to obtain asymmetrical hollow structured CeO₂. Such HBT structured CeO₂ is demonstrated to be a good support for Au nanoparticles toward CO oxidation as compared to simple hollow CeO₂ nanotubes, leading to significantly increase catalytic activity.     

Approximating exponential and logarithmic functions using polynomial interpolation

This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is analysed. The results of interpolating polynomials are compared with those of Taylor polynomials.     

Bombieri's Theorem in Short Intervals

Under the assumption of sixth power large sieve mean-value of Dirichlet L-function,we improve Bombieri's theorem in short intervals by virtue of the large sieve method and Heath-Brown's identity.     

On the Hamming distances of repeated-root constacyclic codes of length 4ps

Let $p$ be an odd prime, $s$, $m$ be positive integers, $\gamma ,\lambda$ be nonzero elements of the finite field ${\mathbb{F}}_{p^m}$ such that ${\gamma }^{p^s}=\lambda$. In this paper, we show that, for any positive integer $\eta$, the Hamming distances of all repeated-root $\lambda$-constacyclic codes of length $\eta p^s$ can be determined by those of certain simple-root $\gamma$-constacyclic codes of length $\eta$. Using this result, Hamming distances of all constacyclic codes of length $4p^s$ are obtained. As an application, we identify all MDS $\lambda$-constacyclic codes of length $4p^s$.     

Linearization of nonlinear filter generators and its application to cryptanalysis of stream ciphers

Nonlinear filter generators are commonly used as keystream generators in stream ciphers. A nonlinear filter generator utilizes a nonlinear filtering function to combine the outputs of a linear feedback shift register (LFSR) to improve the linear complexity of keystream sequences. However, the LFSR-based stream ciphers are still potentially vulnerable to algebraic attacks that recover the key from some keystream bits. Although the known algebraic attacks only require polynomial time complexity of computations, all have their own constraints. This paper uses the linearization of nonlinear filter generators to cryptanalyze LFSR-based stream ciphers. Such a method works for any nonlinear filter generators. Viewing a nonlinear filter generator as a Boolean network that evolves as an automaton through Boolean functions, we first give its linearization representation. Compared to the linearization representation in Limniotis et al. (2008), this representation requires lower spatial complexity of computations in most cases. Based on the representation, the key recoverability is analyzed via the observability of Boolean networks. An algorithm for key recovery is given as well. Compared to the exhaustive search to recover the key, using this linearization representation requires lower time complexity of computations, though it leads to exponential time complexity.