The key processes in biological and chemical systems are described by networks of chemical reactions. From molecular biology to biotechnology applications, computational models of reaction networks are used extensively to elucidate their non-linear dynamics. The model dynamics are crucially dependent on the parameter values which are often estimated from observations. Over the past decade, the interest in parameter and state estimation in models of (bio-) chemical reaction networks (BRNs) grew considerably. The related inference problems are also encountered in many other tasks including model calibration, discrimination, identifiability, and checking, and optimum experiment design, sensitivity analysis, and bifurcation analysis. The aim of this review paper is to examine the developments in literature to understand what BRN models are commonly used, and for what inference tasks and inference methods. The initial collection of about 700 documents concerning estimation problems in BRNs excluding books and textbooks in computational biology and chemistry were screened to select over 270 research papers and 20 graduate research theses. The paper selection was facilitated by text mining scripts to automate the search for relevant keywords and terms. The outcomes are presented in tables revealing the levels of interest in different inference tasks and methods for given models in the literature as well as the research trends are uncovered. Our findings indicate that many combinations of models, tasks and methods are still relatively unexplored, and there are many new research opportunities to explore combinations that have not been considered—perhaps for good reasons. The most common models of BRNs in literature involve differential equations, Markov processes, mass action kinetics, and state space representations whereas the most common tasks are the parameter inference and model identification. The most common methods in literature are Bayesian analysis, Monte Carlo sampling strategies, and model fitting to data using evolutionary algorithms. The new research problems which cannot be directly deduced from the text mining data are also discussed.
The Internet research is mainly driven by data. Obtaining such data by planning and launching measurement campaigns is rather time consuming and costly. Much more efficient, and in many cases, sufficient data acquisition strategy is to exploit the existing datasets available in public databases, repositories, and documents. Hence, the public data sources related to the Internet usage and other Internet statistics are systematically surveyed and categorized to make the search for the Internet data much easier and faster. Extensive online searches and exploring websites of the key organizations were used to identify the data sources. Each data source was then carefully explored to describe its characteristics and contents. The data are usually aggregated over certain time periods and regions, and often indexed by age, gender, application, website, activity and other attributes. Some data sources also support various data visualization options, and offer data export in multiple formats.
17 July 2009 in IEEE Transactions on Communications
The average bit-error rate performance of one-stage and two-stage diversity combining schemes operating over correlated fading channels is investigated. Two channel models that can significantly simplify the performance analysis are considered. In particular, a linear correlation channel model having equal branch variances can be decorrelated at the receiver, so that the branches become independent. It is shown that, in general, employing diversity combining schemes for decorrelated or orthogonalized branches can recover some of the diversity gain lost due to the branch correlations. This is observed, for example, for the case of hybrid selection/maximum ratio combining operating over decorrelated and orthogonalized non-zero mean Gaussian fading channels. Furthermore, a fading amplitude channel model is proposed assuming vector norm superposition of the impinging plane waves. This channel model is well-suited for the performance analysis of maximum ratio and equal gain combining schemes operating over correlated fading channels. Finally, the average bit error rates of several diversity combining schemes are evaluated analytically using the Prony approximation method as well as using computer simulation.
This paper is concerned with long-term (20+ years) forecasting of broadband traffic in next-generation networks. Such long-term approach requires going beyond extrapolations of past traffic data while facing high uncertainty in predicting the future developments and facing the fact that, in 20 years, the current network technologies and architectures will be obsolete. Thus, “order of magnitude” upper bounds of upstream and downstream traffic are deemed to be good enough to facilitate such long-term forecasting. These bounds can be obtained by evaluating the limits of human sighting and assuming that these limits will be achieved by future services or, alternatively, by considering the contents transferred by bandwidth-demanding applications such as those using embedded interactive 3D video streaming. The traffic upper bounds are a good indication of the peak values and, subsequently, also of the future network capacity demands. Furthermore, the main drivers of traffic growth including multimedia as well as non-multimedia applications are identified. New disruptive applications and services are explored that can make good use of the large bandwidth provided by next-generation networks. The results can be used to identify monetization opportunities of future services and to map potential revenues for network operators.