分数阶微积分在数字水印中的应用研究

提出并实现了基于分数阶微积分运算的数字水印系统模型.将分数阶微积分运算阶次v作为水印嵌入与提取的密钥,嵌入的水印能够获得好的不可感知性.在信息提取端,如果不知道确切的分数阶微积分运算阶次,将无法完成水印信息的提取,从而保证了发送者与合法接收者之间通信的有效保密性.利用Matklb进行计算机仿真实验证实了基于分数阶微积分运算的数字水印系统的有效性与可行性.     

实数二项式系数在HOL4中的形式化

定理证明是一种形式化方法,在高可靠性系统验证中起着越来越重要的作用。分数阶微积分是高可靠性系统分析的基础,实数二项式系数是分数阶微积分定义的重要组成部分。在高阶逻辑定理库中还没有实数二项式系数的形式化。提出实数二项式系数高阶逻辑形式化方法。首先研究阶乘幂在HOL4中的形式化,然后利用阶乘幂的高阶逻辑形式分析实数二项式系数,最后将实数二项式系数应用于分数阶微积分的形式化。分数阶微积分的形式化分析表明了实数二项式系数及其运算性质形式化的正确性和有效性。     

分数阶微积分在数字水印中的应用研究

提出并实现了基于分数阶微积分运算的数字水印系统模型。将分数阶微积分运算阶次v作为水印嵌入与提取的密钥,嵌入的水印能够获得好的不可感知性。在信息提取端,如果不知道确切的分数阶微积分运算阶次,将无法完成水印信息的提取,从而保证了发送者与合法接收者之间通信的有效保密性。利用Matlab进行计算机仿真实验证实了基于分数阶微积分运算的数字水印系统的有效性与可行性。     

分数阶微积分在滑模控制中的应用研究

针对滑模控制所存在的抖振问题以及趋近问题,将分数阶微积分理论与滑模控制策略的优点相互结合,提出一种有效的分数阶趋近律.在控制器的设计过程中,将分数阶微积分引入到滑模控制中提出分数阶趋近律,并运用Lyapunov理论进行证明,从而确保系统的稳定性.将提出的控制方法应用于二关节机械臂上,进行仿真验证.结果表明:所提出的分数...     

分数阶微积分在图像处理中的研究综述*

综述了关于分数阶微积分理论在数字图像底层处理中的应用研究,具体包括:分数阶微积分和分数阶偏微分方程的基本理论及分数阶傅里叶变换的基本性质;分数阶微分滤波器的构造及在图像增强中的应用研究;分数阶积分滤波器的构造及在图像去噪中的应用研究;分数阶偏微分方程在图像去噪中的应用研究。最后,总结了分数阶微积分理论在图像处理中已取得的研究成果,并结合已有的基于分数阶微积分理论的图像底层处理模型,展望了分数阶微积分理论在图像处理中的应用前景。     

分数阶系统的分数阶PID 控制器设计

对于一些复杂的实际系统,用分数阶微积分方程建模要比整数阶模型更简洁准确.分数阶微积分也为描述动态过程提供了一个很好的工具.对于分数阶模型需要提出相应的分数阶控制器来提高控制效果.本文针对分数阶受控对象,提出了一种分数阶PID控制器的设计方法.并用具体实例演示了对于分数阶系统模型,采用分数阶控制器比采用古典的PID控制器取得更好的效果.     

一种基于分数阶微积分的分数阶伪随机数字水印新算法

本文研究和实现了一种基于分数阶微积分的分数阶伪随机数字水印算法.首先,提出并论述用正弦型信号的分数阶微分的采样差构造分数阶微分伪随机数字序列,该分数阶微分伪随机数字序列对分数阶微分阶次和正弦型信号相位的初始值敏感,当分数阶微分阶次和正弦型信号的初始相位未知时,无法恢复出该伪随机数字序列.其次,在此基础上,提出并论述一种基于分数阶微分的分数阶伪随机数字水印算法,其算法的保密性取决于分数阶微分阶次和正弦型信号的初始相位的不可知性.最后,仿真实验表明本分数阶微积分水印算法的不可感知性和顽健性好.     

