Polynomial splittings of metabelian von Neumann rho-invariants of knots

We show that if the connected sum of two knots with coprime Alexander polynomials has vanishing von Neumann -invariants associated with certain metabelian representations, then so do both knots. As an application, we give a new example of an infinite family of knots which are linearly independent in the knot concordance group.

     

Slice knots with distinct Ozsváth-Szabó and Rasmussen invariants

As proved by Hedden and Ording, there exist knots for which the Ozsváth-Szabó and Rasmussen smooth concordance invariants, and , differ. The Hedden-Ording examples have nontrivial Alexander polynomials and are not topologically slice. It is shown in this note that a simple manipulation of the Hedden-Ording examples yields a topologically slice Alexander polynomial one knot for which and differ. Manolescu and Owens have previously found a concordance invariant that is independent of both and on knots of polynomial one, and as a consequence have shown that the smooth concordance group of topologically slice knots contains a summand isomorphic to . It thus follows quickly from the observation in this note that this concordance group contains a summand isomorphic to .

     

A Characterization of the Tutte Polynomial via Combinatorial Embeddings

We give a new characterization of the Tutte polynomial of graphs. Our characterization is formally close (but inequivalent) to the original definition given by Tutte as the generating function of spanning trees counted according to activities. Tutte’s notion of activity requires a choice of a linear order on the edge set (though the generating function of the activities is, in fact, independent of this order). We define a new notion of activity, the embedding-activity, which requires a choice of a combinatorial embedding of the graph, that is, a cyclic order of the edges around each vertex. We prove that the Tutte polynomial equals the generating function of spanning trees counted according to embedding-activities. This generating function is, in fact, independent of the embedding. Received March 15, 2006     

Assessing the reliability of a nanocomponent using nanocrack growth

In nanoscience and nanotechnology, much attention has been given to the dual problem of designing nanocomponents with novel physical properties and how such nanocomponents can be fabricated. Receiving less attention has been the question of the nanocomponent's reliability; how does a nanocomponent fail and how long does a nanocomponent survive under typical operating conditions? High reliability is necessary to guarantee the advancement and utilization of nanocomponents due to the fact that they account for a high proportion of costs of newly designed nanosystems as well as multiscale systems. A nanocomponent is a component that is made of atoms, and its reliability is determined by these atoms. There are situations where it is hard or impossible to extract information from a nanocomponent about its relationship to its atoms. In this article, we assess the nanocomponent's reliability by using its physical properties. Specifically, it is known that nanocrack growth involves considerable statistical variability and such variability should be accounted for assessing growth. In this paper, we first provide a stochastic nanocrack growth model and then evaluate the reliability of a nanocomponent based on this model. Various properties of this model are obtained. We also evaluate the reliability of a nanocomponent under different assumptions on our proposed growth model. This paper is a modification of the extensive literature on modeling fatigue cracks in materials on a larger scale, applied to nanoscale where growth is not a function of cumulative stress on the component but related to the time to first exceedance of a threshold. Copyright © 2013 John Wiley & Sons, Ltd.     

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).     

Bayesian inference for Pr (Y

《Applied Mathematical Modelling》2014,38(5-6):1698-1709

风电场可靠性模型及其应用

考虑了风速分布的季节性差异和风速的随机变化的影响、风电机组的实际功率特性、风电场尾流效应以及风电机组故障状况,建立了风电场可靠性模型.根据某海上风电场实测数据进行数值仿真实验,结果验证了模型的正确性和有效性.模型为进一步研究大规模风电并网以及风电场功率预测等问题打下了基础.