Patents by Inventor Claudine Reynaud

Claudine Reynaud has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9129051
    Abstract: A faring system includes a production facility including at least one fare shopping server, a staging facility including at least one fare shopping server, and an entry point for conducting bi-directional communications with customers. The staging facility further includes a database storing transformation rules and a traffic generation subsystem configured to receive a transaction via the entry point from a customer, to determine if the received request is one suitable for use in generating simulation data for the fare shopping server of the staging system and, if so, to modify the received transaction in accordance with at least one rule retrieved from the database to create at least one modified transaction, and to send the at least one modified transaction to the fare shopping server of the staging facility for processing. The fare shopping server of the staging facility processes the modified transaction for evaluating a potential new or modified functionality of the faring system.
    Type: Grant
    Filed: September 20, 2010
    Date of Patent: September 8, 2015
    Assignee: Amadeus S.A.S.
    Inventors: Rudy Daniello, Luc Isnardy, Claudine Reynaud, Eric S. Mountain, Damien Ciabrini
  • Patent number: 9098881
    Abstract: The method according to a preferred embodiment of the present invention provides a pre-shopping reservation tool which allows storing entire catalogs of air travels from many providers, while ensuring a high cache accuracy at limited operational costs. The system makes use of the fares knowledge to merge identical travel recommendations coming from different travel providers (airline, travel agencies) when possible, i.e. when fares are public and not negotiated for a specific travel provider. This prevents redundant prices to be stored in the system and improves its cost effectiveness. The system according to a preferred embodiment of the present invention relies on several dedicated data analysis engines to optimize the cost of data pre-computations while at the same time maintaining good data accuracy.
    Type: Grant
    Filed: July 18, 2011
    Date of Patent: August 4, 2015
    Assignee: Amadeus S.A.S.
    Inventors: Damien Ciabrini, Claudine Reynaud, Guillaume Legrand, Rémy Gole′, Luc Isnardy
  • Publication number: 20120330693
    Abstract: The method according to a preferred embodiment of the present invention provides a pre-shopping reservation tool which allows storing entire catalogues of air travels from many providers, while ensuring a high cache accuracy at limited operational costs. The system makes use of the fares knowledge to merge identical travel recommendations coming from different travel providers (airline, travel agencies) when possible, i.e. when fares are public and not negotiated for a specific travel provider. This prevents redundant prices to be stored in the system and improves its cost effectiveness. The system according to a preferred embodiment of the present invention relies on several dedicated data analysis engines to optimize the cost of data pre-computations while at the same time maintaining good data accuracy.
    Type: Application
    Filed: July 18, 2011
    Publication date: December 27, 2012
    Inventors: Damien Ciabrini, Claudine Reynaud, Guillaume Legrand, Rémy Gole, Luc Isnardy
  • Publication number: 20120284062
    Abstract: The method according to a preferred embodiment of the present invention allows an improved travel request service to end-users who request proposals for a trip from a Global Distribution System (GDS). This uses a new travel request which comprises a wider range for each search parameter than previous travel requests from the prior art. The new travel request includes many different ranges of parameters in the same travel request whereas the prior art travel request has to be repeated for each different requested value for each search parameter. The method according to a preferred embodiment of the present invention provides a combination of two modules, a master module and a worker module, to carry out the improved travel request service.
    Type: Application
    Filed: May 20, 2011
    Publication date: November 8, 2012
    Inventors: Jean-Philippe Aubry, Benoit Janin, Rudy Daniello, Luc Isnardy, Claudine Reynaud
  • Publication number: 20120030057
    Abstract: A faring system includes a production facility including at least one fare shopping server, a staging facility including at least one fare shopping server, and an entry point for conducting bi-directional communications with customers. The staging facility further includes a database storing transformation rules and a traffic generation subsystem configured to receive a transaction via the entry point from a customer, to determine if the received request is one suitable for use in generating simulation data for the fare shopping server of the staging system and, if so, to modify the received transaction in accordance with at least one rule retrieved from the database to create at least one modified transaction, and to send the at least one modified transaction to the fare shopping server of the staging facility for processing. The fare shopping server of the staging facility processes the modified transaction for evaluating a potential new or modified functionality of the faring system.
    Type: Application
    Filed: September 20, 2010
    Publication date: February 2, 2012
    Inventors: Rudy Daniello, Luc Isnardy, Claudine Reynaud, Eric S. Mountain, Damien Ciabrini
  • Patent number: 7971000
    Abstract: The invention concerns a method and a system for maintaining consistency of a cache memory, accessible by multiple independent processes. The processes can share common data. The processes perform simultaneous data searching operations optionally followed by providing the data to the processes, a removal of same or an insertion of new data. The searching, removal and insertion operations, are comprehensively executed once they have been initiated by the independent processes. They are executed excluding one another when they must operate on common data. The removal or insertion operations are each completely reversible. In that context, the invention provides that the operations for providing, removing or inserting the data have a finite or bound duration of execution so as to prevent any locking.
    Type: Grant
    Filed: March 8, 2006
    Date of Patent: June 28, 2011
    Assignee: Amadeus s.a.s.
    Inventors: Frédérick Ros, Rudy Daniello, Luc Isnardy, Claudine Reynaud, Wayne Rubenstein
  • Publication number: 20080183970
    Abstract: A method and a system maintain consistency of a cache memory, accessible by multiple independent processes. The processes can share common data, and perform simultaneous data searching operations optionally followed by providing the data to the processes, and data removal/insertion. The searching, removal and insertion operations are comprehensively executed once initiated by processes, excluding one another when they must operate on common data. Removal and insertion are reversible. Providing, removing and inserting the data have a finite execution duration, preventing locking. Particularly, insertion (including a step of releasing an input when a partition of the cache memory is full) if requiring browsing through the entire partition to make a selection, is possibly interrupted if maximum browsing time is reached. Here, the most appropriate input among those already browsed is released.
    Type: Application
    Filed: March 8, 2006
    Publication date: July 31, 2008
    Applicant: AMADEUS S.A.S.
    Inventors: Frederick Ros, Rudy Daniello, Luc Isnardy, Claudine Reynaud, Wayne Rubenstein