Local normalized linear summation kernel for fast and robust recognition

Kernel-based methods are effective for object detection and recognition. However, the computational cost when using kernel functions is high, except when using linear kernels. To realize fast and robust recognition, we apply normalized linear kernels to local regions of a recognition target, and the kernel outputs are integrated by summation. This kernel is referred to as a local normalized linear summation kernel. Here, we show that kernel-based methods that employ local normalized linear summation kernels can be computed by a linear kernel of local normalized features. Thus, the computational cost of the kernel is nearly the same as that of a linear kernel and much lower than that of radial basis function (RBF) and polynomial kernels. The effectiveness of the proposed method is evaluated in face detection and recognition problems, and we confirm that our kernel provides higher accuracy with lower computational cost than RBF and polynomial kernels. In addition, our kernel is also robust to partial occlusion and shadows on faces since it is based on the summation of local kernels.     

Integrating intermediate inputs from partially classified images within a hybrid classification framework: An impervious surface estimation example

With the constant proliferation of computational power, our ability to develop hybrid classifiers has improved. Hybrid classifiers integrate results from multiple algorithms and often improve classification accuracy. In this paper, a hybrid classification framework was used to evaluate two research hypotheses: i) can manipulated results from prior classifiers (“intermediate inputs” (IIs)) improve classification accuracy in subsequent classification steps. and ii) is there an optimal dataset proportion for creation and usage of intermediate inputs. These additional intermediate inputs were based on spatial and texture statistics calculated on a partially classified image. The implementation of intermediate inputs on an impervious surface classification task using a 2001 Landsat ETM+ image from central New York was demonstrated. The results suggested that there was an average accuracy improvement of 3.6% (maximum 6.6%) by using intermediate inputs. These improvements were proved statistically significant by a Z-test and tended to increase as classification difficulty increased. The experiments in this paper also showed that there was an optimal point that balanced the number of pixels and pixel classification accuracy from prior steps used to produce intermediate inputs. Additionally, some traditional problems such as separation of impervious surfaces and soil were successfully tackled through intermediate inputs. The concept of the intermediate inputs may easily apply to other sensors and/or ground features.     

基于Harn部分盲签名的安全电子投票方案

本文设计了一种新的Harn部分盲签名方案,并将此方案用于电子投票的设计中,形成了一个安全可靠的电子投票方案。这种电子投票方案不仅保证了投票者身份的匿名性和选票的安全、公平、保密性,还能实现投票的不可抵赖性。此方案是传统的盲签名电子投票方案的一个改进,是一个很实用的方案。     

