FR3083949B1 - PROCESS FOR RELIABILITY OF A COMMUNICATION BETWEEN AT LEAST ONE REMOTE SERVER AND ONE SERVER, BY AUTOMATIC MATCHING OF REFERENCE DATA - Google Patents

PROCESS FOR RELIABILITY OF A COMMUNICATION BETWEEN AT LEAST ONE REMOTE SERVER AND ONE SERVER, BY AUTOMATIC MATCHING OF REFERENCE DATA Download PDF

Info

Publication number
FR3083949B1
FR3083949B1 FR1856542A FR1856542A FR3083949B1 FR 3083949 B1 FR3083949 B1 FR 3083949B1 FR 1856542 A FR1856542 A FR 1856542A FR 1856542 A FR1856542 A FR 1856542A FR 3083949 B1 FR3083949 B1 FR 3083949B1
Authority
FR
France
Prior art keywords
descriptive
pair
elements
descriptive elements
server
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
FR1856542A
Other languages
French (fr)
Other versions
FR3083949A1 (en
Inventor
Emmanuel Ferreira
Daniel Salas
Killian Janod
Celine Alby
Michel Benoit
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ismart
Original Assignee
Ismart
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ismart filed Critical Ismart
Priority to FR1856542A priority Critical patent/FR3083949B1/en
Publication of FR3083949A1 publication Critical patent/FR3083949A1/en
Application granted granted Critical
Publication of FR3083949B1 publication Critical patent/FR3083949B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6227—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database where protection concerns the structure of data, e.g. records, types, queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/10—Text processing
    • G06F40/12—Use of codes for handling textual entities
    • G06F40/151—Transformation
    • G06F40/157—Transformation using dictionaries or tables
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/30—Semantic analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/04—Architecture, e.g. interconnection topology
    • G06N3/044—Recurrent networks, e.g. Hopfield networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/04—Architecture, e.g. interconnection topology
    • G06N3/045—Combinations of networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/08—Learning methods
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
    • H04L63/101—Access control lists [ACL]

Abstract

Procédé (10) de fiabilisation d'une communication entre au moins un serveur distant (Sd) et un serveur (Sv), la fiabilisation de la communication consistant à déterminer à partir d'un nouvel élément descriptif, une entité recherchée, parmi une pluralité d'entités, le serveur (Sv) comprenant une base d'une pluralité d'éléments descriptifs, chaque entité de la pluralité d'entités étant associée sur le serveur (Sv) avec au moins un élément descriptif de la pluralité d'éléments descriptifs, le procédé comprenant une étape (99) de réception du message et de détermination du nouvel élément descriptif contenu dans le message, une phase (101) de sélection d'au moins une hypothèse de mise en correspondance entre le nouvel élément descriptif et un élément descriptif parmi les éléments descriptifs de la pluralité d'éléments descriptifs, ou un élément descriptif parmi les éléments descriptifs d'un sous-ensemble de la pluralité d'éléments descriptifs, ladite phase de sélection déterminant au moins un couple d'éléments descriptifs comprenant le nouvel élément descriptif et un des éléments descriptifs de la pluralité d'éléments descriptifs ou du sous-ensemble de la pluralité d'éléments descriptifs, chaque couple d'éléments descriptifs de l'au moins un couple définissant une hypothèse de mise en correspondance de l'au moins une hypothèse de mise en correspondance; une étape (102) de calcul, par un classifieur, d'un score de confiance pour chaque couple de l'au moins un couple d'éléments descriptifs; une étape (103) d'ordonnancement de l'au moins un couple d'éléments descriptifs pour déterminer un ordre des scores de confiance calculés pour chaque couple de l'au moins un couple d'éléments descriptifs, une étape (104) de détermination de l'entité recherchée associée avec le nouvel élément descriptif, sur la base du classement de l'au moins un couple d'éléments descriptifs dans l'ordre des scores de confiance.Method (10) for making a communication reliable between at least one remote server (Sd) and a server (Sv), the reliability of the communication consisting in determining from a new descriptive element, a sought-after entity, from among a plurality of entities, the server (Sv) comprising a base of a plurality of descriptive elements, each entity of the plurality of entities being associated on the server (Sv) with at least one descriptive element of the plurality of descriptive elements , the method comprising a step (99) of receiving the message and determining the new descriptive element contained in the message, a phase (101) of selecting at least one hypothesis of correspondence between the new descriptive element and an element descriptive among the descriptive elements of the plurality of descriptive elements, or a descriptive element among the descriptive elements of a subset of the plurality of descriptive elements, said selection phase determining at least a pair of descriptive elements comprising the new descriptive element and one of the descriptive elements of the plurality of descriptive elements or of the subset of the plurality of descriptive elements, each pair of descriptive elements of the at least one pair defining a matching hypothesis of the at least one matching hypothesis; a step (102) of calculating, by a classifier, a confidence score for each pair of at least one pair of descriptive elements; a step (103) of scheduling the at least one pair of descriptive elements to determine an order of the confidence scores calculated for each pair of the at least one pair of descriptive elements, a step (104) of determining of the searched entity associated with the new descriptive element, on the basis of the ranking of the at least one pair of descriptive elements in the order of the confidence scores.

FR1856542A 2018-07-16 2018-07-16 PROCESS FOR RELIABILITY OF A COMMUNICATION BETWEEN AT LEAST ONE REMOTE SERVER AND ONE SERVER, BY AUTOMATIC MATCHING OF REFERENCE DATA Active FR3083949B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
FR1856542A FR3083949B1 (en) 2018-07-16 2018-07-16 PROCESS FOR RELIABILITY OF A COMMUNICATION BETWEEN AT LEAST ONE REMOTE SERVER AND ONE SERVER, BY AUTOMATIC MATCHING OF REFERENCE DATA

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR1856542A FR3083949B1 (en) 2018-07-16 2018-07-16 PROCESS FOR RELIABILITY OF A COMMUNICATION BETWEEN AT LEAST ONE REMOTE SERVER AND ONE SERVER, BY AUTOMATIC MATCHING OF REFERENCE DATA
FR1856542 2018-07-16

Publications (2)

Publication Number Publication Date
FR3083949A1 FR3083949A1 (en) 2020-01-17
FR3083949B1 true FR3083949B1 (en) 2021-08-06

Family

ID=65494193

Family Applications (1)

Application Number Title Priority Date Filing Date
FR1856542A Active FR3083949B1 (en) 2018-07-16 2018-07-16 PROCESS FOR RELIABILITY OF A COMMUNICATION BETWEEN AT LEAST ONE REMOTE SERVER AND ONE SERVER, BY AUTOMATIC MATCHING OF REFERENCE DATA

Country Status (1)

Country Link
FR (1) FR3083949B1 (en)

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7260568B2 (en) * 2004-04-15 2007-08-21 Microsoft Corporation Verifying relevance between keywords and web site contents
US20080021887A1 (en) * 2006-01-19 2008-01-24 Intelliscience Corporation Data product search using related concepts
US8255396B2 (en) * 2008-02-25 2012-08-28 Atigeo Llc Electronic profile development, storage, use, and systems therefor
CN106796578B (en) * 2014-08-06 2019-05-10 凯巴士有限公司 Autoknowledge system and method and memory

Also Published As

Publication number Publication date
FR3083949A1 (en) 2020-01-17

Similar Documents

Publication Publication Date Title
US10810536B2 (en) System and method for dynamic pairing function optimization
DE112015006585B4 (en) Driving assistance device, driving assistance server and driving assistance system
US10257660B2 (en) Systems and methods of sourcing hours of operation for a location entity
AU2015324030B2 (en) Identifying temporal demand for autocomplete search results
US11755960B2 (en) System and method for reserving drivers with minimum fare offers and navigating drivers to service transportation requests
JP2018530804A5 (en) Multi-sensor event correlation system
US20150234891A1 (en) Method and system for providing code scanning result information
CN205451095U (en) A face -identifying device
US11853959B1 (en) Drive-thru system implementing location tracking
US20150172864A1 (en) Apparatus and Method for Ascertaining the Operating Hours of a Business
US11042541B2 (en) Electronic device and method for controlling the same
US20230206034A1 (en) Prediction of Next Place Visits on Online Social Networks
US10602315B2 (en) System and method for providing a platform for creating, browsing and searching a journal of activities of a user
US11439870B2 (en) Equipment use tracking and availability prediction
US20160253394A1 (en) Data hub architecture to provide actionable data from remote sensor feeds
FR3089038B1 (en) PROCESS FOR LEARNING A NETWORK OF NEURONES ON BOARD IN AN AIRCRAFT FOR LANDING ASSISTANCE OF THE SAID AIRCRAFT AND SERVER FOR THE IMPLEMENTATION OF SUCH A PROCEDURE
US20190295409A1 (en) Traffic information providing system and traffic information providing method
FR3083949B1 (en) PROCESS FOR RELIABILITY OF A COMMUNICATION BETWEEN AT LEAST ONE REMOTE SERVER AND ONE SERVER, BY AUTOMATIC MATCHING OF REFERENCE DATA
FR3051579B1 (en) METHOD FOR SECURING AN ELECTRONIC DEVICE, AND CORRESPONDING ELECTRONIC DEVICE
FR3081354B1 (en) LUGGAGE SORTING PROCESS IN AN AIRPORT
US20220171980A1 (en) Detecting The Same Type of Objects in Images Using Machine Learning Models
FR3062499B1 (en) METHOD FOR REDUCING THE SIZE OF A DISTRIBUTED BLOCK CHAIN-DATABASE, DEVICE AND PROGRAM THEREOF
FR3105847B1 (en) DATA FLOW MANAGEMENT PROCESS AND SYSTEM FOR THE UNIFIED GOVERNANCE OF A NUMBER OF INTENSIVE COMPUTING SOLUTIONS
FR3090166B1 (en) Method, system and apparatus for assisting navigation
US20210368002A1 (en) Intelligent routing of media items

Legal Events

Date Code Title Description
PLFP Fee payment

Year of fee payment: 2

PLSC Publication of the preliminary search report

Effective date: 20200117

PLFP Fee payment

Year of fee payment: 3

PLFP Fee payment

Year of fee payment: 4

PLFP Fee payment

Year of fee payment: 5

PLFP Fee payment

Year of fee payment: 6