3G network traffic sources measurement and analysis

In this paper, we show statistical analyses of several types of traffic sources in a 3G network, namely voice, video and data sources. For each traffic source type, measurements were collected in order to, on the one hand, gain better understanding of the statistical characteristics of the sources and, on the other hand, enable forecasting traffic behaviour in the network. The latter can be used to estimate service times and quality of service parameters. The probability density function, mean, variance, mean square deviation, skewness and kurtosis of the interarrival times are estimated by Wolfram Mathematica and Crystal Ball statistical tools. Based on evaluation of packet interarrival times, we show how the gamma distribution can be used in network simulations and in evaluation of available capacity in opportunistic systems. As a result, from our analyses, shape and scale parameters of gamma distribution are generated. Data can be applied also in dynamic network configuration in order to avoid potential network congestions or overflows. Copyright © 2013 John Wiley & Sons, Ltd.

Applied Graph Theory in Computer Vision and Pattern Recognition

This book will serve as a foundation for a variety of useful applications of graph theory to computer vision, pattern recognition, and related areas. It covers a representative set of novel graph-theoretic methods for complex computer vision and pattern recognition tasks. The first part of the book presents the application of graph theory to low-level processing of digital images such as a new method for partitioning a given image into a hierarchy of homogeneous areas using graph pyramids, or a study of the relationship between graph theory and digital topology. Part II presents graph-theoretic learning algorithms for high-level computer vision and pattern recognition applications, including a survey of graph based methodologies for pattern recognition and computer vision, a presentation of a series of computationally efficient algorithms for testing graph isomorphism and related graph matching tasks in pattern recognition and a new graph distance measure to be used for solving graph matching problems. Finally, Part III provides detailed descriptions of several applications of graph-based methods to real-world pattern recognition tasks. It includes a critical review of the main graph-based and structural methods for fingerprint classification, a new method to visualize time series of graphs, and potential applications in computer network monitoring and abnormal event detection.

Dynamic computer simulations of electrophoresis: a versatile research and teaching tool

Software is available, which simulates all basic electrophoretic systems, including moving boundary electrophoresis, zone electrophoresis, ITP, IEF and EKC, and their combinations under almost exactly the same conditions used in the laboratory. These dynamic models are based upon equations derived from the transport concepts such as electromigration, diffusion, electroosmosis and imposed hydrodynamic buffer flow that are applied to user-specified initial distributions of analytes and electrolytes. They are able to predict the evolution of electrolyte systems together with associated properties such as pH and conductivity profiles and are as such the most versatile tool to explore the fundamentals of electrokinetic separations and analyses. In addition to revealing the detailed mechanisms of fundamental phenomena that occur in electrophoretic separations, dynamic simulations are useful for educational purposes. This review includes a list of current high-resolution simulators, information on how a simulation is performed, simulation examples for zone electrophoresis, ITP, IEF and EKC and a comprehensive discussion of the applications and achievements.

High-resolution computer simulations of stacking of weak bases using a transient pH boundary in capillary electrophoresis. 1. Concept and impact of sample ionic strength

The dynamics of focusing weak bases using a transient pH boundary was examined via high-resolution computer simulation software. Emphasis was placed on the mechanism and impact that the presence of salt, namely, NaCl, has on the ability to focus weak bases. A series of weak bases with mobilities ranging from 5 x 10(-9) to 30 x 10(-9) m2/V x s and pKa values between 3.0 and 7.5 were examined using a combination of 65.6 mM formic acid, pH 2.85, for the separation electrolyte, and 65.6 mM formic acid, pH 8.60, for the sample matrix. Simulation data show that it is possible to focus weak bases with a pKa value similar to that of the separation electrolyte, but it is restricted to weak bases having an electrophoretic mobility of 20 x 10(-9) m2/V x s or quicker. This mobility range can be extended by the addition of NaCl, with 50 mM NaCl allowing stacking of weak bases down to a mobility of 15 x 10(-9) m2/V x s and 100 mM extending the range to 10 x 10(-9) m2/V x s. The addition of NaCl does not adversely influence focusing of more mobile bases, but does prolong the existence of the transient pH boundary. This allows analytes to migrate extensively through the capillary as a single focused band around the transient pH boundary until the boundary is dissipated. This reduces the length of capillary that is available for separation and, in extreme cases, causes multiple analytes to be detected as a single highly efficient peak.

