三维荧光二阶校正测定细胞培养基样中山姜素

建立了细胞培养基样中山姜素的定量测定方法.将三维激发发射荧光分别与化学计量学中基于平行因子分析(PARAFAC)算法和自加权交替三线性分解(SWATLD)算法的二阶校正方法相结合,当选取待分析体系组分数为2时,得到细胞培养基样中山姜素的平均回收率分别为(100.3±2.2)%,(100.1±2.2)%.两种算法所得检出限各为0.182 3μg.mL-1,0.178 1μg.mL-1.椭圆置信区间(EJCR)测试证明两种算法所得结果准确可靠.

Near Crack Line Elastic-Plastic Analysis for an Infinite Plate Loaded by a Pair of Point Shear Forces

The near crack line analysis method was used to investigate a crack loaded by a pair of point shear forces in an infinite plate in an elastic-perfectly plastic solid. The analytical solution was obtained, that is the elastic-plastic fields near crack line and law that the length of the plastic zone along the crack line is varied with external loads. The results are sufficiently precise near the crack line and are not confined by small scale yielding conditions.

Applications of texture attribute analysis to seismic interpretation

The first generation coherence algorithm(namely C1 algorithm) is based on the statistical cross-correlation theory, which calculates the coherency of seismic data along both in-line and cross-line. The work, based on texture technique, makes full use of seismic information in different directions and the difference of multi-traces, and proposes a novel methodology named the texture coherence algorithm for seismic reservoir characterization, for short TEC algorithm. Besides, in-line and cross-line directions, it also calculates seismic coherency in 45° and 135° directions deviating from in-line. First, we clearly propose an optimization method and a criterion which structure graylevel co-occurrence matrix parameters in TEC algorithm. Furthermore, the matrix to measure the difference between multi-traces is constructed by texture technique, resulting in horizontal constraints of texture coherence attribute. Compared with the C1 algorithm, the TEC algorithm based on graylevel matrix is of the feature that is multi-direction information fusion and keeps the simplicity and high speed, even it is of multi-trace horizontal constraint, leading to significantly improved resolution. The practical application of the TEC algorithm shows that the TEC attribute is superior to both the C1 attribute and amplitude attribute in identifying faults and channels, and it is as successful as the third generation coherence.

A blind watermarking algorithm based on DWT and SVD

This paper presents a new digital image blind watermarking algorithm based on combination of discrete wavelet transform （DWT） and singular value decomposition （SVD）. First of all, we make wavelet decomposition for the original image and divide the acquired low frequency sub-band into blocks. Then we make singular value decomposition for each block and embed the watermark information in the largest singular value by quantitative method. The watermark can be extracted without the original image. The experimental results show that the algorithm has a good imperceptibility and robustness.

An Enhanced NEH Method in Solving Permutation Flow Shop Problem

This paper proposed an enhanced NEH with full insertion moves to solve the permutation flow shop problem.The characteristics of the original NEH are investigated and analyzed,and it is concluded that the given method would be promising to find better solutions,while the cost would be increased.Fast makespan calculating method and eliminating non-promising permutation policy are introduced to reduce the evaluation effort.The former decreases the time complexity from O(n4m) to O(n3m),which is an acceptable cost for medium and small size instances considering the obtained solution quality.The results from computational experience show that the latter also can eliminate a lot of non-promising solutions.

Novel Interaction Solutions to Kadomtsev-Petviashvili Equation

In this paper,based on the forms and structures of Wronskian solutions to soliton equations,a Wronskianform expansion method is presented to find a new class of interaction solutions to the Kadomtsev-Petviashvili equation.One characteristic of the method is that Wronskian entries do not satisfy linear partial differential equation.

Pyrolysis Characteristics and Kinetics of Municipal Solid Waste

Based on a systemic survey, the pyrolysis characteristics and apparent kinetics of the municipal solid waste （ MSW） under different conditions were researched using a special pyrolysis reactor, which could overcome the disadvantage of thermo-gravimetric analyzer. The thermal decomposition behaviour of MSW was investigated using thermo-gravimetric （ TG ） analysis at rates of 4.8,6.6,8.4, 12.0 and 13. 2 K/min. The pyrolysis characteristics of MSW were also studied in different function districts. The pyrolysis of MSW is a complex reaction process and three main stages are found according to the results. The first stage represents the degradation of cellulose and hemicellulose, with the maximum degradation rate occuring at 150℃ -200 ℃： the second stage represents dehydrochlorination and depolymerization of intermediate products and the differential thermogravimetric （ DTG ） curves have shoulder peaks at about 300℃： the third stage is the decomposition of the residual big molecular organic substance and lignin at 400 ℃- 600 ℃. Within the range of given experimental conditions, the results of non-linear fitting algorithm and experiment are in agreement with each other and the correlation coefficients are over0. 99. The kinetic characteristics are concerned with the material component and heating rate. The activation energy of reaction decreases with the increase of heating rate.

Exponential Attractors for the Ginzburg-Landau-BBM Equations

In this paper, the existence of the exponential attractors for the Ginzburg- Landau-BBM equations with periodic initial and boundary conditions are obtained by using the squeezing property and the operator dccomposition method.

