Process and framework for facilitating data sharing using a distributed hypergraph

    公开(公告)号:US09996567B2

    公开(公告)日:2018-06-12

    申请号:US14724921

    申请日:2015-05-29

    发明人: J. Cory Smart

    IPC分类号: G06F17/30

    摘要: A knowledge model “overlay” for organizing and analyzing large, dynamic data volumes is implemented as a hypergraph that manifests as a result of a distributed theory-driven data source transformation process. This process maps exponentially growing data into an asymptotically limited information space. Within this space, real-world entities (e.g. people, computers, cities, Earth) and their complex interdependencies (e.g. social networks, connectivity, causal relationships) are represented as attributed hypergraph elements (i.e. both hypervertices and hyperedges). Attributes are represented as state vectors affixed to any hypergraph element. Transformation of source system data into this overlay structure is accomplished with minimal data movement and replication using a universal “pointer” like mechanism that is managed in a decentralized fashion by the respective transformation components. Access to the knowledge overlay is performed via a hypergraph communication protocol encapsulated within a common hypergraph API and accompanying hypergraph toolkit.

    Wireless Location Assisted Zone Guidance System

    公开(公告)号:US20180055011A1

    公开(公告)日:2018-03-01

    申请号:US15791315

    申请日:2017-10-23

    申请人: GPSip, Inc.

    IPC分类号: A01K15/02 H04W4/02 G06F17/30

    摘要: A look-up table is defined by at least one reference point, and rows and columns that are offset from the reference. The table rows and columns correspond to ordinate and abscissa data points representing geographic locations. Each data point offset in the table corresponds to a predefined geographic offset. The look-up table contains machine-stored values at each table location, with each value representing a particular one of several guidance zones. The real-time determination of the guidance zone is made by first determining present location using GPS or other wireless location signals. The corresponding table location is identified by calculating latitudinal and longitudinal offsets from a reference point, and using these offsets as the two indices to access a double-indexed array. The value retrieved from the indexed array identifies the guidance zone. Each guidance zone has an associated set of characteristics used to provide behavioral guidance to an animal.

    Priority Queuing for Updates in a Database System

    公开(公告)号:US20180046661A1

    公开(公告)日:2018-02-15

    申请号:US15336535

    申请日:2016-10-27

    申请人: SAP SE

    发明人: Brendon Atkins

    IPC分类号: G06F17/30

    摘要: In one embodiment, a method receives a list of subscribers at a set interval time. Each subscriber includes one or more updates in which an update to the data stored in a database is required. A queue process in a plurality of queue processes is selected based on a first selection process where different queue processes are used over multiple set interval times. The queue process places subscribers in the list of subscribers in a plurality of queues using a placement process that is based on a characteristic of the subscribers. Also, the queue processes in the plurality of queue processes use different placement processes to place subscribers in the plurality of queues. The method then retrieves subscribers from the plurality of queues based on a second selection process, the retrieved subscribers being provided to the plurality of processors for processing of the respective updates for the subscribers.

    Concealed data matching device, concealed data matching program, and concealed data matching method

    公开(公告)号:US09870458B2

    公开(公告)日:2018-01-16

    申请号:US15353208

    申请日:2016-11-16

    申请人: FUJITSU LIMITED

    发明人: Yuka Jo

    摘要: A concealed data matching method for a computer including: registering a first concealed vector obtained by concealing registered data and key data based on a first random number and a linear combination of row vectors of a determination matrix; acquiring a second concealed vector; calculating a remainder vector indicating a remainder obtained by dividing the difference between the first concealed vector and the second concealed vector; determining the similarity between the registered data and the matching data based on the remainder vector; extracting the key data from the remainder vector if it is determined they are similar; calculating an inter-vector distance between the registered data and the matching data; and determining the similarity between the registered data and the matching data based on the magnitude of the inter-vector distance.