METHODS AND DEVICES FOR THE DETERMINATION OF CORE DEPENDENT LOSS IN MULTI-CORE FIBER TRANSMISSION SYSTEMS USING CORE SCRAMBLING

    公开(公告)号:WO2019206639A1

    公开(公告)日:2019-10-31

    申请号:PCT/EP2019/059139

    申请日:2019-04-10

    Abstract: The various embodiments of the invention provide an optical transmission system (100) comprising an optical transmitter (11) configured to transmit data over an optical fiber transmission channel (13) comprising a multi-core fiber, said data being carried by optical signals, said optical signals propagating along the multi-core fiber according to two or more cores, said multi-core fiber being associated with fiber parameters and misalignment losses values, at least one scrambling device (133) being arranged in said optical fiber transmission channel (13) for scrambling said two or more cores according to a scrambling function, wherein the optical fiber transmission channel (13) comprises a system configuration device (17) configured to determine a core dependent loss value depending on the fiber parameters, at least one misalignment loss, a number of said at least one scrambling device (133), and the scrambling function.

    METHOD AND APPARATUS FOR USER DISTRIBUTION TO SUB-BANDS IN MULTIPLE ACCESS COMMUNICATIONS SYSTEMS

    公开(公告)号:WO2019185427A1

    公开(公告)日:2019-10-03

    申请号:PCT/EP2019/057003

    申请日:2019-03-20

    Abstract: A mechanism is presented for attributing users to one or more of a plurality of sub-bands in a multiple access communications system, in which in an initial assignment phase, a first user is selected for a sub band, for example on the basis of a user priority. Users having complementary channel gains to that of the first user are identified, and then a second sub-band user maximizing a performance metric reflecting the achieved throughput, and/or fairness across users, is selected to accompany the first user on that sub-band. The initial assignment phase may terminate once all users have been assigned to a sub-band once. After the first phase is complete, the first user for each sub- band may be the user whose achieved total throughput is furthest from a target throughput defined for that user, wherein each user is assigned to the remaining sub-band to which no first user is currently attributed offering the highest channel gain for that user. Mechanisms for determining user priority, making provisional and definitive power allocations, and performance metrics are proposed.

    CONFIGURABLE MULTIBAND ANTENNA ARRANGEMENT WITH A MULTIELEMENT STRUCTURE AND DESIGN METHOD THEREOF

    公开(公告)号:WO2019121553A1

    公开(公告)日:2019-06-27

    申请号:PCT/EP2018/085282

    申请日:2018-12-17

    CPC classification number: H01Q1/36 H01Q5/25 H01Q5/371 H01Q9/42

    Abstract: The invention discloses a multiband antenna arrangement comprising at least two main conductive elements, the first main conducting element resonating at a first fundamental mode of a first electromagnetic radiation and the second main conducting element resonating at a second fundamental mode of a second electromagnetic radiation, wherein the second main conductive element is connected to the first main conductive element at a feed connection located at a position defined as a function of bellies of current of the first electromagnetic radiation and the antenna arrangement has more resonating modes than the first main conductive element. The antenna arrangement may also be configured so that some of the resonating modes of the first main conductive element have a bandwidth that is enlarged in comparison to the corresponding bandwidth of these resonating modes for the first main conductive element. According to the invention, a design method of the antenna arrangement to provide a match between the resonating modes of the antenna arrangement and a specification defined by a list of frequencies and, possibly, corresponding bandwidths at a predefined matching level and selectivity, as well, as in certain embodiments, a predefined form factor.

    PROCÉDÉ D'EXTRACTION DE DONNÉES D'UNE BASE DE DONNÉES TATOUÉES SELON UN MÉCANISME DE TATOUAGE RÉVERSIBLE

    公开(公告)号:WO2018096126A1

    公开(公告)日:2018-05-31

    申请号:PCT/EP2017/080428

    申请日:2017-11-24

    Abstract: La présente invention propose un procédé d'extraction de données rapide et fiable pour extraire des données d'une base de données tatouées (3) selon un mécanisme de tatouage réversible. Le procédé selon l'invention consiste à obtenir, à partir d'une première requête d'extraction reçue d'un terminal client (1), une deuxième requête d'extraction (R2) pour extraire des données tatouées et une troisième requête (R3) appliquée aux données extraites après avoir été détatouées. En présence dans la première requête d'extraction de conditions de sélection initiales portant sur des attributs tatoués, celles-ci sont incluses dans la deuxième requête après avoir été transformées. En présence dans la première requête d'extraction (R1), de fonctions d'agrégation portant sur un attribut tatoué d'extraction, celles-ci sont incluses sans modification dans la troisième requête (R3) de manière à fournir au terminal client (1) un résultat en réponse à la première requête d'extraction (R1).

    PROCÉDÉ D'INSERTION DE DONNÉES À LA VOLÉE DANS UNE BASE DE DONNÉES TATOUÉES ET DISPOSITIF ASSOCIÉ

    公开(公告)号:WO2018096125A1

    公开(公告)日:2018-05-31

    申请号:PCT/EP2017/080426

    申请日:2017-11-24

    Abstract: La présente invention propose un procédé et dispositif associé pour insérer des tuples dans une base de données tatouées sans avoir à détatouer l'intégralité ou une partie de la base de données avant d'insérer chaque tuple. Pour cela, l'invention consiste à stocker dans des métadonnées de tatouage, le type des groupe ou classe dans lesquels les tuples de la base de données ont été répartis lors du tatouage de la base de données. Pour chaque type de groupes ou classes, sont également stockés dans les métadonnées de tatouage une règle définissant une modification de la valeur d'au moins un attribut sur lequel porte le tatouage, en fonction d'un paramètre de force d'insertion. Chaque tuple à insérer est tatoué en appliquant la règle de modification en fonction du groupe auquel le tuple appartient. En raison de la règle utilisée, l'insertion du tuple tatoué ne modifie pas le type de groupe auquel il appartient.

    SECRET KEY ESTIMATION METHODS AND DEVICES
    268.
    发明申请
    SECRET KEY ESTIMATION METHODS AND DEVICES 审中-公开
    秘密密钥估计方法和设备

    公开(公告)号:WO2017167739A1

    公开(公告)日:2017-10-05

    申请号:PCT/EP2017/057295

    申请日:2017-03-28

    Abstract: Embodiments of the invention provide a secret key estimation device (13) for determining an estimate of at least one secret key used during a number of executions of a cryptographic function used by at least one cryptographic algorithm. The number of executions of the cryptographic function is at least equal to two. The secret key estimation device (13) comprises an analysis unit (14) for determining a plurality of sets of leakage traces from a side-channel information acquired during the number of executions of the cryptographic function. Each set of leakage traces corresponds to an execution of the cryptographic function and comprising at least one leakage trace. The secret key estimation device (13) further comprises a processing unit (15) configured to determine a statistical distribution of the acquired plurality of sets of leakage traces. The statistical distribution is dependent on a leakage function, the leakage function being represented in a basis of functions by a set of real values. The secret key estimation device (13) is configured to determine the secret key from the statistical distribution of the plurality of sets of leakage traces using an estimation algorithm according to the maximization of a performance metric.

    Abstract translation: 本发明的实施例提供了一种用于确定在由至少一个密码算法使用的密码函数的多次执行期间使用的至少一个密钥的估计的密钥估计设备(13)。 密码函数的执行次数至少等于2。 秘密密钥估计装置(13)包括分析单元(14),用于根据在执行密码函数的次数期间获取的侧信道信息确定多组泄漏轨迹。 每组泄漏迹线对应于密码功能的执行并且包括至少一个泄漏迹线。 该秘密密钥估计装置(13)还包括处理单元(15),该处理单元(15)被配置为确定所获取的多组泄漏迹线的统计分布。 统计分布取决于泄漏函数,泄漏函数以函数为基础用一组实值表示。 秘密密钥估计设备(13)被配置为使用根据性能度量的最大化的估计算法从多组泄漏迹线的统计分布中确定秘密密钥。

    METHOD AND COMPUTER PROGRAM PRODUCT FOR CHARACTERIZING A RETINA OF A PATIENT FROM AN EXAMINATION RECORD COMPRISING AT LEAST ONE IMAGE OF AT LEAST A PART OF THE RETINA
    269.
    发明申请
    METHOD AND COMPUTER PROGRAM PRODUCT FOR CHARACTERIZING A RETINA OF A PATIENT FROM AN EXAMINATION RECORD COMPRISING AT LEAST ONE IMAGE OF AT LEAST A PART OF THE RETINA 审中-公开
    方法和计算机程序产品,用于表征包括至少一个图像的检查记录的患者的RETINA的一部分

    公开(公告)号:WO2017046378A1

    公开(公告)日:2017-03-23

    申请号:PCT/EP2016/072050

    申请日:2016-09-16

    CPC classification number: G16H50/70 G06F19/00

    Abstract: Method comprising the steps consisting in: - automatically detecting image patterns on the image, - automatically associating image patterns with visual words, - automatically providing a distribution of visual words over at least a part of the image of the retina to be characterized, wherein elementary clusters each grouping an elementary number of training image patterns detected in each training image, and composite clusters each grouping at least two elementary clusters are defined, wherein visual words at different granularity levels are defined, a finest-grained visual word being assigned to each elementary cluster and a coarser-grained visual word being assigned to each composite cluster, and and wherein, for each image pattern: - a corresponding cluster is selected among the elementary and composite clusters, - said image pattern is associated with the visual word of the corresponding cluster.

    Abstract translation: 方法包括以下步骤: - 自动检测图像上的图像图像, - 自动将图像图案与视觉词相关联, - 自动提供在要表征的视网膜的图像的至少一部分上的视觉词的分布,其中基本 每个群组分组在每个训练图像中检测到的训练图像模式的基本数量,并且定义每个分组至少两个基本群集的合成群集,其中定义不同粒度级别的视觉词,分配给每个基元的最细粒度的视觉词 集群和分配给每个复合集群的粗粒度视觉字,并且其中,对于每个图像模式: - 在基本集合和复合集群之间选择相应的集群, - 所述图像模式与相应的视觉字相关联 簇。

    TREE SEARCH-BASED DECODING
    270.
    发明申请
    TREE SEARCH-BASED DECODING 审中-公开
    基于树搜索的解码

    公开(公告)号:WO2016131738A1

    公开(公告)日:2016-08-25

    申请号:PCT/EP2016/053091

    申请日:2016-02-15

    CPC classification number: H04L25/03242

    Abstract: A method, device, and a computer program are provided to decode a signal received through a transmission channel in a communication system, the received signal being represented by a signal vector. The method comprises : - calculating an initial estimate of a transmitted symbol vector carried by the received signal vector; - calculating a bound parameter (201) from a linear function of the initial estimate of the transmitted symbol vector, the linear function being defined by a slope coefficient and an intercept coefficient, the method further comprising : - determining estimated symbols representative of the transmitted symbols carried by the received signal, the estimated symbols being determined from a set of candidate lattice points, each lattice point comprising a set of components, each component of a candidate lattice point being searched in a search interval (203), the search interval having at least one search interval bound computed from the bound parameter; - determining (205) the estimated symbols from the closest lattice point to the received signal vector among the candidate lattice points.

    Abstract translation: 提供了一种方法,装置和计算机程序来对通过通信系统中的传输信道接收的信号进行解码,所接收的信号由信号向量表示。 该方法包括: - 计算由接收信号向量携带的发射符号向量的初始估计; - 从所发送的符号向量的初始估计的线性函数计算绑定参数(201),所述线性函数由斜率系数和截距系数定义,所述方法还包括: - 确定表示所发送符号的估计符号 所述估计符号由一组候选格点确定,每个格点包括一组分量,在搜索间隔(203)中搜索候选格点的每个分量,搜索间隔具有 从绑定参数计算的至少一个搜索间隔约束; - 从候选格点中的接收信号向量的最接近的格点确定(205)所估计的符号。

Patent Agency Ranking