Strong Law of Large Numbers and Complete Convergence for Sequences of φ-Mixing Random Var, ables

We give some theorems of strong law of large numbers and complete convergence for sequences of φ-mixing random variables. In particular, Wittmann＇s strong law of large numbers and Teicher＇s strong law of large nnumbers for independent random variables are generalized to the case of φ -minxing random variables.     

An improved sanitizable signature scheme

A new sanitizable signature scheme is proposed, in which the security flaw of Miyazaki＇s sanitizable signature scheme SUMI-4 is improved. The new scheme overcomes the shortcomings of the original scheme SUM1-4 by using sanitizable authorization certificates. The new scheme enables the primitive signer to limit the sanitizer＇s power and still satisfies the security request of sanitizable signature.     

Composition operators with linear fractional symbols on vector-valued Bergman spaces

0　IntroductionLetDdenotetheopenunitdiskinthecomplexplaneC , DitsboundaryanddAtheLebesguemeasureonD ,normal izedsothatA(D) =1.ForaBanachspace (X ,‖·‖X) ,wewriteH(D ,X)fortheclassofallX valuedanalyticfunctionsonD .Let1≤ p<∞ ,theX valuedBergmanspaceBp(X)istheclassofallf∈H(D ,X) forwhich‖f‖Bp(X) =∫D‖f(z)‖pXdA(z) 1 /p <∞ (1)IfX =C,thenwewriteBp =Bp(C) fortheclassicalBergmanspaces.Letφ∶D→Dbeananalyticself mapofD .Thenthee quation Cφf=f φdefinesacompositionoperator…     

Model of Markov Chains in Space-Time Random Environments

A general framework of stochastic model for a Markov chain in a space-time random environment is introduced, here the environment ξ^＊：={ξ1,x∈N,x∈ X}is a random field. We study the dependence relations between the environment and the original chain, especially the ＂feedback＂. Some equivalence theorems and law of large numbers are obtained.     

A Note on the Prime Spectrums of Character Rings of Finite Groups

0Introduction LetGbeafinitegroupoforder|G|=g,andletR(G)denotethecharacterringofG,whichisgeneratedbyalltheirreduciblecomplexcharactersofG.LetZbetherationalintegerringandNthesetofnatural numbers,andletZ[ω]betheintegralextensiongeneratedbyaprimitiveg throotωofunity.SupposethatSisasubringof thealgebraicnumberfieldsuchthatZ[ω]S.πisasetofra tionalprimenumbersdefinedasfollowsπ={p｜pisarationalprimenumbersuchthatp-1S}.Definition1WecallthataconjugacyclassCofthefinite groupGisaπregularconju…     

Statistical Characteristics of the Complexity for Prime-Periodic Sequences

Using the fact that the factorization of x^N-1 over GF(2) is especially explicit, we completely establish the distributions and the expected values of the linear complexity and the k-error linear complexity of the N-periodic sequences respectively, where N is an odd prime and 2 is a primitive root modulo N. The results show that there are a large percentage of sequences with both the linear complexity and the k-error linear complexity not less than N, quite close to their maximum possible values.     

Speeding up implementation for Shor’s factorization quantum algorithm

In this paper, based on the implementation of semiclassical quantum Fourier transform, we first propose the concept of generation vector of ternary binary representation, construct the generation function’s truth table, prove that the generation vector of ternary binary representation is one kind of k ’s NAF representation and further find that its number of nonzero is not more than [(⌈log k⌉ + 1)/2]. Then we redesign a quantum circuit for Shor’s algorithm, whose computation resource is approximately equal to that of Parker (Their requirements of elementary quantum gate are both O(⌈logN⌉³), and our circuit requires 2 qubits more than Parker’s). However, our circuit is twice as fast as Parker’s.     

An FPGA Implementation of GF （p） Elliptic Curve Cryptographic Coprocessor

