Abstract: A method for unlocking a control unit of an exercise machine includes providing the exercise machine, having at least one sensor for detecting presence of a user on the exercise machine, with at least one electrical signal representative of a detection carried out at the time of the occupation of the exercise machine by a user. The method further includes switching, by the exercise machine, the control unit of the exercise machine from a first locking condition to at least a second operating condition in which the user may issue commands to the exercise machine by the control unit, based on the at least one electrical signal provided by said at least one sensor for detecting the presence of the user on the exercise machine.

Abstract: A method for unlocking a control unit of an exercise machine includes providing the exercise machine, having at least one sensor for detecting presence of a user on the exercise machine, with at least one electrical signal representative of a detection carried out at the time of the occupation of the exercise machine by a user. The method further includes switching, by the exercise machine, the control unit of the exercise machine from a first locking condition to at least a second operating condition in which the user may issue commands to the exercise machine by the control unit, based on the at least one electrical signal provided by said at least one sensor for detecting the presence of the user on the exercise machine.

Abstract: There is disclosed a method of centralized scheduling of the access to a common radio channel in multi-hop wireless networks. The requests by the relay nodes (RN(1,1) . . . RN(n,Nn), RNi) of resources for sending uplink flows towards the base station (BS), and/or downlink flows towards relay nodes (RN(1,1) . . . RN(n,Nn), RNi) are computed by a requesting node for all links up to the destination and sent as cumulative requests for all links concerned. In case the traffic for which access to the common channel is demanded relates to different classes of service, each cumulative request includes the concatenation of a plurality of individual cumulative requests each concerning traffic belonging to a different class of service.

Abstract: Requests of resources of uplink flows towards a base station (BS) and/or downlink flows towards end nodes are computed by each requesting node on an end-to-end basis. Each requesting node issues a cumulative request given by summing up the same request for each link separating the node from the BS plus each link separating the BS from the destination node, enabling the centralized node to perform connection based scheduling. The BS in response to all cumulative requests grants uplink and/or downlink resources for each link. The profile of grants is equal to the profile of requests when the amount of resources requested is below the maximum net throughput on MAC layer. When not below the maximum net through-put on MAC layer, the ideal profile of grants is normalized with respect to a ratio between the maximum net throughput on MAC layer and the amount of the overall requested resources.

Abstract: There is disclosed a method of centralized scheduling of the access to a common radio channel in multi-hop wireless networks. The requests by the relay nodes (RN(1,1) . . . RN(n,Nn), RNi) of resources for sending uplink flows towards the base station (BS), and/or downlink flows towards relay nodes (RN(1,1) . . . RN(n,Nn), RNi) are computed by a requesting node for all links up to the destination and sent as cumulative requests for all links concerned. In case the traffic for which access to the common channel is demanded relates to different classes of service, each cumulative request includes the concatenation of a plurality of individual cumulative requests each concerning traffic belonging to a different class of service.

Abstract: Requests of resources of uplink flows towards a base station (BS) and/or downlink flows towards end nodes are computed by each requesting node on an end-to-end basis. Each requesting node issues a cumulative request given by summing up the same request for each link separating the node from the BS plus each link separating the BS from the destination node, enabling the centralized node to perform connection based scheduling. The BS in response to all cumulative requests grants uplink and/or downlink resources for each link. The profile of grants is equal to the profile of requests when the amount of resources requested is below the maximum net throughput on MAC layer. When not below the maximum net through-put on MAC layer, the ideal profile of grants is normalized with respect to a ratio between the maximum net throughput on MAC layer and the amount of the overall requested resources.