Recent Results on Constructing Boolean Functions with (Potentially) Optimal Algebraic Immunity Based on Decompositions of Finite Fields

Boolean functions with optimal algebraic immunity (OAI functions) are important cryptographic primitives in the design of stream ciphers. During the past decade, a lot of work has been done on constructing such functions, among which mathematics, especially finite fields, play an important role. Notably, the approach based on decompositions of additive or multiplicative groups of finite fields turns out to be a very successful one in constructing OAI functions, where some original ideas are contributed by Tu and Deng (2012), Tang, et al. (2017), and Lou, et al. (2015). Motivated by their pioneering work, the authors and their collaborators have done a series of work, obtaining some more general constructions of OAI functions based on decompositions of finite fields. In this survey article, the authors review our work in this field in the past few years, illustrating the ideas for the step-by-step generalizations of previous constructions and recalling several new observations on a combinatorial conjecture on binary strings known as the Tu-Deng conjecture. In fact, the authors have obtained some variants or more general forms of Tu-Deng conjecture, and the optimal algebraic immunity of certain classes of functions we constructed is based on these conjectures.

     

On the nonexistence of nontrivial small cycles of the µ function in 3x+1 conjecture

This paper studies the property of the recursive sequences in the 3x+ 1 conjecture.The authors introduce the concept ofμfunction,with which the 3x + 1 conjecture can be transformed into two other conjectures:one is eventually periodic conjecture of theμfunction and the other is periodic point conjecture.The authors prove that the 3x + 1 conjecture is equivalent to the two conjectures above.In 2007,J.L.Simons proved the non-existence of nontrivial 2-cycle for the T function.In this paper,the authors prove that theμfunction has no l-periodic points for 2≤l≤12.In 2005, J.L.Simons and B.M.M de Weger proved that there is no nontrivial 2-cycle for the T function for l≤68,and in this paper,the authors prove that there is no nontrivial l-cycle for theμfunction for 2≤l≤102.     

A Survey of the Representations of Rational Ruled Surfaces

The rational ruled surface is a typical modeling surface in computer aided geometric design. A rational ruled surface may have different representations with respective advantages and disadvantages. In this paper, the authors revisit the representations of ruled surfaces including the parametric form, algebraic form, homogenous form and Plücker form. Moreover, the transformations between these representations are proposed such as parametrization for an algebraic form, implicitization for a parametric form, proper reparametrization of an improper one and standardized reparametrization for a general parametrization. Based on these transformation algorithms, one can give a complete interchange graph for the different representations of a rational ruled surface. For rational surfaces given in algebraic form or parametric form not in the standard form of ruled surfaces, the characterization methods are recalled to identify the ruled surfaces from them.

     

On functional decomposition of multivariate polynomials with differentiation and homogenization

This paper gives a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which were proposed by Ye,Dai,and Lam(1999) and were developed by Faugere,Perret(2006,2008,2009).The authors show that a degree proper functional decomposition for a set of randomly decomposable quartic homogenous polynomials can be computed using the algorithm with high probability.This solves a conjecture proposed by Ye,Dai,and Lam(1999).The authors also propose a conjecture which asserts that the decomposition for a set of polynomials can be computed from that of its homogenization and show that the conjecture is valid with high probability for quartic polynomials.Finally,the authors prove that the right decomposition factors for a set of polynomials can be computed from its right decomposition factor space.     

On nodal line of the second eigenfunction of the Laplacian over concave domains in ℝ2

In this note, the Payne’s conjecture from convex domains to concave domains is generalized. It is shown that the nodal line N of the second eigenfunction of the Laplacian over some simply connected concave domain Ω in ?² must intersect the boundary ?Ω at exactly two points.     

