Time delay as a key to apoptosis induction in the p53 network

A feedback mechanism that involves the proteins p53 and mdm2, induces cell death as a controlled response to severe DNA damage. A minimal model for this mechanism demonstrates that the response may be dynamic and connected with the time needed to translate the mdm2 protein. The response takes place if the dissociation constant k between p53 and mdm2 varies from its normal value. Although it is widely believed that it is an increase in k that triggers the response, we show that the experimental behaviour is better described by a decrease in the dissociation constant. The response is quite robust upon changes in the parameters of the system, as required by any control mechanism, except for few weak points, which could be connected with the onset of cancer. Received 8 May 2002 / Received in final form 9 July 2002 Published online 17 September 2002     

模糊对向传播网络数据融合目标识别方法

重点研究了模糊对向传播网络 (FCPN)模型。针对数据融合和目标识别的特点 ,提出了基于模糊对向传播网络的融合目标识别方法和改进的模糊对向传播网络 (MFCPN)融合结构。利用仿真数据对网络的训练算法和融合结构进行了实验研究。结果表明 ,模糊对向传播网络较误差后向传播网络 (BPN)能够有效地实现融合识别 ;改进的模糊对向传播网络融合结构是可行的。同时还对FCPN和MFCPN应用于前视红外 (FLIR)和可见光摄像机目标跟踪系统进行了应用研究。     

Controlling an oscillating Jackson-type network having state-dependent service rates

We consider a Jackson-type network comprised of two queues having state-dependent service rates, in which the queue lengths evolve periodically, exhibiting noisy cycles. To reduce this noise a certain heuristic, utilizing regions in the phase space in which the system behaves almost deterministically, is applied. Using this heuristic, we show that in order to decrease the probability of a customers overflow in one of the queues in the network, the server in that same queue – contrary to intuition – should be shut down for a short period of time. Further noise reduction is obtained if the server in the second queue is briefly shut down as well, when certain conditions hold.     

Time Series Prediction Based on Chaotic Attractor

A new prediction technique is proposed for chaotic time series. The usefulness of the technique is thatit can kick off some false neighbor points which are not suitable for the local estimation of the dynamics systems. Atime-delayed embedding is used to reconstruct the underlying attractor, and the prediction model is based on the timeevolution of the topological neighboring in the phase space. We use a feedforward neural network to approximate thelocal dominant Lyapunov exponent, and choose the spatial neighbors by the Lyapunov exponent. The model is testedfor the Mackey-Glass equation and the convection amplitude of lorenz systems. The results indicate that this predictiontechnique can improve the prediction of chaotic time series.     

On effectiveness of wiretap programs in mapping social networks

Snowball sampling methods are known to be a biased toward highly connected actors and consequently produce core-periphery networks when these may not necessarily be present. This leads to a biased perception of the underlying network which can have negative policy consequences, as in the identification of terrorist networks. When snowball sampling is used, the potential overload of the information collection system is a distinct problem due to the exponential growth of the number of suspects to be monitored. In this paper, we focus on evaluating the effectiveness of a wiretapping program in terms of its ability to map the rapidly evolving networks within a covert organization. By running a series of simulation-based experiments, we are able to evaluate a broad spectrum of information gathering regimes based on a consistent set of criteria. We conclude by proposing a set of information gathering programs that achieve higher effectiveness then snowball sampling, and at a lower cost. Maksim Tsvetovat is an Assistant Professor at the Center for Social Complexity and department of Public and International Affairs at George Mason University, Fairfax, VA. He received his Ph.D. from the Computation, Organizations and Society program in the School of Computer Science, Carnegie Mellon University. His dissertation was centered on use of artificial intelligence techniques such as planning and semantic reasoning as a means of studying behavior and evolution of complex social networks, such as these of terrorist organizations. He received a Master of Science degree from University of Minnesota with a specialization in Artificial Intelligence and design of Multi-Agent Systems, and has also extensively studied organization theory and social science research methods. His research is centered on building high-fidelity simulations of social and organizational systems using concepts from distributed artificial intelligence and multi-agent systems. Other projects focus on social network analysis for mapping of internal corporate networks or study of covert and terrorist orgnaizations. Maksim’s vita and publications can be found on Kathleen M. Carley is a professor in the School of Computer Science at Carnegie Mellon University and the director of the center for Compuational Analysis of Social and Organizational Systems (CASOS) which has over 25 members, both students and research staff. Her research combines cognitive science, social networks and computer science to address complex social and organizational problems. Her specific research areas are dynamic network analysis, computational social and organization theory, adaptation and evolution, text mining, and the impact of telecommunication technologies and policy on communication, information diffusion, disease contagion and response within and among groups particularly in disaster or crisis situations. She and her lab have developed infrastructure tools for analyzing large scale dynamic networks and various multi-agent simulation systems. The infrastructure tools include ORA, a statistical toolkit for analyzing and visualizing multi-dimensional networks. ORA results are organized into reports that meet various needs such as the management report, the mental model report, and the intelligence report. Another tool is AutoMap, a text-mining systems for extracting semantic networks from texts and then cross-classifying them using an organizational ontology into the underlying social, knowledge, resource and task networks. Her simulation models meld multi-agent technology with network dynamics and empirical data. Three of the large-scale multi-agent network models she and the CASOS group have developed in the counter-terrorism area are: BioWar a city-scale dynamic-network agent-based model for understanding the spread of disease and illness due to natural epidemics, chemical spills, and weaponized biological attacks; DyNet a model of the change in covert networks, naturally and in response to attacks, under varying levels of information uncertainty; and RTE a model for examining state failure and the escalation of conflict at the city, state, nation, and international as changes occur within and among red, blue, and green forces. She is the founding co-editor with Al. Wallace of the journal Computational Organization Theory and has co-edited several books and written over 100 articles in the computational organizations and dynamic network area. Her publications can be found at: http://www.casos.cs.cmu.edu/bios/carley/publications.php     

