Current air quality analytics and monitoring: A review

This review summarizes the different tools and concepts that are commonly applied in air quality monitoring. The monitoring of atmosphere is extremely important as the air quality is an important problem for large communities. Main requirements for analytical devices used for monitoring include a long period of autonomic operation and portability. These instruments, however, are often characterized by poor analytical performance. Monitoring networks are the most common tools used for monitoring, so large-scale monitoring programmes are summarized here. Biomonitoring, as a cheap and convenient alternative to traditional sample collection, is becoming more and more popular, although its main drawback is the lack of standard procedures. Telemonitoring is another approach to air monitoring, which offers some interesting opportunities, such as ease of coverage of large or remote areas, constituting a complementary approach to traditional strategies; however, it requires huge costs.     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.     

准移动闭塞系统的元胞自动机模型及列车延迟传播规律的研究

在NaSch模型的基础上，针对铁路交通的特点提出一种用于模拟准移动闭塞系统的元胞自动机模型.应用该模型模拟了准移动闭塞系统列车延迟传播的交通现象，分析了准移动闭塞系统中的轨道定位单元长度、发车时间间隔、初始延迟时间等因素对列车延迟传播的影响. 关键词： 元胞自动机 交通流 准移动闭塞     

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

Unified Model for Generation Complex Networks with Utility Preferential Attachment

In this paper, based on the utility preferential attachment, we propose a new unified model to generate different network topologies such as scale-free, small-world and random networks. Moreover, a new network structure named super scale network is found, which has monopoly characteristic in our simulation experiments. Finally, the characteristics ofthis new network are given.     

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.