互相关与阻尼比扰动混沌系统结合的检测方法

文章基于互相关检测方法和阻尼比扰动Duffing振子检测系统的检测原理,提出了互相关与阻尼比扰动Duffing振子检测系统相结合的一种新检测方法。文中利用新检测方法在白、色噪声背景下对方波信号进行检测,仿真结果表明新检测方法的信噪比明显优于单独采用互相关检测方法或阻尼比扰动的混沌检测方法的信噪比,分别为-43.4dB、-42.1dB和-40.5dB。     

Zernike矩结合Sigmoid曲线拟合边缘检测方法

为了改进Zernike矩边缘检测方法对非直线边缘检测精度低的弱点,提出了一种改进的基于Zernike矩方法和Sigmoid拟合法的边缘检测方法。用Zernike矩边缘检测方法检测边缘,然后用Sigmoid拟合方法检测边缘,根据边缘类型对两种方法检测的边缘结果进行加权求和,所得结果为边缘位置。分别利用理想图像和实际工业CT图像进行了实验验证,实验结果表明对非直线边缘的检测,该方法检测精度相对于Zernike矩方法提高了一个数量级。     

彩色图像SUSAN边缘检测方法

传统的彩色图像边缘检测方法主要是基于灰度图像的,先将彩色图像转化为灰度图像,然后用灰度图像边缘检测方法检测边缘。这些方法利用彩色图像的亮度信息进行边缘检测,没有考虑其色度信息。因此部分边缘不能被检测出来。提出了一种基于CIELAB空间的SUSAN彩色图像边缘检测方法。该方法首先将彩色图像从RGB空间转换到CIELAB空间,然后用基于色差的SUSAN算子检测边缘。实验结果表明：此方法能有效地检测出彩色图像的边缘。在保留图像边缘方面,性能优于基于灰度图像的边缘检测方法。     

硬件虚拟化rootkit检测方法研究综述

随着虚拟化技术的发展及其在云计算中的广泛应用, 传统的rootkit也开始利用硬件虚拟化技术来隐藏自己。为了对抗这一新型rootkit的攻击, 研究了传统rootkit检测方法在检测硬件虚拟化rootkit（HVMR）上的不足, 分析了现有的HVMR检测方法, 包括基于指令执行时间差异的检测方法、基于内存资源视图差异的检测方法、基于CPU异常和错误的检测方法, 以及基于指令计数的监测方法等。总结了这些检测方法的优缺点, 并在此基础上提出了两种通过扫描内存代码来检测HVMR恶意性的方法, 分别是基于hypervisor的恶意性检测方法和基于硬件的恶意性检测方法, 同时也预测了未来虚拟化检测技术的发展方向。     

基于对数似然比的湍流目标检测

在分析湍流目标检测方法的基础上,针对传统的湍流目标检测方法的检测概率不高,运用对数似然比准则,并假设湍流回波是一个窄带马尔科夫过程,提出了一种新的湍流检测方法。分别设置了不同样本量、虚警率和信噪比的情形,运用Monte Carlo方法仿真分析了提出的湍流检测方法性能,并与传统的脉冲对处理方法进行了比较。仿真结果表明,提出的湍流检测方法的检测概率分别在不同的样本量、虚警率和信噪比的性能指标下均大于传统的脉冲对检测方法的检测概率。     

AdaBoost算法在人脸检测中的应用

AdaBoost方法是目前较流行的一种图像检测方法,它是基于统计模型的检测方法。针对目前一些人脸检测方法误检率高、检测速度慢的问题,详细介绍AdaBoost算法的基本原理,并应用OpenCV程序的开发,实现检测速度快、检测率和鲁棒性高的人脸检测。     

基于RGB-W的电力通信网危险源检测

本文提出了一种基于RGB-W的电力通信网危险源检测方法,该方法将短距离无线定位信息做映射处理,得到一张与图像对应的置信值掩膜。该掩膜将通过旁路输入到不同的目标检测框架中(包括一阶检测框架和二阶检测框架),用以提高危险源检测结果的精确度,并减少误检和漏检。对于这两类检测方法,我们使用基于无线电定位的置信值修正来提高检测性能。针对电力通信网的危险源检测任务,本文搜集了特定场景下的数据集用以训练检测与测试检测方法。本文提出的危险源检测方法使用了平均精度指标、平均误检数以及正确检测占比作为指标进行评估。实验结果证明本文提出的危险源检测方法具有检测精度高的优点,并能够减少错误检测框的数量。     

结合LOG算子和小波变换的图像边缘检测方法

针对目前常用的边缘检测方法对噪声比较敏感,测得的边缘比较粗糙等现象,在传统边缘检测方法的基础上提出了一种基于数据融合的边缘检测方法。该方法分别采用改进的LOG算子和离散小波变换对原始图像进行边缘检测,建立相应的融合原则,并将两种方法检测出来的边缘进行数据融合,得到最终的图像边缘。实验证明,该方法结合了两种检测方法的优点,有效地提高了边缘检测准确性,获得了比较理想的边缘检测效果。     

