Abstract:
Method and system for separating a unified personal data account which is associated with at least two personal data services includes: a step (40) for accessing the unified personal data account (128); a step (50) for requesting separation into at least two personal data accounts which are each associated with different personal data services; and a step (60) for distributing the elements of the unified personal data account between the at least two personal data accounts.
Abstract:
A communicating object comprising long-range wireless communication means, active short-range wireless location means and control means designed, on the one hand, to activate and/or deactivate, at least partly, the power supply for the long-range communication means and, on the other hand, to deactivate, at least partly, the power supply for the short-range location means.
Abstract:
In order to prevent the use of a virtual prepaid card illegitimately acquired and transmitting only one identification code, for example read after the card has been scratched, to a service provision server, a second code is delivered on paying for the card, and the two codes have to be authenticated so that the user-purchaser of the card can subsequently use the service concerned in the server still using only the first code.
Abstract:
By utilizing IMPS technology and transient objects or object identifiers, a method and system can notify registered participants of changes in the status of those transient objects. One use of such technology is in the area of on-line auctions, but other uses include the general area of distributed queuing for an item of interest (or a subject of interest) and dispatching to similarly interested users, through transitive presence, information concerning corresponding transactions or actions.
Abstract:
A method and a system (6) for coordinating the use of telecommunications service providers (7). The method grants a service request submitted by a user (8) to a service provider (7) as a function of the current state of a state diagram of a unique environment of the user (8) and events associated with the service request. The coordination system (6) includes an access module (11), a profile manager module (13), a user agreement module 14 and at least one environment manager (15).
Abstract:
A method and system for electronic voting over a network, from a terminal (Te) connected to an administrative server (SA) and to a vote-counting server (SCV). An authentication certificate (CA) and a single-use password (UPWe) are calculated and transmitted (A) from the server (SA) to the voter (Eu), an electronic ballot paper (EB) and an anonymous reference (AREu) are transmitted (B) from the terminal (Te) to the server (SCV) and, upon verification (B1) of the anonymous reference, the vote and the paper are validated (B3), the paper is counted, a confirmation of receipt (ACW) and an electoral register document (DVR) are transmitted from the server (SCV) to the terminal (Te). The terminal (Te) signs the register and transmits (C) the signed register (SDVR) to the server (SA) which closes (D1) the vote of the voter (Eu).
Abstract:
In a fair blind signature process, a user interacts with a signer in order to complete a 7-tuple (A,e,s,t,xu,x,m) such that Ae=a0α1x α2m α3u α4t α5s (mod n), where a0, a1, a2, a3, a4 and a5 and n are elements of the Signer's public key (PUBKs). During the signature-issuing phase the user (U) provides the signer (S) with a data element (α1x) encrypted according to a key (f) known to a trusted authority (TA), and this data element (α1x) is disclosed during transmission of the signed message. Similarly, the signed message is transmitted associated with second encrypted data comprising a second data element (α3xu) encrypted according to a key (f) known to the trusted authority (TA), and this second data element (α3xu) is disclosed to the Signer during the signature-issuing phase. Thus, the trusted authority (TA) can revoke the anonymity of the digital signature.
Abstract:
A technique for the allocation and pricing of a resource among n buying agents during an auction bid. A bid sent by each buying agent in the form of a resource demand function si(p) is received, and a datum corresponding to the equilibrium price p* is calculated from the sum S of the n demand functions si(p), by means of the relation: S(p*)=Q. All of the bids received during a predetermined period corresponding to a round of bidding are processed in order to determine the quantity of a resource to be allocated to each buying agent. This is followed by the calculation of the data corresponding to the quantity ai to be allocated for this equilibrium price p* to each buying agent i based on its demand function si such that ai=si(p*). The management system utilizes the calculated data to allocate the corresponding quantities of the resource, and this data is stored in order to calculate the price to be billed to each buying agent.
Abstract:
A process for generating a performance model from a functional model for a system including a plurality of distributed hardware and software entities that engage to provide a service to at least one user. The process distributes the representative system requests in a finite number of groups and identifies, for each request group, the corresponding execution flow, formalizes the execution flows by a notation that makes it possible to highlight the causal relationships between the different software entities of the system that are involved in the execution flows and the data characterizing the system's resource consumption, develops an intermediate model, and automates the conversion of the developed intermediate model into a performance model.
Abstract:
A technique for measuring the receive bit rate available to a client terminal adapted to be connected to a data server via a communications network. The client terminal is connected to a bit rate measuring application host server, a bit rate measuring application is downloaded from the bit rate measuring application host server to the client terminal. The bit rate measuring application is run by connecting the client terminal to a test server, downloading a test file from the test server to the client terminal, and measuring a downloading bit rate for the test file.