A GF (p) elliptic curve cryptographic coprocessor is proposed and implemented on Field Programmable Gate Array (FPGA). The focus of the coprocessor is on the most critical, complicated and time-consuming point multiplications. The technique of coordinates conversion and fast multiplication algorithm of two large integers are utilized to avoid frequent inversions and to accelerate the field multiplications used in point multiplications. The characteristic of hardware parallelism is considered in the implementation of point multiplications. The coprocessor implemented on XILINX XC2V3000 computes a point multiplication for an arbitrarypoint on a curve defined over GF(2^192-2^64-1) with the frequency of 10 MHz in 4.40 ms in the average case and 5.74ms in the worst case. At the same circumstance, the coprocessor implemented on XILINX XC2V4000 takes 2.2 ms in the average case and 2.88 ms in the worst case.     

An Improved Genetic Algorithm for Problem of Genome Rearrangement

In view of the fact that the problem of sorting unsigned permutation by reversal is NP-hard, while the problem of sorting signed permutation by reversal can be solved easily, in this paper, we first transform an unsigned permutation of length n,π （π1 ,… ,πn）, into a set S（π） containing 2^n signed permutations, so that the reversal distance of π is equal to the reversal distance of the optimal signed permutation in S（π）. Then analyze the structural features of S（π） by creating a directed graph and induce a new computing model of this question. Finally, an improved genetic algorithm for solving the new model is proposed. Experimental results show that the proposed model and algorithm is very efficient in practice.     

Riemann Boundary Value Problem with Square Roots on an Open Arc

The Riemann boundary value problem with square roots in class h0 when the jumping curve is an open arc in the complex plane is considered. It is solved by reducing it to a classical Riemann boundary value problem so that its solutions are obtained in closed form. In certain cases, some auxiliary function ω（z）is introduced. With different choices of ω（z）＇s, some interesting examples are illustrated.     

Comparison of phylobetadiversity indices based on community data from Gutianshan forest plot

Phylobetadiversity incorporates phylogenetic information and beta diversity,and can account for the ecological similarities between communities with a phylogenetic perspective.Although different phylobetadiversity indices reflect differences in different characteristics between communities,the results of different phylobetadiversity indices are not comparable.In this study we examined phylobetadiversity indices for a 24-hm 2 plot in the Gutianshan National Nature Reserve.It was found the abundanceweighted D pw was almost identical to Rao’s D of Rao’s quadratic entropy.PhyloSor had a similar ecological meaning and algorithm to UniFrac.Although Dnn was different in definition from UniFrac and PhyloSor,they were all strongly correlated.The effect of species abundance on phylobetadiversity was not significant when scales were relatively small,but was significant at larger scales.These contrasts likely resulted from reductions in evenness in communities as scales increased.P ST and Rao’s H better reflected the distance-decay changes caused by spatial and habitat variation than other indices at larger scales,whereas AW-D nn and D nn better reflected these changes at small scales.     

An efficient identity-based anonymous signcryption scheme

Signcryption is a cryptographic primitive that performs encryption and signature in a single logical step more efficiently than sign-then-encrypt approach. Till now, various kinds of signcryption schemes have been proposed. Among them, the requirement of signcrypter＇s privacy protection is needful in some practical applications. In this paper, a new identity-based anonymous signcryption scheme from hilinear pairings, which is the organic combination of identity-based ring signature and encryption scheme, is proposed. The proposed scheme is indistinguishable against the chosen ciphertext attack under the Decisional Bilinear Diffie-Hellman assumption in the random oracle model. Its unforgeability relies on the computational Diffieellman problem. Compared with the previous schemes, the new scheme is more efficient in computation.     

On the largest linear span of binary sequences with period p 2 from interleaved construction

Let S be a family of binary sequences constructed from interleaved construction. The linear spans of binary sequences in S are studied in this paper. In order to achieve the largest linear span, a criterion is presented for the base sequences with periodp, where p is a prime and 2 is a primitive root modulop2. It is shown that any sequence in S has the largest linear span under the criterion. Moreover, such base sequences can be chosen easily.     

On the Family of Thue Equation ｜x^3 ＋ mx^2y-（ m ＋ 3）xy^2 ＋ y^3｜= k

