超深亚微米信号串扰分析

芯片设计进入深亚微米后,互连线效应(主要是信号串扰)对集成电路的影响越来越大。该文针对这种影响进行了分析,讨论了在不考虑耦合电容和考虑耦合电容的两种情况下噪声产生机理,建立了一个耦合电容分析模型,得出了噪声产生的原因,并提出了解决噪声的策略。根据设计实例并结合建立的模型,提出了实际芯片设计中有效地控制串扰的方法,取得了良好的效果。     

光纤扭转对循环延迟线偏振控制系统特性影响的研究

借助模式耦合理论和矩阵光学的知识,对引入光纤扭转机构后的延迟线偏振控制系统的偏振转换特性进行了分析,推导出了描述该系统偏振特性的琼斯矩阵,得到了光纤扭转对系统偏振特性影响的理论模型。     

一类非线性时滞微分方程的振动性

讨论了非线性时滞微分方程Ｈ（ｔ，ｘ（ｔ），ｘ（ｔ—ｒ）＋ｆ（ｔ，ｘ（ｔ—τ））—ｇ（ｘ（ｔ—σ））＝０的振动性，推广了有关文献的部分结果．     

连续时延神经网络的Hopf分岔现象研究

讨论了带连续时延神经网络的Hopf分岔现象。对于强核和弱核的情况,利用平均时延作为分岔参数,证明了模型经历了Hopf分岔过程。在带弱核的神经网络模型中,得到了分岔周期解稳定性准则。给出了一些数值例子,通过计算机仿真验证了所得结论的正确性。     

具有变系数的可分离变量系统的稳定性

通过构造李雅普诺夫函数研究了一类系数可以是无界的具有变系数的可分离变量系统的稳定性,以及带时滞系统的稳定性.并获得了一些简单的判据。     

延迟支付条件下易逝品的最优订货决策研究

本文在考虑延期支付的情况下构建了二级供应链关于易逝品的最优订货决策模型,其中供应链由单个供应商和多个面临资金约束的零售商组成。在不允许缺货的情况下,供应商为零售商提供延迟支付来缓解零售商的资金压力,同时零售商对产品的定价将随易逝品的价值变质而变化。本文利用遗传算法对模型进行了算例分析,同时对模型中的相关参数进行了敏感性分析。结果表明,延迟支付能够提高供应链总利润并降低风险,从而有利于供应链整体效益的提高。在延期支付条件下,供应链各成员获得的收益增量存在较大差距,其中供应商能够获得更多收益。最后,通过敏感性分析,我们还发现产量及易逝品保质期的变动会对供应链整体利润产生不同程度的影响。     

Consumer trust repair: A critical literature review

Consumers are fundamental to organisational functioning and survival. Their loyalty, commitment, product acceptance and good long-term relationships with firms and brands are underpinned by their trust. Unfortunately, over the last decade or so, we have witnessed some of the more spectacular violations of consumer trust in the history of business. This has led to negative consequences, such as loss of competitive advantage, rage, lack of commitment and decrease in turnover. Consequently, study of trust repair has become an important theoretical concern for a growing number of trust scholars. This article reviews and synthesises existing theory and research on the topic. It first sketches general characteristics of the consumer trust repair literature, including its meta-theoretical underpinning. It then identifies specific strategies associated with consumer trust repair and synthesises them into five categories of trust repair strategies. In addition, this paper highlights theoretical processes that explain why/how trust repair strategies work. Third, the paper proposes six fruitful avenues for future research. This study contributes to the field of consumer trust repair research by critically reviewing and synthesising emerging theory and research on strategies associated with consumer trust repair, by showing why and how these strategies work and by identifying most fruitful research areas.     

《孟子》释读辨误(四则)

传统经典须细读，在细读的基础上领会真义。历代注家对《孟子》的注疏多有误读之处，如"攘"，本义为"取自来之物"，经"多少同盗"，演变为"攘"即"盗"；"巨室"初谓国君住的大房子，这里当喻指国君，但注家多强解为指大臣；舜在"完廪""浚井"的过程中是如何脱难的，本文没有说，注家依据其他材料做了合理化解读，未必符合本义。"坏宫室以为汙池"，如从人类社会发展史的角度来释读，实际上是要维持以渔猎为生的生存方式。致误的根源有"非黑即白"的思维方式、前后矛盾、对古代"不雅驯"的文字进行改造等。     

A diagnostic statistic for functional-coefficient autoregressive models

In this paper, functional coefficient autoregressive (FAR) models proposed by Chen and Tsay (1993) are considered. We propose a diagnostic statistic for FAR models constructed by comparing between parametric and nonparametric estimators of the functional form of the FAR models. We show asymptotic properties of our statistic mathematically and it can be applied to the estimation of the delay parameter and the specification of the functional form of FAR models.     

Throughput and delay analysis of an opportunistic tree algorithm

Tree algorithms are a well-known class of random access algorithms with a provable maximum stable throughput under the infinite population model (as opposed to ALOHA or the binary exponential backoff algorithm). In this article, we propose a tree algorithm for opportunistic spectrum usage in cognitive radio networks. A channel in such a network is shared among so-called primary and secondary users, where the secondary users are allowed to use the channel only if there is no primary user activity. The tree algorithm designed in this article can be used by the secondary users to share the channel capacity left by the primary users.

We analyze the maximum stable throughput and mean packet delay of the secondary users by developing a tree structured Quasi-Birth Death Markov chain under the assumption that the primary user activity can be modeled by means of a finite state Markov chain and that packets lengths follow a discrete phase-type distribution.

Numerical experiments provide insight on the effect of various system parameters and indicate that the proposed algorithm is able to make good use of the bandwidth left by the primary users.