Haar小波求解线性分数阶微积分方程

分数阶微积分方程的应用逐渐受到广大研究者的重视.论文以Haar小波基函数来逼近线性分数阶微积分方程,通过数值算例的数值解与精确解进行比较,结果表明论文方法是有效的且具有较高的精度.     

分数阶控制系统

随着基于分数阶次的数学理论日益完善,分数阶控制系统也越来越广泛地被研究和讨论。为了完善分数阶控制系统的理论体系,给出了分数阶系统的总体综述。介绍了分数微积分的定义,给出了分数阶线性定常系统的传递函数和状态空间描述,简要介绍了分数阶控制系统的复频域分析和分数阶控制器及控制器的设计方法,并分析了几种设计方法的优缺点。分数系统的研究必然能找到合适的切入点广泛地进入现代控制领域,为真正实现工业控制自动化提供强有力的理论依据。     

基于分数阶微积分的噪声检测和图像去噪

目的 提出一种利用分数阶微分梯度检测图像中的噪声点,并用于改进基于分数阶积分的图像去噪算法性能的算法。方法 该算法首先使用不同方向的分数阶微分梯度模板与含噪声图像进行卷积,计算出图像在不同方向上的分数阶微分梯度,依据预先设定的阈值获得不同方向的分数阶微分梯度检测图,将在所有选定方向上梯度都发生跳变的像素点判定为噪声点;然后只对被检测出的噪声点,在8个方向上进行分数阶积分运算完成去噪处理。结果 通过在人工图像中分别添加高斯噪声和椒盐噪声以及在自然图像中分别添加高斯噪声和椒盐噪声的去噪对比实验得出相同结论,即只对图像中检测出的噪声点使用分数阶积分运算进行去噪有更好的去噪性能,获得了更好的视觉效果和更高的峰值信噪比。结论 实验结果表明,基于分数阶微分梯度的噪声检测算法对解决图像去噪和保留图像纹理细节之间的矛盾有所帮助。随着对基于分数阶微分梯度噪声检测方法研究的深入,对图像中噪声检测的准确度会进一步提高,这将提供一种用于改进目前去噪算法性能的研究方向。     

Tractability through symmetries in propositional calculus

Many propositional calculus problems — for example the Ramsey or the pigeon-hole problems — can quite naturally be represented by a small set of first-order logical clauses which becomes a very large set of propositional clauses when we substitute the variables by the constants of the domainD. In many cases the set of clauses contains several symmetries, i.e. the set of clauses remains invariant under certain permutations of variable names. We show how we can shorten the proof of such problems. We first present an algorithm which detects the symmetries and then we explain how the symmetries are introduced and used in the following methods: SLRI, Davis and Putnam and semantic evaluation. Symmetries have been used to obtain results on many known problems, such as the pigeonhole, Schur's lemma, Ramsey's, the eight queen, etc. The most interesting one is that we have been able to prove for the first time the unsatisfiability of Ramsey's problem (17 vertices and three colors) which has been the subject of much research.     

基于类型理论的面向对象多步证明系统

介绍基于扩展构造型演算的交互式多步证明系统。该系统中以函数式语言ML为开发环境，建立了ECC的项、规则证明策略和证明管哩机制的描述，并引入规约类型、类类型、类和对象的表示，为面向对象的程序规约和定理证明系统的结合进行了一些探索。     

Generating relevant models

Manthey and Bry's model generation approach to theorem proving for FOPC has been greeted with considerable interest. Unfortunately the original presentation of the technique can become arbitrarily inefficient when applied to problems whose statements contain large amounts of irrelevant information. We show how to avoid these problems whilst retaining nearly all the advantages of the basic approach.     

Eliminating duplication with the hyper-linking strategy

