Boyd, WA
Bryce S. Boyd, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20100306171 | Timeline Experience for Restore User Interface - A backup restoration system may present two or more versions of a file in a graphical user interface. A user may examine the versions to identify a desired version, and the desired version may be restored. The system may identify changed versions of the file from many stored instances of the file in the backup system, and may present the changed versions within the user interface. In some embodiments, a timeline may be presented that displays when the file was changed. Some embodiments may also highlight the changes in the display. Some embodiments may present the versions of a file in a horizontal format, where two or more versions may be viewed side by side. | 12-02-2010 |
Charles Boyd, Woodinville, WA US
Patent application number | Description | Published |
---|---|---|
20140357357 | GAME BUNDLE PACKAGE - One or more techniques and/or systems are provided for generating a bundle package, digitally signing the bundle package, selectively disturbing the bundle package, and/or indexing one or more resource packages retrieved from the bundle package. That is, a bundle package (e.g., an application or game bundle package) comprises one or more app packages comprising application code configured to execute on various computing environments (e.g., operating systems, processors, etc.). The bundle package may comprise one or more resource packages comprising supplemental data used to provide optional user experience functionality for the application (e.g., French language support, high resolution textures, a gaming pad support, etc.). In this way, a client device may selectively download portions of the bundle package that may be relevant, which may mitigate download bandwidth, storage space, or resources otherwise used to obtain unnecessary portions of the bundle package (e.g., a tablet device may merely download low resolution textures). | 12-04-2014 |
Charles Boyd, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20100076941 | MATRIX-BASED SCANS ON PARALLEL PROCESSORS - A system and method for performing a scan of an input sequence in a parallel processor having a shared register file. A two dimensional matrix is generated, having a number of rows representing a number of threads and a number of columns based on the input sequence block size and the number of rows. One or more padding columns may be added to the matrix to avoid or reduce memory bank conflicts. A first traversal of the rows performs a reduction or a scan of each of the rows in parallel, storing the reduction values. The reduction values are used during a second traversal to propagate the reduction values. In a segmented scan, propagation is selectively performed based on flags representing segment boundaries. | 03-25-2010 |
Charles N. Boyd, Woodinville, WA US
Patent application number | Description | Published |
---|---|---|
20080198169 | SYSTEMS AND METHODS FOR DOWNLOADING ALGORITHMIC ELEMENTS TO A COPROCESSOR AND CORRESPONDING TECHNIQUES - Systems and methods for downloading algorithmic elements to a coprocessor and corresponding processing and communication techniques are provided. For an improved graphics pipeline, the invention provides a class of co-processing device, such as a graphics processor unit (GPU), providing improved capabilities for an abstract or virtual machine for performing graphics calculations and rendering. The invention allows for runtime-predicated flow control of programs downloaded to coprocessors, enables coprocessors to include indexable arrays of on-chip storage elements that are readable and writable during execution of programs, provides native support for textures and texture maps and corresponding operations in a vertex shader, provides frequency division of vertex streams input to a vertex shader with optional support for a stream modulo value, provides a register storage element on a pixel shader and associated interfaces for storage associated with representing the “face” of a pixel, provides vertex shaders and pixel shaders with more on-chip register storage and the ability to receive larger programs than any existing vertex or pixel shaders and provides 32 bit float number support in both vertex and pixel shaders. | 08-21-2008 |
20090256849 | Systems and Methods for Providing Intermediate Targets in a Graphics System - Systems and methods for utilizing intermediate target(s) in connection with computer graphics in a computer system are provided. In various embodiments, intermediate memory buffers in video memory are provided and utilized to allow serialized programs from graphics APIs to support algorithms that exceed the instruction limits of procedural shaders for single programs. The intermediate buffers may also allow sharing of data between programs for other purposes as well, and are atomically accessible. The size of the buffers, i.e., the amount of data stored in the intermediate targets, can be variably set for a varying amount of resolution with respect to the graphics data. In this regard, a single program generates intermediate data, which can then be used, and re-used, by an extension of the same program and/or any number of other programs any number of times as may be desired, enabling considerable flexibility and complexity of shading programs, while maintaining the speed of modern graphics chips. | 10-15-2009 |
20100039430 | METHOD AND SYSTEM FOR DEFINING AND CONTROLLING ALGORITHMIC ELEMENTS IN A GRAPHICS DISPLAY SYSTEM - An API is provided that enables programmability of a 3D chip, wherein programming or algorithmic elements written by the developer can be downloaded to the chip, thereby programming the chip to perform those algorithms. A developer writes a routine that is downloadable to a 3D graphics chip. There are also a set of algorithmic elements that are provided in connection with the API that have already been programmed for the developer, that are downloadable to the programmable chip for improved performance. Thus, a developer may download preexisting API objects to a 3D graphics chip. A developer adheres to a specific format for packing up an algorithmic element, or set of instructions, for implementation by a 3D graphics chip. The developer packs the instruction set into an array of numbers, by referring to a list of ‘tokens’ understood by the 3D graphics chip. This array of numbers in turn is mapped correctly to the 3D graphics chip for implementation of the algorithmic element by the 3D graphics chip. | 02-18-2010 |
20110234592 | Systems And Methods For Providing An Enhanced Graphics Pipeline - An enhanced graphics pipeline is provided that enables common core hardware to perform as different components of the graphics pipeline, programmability of primitives including lines and triangles by a component in the pipeline, and a stream output before or simultaneously with the rendering a graphical display with the data in the pipeline. The programmer does not have to optimize the code, as the common core will balance the load of functions necessary and dynamically allocate those instructions on the common core hardware. The programmer may program primitives using algorithms to simplify all vertex calculations by substituting with topology made with lines and triangles. The programmer takes the calculated output data and can read it before or while it is being rendered. Thus, a programmer has greater flexibility in programming. By using the enhanced graphics pipeline, the programmer can optimize the usage of the hardware in the pipeline, program vertex, line or triangle topologies altogether rather than each vertex alone, and read any calculated data from memory where the pipeline can output the calculated information. | 09-29-2011 |
20120038657 | GPU TEXTURE TILE DETAIL CONTROL - Systems and associated methods for processing textures in a graphical processing unit (GPU) are disclosed. Textures may be managed on a per region (e.g., tile) basis, which allows efficient use of texture memory. Moreover, very large textures may be used. Techniques provide for both texture streaming, as well as sparse textures. A GPU texture unit may be used to intelligently clamp LOD based on a shader specified value. The texture unit may provide feedback to the shader to allow the shader to react conditionally based on whether clamping was used, etc. Per region (e.g., per-tile) independent mipmap stacks may be used to allow very large textures. | 02-16-2012 |
20120086715 | TARGET INDEPENDENT RASTERIZATION - Methods, systems, and computer-storage media for target independent rasterization of an image. The target is the memory allocated for a rendered image within a graphics pipeline. Embodiments of the present invention allow the rasterization process's sampling rate to be specified independently from the memory allocated for the rendered image. Embodiments of the present invention also allow the rasterization process to be executed at a rate that does not correspond to the memory allocated for the rendered target. | 04-12-2012 |
20120113118 | Systems and Methods for Providing Intermediate Targets in a Graphics System - Utilizing intermediate target(s) in connection with computer graphics in a computer system is provided. In various embodiments, intermediate memory buffers in video memory are provided and utilized to allow serialized programs from graphics APIs to support algorithms that exceed the instruction limits of procedural shaders for single programs. The intermediate buffers may also allow sharing of data between programs for other purposes as well, and are atomically accessible. The size of the buffers can be variably set for a varying amount of resolution with respect to the graphics data. In this regard, a single program generates intermediate data, which can then be used, and re-used, by an extension of the same program and/or any number of other programs any number of times as may be desired, enabling considerable flexibility and complexity of shading programs, while maintaining the speed of modern graphics chips. | 05-10-2012 |
Charles Neil Boyd, Woodinville, WA US
Patent application number | Description | Published |
---|---|---|
20100088356 | FAST COMPUTATION OF GENERAL FOURIER TRANSFORMS ON GRAPHICS PROCESSING UNITS - Described is a technology for use with general discrete Fourier transforms (DFTs) performed on a graphics processing unit (GPU). The technology is implemented in a general library accessed through GPU-independent APIs. The library handles complex and real data of any size, including for non-power-of-two data sizes. In one implementation, the radix-2 Stockham formulation of the fast Fourier transform (FFT) is used to avoid computationally expensive bit reversals. For non-power of two data sizes, a Bluestein z-chirp algorithm may be used. | 04-08-2010 |
Chas Boyd, Woodinville, WA US
Patent application number | Description | Published |
---|---|---|
20140368523 | HARDWARE-ACCELERATED RESOURCE TILING - In one embodiment, a graphics processing unit | 12-18-2014 |
20150091931 | Procedurally Defined Texture Maps - A procedural texture relates texel coordinates to color values through an arbitrary function, herein called a texel shader. The procedural texture is defined by a dimension, size, texel format and the texel shader. Texel coordinates are an input to the texel shader, which generates a color value for those texel coordinates. A renderer can be implemented either in hardware, such as part of a graphics processor, or in software as a computer program executed by a processor. The renderer samples from the procedural texture in response to texel coordinates, and evaluates the texel shader on demand. Filtering also can be applied automatically to results. The results of the texel shader invocations are stored in a texture cache to take advantage of spatial and temporal locality. Results are shared among threads, processes and the like through the texture cache. | 04-02-2015 |
Christopher Boyd, Seattle, WA US
Patent application number | Description | Published |
---|---|---|
20120109938 | PROVIDING CONSOLIDATED PROJECT INFORMATION SERVICE - Structured and unstructured project information is collected, analyzed, and consolidated by a project service. On-demand or periodically, the project service consolidates the unstructured project information and the structured project information to present to an end user as aggregate information. The aggregate information may be formatted based on user criteria. | 05-03-2012 |
20130036087 | VISIBILITY AND MANAGEMENT OF PROJECT DATA - An integrated system for facilitating visibility and management of projects in a Content Management Application (CMA) is provided. A Project Application Server PAS is enabled to coordinate and associate with a CMA and to identify projects, project data, and project task lists associated with the projects processed by the CMA. The PAS may import the projects, the associated project data, and project task lists, into a central database managed by the PAS. The PAS database may also provide a centralized framework for displaying projects and enabling a user to view the projects in order to see activity and content related to a particular project in the centralized PAS framework. The PAS and the CMA may be continuously synchronized in order to maintain current versions of project content as projects are modified by users in the CMA and/or the PAS framework. | 02-07-2013 |
Christopher A. Boyd, Seattle, WA US
Patent application number | Description | Published |
---|---|---|
20140372367 | Retrieving Stored Data Using a Web Service - Retrieving stored data using a web service is provided. An access request from a user account may be received at a web service via a proxy. The web service may decode information received in the access request. The web service may then authorize the user account utilizing the decoded information. The web service may then determine a request type based on the access request. The web service may then send a response based on the determined request type, which is based on data retrieved from a data store. | 12-18-2014 |
Christopher Andrew Boyd, Seattle, WA US
Patent application number | Description | Published |
---|---|---|
20100293278 | Synchronizing Tasks between Servers - Systems and methods for synchronizing task data between a mailbox server of an email system and a project server of a project management system include a project that is published on the project management system, task data for the project is sent from the project server to the mailbox server. The task data includes the attributes of the project tasks and resources assigned to the project tasks. When the mailbox server receives the task data, the mailbox server creates a task on the mailbox server for each task for which the task doesn't already exist on the mailbox server. The mailbox server inserts each created task into the mailbox of the assignee for the task. The assignee can view the task attributes and update task status using a client that accesses the mailbox server. | 11-18-2010 |
Daniel Boyd, Seattle, WA US
Patent application number | Description | Published |
---|---|---|
20160076295 | Foot Pedal Door Opener - A foot pedal door opener adapted to allow a user to more easily open the door of a refrigerator in a hands-free manner. The door opener provides a lever that pivots about a bar and is disposed between a pair of brackets that also pivot about the bar. A pedal is disposed on the lever and provides a foot support and a shaft. A band extends along and around the lever and the pair of brackets to provide resistance thereto. The user can manually step on the foot support, applying pressure thereto, wherein the pressure moves the lever from a resting position to a working position such that the lever pushes the refrigerator door open for the user. The foot pedal door opener can be mounted to the bottom of a refrigerator via an adhesive or other fasteners. | 03-17-2016 |
Eric M. Boyd, Clyde Hill, WA US
Patent application number | Description | Published |
---|---|---|
20140278983 | USING ENTITY REPOSITORY TO ENHANCE ADVERTISEMENT DISPLAY - In various embodiments, systems and methods are provided for facilitating enhanced advertisement display. In embodiments, an indication of an entity preference and a corresponding entity bid in association with an advertisement are received. Thereafter, the entity preference and the corresponding entity bid associated with the advertisement are provided for use in an advertisement auction when at least one search result for a query is associated with the entity preference. In such a case, the entity bid is used to participate in the advertisement auction. | 09-18-2014 |
Jonathan J. Boyd, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20080243473 | Language translation of visual and audio input - The present translation system translates visual input and/or audio input from one language into another language. Some implementations incorporate a context-based translation that uses information obtained from visual input or audio input to aid in the translation of the other input. Other implementations combine the visual and audio translation. The translation system includes visual components and/or audio components. The visual components analyze visual input to identify a textual element and translate the textual element into a translated textual element. The visual image represents a captured image of a target scene. The visual components may further substitute the translated textual element for the textual element in the captured image. The audio components convert audio input into translated audio. | 10-02-2008 |
20130185052 | LANGUAGE TRANSLATION OF VISUAL AND AUDIO INPUT - The present translation system translates visual input and/or audio input from one language into another language. Some implementations incorporate a context-based translation that uses information obtained from visual input or audio input to aid in the translation of the other input. Other implementations combine the visual and audio translation. The translation system includes visual components and/or audio components. The visual components analyze visual input to identify a textual element and translate the textual element into a translated textual element. The visual image represents a captured image of a target scene. The visual components may further substitute the translated textual element for the textual element in the captured image. The audio components convert audio input into translated audio. | 07-18-2013 |
20130338997 | LANGUAGE TRANSLATION OF VISUAL AND AUDIO INPUT - The present translation system translates visual input and/or audio input from one language into another language. Some implementations incorporate a context-based translation that uses information obtained from visual input or audio input to aid in the translation of the other input. Other implementations combine the visual and audio translation. The translation system includes visual components and/or audio components. The visual components analyze visual input to identify a textual element and translate the textual element into a translated textual element. The visual image represents a captured image of a target scene. The visual components may further substitute the translated textual element for the textual element in the captured image. The audio components convert audio input into translated audio. | 12-19-2013 |
Joseph Boyd, Sammamish, WA US
Patent application number | Description | Published |
---|---|---|
20100303282 | FINGERPRINTING A DATA OBJECT - Embodiments of the invention provide a method and a system for fingerprinting a data object at a server system and a method and a system for extracting the fingerprint from the data object at a client system. Sections of a data object are watermarked with known watermark data to create a first and a second variant of the data object, whereby the section boundaries are optionally saved as metadata. Using the metadata, the first and second variant are combined by taking sections from the variants to create a fingerprinted data object. From the fingerprinted data object, the watermark data can be extracted again. | 12-02-2010 |
20110125849 | PEER-TO-PEER CONTENT DISTRIBUTION - A method is described for distributing content using a P2P distribution system. The distribution system comprises a P2P network connected to a server system, wherein the server system is configured to divide the content in pieces and to provide the P2P network with piece variants of one or more pieces. The method comprises the steps of: providing a communication session between a client and the server system; the client sending a content request to the server system; the client receiving in response to the content request one more piece variant identifiers and distribution information comprising integrity information of all piece variants provided by the server system. | 05-26-2011 |
Kevin M. Boyd, Issaquah, WA US
Patent application number | Description | Published |
---|---|---|
20100103908 | METHOD AND APPARATUS FOR EFFICIENT SHARING OF COMMUNICATION SYSTEM RESOURCES - A method for accessing a reverse channel for communication from a remote unit to a base station is disclosed. The method includes waiting a random period of time in response to determining that the reverse channel is available at a first time. The method also includes monitoring a forward channel after expiration of the random period of time to determine whether the reverse channel is available at a second time. The method further includes transmitting a first portion of data on the reverse channel in response to determining that the reverse channel is available at the second time. | 04-29-2010 |
Michael W. Boyd, Seattle, WA US
Patent application number | Description | Published |
---|---|---|
20110087513 | METHOD AND SYSTEM FOR MANAGING A PROGRAM RELATING TO A PRODUCT - A method for managing a program relating to a product, the program including a plurality of program requirements for performing a plurality of program tasks, includes: (a) establishing a location reference system for a representation of the product in three dimensions; (b) identifying a plurality of task-loci in a display; the display presenting the representation of the product according to the location reference system; each respective task-locus of the plurality of task-loci being associated with a respective program task of the plurality of program tasks; (c) characterizing each respective task-locus associated with an accomplished respective program task as a respective completed task-locus; and (d) accounting for accomplishment of the respective program tasks by accounting for the respective completed task-loci. | 04-14-2011 |
Nathan D. T. Boyd, Seattle, WA US
Patent application number | Description | Published |
---|---|---|
20110026528 | METHOD OF DATA TRANSMISSION IN A DATA COMMUNICATION NETWORK - A method of data transmission in a data communication network includes negotiating a connection between a source terminal and a destination terminal in the data communication network. During the connection negotiation process, optimal field lengths are determined for recording a source identifier and a sequence number in data packets transmitted in the connection. The source identifier identifies a connection from the source cnd to the destination end of the data transmission, while the sequence number identifies the relative position of a data packet in a series of data packets transmitted in the connection. The length of the source identifier and sequence number fields may either be calculated or selected from a set of predetermined field length values. Data packets formatted according to different transmission protocols (“secondary data packets”) that are received for transmission through the data communication network are packed into one or more “primary data packets” formatted according to the transmission protocol of the data communication network. In addition to a source identifier and sequence number, the primary data packets include a first packet offset to identify the location of a first new secondary data packet that is packed into the primary data packet. A first packet offset field length is determined during connection negotiation. The data transmission method of the invention includes packing one or more secondary data packets, or a portion thereof, in a primary data packet to fill the primary data packet, thus minimizing unused data bits in the primary data packet. After transmission, the primary data packets are reordered, if necessary, and the secondary data packets are unpacked therefrom. | 02-03-2011 |
Patrick Boyd, Seattle, WA US
Patent application number | Description | Published |
---|---|---|
20160132992 | USER INTERFACE SCALING FOR DEVICES BASED ON DISPLAY SIZE - Non-limiting examples of the present disclosure describe adaptively scaling a user interface based on detection of a display size associated with a connected processing device. A display size associated with a connected processing device is detected. A display class is determined based on the detected display size. A user interface for an application is launched based on the determined display class. Other examples are also described. | 05-12-2016 |
Patrick S. Boyd, Seattle, WA US
Patent application number | Description | Published |
---|---|---|
20150143271 | REMOTE CONTROL FOR DISPLAYING APPLICATION DATA ON DISSIMILAR SCREENS - A remote control service on a mobile device interrogates a program on another computing device to obtain metadata describing the structure of information being displayed on the computing device. The remote control service then calculates a different data structure that is used to display a subset of the data on the display screen of the mobile device. | 05-21-2015 |
Philip W. Boyd, Maple Valley, WA US
Patent application number | Description | Published |
---|---|---|
20140157588 | HIGH RATE PULSING WING ASSEMBLY LINE - A single piece pulsed flow wing assembly method providing for horizontal wing manufacture is accomplished using synchronized automated vehicles guided in a predetermined manner to move and, locate wing structure in a plurality of assembly positions. Multi-axis assembly positioning systems (MAPS) are used at each assembly position to support and index components in the wing structure and determinant assembly techniques are used for indexing of the components. Modular automated manufacturing processes employing magnetic assembly clamping, drilling, fastener insertion, and sealant application are employed. | 06-12-2014 |