Abstract: Embodiments of the present disclosure include a system that may allow a mobile device to access a transient mobile application while the user is in a restricted area. The system may include a mobile device, a handover device, a network, a captive portal server, and an application server. The mobile device may interact with a handover device to automatically connect to the network. Once connected to the network, the captive portal server may connect the mobile device to a captive portal. The mobile device may then automatically launch a browser and be redirected to a web address of a transient mobile application. The user may interact with the application while the user is connected to the network and within a restricted area. Once the user leaves the restricted area, he/she may no longer have access to the transient mobile application.

Abstract: Embodiments of the present disclosure include a system that may allow a mobile device to access a transient mobile application while the user is in a restricted area. The system may include a mobile device, a handover device, a network, a captive portal server, and an application server. The mobile device may interact with a handover device to automatically connect to the network. Once connected to the network, the captive portal server may connect the mobile device to a captive portal. The mobile device may then automatically launch a browser and be redirected to a web address of a transient mobile application. The user may interact with the application while the user is connected to the network and within a restricted area. Once the user leaves the restricted area, he/she may no longer have access to the transient mobile application.

Abstract: This method of converting a computational formula having been acquired in the form of a tree structure containing at least one node associated with a parameterized conditional branching operation and connected to at least a first and a second child node, the child node which is associated with the operation which is not executed and the set of nodes which have this child node as parent node being called ‘dead branch’, this method comprising: —the identification and the deletion (198) of the dead branch corresponding to the acquired value of a conditional parameter so as to obtain a computational formula pruned of this dead branch, and—the compilation (208) of the computational formula pruned of the dead branch so as to obtain the code executable by a chip card.

Abstract: This method of converting a computational formula having been acquired in the form of a tree structure containing at least one node associated with a parameterized conditional branching operation and connected to at least a first and a second child node, the child node which is associated with the operation which is not executed and the set of nodes which have this child node as parent node being called ‘dead branch’, this method comprising:—the identification and the deletion (198) of the dead branch corresponding to the acquired value of a conditional parameter so as to obtain a computational formula pruned of this dead branch, and—the compilation (208) of the computational formula pruned of the dead branch so as to obtain the code executable by a chip card.