The efficiency of almost all theorem proving methods suffers from a phenomenon called duplication of instances of clauses. In this paper, we present a novel technique, called the hyper-linking strategy, to eliminate such duplication. This strategy is complete for the full first-order predicate calculus. We show the effectiveness of this strategy by comparing it with other proving methods. We give empirical evidence that both the Davis-Putnam procedure and the hyper-linking strategy are comparable to each other and better than other common theorem proving strategies on propositional calculus problems. The fact that the Davis-Putnam procedure is faster than resolution and other common methods on propositional problems seems not to be appreciated by a large segment of the theorem proving community. Also, we give empirical evidence that the hyper-linking strategy is better than other common theorem proving methods on near-propositional problems like logic puzzles. We attempt to explain the superior behavior of the hyper-linking strategy and the Davis-Putnam procedure by examining the kinds of duplication that can occur during the search with the different methods. In addition, we show the completeness of the hyper-linking strategy combined with several support strategies.This research was partially supported by NSF under grant CCR-8802282.     

Existence results for fractional integrodifferential equations with nonlocal condition via resolvent operators

In this paper, we prove the existence of solutions of fractional integrodifferential equations by using the resolvent operators and fixed point theorem. An example is given to illustrate the abstract results.     

What is the inverse method?

A large part of the work on automated reasoning done in the Soviet Union in the sixties and seventies was based on the inverse method proposed by Sergey Maslov. We review the basic ideas of the method in the form that stresses its connection with resolution.     

Proof by analogy in mural

An important advantage of using a formal method of developing software is that one can prove that development steps are correct with respect to their specification. Conducting proofs by hand, however, can be time consuming to the extent that designers have to judge whether a proof of a particular obligation is worth conducting. Even if hand proofs are worth conducting, how do we know that they are correct? One approach to overcoming this problem is to use an automatic theorem proving system to develop and check our proofs. However, in order to enable present day theorem provers to check proofs, one has to conduct them in much more detail than hand proofs. Carrying out more detailed proofs is of course more time consuming. This paper describes the use of proof by analogy in an attempt to reduce the time spent on proofs. We develop and implement a proof follower based on analogy and present an example to illustrate its characteristics. The example shows that even when the follower fails to complete a proof, it can provide a hint that enables the user to complete a proof.     

Meeting the challenge of fifty years of logic

In this article, we tell a story of good fortune. The good fortune concerns the discovery of a systematic approach to compress 50 years of excellent research in logic into a single day's use of an automated reasoning program. The discovery resulted from a colleague's experiment with a new representation and a new use of the weighting strategy. The experiment focused on an attempt—which I knew would fail—to prove one of the benchmark theorems that had eluded us for years. Fortunately, I was wrong; my colleague's attempt was successful, and a proof was found. The proof led to proving in one day 13 theorems, theorems that resulted from 50 years of excellent research in logic. We present these theorems as intriguing problems to test the power of a reasoning program or to evaluate the effectiveness of a new idea. In addition to the challenge problems, we discuss a possible approach to finding short proofs and the results achieved with it.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

Software tools for first-order logic

A suite of software tools for the manipulation and validation of first-order logic expressions is presented. The suite ponsists of a collection of modules, each performing a precise and well-defined task. More sophisticated tasks such as theorem proving can be achieved by concatenating modules and interacting at suitable stages.     

Non-Horn clause logic programming without contrapositives

We present an extension of Prolog-style Horn clause logic programming to full first order logic. This extension has some advantages over other such extensions that have been proposed. We compare this method with the model elimination strategy which Stickel has recently implemented very efficiently, and with Loveland's extension of Prolog to near-Horn clauses. This new method is based on the author's simplified problem reduction format but permits a better control of the splitting rule than does the simplified problem reduction format. In contrast to model elimination, this new method does not require the use of contrapositives of clauses, permitting a better control of the search. This method has been implemented in C Prolog and has turned out to be a respectable and surprisingly compact first-order theorem prover. This implementation uses depth-first iterative deepening and caching of answers to avoid repeated solution of the same subgoal. We show that the time and space used by this method are polynomial functions of certain natural parameters of the search space, unlike other known methods. We discuss the relation of these upper bounds to Savitch's theorem relating nondeterministic time to deterministic space.This research was supported in part by the National Science Foundation under grant DCR-8516243.