Patents by Inventor Laurent Visconti

Laurent Visconti 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).

  • Publication number: 20240074600
    Abstract: A refrigerated display cabinet has a containment structure defining a product display compartment divided by a shelf into a lower area and an upper area, and an access opening, an air inlet mouth and an air outlet mouth being in communication with the product display compartment. A channel connecting the air inlet and outlet mouths contains an evaporator connected to a refrigeration circuit and a plurality of fans arranged downstream of the evaporator, and is divided into a first group and a second group of fans respectively generating a flow of refrigerated air towards the lower area and a flow of refrigerated air towards the air outlet mouth. A control unit adjusts speed of the first group of fans independently of speed of the second group of fans and flow rate of refrigerated air towards the lower area independently of flow rate of refrigerated air towards the air outlet mouth.
    Type: Application
    Filed: April 26, 2023
    Publication date: March 7, 2024
    Inventors: Federico VISCONTI, Maurizio ORLANDI, Stefano TRABUCCHI, Lionel VASSEUR, Patrick CAZALIS, Laurent NARBAITZ, Alexandre MISKIZAK, Julien GRANOUILLAC
  • Patent number: 10904113
    Abstract: Techniques are provided for ranking time-series including previously detected anomalous fact quantity changes over an associated time interval. Time-series are received, and for each time-series, a normalized fact quantity change is determined, and each time-series is ranked based in part on the normalized fact quantity change. A normalized fact quantity change may be determined by determining a normalization factor over the time interval, and then determining a product of the normalization factor and the absolute value of the fact quantity change of that time interval. Alternatively, a normalized fact quantity change may be the product of the normalization factor, a predetermined order factor, and the absolute value of the fact quantity change. The normalization factor is determined by analyzing the distribution of the fact quantity change over dimension values of the dimension(s) associated with the time-series to determine the number of values in which the fact quantity is concentrated.
    Type: Grant
    Filed: October 31, 2018
    Date of Patent: January 26, 2021
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Aditya Bandi, Ishani Shailesh Parikh, Laurent Visconti
  • Publication number: 20190394102
    Abstract: Techniques are provided for ranking time-series including previously detected anomalous fact quantity changes over an associated time interval. Time-series are received, and for each time-series, a normalized fact quantity change is determined, and each time-series is ranked based in part on the normalized fact quantity change. A normalized fact quantity change may be determined by determining a normalization factor over the time interval, and then determining a product of the normalization factor and the absolute value of the fact quantity change of that time interval. Alternatively, a normalized fact quantity change may be the product of the normalization factor, a predetermined order factor, and the absolute value of the fact quantity change. The normalization factor is determined by analyzing the distribution of the fact quantity change over dimension values of the dimension(s) associated with the time-series to determine the number of values in which the fact quantity is concentrated.
    Type: Application
    Filed: October 31, 2018
    Publication date: December 26, 2019
    Inventors: Aditya Bandi, Ishani Shailesh Parikh, Laurent Visconti
  • Publication number: 20100306300
    Abstract: Zero elements are added to respective lines (e.g., rows/columns) of a sparse matrix. The added zero elements increase the number of elements in the respective lines to be a multiple of a predetermined even number ā€œnā€ (e.g., 2, 4, 8, etc.), based upon an n-fold unrolling loop, where n=2, 4, 8, etc. By forming a sparse matrix having lines (e.g., rows or columns) that are multiples of the predetermined number ā€œnā€, the n-fold unrolling loop thereby acts upon a predetermined number of elements in respective iterations, avoiding unnecessarily costly operations (e.g., additional loop unrolling code) on remainder non-zero elements (e.g. remainder row/column elements not within an n-fold unrolling loop) left in a row or column after unrolling. This improves the efficiency of sparse matrix linear algebra solvers and key sparse linear algebra kernels (e.g., SPMV) thereby improving the overall performance of a computer (e.g., running an application).
    Type: Application
    Filed: May 29, 2009
    Publication date: December 2, 2010
    Applicant: Microsoft Corporation
    Inventors: Jizhu Lu, Laurent Visconti