Radiation effects on the immiscible polymer blend of nylon1010 and high-impact polystyrene (HIPS) I: Gel/dose curves, mathematical expectation theorem and thermal behaviour

This paper studies the radiation properties of the immiscible blend of nylon1010 and HIPS. The gel fraction increased with increasing radiation dose. The network was found mostly in nylon1010, the networks were also found in both nylon1010 and HIPS when the dose reaches 0.85 MGy or more. We used the Charleby-Pinner equation and the modified Zhang-Sun-Qian equation to simulate the relationship with the dose and the sol fraction. The latter equation fits well with these polymer blends and the relationship used by it showed better linearity than the one by the Charleby-Pinner equation. We also studied the conditions of formation of the network by the mathematical expectation theorem for the binary system. Thermal properties of polymer blend were observed by DSC curves. The crystallization temperature decreases with increasing dose because the cross-linking reaction inhibited the crystallization procession and destroyed the crystals. The melting temperature also reduced with increasing radiation dose. The dual melting peak gradually shifted to single peak and the high melting peak disappeared at high radiation dose. However, the radiation-induced crystallization was observed by the heat of fusion increasing at low radiation dose. On the other hand, the crystal will be damaged by radiation. A similar conclusion may be drawn by the DSC traces when the polymer blends were crystallized. When the radiation dose increases, the heat of fusion reduces dramatically and so does the heat of crystallization. (C) 1999 Elsevier Science Ltd. All rights reserved.

A QUASI-SIMPLEX METHOD FOR STRICTLY CONVEX QUADRATIC PROGRAMMING

本文提出一个不用 Kuhn- Tucker条件而直接搜索严格凸二次规划最优目标点的鲁棒方法 .在搜索过程中 ,目标点沿约束多面体边界上的一条折线移动 .这种移动目标点的思想可以被认为是线性规划单纯形法的自然推广 ,在单纯形法中 ,目标点从一个顶点移到另一个顶点。

Bézier曲线间最近距离的计算方法

针对Bzier曲线间最近距离计算问题,提出一种简捷、可靠的计算方法.该方法以Bernstein多项式算术运算为工具,建立Bzier曲线间最近距离的计算模型;然后充分利用Bzier曲面的凸包性质和de Casteljau分割算法进行求解.该方法几何意义明确,能有效地避免迭代初始值的选择和非线性方程组的求解,并可进一步推广应用于计算Bzier曲线/曲面间的最近距离.实验结果表明,该方法简捷、可靠且容易实现,与Newton-Raphson方法的融合可进一步提高该方法的运行速度.

Extracting Salient Curves from Images: An Analysis of the Saliency Network

The Saliency Network proposed by Shashua and Ullman is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This paper analyzes the Saliency Network. The Saliency Network is attractive for several reasons. First, the network generally prefers long and smooth curves over short or wiggly ones. While computing saliencies, the network also fills in gaps with smooth completions and tolerates noise. Finally, the network is locally connected, and its size is proportional to the size of the image. Nevertheless, our analysis reveals certain weaknesses with the method. In particular, we show cases in which the most salient element does not lie on the perceptually most salient curve. Furthermore, in some cases the saliency measure changes its preferences when curves are scaled uniformly. Also, we show that for certain fragmented curves the measure prefers large gaps over a few small gaps of the same total size. In addition, we analyze the time complexity required by the method. We show that the number of steps required for convergence in serial implementations is quadratic in the size of the network, and in parallel implementations is linear in the size of the network. We discuss problems due to coarse sampling of the range of possible orientations. We show that with proper sampling the complexity of the network becomes cubic in the size of the network. Finally, we consider the possibility of using the Saliency Network for grouping. We show that the Saliency Network recovers the most salient curve efficiently, but it has problems with identifying any salient curve other than the most salient one.

On the Behavior of the Homogeneous Self-Dual Model for Conic Convex Optimization

There is a natural norm associated with a starting point of the homogeneous self-dual (HSD) embedding model for conic convex optimization. In this norm two measures of the HSD model’s behavior are precisely controlled independent of the problem instance: (i) the sizes of ε-optimal solutions, and (ii) the maximum distance of ε-optimal solutions to the boundary of the cone of the HSD variables. This norm is also useful in developing a stopping-rule theory for HSD-based interior-point methods such as SeDuMi. Under mild assumptions, we show that a standard stopping rule implicitly involves the sum of the sizes of the ε-optimal primal and dual solutions, as well as the size of the initial primal and dual infeasibility residuals. This theory suggests possible criteria for developing starting points for the homogeneous self-dual model that might improve the resulting solution time in practice

