Climate change is strongly linked to human behavior and technologies, and many of the barriers to sustainable behavior are rather psychological than technological. More sustainable technologies and food products have been introduced to combat climate change, most often labeled with morally loaded labels such as “organic” or “environmentally friendly”. The purpose of this thesis was, first, to g...

An advanced and user-friendly tool for fast labeling of moving objects captured with surveillance sensors is proposed, which is available to the public. This tool allows the creation of three kinds of labels: moving objects, shadows and occlusions. These labels are created at both the pixel level and object level, which makes them suitable to assess the quality of both moving object detection s...

0

Climate change is strongly linked to human behavior and technologies, and many of the barriers to sustainable behavior are rather psychological than technological. More sustainable technologies and food products have been introduced to combat climate change, most often labeled with morally load-ed labels such as “organic” or “environmentally friendly”. The purpose of this thesis was, first, to ...

In this paper, we present a procedure to apply the social labeling technique as a social marketing tool. With four studies, we tested its potential for the promotion of proenvironmental consumer behavior. The procedure first provokes an environmentally friendly act and, subsequently, invites the target to attribute that behavior to his personal values, by communicating a social label. If succes...

For a graph G = (V,E) with a binary vertex coloring f : V (G)→ Z2, let vf (i) = |f−1(i)|. We say f is friendly if |vf (1) − vf (0)| ≤ 1, i.e., the number of vertices labeled 1 is the same or almost the same as the number of vertices labeled 0. The coloring f induces an edge labeling f ∗ : E(G) → Z2 defined by f ∗(uv) = f(u) + f(v) (mod 2), for each uv ∈ E(G). Let ef (i) = |{uv ∈ E(G) : f ∗(uv) ...

a graph g is said to have a totally magic cordial labeling with constant c if there exists a mapping f : v (g) ∪ e(g) → {0, 1} such that f(a) + f(b) + f(ab) ≡ c (mod 2) for all ab ∈ e(g) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. in this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...