A survey of surface tension,molar volume and density for Sn–Ag–Cu–Bi–Sb quinary alloys as lead-free solders

ABSTRACT

By applying the geometric models and the theoretical equation, the surface tension, the molar volume and the density were studied. The empirical calculations were carried out in temperature range 623?K?≤?T?≤?1123?K. Only few thermophysical properties were estimated for eight quinary alloys: Sn3.55Ag0.5Cu3Bi3Sb, Sn3.48Ag0.5Cu3Bi5Sb, Sn3.48 Ag0.5Cu5Bi3Sb, Sn3.40 Ag0.5Cu5Bi5Sb, Sn3.53Ag1Cu3Bi3Sb, Sn3.46Ag1Cu3Bi5Sb, Sn3.46Ag1Cu5Bi3Sb, Sn3.38Ag1Cu5Bi5Sb. The results show that surface tension and density have a linear appearance for all temperatures. We have also studied the influence of the composition and temperature in the studied alloys. The obtained theoretical results are compared with the experimental ones and with the conventional Pb–Sn welds.     

On Potentially Abelian Geometric Representations

The finiteness is proved of the set of isomorphism classes of potentially abelian geometric Galois representations with a given set of data. This is a special case of the finiteness conjecture of Fontaine and Mazur.     

THE RELATIONSHIP BETWEEN PROJECTIVE GEOMETRIC AND RATIONAL QUADRATIC B-SPLINE CURVES

For two rational quadratic B-spline curves with same control vertexes, the cross ratio of four eollinear points are represented; which are any one of the vertexes, and the two points that the ray initialing from the vertex intersects with the corresponding segments of the twocurves, and the point the ray intersecting with the connecting line between the two neighboring vertexes. Different from rational quadratic Beeier curves, the value is generally related with the loeation of the ray, and the necessary and sufficient condition o5 the ratio being independent of the ray‘s loeation is showed. Alsn another cross ratio o5 the following four collinear points are suggested, i.e. one vertex, the points that the ray from the initlal vertex intersects respectivdy with the curve segmentt the line connecting the segments end points, and the line connecting the two neighboring vertexes. This cross ratio is concerned only whh the ray‘s location, butnot with the weights of the curve. Furthermore, the cross ratio is projective invariant under the projective transformation between the two segments.     

A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T,M,S)-Nets of Low Strength

The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.     

How to Build Robust Shared Control Systems

Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes.     

Harmonic Calculus on Fractals - A Measure Geometric Approach I

Differentiation of functions w.r.t. finite atomless measures with compact support on the real line is introduced. The related harmonic calculus is similar to that of the classical Lebesgue case. As an application we obtain the Weyl exponent for the spectral asymptotics of the Laplacians w.r.t. linear Cantor-type measures with arbitrary weights.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

证券价格按几何布朗运动变化的微观解释

金融市场研究中经常不加解释地假设证券价格按几何布朗运动变化 .本文通过假定投资者要求来自证券的期望收益率与证券价格无关 ,在理想市场的前提条件下 ,对证券价格运动将遵循有漂移率的几何布朗运动给予严格的证明 .     

计算机画法几何的研究与应用

以AutoCAD2000i为图形支撑平台，构建一种计算机辅助画法几何方法以直观、精确、高效地求解三维空间几何度量与定位问题，该方法适合于传统画法几何求解，也可用于曲柄滑块机构的行程、运动轨迹等内容的设计。