Mid-Level Vision and Recognition of Non-Rigid Objects

We address mid-level vision for the recognition of non-rigid objects. We align model and image using frame curves - which are object or "figure/ground" skeletons. Frame curves are computed, without discontinuities, using Curved Inertia Frames, a provably global scheme implemented on the Connection Machine, based on: non-cartisean networks; a definition of curved axis of inertia; and a ridge detector. I present evidence against frame alignment in human perception. This suggests: frame curves have a role in figure/ground segregation and in fuzzy boundaries; their outside/near/top/ incoming regions are more salient; and that perception begins by setting a reference frame (prior to early vision), and proceeds by processing convex structures.

Automatic Qualitative Analysis of Ordinary Differential Equations Using Piecewise Linear Approximations

This paper explores automating the qualitative analysis of physical systems. It describes a program, called PLR, that takes parameterized ordinary differential equations as input and produces a qualitative description of the solutions for all initial values. PLR approximates intractable nonlinear systems with piecewise linear ones, analyzes the approximations, and draws conclusions about the original systems. It chooses approximations that are accurate enough to reproduce the essential properties of their nonlinear prototypes, yet simple enough to be analyzed completely and efficiently. It derives additional properties, such as boundedness or periodicity, by theoretical methods. I demonstrate PLR on several common nonlinear systems and on published examples from mechanical engineering.

Winkler springs (p-y curves) for liquefied soil from element tests.

In practice, piles are most often modelled as "Beams on Non-Linear Winkler Foundation" (also known as “p-y spring” approach) where the soil is idealised as p-y springs. These p-y springs are obtained through semi-empirical approach using element test results of the soil. For liquefied soil, a reduction factor (often termed as p-multiplier approach) is applied on a standard p-y curve for the non-liquefied condition to obtain the p-y curve liquefied soil condition. This paper presents a methodology to obtain p-y curves for liquefied soil based on element testing of liquefied soil considering physically plausible mechanisms. Validation of the proposed p-y curves is carried out through the back analysis of physical model tests.

The Dirichlet problem in convex bounded domains for operators with L^\infty-coefficients

M.Hieber, I.Wood: The Dirichlet problem in convex bounded domains for operators with L^\infty-coefficients, Diff. Int. Eq., 20, 7 (2007),721-734.

Scattering poles near the real axis for two strictly convex obstacles

Iantchenko, A., (2007) 'Scattering poles near the real axis for two strictly convex obstacles', Annales of the Institute Henri Poincar? 8 pp.513-568 RAE2008

The Dirichlet problem in convex bounded domains for operators with L8-coefficients

Wood, Ian; Hieber, M., (2007) 'The Dirichlet problem in convex bounded domains for operators with L8-coefficients', Differential and Integral Equations 20 pp.721-734 RAE2008

Piecewise Linear Models for the Quasiperiodic Transition to Chaos

We formulate and study analytically and computationally two families of piecewise linear degree one circle maps. These families offer the rare advantage of being non-trivial but essentially solvable models for the phenomenon of mode-locking and the quasi-periodic transition to chaos. For instance, for these families, we obtain complete solutions to several questions still largely unanswered for families of smooth circle maps. Our main results describe (1) the sets of maps in these families having some prescribed rotation interval; (2) the boundaries between zero and positive topological entropy and between zero length and non-zero length rotation interval; and (3) the structure and bifurcations of the attractors in one of these families. We discuss the interpretation of these maps as low-order spline approximations to the classic ``sine-circle'' map and examine more generally the implications of our results for the case of smooth circle maps. We also mention a possible connection to recent experiments on models of a driven Josephson junction.

Maximum curves and isolated points of entire functions

Given M(r; f) =maxjzj=r (jf(z)j) , curves belonging to the set of points M = fz : jf(z)j = M(jzj; f)g were de�ned by Hardy to be maximum curves. Clunie asked the question as to whether the set M could also contain isolated points. This paper shows that maximum curves consist of analytic arcs and determines a necessary condition for such curves to intersect. Given two entire functions f1(z) and f2(z), if the maximum curve of f1(z) is the real axis, conditions are found so that the real axis is also a maximum curve for the product function f1(z)f2(z). By means of these results an entire function of in�nite order is constructed for which the set M has an in�nite number of isolated points. A polynomial is also constructed with an isolated point.