An implicit algorithm based on iterative modified approximate factorization method coupling with characteristic boundary conditions for solving subsonic viscous flows

An algorithm composed of an iterative modified approximate factorization(MAF(k)) method with Navier-Stokes characteristic boundary conditions(NSCBC) is proposed for solving subsonic viscous flows.A transformation on the matrix equation in MAF(k) is made in order to impose the implicit boundary conditions properly.To be in consistent with the implicit solver for the interior domain,an implicit scheme for NSCBC is formulated.The performance of the developed algorithm is investigated using spatially evolving zero pressure gradient boundary layer over a flat plate and a wall jet mixing with a cross flow over a flat plate with a square hole as the test cases.The numerical results are compared to the existing experimental datasets and a number of general correlations,together with other available numerical solutions,which demonstrate that the developed algorithm possesses promising capacity for simulating the subsonic viscous flows with large CFL number.

An efficient algorithm for factoring polynomials over algebraic extension field

An efficient algorithm is proposed for factoring polynomials over an algebraic extension field defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its CrSbner basis, no extra Grbbner basis computation is needed for factoring a polynomial over this extension field. Nothing more than linear algebraic technique is used to get a characteristic polynomial of a generic linear map. Then this polynomial is factorized over the ground field. From its factors, the factorization of the polynomial over the extension field is obtained. The algorithm has been implemented in Magma and computer experiments indicate that it is very efficient, particularly for complicated examples.

Sparse bivariate polynomial factorization

Motivated by Sasaki＇s work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynomial over the rational number field. Another feature of the factorization algorithm presented in this article is a new recombination method, which can solve the extraneous factor problem before lifting based on numerical linear algebra. Both theoretical analysis and experimental data show that the algorithm is etIicient, especially for sparse bivariate polynomials.

MULTIPLICITY-PRESERVING TRIANGULAR SET DECOMPOSITION OF TWO POLYNOMIALS

In this paper, a multiplicity-preserving triangular set decomposition algorithm is proposed for a system of two polynomials, which involves only computing the primitive polynomial remainder sequence of two polynomials once and certain GCD computations. The algorithm decomposes the unmixed variety defined by two polynomials into square free and disjoint （for non-vertical components, see Definition 4） algebraic cycles represented by triangular sets which may have negative multiplicities. Thus, the authors can count the multiplicities of the non-vertical components. In the bivariate case, the amthors give a complete algorithm to decompose tile system into zeros represented by triangular sets with multiplicities. The authors also analyze the complexity of the algorithm in the bivariate ease. The authors implement the algorithm and show the effectiveness of the method with extensive experiments.

A manifold approach to generating iso-scallop trajectories in three-axis machining

A novel approach of iso-scallop trajectory generation for smooth manifold surfaces has been developed. Firstly,by defining homeomorphism mapping relations and differentiable structures,the smooth manifold surface is mapped into several Euclidean planes,thus its trajectory generation can be decomposed into planar curve-filling tasks. Secondly,in the generation of direction-parallel trajectories,the calculation of the cutting interval and the curvature is given,depending on the generation of the first curve in the projection view. Thirdly,after automatic adherences of inverse projection curves,the filled curves are mapped into the original surface inversely to form trajectories. Although the required trajectories are iso-scallop,the trajectory intervals are variable according to the curvature changes at the projection point,which is advantageous to improving the trajectory quality. The proposed approach has appealing merits of dimensionality reduction,which decreases the algorithm complexity. Finally,numerical and machining examples are given to illustrate its feasibility and validity.

Performance of CO-OFDM system with RS-Turbo concatenated code

In this paper,the RS-Turbo concatenated code is applied to coherent optical orthogonal frequency division multiplexing(CO-OFDM) system.RS(186,166,8) and Turbo code with code rate of 1/2 are employed for RS-Turbo concatenated code.Two decoding algorithms,which are Max-Log-MAP algorithm and Log-MAP algorithm,are adopted for Turbo decoding,and the iteration Berlekamp-Massey(BM) algorithm is adopted for RS decoding.The simulation results show that the bit error rate(BER) performance of CO-OFDM system with RS-Turbo concatenated code is significantly improved at high optical signal to noise ratio(OSNR),and the iteration number is reduced compared with that of the Turbo coded system.Furthermore,when the Max-Log-MAP algorithm is adopted for Turbo decoding,the transmission distance of CO-OFDM system with RS-Turbo concatenated code can reach about 400 km without error,while that of the Turbo coded system can only reach about 240 km when BER is lower than 10^(-4) order of magnitude.

Invariant Functions, Symmetries and Primary Branch Solutions of First Order Autonomous Systems

An invariant function （IF） is defined as a multiplier of a symmetry that means a symmetry multiplied by an IF is still a symmetry. Primary branch solutions of arbitrary first order scalar systems can be obtained by means of the IF and its related symmetry approach. Especially, one recursion operator and some sets of infinitely many high order symmetries are also explicitly given for arbitrary （l q-1）-dimensional first order autonomous systems. Because of the intrusion of the arbitrary function, various implicit special exact solutions can be found by fixing the arbitrary functions and selecting different seed solutions.