Abstract: A communication device and method therein for handover from a serving cell to a target cell in a communication network are disclosed. The communication device is configured to obtain a first round trip time between the communication device via the network node and a server and obtain a second round trip time between the communication device via a target node in the target cell and the server. The communication device is further configured to send a request for handover from the serving cell to the target cell based on at least the first round trip time and the second round trip time.

Abstract: A network node and method therein for assisting a communication device t o perform handover from a serving cell to a target cell in a communication network are disclosed. The network node is configured to obtain a first round trip time between the network node and a server and obtain a second round trip time between a target node in the target cell and the server. The network node is further configured to instruct the communication device to perform handover from the serving cell to the target cell based on at least the first round trip time and the second round trip time.

Abstract: A controller arrangement comprising a transceiver capable of communication via a wireless communication network, a controller arranged to control a physical entity at which the controller arrangement is arranged, and an interface between the transceiver and the controller is disclosed. The transceiver is arranged to provide information via the interface about present or imminent interrupts in the communication via the wireless network. The controller is arranged to operate in at least a first state when the information indicates that no interrupts are present or imminent, wherein the first state includes closed loop control from a remote entity via the wireless communication network, and a second state when the information indicates that interrupts are present or imminent, wherein the second state includes autonomous control operations by the controller. A method and computer program are also disclosed.

Abstract: A network node comprising a memory and a controller, wherein said controller is configured to: detect that a handover for a mobile communications terminal from a first base station to a second base station and in response thereto determine if an application module associated with the mobile communications terminal is to be migrated, and if so, cause a migration of said application module to be performed.

Abstract: A downlink physical layer processing system includes a transport block segmentation processor that receives a transport block and generates segmented blocks from the transport block, an encoder that encodes the segmented blocks and forms encoded blocks, a mapping processor that maps the encoded blocks to symbols corresponding to resource elements to generate mapped symbols for transmission over a transmission medium, and a transmission signal generator that processes the mapped symbols to generate transmission signals for transmission over the transmission medium. The mapping processor maps the encoded blocks to the symbols in response to a control signal generated by the transmission signal generator. The encoder thereby operates in response to timing of data received by the encoder while the mapping processor operates in response to timing of processing of symbols by the transmission signal generator.

Abstract: A network node comprising a memory and a controller, wherein said controller is configured to: detect that a handover for a mobile communications terminal from a first base station to a second base station and in response thereto determine if an application module associated with the mobile communications terminal is to be migrated, and if so, cause a migration of said application module to be performed.

Abstract: A method of statically testing dependence in a dataflow program is provided, the method comprising receiving a dataflow program which provides parameters, including consumption rates, production rates on connections between actors in the program and a number of initial samples (delays) on the connections, generating from the parameters a model of a precedence graph for the dataflow program representing dependence constraints between distinct firings of the number of actors. For the model, determining a feedback distance between multiple firings of a same actor, determining sets of parallel regions comprising a given number of actor firings of a same actor, composing mutually independent component regions comprising at least a part of the sets of parallel regions, and composing one or more composite regions comprising one or more component regions and/or one or more sets of parallel regions, being composed so that a pre-determined criteria is satisfied.

Abstract: A downlink physical layer processing system includes a transport block segmentation processor that receives a transport block and generates segmented blocks from the transport block, an encoder that encodes the segmented blocks and forms encoded blocks, a mapping processor that maps the encoded blocks to symbols corresponding to resource elements to generate mapped symbols for transmission over a transmission medium, and a transmission signal generator that processes the mapped symbols to generate transmission signals for transmission over the transmission medium. The mapping processor maps the encoded blocks to the symbols in response to a control signal generated by the transmission signal generator. The encoder thereby operates in response to timing of data received by the encoder while the mapping processor operates in response to timing of processing of symbols by the transmission signal generator.

Abstract: Processing a dataflow program by a program development tool includes detecting a pair of actors defined by dataflow program instructions, wherein the pair of actors include a producer actor and a consumer actor, the producer actor supplying a data structure to the consumer actor via a path that comprises at least one connection and possibly also intervening other actors. An analysis is performed including analyzing one or more operations of the producer actor that involve the data structure and/or analyzing one or more operations of the consumer actor that involve the data structure. A result of the analysis is used as a basis for selecting a minimal amount of information from among a plurality of data handling possibilities concerning the data structure. A transformed program is produced in which the selected minimal amount of information is caused to be passed from the producer actor to the consumer actor.

Abstract: A dataflow program defining actors that pass tokens from one to another via connections is processed by causing one or more processors to access and execute instructions of the dataflow program. As instructions of the dataflow program are being executed, a first set of trace records is created that represents a sequence of events (e.g., token production/consumption, actor state change, or action firing). A first subset of the trace records is displayed and one of these is selected. The first set is processed to identify, based on definitions specified by the dataflow program, a second set of trace records, of which a subset is displayed.

