The roof garden has great functioning of smoothing the shortage of land resource in the city and making use of the land resource diversity and efficiently. The modern era, following the fast development of economic and society, people have a high claim to green roof or roof garden. It is an efficient and reasonable way to exploit the open space the roof of the building. From the classic roof ...

We prove the Garden of Eden theorem for cellular automata with finite set of states and finite neighbourhood on right amenable left homogeneous spaces with finite stabilisers. It states that the global transition function of such an automaton is surjective if and only if it is preinjective. Pre-Injectivity means that two global configurations that differ at most on a finite subset and have the ...

We prove a converse to Myhill’s “Garden-of-Eden” theorem and obtain in this manner a characterization of amenability in terms of cellular automata: A group G is amenable if and only if every cellular automaton with carrier G that has gardens of Eden also has mutually erasable patterns. This answers a question by Schupp, and solves a conjecture by CeccheriniSilberstein, Mach̀ı and Scarabotti.

As previous years, Dip 5 will continue with the redefinition of what was formerly known as public space, trying to reactivate the physical realm of the common, nowadays kidnapped by economic and political agents. The origin of the word paradise gets back to ancient Persia, and to the Avestian term pairi-daêza, composed by pairi, "around" and diz "to construct", literally enclosed space, that wa...

We show that if a set of players hold shares of a value a ∈ Zp for some prime p (where the set of shares is written [a]p), it is possible to compute, in constant round and with unconditional security, sharings of the bits of a, i.e. compute sharings [a0]p, . . . , [a`−1]p such that ` = dlog 2 (p)e, a0, . . . , a`−1 ∈ {0, 1} and a = ∑`−1 i=0 ai2 . Our protocol is secure against active adversarie...

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

2-level shared secret schemes are defined by Simmons in 1989. In this paper, we describe a survey of 2-level secret sharing schemes using finite geometry.

Recently, verifiable secret sharing schemes have been proposed to keep participants from providing fake or illegal stego-images. However, the schemes do not consider the recovery mechanism when parts of the information in stego-images are lost or incidentally modified during the transmission process. This paper presents a novel verifiable and reversible secret sharing scheme based on Shamir’s s...