一类资源最优配置的充要条件及其应用

本文研究了由工业投资、教育投资等问题中导出的一类非线性规划问题,应用Kuhn-Tucher定理得到了Rn中向量x=(x1,x2,…,xn)是这问题最优解的充分必要条件．应用这一结果导出了求解一类资源最优配置问题的新算法．这是一个具有计算复杂度为O(mn(m+n))的多项式型算法．

M_n(~R) (a_n, f, x) Apporximation in L_p[0, l]

Generalized Bernstein-Kantorovich polynomials M_n^((k))(a_n, f, x) were introduced in the paper and their order of approximation were estimated in the L_p[0, 1]-spaces.

Subspaces for weak mild solutions of the second order abstract differential equation

The topic on the subspaces for the polynomially or exponentially bounded weak mild solutions of the following abstract Cauchy problem d^2/（dr^2）u（t,x）=Au（t,x）;u（0,x）=x,d/（dt）u（0,x）=0,x∈X is studied, where A is a closed operator on Banach space X. The case that the problem is ill-posed is treated, and two subspaces Y（A, k） and H（A, ω） are introduced. Y（A, k） is the set of all x in X for which the second order abstract differential equation has a weak mild solution v（ t, x） such that ess sup{（1＋t）^-k｜d/（dt）〈v（t,x）,x^＊〉｜：t≥0,x^＊∈X^＊,｜x^＊‖≤1}〈＋∞. H（A, ω） is the set of all x in X for which the second order abstract differential equation has a weak mild solution v（t,x）such that ess sup{e^-ωl｜d/（dt）〈v（t,x）,x^＊）｜：t≥0,x^＊∈X^＊,‖x^＊‖≤1}〈＋∞. The following conclusions are proved that Y（A, k） and H（A, ω） are Banach spaces, and both are continuously embedded in X; the restriction operator A ｜ Y（A,k） generates a once-integrated cosine operator family { C（t） }t≥0 such that limh→0＋^-1/h‖C（t＋h）-C（t）‖Y（A,k）≤M（1＋t）^k,arbitary t≥0; the restriction operator A ｜H（A,ω） generates a once- integrated cosine operator family {C（t）}t≥0 such that limh→0＋^-1/h‖C（t＋h）-C（t）‖H（A,ω）≤≤Me^ωt,arbitary t≥0.

Rescheduling Problems with Bicriteria

In the rescheduling on a single machine,a set of original jobs has already been scheduled to minimize some cost objective,when a new set of jobs arrives and creates a disruption.The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it.In this paper,we consider hierarchical optimization between the scheduling cost of all the jobs and the degree of this disruption.For every problem,we provide either a polynomial time algorithm or an intractable result.

Application of Eigenkets of Bosonic Creation Operator in Deriving Some New Formulas of Associated Laguerre Polynomials

Using the resolution of unity composed of bosonic creation operator＇s eigenkets and annihilation operator＇s un-normalized eigenket, which is a new quantum mechanical representation in contour integration form, we derive new contour integration expression of associated Laguerre polynomials L^ρm （｜z｜^2） and its generalized generating function formula. A series of recursive relations regarding to L^ρm （｜z｜^2） are also deduced in the context of the Fock representation by algebraic method.

New Bosonic Operator Ordering Identities Gained by the Entangled State Representation and Two－Variable Hermite Polynomials

Based on the technique of integration within an ordered product of operators, we derive new bosonic operators, ordering identities by using entangled state representation and the properties of two-variable Hermite polynomials , and vice versa. In doing so, some concise normally (antinormally) ordering operator identities, such as : are obtained.

POLYNOMIAL COEFFICIENT FINDING FOR ROOT-MUSIC

Abs Root-MUSIC （MUltiple Signal Classification） is the polynomial rooting form of MUSIC, namely, the spectrum peak searching is resplaced by the polynomial rooting in MUSIC implementation. The coefficients finding of the polynomial is the critical problem for Root-MUSIC and its improvements By analyzing the Root-MUSIC algorithm thoughly, the finding method of the polynomial coefficient is deduced and the concrete calculation formula is given, so that the speed of polynomial finding roots will get the bigger exaltation. The particular simulations are given and attest correctness of the theory analysis and also indicate that the proposed algorithm has preferable estimating performance.

