Simulation of Weld Depth in A-TIG Welding with Unified Arc-electrode model

Ｉｔｋｎｏｗｎｔｈａｔｓｍａｌｌａｍｏｕｎｔｓｏｆｆｌｕｘｏｎｔｈｅｓｕｒｆａｃｅｏｆｓｔａｉｎｌｅｓｓｓｔｅｅｌｃａｎｉｎｃｒｅａｓｅｔｈｅｄｅｐｔｈｏｆｗｅｌｄｐｅｎｅ ｔｒａｔｉｏｎｉｎＴＩＧｗｅｌｄｉｎｇｂｙａｆａｃｔｏｒｏｆｔｈｒｅｅ[1] .Ｔｈｉｓｐｒｏｃｅｓｓｉｓｒｅｆｅｒｒｅｄｔｏａｓ”ＡＴＩＧ”ｏｒＴＩＧｗｅｌｄｉｎｇａｃｔｉ ｖａｔｅｄｂｙｆｌｕｘ .Ｔｈｅｒｅｈａｖｅｂｅｅｎｔｈｒｅｅｐｕｂｌｉｓｈｅｄｐｈｙｓ ｉｃａｌｍｅｃｈａｎｉｓｍｓｔｈａｔａｒｅｐｏｓｓｉｂｌｅｃｏｎｔｒｉ…     

Ruin Probability with Variable Premium Rate and Disturbed by Diffusion in a Markovian Environment

We consider a risk model with a premium rate which varies with the level of free reserves. In this model, the occurrence of claims is described by a Cox process with Markov intensity process, and the influence of stochastic factors is considered by adding a diffusion process. The integro-differential equation for the ruin probability is derived by a infinitesimal method.     

STABILITY CRITERIA FOR A CLASS OF UNCERTAINSYSTEMS WITH TIME—DELAY

Some stability criteria are obtained for a class of uncertain systems with time-delay usingLyapunov functional and analytic techniques. It is easy to check the criteria by making use of theboundedness of the uncertainties.     

Technical Notes ：STUDIES ON THE VALUE OF SECONDARY MARKET TO THE SUPPLY CHAIN

This paper investigates the impact of a secondary market, where retailers can buy and sell excessinventories, on the supply chain. We develop a two-period model with a single manufacturer and tworetailers. At the beginning of the first period the retailers order and receive products from themanufacturer, but at the beginning of the second period, they can trade surplus products betweenthemselves in the secondary market. We investigate the impact of the correlated dependence ofretailers' demand on both the quantity effect and the allocation effect under the secondary market.Lastly,we study potential strategies for the manufacturer to increase sales with the existence of thesecondary market.     

FROM MANUFACTURING SCHEDULING TO SUPPLY CHAIN COORDINATION：THE CONTROL OF COMPLEXITY AND UNCERTAINTY

With time-based competition and rapid technology advancements, effective manufacturingscheduling and supply chain coordination are critical to quickly respond to changing marketconditions. These problems, however, are difficult in view of inherent complexity and variousuncertainties involved. Based on a series of results by the authors, decomposition and coordination byusing Lagrangian relaxation is identified in this paper as an effective way to control complexity anduncertainty.A manufacturing scheduling problem is first formulated within the job shop context withuncertain order arrivals, processing times, due dates, and part priorities as a separable optimizationproblem. A solution methodology that combines Lagrangian relaxation, stochastic dynamicprogramming, and heuristics is developed. Method improvements to effectively solve large problemsare also highlighted. To extend manufacturing scheduling within a factory to coordinate autonomicmembers across chains of suppliers, a decentralized supply chai     

固相红细胞凝集素（E—PHA）的制备及其应用

用江苏莱豆(Phaseolus vulgaris)E-PHA制备固相吸附剂。交联率87.7%。交联E-PHA量为0.59mg/cm~3胶,与肝癌血清γ-GT天冬酰胺连接的低聚糖的亲和反应,类似于进口同类产品。     

α—珠蛋白基因的PCR检测

用多对引物的复合ＰＣＲ技术，分别扩增α－珠蛋白基因族中α１和α２基因片段；参照β－珠蛋白基因ＰＣＲ扩增产物量，判断α１和α２基因是否正常，是否为缺失的纯合子或杂合子，对α－地中海贫血症先征者家系基因型进行ＰＣＲ分型诊断。     

PEAK COVARIANCE STABILITY OF A RANDOM RICCATI EQUATION ARISING FROM KALMAN FILTERING WITH OBSERVATION LOSSES

We consider the stability of a random Riccati equation with a Markovian binary jump coefficient. More specifically, we are concerned with the boundedness of the solution of a random Riccati difference equation arising from Kalman filtering with measurement losses. A sufficient condition for the peak covariance stability is obtained which has a simpler form and is shown to be less conservative in some cases than a very recent result in existing literature. Furthermore, we show that a known sufficient condition is also necessary when the observability index equals one.     

CONSTRUCTIVE KISSING NUMBERS IN HIGH-DIMENSIONAL SPACES

In the present paper, we focus on constructive spherical codes. By employing algebraic geometry codes, we give an explicit construction of spherical code sequences. By making use of the idea involved in the proof of the Gilbert-Varshamov bound in coding theory, we construct a spherical code sequence in exponential time which meets the best-known asymptotic bound by Shamsiev and Wyner.