Approximation of titration curves and other sigmoidal functions by proportionally spaced cubic B-splines

Proportionally spaced cubicB-splines are an appropriate function system for the approximation of titration curves and other sigmoidal functions. They give a smooth weighted leastsquares fit without instability problems. The degree of smoothing depends only on the number of spline function which can be chosen by the user. The equivalence points of titration curves can be estimated with high accuracy from the zeros of the second derivative.The method gives good approximation curves even in the case of empty data regions, i. e. there are no artefacts in subranges where no data points exist. The routine has been tested successfully with large series of simulated and experimental data.     

Diffusion-averaged molecular weights of «nonboiling» crude oil fractions

Summary The successful application of the formerly presented concept of diffusion-averaged molecular weight, M_d, to vacuum residues of crude oils, or their fractions, is described. The samples for establishing the calibration curve, logDvs. logM, were crude oil fractions with polydispersities smaller than 1.1. In a surprisingly good approximation the calibration curve is independent of the origin of these fractions if 500<M<10000. The validity of our calibration curve was demonstrated with more than 10 crude oil residues and with some of their hydrogenation residues [2].     

Ternary surface complexes by theE(%)-pH curve method

A new method for the study of ternary surface complexes at liquid-solid interface, theE(%) -pH curve method, was proposed. Four types ofE(%)-pH curves, namely, phenomenon of left-right shifts of S-shaped curve, V-shaped curve, monodirection shift curve and X-shaped curve, were discovered. Correspondingly, apart from type (I) ternary surface complex and type (II) ternary surface complex , a new type of ternary surface complex was discovered. Project supported by the National Natural Science Foundation of China and the Fund of Doctoral Degree’s Spot.     

Asymptotics of Christoffel functions on arcs and curves

For a system of smooth Jordan curves and arcs asymptotics for Christoffel functions is established. A separate new method is developed to handle the upper and lower estimates. In the course to the upper bound a theorem of Widom on the norm of Chebyshev polynomials is generalized.     

Approximating Pareto curves using semidefinite relaxations

We approximate as closely as desired the Pareto curve associated with bicriteria polynomial optimization problems. We use three formulations (including the weighted sum approach and the Chebyshev approximation) and each of them is viewed as a parametric polynomial optimization problem. For each case is associated a hierarchy of semidefinite relaxations and from an optimal solution of each relaxation one approximates the Pareto curve by solving an inverse problem (first two cases) or by building a polynomial underestimator (third case).     

云计算在RSA密码体制分析中的应用

RSA是著名的公钥密码体制之一,其安全性是基于大整数因子分解困难性假设的,求解RSA问题的最直接方法是分解RSA的模数.由于云计算的大规模分布式计算能力,一些使用分布式计算模型MapReduce的大整数分解手段已经实现,针对大整数因子分解的问题,提出了给定范围内搜索因子的新方法,并对相应的实验数据和结果进行了分析.结果表明,在云中的分布式计算的运行时间远小于单台机器.     

Statistical Computations on Biological Rhythms I: Dissecting Variable Cycles and Computing Signature Phases in Activity-Event Time Series

We propose a computational methodology to compute and extract circadian rhythmic patterns from an individual animal’s activity-event time series. This lengthy dataset, composed of a sequential event history, contains an unknown number of latent rhythmic cycles of varying duration and missing waveform information. Our computations aim at identifying the onset signature phase which individually indicates a sharp event intensity surge, where a subject-night ends and a brand new cycle’s subject-day begins, and collectively induces a linearity manifesting the individual circadian rhythmicity and information about the average period. Based on the induced linearity, the least squares criterion is employed to choose an optimal sequence of computed onset signature phases among a finite collection derived from the hierarchical factor segmentation (HFS) algorithm. The multiple levels of coding schemes in the HFS algorithm are designed to extract contrasting patterns of aggregation against sparsity of activity events along the entire temporal axis. This optimal sequence dissects the whole time series into a sequence of rhythmic cycles without model assumptions or ad hoc behavioral definitions regarding the missing waveform information. The performance of our methodology is favorably compared with two popular approaches based on the periodogram in a simulation study and in real data analyses. The computer code and data used in this article are available on the JCGS webpage.     

Real Hypersurfaces Having Many Pseudo-hyperplanes

Abstract

Let nand dbe natural integers satisfying n ≥ 3 and d ≥ 10. Let Xbe an irreducible real hypersurface Xin ? ⁿ of degree dhaving many pseudo-hyperplanes. Suppose that Xis not a projective cone. We show that the arrangement ? of all d ? 2 pseudo-hyperplanes of Xis trivial, i.e., there is a real projective linear subspace Lof ? ⁿ (?) of dimension n ? 2 such that L ? Hfor all H ∈ ?. As a consequence, the normalization of Xis fibered over ?¹in quadrics. Both statements are in sharp contrast with the case n = 2; the first statement also shows that there is no Brusotti-type result for hypersurfaces in ? ⁿ , for n ≥ 3.     

Universal Alignment Probabilities and Subset Selection for Ordinal Optimization

We examine in this paper the subset selection procedure in the context of ordinal optimization introduced in Ref. 1. Major concepts including goal softening, selection subset, alignment probability, and ordered performance curve are formally introduced. A two-parameter model is devised to calculate alignment probabilities for a wide range of cases using two different selection rules: blind pick and horse race. Our major result includes the suggestion of quantifiable subset selection sizes which are universally applicable to many simulation and modeling problems, as demonstrated by the examples in this paper.