Patents Assigned to LASCOM
  • Patent number: 9820338
    Abstract: The invention relates to a glass product with electrically heated surface and a method of its manufacture.
    Type: Grant
    Filed: August 5, 2014
    Date of Patent: November 14, 2017
    Assignee: Lascom, Ltd.
    Inventors: Valentin Sergeevich Chadin, Timur Alekperovich Aliev
  • Publication number: 20140108412
    Abstract: Provided is an information system relating to commercial products, consulted from several sites, this information being classed according to types of object, including items that make up the product, sites, characteristics; tables of links called configurations making it possible to view links between a parent object and child objects, including configurations between an item and characteristics. It contains a new object denoted site item. And items contain shared configurations directly linking the parent item to characteristics shared by all the sites, and specific configurations linking the parent item to specific characteristics of each site via a global specific configuration which directly links the parent item to site items, each site item being linked to the specific characteristics by specific configurations of its site.
    Type: Application
    Filed: October 14, 2013
    Publication date: April 17, 2014
    Applicant: LASCOM
    Inventors: Yannick MASSET, Sylvain LE TOUX
  • Publication number: 20110202570
    Abstract: In a method for structuring, in an ordered tree of predetermined depth P?, of data complying with predetermined criteria Fs and organized in a directed acyclic graph of depth P which comprises nodes and links between the nodes, the nodes and links stored by type in tables of a relational database which is queried by a query language from an application server connected to a user interface, the criteria Fs being determined on the nodes and/or the links, the method includes: creation of a “CACHE” table in the database; determination by the database of a set E; running of an iteration having an identifier id and/or properties; and transmission by the database to the application server of an end-of-process item of information with the number of nodes loaded into the “CACHE” table and of an identifier for access to the “CACHE” table.
    Type: Application
    Filed: February 15, 2011
    Publication date: August 18, 2011
    Applicant: LASCOM
    Inventor: Souheil ZINA
  • Patent number: 7814087
    Abstract: The invention relates to a fast method of hierarchical searching for data satisfying at least one set of predetermined criteria C, in a directed acyclic graph which is stored in a relational database management system able to be interrogated by a query language, the criteria being determined on the nodes and/or the links of the graph. Each criterion is determined blocking (respectively non-blocking) that is to say such that as soon as the criterion is not satisfied, its descendant nodes are excluded, (respectively only this node is excluded, without consequence to its descendant nodes). It comprises the following steps consisting in: separating the set C into a set of blocking criteria Cb and non-blocking criteria Cnb searching by means of the query language for the nodes of the graph satisfying the set of blocking criteria Cb, these nodes being grouped together in a set G, searching by means of the query language, for the nodes of G satisfying the set of non-blocking criteria Cnb.
    Type: Grant
    Filed: November 23, 2007
    Date of Patent: October 12, 2010
    Assignee: LASCOM
    Inventor: Charles Henriot
  • Publication number: 20080154862
    Abstract: The invention relates to a fast method of hierarchical searching for data satisfying at least one set of predetermined criteria C, in a directed acyclic graph which is stored in a relational database management system able to be interrogated by a query language, the criteria being determined on the nodes and/or the links of the graph. Each criterion is determined blocking (respectively non-blocking) that is to say such that as soon as the criterion is not satisfied, its descendant nodes are excluded, (respectively only this node is excluded, without consequence to its descendant nodes). It comprises the following steps consisting in: separating the set C into a set of blocking criteria Cb and non-blocking criteria Cnb searching by means of the query language for the nodes of the graph satisfying the set of blocking criteria Cb, these nodes being grouped together in a set G, searching by means of the query language, for the nodes of G satisfying the set of non-blocking criteria Cnb.
    Type: Application
    Filed: November 23, 2007
    Publication date: June 26, 2008
    Applicant: LASCOM
    Inventor: Charles Henriot