基于局部熵的CMOS摄像头疵点检测

在CMOS摄像头数字图像性能检测系统中,疵点检测是关键内容。基于局部熵,提出了基于局部熵的CMOS摄像头疵点检测方法。与原有的摄像头疵点检测方法进行比较,局部熵方法是一种自适应的疵点检测方法。实验结果表明,该方法能够准确、有效地检测到摄像头的疵点。     

两种典型的入侵检测方法研究

论述了入侵检测的基本概念、模型框架和对现有入侵检测技术、方法进行了分类。重点论述了两种典型的入侵检测方法—异常行为检测方法和比较学习检测方法的基本原理,并在此基础上实现了一个实际的入侵检测专家系统。     

K(Knowledge)-net: building up and its dynamics

The essence of intelligence is to use certain abilities to obtain knowledge, to use that knowledge, and to operate with that knowledge. New knowledge learned by a human is often related to old existing knowledge, and sometimes we could have more conceptual knowledge based on old knowledge. So, the knowledge in the brain exists in a related structural form, and this structure is dynamic, and therefore is evolvable. Based on the understanding of the real process of learning by a human being, we discuss how to make a model to describe the dynamic structure of knowledge. This model is also a principle of artificial brain design. Most of the knowledge a child learns is from natural language and perception information, and we define this as semantic knowledge. The model to describe the process and structure of knowledge growing in a network form is called a K-net. It is a dynamic network with two main dynamics: one is new knowledge added, and the other is aggregating knowledge existing in the network with some probability. Under these very natural conditions, we found that the network is originally a simple random net, and then some characteristics of a complex network gradually appear when more new knowledge is added and aggregated. A more interesting phenomenon is the appearance of a random hierarchical structure. Does this mean emergence?     

Dual-side see-through integral imaging 3D display system based on lens array holographic optical element

We propose a dual-side see-through integral imaging 3D display based on a lens array holographic optical element (LAHOE). The display system consists of two projectors and a LAHOE. The LAHOE is fabricated according to the theory of reflective volume holograms. An interference pattern is formed by a plane-wave beam and a spherical-wave array beam, and the interference pattern is recorded into a photopolymer material. Thus, the LAHOE is formed. When a reference beam is projected into the LAHOE, the wavefront of a convex micro-lens array is reconstructed. When a phase conjugation reference beam is projected into the LAHOE, the wavefront of a concave micro-lens array is reconstructed. So, the LAHOE possesses the optical properties of a convex micro-lens array and a concave micro-lens array. The proposed display is developed using integral imaging principle and it realizes dual-side see-through integral imaging 3D display.     

Minimal states and maximum free energies of materials with memory

Definitions are given of the maximum and minimum free energy associated with a given state of a material with memory. Also, the concept of a minimal state is introduced. These concepts are then explored in detail for a specific isothermal model, where the stress is given by a non-linear elastic part and a memory part which is a linear functional of the strain tensor history. It is shown that the equivalence class constituting a minimal state is a singleton except where only isolated singularities occur in the Fourier transform of the relaxation tensor derivative. If the minimal state is not a singleton, then the maximum free energy is less than the work function and is a function of the minimal state. An explicit expression is given for the maximum free energy.     

A type system for logic programs

A theory for a type system for logic programs is developed which addressesthe question of well-typing, type inference, and compile-time and run-time type checking. A type is a recursively enumerable set of ground atoms, which is tuple-distributive. The association of a type to a program is intended to mean that only ground atoms that are elements of the type may be derived from the program. A declarative definition of well-typed programs is formulated, based on an intuitive approach related to the fixpoint semantics of logic programs. Whether a program is well typed is undecidable in general. We define a restricted class of types, called regular types, for which type checking is decidable. Regular unary logic programs are proposed as a specification language for regular types. An algorithm for type-checking a logic program with respect to a regular type definition is described, and its complexity is analyzed. Finally, the practicality of the type system is discussed, and some examples are shown. The type system has been implemented in FCP for FCP and is incorporated in the Logix system.     

混合关系中的函数依赖及其相关规则

在实际应用中有这样一类关系数据库,其中数据项在某个属性上的取值本身又是一个关系。讨论这种混合关系中的函数依赖及其相应的相关规则具有一定的理论意义和实际应用价值。给出这种混合关系的形式定义、混合关系中4种类型的函数依赖关系以及相应的4种类型的相关规则;并给出混合关系到一般关系的转换,通过这个转换说明了混合关系与普通关系的联系及其差别。给出一个实际应用中的例子,来说明混合关系中的函数依赖和相关规则的形式多样性。     

