Bermond et al. [5] conjectured that the edge set of a cubic graph G can be partitioned into two linear k-forests, that is to say two forests whose connected components are paths of length at most k, for all k ;::: 5. That the statement is valid for all k ;::: 18 was shown in [8] by Jackson and Wormald. Here we improve this bound to k > {7 if X'( G) = 3; 9 otherwise. The result is also extended ...

This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, “neighboring links” cannot be simultaneously activated, otherwise transmissions will fail. Here, we consider any binary model of interference. We follow the model described by Bui, Sanghavi, and Srikant in [5, 21]. We suppose that time is slotted and during each slot we have two pha...

Gbmez, J., M.A. Fiol and J.L.A. Yebra, Graphs on alphabets as models foi large interconnection networks, Discrete Applied Mathematics 37138 (1992) 227-243. Graphs on alphabets are constructed by labelling the vertices with words on a given alphabet, and specifying a rule that relates pairs of different words to define the edges. They have proved to be quite suitable to model large interconnecti...

This study was intended to test the effect of Tetris as an intervention for severe but sub-clinical life stress in young adults. Tetris has been indicated to be useful in many clinical populations, particularly having potential in reducing the occurrence of intrusive recollections in PTSD; and the mechanism it has been hypothesised to work on has cognitive and neurological connections to the ex...

Virtually everyone has experienced from time to time how hard it can be to put one’s feelings into words. Yet, for some individuals, this task is especially daunting. Such individuals are characterized by high levels of alexithymia (“no words for feelings”). Alexithymia is a personality dimension that involves both cognitive deficits, including difficulties in recognizing, describing, and disti...

In the gathering problem, a particular node in a graph, the base station, aims at receiving messages from some nodes in the graph. At each step, a node can send one message to one of its neighbor (such an action is called a call). However, a node cannot send and receive a message during the same step. Moreover, the communication is subjet to interference constraints, more precisely, two calls i...

Both fear and pain can cause suffering. When pain is being studied, experiments must be designed to separate the variable of fear from the variable of pain. Some investigators claim that a sharp cut off line exists between those animals who experience pain and suffering, from those who do not. These arguments are based on the assumption that the capacity to suffer is related to the size and com...