High-resolution computer simulations of EKC

The electrophoresis simulation software, GENTRANS, has been modified to include the interaction of analytes with an electrolyte additive to allow the simulation of liquid-phase EKC separations. The modifications account for interaction of weak and strong acid and base analytes with a single weak or strong acid or base background electrolyte additive and can be used to simulate a range of EKC separations with both charged and neutral additives. Simulations of separations of alkylphenyl ketones under real experimental conditions were performed using mobility and interaction constant data obtained from the literature and agreed well with experimental separations. Migration times in fused-silica capillaries and linear polyacrylamide-coated capillaries were within 7% of the experimental values, while peak widths were always narrower than the experimental values, but were still within 50% of those obtained by experiment. Simulations of sweeping were also performed; although migration time agreement was not as good as for simple EKC separations, peak widths were in good agreement, being within 1-50% of the experimental values. All simulations for comparison with experimental data were performed under real experimental conditions using a 47 cm capillary and a voltage of 20 kV and represent the first quantitative attempt at simulating EKC separations with and without sweeping.

Dynamic computer simulations of electrophoresis: three decades of active research

Dynamic models for electrophoresis are based upon model equations derived from the transport concepts in solution together with user-inputted conditions. They are able to predict theoretically the movement of ions and are as such the most versatile tool to explore the fundamentals of electrokinetic separations. Since its inception three decades ago, the state of dynamic computer simulation software and its use has progressed significantly and Electrophoresis played a pivotal role in that endeavor as a large proportion of the fundamental and application papers were published in this periodical. Software is available that simulates all basic electrophoretic systems, including moving boundary electrophoresis, zone electrophoresis, ITP, IEF and EKC, and their combinations under almost exactly the same conditions used in the laboratory. This has been employed to show the detailed mechanisms of many of the fundamental phenomena that occur in electrophoretic separations. Dynamic electrophoretic simulations are relevant for separations on any scale and instrumental format, including free-fluid preparative, gel, capillary and chip electrophoresis. This review includes a historical overview, a survey of current simulators, simulation examples and a discussion of the applications and achievements of dynamic simulation.

A computer-aided diagnostic system to characterize CT focal liver lesions: design and optimization of a neural network classifier

In this paper, a computer-aided diagnostic (CAD) system for the classification of hepatic lesions from computed tomography (CT) images is presented. Regions of interest (ROIs) taken from nonenhanced CT images of normal liver, hepatic cysts, hemangiomas, and hepatocellular carcinomas have been used as input to the system. The proposed system consists of two modules: the feature extraction and the classification modules. The feature extraction module calculates the average gray level and 48 texture characteristics, which are derived from the spatial gray-level co-occurrence matrices, obtained from the ROIs. The classifier module consists of three sequentially placed feed-forward neural networks (NNs). The first NN classifies into normal or pathological liver regions. The pathological liver regions are characterized by the second NN as cyst or "other disease." The third NN classifies "other disease" into hemangioma or hepatocellular carcinoma. Three feature selection techniques have been applied to each individual NN: the sequential forward selection, the sequential floating forward selection, and a genetic algorithm for feature selection. The comparative study of the above dimensionality reduction methods shows that genetic algorithms result in lower dimension feature vectors and improved classification performance.

How can computer simulations produce new knowledge?

It is often claimed that scientists can obtain new knowledge about nature by running computer simulations. How is this possible? I answer this question by arguing that computer simulations are arguments. This view parallels Norton’s argument view about thought experiments. I show that computer simulations can be reconstructed as arguments that fully capture the epistemic power of the simulations. Assuming the extended mind hypothesis, I furthermore argue that running the computer simulation is to execute the reconstructing argument. I discuss some objections and reject the view that computer simulations produce knowledge because they are experiments. I conclude by comparing thought experiments and computer simulations, assuming that both are arguments.