Abstract: A method of statically testing dependence in a dataflow program is provided, the method comprising receiving a dataflow program which provides parameters, including consumption rates, production rates on connections between actors in the program and a number of initial samples (delays) on the connections, generating from the parameters a model of a precedence graph for the dataflow program representing dependence constraints between distinct firings of the number of actors. For the model, determining a feedback distance between multiple firings of a same actor, determining sets of parallel regions comprising a given number of actor firings of a same actor, composing mutually independent component regions comprising at least a part of the sets of parallel regions, and composing one or more composite regions comprising one or more component regions and/or one or more sets of parallel regions, being composed so that a pre-determined criteria is satisfied.

Abstract: A dataflow source program is processed by a program development tool. Processing includes retrieving stored dataflow source program instructions from a memory. The tool ascertains a target model of computation (e.g., via an indicator embedded within the source program itself) to which the retrieved dataflow source program instructions are intended to conform. A dynamic behavior of the retrieved dataflow source program instructions is analyzed, and a compliance result is produced therefrom that includes an indication of whether the retrieved dataflow source program instructions conform to the target model of computation. The compliance result is then output to a user of the program development tool, so that it can inform and guide the improvement and further development of the program.

Abstract: Processing a dataflow program by a program development tool includes detecting a pair of actors defined by dataflow program instructions, wherein the pair of actors include a producer actor and a consumer actor, the producer actor supplying a data structure to the consumer actor via a path that comprises at least one connection and possibly also intervening other actors. An analysis is performed including analyzing one or more operations of the producer actor that involve the data structure and/or analyzing one or more operations of the consumer actor that involve the data structure. A result of the analysis is used as a basis for selecting a minimal amount of information from among a plurality of data handling possibilities concerning the data structure. A transformed program is produced in which the selected minimal amount of information is caused to be passed from the producer actor to the consumer actor.

Abstract: A dataflow program defining actors that pass tokens from one to another via connections is processed by causing one or more processors to access and execute instructions of the dataflow program. As instructions of the dataflow program are being executed, a first set of trace records is created that represents a sequence of events (e.g., token production/consumption, actor state change, or action firing). A first subset of the trace records is displayed and one of these is selected. The first set is processed to identify, based on definitions specified by the dataflow program, a second set of trace records, of which a subset is displayed.

Abstract: A dataflow program defining actors that pass tokens from one to another via connections is processed by causing one or more processors to access and execute instructions of the dataflow program. Execution of the dataflow program generates events (e.g., token production/consumption, actor state after actor action firing). For each generated event, processing evaluates whether there exists a sequence of events that matches a breakpoint condition, and if such a sequence exists then execution of the dataflow program is halted. The breakpoint condition is at least partially based on an extended history of related events, wherein two events are related to one another if they pertain to a same connection or if they pertain to a same actor state, and wherein the extended history comprises at least two related events.

Abstract: A computer-implemented method of generating tamper-protected computer program code. The method comprises obtaining a representation of the computer program code, the computer program being adapted to cause a data processing system to perform a plurality of computational tasks in a first order of execution, each computational task being represented in the representation of the computer program code by at least one program statement; obtaining a plurality of alternative orders of execution of the computational tasks; generating an executable representation of the program code adapted to cause a data processing system to select a randomized order of execution from the plurality of alternative orders of execution and to execute the computational tasks in the selected randomized order of execution.

Abstract: A computer-implemented method of tamper-protecting computer program code. The method comprises: obtaining an input representation of the computer program code; identifying a conditional program statement for causing a data processing system to selectively execute one of at least a first and a second sets of program statements when said computer program is executed by a data processing system; replacing said identified conditional program statement and the first and second sets of program statements with a set of transformed program statements to obtain obfuscated program code, wherein the set of transformed program statements is adapted to cause the data processing system to execute at least a part of each of the transformed program statements when said computer program is executed by the data processing system.

Abstract: A method of generating a delta file, the delta file including update instructions for causing a target processing device to transform a current memory image module into an updated memory image module. The method includes: incorporating a parametric representation of a first memory address in the delta file, the parametric representation being parametric with respect to at least one parameter; and incorporating parameter resolution instructions in the delta file, wherein the parameter resolution instructions are adapted to cause the target processing device to determine a value of said at least one parameter and to determine an address value of the first memory address from the parametric representation and the determined value of said at least one parameter.

Abstract: A computer-implemented method of tamper-protecting a computer program, the method comprising: processing an input representation of the computer program to identify a function call for causing a data processing system to continue execution of the computer program at a predetermined entry point memory address when said computer program is executed by a data processing system; replacing the identified function call with a modified function call, wherein the modified function call includes an algebraic expression for causing the data processing system to compute the entry point memory address when said computer program is executed by the data processing system.

Abstract: Disclosed is a method for updating program code stored in a memory, which memory comprises a plurality of memory sectors. The method comprises transforming an updated input code into an updated program code version to be stored in a memory, which memory has stored thereon a current program code version occupying a first set of the memory sectors of the memory, wherein the updated program code version occupies a second set of memory sectors when stored in the memory. The transforming step further comprises receiving a representation of the current program code version; and performing at least one optimization step adapted to decrease the number of memory sectors of the second set of memory sectors occupied by the updated code version that are different from the corresponding memory sectors of the first set of memory sectors occupied by the current program code version.