Patents by Inventor William K. Johnson
William K. Johnson 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).
-
Publication number: 20240125385Abstract: A zero turning radius mower park brake system includes a park brake pawl on a transmission which engages a park brake to a pair of independently driven traction wheels. A park brake link may be pivotably mounted to the park brake pawl and connected to a left steering lever and a right steering lever. The park brake link may pivot while moving the park brake pawl forward to a park brake engaged position if only one of the steering levers is moved outward from a neutral traction drive position.Type: ApplicationFiled: October 18, 2022Publication date: April 18, 2024Inventors: JOSEAN J. MARTINEZ ACOSTA, THOMAS M. MESSINA, KENNETH M. REEP, WILLIAM P. JOHNSON, DAVID W. GEIGER, Margaret K. Martin
-
Publication number: 20200265491Abstract: Documents and data are analyzed to determine one or more data facets. The documents, data and other information contained therein may be presented according to statistically-determined groupings based on the data facets.Type: ApplicationFiled: January 9, 2020Publication date: August 20, 2020Inventors: Jonathan H. Young, Sid Probstein, Rik Tamm-Daniels, William K. Johnson, III
-
Patent number: 9916350Abstract: A computer system processes a plurality of unrelated database tables to create a join graph where each node in the join graph represents a table. The nodes in the join graph are connected by weighted, directed edges, where each directed edge represents a join from a first column in a first table to a second column in a second table and where the weight of the directed edge represents a predicted level of success in performing the join. The edge weights can be based on a likelihood of finding a value from the first column in the second column. A user selects a subset of the tables, and the system creates a join tree with recommended joins between the tables selected by the user. The recommended joins are used to create a structured query language statement which is executed to return a result to the user.Type: GrantFiled: November 28, 2016Date of Patent: March 13, 2018Inventors: Jonathan Young, John O'Neil, William K. Johnson, III, Martin Serrano, Gregory George, Udayan Das
-
Publication number: 20170193045Abstract: A computer system processes a plurality of unrelated database tables to create a join graph where each node in the join graph represents a table. The nodes in the join graph are connected by weighted, directed edges, where each directed edge represents a join from a first column in a first table to a second column in a second table and where the weight of the directed edge represents a predicted level of success in performing the join. The edge weights can be based on a likelihood of finding a value from the first column in the second column. A user selects a subset of the tables, and the system creates a join tree with recommended joins between the tables selected by the user. The recommended joins are used to create a structured query language statement which is executed to return a result to the user.Type: ApplicationFiled: November 28, 2016Publication date: July 6, 2017Inventors: Jonathan Young, John O'Neil, William K. Johnson, III, Martin Serrano, Gregory George, Udayan Das
-
Patent number: 9507824Abstract: A computer system processes a plurality of unrelated database tables to create a join graph where each node in the join graph represents a table. The nodes in the join graph are connected by weighted, directed edges, where each directed edge represents a join from a first column in a first table to a second column in a second table and where the weight of the directed edge represents a predicted level of success in performing the join. The edge weights can be based on a likelihood of finding a value from the first column in the second column. A user selects a subset of the tables, and the system creates a join tree with recommended joins between the tables selected by the user. The recommended joins are used to create a structured query language statement which is executed to return a result to the user.Type: GrantFiled: August 24, 2015Date of Patent: November 29, 2016Assignee: Attivio Inc.Inventors: Jonathan Young, John O'Neil, William K. Johnson, III, Martin Serrano, Gregory George, Udayan Das
-
Patent number: 9367301Abstract: A distributed system with multiple nodes, each of which processes input data streams according to a set of independent, asynchronous processing components connected in a manner represented by a directed graph, is dynamically updated. Such a dynamic update occurs while the system is processing input data by pausing the input data stream, making changes to the system configuration, and then restarting the input data stream. If the update fails for any reason, the system configuration is rolled back to its prior state.Type: GrantFiled: March 6, 2013Date of Patent: June 14, 2016Assignee: Attivio Inc.Inventors: Martin Anthony Serrano, William K. Johnson, III
-
Publication number: 20160055212Abstract: A computer system processes arbitrary data sets to identify fields of data that can be the basis of a join operation. Each data set has a plurality of entries, with each entry having a plurality of fields. For each pair of data sets, the computer system compares the values of fields in a first data set in the pair of data sets to the values of fields in a second data set in the pair of data sets, to identify fields having substantially similar sets of values. Given pairs of fields that have similar sets of values, the computer system measures entropy with respect to an intersection of the sets of values of the pair of fields. The computer system can recommend fields for a join operation between any pair of data sets in the plurality of data sets based on such statistical measures.Type: ApplicationFiled: August 22, 2014Publication date: February 25, 2016Inventors: Jonathan Young, John O'Neil, William K. Johnson, III, Martin Serrano, Gregory George
-
Publication number: 20160055205Abstract: A computer system processes a plurality of unrelated database tables to create a join graph where each node in the join graph represents a table. The nodes in the join graph are connected by weighted, directed edges, where each directed edge represents a join from a first column in a first table to a second column in a second table and where the weight of the directed edge represents a predicted level of success in performing the join. The edge weights can be based on a likelihood of finding a value from the first column in the second column. A user selects a subset of the tables, and the system creates a join tree with recommended joins between the tables selected by the user. The recommended joins are used to create a structured query language statement which is executed to return a result to the user.Type: ApplicationFiled: August 24, 2015Publication date: February 25, 2016Inventors: Young Jonathan, John O'Neil, William K. Johnson, III, Martin Serrano, Gregory George, Udayan Das
-
Patent number: 8875155Abstract: A data flow processing system represents processing by a directed graph including processing nodes that generate, and process, groups of dependent messages and that can process such groups of messages in order. To identify a group of messages, the system applies message identifiers to messages. Processing of a message may generate child messages. A child message is assigned a message identifier that incorporates the message identifier of the parent message. The message identifier of the parent message is annotated to indicate the number of related child messages. The processing node maintains a buffer to store messages in the group. When a message is received, its message identifier indicates whether it is in a group and information about the group. From this information the processing node determines whether all messages within the group have been received, at which time the processing node can process the messages in order.Type: GrantFiled: July 16, 2013Date of Patent: October 28, 2014Assignee: Attivio, Inc.Inventors: William K. Johnson, III, Martin Anthony Serrano
-
Publication number: 20140052798Abstract: A data flow processing system represents processing by a directed graph including processing nodes that generate, and process, groups of dependent messages and that can process such groups of messages in order. To identify a group of messages, the system applies message identifiers to messages. Processing of a message may generate child messages. A child message is assigned a message identifier that incorporates the message identifier of the parent message. The message identifier of the parent message is annotated to indicate the number of related child messages. The processing node maintains a buffer to store messages in the group. When a message is received, its message identifier indicates whether it is in a group and information about the group. From this information the processing node determines whether all messages within the group have been received, at which time the processing node can process the messages in order.Type: ApplicationFiled: July 16, 2013Publication date: February 20, 2014Inventors: William K. Johnson, III, Martin Anthony Serrano
-
Patent number: 8495656Abstract: A highly parallel, asynchronous data flow processing system in which processing is represented by a directed graph model, can include processing nodes that generate, and process, groups of dependent messages and that process messages within such groups in order. Other messages can be processed in whatever order they are received by a processing node. To identify a group of dependent messages, message identifiers are applied to a message. Processing of a message may generate child messages. A child message is assigned a message identifier that incorporates the associated message identifier of the parent message. The message identifier of the parent message is annotated to indicate the number of related child messages. When a group of messages is to be processed by a processing node in order, the processing node maintains a buffer in which messages in the group are stored.Type: GrantFiled: October 15, 2010Date of Patent: July 23, 2013Assignee: Attivio, Inc.Inventors: William K. Johnson, III, Martin Anthony Serrano
-
Publication number: 20120096475Abstract: A highly parallel, asynchronous data flow processing system in which processing is represented by a directed graph model, can include processing nodes that generate, and process, groups of dependent messages and that process messages within such groups in order. Other messages can be processed in whatever order they are received by a processing node. To identify a group of dependent messages, message identifiers are applied to a message. Processing of a message may generate child messages. A child message is assigned a message identifier that incorporates the associated message identifier of the parent message. The message identifier of the parent message is annotated to indicate the number of related child messages. When a group of messages is to be processed by a processing node in order, the processing node maintains a buffer in which messages in the group are stored.Type: ApplicationFiled: October 15, 2010Publication date: April 19, 2012Applicant: Attivio, Inc.Inventors: William K. Johnson, III, Martin Anthony Serrano
-
Patent number: 5253308Abstract: A massively parallel digital image data processor provides a large number of processing elements arranged in a two-dimensional matrix form. Relative indexed addressing among the processing elements is provided, whereby image data may be easily accessed by and shared among all processing elements. A single-instruction/multiple-data (SIMD) architecture provides instructions to the processing elements in parallel in accordance with specific application programs therefor. The processing elements use triple-ported register files for their internal memory which may input and output data independently and simultaneously. The processing elements are memory-mapped into the address space of the processor's embedded computer to simplify addressing thereof. All image data is inputted and outputted in pixel format. All image data is transferred, stored and processed in bit-serial format.Type: GrantFiled: June 21, 1989Date of Patent: October 12, 1993Assignee: Amber Engineering, Inc.Inventor: William K. Johnson
-
Patent number: 4814884Abstract: A window generator is disclosed which provides a unique 6 bit target identification number for up to 63 target areas and one background area in a frame of serially scanned data. Any number of target areas can be identified by increasing memory width. The target numbers allow video pipeline processing circuitry to collect statistics separately for each target area. A target number is provided for each pixel as the image is scanned in a raster can format. The target areas are defined as rectangular sectors with background at all other non-target locations. The window generator has contained in a RAM the data necessary to define the window areas. This data is calculated and formatted off-line by a microprocessor and downloaded into the RAM. Information contained in the RAM represents the number of pixels between any two successive target area corners along with a two bit command word.Type: GrantFiled: October 21, 1987Date of Patent: March 21, 1989Assignee: The United States of America as represented by the Secretary of the Air ForceInventors: William K. Johnson, Roger A. May
-
Patent number: 4550230Abstract: A system for facilitating attachment of a loudspeaker grille to an adjacent structure. The invention includes a fastener with a square head which is shaped to be inserted within a head-receiving portion formed in the grille. The fastener is gripped on one pair of opposite sides between a pair of parallel, longitudinal guides. The other sides of the fastener are captured between an abutment and a depressable latch which is sufficiently flexible to permit insertion of the head thereover into the head-receiving portion.Type: GrantFiled: October 18, 1982Date of Patent: October 29, 1985Assignee: International Jensen IncorporatedInventor: William K. Johnson
-
Patent number: 4503292Abstract: A system for releasably attaching the grille of a loudspeaker directly to the rim of the loudspeaker. The system includes a plurality of latch members in the form of posts extending from the grille, each of the posts having an indentation including a cam and a plurality of latch-engaging portions located in the rim of the loudspeaker in registration with the posts. The latch-engaging portions each include an aperture shaped for penetration by the corresponding post. Locking means comprising a longitudinal slot and a cam receiver juxtaposed the slot is shaped to engage the indentation and cam and extends laterally from each aperture. The cam and cam receiver are correspondingly shaped such that less force is required to engage the cam and cam receiver then is required to disengage the same.Type: GrantFiled: October 18, 1982Date of Patent: March 5, 1985Assignee: International Jensen IncorporatedInventors: William K. Johnson, Jaime Ferrero
-
Patent number: D1027693Type: GrantFiled: July 22, 2021Date of Patent: May 21, 2024Assignee: Target Brands, Inc.Inventors: Jason W. Johnson, Alex K. Poniatowski, William Y. Stafford, Kevin R. Huljich, Dan A. Breunig, Paul Trottier