带惩罚项与随机输入的BP神经网络在线梯度学习算法的收敛性

本文对三层BP神经网络中带有惩罚项的在线梯度学习算法的收敛性问题进行了研究,在网络训练每一轮开始执行之前,对训练样本随机进行重排,以使网络学习更容易跳出局部极小,文中给出了误差函数的单调性定理以及该算法的弱收敛和强收敛性定理。     

基于进化人工神经网络的组合系统滤波技术

在组合系统运用Kalman滤波器技术时,准确的系统模型和可靠的观测数据是保证其性能的重要因素,否则将大大降低Kalman滤波器的估计精度,甚至导致滤波器发散.为解决上述Kalman应用中的实际问题,提出了一种新颖的基于进化人工神经网络技术的自适应Kalman滤波器.仿真试验表明该算法可以在系统模型不准确时、甚至外部观测数据短暂中断时,仍能保证Kalman滤波器的性能.     

农户信用评估系统的设计与运用研究

农户信用评估的研究对推动农村消费信用的发展，促进农村经济良好运行十分重要。本在构造农户信用评估的指标体系的基础上，提出了农户信用评估神经网络模型的算法，利用实际搜集到的农户资料进一步建立了农户信用评估模型，继而构造了农户信用评估系统，并举例说明了该系统的实际运用，以期能为农村经济发展中的农户信用评价及相关研究提供一丝基础性启发。     

Survivability in IP-over-WDM Networks: WDM Lightpath Protection versus IP LSP Protection

This article compares the performance of WDM lightpath protection and IP LSP protection schemes for IP-over-WDM networks. A mathematical formulation of the maximum throughput problem is presented and analytical expressions for recovery time are derived for both schemes. The throughputs and recovery times are analyzed and compared. Results show that the IP LSP protection scheme presents higher throughputs then WDM lightpath protection. The IP LSP protection scheme, providing individual IP LSP protection has, however, scalability problems. This scheme presents high recovery times when a failure affects many lightpaths and many hops are allowed for the primary routes of IP LSPs.     

基于径向基函数神经网络的Lorenz混沌系统滑模控制

针对受参数不确定和外扰影响的混沌Lorenz系统，提出一种基于径向基函数（RBF）神经网 络的滑模控制方法.基于被控系统在不稳定平衡点处状态误差的可控规范形，设计滑模切换 面并将其作为神经网络的唯一输入.单入单出形式的RBF控制器隐层只需7个径向基函数，网 络的权值则依滑模趋近条件在线确定.仿真表明该控制器对系统参数突变和外部干扰具有鲁棒性，同时抑制了抖振. 关键词： 混沌控制 滑模 径向基函数神经网络 Lorenz系统