Bayesian recognition of local 3-d shape by approximating image intensity functions with quadric polynomials

The recognition in image data of viewed patches of spheres, cylinders, and planes in the 3-D world is discussed as a first step to complex object recognition or complex object location and orientation estimation. Accordingly, an image is partitioned into small square windows, each of which is a view of a piece of a sphere, or of a cylinder, or of a plane. Windows are processed in parallel for recognition of content. New concepts and techniques include approximations of the image within a window by 2-D quadric polynomials where each approximation is constrained by one of the hypotheses that the 3-D surface shape seen is either planar, cylindrical, or spherical; a recognizer based upon these approximations to determine whether the object patch viewed is a piece of a sphere, or a piece of a cylinder, or a piece of a plane; lowpass filtering of the image by the approximation. The shape recognition is computationally simple, and for large windows is approximately Bayesian minimum-probability-of-error recognition. These classifications are useful for many purposes. One such purpose is to enable a following processor to use an appropriate estimator to estimate shape, and orientation and location parameters for the 3-D surface seen within a window.     

基于通用比较模型的t-可诊断系统的特征化及并行诊断算法

文中介绍了一种系统级故障诊断模型－－通用比较模型,该模型处理器作为自身的比较器,综合经典的ＰＭＣ模型和Ｍａｅｎｇ／Ｍａｌｅｋ模型的优点,基于该报多处理器系统的ｔ＿可诊断性问题,给出了ｔ＿可诊断系统的特征化,证明了一个系统成为ｔ－可诊断系统的新的充分必要条件,其次,证明在通用比较模型中,确定故障顺集的问题等价于求解一个超图的最小横切集（Ｍｉｎｉｍｕｍ ｔｒａｖｅｒｓａｌ）,该超图是根据多处理器的通信     

Sensor Planning for 3D Object Search

In this paper, we provide a systematic study of the task of sensor planning for object search. The search agent's knowledge of object location is encoded as a discrete probability density which is updated whenever a sensing action occurs. Each sensing action of the agent is defined by a viewpoint, a viewing direction, a field-of-view, and the application of a recognition algorithm. The formulation casts sensor planning as an optimization problem: the goal is to maximize the probability of detecting the target with minimum cost. This problem is proved to be NP-Complete, thus a heuristic strategy is favored. To port the theoretical framework to a real working system, we propose a sensor planning strategy for a robot equipped with a camera that can pan, tilt, and zoom. In order to efficiently determine the sensing actions over time, the huge space of possible actions with fixed camera position is decomposed into a finite set of actions that must be considered. The next action is then selected from among these by comparing the likelihood of detection and the cost of each action. When detection is unlikely at the current position, the robot is moved to another position for which the probability of target detection is the highest.     

Distributed speculative execution for reliability and fault tolerance: an operational semantics

This paper examines the use of speculations, a form of distributed transactions, for improving the reliability and fault tolerance of distributed systems. A speculation is defined as a computation that is based on an assumption that is not validated before the computation is started. If the assumption is later found to be false, the computation is aborted and the state of the program is rolled back; if the assumption is found to be true, the results of the computation are committed. The primary difference between a speculation and a transaction is that a speculation is not isolated—for example, a speculative computation may send and receive messages, and it may modify shared objects. As a result, processes that share those objects may be absorbed into a speculation. We present a syntax, and an operational semantics in two forms. The first one is a speculative model, which takes full advantage of the speculative features. The second one is a nonspeculative, nondeterministic model, where aborts are treated as failures. We prove the equivalence of the two models, demonstrating that speculative execution is equivalent to failure-free computation.     

An Order-Based Theory of Updates for Closed Database Views

The fundamental problem in the design of update strategies for views of database schemata is that of selecting how the view update is to be reflected back to the base schema. This work presents a solution to this problem, based upon the dual philosophies of closed update strategies and order-based database mappings. A closed update strategy is one in which the entire set of updates exhibit natural closure properties, including transitivity and reversibility. The order-based paradigm is a natural one; most database formalisms endow the database states with a natural order structure, under which update by insertion is an increasing operation, and update by deletion is decreasing. Upon augmenting the original constant-complement strategy of Bancilhon and Spyratos – which is an early version of a closed update strategy – with compatible order-based notions, the reflection to the base schema of any update to the view schema which is an insertion, a deletion, or a modification which is realizable as a sequence of insertions and deletions is shown to be unique and independent of the choice of complement. In addition to this uniqueness characterization, the paper also develops a theory which identifies conditions under which a natural, maximal, update strategy exists for a view. This theory is then applied to a ubiquitous example – single-relational schemata constrained by equality-generating dependencies. Within this framework it is shown that for a view defined as a projection of the main relation, the only possibility is that the complement defining the update process is also a projection, and that the reconstruction is based upon functional dependencies.