The eternal inflation scenario predicts that our observable Universe resides inside a single bubble embedded in a vast inflating multiverse. We present the first observational tests of eternal inflation, performing a search for cosmological signatures of collisions with other bubble universes in cosmic microwave background data from the WMAP satellite. We conclude that the WMAP 7-year data do n...

In recent literature on eternal inflation, a number of measures have been introduced which attempt to assign probabilities to different pocket universes by counting the number of each type of pocket according to a specific procedure. We give an overview of the existing measures, pointing out some interesting connections and generic predictions. For example, pairs of vacua that undergo fast tran...

During the last decades, many combinatorial games involving two persons playing on a (directed) graph have received a lot of attention. Some examples of such games are the Angel problem, the Cops and Robbers, the Surveillance game, the Eternal Dominating Set and Eternal Set Cover. One of the main questions in these games is to decide if a given player has a winning strategy. That is, if it can ...

The Replication Logic is a set of protocols, mechanisms and services that allow a CORBA system to handle object replication. In this paper we present a specific implementation of a Replication Logic, namely Interoperable Replication Logic (IRL), which exhibits nice properties like non-intrusion (i.e., the replication logic is built “above” the ORB) and interoperability (i.e., a client can resid...

0

secure electronic transaction (set) protocol is an open protocol, which has the potential to emerge as a powerful tool in securing of electronic transactions. the quality of a design of an ecommerce protocols has a great influence on achieving non-functional requirements (nfrs) to the system. an increasingly important non-functional attribute of complex software systems is adaptability. softwar...

Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...