Patents by Inventor Allen Brown
Allen Brown 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: 11581714Abstract: The system for pulling wire through a conduit includes a cable puller and a remote controller. The cable puller may pull a wire through a conduit. The wire may be removably coupled to a cable coupler located on the rear of the cable puller. The cable puller may be inserted into a first end of the conduit and may progress to a second end of the conduit under the influence of a plurality of tractors. A camera that is mounted on a faceplate at the front of a housing of the cable puller may transmit one or more images to the remote controller. One or more visible light sources and one or more infrared light sources may provide illumination for the camera. Movements of the cable puller may be controlled remotely using the remote controller.Type: GrantFiled: April 14, 2020Date of Patent: February 14, 2023Inventor: Allen Brown
-
Patent number: 10331679Abstract: A method and apparatus for providing a recommendation for learning about an interest are disclosed. For example, the method receives a query for a recommendation for one or more articles for learning about an interest, determines whether the interest of the user is in a list of interests, wherein each particular interest is an interest for which a database contains at least one article for learning about the particular interest, wherein the database is used for storing for each particular article: the particular article and a normalized relationship score for the interest, retrieves from the database, one or more articles having the normalized relationship score related to the interest when the interest is in the list of interests, and presents the recommendation to an endpoint device of the user, wherein the recommendation comprises the one or more articles related to the interest that are retrieved.Type: GrantFiled: October 30, 2015Date of Patent: June 25, 2019Assignee: AT&T Intellectual Property I, L.P.Inventors: Bryan Strassner, Allen Brown, Michael Lemen, Trevor Lovett, Douglas McCullough, Matthew McEuen
-
Patent number: 9664542Abstract: Systems and methods for additive manufacturing for air data probes are provided. In at least one embodiment a probe comprises a support structure comprising one or more ports for receiving one or more fluids, the support structure comprising an endoskeleton mandrel having an opening for receiving a fluid; and a heating cable encircling an external surface of the endoskeleton mandrel. The probe also comprises an additive coating fused to the external surface of the endoskeleton mandrel and an external surface of the heating cable; and an internal assembly inside the support structure for carrying pressures from the one or more ports to one or more instruments that respond to the one or more fluids to provide a measurement.Type: GrantFiled: August 20, 2015Date of Patent: May 30, 2017Assignee: Honeywell International Inc.Inventors: Grant A. Gordon, Yates Wong, Richard Bonvouloir, Patrick Flynn, Morris Anderson, Allen Brown
-
Publication number: 20170124080Abstract: A method and apparatus for providing a recommendation for learning about an interest are disclosed. For example, the method receives a query for a recommendation for one or more articles for learning about an interest, determines whether the interest of the user is in a list of interests, wherein each particular interest is an interest for which a database contains at least one article for learning about the particular interest, wherein the database is used for storing for each particular article: the particular article and a normalized relationship score for the interest, retrieves from the database, one or more articles having the normalized relationship score related to the interest when the interest is in the list of interests, and presents the recommendation to an endpoint device of the user, wherein the recommendation comprises the one or more articles related to the interest that are retrieved.Type: ApplicationFiled: October 30, 2015Publication date: May 4, 2017Inventors: Bryan Strassner, Allen Brown, Michael Lemen, Trevor Lovett, Douglas McCullough, Matthew McEuen
-
Publication number: 20170052046Abstract: Systems and methods for additive manufacturing for air data probes are provided. In at least one embodiment a probe comprises a support structure comprising one or more ports for receiving one or more fluids, the support structure comprising an endoskeleton mandrel having an opening for receiving a fluid; and a heating cable encircling an external surface of the endoskeleton mandrel. The probe also comprises an additive coating fused to the external surface of the endoskeleton mandrel and an external surface of the heating cable; and an internal assembly inside the support structure for carrying pressures from the one or more ports to one or more instruments that respond to the one or more fluids to provide a measurement.Type: ApplicationFiled: August 20, 2015Publication date: February 23, 2017Inventors: Grant A. Gordon, Yates Wong, Richard Bonvouloir, Patrick Flynn, Morris Anderson, Allen Brown
-
Patent number: 8407242Abstract: Described are techniques to facilitate temporal features in a semantic data store. Information about lifetimes of facts in a semantic store is maintained. Even when a fact is logically deleted, a physical record is kept available. The record of a logically deleted or invalid fact has associated lifetime information. For example, valid-from and valid-to time values. The record of a fact not yet deleted may have a valid-from time value indicating when it was created, became valid, etc. Queries against the semantic store may specify a timeslice (a point in time or a time range). The lifetime information can be used to satisfy such time-specific queries. Because records are maintained after they are logically deleted, it is also possible to accurately query a past state of the semantic store. Even if such a query is run at different times, same results may be obtained.Type: GrantFiled: December 16, 2010Date of Patent: March 26, 2013Assignee: Microsoft CorporationInventors: Thomas E Jackson, Stuart Bowers, Chris Karkanias, Allen Brown, David Campbell, Brian Aust
-
Publication number: 20120158771Abstract: Described are techniques to facilitate temporal features in a semantic data store. Information about lifetimes of facts in a semantic store is maintained. Even when a fact is logically deleted, a physical record is kept available. The record of a logically deleted or invalid fact has associated lifetime information. For example, valid-from and valid-to time values. The record of a fact not yet deleted may have a valid-from time value indicating when it was created, became valid, etc. Queries against the semantic store may specify a timeslice (a point in time or a time range). The lifetime information can be used to satisfy such time-specific queries. Because records are maintained after they are logically deleted, it is also possible to accurately query a past state of the semantic store. Even if such a query is run at different times, same results may be obtained.Type: ApplicationFiled: December 16, 2010Publication date: June 21, 2012Applicant: MICROSOFT CORPORATIONInventors: Thomas E. Jackson, Stuart Bowers, Chris Karkanias, Allen Brown, David Campbell, Brian Aust
-
Publication number: 20080183984Abstract: An integrated circuit includes an array of memory cells, addressing circuitry, and timing and control logic. The array of memory cells is configured to store data bits. The addressing circuitry is configured to address multiple locations of memory cells in response to a clock signal. The timing and control logic is responsive to the clock signal and configured to control a read-modify-write operation to read a first group of data bits from a first address location, modify at least one of the bits of the first group, and write the modified first group to the first address location. The read-modify-write operation is performed within one cycle of the clock signal.Type: ApplicationFiled: January 31, 2007Publication date: July 31, 2008Inventors: Dale Beucler, Allen Brown
-
Publication number: 20070084906Abstract: A method of hole defect repair includes removing one or more defects at or near a desired hole shape in a substrate by removing a non-concentric portion of the substrate proximate the desired hole shape, and welding a filler material to the substrate after removing the non-concentric portion of the substrate.Type: ApplicationFiled: October 13, 2005Publication date: April 19, 2007Inventors: Chris Vargas, John Mullooly, Allen Brown
-
Publication number: 20070079287Abstract: Systems and methods for incorporating qualified, polymorphic, hedge-regular types into computer-programming languages are disclosed. A programming language having such a type system, and a typing system for such a programming language are also disclosed. Also described is Haxell, an effort to completely integrate regular hedge pattern-matching into Haskell. Haxell is a Haskell embodiment of a set of concepts that may be applied to any of a number of functional and/or traditional languages.Type: ApplicationFiled: December 28, 2005Publication date: April 5, 2007Applicant: Microsoft CorporationInventors: Allen Brown, Matthew Fuchs
-
Patent number: 7198145Abstract: A pusher has a retaining member disposed within an opening in the pusher cap, a fastening member secured to the pusher base and a fuse element interposes between the retaining member and the fastening member, the fuse element failing upon the application of an undesirable level of force to said pusher cap.Type: GrantFiled: June 9, 2006Date of Patent: April 3, 2007Assignee: Intelligrated, Inc.Inventors: Allen Brown, Martin Heit, Justin Zimmer
-
Publication number: 20060080600Abstract: A group identifier represents an association between each of a number of different abbreviated namespace identifiers with a corresponding hierarchical namespace (e.g., an XML namespace). A hierarchically-structured document (e.g., an XML document) is accessed by a computing system that determines that the group identifier is associated with the hierarchically-structured document. Hence, when using the abbreviated namespace identifiers in the hierarchically-structured document, the computing system knows that the corresponding namespace is associated with the designated portions of the hierarchically-structured document. Also, a schema description language document (e.g., an XSD document) may specify multiple target namespaces for a single element. Accordingly, groupings of elements may be included in different namespaces to creating overlapping or even nested namespaces.Type: ApplicationFiled: October 27, 2005Publication date: April 13, 2006Applicant: Microsoft CorporationInventors: Christopher Kaler, Allen Brown, Robert Atkinson, Steven Lucco
-
Publication number: 20060010372Abstract: A group identifier represents an association between each of a number of different abbreviated namespace identifiers with a corresponding hierarchical namespace (e.g., an XML namespace). A hierarchically-structured document (e.g., an XML document) is accessed by a computing system that determines that the group identifier is associated with the hierarchically-structured document. Hence, when using the abbreviated namespace identifiers in the hierarchically-structured document, the computing system knows that the corresponding namespace is associated with the designated portions of the hierarchically-structured document. Also, a schema description language document (e.g., an XSD document) may specify multiple target namespaces for a single element. Accordingly, groupings of elements may be included in different namespaces to creating overlapping or even nested namespaces.Type: ApplicationFiled: September 15, 2005Publication date: January 12, 2006Applicant: Microsoft CorporationInventors: Christopher Kaler, Allen Brown, Robert Atkinson, Steven Lucco
-
Publication number: 20050183099Abstract: A reflective process algebra called the ?-calculus facilitates the serialization of processes at the level of the reflective process algebra. The reflective process algebra because of its reflective properties, can be used on computing systems with finite resources. The reflective process calculus can be made to be sensitive to resources, such as memory and bandwidth, hence facilitating its use as a programming language at the machine level. The reflective process calculus causes the dual nature of a computation entity to be exposed. A name can be caused to become a process and a process can be caused to become a name.Type: ApplicationFiled: March 30, 2004Publication date: August 18, 2005Inventors: L. Meredith, Allen Brown, David Richter, George Moore
-
Publication number: 20050166183Abstract: Trees are a common semantic denominator of XML data types and process calculi. This indicates a potential tight intertwining of the syntax and semantics of data and processes. The invention provides this intertwining via a process calculus wherein the data language syntax is a fragment of the programming language syntax.Type: ApplicationFiled: June 30, 2004Publication date: July 28, 2005Applicant: Microsoft CorporationInventors: Allen Brown, Lucius Meredith, Cosimo Laneve
-
Publication number: 20050131978Abstract: The systems and methods of the present invention utilize stochastic calculus (e.g., pi calculus) to determine (e.g., specify, predict, etc.) quality of service that includes at least one of rate, uptime and capacity. The quality of service can be indicative of a level of service provided and/or required by an agent (e.g., a web service). The quality of service can be obtained by representing an agent's contract via a model (e.g., state diagram or mathematical algorithm) and decorating the model with cost functions that are utilized to compute transition costs that are employed to predict associated rates for respective transitions. The model can further be decorated with error states to determine uptime and employed to determine channel capacity. In general, the quality service of a requesting agent and a providing agent can be compared to determine whether the providing agent can satisfy the level of performance of the requesting agent.Type: ApplicationFiled: July 30, 2004Publication date: June 16, 2005Applicant: Microsoft CorporationInventors: Lucius Meredith, Allen Brown, David Richter
-
Publication number: 20050000779Abstract: A sortation conveyor has a divert guide path which is configured to guide pushers to engage articles disposed on an endless conveying surface at an initial impact which does not result in an out of control situation even at high speeds. The divert guide path is disposed at a plurality of divert angles, and guides pushers to engage articles at a low initial contact divert angle and first lateral speed and to accelerate the articles to a final divert angle and second, higher, lateral speed. The pushers may be undergoing lateral acceleration at the time initial contact is made with the articles.Type: ApplicationFiled: March 12, 2004Publication date: January 6, 2005Inventors: Raymond Neiser, Justin Zimmer, Martin Heit, Allen Brown
-
Patent number: D321052Type: GrantFiled: May 27, 1988Date of Patent: October 22, 1991Assignee: Allen BrownInventors: Allen Brown, Jesse L. Colodner