A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
Thara Angskun, George Bosilca, Bradley T. Vander Z...
The paper discusses an original research project in the area of education and cross-cultural rhetoric on the use of persuasive digital technologies to enable intercultural competen...
Alyssa J. O'Brien, Christine Alfano, Eva Magnusson
Abstract. PersonisAD, is a framework for building context-aware, ubiquitous applications: its defining foundation is a consistent mechanism for scrutable modelling of people, sens...
Mark Assad, David J. Carmichael, Judy Kay, Bob Kum...
As pervasive environments become more commonplace, the privacy of users is placed at increased risk. The numerous and diverse sensors in these environments can record users’ cont...
Apu Kapadia, Tristan Henderson, Jeffrey J. Fieldin...
We propose a method through which dynamic sensor nodes determine that they move together, by communicating and correlating their movement information. We describe two possible solu...
Raluca Marin-Perianu, Mihai Marin-Perianu, Paul J....