Tensor rank one differential graph preserving analysis for facial expression recognition

This paper presents a new dimensionality reduction algorithm for multi-dimensional data based on the tensor rank-one decomposition and graph preserving criterion. Through finding proper rank-one tensors, the algorithm effectively enhances the pairwise inter-class margins and meanwhile preserves the intra-class local manifold structure. In the algorithm, a novel marginal neighboring graph is devised to describe the pairwise inter-class boundaries, and a differential formed objective function is adopted to ensure convergence. Furthermore, the algorithm has less computation in comparison with the vector representation based and the tensor-to-tensor projection based algorithms. The experiments for the basic facial expressions recognition show its effectiveness, especially when it is followed by a neural network classifier.     

“绑定中测试”“多绑一测”方式对于测试过程的影响

随着半导体工艺水平的不断发展,3D芯片技术已成为一大研究热点。"绑定中测试"环节的提出对于芯片的测试流程有了新的要求。但是,"绑定中测试""一绑一测"的特点会使部分裸片被重复测试,从而带来测试时间的增加。从"绑定中测试"的过程出发,协同考虑测试功耗与"理论制造成本"对于"绑定中测试"的影响,提出"多绑一测"的测试流程。在此基础上提出相应的广度优先遍历算法,结合ITC’02电路的相关参数,体现本文思想在实际生产制造中的现实意义。     

Calculating and understanding the value of any type of match evidence when there are potential testing errors

It is well known that Bayes’ theorem (with likelihood ratios) can be used to calculate the impact of evidence, such as a ‘match’ of some feature of a person. Typically the feature of interest is the DNA profile, but the method applies in principle to any feature of a person or object, including not just DNA, fingerprints, or footprints, but also more basic features such as skin colour, height, hair colour or even name. Notwithstanding concerns about the extensiveness of databases of such features, a serious challenge to the use of Bayes in such legal contexts is that its standard formulaic representations are not readily understandable to non-statisticians. Attempts to get round this problem usually involve representations based around some variation of an event tree. While this approach works well in explaining the most trivial instance of Bayes’ theorem (involving a single hypothesis and a single piece of evidence) it does not scale up to realistic situations. In particular, even with a single piece of match evidence, if we wish to incorporate the possibility that there are potential errors (both false positives and false negatives) introduced at any stage in the investigative process, matters become very complex. As a result we have observed expert witnesses (in different areas of speciality) routinely ignore the possibility of errors when presenting their evidence. To counter this, we produce what we believe is the first full probabilistic solution of the simple case of generic match evidence incorporating both classes of testing errors. Unfortunately, the resultant event tree solution is too complex for intuitive comprehension. And, crucially, the event tree also fails to represent the causal information that underpins the argument. In contrast, we also present a simple-to-construct graphical Bayesian Network (BN) solution that automatically performs the calculations and may also be intuitively simpler to understand. Although there have been multiple previous applications of BNs for analysing forensic evidence—including very detailed models for the DNA matching problem, these models have not widely penetrated the expert witness community. Nor have they addressed the basic generic match problem incorporating the two types of testing error. Hence we believe our basic BN solution provides an important mechanism for convincing experts—and eventually the legal community—that it is possible to rigorously analyse and communicate the full impact of match evidence on a case, in the presence of possible errors.     

节流式差压流量计的新进展之一调整型孔板405C和1595

对节流式差压流量计的发展现状及国际标准ISO5167:2003(E)对直管段要求的变化进行了介绍。介绍节流式差压流量计的新进展之一调整型孔板405C和1595,阐述了该流量计的结构型式、测量原理、性能特点和应用情况,并和标准孔板进行比较。     

A model and a fast algorithm for multiple errors spelling correction

A new model for multiple errors spelling correction is proposed. The model handles insert, delete, change, and transpose errors. In the new model, we put constraints on possible editing sequences to reflect the error occurrence phenomenon in spelling, resulting in an error measure different from the traditional editing distance error measure. Properties of the error distance matrix between two character strings are studied under the assumptions of the new model. A cut-off criterion has been discovered, which can detect whether the error distance between two character strings is greater than a prespecified value during the calculation. Based on this cut-off criterion, a fast algorithm has been developed to find the nearest neighbors of a given character string in a dictionary. Experiments have been conducted with results showing that the cut-off criterion can greatly cut down the computation time needed for the nearest neighbor searching.     

Adaptive search for one defective in the additive group testing model

In contrast to the problem of finding all defective elements in group testing, we consider the problem of finding one defective in a set D of defective elements of cardinality d. We consider adaptive search algorithms only. A similar problem for the classical and threshold models was solved in [1]. In the present paper we consider the additive testing model. We obtain an optimal answer in the problem of adaptive search of one defective element in this model.     

Leave one support vector out cross validation for fast estimation of generalization errors

A Support Vector Classifier (SVC) is formulated in terms of a kernel. The bandwidth of the kernel affects the generalization performance of the SVC. This paper presents a Leave One Support Vector Out Cross Validation (LOSVO-CV) algorithm for estimating the optimal bandwidth of the kernel for classification purpose. The proposed algorithm is based on the Leave One Out Cross Validation (LOO-CV) algorithm (Numer. Math. 31 (1979) 377) that was proposed to find the optimal bandwidth but difficult to be implemented due to its large amount of computation. The properties of LOSVO-CV are analyzed in comparison with the LOO-CV. The simulation study demonstrates that the LOSVO-CV is a fast algorithm and it has the same generalization performance optimized by a bootstrap method (Neural Process. Lett. 11 (2000) 51) which can find an optimal bandwidth of the kernel of the SVC. The LOSVO-CV algorithm is able to provide consistent results with different sizes of a benchmark data set which is obtained from the University of California (UCI) repository.     