Provably Secure General Aggregate Signcryption Scheme in the Random Oracle Model

To reduce the size of certificate chains and the ciphertext size in secure routing protocols, a General Aggregate Signcryption Scheme (GASC) is presented. In GASC, an identity-based signcryption algorithm and an aggregate signature algorithm are combined in a practical and secure manner to form the general aggregate signcryption scheme's schema and concept, and a new secure, efficiently general aggregate signcryption scheme, which allows the aggregation of n distinct signcryptions by n distinct users on n distinct messages, is proposed. First, the correction of the GASC scheme is analyzed. Then, we formally prove the security of GASC in the random oracle models IND-CCA2 and EUF-CMA under the DBDHP assumption and the DLP assumption, respectively. The results show that the GASC scheme is not only secure against any probabilistic polynomial-time IND-GASC-CCA2 and EUF-GASC-CMA adversary in the random oracle models but also efficient in pairing ê computations. In addition, the GASC scheme gives an effective remedy to the key escrow problem, which is an inherent issue in IBC by splitting the private key into two parts, and reduces the communication complexity by eliminating the interaction among the senders (signers) before the signcryption generation.

Analytic Expression of Arbitrary Matrix Elements for Boson Exponential Quadratic Polynomial Operators

Making use of the transformation relation among usual, normal, and antinormal ordering for the multimode boson exponential quadratic polynomial operators （BEQPO＇s）I we present the analytic expression of arbitrary matrix elements for BEQPO＇s. As a preliminary application, we obtain the exact expressions of partition function about the boson quadratic polynomial system, matrix elements in particle-number, coordinate, and momentum representation, and P representation for the BEQPO＇s.

Fingerprint singular points extraction based on orientation tensor field and Laurent series

Singular point(SP)extraction is a key component in automatic fingerprint identification system(AFIS).A new method was proposed for fingerprint singular points extraction,based on orientation tensor field and Laurent series.First,fingerprint orientation flow field was obtained,using the gradient of fingerprint image.With these gradients,fingerprint orientation tensor field was calculated.Then,candidate SPs were detected by the cross-correlation energy in multi-scale Gaussian space.The energy was calculated between fingerprint orientation tensor field and Laurent polynomial model.As a global descriptor,the Laurent polynomial coefficients were allowed for rotational invariance.Furthermore,a support vector machine(SVM)classifier was trained to remove spurious SPs,using cross-correlation coefficient as a feature vector.Finally,experiments were performed on Singular Point Detection Competition 2010(SPD2010)database.Compared to the winner algorithm of SPD2010 which has best accuracy of 31.90%,the accuracy of proposed algorithm is 45.34%.The results show that the proposed method outperforms the state-of-the-art detection algorithms by large margin,and the detection is invariant to rotational transformations.

On Approximation of Nonbounded Continuous Functions

This paper generalizes the basic principle of multiplier-enlargement approach to approximating any nonbounded continuous functions with positive linear operators, and as an example, Bernstein polynomial operators are analysed and studied. This paper gives a certain theorem as a general rule to approximate any nonbounded continuous functions.

A Heuristic Approach to Fast NOVCA （Near Optimal Vertex Cover Algorithm）

This paper describes an extremely fast polynomial time algorithm, the NOVCA （Near Optimal Vertex Cover Algorithm） that produces an optimal or near optimal vertex cover for any known undirected graph G （V, E）. NOVCA is based on the idea of（l） including the vertex having maximum degree in the vertex cover and （2） rendering the degree of a vertex to zero by including all its adjacent vertices. The three versions of algorithm, NOVCA-I, NOVCA-II, and NOVCA-random, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any available vertex cover algorithms.

C^1 C^2INTERPOLATION OF SCATTERED DATA POINTS

In this paper an error in[4]is pointed out and a method for constructingsurface interpolating scattered data points is presented.The main feature of the methodin this paper is that the surface so constructed is polynomial,which makes the construction simple and the calculation easy.

