Abstract. Colourful and ever-changing: Graffiti can be considered the urban chameleon skin. At Donaukanal (Eng. Danube Channel), Vienna's central waterway one of largest most active graffiti-scapes worldwide, this metaphor applies like hardly anywhere else. Every day a multitude graffiti is destroyed by creation new works. Recently, efforts have been made to mitigate constant loss cultural heri...

The intensity values of terrestrial laser scanning (TLS) can be used to reveal painted black rock art behind graffiti and moss. effect was observed in Gumahon cave Peñablanca, Philippines where previously unnoticed pigment exposed underneath moss, red white graffiti, etched name graffiti. application TLS for this purpose has not, our knowledge, been reported. significance finding is that archae...

Most researchers use Petri nets as a formal notation with mathematically defined semantics. Their graphical part is usually only seen as a notation, that does not carry semantics. Contrary to this tradition, we show in this article that, when created by a human, there is inherent semantics in the positions of places, transitions and arcs. We propose to use the full definition of Petri nets: whe...

The advantage of our system over other intelligent desktops [2] and white-boards [1] is that the users are free to move the pieces of paper on which they are writing. In TeleGraffiti, paper detection and tracking is based on real-time paper boundary detection. In the applications mentioned above, this step needs to be robust to the occlusions caused by the user’s hands and the distractions caus...

---------------------------------------------Abstract Recently, the mobile devices such as PDA and smart phones are widely used to organize personal data and to access the host systems from remote places. But, these devices are easily accessed by irregular users due to the stealge or the lost property. The authentification by password or the fingerprint can protect them, but the convenience of ...

In this paper we prove several new lower bounds on the maximum number of leaves of a spanning tree of a graph related to its order, independence number, local independence number, and the maximum order of a bipartite subgraph. These new lower bounds were conjectured by the program Graffiti.pc, a variant of the program Graffiti. We use two of these results to give two partial resolutions of conj...