Patents by Inventor Benjamin Ray
Benjamin Ray 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: 9384238Abstract: A computer-implemented method is disclosed for efficiently processing a large number of records. In the method, a computer system may obtain a plurality of records and count the number of records thereof corresponding to each block of a plurality of blocks. The computer system may also identify a plurality of partitions corresponding to selected blocks of the plurality of blocks. Each partition of the plurality of partitions may be substantially uniform in processing time. The computer system may then distribute a workload associated with a block or partition to each node of a plurality of nodes contained within the computer system. Each node may then process the block or partition in parallel such that each node completes the processing within a selected period of time.Type: GrantFiled: April 26, 2013Date of Patent: July 5, 2016Assignee: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Patent number: 9355369Abstract: A computer-implemented method is disclosed for efficiently processing records with unseen data. In the method, a computer system may obtain a plurality of records and a decision tree generated in a learning process. The decision tree may include a distinction node having multiple paths extending therefrom. After arriving at the distinction node with one or more records, the computer system may determine that the one or more records correspond to data of a type not seen by the distinction node in the learning process. Thereafter, the computer system may depart the distinction node via each of the multiple paths and eventually reach multiple leaf nodes of the decision tree. Each of the multiple leaf nodes may correspond to a probability distribution. Accordingly, the computer system may combine the probability distribution of each of the multiple leaf nodes to obtain a hybrid probability distribution corresponding to the one or more records.Type: GrantFiled: April 30, 2013Date of Patent: May 31, 2016Assignee: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Publication number: 20160148320Abstract: In some embodiments, a method can comprise accessing one or more neighborhood data structures, at least a portion of the one or more neighborhood data structures are active. In many embodiments, the one or more neighborhood data structures each comprise a label comprising a record identifier, the record identifier corresponding to a specified record of the one or more records, a neighborhood comprising a list of record identifiers for other records linked to the specified record of the one or more records by a pairwise link, and a message for each of the other records linked to the specified record of the one or more records, the message comprising the label and an activity state indicator, the activity state indicator indicating if the neighborhood data structure is active. Other embodiments of related methods and systems are also provided.Type: ApplicationFiled: January 29, 2016Publication date: May 26, 2016Applicant: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Patent number: 9336249Abstract: A computer-implemented method is disclosed for efficiently processing a large number of records. In the method, a computer system may obtain a plurality of records and a decision tree. The decision tree may include a distinction node corresponding to a distinction requiring completion of a computation. Due to the fact that the computation may be, in the overall context of the process, computationally expensive, it may initially be left uncomputed. Accordingly, if the distinction node is never reached when records are being processed, no computation time gets wasted. However, if and when the distinction node is reached, the computer system may complete the computation and make the distinction based on results of the computation.Type: GrantFiled: April 30, 2013Date of Patent: May 10, 2016Assignee: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Patent number: 9298753Abstract: The present invention extends to methods, systems, and computer program products for resolving pairwise links to groups. Embodiments of the invention use an iterative algorithm to transform a collection of pairwise links to groups of records that correspond to the same entity. The algorithm can be stopped after any number of iterations for an increasing accurate approximation result. The algorithm essentially guarantees a correct solution for groups of size up to the number of iterations. This algorithm scales linearly on the size of the record set, with little impact from the number of links.Type: GrantFiled: May 31, 2013Date of Patent: March 29, 2016Assignee: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Patent number: 9292599Abstract: Systems and methods are disclosed for classifying records by sorting records based on both quantitative and qualitative information at a node in a decision tree. Technologies are also disclosed for determining whether records are linked together by applying quantitative and qualitative information at the same nodes in a decision tree. Furthermore, improvements to decision trees are disclosed in terms of the generation and/or training of decision trees that harnesses additional information in the quantitative and qualitative aspects that a unit of data relevant to a single node, and/or the relationships between these aspects, may provide a machine learning algorithm.Type: GrantFiled: April 30, 2013Date of Patent: March 22, 2016Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Patent number: 9235592Abstract: Techniques for avoiding duplicate comparisons while comparing customer records to identify linked customer records pertaining to a single customer entity are provided. The techniques include the computer system comparing a first electronic customer record with a second electronic customer record to determine if the first electronic customer record and the second electronic customer record pertain to a single customer entity if the computer system identifies a common blocker key corresponding to a selected blocker from a data field in the first electronic customer record and from a data field in the second electronic customer record and if the computer system does not identify a common blocker key corresponding to an additional lower order blocker from another data field in the first electronic customer record and from a data field in the second electronic customer record.Type: GrantFiled: April 26, 2013Date of Patent: January 12, 2016Assignee: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Publication number: 20140358920Abstract: The present invention extends to methods, systems, and computer program products for resolving pairwise links to groups. Embodiments of the invention use an iterative algorithm to transform a collection of pairwise links to groups of records that correspond to the same entity. The algorithm can be stopped after any number of iterations for an increasing accurate approximation result. The algorithm essentially guarantees a correct solution for groups of size up to the number of iterations. This algorithm scales linearly on the size of the record set, with little impact from the number of links.Type: ApplicationFiled: May 31, 2013Publication date: December 4, 2014Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Publication number: 20140350474Abstract: An intravenous catheter securement device comprises of an intravenous catheter board stabilizer that conforms to patients' bodies and an adjustable elastic sleeve with a hole for catheter insertion, with two overlying flaps for catheter securement. The intravenous catheter hoard base has holes on either side, one side for connection of the elastic sleeve, and the other side provides a fastening location for elastic bands attached to the sleeve for tightness adjustment. An embodiment of the invention involving the intravenous board is displayed separately as an alternative innovation. This device is comprised of a simple form fitting elastic sleeve having a catheter opening with the intent of applying a removable adhesive to the sleeve itself over the catheter for securement purposes. These embodiments establish a simple, standardized, and safe method of securing intravenous catheters sans adhesive material in contact with the epidermis.Type: ApplicationFiled: May 6, 2014Publication date: November 27, 2014Inventors: Andrew Eric Andreae, Angela Leslie-Anne Jividen, Benjamin Ray Campbell, Darian Anthony Edwards, lIya Gurin, James Andrew Bonaffini, John Christian McMichael, Lena Mona Badr, Lydia An Luu, Matthew Thomas Rhoads, Sibo Zhang, Zi Ye
-
Publication number: 20140324861Abstract: A computer-implemented method is disclosed for efficiently processing a large number of records. In the method, a computer system may obtain a plurality of records and count the number of records thereof corresponding to each block of a plurality of blocks. The computer system may also identify a plurality of partitions corresponding to selected blocks of the plurality of blocks. Each partition of the plurality of partitions may be substantially uniform in processing time. The computer system may then distribute a workload associated with a block or partition to each node of a plurality of nodes contained within the computer system. Each node may then process the block or partition in parallel such that each node completes the processing within a selected period of time.Type: ApplicationFiled: April 26, 2013Publication date: October 30, 2014Applicant: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Publication number: 20140324871Abstract: Systems and methods are disclosed for classifying records by sorting records based on both quantitative and qualitative information at a node in a decision tree. Technologies are also disclosed for determining whether records are linked together by applying quantitative and qualitative information at the same nodes in a decision tree. Furthermore, improvements to decision trees are disclosed in terms of the generation and/or training of decision trees that harnesses additional information in the quantitative and qualitative aspects that a unit of data relevant to a single node, and/or the relationships between these aspects, may provide a machine learning algorithm.Type: ApplicationFiled: April 30, 2013Publication date: October 30, 2014Applicant: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Publication number: 20140324906Abstract: Techniques for comparing customer records to identify linked customer records pertaining to a single customer entity are provided. The techniques include identifying a target group of electronic customer records having data fields containing data pertaining to a customer, identifying one or more focused blockers identifying a data value for an electronic customer record data field, and analyzing the target group of electronic customer records to identify a focused group of electronic customer records containing the focused blocker data value. The techniques also include comparing pairs of electronic customer records from the focused group of electronic customer records to identify linked records which pertain to a single customer entity.Type: ApplicationFiled: April 26, 2013Publication date: October 30, 2014Applicant: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Publication number: 20140324756Abstract: A computer-implemented method is disclosed for efficiently processing set-based attributes. In the method, a computer system may obtain a plurality of records and a decision tree. The decision tree may include a distinction node corresponding to a comparison of two attributes. The distinction node may have a match path and a no match path extending therefrom. After arriving at the distinction node, the computer system may initiate a process wherein each member of a first set corresponding to a first of the two attributes is to be compared to each member of a second set corresponding to a second of the two attributes. The computer system may depart the distinction node via the match path after the process reveals that at least one member of the first set matches at least one member of the second set.Type: ApplicationFiled: April 30, 2013Publication date: October 30, 2014Applicant: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Publication number: 20140324897Abstract: A computer-implemented method is disclosed for efficiently processing a large number of records. In the method, a computer system may obtain a plurality of records and a decision tree. The decision tree may include a distinction node corresponding to a distinction requiring completion of a computation. Due to the fact that the computation may be, in the overall context of the process, computationally expensive, it may initially be left uncomputed. Accordingly, if the distinction node is never reached when records are being processed, no computation time gets wasted. However, if and when the distinction node is reached, the computer system may complete the computation and make the distinction based on results of the computation.Type: ApplicationFiled: April 30, 2013Publication date: October 30, 2014Applicant: Wal-Mart Stores, IncInventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Publication number: 20140324790Abstract: Techniques for avoiding duplicate comparisons while comparing customer records to identify linked customer records pertaining to a single customer entity are provided. The techniques include the computer system comparing a first electronic customer record with a second electronic customer record to determine if the first electronic customer record and the second electronic customer record pertain to a single customer entity if the computer system identifies a common blocker key corresponding to a selected blocker from a data field in the first electronic customer record and from a data field in the second electronic customer record and if the computer system does not identify a common blocker key corresponding to an additional lower order blocker from another data field in the first electronic customer record and from a data field in the second electronic customer record.Type: ApplicationFiled: April 26, 2013Publication date: October 30, 2014Applicant: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Publication number: 20140324524Abstract: The present disclosure extends to methods, systems, and computer program products for determining customer linkages between a plurality of customer profiles having corresponding attribute pairs for comparison.Type: ApplicationFiled: April 30, 2013Publication date: October 30, 2014Applicant: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Publication number: 20140324744Abstract: A computer-implemented method is disclosed for efficiently processing records with unseen data. In the method, a computer system may obtain a plurality of records and a decision tree generated in a learning process. The decision tree may include a distinction node having multiple paths extending therefrom. After arriving at the distinction node with one or more records, the computer system may determine that the one or more records correspond to data of a type not seen by the distinction node in the learning process. Thereafter, the computer system may depart the distinction node via each of the multiple paths and eventually reach multiple leaf nodes of the decision tree. Each of the multiple leaf nodes may correspond to a probability distribution. Accordingly, the computer system may combine the probability distribution of each of the multiple leaf nodes to obtain a hybrid probability distribution corresponding to the one or more records.Type: ApplicationFiled: April 30, 2013Publication date: October 30, 2014Applicant: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Publication number: 20140324523Abstract: The present disclosure extends to methods, systems, and computer program products for determining customer linkages between a plurality of customer profiles and providing missing cost values in the attribute fields.Type: ApplicationFiled: April 30, 2013Publication date: October 30, 2014Applicant: Wal-Mart Stores, Inc.Inventors: Andrew Benjamin Ray, Nathaniel Philip Troutman
-
Patent number: 8596247Abstract: A fuel delivery assembly for delivering a flow of fuel to a fuel injector includes a securing member including a securing member opening extending through the securing member such that the securing member is generally cylindrical. The securing member opening includes an inner surface that includes a securing member projection. The fuel delivery assembly also includes a quill tube including a quill tube opening extending through the quill tube such that the quill tube is generally cylindrical. The quill tube opening is configured to receive the flow of fuel and direct the flow of fuel to the fuel injector. The quill tube includes an outer surface that includes a quill tube projection. The securing member opening is configured to receive at least a portion of the quill tube, and the securing member projection and the quill tube projection are configured to engage in an interference fit.Type: GrantFiled: July 13, 2010Date of Patent: December 3, 2013Assignee: Caterpillar Inc.Inventors: Benjamin Ray Tower, Craig Phillip Hittle, Michael Patrick Harmon
-
Publication number: 20120012083Abstract: A fuel delivery assembly for delivering a flow of fuel to a fuel injector includes a securing member including a securing member opening extending through the securing member such that the securing member is generally cylindrical. The securing member opening includes an inner surface that includes a securing member projection. The fuel delivery assembly also includes a quill tube including a quill tube opening extending through the quill tube such that the quill tube is generally cylindrical. The quill tube opening is configured to receive the flow of fuel and direct the flow of fuel to the fuel injector. The quill tube includes an outer surface that includes a quill tube projection. The securing member opening is configured to receive at least a portion of the quill tube, and the securing member projection and the quill tube projection are configured to engage in an interference fit.Type: ApplicationFiled: July 13, 2010Publication date: January 19, 2012Inventors: Benjamin Ray Tower, Craig Phillip Hittle, Michael Patrick Harmon