Rosenhain-Thomae formulae for higher genera hyperelliptic curves

Rosenhain's famous formula expresses the periods of first kind integrals of genus two hyperelliptic curves in terms of θ-constants. In this paper we generalize the Rosenhain formula to higher genera hyperelliptic curves by means of the second Thomae formula for derivative non-singular θ-constants.     

Similarity mass and approximate reasoning

It can reflect the nature of approximate reasoning and meet more application expectations to design the approximate reasoning matching schemes and the corresponding algorithms with similarity relation Q instead of equivalence relation R. In this paper, based on similarity relation Q, we introduce type V matching scheme and corresponding approximate reasoning type V Q-algorithm with the given input A* and knowledge A → B. Besides, we present completeness of type V and its perfection on knowledge base K in Q-logic ℂ _Q in this paper.     

基于公式真度的公式集约简

基于经典命题逻辑的真度理论,讨论了经典命题逻辑系统当中公式集的约简问题。提出了真度约简及α-真度约简的概念,为公式集的约简提供了一种可行的操作方法。     

LIMIT OF ITERATES FOR BERNSTEIN POLYNOMIALS DEFINED ON A TRIANGLE

Let f∈C[0,1],and Bn(f,x) be the a-th Bernstein polynomial associated with function f.ln 1967,the limit of iterates for B.(f,x) was given by Kelisky and Rivlin.After this,Many mathematicians studied and generalized this result.But anyway,all these discussions are only for univariate case ,In this paper,the main contrlbution is that the limit of lterates for Bernstein polynomial defined on a triangle is given completely.     

Comparative study of the instrumental couplings of high performance liquid chromatography with microwave-assisted digestion hydride generation atomic fluorescence spectrometry and inductively coupled plasma mass spectrometry for chiral speciation of selenomethionine in breast and formula milk

A comparison of chiral separation and analysis of selenomethionine in breast and formula milk, using high performance liquid chromatography (HPLC) on a glycopeptide teicoplanin-based chiral stationary phase (Chirobiotic T), coupled to atomic fluorescence spectrometry (AFS) and inductively coupled plasma (ICP) MS detectors has been performed. The coupling HPLC-microwave-assisted digestion hydride generation requires on-line post-column analytes treatment, and a severe sample clean-up for fat and proteins elimination using centrifugation and ultrafiltration. Underivatized -selenomethionine enantiomers were completely resolved in 10 min using unbuffered water mobile phase at 1 ml min⁻¹ flow. Good selectivity and sensitivities (detection limits 3.1 and 3.5 ng ml⁻¹ as Se for - and -selenomethionine, respectively) were obtained, and method robustness and simplicity, together to the low cost of AFS detector, makes it suitable for infant milk routine analysis. HPLC–ICP-MS coupling exhibits very low detection limits (0.9 ng ml⁻¹, as Se) for each -selenomethionine enantiomers, but the method suffers from matrix influence, that produces a poor S/N ratio and low reliability.

The methods were applied to breast and formula milk samples with recoveries of 80% of the total selenium presence, which is attributable to the existence of other unknown species. -Selenomethionine was the only isomer present in breast milk, but a 30% of -selenomethionine was also detected in formula milk.     

计算机上的抽象算符演算系统

本文在REDUCE语言环境下,利用公理化方法建立了一个“抽象算符演算”系统.使REDUCE系统可用于抽象的算符演算,逆演算;用于Laplace变换,逆变换及解微分方程,推导公式,以及验证有关定理等.     

The Ackermann function. a theoretical,computational, and formula manipulative study

Ackermann's function is of highly recursive nature and of two arguments. It is here treated as a class of functions of one argument, where the other argument defines the member of the class. The first members are expressed with elementary functions, the higher members with a hierarchy of primitive recursive functions. The number of calls of the function needed in a straightforward recursive computation is given for the first members. The maximum depth in the recursion during the evaluation is investigated.Results from tests with the Ackermann function of recursive procedure implementations in ALGOL-60, ALGOL W, PL/I and SIMULA-67 on IBM 360/75 and CD 6600 are given.A SYMBAL formula manipulating program, that automatically solves recurrence relations for the first members of the function class and for the number of calls needed in their straightforward computation, is given.The Ackermann rating of programming languages is discussed.     

Involution Fixing∪from (i=1) to r(RP(1))~m_i×(CP(1))~s_i*)

§０．ＩｎｔｒｏｄｕｃｔｉｏｎＷｅｗｒｉｔｅＦＰ（ｎ）ｆｏｒＣＰ（ｎ）（ｎ－ｄｉｍｅｎｓｉｏｎａｌｃｏｍｐｌｅｘｐｒｏｊｅｃｔｉｖｅｓｐａｃｅ）ｏｒＨＰ（ｎ）（ｎ－ｄｉ－ｍｅｎｓｉｏｎａｌｑｕａｔｅｒｎｉｏｎｉｃｐｒｏｊｅｃｔｉｖｅｓｐａｃｅ）．Ｍｎ...