On the spatial asymptotic decay of a suitable weak solution to the Navier-Stokes Cauchy problem

We prove space-time decay estimates of suitable weak solutions to the Navier-Stokes Cauchy problem, corresponding to a given asymptotic behavior of the initial data of the same order of decay. We use two main tools. The first is a result obtained by the authors in the paper "A remark on the partial regularity of a suitable weak solution to the Navier-Stokes Cauchy problem" (submitted), on the behavior of the solution in a neighborhood of $t=0$ in the $L^\infty_{loc}$-norm, which enables us to furnish a representation formula for a suitable weak solution. The second is the asymptotic behavior of the $L^2(\R^3\setminus B_R)$ norm of $u(t)$ for $R\to\infty$. Following a Leray's point of view, roughly speaking our result proves that a possible space-time turbulence does not perturb the asymptotic spatial behavior of the initial data of a suitable weak solution

A Note About the Semantics of Delegation

In many applications, mobile agents are used by a client to delegate a task. This task is usually performed by the agent on behalf of the client, by visiting various service provider's sites distributed over a network. This use of mobile agents raises many interesting security issues concerned with the trust relationships established through delegation mechanisms between client and agent, agent and service provider and client and service provider. In this paper we will explain why the traditional semantics of delegation used by existing access control mechanisms, either centralised or distributed, are generally not satisfactory to prevent and detect deception and why these problems are even more critical when these semantics are used in mobile agent paradigms.Non peer reviewe

Some remarks on the partial regularity of a suitable weak solution to the Navier-Stokes Cauchy problem

The aim of the paper is to investigate on some questions of local regularity of a suitable weak solution to the Navier-Stokes Cauchy problem. The results are obtained in the wake of the ones, well known, by Caffarelli-Kohn-Nirenberg

Higher regularity of solutions to the singular p-Laplacean parabolic system

We study existence and regularity properties of solutions to the singular $p$-Laplacean parabolic system in a bounded domain $\Omega$. The main purpose is to prove global $L^r(\varepsilon,T;L^q(\Omega))$, $\varepsilon\geq0$, integrability properties of the second spatial derivatives and of the time derivative of the solutions. Hence, for suitable $p$ and exponents $r,\,q$, by Sobolev embedding theorems, we deduce global regularity of $u$ and $\nabla u$ in H\"older spaces. Finally we prove a global pointwise bound for the solution under the assumption $p>\frac{2n}{n+2}$

ATLANTIDES: Automatic Configuration for Alert Verification in Network Intrusion Detection Systems

We present an architecture designed for alert verification (i.e., to reduce false positives) in network intrusion-detection systems. Our technique is based on a systematic (and automatic) anomaly-based analysis of the system output, which provides useful context information regarding the network services. The false positives raised by the NIDS analyzing the incoming traffic (which can be either signature- or anomaly-based) are reduced by correlating them with the output anomalies. We designed our architecture for TCP-based network services which have a client/server architecture (such as HTTP). Benchmarks show a substantial reduction of false positives between 50% and 100%

ATLANTIDES: An Architecture for Alert Verification in Network Intrusion Detection Systems

We present an architecture designed for alert verification (i.e., to reduce false positives) in network intrusion-detection systems. Our technique is based on a systematic (and automatic) anomaly-based analysis of the system output, which provides useful context information regarding the network services. The false positives raised by the NIDS analyzing the incoming traffic (which can be either signature- or anomaly-based) are reduced by correlating them with the output anomalies. We designed our architecture for TCP-based network services which have a client/server architecture (such as HTTP). Benchmarks show a substantial reduction of false positives between 50% and 100%

RelBAC: Relation Based Access Control

TheWeb 2.0, GRID applications and, more recently, semantic desktop applications are bringing the Web to a situation where more and more data and metadata are shared and made available to large user groups. In this context, metadata may be tags or complex graph structures such as file system or web directories, or (lightweight) ontologies. In turn, users can themselves be tagged by certain properties, and can be organized in complex directory structures, very much in the same way as data. Things are further complicated by the highly unpredictable and autonomous dynamics of data, users, permissions and access control rules. In this paper we propose a new access control model and a logic, called RelBAC (for Relation Based Access Control) which allows us to deal with this novel scenario. The key idea, which differentiates RelBAC from the state of the art, e.g., Role Based Access Control (RBAC), is that permissions are modeled as relations between users and data, while access control rules are their instantiations on specific sets of users and objects. As such, access control rules are assigned an arity which allows a fine tuning of which users can access which data, and can evolve independently, according to the desires of the policy manager(s). Furthermore, the formalization of the RelBAC model as an Entity-Relationship (ER) model allows for its direct translation into Description Logics (DL). In turn, this allows us to reason, possibly at run time, about access control policies