HAJóS'''' CONJECTURE AND CONNECTIVITY OF EULERIAN GRAPHS

Hajos' conjecture asserts that a simple eulerian graph on n vertices can be decomposed into at most n-1/2 circuits. In this paper, we propose a new conjecture which is equivalent to Hajos' conjecture, and show that to prove Hajos' conjecture, it is sufficient to prove this new conjecture for 3-connected graphs. Furthermore, a special 3-cut is considered also.     

A Systemic Exploration of the Risk Factors in Zimbabwean Information Technology Projects

This paper explores the risk factors threatening Zimbabwean Information Technology (IT) projects and build a systemic model demonstrating how the identified risk factors are interconnected. Drawn on systemic thinking, a soft systems approach called Interactive Management (IM) was adopted to identify the risk factors. The Interactive Management session involved the relevant stakeholders to interactively produce the systemic model through four major phases: idea generation, idea clarification, idea structuring, and interpretation of the structured ideas. The output of the Interactive Management process is a digraph showing the causal relationships between the identified risks. Six risk drivers were identified through the Interactive Management process: limited computer literacy, poor communication, lack of executive support, complexity of design, bureaucracy, and employee turnover. The constructed model demonstrates how the identified risk factors are interconnected. It also shows that non-linear relationships exist between risk factors. The output from this exploration has the potential to be used as a starting point to mitigate the risks impacting on Zimbabwean IT projects. Different from the output of frequently used approaches, the risk drivers identified in the systemic model inform decision makers to exploit the effective strategies in preventing other risks from materializing.

     

STRONG EMBEDDING OF HP-GRAPHS ON SURFACE WITH HIGHER GENUS

In 1990, Bondy posed the small circuit double cover （SCDC） conjecture： Every 2-connected graph has a circuit double cover （CDC） with the number of circuits less than ｜v｜ （the order of the vertex set V）. The strong embedding conjecture states that every 2-connected graph has a strong embedding on some surface in which the boundary of each face is a circuit. In this paper, HP-graph is defined as the graph which has a strong embedding on the projective plane with one face of valence ｜V｜ and the other faces of valence 3. And it is proved that the HP-graph has a strong embedding with ｜V｜ - 1 or less faces on some surface, which confirms both the SCDC conjecture and the strong embedding conjecture.     

知识发现领域的两大猜想

针对目前知识发现所面临的机遇和挑战,提出了知识发现"逆问题猜想"和知识发现"磁铁效应猜想"。这两个猜想构成相互关联的统一的有机体,本质上是围绕着要解决"海量"这一难题。讨论了猜想研究的基础,实现的可行性以及可能的研究内容。     

A note on two classes of Boolean functions with optimal algebraic immunity

Tu and Deng proposed a class of bent functions which are of optimal algebraic immunity under the assumption of a combinatorial conjecture.In this paper,the authors compute the dual of the Tu-Deng functions and then show that they are still of optimal algebraic immunity under the assumption of the same conjecture.For another class of Boolean functions constructed by Tang,et al.which are of optimal algebraic immunity with similar forms to Tu-Deng functions,the authors show that they are not bent functions by using some basic properties of binary complete Kloosterman sums.     

关于状态变权向量公理化定义的若干结果

逐条分析状态变权向量原始定义中各条件的作用及其内在联系,给出一种改进的状态变权向量定义并讨论与之相关的若干约束条件.研究并解决了刘文奇就状态变权向量公理化定义条件所提出的一个猜想.最后,分析文献中关于状态变权向量的两种改进定义之间的关系.在状态变权向量等效意义下,证明了其中一种改进定义蕴涵着另一种改进定义.     

ENDOMORPHISMS OF LIE ALGEBRA F[t]d／dt

Let F be a field of characteristic zero. W_n =is the Witt algebra over F, W_n~ =is Lie subalgebra of W_n. It is well known both W_n and W_n~ are simple infinite dimensional Lie algebra. In Zhao's paper, it was conjectured thatEnd(W_n~ ) - {0} = Aut(W_n~ ) and it was proved that the validity of this conjecture im-plies the validity of the well-known Jacobian conjecture. In this short note, we check theconjecture above for n = 1. We show End(W_1~ ) - {0} = Aut(W_1~ ).     

The Invertibility of Rational Univariate Representations

In this paper, the so-called invertibility is introduced for rational univariate representations, and a characterization of the invertibility is given. It is shown that the rational univariate representations, obtained by both Rouillier’s approach and Wu’s method, are invertible. Moreover, the ideal created by a given rational univariate representation is defined. Some results on invertible rational univariate representations and created ideals are established. Based on these results, a new appr...     

Safety Control of a Class of Fully Actuated Systems Subject to Uncertain Actuation Dynamics

Safety is an essential requirement for control systems. Typically, controlled mobile robots are subject to safety constraints, to which control laws in typical forms may not be directly applicable. This paper employs barrier function to describe safety constraints, analyzes the interaction between the barrier function and the uncertain actuation dynamics by employing the ideas of interconnected systems, and proposes a quadratic-programming-based integration of the control algorithms subject to the safety constraint for a class of fully actuated systems.

     

不完全信息条件下企业R&D 最优投资时机的期权博弈分析

运用实物期权与博弈论相结合的方法,研究在不确定的竞争环境和不完全信息条件下企业R&D投资的最优时机.通过假设企业不知道竞争对手的抢先投资临界值但知道其概率分布引入不完全信息.研究表明,不完全信息减缓了竞争对企业R&D投资等待期权价值的侵蚀,从而延缓了企业的R&D投资.企业R&D投资的最优时机取决于企业对竞争对手抢先投资危险率的推测,危险率越高,投资越早.     

A Tight Approximation Algorithm for Multi-Vehicle CVRP with Unsplittable Demands on a Line

In this paper, the authors study the multi-vehicle capacitated vehicle routing problem on a line-shaped network with unsplittable demand. The objective is to find a transportation scheme to minimize the longest distance traveled by a single vehicle such that all the customers are served without violating the capacity constraint. The authors show that this problem has no polynomial-time algorithm with performance ratio less than 2 on condition that P ≠ NP, and then provide a 2-approximation algorithm.

     

Curvature-Based r-Adaptive Isogeometric Analysis with Injectivity-Preserving Multi-Sided Domain Parameterization

Inspired by the r-refinement method in isogeometric analysis, in this paper, the authors propose a curvature-based r-adaptive isogeometric method for planar multi-sided computational domains parameterized by toric surface patches. The authors construct three absolute curvature metrics of isogeometric solution surface to characterize its gradient information, which is more straightforward and effective. The proposed method takes the internal weights as optimization variables and the resulting par...     

Event-Triggered Adaptive Fuzzy Finite Time Control of Fractional-Order Non-Strict Feedback Nonlinear Systems

In this article, the problem of event-triggered adaptive fuzzy finite time control of non-strict feedback fractional order nonlinear systems is investigated. By using the property of fuzzy basis function, the obstacle caused by algebraic loop problems is successfully circumvented. Moreover, a new adaptive event-triggered scheme is designed under the unified framework of backstepping control method, which can largely reduce the amount of communications. The stability of the closed-loop system is ensured through fractional Lyapunov stability analysis. Finally, the effectiveness of the proposed scheme is verified by simulation examples.

     

On Basis and Pure Nash Equilibrium of Finite Pure Harmonic Games

This paper investigates the basis and pure Nash equilibrium of finite pure harmonic games (FPHGs) based on the vector space structure. First, a new criterion is proposed for the construction of pure harmonic subspace, based on which, a more concise basis is constructed for the pure harmonic subspace. Second, based on the new basis of FPHGs and auxiliary harmonic vector, a more easily verifiable criterion is presented for the existence of pure Nash equilibrium in basis FPHGs. Third, by constructing a pure Nash equilibrium cubic matrix, the verification of pure Nash equilibrium in three-player FPHGs is given.

     

Performance of Preliminary Test Estimators for Error Variance Based on W,LR and LM Tests

The performances of preliminary test estimators for error variance based on W, LR and LM tests in a normal linear model are considered in this paper. Firstly, the risks of the proposed estimators are derived and compared by theoretical analysis and numerical calculation, respectively. The results show that their risks are related to the equality constraint error and the critical value of test. Moreover, the minimum value of the risks can be achieved when the critical value of test equals to one. Secondly, the superiority conditions of the proposed estimators are discussed. Finally, the results are illustrated by a simulation example.