Patents by Inventor Demetrios Achlioptas
Demetrios Achlioptas 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).
-
Patent number: 10871459Abstract: Computing systems and methods for characterizing a protein are provided. Each residue in a subset of the protein is in an amino acid type set and is represented by a vertex in a graph G formed from an atomic model of the protein. NMR data, acquired with some of the residues of the protein isotopically labeled, is used to form a graph H with each vertex representing a different residue of the protein and assigned one or more amino types. Placements of H onto G are formed, each including mappings assigning vertices in H to vertices in G subject to the constraints that vertices in H mapped to vertices in G cannot be of different amino acid types and edges between pairs of vertices in H must map to corresponding edges in G. For each vertex in H, the number of different valid mappings to G is determined by polling the placements as a constraint satisfaction problem and is deemed assigned when only a single unique assignment is identified.Type: GrantFiled: February 17, 2018Date of Patent: December 22, 2020Assignee: The Regents of the University of CaliforniaInventors: Demetrios Achlioptas, Nikolaos G. Sgourakis
-
Publication number: 20190391093Abstract: Computing systems and methods for characterizing a protein are provided. Each residue in a subset of the protein is in an amino acid type set and is represented by a vertex in a graph G formed from an atomic model of the protein. NMR data, acquired with some of the residues of the protein isotopically labeled, is used to form a graph H with each vertex representing a different residue of the protein and assigned one or more amino types. Placements of H onto G are formed, each including mappings assigning vertices in H to vertices in G subject to the constraints that vertices in H mapped to vertices in G cannot be of different amino acid types and edges between pairs of vertices in H must map to corresponding edges in G. For each vertex in H, the number of different valid mappings to G is determined by polling the placements as a constraint satisfaction problem and is deemed assigned when only a single unique assignment is identified.Type: ApplicationFiled: February 17, 2017Publication date: December 26, 2019Inventors: Demetrios Achlioptas, Nikolaos G. Sgourakis
-
Patent number: 7693071Abstract: Systems and methods are described which provide enhanced stability, increased predictability, reduced transmission costs, and which conserve bandwidth in routing messages over computer networks. The systems and methods further include providing improved transmission of messages wherein the messages are transmitted to nodes closest to a target delivery node. If delivery is possible to a target node, the message transmission stops at the point of failure in the network, wherein delivery to the target node is accomplished at a later time or the message is returned to the sender.Type: GrantFiled: May 27, 2005Date of Patent: April 6, 2010Assignee: Microsoft CorporationInventors: Demetrios Achlioptas, Eric D. Tribble, Malcolm E. Pearson, Leon Warman
-
Patent number: 7464075Abstract: Methods and systems are provided for efficiently computing personalized rankings of web pages or other interconnected objects. The personalized rankings are produced by efficiently computing an approximation matrix to an ideal personalized page ranking matrix. The methods and systems provided herein can be used to produce search results with particular relevance to an individual searcher.Type: GrantFiled: January 5, 2004Date of Patent: December 9, 2008Assignee: Microsoft CorporationInventors: Frank David McSherry, Demetrios Achlioptas
-
Patent number: 7260611Abstract: New information is introduced to a distributed system at many places. The information impacts data that is replicated throughout the system. The replicas of the data must be synchronized so that changes to the system are accurately reflected. One solution to the synchronized replica problem is a state machine approach. In such an approach, the computers of the network each maintain their own data, which is kept in the same state as the data of the other computers by processing the identical commands in the identical order. To ensure that all commands are executed in the same order, a lead process is given the task of assigning command sequence numbers. However, using a single lead process introduces a bottleneck in the distributed system by requiring that all commands to change data go through the lead process to be assigned an execution order. The invention divides the command ordering among multiple lead processes.Type: GrantFiled: November 21, 2002Date of Patent: August 21, 2007Assignee: Microsoft CorporationInventors: Leslie Lamport, Aamer Hydrie, Demetrios Achlioptas
-
Publication number: 20070168550Abstract: A system arid method for enabling highly scalable multi-node event distribution networks through the use of summary-based routing, particularly event distribution networks using a content-based publish/subscribe model to distribute information. By allowing event routers to use imprecise summaries of the subscriptions hosted by matcher nodes, an event router can eliminate itself as a bottleneck thus improving overall event distribution network throughput even though the use of imprecise summaries results in some false positive event traffic. False positive event traffic is reduced by using a filter set partitioning that provides for good subscription set locality at each matcher node, while at the same time avoiding overloading any one matcher node. Good subscription set locality is maintained by routing new subscriptions to a matcher node with a subscription summary that best covers the new subscription.Type: ApplicationFiled: February 6, 2007Publication date: July 19, 2007Inventors: Yi-Min Wang, Lili Qiu, Chad Verbowski, Demetrios Achlioptas, Gautam Das, Per-Ake Larson
-
Patent number: 7200675Abstract: A system and method for enabling highly scalable multi-node event distribution networks through the use of summary-based routing, particularly event distribution networks using a content-based publish/subscribe model to distribute information. By allowing event routers to use imprecise summaries of the subscriptions hosted by matcher nodes, an event router can eliminate itself as a bottleneck thus improving overall event distribution network throughput even though the use of imprecise summaries results in some false positive event traffic. False positive event traffic is reduced by using a filter set partitioning that provides for good subscription set locality at each matcher node, while at the same time avoiding overloading any one matcher node. Good subscription set locality is maintained by routing new subscriptions to a matcher node with a subscription summary that best covers the new subscription.Type: GrantFiled: March 14, 2003Date of Patent: April 3, 2007Assignee: Microsoft CorporationInventors: Yi-Min Wang, Lili Qiu, Chad E. Verbowski, Demetrios Achlioptas, Gautam Das, Per-Ake Larson
-
Publication number: 20060268722Abstract: Systems and methods are described which provide enhanced stability, increased predictability, reduced transmission costs, and which conserve bandwidth in routing messages over computer networks. The systems and methods further include providing improved transmission of messages wherein the messages are transmitted to nodes closest to a target delivery node. If delivery is possible to a target node, the message transmission stops at the point of failure in the network, wherein delivery to the target node is accomplished at a later time or the message is returned to the sender.Type: ApplicationFiled: May 27, 2005Publication date: November 30, 2006Applicant: Microsoft CorporationInventors: Demetrios Achlioptas, Eric Tribble, Malcolm Pearson, Leon Warman
-
Publication number: 20040181588Abstract: A system and method for enabling highly scalable multi-node event distribution networks through the use of summary-based routing, particularly event distribution networks using a content-based publish/subscribe model to distribute information. By allowing event routers to use imprecise summaries of the subscriptions hosted by matcher nodes, an event router can eliminate itself as a bottleneck thus improving overall event distribution network throughput even though the use of imprecise summaries results in some false positive event traffic. False positive event traffic is reduced by using a filter set partitioning that provides for good subscription set locality at each matcher node, while at the same time avoiding overloading any one matcher node. Good subscription set locality is maintained by routing new subscriptions to a matcher node with a subscription summary that best covers the new subscription.Type: ApplicationFiled: March 13, 2003Publication date: September 16, 2004Applicant: Microsoft CorporationInventors: Yi-Min Wang, Lili Qiu, Chad E. Verbowski, Demetrios Achlioptas, Gautam Das, Per-Ake Larson
-
Publication number: 20040103138Abstract: New information is introduced to a distributed system at many places. The information impacts data that is replicated throughout the system. The replicas of the data must be synchronized so that changes to the system are accurately reflected. One solution to the synchronized replica problem is a state machine approach. In such an approach, the computers of the network each maintain their own data, which is kept in the same state as the data of the other computers by processing the identical commands in the identical order. To ensure that all commands are executed in the same order, a lead process is given the task of assigning command sequence numbers. However, using a single lead process introduces a bottleneck in the distributed system by requiring that all commands to change data go through the lead process to be assigned an execution order. The invention divides the command ordering among multiple lead processes.Type: ApplicationFiled: November 21, 2002Publication date: May 27, 2004Applicant: Microsoft CorporationInventors: Leslie Lamport, Aamer Hydrie, Demetrios Achlioptas
-
Patent number: 6735589Abstract: A dimensionality reduction method of generating a reduced dimension matrix data set Dnew of dimension m×k from an original matrix data set D of dimension m×k wherein n>k. The method selects a subset of k columns from a set of n columns in the original data set D where the m rows correspond to observations Ri where i=1, . . . , m and the n columns correspond to attributes Aj where j=1, . . . , n and dij is the data value associated with observation Ri and attribute Aj. The data values in the reduced data set Dnew for each of the selected k attributes is identical to the data values of the corresponding attributes in the original data set.Type: GrantFiled: June 7, 2001Date of Patent: May 11, 2004Assignee: Microsoft CorporationInventors: Paul S. Bradley, Demetrios Achlioptas, Christos Faloutsos, Usama Fayyad
-
Publication number: 20030028541Abstract: A dimensionality reduction method of generating a reduced dimension matrix data set Dnew of dimension m×k from an original matrix data set D of dimension m×k wherein n>k. The method selects a subset of k columns from a set of n columns in the original data set D where the m rows correspond to observations Ri where i=1, . . . , m and the n columns correspond to attributes Aj where j=1, . . . , n and dij is the data value associated with observation Ri and attribute Aj. The data values in the reduced data set Dnew for each of the selected k attributes is identical to the data values of the corresponding attributes in the original data set.Type: ApplicationFiled: June 7, 2001Publication date: February 6, 2003Applicant: Microsoft CorporationInventors: Paul S. Bradley, Demetrios Achlioptas, Christos Faloutsos, Usama Fayyad