希尔伯特变换器优化设计研究

提出了一种基于神经网络算法的希尔伯特变换器优化设计方法，证明了神经网络算法的收敛性，提出了希尔伯特变换器的优化设计实例。仿真结果表明了该网络模型是高效的神经网络模型。     

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     

谈旧桥加固和桥梁病害处理技术

根据山西省现有公路和桥梁状况，为恢复和提高旧桥的承载能力及通过能力，延长桥梁使用寿命，迫切需要进行评价和加固改造。     

大学《现代教育技术》课程教学中探究式学习模式的应用与思考

本文从探究式学习的定义和特征出发,反对不分教学对象差异的"唯探究主义",在大学《现代教育技术》课程的教学中倡导面向全体学生,开展多样化的探究式学习。这就要求在教学过程中,辩证地处理学生自主与教师指导的关系,强调教师与学生的相互倾听,珍视探究中学生的个人观念、独特感受和体验,并引导学生积极反思。     

模糊Riemann-Stieltjes积分的收敛定理

模糊Riemann-Stieltjes积分是模糊分析中的一类重要的模糊积分,但相应的积分序列的收敛定理尚未见到.将给出模糊数值函数列关于实函数和模糊数值函数关于实函数列的两类模糊Riemann-Stiehjes积分序列的收敛定理.     

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.