无线传感器网络MAC层协议的对比研究

无线传感器网络是二十一世纪新兴的网络技术，它的出现使网络的发展进入一个新的阶段。针对无线传感器网络MAC层协议的研究一直是人们普遍关注的问题。总结了近年来的研究成果并针对TDMA，IEEE802．15．4，S—MAC，T—MAC几种典型的MAC层协议进行了对比分析，根据其各自的优点提出将来工作的方向和建议。     

具有时滞的细胞神经网络的全局指数稳定性

利用Liapunov函数方法,结合积分不等式技巧,分析了时滞细胞神经网络的平衡点存在的唯一性和全局指数稳定性,保证时滞细胞神经网络全局指数稳定的一个新的充分判据被得到.所得判据比已有文献具有更少的限制,为实际应用提供了方便.     

二维光电位置敏感器件的非线性修正

根据二维光电位置敏感器件 (PSD)的工作原理 ,分析了影响PSD线性度的主要因素 ,提出了一种用神经网络对PSD进行非线性修正的方法。以PSD的输入输出数据对作为样本训练的神经网络 ,利用神经网络所具有地能够以任意精度逼近非线性函数的能力 ,实现PSD的输出与实际光点位置之间的映射 ,在神经网络的输出端得到线性响应。该方法的优点是不需要很大的数据存储量即可得到很好的修正效果。结果表明 ,修正后的PSD能在较宽的位置范围内输出高线性度的信号     

多时滞随机神经网络的稳定性

通过构建李雅普偌夫函数的方法和利用半鞅收敛定理对一类随机时滞神经网络的全局指数稳定进行了分析,提出了易于判定随机时滞神经网络几乎必然指数稳定性新的代数判据,推广了[1]中的主要结论.     

现代优化计算方法在蛋白质结构预测中的应用

现代优化计算方法在蛋白质结构预测中占有重要地位.简要地介绍了模拟退火算法,遗传算法,人工神经网络和图论算法在蛋白质结构预测中的应用.对国内外近年来应用这些算法,特别是在蛋白质构象搜索问题中,解决蛋白质结构预测的研究作了回顾,并分析、比较了这几种算法的效果和特点.     

Non-Parametric Regression Methods

The nature of the financial time series is complex, continuous interchange of stochastic and deterministic regimes. Therefore, it is difficult to forecast with parametric techniques. Instead of parametric models, we propose three techniques and compare with each other. Neural networks and support vector regression (SVR) are two universally approximators. They are data-driven non parametric models. ARCH/GARCH models are also investigated. Our assumption is that the future value of Istanbul Stock Exchange 100 index daily return depends on the financial indicators although there is no known parametric model to explain this relationship. This relationship comes from the technical analysis. Comparison shows that the multi layer perceptron networks overperform the SVR and time series model (GARCH).     

A fluid system with coupled input and output,and its application to bottlenecks in ad hoc networks

This paper studies a fluid queue with coupled input and output. Flows arrive according to a Poisson process, and when n flows are present, each of them transmits traffic into the queue at a rate c/(n+1), where the remaining c/(n+1) is used to serve the queue. We assume exponentially distributed flow sizes, so that the queue under consideration can be regarded as a system with Markov fluid input. The rationale behind studying this queue lies in ad hoc networks: bottleneck links have roughly this type of sharing policy. We consider four performance metrics: (i) the stationary workload of the queue, (ii) the queueing delay, i.e., the delay of a ‘packet’ (a fluid particle) that arrives at the queue at an arbitrary point in time, (iii) the flow transfer delay, i.e., the time elapsed between arrival of a flow and the epoch that all its traffic has been put into the queue, and (iv) the sojourn time, i.e., the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. For each of these random variables we compute the Laplace transform. The corresponding tail probabilities decay exponentially, as is shown by a large-deviations analysis. F. Roijers’ work has been carried out partly in the SENTER-NOVEM funded project Easy Wireless.     

Performance analysis of IEEE 802.11 ad hoc networks in the presence of exposed terminals

The paper evaluates the performance effects of exposed terminals in IEEE 802.11 ad hoc networks in finite load conditions. It derives analytical models for the estimation of channel utilization and media access delay for IEEE 802.11 ad hoc networks in finite load conditions with and without exposed terminals. The simulation results show that the analytical estimated channel utilization and media access delay metrics are fairly accurate.     

Identifying Linking-Pin Organizations in Inter-Organizational Networks

Within the large literature on inter-organizational networks, there has been some discussion of linking-pin organizations and the role they play in integrating these networks. Based on this verbal specification of linking-pin organizations, we construct operational criteria and empirical methods for identifying these structurally important organizations in potentially large and complex inter-organizational networks. These methods are based on ideas drawn from blockmodeling, structural holes, centrality and centralization of networks, and identifying cut-points in networks. These methods are applied to a constructed example and then to real empirical inter-organizational networks. Implications and contrasts with other methods are discussed, together with some open problems.     

A model of fads,fashions, and group formation

I develop a model of consumer behavior where agents purchase goods in order to signify personal characteristics. Agents purchase goods in order to imitate agents similar to them and agents they want to emulate. Depending on parameter values of consumer preferences the model generates stable groups, fads, and fashion cycles, or a mixture of both. The model is unique to the economic literature on fads in that the extinction of fads occurs endogenously in the model. © 2004 Wiley Periodicals, Inc. Complexity 9: 51–61, 2004