Popular biorthogonal wavelet filters via a lifting scheme and its application in image compression

A technique using a lifting scheme is presented for constructing compactly supported wavelets whose coefficients are composed of free variables locating in an interval. An efficient approach-based wavelet for image compression is developed by selecting the coefficients of the 9-7 wavelet filter and associated lifting scheme. Furthermore, the rationalised coefficients wavelet filter that can be implemented with simple integer arithmetic is achieved and its characteristic is close to the well known original irrational coefficients 9-7 wavelet filters developed by A. Cohen et al. (Commun. Pure Appl. Maths., vol.45, no.1, p.485-560, 1992). To reduce the computational cost of image coding applications further, an acceleration technique is proposed for the lifting steps. Software and hardware simulations show that the new method has very low complexity, and simultaneously preserves the high quality of the compressed image.     

A birth-process approach to Moranda's geometric software-reliability model

To alleviate some of the objections to the basic Jelinski Moranda (JM) model for software failures, Moranda proposed a geometric de-eutrophication model. This model assumes that the times between failures are statistically-independent exponential random variables with given failure rates. In this model the failure rates decrease geometrically with the detection of a fault. Using an intuitive approach, Musa, Iannino, Okumoto , see also Farr , derived expressions for the mean and the intensity functions of the process N (t) which counts the number of faults detected in the time interval [O, t] for the Moranda geometric de-eutrophication model. N (t) is studied as a pure birth stochastic process; its probability generating function is derived, as well as its mean, intensity and reliability functions. The expressions for the mean and intensity functions derived by MIO are only approximations and can be quite different from the true functions for certain choices of the failure rates. The exact expressions for the mean function and the intensity function of N (t) are used to find the optimum release time of software based on a cost structure for Moranda's geometric de-eutrophication model.     

Equilibrium analysis of cellular neural networks

Cellular neural networks (CNNs) are dynamical systems, described by a large set of coupled nonlinear differential equations. The equilibrium-point analysis is an important step for understanding the global dynamics and for providing design rules. We yield a set of sufficient conditions (and a simple algorithm for checking them) ensuring the existence of at least one stable equilibrium point. Such conditions give rise to simple constraints, that extend the class of CNNs, for which the existence of a stable equilibrium point is rigorously proved. In addition, they are suitable for design and easy to check, because they are directly expressed in term of the template elements.     

Lake Chivero: A management case study

Lake Chivero in Zimbabwe was shown to be hypereutrophic. Historical data showed that the eutrophication process had been arrested in the late 1970s. However, a combination of poor planning, multiplicity of jurisdiction, mismatch between rate of urbanization and waste management investment, recent changes in the local climate and a permissive, immature political system that called for no public accountability resulted in environmental management breakdown leading to hypereutrophication of the lake. The case of Lake Chivero is presented as an example of a wider global issue regarding the status of environmental management in competition with other priorities in emerging democracies.     

Handover and Uplink Power Control Performance in the 3.84 Mcps TDD mode of UTRA Network

In this article we consider the performance of the 3.84 Mcpstime-division duplex (TDD) mode of UTRA (Universal TerrestrialRadio Access) network. We emphasize two of the radio resourcemanagement algorithms, handover and uplink power control, whoserole in the overall system performance is studied extensively.First, a handover algorithm used in WCDMA (Wideband Code DivisionMultiple Access) standard is considered in a TDD-mode operation.This gives rise to a careful setting of different handoverparameters, and the evaluation of the effects to the systemperformance. Secondly, the specified uplink power controlalgorithm is considered. Since it is based on several user-mademeasurements which may involve both random and systematic errors acareful study about the suitability of the power control scheme iscarried out.     

基于交会图和多元统计法的神经网络技术在火山岩识别中的应用

针对火山岩储层的特殊性(复杂性、离散性和随机性),应用BP神经网络技术对火山岩测井解释中岩性识别问题进行了研究。该方法的技术关键是样本集和初始权重的建立,以及模型的优选。本文提出了一种基于交会图和多元统计法的学习样本生成方法,即根据取心岩样的地球化学和岩石学研究,用交会图技术建立样本集,采用聚类分析和距离判别法确定初始权重。将研究方法应用在松辽盆地杏山地区火山岩岩性识别问题中,取得了很好的效果,岩性解释符合率高于90%。文中通过四种岩性识别处理模式的对比研究,表明赋权重处理模式为最优处理模型。在神经网络模型预测过程中,需充分利用已有的地质经验和测井曲线信息建立典型可靠的样本文件,同时考虑神经网络方法中各种因素的影响,优选模型和计算参数才能使预测结果符合实际情况。     

Effects of surface charge, micro-bubble size and particle size on removal efficiency of electro-flotation.

Flotation is a water treatment alternative to sedimentation, and uses small bubbles to remove low-density particles from potable water and wastewater. The effect of zeta potential, bubble size and particle size on removal efficiency of the electro-flotation process was investigated because previous model-simulations indicated that these attributes are critical for high collision efficiency between micro-bubbles and particles. Solutions containing Al3+ as the metal ion were subjected to various conditions. The zeta potentials of bubbles and particles were similar under identical conditions, and their charges were influenced by metal ion concentration and pH. Maximum removal efficiency was 98 and 12% in the presence and absence of flocculation, respectively. Removal efficiency was higher when particle size was similar to bubble size. These results agree with modelling simulations and indicate that collision efficiency is greater when the zeta potential of one is negative and that of the other is positive and when their sizes are similar.     

Randomized scheduling algorithms for high-aggregate bandwidth switches

The aggregate bandwidth of a switch is its port count multiplied by its operating line rate. We consider switches with high-aggregate bandwidths; for example, a 30-port switch operating at 40 Gb/s or a 1000-port switch operating at 1 Gb/s. Designing high-performance schedulers for such switches with input queues is a challenging problem for the following reasons: (1) high performance requires finding good matchings; (2) good matchings take time to find; and (3) in high-aggregate bandwidth switches there is either too little time (due to high line rates) or there is too much work to do (due to a high port count). We exploit the following features of the switching problem to devise simple-to-implement, high-performance schedulers for high-aggregate bandwidth switches: (1) the state of the switch (carried in the lengths of its queues) changes slowly with time, implying that heavy matchings will likely stay heavy over a period of time and (2) observing arriving packets will convey useful information about the state of the switch. The above features are exploited using hardware parallelism and randomization to yield three scheduling algorithms - APSARA, LAURA, and SERENA. These algorithms are shown to achieve 100% throughput and simulations show that their delay performance is quite close to that of the maximum weight matching, even when the traffic is correlated. We also consider the stability property of these algorithms under generic admissible traffic using the fluid-model technique. The main contribution of this paper is a suite of simple to implement, high-performance scheduling algorithms for input-queued switches. We exploit a novel operation, called MERGE, which combines the edges of two matchings to produce a heavier match, and study of the properties of this operation via simulations and theory. The stability proof of the randomized algorithms we present involves a derandomization procedure and uses methods which may have wider applicability.