The family of cubic Thue equation which depend on two parameters ｜ x^3 ＋ mx^2 y-（m＋3） xy^2＋y^3｜=k is studied. Using rational approximation, we give a smaller upper bound of the solution of the equation, that is quite better than the present result. Moreover, we study two inequalities ｜ x^3 ＋ mx^2y-（m ＋ 3） xy^2＋y^3 ｜ =k≤2m＋3 and ｜x^3 ＋mx^2y- （m＋3）xy^2 ＋ y^3｜ = k≤ （2m＋3）^2 separately. Our result of upper bound make it easy to solve those inequalities by simple method of continuous fraction expansion.     

Vegetation Landscape, Ecological Characteristics and Soil Fixation for Riverbank in Taiwan, China

This study is aimed to investigate and analyze the vegetation landscape around Rivers of Hou-lung, Fa-tz, Da-li, Ching-shuei and Gau- ping, and to select the suitable plant species that could be applied for the area of riverbank ecological engineering in Taiwan. Studying the vegetation established the key point and procedure of ecological engineering in the riverside and revetment, to compile and edit the dominant plants＇ types, life form, propagating method, root systems＇ characteristics and functions for soil conservation. This research choses three dominant plants for roots strength test. The fitting models of plants pulling resistance（Rp, kg） between plant height （H, cm）, diameter near ground （Dn, mm）, diameter above ground 100 mm （Da, mm）, The research finished the relative abundant, types and cluster analysis of riverbank dominant plants that generalize vegetative distribution and ecological restoration for different river types to apply and manage in Taiwan.     

Finite Indeterminacy of Homogenous Polynomial Germs under Some Subgroups R1（r） of R

Using the finite determinacy relation with the regular sequence in the Ring Theory and the complete intersection in Analytic Geometry, the finite indeterminacy of homogeneous polynomial germs under some subgroups R1（r） of R in both real and complex case is proven by the homogeneity of the polynomial germs. It results in the finite determinacy of homogeneous polynomial germs needn＇t be discussed respectively.     

Numerical simulation of ionization enhancement in the topside ionosphere of cusp foot-point region caused by low energy particle precipitation

The Graz Ionospheric Flux Tube Simulations (GIFTS) has been improved. The improved GIFTS model was used to numerically investigate the energy particle precipitation on the distribution of electron density in the ionospheric cusp foot-point region under conditions of large plasma convection during magnetic storm. After including the effects of low energy incident particles, the ionospheric electron densities increase remarkably above altitude of ∼250 km, showing a peak at about 350 km. The percent enhancements of electron densities increase gradually with altitude, exceeding 60% near the upper boundary of the calculation. The calculated ionospheric F ₂-peak was remarkably enhanced and lifted up by the incident low energy electrons. Biography: CAI Hongtao(1976–), male, Associate professor, Ph.D., research direction: polar magnetosphere and ionosphere.     

关于扩展的Blum整数

本文讨论扩展的Blum整数的性质,得到一些有用的结论.     

t-bit semiclassical quantum Fourier transform

Because of the difficulty of building a high-dimensional quantum register,this paper presents an implementation of the high-dimensional quantum Fourier transform(QFT)based on a low-dimensional quantum register.First,we define the t-bit semi- classical quantum Fourier transform.In terms of probability amplitude,we prove that the transform can realize quantum Fourier transformation,illustrate that the requirement for the two-qubit gate reduces obviously,and further design a quantum circuit of the transform.Combining the classical fixed-window method and the implementation of Shor’s quantum factorization algorithm,we then redesign a circuit for Shor’s algorithm,whose required computation resource is approximately equal to that of Parker’s.The requirement for elementary quantum gates for Parker’s algorithm is 3 O (logN),and the quantum register for our circuit re- quires t-1 more dimensions than Parker’s.However,our circuit is t2 times as fast as Parker’s,where t is the width of the window.     

Efficient Identity Based Signcryption Scheme with Public Verifiability and Forward Security

In this paper, we point out that Libert and Quisquater‘s signeryption scheme cannot provide public verifiability. Then we present a new identity based signcryption scheme using quadratic residue and pairings over elliptic curves. It combines the functionalities of both public verifiability and forward security at the same time. Under the Bilinear Diffie-Hellman and quadratic residue assumption, we describe the new scheme that is more secure and can be some what more efficient than Libert and Quisquater‘s one.