In this paper, we investigate not only the acceleration problem of the q-Bernstein polynomials Bn（f, q; x） to B∞ （f, q; x） but also the convergence of their iterated Boolean sum. Using the methods of exact estima...In this paper, we investigate not only the acceleration problem of the q-Bernstein polynomials Bn（f, q; x） to B∞ （f, q; x） but also the convergence of their iterated Boolean sum. Using the methods of exact estimate and theories of modulus of smoothness, we get the respective estimates of the convergence rate, which suggest that q-Bernstein polynomials have the similar answer with the classical Bernstein polynomials to these two problems.展开更多
In this paper we present a classical parallel quantum algorithm for the satisfiability problem. We have exploited the classical parallelism of quantum algorithms developed in [G.L. Long and L. Xiao, Phys. Rev. A 69 （...In this paper we present a classical parallel quantum algorithm for the satisfiability problem. We have exploited the classical parallelism of quantum algorithms developed in [G.L. Long and L. Xiao, Phys. Rev. A 69 （2004） 052303], so that additional acceleration can be gained by using classical parallelism. The quantum algorithm first estimates the number of solutions using the quantum counting algorithm, and then by using the quantum searching algorithm, the explicit solutions are found.展开更多
Visual cryptography is a cryptographic technique which emerges in the information security domain in recent years. Each of the sharing sub-keys may be a stochastic noise image or a significative image with no informat...Visual cryptography is a cryptographic technique which emerges in the information security domain in recent years. Each of the sharing sub-keys may be a stochastic noise image or a significative image with no information on the original key. But a mass of sub-keys have to be saved actually, which faces the problem of inconvenient discrimination and management. This paper presents a visual cryptography scheme based on the digital signature for image discrimination and management, applying the digital signature and the time-stamp technology to the visual cryptography scheme. The scheme both solves the problem on the storage and management of the sharing sub-keys, increases the verification of image contents, thus enhances the validity of storage and management without security effect.展开更多
We apply the fast multipole method (FMM) accelerated boundary element method (BEM) for the three-dimensional (3D) Helmholtz equation, and as a result, large-scale acoustic scattering problems involving 400000 elements...We apply the fast multipole method (FMM) accelerated boundary element method (BEM) for the three-dimensional (3D) Helmholtz equation, and as a result, large-scale acoustic scattering problems involving 400000 elements are solved efficiently. This is an extension of the fast multipole BEM for two-dimensional (2D) acoustic problems developed by authors recently. Some new improvements are obtained. In this new technique, the improved Burton-Miller formulation is employed to over-come non-uniqueness difficulties in the conventional BEM for exterior acoustic problems. The computational efficiency is further improved by adopting the FMM and the block diagonal preconditioner used in the generalized minimum residual method (GMRES) iterative solver to solve the system matrix equation. Numerical results clearly demonstrate the complete reliability and efficiency of the proposed algorithm. It is potentially useful for solving large-scale engineering acoustic scattering problems.展开更多
Using outward rotations, we obtain an approximation algorithm for MAXn/2-UNCUT problem, i.e., partitioning the vertices of a weighted graph into two blocks of equalcardinality such that the total weight of edges that ...Using outward rotations, we obtain an approximation algorithm for MAXn/2-UNCUT problem, i.e., partitioning the vertices of a weighted graph into two blocks of equalcardinality such that the total weight of edges that do not cross the cut is maximized. In manyinteresting cases, the algorithm performs better than the algorithms of Ye and of Halperin andZwick. The main tool used to obtain this result is semidefinite programming.展开更多
Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is prop...Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is proposed so that JSP-DCPT can be handled by solving a job-shop scheduling problem (JSP) and a series of discrete time-cost tradeoff problems. To simplify the decomposition approach, the time-cost phase plane is introduced to describe tradeoffs of the discrete time-cost tradeoff problem, and an extreme mode-based set dominant theory is elaborated so that an upper bound is determined to cut discrete time-cost tradeoff problems generated by using the proposed decomposition approach. An extreme mode-based set dominant decomposition algorithm (EMSDDA) is then proposed. Experimental simulations for instance JSPDCPT_FT10, which is designed based on a JSP benchmark FT10, demonstrate the effectiveness of the proposed theory and the decomposition approach.展开更多
To eliminate computational problems involved in evaluating multi-attribute bids with differentmeasures,this article first normalizes each individual component of a bid,and then makes use ofthe weighted product method ...To eliminate computational problems involved in evaluating multi-attribute bids with differentmeasures,this article first normalizes each individual component of a bid,and then makes use ofthe weighted product method to present a new scoring function that converts each bid into a score.Twokinds of multi-attribute auction models are introduced in terms of scoring rules and bidding objectivefunctions.Equilibrium bidding strategies,procurer's revenue comparisons and optimal auction designare characterized in these two models.Finally,this article discusses some improvement of robustnessof our models,with respect to the assumptions.展开更多
文摘In this paper, we investigate not only the acceleration problem of the q-Bernstein polynomials Bn（f, q; x） to B∞ （f, q; x） but also the convergence of their iterated Boolean sum. Using the methods of exact estimate and theories of modulus of smoothness, we get the respective estimates of the convergence rate, which suggest that q-Bernstein polynomials have the similar answer with the classical Bernstein polynomials to these two problems.
基金supported by 973 Program under Grant No.2006CB921106National Natural Science Foundation of China under Grant No.60635040the Key Grant Project of the Ministry of Education under Grant No.306020
文摘In this paper we present a classical parallel quantum algorithm for the satisfiability problem. We have exploited the classical parallelism of quantum algorithms developed in [G.L. Long and L. Xiao, Phys. Rev. A 69 （2004） 052303], so that additional acceleration can be gained by using classical parallelism. The quantum algorithm first estimates the number of solutions using the quantum counting algorithm, and then by using the quantum searching algorithm, the explicit solutions are found.
文摘Visual cryptography is a cryptographic technique which emerges in the information security domain in recent years. Each of the sharing sub-keys may be a stochastic noise image or a significative image with no information on the original key. But a mass of sub-keys have to be saved actually, which faces the problem of inconvenient discrimination and management. This paper presents a visual cryptography scheme based on the digital signature for image discrimination and management, applying the digital signature and the time-stamp technology to the visual cryptography scheme. The scheme both solves the problem on the storage and management of the sharing sub-keys, increases the verification of image contents, thus enhances the validity of storage and management without security effect.
基金supported by the Fundamental Research Funds for the Central Universities (Grant No. 2010MS080)the Research Fund for Doctoral Program of Higher Education of China (Grant No. 20070487403)
文摘We apply the fast multipole method (FMM) accelerated boundary element method (BEM) for the three-dimensional (3D) Helmholtz equation, and as a result, large-scale acoustic scattering problems involving 400000 elements are solved efficiently. This is an extension of the fast multipole BEM for two-dimensional (2D) acoustic problems developed by authors recently. Some new improvements are obtained. In this new technique, the improved Burton-Miller formulation is employed to over-come non-uniqueness difficulties in the conventional BEM for exterior acoustic problems. The computational efficiency is further improved by adopting the FMM and the block diagonal preconditioner used in the generalized minimum residual method (GMRES) iterative solver to solve the system matrix equation. Numerical results clearly demonstrate the complete reliability and efficiency of the proposed algorithm. It is potentially useful for solving large-scale engineering acoustic scattering problems.
基金This research is partly supported by Chinese NSF grant 19731001 and National 973 Information Technol- ogy High-Performance Software Program of China with grant No. G1998030401The author gratefully acknowledges the support of K. C. Wong Education
文摘Using outward rotations, we obtain an approximation algorithm for MAXn/2-UNCUT problem, i.e., partitioning the vertices of a weighted graph into two blocks of equalcardinality such that the total weight of edges that do not cross the cut is maximized. In manyinteresting cases, the algorithm performs better than the algorithms of Ye and of Halperin andZwick. The main tool used to obtain this result is semidefinite programming.
基金supported by the National Natural Science Foundation of China (Grant Nos. 51075337, 50705076, 50705077)the Natural Sci-ence Basic Research Plan in Shaanxi Province of China (Grant No. 2009JQ9002)
文摘Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is proposed so that JSP-DCPT can be handled by solving a job-shop scheduling problem (JSP) and a series of discrete time-cost tradeoff problems. To simplify the decomposition approach, the time-cost phase plane is introduced to describe tradeoffs of the discrete time-cost tradeoff problem, and an extreme mode-based set dominant theory is elaborated so that an upper bound is determined to cut discrete time-cost tradeoff problems generated by using the proposed decomposition approach. An extreme mode-based set dominant decomposition algorithm (EMSDDA) is then proposed. Experimental simulations for instance JSPDCPT_FT10, which is designed based on a JSP benchmark FT10, demonstrate the effectiveness of the proposed theory and the decomposition approach.
基金supported by the Foundation for the Author of National Excellent Doctoral Dissertation of China under Grant No. 200159National Natural Science Foundation of China under Grant No. 70571014
文摘To eliminate computational problems involved in evaluating multi-attribute bids with differentmeasures,this article first normalizes each individual component of a bid,and then makes use ofthe weighted product method to present a new scoring function that converts each bid into a score.Twokinds of multi-attribute auction models are introduced in terms of scoring rules and bidding objectivefunctions.Equilibrium bidding strategies,procurer's revenue comparisons and optimal auction designare characterized in these two models.Finally,this article discusses some improvement of robustnessof our models,with respect to the assumptions.