On the complexity of deciding avoidability of sets of partial words

Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k≥2, is NP-hard [F. Blanchet-Sadri, R. Jungers, J. Palumbo, Testing avoidability on sets of partial words is hard, Theoret. Comput. Sci. 410 (2009) 968-972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are NP-hard, others are shown to be efficiently decidable. Using some combinatorial properties of de Bruijn graphs, we establish a correspondence between lengths of cycles in such graphs and periods of avoiding words, resulting in a tight bound for periods of avoiding words. We also prove that Avoidability can be solved in polynomial space, and reduces in polynomial time to the problem of deciding the avoidability of a finite set of partial words of equal length over the binary alphabet. We give a polynomial bound on the period of an infinite avoiding word, in the case of sets of full words, in terms of two parameters: the length and the number of words in the set. We give a polynomial space algorithm to decide if a finite set of partial words is avoided by a non-ultimately periodic infinite word. The same algorithm also decides if the number of words of length n avoiding a given finite set of partial words grows polynomially or exponentially with n.     

Inventory model for seasonal demand with option to change the market

In real life, when bulk purchase becomes convenient or even mandatory, it is a common practice for distributors to explore an alternative market in order to maximize the revenue earned. In this paper, we consider an inventory model for a product having seasonal demand with two potential markets, say, primary and alternate. The distributor has a single opportunity of procurement prior to multiple demand seasons in the primary and the alternate market. Both the markets have similar demand patterns, with time lag between their demand seasons. The demand is a price and time dependent function with increasing, constant and declining phases within each demand season. The scale parameter of demand rate depends upon the market. In each market, successive seasons are separated by random time. In one replenishment cycle, the distributor has a single option to exit the primary market by transferring the inventory, with or without change in selling price. This option can be exercised at the end of any complete season at the primary market. Our investigations indicate that it will be beneficial for the distributor to shift to the alternate market even at a slightly lower selling price if demand rate in the alternate market is higher. Optimal number of seasons at the primary market before change of price or market is obtained. Optimal policy is obtained for jointly determining the order quantity and price. Concavity of the profit function is discussed. Solution procedure, numerical examples and sensitivity analysis are presented.     

Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule

In this study, a novel OFF-set based direct-cover Exact Minimization Algorithm (EMA) is proposed for single-output Boolean functions represented in a sum-of-products form. To obtain the complete set of prime implicants covering the given Target Minterm (ON-minterm), the proposed method uses OFF-cubes (OFF-minterms) expanded by this Target Minterm. The amount of temporary results produced by this method does not exceed the size of the OFF-set. In order to achieve the goal of this study, which is to make faster computations, logic operations were used instead of the standard operations. Expansion OFF-cubes, commutative absorption operations and intersection operations are realized by logic operations for fast computation. The proposed minimization method is tested on several classes of benchmarks and then compared with the ESPRESSO algorithm. The results show that the proposed algorithm obtains more accurate and faster results than ESPRESSO does.     

基于最小概率距离和改进PV插值的图像配准

提出一种基于最小概率距离和改进部分体积(PV)插值的图像配准方法。采用Powell优化算法迭代搜索对称KL距离的最小值,获取最小概率距离,将其作为配准测度,并利用改进的PV插值算法提高图像配准的鲁棒性。实验结果表明,与基于互信息的图像配准方法相比,该方法能有效地减少耗费时间,提高配准精度。     

Avoiding large squares in partial words

Well-known results on the avoidance of large squares in (full) words include the following: (1) Fraenkel and Simpson showed that we can construct an infinite binary word containing at most three distinct squares; (2) Entringer, Jackson and Schatz showed that there exists an infinite binary word avoiding all squares of the form xx such that |x|≥3, and that the bound 3 is optimal; (3) Dekking showed that there exists an infinite cube-free binary word that avoids all squares xx with |x|≥4, and that the bound of 4 is best possible. In this paper, we investigate these avoidance results in the context of partial words, or sequences that may have some undefined symbols called holes. Here, a square has the form uv with u and v compatible, and consequently, such a square is compatible with a number of full words that are squares over the given alphabet. We show that (1) holds for partial words with at most two holes. We prove that (2) extends to partial words having infinitely many holes. Regarding (3), we show that there exist binary partial words with infinitely many holes that avoid cubes and have only eleven full word squares compatible with factors of it. Moreover, this number is optimal, and all such squares xx satisfy |x|≤4.     

Ten commandments for good default expression simplification

This article provides goals for the design and improvement of default computer algebra expression simplification. These goals can also help users recognize and partially circumvent some limitations of their current computer algebra systems. Although motivated by computer algebra, many of the goals are also applicable to manual simplification, indicating what transformations are necessary and sufficient for good simplification when no particular canonical result form is required.After motivating the ten goals, the article then explains how the Altran partially factored form for rational expressions was extended for Derive and for the computer algebra in Texas Instruments products to help fulfill these goals. In contrast to the distributed Altran representation, this recursive partially factored semi-fraction form:

•

does not unnecessarily force common denominators,

•

discovers and preserves significantly more factors,

•

can represent general expressions, and

•

can produce an entire spectrum from fully factored over a common denominator through complete multivariate partial fractions, including a dense subset of all intermediate forms.

     

New exact solutions for the KdV equation with higher order nonlinearity by using the variational method

The Korteweg-de Vries (KdV) equation with higher order nonlinearity models the wave propagation in one-dimensional nonlinear lattice. A higher-order extension of the familiar KdV equation is produced for internal solitary waves in a density and current stratified shear flow with a free surface. The variational approximation method is applied to obtain the solutions for the well-known KdV equation. Explicit solutions are presented and compared with the exact solutions. Very good agreement is achieved, demonstrating the high efficiency of variational approximation method. The existence of a Lagrangian and the invariant variational principle for the higher order KdV equation are discussed. The simplest version of the variational approximation, based on trial functions with two free parameters is demonstrated. The jost functions by quadratic, cubic and fourth order polynomials are approximated. Also, we choose the trial jost functions in the form of exponential and sinh solutions. All solutions are exact and stable, and have applications in physics.