نتایج جستجو برای: operational time

تعداد نتایج: 1949528  

1994
C. Castelluccia R. de Simone

The rapid evolution of networking and the multiplication of new applications re-emphasizes the importance of the efficient communication supports. Implementations must be able to take maximal advantage of the details of applicationspecific semantics and of specific networking environments. In other words, the application needs to have more control over data transmission. Such control can be obt...

2005
William H. Sanders Peter Buchholz Ravishankar Iyer Michael Loui

Markovian modeling of systems is a promising technique used to gauge the performance, dependability, and performability of systems. It can be used to aid design decisions by evaluating a range of design options for a range of environments, and it can be used to increase understanding of operational systems. Unfortunately, Markovian modeling is limited by the “state-space explosion,” or the expo...

1994
Jean-Pierre Banâtre Ciarán Bryce Daniel Le Métayer

We give a formal deenition of the notion of information ow for a simple guarded command language. We propose an axiomatisation of security properties based on this notion of information ow and we prove its soundness with respect to the operational semantics of the language. We then identify the sources of non determinism in proofs and we derive in successive steps an inference algorithm which i...

2016
Matteo Busi Pierpaolo Degano Letterio Galletta

A concurrent extension of the recent COP language MLCoDa is presented. We formalise its operational semantics and we propose a run time verification mechanism that enforces a notion of non-interference among concurrent threads. More precisely, this mechanism prevents an application from modifying the context so as to dispose some resources or to contradict assumptions upon which other applicati...

1997
David McAllester Nevin Heintze

We formally deene the set-based abstraction of any language whose operational semantics can be deened by environment evaluation. The Aiken-Wimmers soft type system precisely corresponds to this set-based abstraction under their operational semantics. The Heintze set-based analysis is precisely this set-based abstraction under a diierent operational semantics. In general, set-based abstraction d...

2008
Edoardo Bonizzoni Aldo Perez Franco Maloberti

Non-conventional architectures that enable optimizing the power consumption in a second-order or an equivalent second-order scheme are proposed. The solutions exploit the significant difference in power consumption of comparators and OTAs that makes it advantageous to use more comparators to replace an OTA. Moreover, the use of op-amp time-sharing is discussed. For this a conventional second or...

1998
Joost-Pieter Katoen Lennard Lamberty

Message sequence charts (MSCs) are a standardised formalism for the specification of the system’s communication behaviour that is widely used by industry. Various extensions to MSCs have recently been standardised by the ITU. This paper treats the extension of MSCs with structural operators that allow the hierarchical composition of MSCs. In particular, we propose a linear-time partial-order se...

2011
Anurag Nagar Hisham Al-Mubaid

Semantic similarity measures have been used successfully and extensively in the biomedical research with various applications. As the biomedical ontologies, which form the main ground for most of the similarity measures, are growing and progressing towards more completeness and higher accuracy, the results and outcomes of these semantic similarity measures become more acceptable and more reliab...

2011
Giuseppe Di Battista Claudio Squarcella Wolfgang Nagele

We present a novel paradigm to visualize the evolution of the service provided by one of the most popular root name servers, called K-root, operated by the RIPE Network Coordination Centre (RIPE NCC) and distributed in several locations (instances) worldwide. Our approach can be used to either monitor what happened during a prescribed time interval or observe the status of the service in near r...

2005
Michael P. Wellman Daniel M. Reeves Kevin M. Lochner Shih-Fen Cheng Rahul Suri

To deal with exponential growth in the size of a game with the number of agents, we propose an approximation based on a hierarchy of reduced games. The reduced game achieves savings by restricting the number of agents playing any strategy to fixed multiples. We validate the idea through experiments on randomly generated local-effect games. An extended application to strategic reasoning about a ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید