On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra

Some techniques using linear algebra was introduced by Faugère in F4 to speed up the reduction process during Gr?bner basis computations.These techniques can also be used in fast implementations of F5 and some other signature-based Gr?bner basis algorithms.When these techniques are applied,a very important step is constructing matrices from critical pairs and existing polynomials by the Symbolic Preprocessing function(given in F4).Since multiplications of monomials and polynomials are involved in the Symbolic Preprocessing function,this step can be very costly when the number of involved polynomials/monomials is huge.In this paper,multiplications of monomials and polynomials for a Boolean polynomial ring are investigated and a specific method of implementing the Symbolic Preprocessing function over Boolean polynomial rings is reported.Many examples have been tested by using this method,and the experimental data shows that the new method is very efficient.     

Facile synthesis of flake-like dihydrate zinc oxalate particles

Monodispersed dihydrated zinc oxalate(ZnC_2O_4·2H_2O) particles with characteristic morphology were synthesized by aging a mixed solution of zinc nitrate(Zn(NO_3)_2) and sodium oxalate(Na_2C_2O_4) in the presence of a citrate ligand, with an average flat size of approximately 10–15 μm. The important parameters, including the solution pH values and the concentration of the zinc ions and citrate ligand, were investigated using a series of experiments. It is verified that the citrate ligand significantly affects the morphology of zinc oxalate particles, probably via its multiple roles of chelating, dispersing, and selective absorption. Thermodynamic equilibrium of the distribution of zinc species in an aqueous solution of Zn(Ⅱ)-citrate-oxalate-H_2O was estimated to explain the experimental results and to clarify the size and morphological evolution mechanism of the precipitated particles.     

基于MATLAB矩阵运算的大整数乘法设计与实现

大整数运算在信息安全、数学验证、基因工程等领域有着广泛的应用,设计有效的方案提高运算效率成为学者关注的热点。大整数乘法是大整数运算中的核心运算,对如何提高大整数乘法运算效率进行了分析总结,并利用MATLAB矩阵运算结合格子乘法等算法进行了设计与实现。实验表明通过MATLAB矩阵运算进行大整数乘法运算能有效的提高运算效率。     

Secure Two-Party Distance Computation Protocol Based on Privacy Homomorphism and Scalar Product in Wireless Sensor Networks

Numerous privacy-preserving issues have emerged along with the fast development of the Internet of Things. In addressing privacy protection problems in Wireless Sensor Networks(WSN), secure multi-party computation is considered vital, where obtaining the Euclidian distance between two nodes with no disclosure of either side’s secrets has become the focus of location-privacy-related applications. This paper proposes a novel Privacy-Preserving Scalar Product Protocol(PPSPP) for wireless sensor networks. Based on PPSPP, we then propose a Homomorphic-Encryption-based Euclidean Distance Protocol(HEEDP) without third parties. This protocol can achieve secure distance computation between two sensor nodes. Correctness proofs of PPSPP and HEEDP are provided, followed by security validation and analysis. Performance evaluations via comparisons among similar protocols demonstrate that HEEDP is superior; it is most efficient in terms of both communication and computation on a wide range of data types, especially in wireless sensor networks.     

Advance selling in the presence of product diffusion effect

Product diffusion refers to the phenomenon that the later demand is dependent on the early sales. To investigate how a firm’s advance selling strategy is affected by the effect of product diffusion, we consider a monopolist seller who sells a fashionable product in a market that comprises of myopic and strategic consumers over two periods (i.e., the advance selling season and the regular selling season). For a linear product diffusion effect we find that, when the effect of product diffusion is positive, the seller may set an extremely high advance selling price to induce the strategic consumers to purchase in the regular selling season, which is counter-intuitive. Moreover, the optimal procurement quantity for the seller may increase in the negative effect of product diffusion and decrease in the amount of strategic consumers. When we extend our model to consider a concave quadratic product diffusion effect, however, the optimal procurement quantity is concave in the amount of strategic consumers. Numerical studies are further presented to discuss the managerial insights.     

Underdetermined DOA estimation and blind separation of non-disjoint sources in time-frequency domain based on sparse representation method

This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time-frequency （TF） disjoint to a certain extent. In particular, the number of sources presented at any TF neighborhood is strictly less than that of sensors. We can identify the real number of active sources and achieve separation in any TF neighborhood by the sparse representation method. Compared with the subspace-based algorithm under the same sparseness assumption, which suffers from the extra noise effect since it can-not estimate the true number of active sources, the proposed algorithm can estimate the number of active sources and their cor-responding TF values in any TF neighborhood simultaneously. An-other contribution of this paper is a new estimation procedure for the DOA of sources in the underdetermined case, which combines the TF sparseness of sources and the clustering technique. Sim-ulation results demonstrate the validity and high performance of the proposed algorithm in both blind source separation （BSS） and DOA estimation.