Graphs Patents (Class 707/798)
  • Patent number: 8843526
    Abstract: Methods and systems are described that involve determining the memory consumption of a specific application. The memory analysis identifies the dynamic memory objects controlled by a particular application and the memory objects controlled by the framework running that application. A structured view of the memory objects of the framework with respect to the individual framework architecture is presented in combination with the application specific memory object graph. A resulting display, in the form of a dominator tree, allows detecting dependencies of the application to the framework and shows which part of the framework is responsible for keeping alive which part of the application. Moreover, the resulting structure shows memory consumption of a single element of the application including bound memory and object memory. Further, a user can identify the references and the dependencies among the memory objects.
    Type: Grant
    Filed: December 18, 2009
    Date of Patent: September 23, 2014
    Assignee: SAP AG
    Inventors: Christoph Stoeck, Masoud Aghadavoodi Jolfaei, Ariane Buster-Zoeller, Sven Kobler, Christian Stork, Doris Vielsack
  • Publication number: 20140279979
    Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for metadata management. One of the methods includes receiving user input selecting a first node. The method includes receiving a first data lineage of a first object, the first object having a type, the first data lineage describing relationships between the first object and one or more datasets or transforms. The method includes receiving user input selecting a second node. The method includes receiving a second data lineage of a second object, the second object having the same type as the first object. The method includes performing a comparison of the first node and the first data lineage to the second node and the second data lineage. The method includes generating a report based on the comparison.
    Type: Application
    Filed: March 13, 2014
    Publication date: September 18, 2014
    Inventors: Gregg Yost, Dusan Radivojevic
  • Publication number: 20140280359
    Abstract: A computing system includes: a control unit configured to: detect an upcoming event for interacting with a focal person for the upcoming event; extract an invitee's identification for the upcoming event, aggregate an invitee's information associated with the invitee's identification; build a social graph as an enhanced graph or with an extension graph based on the invitee's information for adding an invitee associated with the invitee's identification; and a storage unit, coupled to the control unit, configured to store the social graph.
    Type: Application
    Filed: October 17, 2013
    Publication date: September 18, 2014
    Applicant: Samsung Electronics Co., Ltd.
    Inventors: Tao C. Baecklund, Curtis Jyun Sasaki, Kuldip S. Pabla
  • Publication number: 20140280362
    Abstract: In a computer environment, a system and method is described that generally provides for creation of a distributed graph database, creation and deployment of nodes in a distributed graph database system, and integration of nodes into a set of distributed graph databases that include data nodes and edges that are: entities built using forms, relations, and relationships; immutable but evolvable through the addition of new data nodes or new edges joining the evolving data node to another data node; shareable and mergeable.
    Type: Application
    Filed: May 29, 2014
    Publication date: September 18, 2014
    Applicant: Skai, Inc.
    Inventor: Charles E. HENDERSON
  • Publication number: 20140280361
    Abstract: Discovery of causal networks is essential for understanding and manipulating complex systems in numerous data analysis application domains. Several methods have been proposed in the last two decades for solving this problem. The inventive method uses local causal discovery methods for global causal network learning in a divide-and-conquer fashion. The usefulness of the invention is demonstrated in data capturing characteristics of several domains. The inventive method outputs more accurate networks compared to other discovery approaches.
    Type: Application
    Filed: March 17, 2014
    Publication date: September 18, 2014
    Inventors: Konstantinos (Constantin) F. Aliferis, Alexander Statnikov
  • Publication number: 20140280358
    Abstract: Example methods, apparatuses, or articles of manufacture are disclosed that may be implemented, in whole or in part, using one or more computing devices to facilitate or otherwise support one or more processes or operations for a machine for recognizing or generating one or more Jabba-type sequences.
    Type: Application
    Filed: March 15, 2013
    Publication date: September 18, 2014
    Inventors: Josh Coalson, Muxin Zhou
  • Publication number: 20140280360
    Abstract: A method and apparatus for partitioning a graph database that includes nodes connected to one another is presented. The method entails determining a node type indicating a type of node that is to be used as mapped nodes, and upon receiving a new node, placing the new node in a partition according to one or more property values associated with the new node if it is a mapped node, and placing the new node in a partition according to its connections to other nodes if it is not a mapped node. The apparatus includes modules containing computer-executable instructions to perform the above method.
    Type: Application
    Filed: March 14, 2014
    Publication date: September 18, 2014
    Inventors: James WEBBER, Ian S. ROBINSON, Mats Tobias LINDAAKER, Alistair Philip CAMPBELL JONES
  • Patent number: 8838655
    Abstract: Technologies are described herein for applying type projection queries to instance space graphs. Through the utilization of the technologies and concepts presented herein, a type projection may be used to describe the hierarchy of instance types connected by relationships within an instance space graph. A type projection query based on the type projection may be dynamically generated to query instances and relationships within the instance store. Filter criteria for the query can be expressed using a path notation. Results from of the type projection query may be provided as graphs of instances and relationships which are subgraphs of the queried instance space graph. Programmatic traversal of the resultant subgraph can navigate to each instance node within the result space.
    Type: Grant
    Filed: February 12, 2013
    Date of Patent: September 16, 2014
    Assignee: Microsoft Corporation
    Inventors: Joel Pothering, Jakub Oleksy, Ashvinkumar J. Sanghvi, Pratibha Mallya, Murat Ersan, Bogdan Berce
  • Patent number: 8832156
    Abstract: Management of distributed computing systems is required, for example, to carry out activities using shared resources such as computational tasks, in-silico experiments and other tasks. In an embodiment a distributed computing graph represents processes executing in the distributed computing system in order to carry out the activity and this graph is available to entities in the distributed computing system. For example, a user interface at an entity in the distributed computing system enables a user to view a local representation of the distributed computing graph and to control the activity using that local representation which maps dynamically to and from the underlying distributed computing graph. In examples, the local representation of the distributed computing graph enables live control of the activity without the need for compilation. In examples the distributed computing graph is shared through the distributed computing system using peer-to-peer distribution or using a replication mechanism.
    Type: Grant
    Filed: June 15, 2009
    Date of Patent: September 9, 2014
    Assignee: Microsoft Corporation
    Inventors: Andreas Heil, Martin Calsyn, Alexander Brandle, Vassily Lyutsarev
  • Patent number: 8832069
    Abstract: Embodiments of the present invention provide systems, methods and computer program products for generating search results comprising web documents with associated expert information. One embodiment of a method for generating such search results includes receiving one or more search queries, selecting one of the one or more search queries, determining one or more categories of web documents responsive to the selected search query and crawling a web graph of linked web documents to identify one or more web documents tagged as within the one or more categories responsive to the selected search query. The method further includes generating a result set of the one or more web documents identified as within the one or more categories responsive to the selected search query, ranking the result set and generating a list of ranked search results responsive to the selected search.
    Type: Grant
    Filed: December 4, 2012
    Date of Patent: September 9, 2014
    Assignee: Yahoo! Inc.
    Inventor: Joshua Schachter
  • Patent number: 8825711
    Abstract: Systems and processes for storing correlated data in a graph database are described. A first user node may be stored. In response to a request, a first event node and a second user node may be stored. The first event node may be associated with the first user node through an edge indicating participation. The first event node may be associated with the second user node through an edge indicating participation. In response to a content access, a second event node and a content node may be stored. The second event node may be associated with the first user node through an edge indicating participation. The second event node may be associated with the content node through an edge indicating usage. The first user node may be associated with the content node through an edge indicating the first user node handles the content node.
    Type: Grant
    Filed: August 13, 2012
    Date of Patent: September 2, 2014
    Assignee: Magnet Systems, Inc.
    Inventors: Robyn J. Chan, Magdi Morsi
  • Patent number: 8819002
    Abstract: An approach is provided that visually distinguishes between entity types in a communication system. A Data store with entities is queried, with entities connected to one another as senders and receivers, resulting in a query result. A node data structure corresponding to each of the entities is created and an edge data structure corresponding to each of the connections between the entities is also created. Nodes corresponding to the node data structures are displayed, along with edges (e.g., connection lines) corresponding to the edge data structures. A user selects one of the nodes that is displayed, and the selected node is visually highlighted. Different types of non-selected nodes are identified based on the selected node. Types of nodes may include sender type nodes, receiver type nodes, and sender/receiver type nodes. The types of identified nodes are highlighted in a manner that visually distinguishes each type from the other types.
    Type: Grant
    Filed: April 9, 2013
    Date of Patent: August 26, 2014
    Assignee: International Business Machines Corporation
    Inventors: Sarah Christine Figueroa, Kenney Ng, Thyra Lynne Rauch
  • Patent number: 8819009
    Abstract: Systems, methods and computer program products are disclosed for facilitating the collection of activity data, organizational hierarchy data and distribution list data within a private computer network (especially an intranet) while complying with applicable privacy laws and regulations, as well as individual organizations' business rules addressing intranet users' privacy to display a social graph of organization members related to a requesting organization member. Such systems, methods and computer program products allow for the collecting of such data passively without a need for active participation from the requester. A computer-implemented process for displaying a social graph further comprises calculating sub-scores for each of activity data, organizational data and distribution list data and calculating a total score for each related organization member and displaying the social graph comprising those organization members whose score exceeds a predetermined value as related to the requester.
    Type: Grant
    Filed: May 12, 2011
    Date of Patent: August 26, 2014
    Assignee: Microsoft Corporation
    Inventors: John Wana, Ilya Tumanov, George Perantatos, Brian R. Meyers
  • Patent number: 8812520
    Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scoring resources. One method includes generating a resource graph, the graph including nodes representing resources, nodes representing queries, edges between nodes representing resources, and edges between nodes representing queries and nodes representing resources. The method further includes calculating a score for each of the resources, wherein the score for a particular resource is based on scores for resources represented by nodes with edges to the node representing particular resource in the graph and scores for queries represented by nodes that have an edge to the node representing particular resource in the graph, and ranking one or more of the resources in response to a first query received from a user based, at least in part, on the scores.
    Type: Grant
    Filed: February 25, 2013
    Date of Patent: August 19, 2014
    Assignee: Google Inc.
    Inventors: Mark M. Sandler, Dandapani Sivakumar
  • Patent number: 8812546
    Abstract: State information for a page can be stored and restored using a component state manager to extract and set state information for various components on a page. Each appropriate component can register with the state manager, such that when a user requests to store state information, the state manager can extract state information for each registered component and store the state information accordingly. The user can be provided with a tag or other identifier that allows the user to subsequently request recreation of that state. In response to receiving the identifier, the state manager retrieves the stored state information and sets the state of each respective registered component on the page. The identifiers can be shared with other users to allow those users to also quickly access the same state.
    Type: Grant
    Filed: July 25, 2012
    Date of Patent: August 19, 2014
    Assignee: Amazon Technologies, Inc.
    Inventor: Del J. Cornali
  • Publication number: 20140229510
    Abstract: The present disclosure relates, according to some embodiments, to a method of temporal bipartite projection for users and objects and a method of link prediction for an unhappened event. The method of the temporal bipartite projection comprises making a sequence of user-object weighted bipartite networks with the user-object weights, identifying the transitions for each user from a first object at a first time to a second object at a second time, assigning the transition weights corresponding to the transitions according to a predetermined rule, summing the transition weights for all users between two objects to obtain the transition tendencies, and constructing a temporal projection graph with the transition tendencies.
    Type: Application
    Filed: February 12, 2013
    Publication date: August 14, 2014
    Applicant: NATIONAL TAIWAN UNIVERSITY
    Inventors: Sheau-Harn Yu, Wanjiun Liao, Cheng-Shang Chang
  • Patent number: 8805845
    Abstract: A framework for large-scale multi-label classification of an electronic document is described. An example multi-label classification system is configured to first apply weak classifiers and identify seed labels, then determine additional labels based on the seed labels and label correlation data derived from member profiles maintained by an on-line social network system. The multi-label classification system then constructs an s-t graph comprising nodes that correspond to the seed labels and the additional labels. A clustering algorithm is then applied to the constructed graph to arrive to a labels graph. The labels graph is deemed to include nodes that correspond to topics discussed or referenced in the electronic document.
    Type: Grant
    Filed: July 31, 2013
    Date of Patent: August 12, 2014
    Assignee: LinedIn Corporation
    Inventors: Liyun Li, Hyun Chul Lee, Shuai Li
  • Patent number: 8805861
    Abstract: Methods and systems to model and acquire data from a variety of data and information sources, to integrate the data into a structured database, and to manage the continuing reintegration of updated data from those sources over time. For any given domain, a variety of individual information and data sources that contain information relevant to the schema can be identified. Data elements associated with a schema may be identified in a training source, such as by user tagging. A formal grammar may be induced appropriate to the schema and layout of the training source. A Hidden Markov Model (HMM) corresponding to the grammar may learn where in the sources the elements can be found. The system can automatically mutate its schema into a grammar matching the structure of the source documents. By following an inverse transformation sequence, data that is parsed by the mutated grammar can be fit back into the original grammar structure, matching the original data schema defined through domain modeling.
    Type: Grant
    Filed: May 15, 2009
    Date of Patent: August 12, 2014
    Assignee: Google Inc.
    Inventors: Justin Boyan, Glenn McDonald, Margaret Benthall, Ray Molnar
  • Publication number: 20140222871
    Abstract: Techniques for data assignment from an external distributed file system (DFS) to a database management system (DBMS) are provided. Data blocks from the DFS are represented as first nodes and access module processors of the DBMS are represented as second nodes. A graph is produced with the first and second nodes. Assignments are made for the first nodes to the second nodes based on evaluation of the graph to integrate the DFS with the DBMS.
    Type: Application
    Filed: March 18, 2014
    Publication date: August 7, 2014
    Applicant: Teradata US, Inc.
    Inventors: Yan Qi, Yu Xu, Olli Pekka Kostamaa, Jian Wen
  • Patent number: 8799329
    Abstract: An application asynchronously flattens a graph in a relational store to provide fast access to node relationship queries. The application may implement an algorithm that retrieves forward paths of a start node. The algorithm may also retrieve reverse paths of end node. The application may cross-join the forward and reverse paths to determine link paths connecting the start and end nodes. The application may merge the link paths with existing paths. The application may increment path reference counts. The application may store the link paths as a link between the nodes to represent a relationship between the nodes.
    Type: Grant
    Filed: June 13, 2012
    Date of Patent: August 5, 2014
    Assignee: Microsoft Corporation
    Inventors: Charles Lamanna, Rui Chen, Michael Wilde, Ian Miers
  • Patent number: 8799323
    Abstract: A computer implemented method of storing, manipulating, assessing, and displaying data and its relationships, and a computer system (with memory) programmed to implement such method. The data is stored into nodes, and visualized as a sea of linked nodes.
    Type: Grant
    Filed: August 4, 2011
    Date of Patent: August 5, 2014
    Assignee: Google Inc.
    Inventor: Rocky Harry W. Nevin, III
  • Patent number: 8793283
    Abstract: Data are maintained in a distributed computing system that describe a graph. The graph represents relationships among items. The graph has a plurality of vertices that represent the items and a plurality of edges connecting the plurality of vertices. At least one vertex of the plurality of vertices includes a set of label values indicating the at least one vertex's strength of association with a label from a set of labels. The set of labels describe possible characteristics of an item represented by the at least one vertex. At least one edge of the plurality of edges includes a set of label weights for influencing label values that traverse the at least one edge. A label propagation algorithm is executed for a plurality of the vertices in the graph in parallel for a series of synchronized iterations to propagate labels through the graph.
    Type: Grant
    Filed: April 20, 2012
    Date of Patent: July 29, 2014
    Assignee: Google Inc.
    Inventors: Matthew H. Austern, James C. Dehnert, Aart J. C. Bik, Grzegorz Czajkowski, Grzegorz Malewicz
  • Patent number: 8788534
    Abstract: A system, method and data structure for processing basic client application data types to add thereto extension types and priority levels adapted for use by each of a plurality of set top box classes.
    Type: Grant
    Filed: February 2, 2011
    Date of Patent: July 22, 2014
    Assignee: TVWorks, LLC
    Inventors: James Hindle, Peter G. N. Scheyen, Mark A. Vickers
  • Patent number: 8782080
    Abstract: In particular embodiments, a method includes receiving an unstructured text query, parsing the text query to identify n-grams; determining a score that the n-grams correspond to particular nodes and edges from a social graph, identifying those nodes and edges with a score greater than a threshold score, and then generating structured queries that include references to the identified nodes and edges.
    Type: Grant
    Filed: July 23, 2012
    Date of Patent: July 15, 2014
    Assignee: Facebook, Inc.
    Inventors: Yofay Kari Lee, Michael Benjamin Cohen, Maxime Boucher, Alisson Gusatti Azzolini, Xiao Li, Lars Eilstrup Rasmussen
  • Patent number: 8775476
    Abstract: In a computer environment, a system and method is described that generally provides for creation of a distributed graph database, creation and deployment of nodes in a distributed graph database system, and integration of nodes into a set of distributed graph databases that include data nodes and edges that are: entities built using forms, relations, and relationships; immutable but evolvable through the addition of new data nodes or new edges joining the evolving data node to another data node; shareable and mergeable.
    Type: Grant
    Filed: December 30, 2011
    Date of Patent: July 8, 2014
    Assignee: Skai, Inc.
    Inventor: Charles E. Henderson
  • Patent number: 8775457
    Abstract: An apparatus and a method for searching one or more documents for several different strings is described. A finite state machine receives and processes one or more search strings with a tail-first search. A matching string machine forms states based on the characters in the search string with at least one state accepting a match. The states are annotated with a pattern that indicates what the state has matched and can match. Each position within the pattern is either a character that has been matched at that point or an indicator that it is unknown.
    Type: Grant
    Filed: May 31, 2010
    Date of Patent: July 8, 2014
    Assignee: Red Hat, Inc.
    Inventor: James Paul Schneider
  • Publication number: 20140188788
    Abstract: A method, system, computer program product and computer program for generating a multi-modal journey itinerary comprising: receiving, from a user, a desired destination; determining the user's current location; determining the user's current mode of transport; accessing a multi-modal route graph; determining, in response to determining the user's current location and of determining the user's current mode of transport, a user's position in the multi-modal route graph; and calculating, in response to determining the user's position in the multi-modal route graph, a multi-modal journey itinerary from the user's position in the multi-modal route graph to the desired destination.
    Type: Application
    Filed: July 25, 2012
    Publication date: July 3, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Anna Bridgen, Andrew Flatt, Richard W. Pilot
  • Publication number: 20140188941
    Abstract: A method of matching a first entity to a second entity by evaluating Boolean expressions includes identifying a set of criteria vertices for a second entity vertex by traversing a graph database in a manner constrained to fact vertices identified for the second entity. The graph database relates fact vertices to the criteria vertices by edges corresponding to Boolean expressions for satisfying criteria for matching first entities to second entities. The method additionally includes selecting one of the first entities based on the criteria vertices of the set. The method further includes matching the first entity to the second entity based on the selection.
    Type: Application
    Filed: January 2, 2013
    Publication date: July 3, 2014
    Applicant: e-Rewards, Inc.
    Inventor: e-Rewards, Inc.
  • Publication number: 20140188928
    Abstract: New methods of relational database management are described, for example, to enable completion and checking of data in relational databases, including completion of missing foreign key values, to facilitate understanding of data in relational databases, to highlight data that it would be useful to add to a relational database and for other applications. In various embodiments, the schema of a relational database is used to automatically create a probabilistic graphical model that has a structure related to the schema. For example, nodes representing individual rows are linked to rows of other tables according to the database schema. In examples, data in the relational database is used to carry out inference using inference algorithms derived from the probabilistic graphical model. In various examples, inference results, comprising probability distributions each for an individual table cell, are used to fill missing data, highlight errors, and for other purposes.
    Type: Application
    Filed: December 31, 2012
    Publication date: July 3, 2014
    Applicant: MICROSOFT CORPORATION
    Inventors: Sameer Singh, Thore Kurt Hartwig Graepel, Lucas Julien Bordeaux, Andrew Donald Gordon
  • Patent number: 8762413
    Abstract: A computer system for generating a user data store and analyzing the user data store comprises a memory and a processing circuit. The memory is configured to store a user data store comprising a plurality of graphs, each graph having a user identity node. The processing circuit is configured to, for each of the plurality of graphs: receive asset data representing an asset that a user has interacted with on a website; generate a first node representing the asset data and a first link coupling the first node to the user identity node of the graph; store the first node and first link as part of the graph; receive usage data representing user interaction with a website; generate a second node representing the usage data and a second link coupling the second node to the user identity node of the graph, wherein at least one of the first node and second node further represents opinion data for a product or evaluation data for a product; and store the second node and second link as part of the graph.
    Type: Grant
    Filed: April 25, 2011
    Date of Patent: June 24, 2014
    Assignee: CBS Interactive, Inc.
    Inventors: William W. Graham, Jr., Tushar R. Pradhan, John F. Potter, Mark A. Kaufman, Stephanie Lone, Keric Donnelly
  • Patent number: 8762417
    Abstract: A method and system for analyzing impact of an event on resources of a network. A directed graph is generated and includes nodes and edges. Each node represents a resource. Each edge connects, and is directed from, a predecessor node to a successor node. The event impacts the resource at an event node. A propagation time (PT) is determined for each edge. The PT is a time interval for an impact of the event to travel along each edge from the predecessor node to the successor node. An initial estimated impact time (EIT) is set for each node. The EIT for each node is an estimated time at which the event impacts each node. The EIT of each node that is directly or indirectly connected to the event node by one or more edges is updated. A list of the updated nodes is sent to an output device.
    Type: Grant
    Filed: April 4, 2011
    Date of Patent: June 24, 2014
    Assignee: International Business Machines Corporation
    Inventor: Dominique Vernier
  • Patent number: 8763152
    Abstract: A social networking system contains information describing users of the social network and various connections among the users. A user can access multiple external systems that communicate with the social networking system to access information about the users of the social networking system. Login status of the user account on the social networking system is maintained. If the login status of the user account on the social networking system indicates that the user is not logged in, the user is required to provide authentication information. If the login status of the user account indicates that the user is logged in, social network information is provided to the user via an external system, subject to the privacy settings of users of the social networking system. If the user logs out from an external system, the user is also logged out from the social networking system.
    Type: Grant
    Filed: July 23, 2009
    Date of Patent: June 24, 2014
    Assignee: Facebook Inc.
    Inventors: Michael Steven Vernal, Wei Zhu, James M. Leszczenski, Joshua E. Elman, David Brookes Morin, Charles Duplain Cheever, Ruchi Sanghvi
  • Patent number: 8762495
    Abstract: A method for collecting transcripts each storing an order in which portions of an application file were accessed by the file when the file was executed on one of a plurality of computing devices. The method includes receiving requests to download the file from directing processes each executing on a different one of the computing devices, and in response to those requests, downloading the file to the computing devices and instructing the directing processes to profile usage of the file. Then, transcripts created by the directing processes are received therefrom. A streaming model may be created based on the transcripts received. The file may be divided into a plurality of smaller files based on the streaming model. The streaming model may be used to download the file by downloading at least a portion of the smaller files using a conventional download protocol without using a specialized streaming protocol.
    Type: Grant
    Filed: September 8, 2010
    Date of Patent: June 24, 2014
    Assignee: Code Systems Corporation
    Inventors: Kenji C. Obata, Jason Pollentier, Mark Jeremy Zeller
  • Publication number: 20140172920
    Abstract: A method of determining the complexity of a collaborative effort which method includes receiving data via a processor, the data including identities of social actors or sets of social actors in the collaborative effort, and storing the data in a repository accessible by the processor; defining nodes, via the processor, and associating the nodes with each of the social actors of or with each of the sets of social actors in the collaborative effort to define nodes that represent each of the social actors or each of the sets of social actors; identifying, via the processor, one or more dimensions for each social actor; defining a coordination complexity (G), via the processor, and determining, for each dimension, a sum of a difference between every two of the nodes, multiplying the sum by a weight specific for that dimension, and adding each of the multiplied sums for each dimension. In another aspect, the invention includes a system of determining complexity of a collaborative effort.
    Type: Application
    Filed: December 19, 2013
    Publication date: June 19, 2014
    Applicant: VALE S.A.
    Inventor: Cleidson Ronald Botelho De Souza
  • Patent number: 8756252
    Abstract: According to some embodiments, categories and an associated category graph may be determined for a parsing framework. Moreover, a type for the parsing framework may be defined, wherein at least one category is automatically created and inserted into the category graph for an implementation element of the defined type. Namespaces may be automatically defined for the categories based at least in part on inheritance relationships associated with the categories in the category graph.
    Type: Grant
    Filed: December 3, 2008
    Date of Patent: June 17, 2014
    Assignee: SAP AG
    Inventor: Uwe Krueger
  • Patent number: 8751521
    Abstract: In particular embodiments, a method includes receiving an text query, identifying nodes and edges from a social graph that correspond to character strings from the text query, and then generating recommended queries that include references to the identified nodes and edges.
    Type: Grant
    Filed: July 23, 2012
    Date of Patent: June 10, 2014
    Assignee: Facebook, Inc.
    Inventors: Yofay Kari Lee, Michael Benjamin Cohen, Maxime Boucher, Alisson Gusatti Azzolini, Xiao Li, Lars Eilstrup Rasmussen
  • Publication number: 20140156707
    Abstract: According to an example, a dataflow directed acyclic graph including nodes and edges connecting the nodes. Parameters for the nodes are calculated, and the parameters may include batch size and a degree of parallelism.
    Type: Application
    Filed: December 5, 2012
    Publication date: June 5, 2014
    Applicant: Hewlett-Packard Development Company, L.P.
    Inventors: Matthias Sax, Maria G. CASTELLANOS, Meichun HSU, Qiming CHEN
  • Patent number: 8744976
    Abstract: Embodiments are directed towards providing a list of potential friends to a user based on an analysis of friends' contact lists. The user may provide a subset of friends within a contact list for analysis, along with a degree of separation over which to perform the analysis, and/or a minimum threshold number of occurrences for identifying a candidate friend. The subset of friends' contact lists may then be recursively traversed and merged, where common friends may be identified as members of a candidate set for suggesting friends to the user. In one embodiment, the candidate members may be retained within the candidate set if there is a commonality between the friends and the candidate that exceeds the minimum threshold. The candidate list may also be rank order using various approaches, including a weighted energy diffusion model based in part on a number of communications between the candidates.
    Type: Grant
    Filed: April 28, 2008
    Date of Patent: June 3, 2014
    Assignee: Yahoo! Inc.
    Inventors: Sunil Jagadish, Jignashu Parikh
  • Patent number: 8745054
    Abstract: A system, a method, an apparatus, and a computer-readable medium are provided. Co-occurrences of words or terms in a group of text documents are determined. A score for each of the co-occurrences of words or terms is calculated. A graphic view is presented. The graphic view has nodes that include at least one word or term and edges that join at least two nodes and depict a relationship among the at least two nodes. A layout of the graphic view includes a minimum number of crossings of the edges.
    Type: Grant
    Filed: November 30, 2005
    Date of Patent: June 3, 2014
    Assignee: AT&T Intellectual Property II, L.P.
    Inventors: Wen-Ling Hsu, Guy J. Jacobson, Ann Eileen Skudlark, Thomas Paul Ventimiglia
  • Patent number: 8745585
    Abstract: System and method for generating meta-data for a product is disclosed. An artifact repository stores first artifacts for building the product. The artifact repository stores first meta-data for one or more of the artifacts in the repository. A build manager builds second artifacts for the product from source code and one or more of the first artifacts based on information in a project script. The build manager is adapted to combine the first meta-data for each of the one or more of the first artifacts used to build the second artifact to form second meta-data for each of the second artifacts.
    Type: Grant
    Filed: December 29, 2011
    Date of Patent: June 3, 2014
    Assignee: Unisys Corporation
    Inventors: Christina Watters, Peter Johnson, Robert S. Baker
  • Publication number: 20140149465
    Abstract: A data processing system employs a pre-processing step to create a simplified view of a received entity graph. During the pre-processing step, only the objects and the attributes of those objects within the graph that are required for data processing are selected. Pruned source and target objects are generated by omitting those attributes that are not required for processing. The pruned objects are included in the simplified view that enhances system performance.
    Type: Application
    Filed: November 26, 2012
    Publication date: May 29, 2014
    Applicant: YAHOO! INC.
    Inventors: Balaji Kannan, Aamod Sane, Zhiwei Gu, Michael Welch
  • Publication number: 20140143280
    Abstract: Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently.
    Type: Application
    Filed: November 20, 2012
    Publication date: May 22, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Songyun Duan, Achille Belly Fokoue-Nkoutche, Anastasios Kementsietsidis, Wangchao Le, Feifei Li, Kavitha Srinivas
  • Publication number: 20140143281
    Abstract: Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently.
    Type: Application
    Filed: November 21, 2012
    Publication date: May 22, 2014
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Songyun Duan, Achille Belly Fokoue-Nkoutche, Anastasios Kementsietsidis, Wangchao Le, Feifei Li, Kavitha Srinivas
  • Patent number: 8732208
    Abstract: In particular embodiments, a method includes receiving an unstructured text query, identifying nodes and edges from a social graph that correspond to n-grams in the text query, and then generating structured queries that include references to the identified nodes and edges.
    Type: Grant
    Filed: July 23, 2012
    Date of Patent: May 20, 2014
    Assignee: Facebook, Inc.
    Inventors: Yofay Kari Lee, Michael Benjamin Cohen, Maxime Boucher, Alisson Gusatti Azzolini, Xiao Li, Lars Eilstrup Rasmussen
  • Patent number: 8725681
    Abstract: Techniques for managing system information are disclosed. In one embodiment, a piece of system information is received, a synthesized link is created linking a system information identifier corresponding to the system information to a synthesized group identifier, the synthesized group identifier represents a group to which the synthesized information/synthesized information identifier belongs.
    Type: Grant
    Filed: April 23, 2011
    Date of Patent: May 13, 2014
    Assignee: Infoblox Inc.
    Inventors: Stuart M. Bailey, Richard Kagan, Navin Boddu, David Vigier, Thomas S. Clark, Joseph D. Head
  • Patent number: 8725765
    Abstract: Some embodiments of a system and a method to implement a hierarchical registry federation have been presented. For instance, a registry federation can be stored in a set of one or more storage devices, the registry federation including multiple registries, each registry having one or more records. The registries can be organized in an oriented graph such that each registry is logically connected to another registry in the registry federation as a parent registry or a child registry.
    Type: Grant
    Filed: July 16, 2010
    Date of Patent: May 13, 2014
    Assignee: Red Hat, Inc.
    Inventors: Jiri Pechanec, Martin Vecera
  • Patent number: 8725775
    Abstract: A system and method for determining a set of visualization points from any given two-dimensional dataset to best describe a given visual analytic. A first user selection is received in a data processing apparatus for a chart. A chart type associated with the first user selection is identified for the chart. One or more visualization strategies are accessed from a strategy pool database based on the chart type. A second user selection is received in the data processing apparatus for a two-dimensional dataset from a data provider in communication with the data processing apparatus. The two-dimensional dataset is analyzed to determine a best strategy from the one or more visualization strategies accessed from the strategy pool database. Metadata representing the two-dimensional dataset is generated based on the best strategy, and a display representing the metadata is generated to visualize the two-dimensional dataset according to the best strategy.
    Type: Grant
    Filed: June 3, 2009
    Date of Patent: May 13, 2014
    Assignee: Business Objects Software Limited
    Inventors: ZhiYong Gong, TianMin Huang, Leo Chi-Lok Yu, HongGang Zhang, Jun Che
  • Publication number: 20140129594
    Abstract: Techniques are described for graph partitioning, and in particular, graph bisection. A combinatorial lower bound is provided that is computed in near-linear time. These bounds may be used to determine optimum solutions to real-world graphs with many vertices (e.g., more than a million for road networks, or tens of thousands for VLSI and mesh instances). Combinatorial techniques that reduce the size of the branch-and-bound search tree may use tree packing, assign vertices to trees, and use fractional assignment of vertices to trees. For graph bisection, each node of the branch-and-bound tree corresponds to a partial assignment of vertices to both cells or sets of vertices.
    Type: Application
    Filed: November 4, 2012
    Publication date: May 8, 2014
    Applicant: Microsoft Corporation
    Inventors: Daniel Delling, Renato F. Werneck
  • Patent number: 8719304
    Abstract: An embodiment of a system for representing connectedness of individuals includes nodes representative of individuals and strands connecting the nodes. The nodes include a first node representative of a first individual and a second node representative of a second individual. The strands connect the first node and the second node. Each of the strands represents a type of relationship between the first individual and the second individual. In some embodiments, each of the strands is in the form of a distinct data object.
    Type: Grant
    Filed: May 20, 2005
    Date of Patent: May 6, 2014
    Inventor: John Golze
  • Patent number: 8719306
    Abstract: The present invention provides a method, system, and program product for managing adapter association for a data graph of data objects. Specifically, under the present invention, a data graph of data objects is generated (e.g., on a server), and then serialized. In performing the serialization, the data graph is translated into bits. In one embodiment, the bits are communicated to a client over a network, and then translated back into the data graph (i.e., deserialized). An adapter is associated with each of the data objects after the data graph is deserialized. This avoids the “overhead” involved with associating and having active adapters during deserialization.
    Type: Grant
    Filed: January 22, 2013
    Date of Patent: May 6, 2014
    Assignee: International Business Machines Corporation
    Inventors: Ritchard L. Schacher, Matthew J. Hicks, Eduardus A. T. Merks