Generating cryptographically strong Boolean functions using partial information

Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered...     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.     

Assessing the Error Probability of the Model Selection Test

The asymptotic error probability of Linhart's model selection test isevaluated, and compared with the nominal significance level. We examine thecase where the expected discrepancies of the candidate models from the truemodel are asymptotically equal. The local alternatives method is employed inthe limiting operation of the asymptotic evaluation. Although the errorprobability under the null hypothesis is actually shown to be equal to orless than the level for most situations, intolerable violations of the errorcontrol are observed for nested models: It is often erroneously concludedthat the smaller model is significantly better than the larger model. Toprevent this violation, a modification of Linhart's test statistic isproposed. The effectiveness of the proposed test is confirmed throughtheoretical analysis and numerical simulations.     

Multiple recurrence and infinite measure preserving odometers

A family of infinite measure preserving odometers is presented which exhibit examples ofp-recurrent but notp+1-recurrent ergodic transformations for everyp>1.     

Existence of periodic solutions,global attractivity and oscillation of impulsive delay population model

In this paper we consider the nonlinear impulsive delay population model. The main objective is to systematically study the qualitative behavior of the model including existence of periodic solutions, global attractivity and oscillation. The main oscillation results are the results of the prevalence of the mature cells about the periodic solutions and the global attractivity results are the conditions for nonexistence of dynamical diseases on the population.     

拟线性常微分方程在半无限区间的边值问题

Existence of positive solution is established for boundary value problems of non-singular for a class quasi-linear ordinary differential equation on the semi-infinite interval. The results are obtained by using the nonlinear alternative of Leray-Schauder method.     

The perturbation bounds for the solution of weighted kronecker product linear systems using thew-weighted drazin inverse

The classical perturbation theory is extended to the weighted Kronecker product linear systems W(A? B)Wx =h. Upper bounds are derived for the normwise condition number.     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).     

Stability criterion for synchronization of linearly coupled unified chaotic systems

This paper investigates the synchronization of two linearly coupled unified chaotic systems. A new stability criterion for asymptotic synchronization is attained using the Lyapunov stability theory and linear matrix inequality (LMI) approach. A numerical example is given to illuminate the design procedure and advantage of the result derived.     

三种群食物链交错扩散模型的整体

本文应用能量估计方法和Gagliardo-Nirenberg型不等式证明了一类强耦合反应扩散系统整体解的存在性和一致有界性，该系统是带自扩散和交错扩散项的三种群Lotka-Volterra食物链模型．通过构造Lyapunov函数给出了该模型正平衡点全局渐近稳定的充分条件．