排序方式: 共有35条查询结果,搜索用时 15 毫秒
1.
2.
随着担保贷款业务的快速发展,如何管理好担保品成为银行风险管理部门的重要问题,为此设计并实现了天津中行担保品管理信息系统,详细阐述了其系统目标、业务流程、功能模块结构以及基于JSP技术的设计和实现方法. 相似文献
3.
人工神经网络图像匹配技术 总被引:1,自引:0,他引:1
论述了人工神经图象匹配技术的基本原理,讨论了人工神经网络图象匹配技术的相关技术、方法,存在问题及研究方向. 相似文献
4.
6.
基于曲波与主分量分析的人脸识别 总被引:1,自引:1,他引:0
本文提出了基于曲波变换和主分量分析的人脸识别算法。针对小波变换仅能有效表达图像中的点奇异性的弱点,采用曲波变换提取面部主要特征。由于人脸的主要特征是面部的曲线信息,而曲波变换直接以曲线为表达基元,其变换系数能有效表示沿曲线的奇异性,而且是各向异性的,所以能更好地表达面部特征。进一步使用主分量分析将特征投影到更具表达力的空间中,从而达到更高的识别率。实验结果表明曲波的性能优于小波,尤其是曲波小尺度系数的识别率明显高于小波高频系数。 相似文献
7.
8.
An Improvement of Herbrand's Theorem and Its Application to Model Generation Theorem Proving 下载免费PDF全文
This paper presents an improvement of Herbrand's theorem. We propose a method for specifying a subuniverse of the Herbrand universe of a clause set S for each argument of predicate symbols and function symbols in S. We prove that a clause set S is unsatisfiable if and only if there is a finite unsatisfiable set of ground instances of clauses of S that are derived by only instantiating each variable, which appears as an argument of predicate symbols or function symbols, in S over its corresponding argument's sub-universe of the Herbrand universe of S. Because such sub-universes are usually smaller (sometimes considerably) than the Herbrand universe of S, the number of ground instances may decrease considerably in many cases. We present an algorithm for automatically deriving the sub-universes for arguments in a given clause set, and show the correctness of our improvement. Moreover, we introduce an application of our approach to model generation theorem proving for non-range-restricted problems, show the range-restriction transformation algorithm based on our improvement and provide examples on benchmark problems to demonstrate the power of our approach. 相似文献
9.
10.