中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

13 records (took 0.027 seconds)

    Soft-computing method for establishing the heat dissipation law in a diesel common rail engine
    1.
    发明公开
    Soft-computing method for establishing the heat dissipation law in a diesel common rail engine 有权
    公共汽油柴油发电机组（HRR）中的Verfahren zum Berechnen der Hitzefreigabe

    公开(公告)号：EP1607604A1

    公开(公告)日：2005-12-21

    申请号：EP04425398.7

    申请日：2004-05-31

    Applicant: STMicroelectronics S.r.l.

    Inventor： Cesario, Nicola ,  Farina, Marco ,  Muscio, Claudio ,  Amato, Paolo

    IPC: F02D35/02 ,  F02D41/14 ,  G01M15/00

    CPC classification number: F02D41/3809 ,  F02D35/023 ,  F02D41/1405 ,  F02D2200/0625

    Abstract: The invention relates to a soft-computing method for establishing the dissipation law of the heat in a diesel Common Rail engine, in particular for establishing the dissipation mean speed (HRR) of the heat. The method provides the following steps:

    choosing a number of Wiebe functions whereon a dissipation speed signal (HRR) of the heat is decomposed;
    applying a Transform Ψ to the dissipation speed signal (HRR) of the heat;
    carrying out analysis of homogeneity of the Transform Ψ output;
    realising a corresponding neural network MLP wherein the design is guided by an evolutive algorithm;
    making learn and testing the neural network MLP.

    Abstract translation: 本发明涉及一种用于建立柴油共轨发动机中的热耗散规律的软计算方法，特别是用于确定热量的耗散平均速度（HRR）。 该方法提供以下步骤：选择一些Wiebe函数，其中散热速度信号（HRR）被分解; 将变形PSI应用于散热速度信号（HRR）; 对变换PSI输出的均匀性进行分析; 实现相应的神经网络MLP，其中设计由演进算法引导; 学习和测试神经网络MLP。

    Encryption process employing modified chaotic maps and relative digital signature process
    4.
    发明公开
    Encryption process employing modified chaotic maps and relative digital signature process 有权
    Verschlüsselungsverfahrenmit Verwendung chaotischer Abbildungen und verwandtes digitales Signaturverfahren

    公开(公告)号：EP1467514A1

    公开(公告)日：2004-10-13

    申请号：EP04101145.3

    申请日：2004-03-19

    Applicant: STMicroelectronics S.r.l.

    Inventor： Kocarev, Ljupco ,  Amato, Paolo ,  Rizzotto, Gianguido

    IPC: H04L9/00

    CPC classification number: H04L9/001 ,  H04L9/3013 ,  H04L9/302 ,  H04L9/3093

    Abstract: An encryption process comprises the following steps:

    preliminarily choosing at least a secret key and a set of permutable functions defined on a certain phase space for encrypting/decrypting messages,
    choosing a code for encoding messages to be sent in the form of a number belonging to the phase space,
    and wherein the set of permutable functions is composed of modified chaotic maps generated by a composite function, the image of which is calculated modulo a certain pre-established integer number, obtained composing a first function, a second function and the inverse of said first function,

    the secret key is defined by using the second function.

    This process uses a particular type of chaotic maps, the "modified chaotic maps", that work only on integer numbers. Given that operations on integers are faster than operations in floating-point arithmetic, this encryption process is faster than other processes that use chaotic maps.

    Abstract translation: 一种加密过程包括以下步骤：初步选择在某个相位空间定义的至少一个秘密密钥和一组可置换的功能，用于加密/解密消息，选择一个代码，以编码属于 所述相位空间，并且其中所述可置换函数集合由由复合函数生成的修改的混沌映射组成，所述复合函数的图像被模拟为特定的预先建立的整数，由组成第一函数获得，第二函数和反相 所述第一功能的秘密密钥由第二功能定义。 这个过程使用一种特殊类型的混沌映射，即仅修改整数的“修改混沌映射”。 假定整数的操作比浮点算术中的操作更快，则该加密过程比使用混沌映射的其他进程更快。

    Method and relative quantum gate for running a Grover's or Deutsch-Jozsa's quantum algorithm
    6.
    发明公开
    Method and relative quantum gate for running a Grover's or Deutsch-Jozsa's quantum algorithm 审中-公开
    Verfahren und亲戚Quantengatter zurAusführungeines Grover oder Deutsch-Josza-Quantenalgorithmus

    公开(公告)号：EP1380991A1

    公开(公告)日：2004-01-14

    申请号：EP02425447.6

    申请日：2002-07-08

    Applicant: STMicroelectronics S.r.l.

    Inventor： Rizzotto, Gianguido ,  Amato, Paolo ,  Porto, Domenico

    IPC: G06N1/00

    CPC classification number: G06N99/002 ,  B82Y10/00

    Abstract: A method of performing a Grover's or a Deutsch-Jozsa's quantum algorithm using a certain binary function defined on a space having a basis of vectors of n of qubits, comprises carrying out a superposition operation over input vectors for generating components of linear superposition vectors referred on a second basis of vectors of n +1 qubits, an entanglement operation over components of the linear superposition vectors for generating components of numeric entanglement vectors, and an interference operation over components of the numeric entanglement vectors for generating components of output vectors.
    The method allows a non negligible time saving because the entanglement operation is carried out by generating, for components of each superposition vector, corresponding components of a numeric entanglement vector, each component referred to a respective vector of the second basis being

    equal to the corresponding component of the respective superposition vector, if the binary function is null in correspondence of the vector of the first basis constituted by the first n qubits of the respective vector of the second basis, or
    the opposite of the corresponding component of the respective superposition vector, if the binary function is non null in correspondence of the vector of the first basis constituted by the first n qubits of the respective vector of the second basis.
    This method can be implemented in a relative quantum gate for running a Grover's or a Deutsch-Jozsa's quantum algorithm.

    Abstract translation: 使用在具有量子位n的向量的基础的空间上定义的特定二进制函数来执行Grover或Deutsch-Jozsa的量子算法的方法包括对输入向量执行叠加操作，用于生成参考的线性叠加向量的分量 n + 1个量子位的向量的第二基础，对于产生数字纠缠矢量的分量的线性叠加矢量的分量的纠缠操作，以及对于产生输出矢量的分量的数字纠缠矢量的分量的干扰操作。 该方法允许不可忽略的时间节省，因为纠缠操作是通过对每个叠加向量的分量产生数字纠缠矢量的对应分量来执行的，每个分量被称为第二基础的相应矢量相等 对应于相应叠加矢量的相应分量，如果二进制函数对应于由第二基元的相应矢量的第一n个量子位构成的第一基准矢量或与相应叠加矢量的相应分量相反的二进制函数为零 如果二进制函数对应于由第二基础的相应向量的第一n个量子位构成的第一基数的向量，则该二进制函数是非零的。 该方法可以在相对量子门中实现，用于运行Grover或Deutsch-Jozsa的量子算法。

    A method of performing the superposition operation of a Grover's or a Deutsch-Jozsa's quantum algorithm and a relative quantum gate
    7.
    发明公开
    A method of performing the superposition operation of a Grover's or a Deutsch-Jozsa's quantum algorithm and a relative quantum gate 审中-公开
    一种用于执行格罗弗或德国Josza量子算法和相对量子栅极的叠加操作的方法

    公开(公告)号：EP1267304A1

    公开(公告)日：2002-12-18

    申请号：EP01830383.4

    申请日：2001-06-12

    Applicant: STMicroelectronics S.r.l.

    Inventor： Rizzotto, Gianguido ,  Amato, Paolo ,  Porto, Domenico

    IPC: G06N1/00

    CPC classification number: G06N99/002 ,  B82Y10/00

    Abstract: A quantum gate carries out the superposition operation of a Grover's or of a Deutsch-Jozsa's quantum algorithm in a very fast manner because it performs all multiplications by using logic gates, that immediately output the result. The superposition operation of a Grover's and a Deutsch-Jozsa's quantum algorithm substantially consists in performing the Hadamard rotation over an input set of vectors producing a set of rotated vectors, calculating the tensor product of all the rotated vectors among them outputting a linear superposition set of vectors. The tensor product of all rotated vectors among them is carried out by logic gates. Moreover, a method of performing the superposition operation of a Grover's or of a Deutsch-Jozsa's quantum algorithm over an input set of vectors is disclosed.

    Abstract translation: 量子门进行外科Grover的的或德国乔沙的以非常快速的方式量子算法的叠加因为它通过使用逻辑门执行所有乘法，没有立即输出结果。 的Grover的和德国Jozsa量子的量子算法基本上besteht在到输入设定矢量产生一组旋转的矢量的执行阿达玛旋转，计算所有它们之间的旋转矢量输出廷的线性叠加组的张量积叠加手术 向量。 其中所有旋转的矢量的张量积是由逻辑门开展。 更结束了，到输入设定向量的执行的外科Grover的或德国Jozsa量子的量子算法的叠加的方法游离缺失盘。

    A method of performing a quantum algorithm for simulating a genetic algorithm
    9.
    发明公开
    A method of performing a quantum algorithm for simulating a genetic algorithm 审中-公开
    一种用于为遗传算法的仿真执行量子算法方法

    公开(公告)号：EP1672569A1

    公开(公告)日：2006-06-21

    申请号：EP04106715.8

    申请日：2004-12-20

    Applicant: STMicroelectronics S.r.l. ,  YAMAHA MOTOR CO., LTD.

    Inventor： Amato, Paolo ,  Porto, Domenico Massimiliano ,  Branciforte, Marco ,  Calabrò, Antonino ,  Ulyanov, Sergei Viktorovitch ,  Takahashi, Kazuki ,  Panfilov, Sergey Alexandrovich ,  Litvintseva, Liudmila Vasilievna ,  Ulyanov, Ilya Sergeevitch

    IPC: G06N1/00

    CPC classification number: G06N99/002 ,  B82Y10/00

    Abstract: In the present method of performing a quantum algorithm the superposition, entanglement and interference operators are determined for performing selection, crossover and mutation operations according to a genetic algorithm. Moreover, entanglement vectors generated by the entanglement operator of the quantum algorithm may be processed by a wise controller implementing a genetic algorithm, before being input to the interference operator.
    This algorithm may be easily implemented with a hardware quantum gate or with a software computer program running on a computer. Moreover, it can be used in a method for controlling a process and a relative control device of a process which is more robust, requires very little initial information about dynamic behavior of control objects in design process of intelligent control system, or random noise insensitive (invariant) in measurement system and in control feedback loop.

    Abstract translation: 在执行量子算法的本发明的方法的叠加，缠结和干扰运营商是确定性的开采用于执行选择，交叉和变异操作gemäß到遗传算法。 更上方，由量子算法的缠结运算符生成纠缠矢量可以由控制器被输入到干扰操作者之前明智实现一个遗传算法，进行处理。 该算法可以用硬件量子门或由计算机上运行的计算机软件程序来容易地实现。 更完了，它可以在方法中使用用于控制过程和处理所有这是更健壮的相对控制装置中，需要大约在智能控制系统，或随机噪声不敏感的设计过程控制对象的动态行为非常小的初始信息（ 不变）的测量系统和在控制反馈环路。

Patent Agency Ranking