SVM with Quadratic Polynomial Kernel Function Based Nonlinear Model One-step-ahead Predictive Control

A support vector machine (SVM) with quadratic polynomial kernel function based nonlinear model one-step-ahead predictive controller is presented. The SVM based predictive model is established with black-box identification method. By solving a cubic equation in the feature space, an explicit predictive control law is obtained through the predictive control mechanism. The effect of controller is demonstrated on a recognized benchmark problem and on the control of continuous-stirred tank reactor (CSTR). Simulation results show that SVM with quadratic polynomial kernel function based predictive controller can be well applied to nonlinear systems, with good performance in following reference trajectory as well as in disturbance-rejection.

Inequalities in Connection with Post-Widder Operators

The purpose of this paper is to derive the inequalities in connection with PostWidder operators， the result is corresponding to Wickeren in connection with Bernstein polynomials.

Cryptanalysis of Key Exchange Protocol Based on Tensor Ergodic Problem

Recently, Mao, Zhang, Wu et al. constructed two key exchange(KE) protocols based on tensor ergodic problem(TEP). Although they conjectured that these constructions can potentially resist quantum computing attack, they did not provide a rigorous security proof for their KE protocols. In this paper, applying the properties of ergodic matrix, we first present a polynomial time algorithm to solve the TEP problem using O(n^6) arithmetic operations in the finite field, where n is the security parameter. Then, applying this polynomial time algorithm, we generate a common shared key for two TEP-based KE constructions, respectively. In addition, we also provide a polynomial time algorithm with O(n^6) arithmetic operations that directly recovers the plaintext from a ciphertext for the KE-based encryption scheme. Thus, the TEP-based KE protocols and their corresponding encryption schemes are insecure.

A Ternary 4-Point Approximating Subdivision Scheme

In this paper, the author presents a class of stationary ternary 4-point approximating symmetrical subdivision algorithm that reproduces cubic polynomials. By these subdivision algorithms at each refinement step, new insertion control points on a finer grid are computed by weighted sums of already existing control points. In the limit of the recursive process, data is defined on a dense set of point, The objective is to find an improved subdivision approximating algorithm which has a smaller support and a higher approximating order. The author chooses a ternary scheme because the best way to get a smaller support is to pass from the binary to ternary or complex algorithm and uses polynomial reproducing propriety to get higher approximation order. Using the cardinal Lagrange polynomials the author has proposed a 4-point approximating ternary subdivision algorithm and found that a higher regularity of limit function does not guarantee a higher approximating order. The proposed 4-point ternary approximation subdivision family algorithms with the mask a have the limit function in C2 and have approximation order 4. Also the author has demonstrated that in this class there is no algorithm whose limit function is in C3. It can be seen that this stationary ternary 4-point approximating symmetrical subdivision algorithm has a lower computational cost than the 6-point binary approximation subdivision algorithm for a greater range of points.

Calculations of Invariants for Some 3-manifolds

In this paper,we give some ways of computing invariants of some 3 manifolds,obtained by surgery on circular Hopf link,by using Kauffman polynomial.

Smooth interpolation on homogeneous matrix groups for computer animation

Homogeneous matrices are widely used to represent geometric transformations in computer graphics, with interpo- lation between those matrices being of high interest for computer animation. Many approaches have been proposed to address this problem, including computing matrix curves from curves in Euclidean space by registration, representing one-parameter curves on manifold by rational representations, changing subdivisional methods generating curves in Euclidean space to corresponding methods working for matrix curve generation, and variational methods. In this paper, we propose a scheme to generate rational one-parameter matrix curves based on exponential map for interpolation, and demonstrate how to obtain higher smoothness from existing curves. We also give an iterative technique for rapid computing of these curves. We take the computation as solving an ordinary differential equation on manifold numerically by a generalized Euler method. Furthermore, we give this algorithm’s bound of the error and prove that the bound is proportional to the shift length when the shift length is sufficiently small. Compared to direct computation of the matrix functions, our Euler solution is faster.

On the value distribution of f^nf^(k)

This paper presents an inequality, by use of which some results about the value distribution of f nf (k) are proved, where n and k are two positive integers.