Existence of multiple positive solutions for functional differential equations

In this paper, the existence of at least three positive solutions for the boundary value problem (BVP) of second-order functional differential equation with the form y″(t) + f(t, y^t) = 0, for t ε [0,1], y(t) -βy′(t) =η(t), for t ε [−τ,0], −γy(t) + Δy′(t) = ζ(t), for t ε [1, 1 + a], is studied. Moreover, we investigate the existence of at least three partially symmetric positive solutions for the above BVP with Δ = βγ.     

Circular meaningful shares based (k,n) two in one image secret sharing scheme for multiple secret images

Multimedia Tools and Applications - Two in One Image Secret Sharing Scheme (TiOISSS) is a cryptographic technique which encrypts a secret image into n shares and the shares are decoded in two...     

On power and sample size computation for multiple testing procedures

Power and sample size determination has been a challenging issue for multiple testing procedures, especially stepwise procedures, mainly because (1) there are several power definitions, (2) power calculation usually requires multivariate integration involving order statistics, and (3) expansion of these power expressions in terms of ordinary statistics, instead of order statistics, is generally a difficult task. Traditionally power and sample size calculations rely on either simulations or some recursive algorithm; neither is straightforward and computationally economic. In this paper we develop explicit formulas for minimal power and r-power of stepwise procedures as well as complete power of single-step procedures for exchangeable and non-exchangeable bivariate and trivariate test statistics. With the explicit power expressions, we were able to directly calculate the desired power, given sample size and correlation. Numerical examples are presented to illustrate the relationship among power, sample size and correlation.     

A trigonometrically-fitted method with two frequencies,one for the solution and another one for the derivative

In trigonometrically-fitted methods the determination of the parameter (usually known as the frequency) is a critical issue, as was shown in the article by H. Ramos and J. Vigo-Aguiar [Applied Mathematics Letters, 23 (2010) 1378–1381]. If the frequency estimation relies on the vanishing of the principal term of the local truncation error, then the first derivative is present in the formula for approximating the parameter. This requires the use of a procedure for approximating the first derivative. For this purpose we use another trigonometrically-fitted formula with a second parameter (different from the frequency of the principal method and also different from the frequency of the true solution). We describe how to approximate both parameters on each step and present different experiments concerning these questions. The numerical results indicate the good performance of the strategy.     

Lines in one orthographic and two perspective views

We introduce a linear algorithm to recover the Euclidean motion between an orthographic and two perspective cameras from straight line correspondences filling the gap in the analysis of motion estimation from line correspondences for various projection models. The general relationship between lines in three views is described by the trifocal tensor. Euclidean structure from motion for three perspective views is a special case in which the relationship is defined by a collection of three matrices. Here, we describe the case of two calibrated perspective views and an orthographic view. Similar to the other cases, our linear algorithm requires 13 or more line correspondences to recover 27 coefficients of the trifocal tensor.     

一款三相预付费复费率电能表的设计

本文设计了一款以FM2307专用芯片为核心实现的三相预付费复费率电能表,具体介绍了硬件的四大模块及其接口设计和软件的实现.该表能实现红外、RS485和IC卡通信三种通信功能,预付费复费率部分实现单芯片解决方案,外围器件少,结构紧凑,具有很好的市场前景.     

一种典型的差分放大电路设计与测试

简述一种典型的差分输入差分输出放大电路的设计、仿真和测试方法,讨论其设计原理及需要解决的问题.重点讲述差分滤波器的设计和计算,指出与单端放大电路在设计和测试中的不同之处,并结合实际工作中的经验,就直流信号和交流信号的测试分别给出了一种简易案例.     

On testing the existence of universal denominators for partial differential and difference equations

We consider the problem of testing the existence of a universal denominator for partial differential or difference equations with polynomial coefficients and prove its algorithmic undecidability. This problem is closely related to finding rational function solutions in that the construction of a universal denominator is a part of the algorithms for finding solutions of such form for ordinary differential and difference equations.     

Comparison of two algorithms for solving STIFF differential equations

Many algorithms are available for solving differential equations. Of these, two methods—GEAR and STIFF3, which were developed specifically for stiff differential equations, are compared based on their performance on five test problems. The performance criteria are both accuracy of the numerical solution and efficiency of the method. The results indicate that GEAR, although the older of the two methods, is the preferred algorithm, for stiff differential equations.     

Fault isolation for diagnosis: Nuisance rejection and multiple hypotheses testing

Fault detection, fault isolation and fault diagnosis are addressed within a statistical framework. The corresponding inference problems are stated. Several statistical tools for solving these inference problems are described. Particular emphasis is put on dealing with nuisance parameters and deciding between multiple hypotheses. How to use these tools for solving problems is discussed. An example illustrates some of the proposed methods.     

Exposing bugs in JavaScript engines through test transplantation and differential testing

Software Quality Journal - JavaScript is a popular programming language today with several implementations competing for market dominance. Although a specification document and a conformance test...     

多符号差分检测的低复杂度球形译码设计

在多符号差分检测系统中,深度优先的球形译码是一种典型的次优的检测算法。然而从复杂度角度来说,它仍有较高的计算复杂度,且存在流水线和并行操作困难等缺点。针对这些问题,目前主要从两个方面对该算法进行改进：一是通过选择合适的约束半径来降低复杂度;二是与K-Best（M）算法结合来解决并行操作问题。主要研究前者,并在现有的理论基础上,提出了两种半径选择方法,即线性半径和非线性半径。仿真结果表明,两种半径约束下的球形译码在复杂度上低于最大似然检测却同时能保证它们的性能损失小于0.5 dB。