Network firewalls filter traffic by comparing all arriving packets to a set of rules, typically in a sequential manner. This activity requires a high amount of processing time and introduces a significantly delay to the traffic. As a result, a packet filter can become a bottleneck for the connection [3] [5]. For this reason, speed requirement is a fundamental feature for a network firewall. In this paper, we analyse the results of a firewall performance testing, in which we compare the packet processing time of two popular Open Source O.S., Linux and OpenBSD, with their related packet filter tools, Iptables and PF (Packet Filter). Our goals are to evaluate the packet forwarding speed of tested environment and to determine how different conditions can affect performances; therefore tests are made under a variety of conditions and configurations. Linux or OpenBSD based firewalls are often used as routing-firewalls, but they both also have the ability to act as bridging-firewalls, so we tested and compared them in that configuration too.

We consider a generalized version of the small Lebesgue spaces, introduced by Fiorenza, as the associate spaces of the grand Lebesgue spaces. We find a simplified expression for the norm, prove relevant properties, compute the fundamental function and discuss the comparison with the Orlicz spaces.

Sharp exponential estimates for solutions to homogeneous Neumann problems for nonlinear elliptic equations in open subsets ! of Rn are established, with data from limiting Lebesgue spaces, or, more generally, Lorentz spaces.

Collective communication performance is critical in a number of MPI applications. In this paper we focus on two widely used primitives, broadcast and reduce, and present experimental results obtained on a cluster of PC connected by Myrinet. We compare the performance of the MPICH primitives with our implementation based on alpha-trees. Our tests show that the MPICH implementation can be improved.

We consider the problem of estimating the baseline signal from repeated noisy measurements taken on some object or individual of interest whose response is not fixed. We devise some wavelet shrinkage schemes to efficiently address the baseline signal estimation problem, adapting some well-known wavelet shrinkage procedures from the standard nonparametric regression literature. These schemes are based on the empirical wavelet coefficients of the observed data. Wavelet decompositions allow one to characterise different types of smoothness conditions assumed on the response function by means of its wavelet coefficients for a wide range of function classes. Furthermore, synthetic data sets, appropriate for baseline signal estimation, are introduced and used to examine the finite sample performance of the various baseline signal estimators. Insight into the performance of the various baseline signal estimators is obtained from numerical tables and graphical outputs. Two real-life data sets, arising from oxygen tension in rats experiments and from human event-related potentials experiments, are also considered as an illustration of the competing baseline signal estimators.

Within the framework of generic programming, we implement an abstract algorithm for solution of an integral equation of the second kind with the resolvent kernels method. Then, as an application of the idempotent analysis analog of resolvent kernels developed in \cite{MR2002d:49038}, we apply the algorithm to the numerical solution of an optimal control problem with stopping time.

This paper deals with the construction of effective heuristic methods for investigating the effect of corrosion on the inaccesible side of a thin metallic plate. In particular, we derive explicit formulas for the Thin Plate Approximation of the positive functions $\gamma$ and $\theta$ that, in our model, describe energy dispersion and material loss respectively.

A priori estimates for solutions to homogeneous Neumann problems for uniformly elliptic equa- tions in open subsets \Omega­ of IR^n are established when the datum on right-hand side is in the limiting space L^{n/2}(\Omega), or, more generally, in the Lorentz spaces L^{n/2, q}(\Omega). These estimates are optimal as far as either constants or norms are concerned.

The biclustering method can be a very useful analysis tool when some genes have multiple functions and experimental conditions are diverse in gene expression measurement. This is because the biclustering approach, in contrast to the conventional clustering techniques, focuses on finding a subset of the genes and a subset of the experimental conditions that together exhibit coherent behavior. However, the biclustering problem is inherently intractable, and it is often computationally costly to find biclusters with high levels of coherence. In this work, we propose a novel biclustering algorithm that exploits the zero-suppressed binary decision diagrams(ZBDDs) data structure to cope with the computational challenges. Our method can find all biclusters that satisfy specific input conditions, and it is scalable to practical gene expression data. We also present experimental results confirming the effectiveness of our approach.

We study the asymptotic behavior of risk processes perturbed by a diffusion, Cox arrivals and delayed claims

The quench of a binary mixture into a stable lamellar phase is numerically investigated. We present a novel approach to study the phenomenological equations governing the system dynamics based on the combination of lattice Boltzmann and finite difference equations. We can access large systems on time scales long enough to find evidence of dynamical scaling regime in the ordering process when hydrodynamics is operating.

In this article we continue our study on the complexity of Path Covering Problems started in [2]. Here, taking one further step, we investigate the complexity of the problem on grids. For special classes of grids (general grids, grids with a fixed number of rows, ladders), and several special unweighted path collections (general paths, paths of length 2, L-shaped paths, pipes, hooks, staples) we either give polynomial-time algorithms or prove NP-completeness results