| Patent application number | Description | Published |
|---|
| 20110032972 | Economical, RF transparent, selective code phased array antenna processor - A single chip diversity beamforming antenna array processor is disclosed. The processor utilizes low-power and low area circuits to achieve combining game mitigate the effects of multipath fading provide spatial suppression and provide diversity gain to a single input receiver. The device is radiofrequency transparent yet provides antenna gain by selective three G and four G code acquisition and tracking of a desired downlink channel. | 02-10-2011 |
| 20110090052 | WIRELESS DEVICES FOR PROCESS AUTOMATION AND VERIFICATION - The present invention provides one or more powered wireless transceivers and/or one or more passive wireless transceivers, a reader and interrogator with variable power, one or more antennas connected to a human or robotic hand and/or foot, a method for making same and the method of using these devices for process automation and verification involving one or more items in addition to locating, tracking and identifying these items in a supply chain. In one embodiment, a proximity sensing wireless system is provided which can be used to step the handler or operator through the step of a process and verify that each step in the process has been completed. | 04-21-2011 |
| 20110176464 | METHOD AND APPARATUS FOR LOW COST, LONG RANGE, POWER EFFICIENT, WIRELESS SYSTEM WITH ENHANCED FUNCTIONALITY - The present invention provides a method and system for establishing a highly mobile, long range secure wireless network with dynamic topologies and near full connectivity with acceptable latency using low cost, low power, compact and lightweight devices. One aspect of the system deals with a highly mobile network with dynamic network topologies and a time varying wireless medium that has neither absolute nor readily observable boundaries outside of which radio nodes are known to be unable to receive network frames, although the desirable open field boundary is 1 mile in radius from a base station node. A synchronous frequency hopping technique is used with mobile nodes that can become slave base station nodes to a master base station node to increase the effective range of the master base station without increasing the transmit power. Furthermore, the use of adjustable sleep times for the mobile nodes, as well as a novel clock calibration method, provides a substantial range increase with acceptable battery size and system latency. | 07-21-2011 |
| Patent application number | Description | Published |
|---|
| 20090180589 | CARDIAC TARGET TRACKING - Systems and methods for tracking cardiac targets are disclosed. The cardiac targets may be tracked dynamically. The process may include registering a cardiac target at different phases of a cardiac cycle. Movement of the cardiac target can be determined by correlating respiratory motion and cardiac pumping motion. Radiation treatment can then be delivered to the cardiac target taking into account the movement of the cardiac target. | 07-16-2009 |
| 20100237257 | PATIENT POSITIONING ASSEMBLY - A method of robotic patient positioning for radiation treatment using a radiation source with an arm assembly rotatably connected to a support device is described. The method includes moving the support device with respect to the radiation source in at least five degrees of freedom to align a treatment target with respect to the radiation source. Moving the support device includes rotating the support device about first, second and third rotational axes and rotating the arm assembly about fourth and fifth rotational axes. Rotations about the fourth and fifth rotational axes translate the support device for fourth and fifth degrees of freedom of the at least five degrees of freedom. | 09-23-2010 |
| 20100275927 | PATIENT POSITIONING ASSEMBLY - A patient positioning assembly is described. The patient positioning assembly including a plate member rotatably mounted on a base member, and an arm extending between a first end and a second end, wherein the first end is rotatably attached to the plate member. The patient positioning assembly further including a support device rotatably attached to the second end of the arm to support a patient thereon, with the support device is configured to move the patient in at least five degrees of freedom. | 11-04-2010 |
| 20110092793 | DYNAMIC TRACKING OF MOVING TARGETS - Treatment targets such as tumors or lesions, located within an anatomical region that undergoes motion (which may be periodic with cycle P), are dynamically tracked. A 4D mathematical model is established for the non-rigid motion and deformation of the anatomical region, from a set of CT or other 3D images. The 4D mathematical model relates the 3D locations of part(s) of the anatomical region with the targets being tracked, as a function of the position in time within P. Using fiducial-less non-rigid image registration between pre-operative DRRs and intra-operative x-ray images, the absolute position of the target and/or other part(s) of the anatomical region is determined. The cycle P is determined using motion sensors such as surface markers. The radiation beams are delivered using: 1) the results of non-rigid image registration; 2) the 4D model; and 3) the position in time within P. | 04-21-2011 |
| Patent application number | Description | Published |
|---|
| 20080198671 | Enqueue Event First-In, First-Out Buffer (FIFO) - In one embodiment, an apparatus comprises a queue, write control logic coupled to the queue and operable in a write clock domain, and a first-in, first-out buffer (FIFO) coupled to the write control logic. The queue is configured to store a plurality of data items, wherein each data item has a type which is one of a plurality of types of data items that can be stored in the queue. The write control logic is configured to maintain write pointers that identify entries in the queue for each of the plurality of types. The write control logic is configured to update the write pointer corresponding to an input type for an input data item written to the queue. Additionally, the write control logic is configured to enqueue a write event in the FIFO to transport the enqueue event to a read clock domain different from the write clock domain. | 08-21-2008 |
| 20080298383 | Buffer Minimization in Interface Controller - In one embodiment, an apparatus comprises serializer/deserializer (SERDES) circuits. Each SERDES circuit is configured to transmit data on a respective lane to which the SERDES circuit is are coupled during use. The apparatus further comprises a transmit pipe coupled to the SERDES circuits. The transmit pipe comprises stages, and each stage is configured to process a maximum bandwidth unit (a maximum width of a port that is configurable on the lanes and smaller than a largest packet transmitted on the ports). In another embodiment, the apparatus comprises a transmit command queue; a transmit scheduler coupled to the transmit command queue; and a storage device coupled to the transmit scheduler that stores a scheduling calendar. The transmit scheduler is configured to schedule maximum bandwidth units for transmission on ports configured over the lanes on which packets are transmitted. The maximum bandwidth unit is smaller than a packet and is a maximum width of a port that is configurable on the lanes. The transmit scheduler is configured to schedule the maximum bandwidth units according to the scheduling calendar. | 12-04-2008 |
| 20080300992 | Interface Controller that has Flexible Configurability and Low Cost - In one embodiment, an apparatus comprises serializer/deserializer (SERDES) circuits. Each SERDES circuit provides data received from a respective lane to which the SERDES circuit is coupled. A receive pipe is coupled to the SERDES circuits and comprises accumulate buffers, multiplexing levels, accumulate buffer counters, control registers, and control logic. Each accumulate buffer corresponds to a respective port configurable over the plurality of lanes. A first level of the multiplexing levels is coupled to receive data from neighboring lanes on one input and the data from the neighboring lanes connected in reverse order on the other input. Each multiplexor at each other level is coupled to receive outputs of neighboring multiplexors from a next lower level on one input and the outputs connected in reverse order on the other input. Each configuration register corresponds to a respective port, indicating an initial lane assigned to the respective port and a size of the port. The control logic is configured to generate select signals responsive to respective bits of the buffer counters and respective bits of initial lane numbers. | 12-04-2008 |
| 20090119531 | Digital Phase Relationship Lock Loop - In one embodiment, an apparatus comprises a first clocked storage device operable in a first clock domain corresponding to a first clock signal. The first clocked storage device has an input coupled to receive one or more bits transmitted on the input from a second clock domain corresponding to a second clock signal. The apparatus further comprises control circuitry configured to ensure that a change in a value of the one or more bits transmitted on the input meets setup and hold time requirements of the first clocked storage device. The control circuitry is responsive to a sample history of one of the first clock signal or the second clock signal to detect a phase relationship between the first clock signal and the second clock signal on each clock cycle to ensure the change meets the setup and hold time requirements. | 05-07-2009 |
| 20090271545 | Enqueue event first-In, first-out buffer (FIFO) - In one embodiment, an apparatus comprises a queue, write control logic coupled to the queue and operable in a write clock domain, and a first-in, first-out buffer (FIFO) coupled to the write control logic. The queue is configured to store a plurality of data items, wherein each data item has a type which is one of a plurality of types of data items that can be stored in the queue. The write control logic is configured to maintain write pointers that identify entries in the queue for each of the plurality of types. The write control logic is configured to update the write pointer corresponding to an input type for an input data item written to the queue. Additionally, the write control logic is configured to enqueue a write event in the FIFO to transport the enqueue event to a read clock domain different from the write clock domain. | 10-29-2009 |
| 20110035518 | Digital Phase Relationship Lock Loop - In one embodiment, an apparatus comprises a first clocked storage device operable in a first clock domain corresponding to a first clock signal. The first clocked storage device has an input coupled to receive one or more bits transmitted on the input from a second clock domain corresponding to a second clock signal. The apparatus further comprises control circuitry configured to ensure that a change in a value of the one or more bits transmitted on the input meets setup and hold time requirements of the first clocked storage device. The control circuitry is responsive to a sample history of one of the first clock signal or the second clock signal to detect a phase relationship between the first clock signal and the second clock signal on each clock cycle to ensure the change meets the setup and hold time requirements. | 02-10-2011 |
| Patent application number | Description | Published |
|---|
| 20080209067 | System And Method For Highly-Scalable Real-Time And Time-Based Data Delivery Using Server Clusters - The present invention provides loosely-coupled cluster systems comprising a plurality of servers based on storage attached to the plurality of servers. Videos, or other assets, are automatically replicated within the server system to increase the number of concurrent play requests serviceable. The server systems can detect spikes in demand that may exceed the guaranteed number of concurrent play requests serviceable and dynamically transfer the high-in-demand or ‘hot’ asset to servers in the cluster that do not have the video. Alternatively, instead of transferring the entire asset, varying length prefixes of the asset may be transferred depending on the availability of resources. The remainder of the asset is transferred in some embodiments on demand with sufficient buffering or other storage to guarantee playback to the user or subscriber according to the required quality of service (QOS). | 08-28-2008 |
| 20080270610 | SYSTEM AND METEHOD FOR HIGHLY SCALABLE REAL-TIME AND TIME-BASED DATA DELIVERY USING SERVER CLUSTERS - The present invention provides loosely-coupled cluster systems comprising a plurality of servers based on storage attached to the plurality of servers. Videos, or other assets, are automatically replicated within the server system to increase the number of concurrent play requests serviceable. The server systems can detect spikes in demand that may exceed the guaranteed number of concurrent play requests serviceable and dynamically transfer the high-in-demand or ‘hot’ asset to servers in the cluster that do not have the video. Alternatively, instead of transferring the entire asset, varying length prefixes of the asset may be transferred depending on the availability of resources. The remainder of the asset is transferred in some embodiments on demand with sufficient buffering or other storage to guarantee playback to the user or subscriber according to the required quality of service (QOS). | 10-30-2008 |
| 20100030470 | GLOBAL POSITIONING SYSTEM AND DEAD RECKONING (GPS&DR) INTEGRATED NAVIGATION SYSTEM - A global positioning system and dead reckoning (GPS&DR) integrated navigation system includes a GPS receiver coupled to a moving object for periodically generating GPS navigation information of said moving object, a DR system coupled to said moving object for periodically calculating DR navigation information of said moving object, and a filter coupled to said GPS receiver and said DR system for periodically calculating navigation information of said moving object, wherein said filter gets observation information by integrating said GPS navigation information and said DR navigation information according to a weight value of said GPS navigation information and a weight value of said DR navigation information, and calculates a current navigation information by integrating said observation information with previous navigation information from a plurality of previous cycles. | 02-04-2010 |
| 20110006946 | NAVIGATION SYSTEM WITH A SIGNAL PROCESSOR - A signal processor for processing multiple satellite signals is disclosed. The signal processor includes multiple acquisition channels operable for capturing tracking information from a first plurality of satellite signals synchronously according to multiple correlations between multiple reference coarse acquisition (C/A) codes and the first plurality of satellite signals. The signal processor further includes multiple code generators coupled to the acquisition channels and operable for generating the reference C/A codes to the acquisition channels | 01-13-2011 |
| 20110137558 | ELECTRONIC SYSTEMS FOR LOCATING OBJECTS - A database for a set of orientation-matched road (OMR) sections is searched according to a calculated orientation of an object and orientations of road sections stored in the database. The OMR sections are searched for a position-matched road (PMR) set according to a calculated position of the object and positions of the OMR sections. The PMR set includes one or more PMR sections. The object is located using the PMR set. | 06-09-2011 |
| Patent application number | Description | Published |
|---|
| 20100165842 | Credit Management When Resource Granularity is Larger than Credit Granularity - In one embodiment, a receiver on a credit-based flow-controlled interface is configured to free one or more data credits early when a data payload is received that incurs fewer unused data credits within a buffer memory that is allocated at a coarser granularity than the data credits. In another embodiment, header credits and data credits are dynamically adjusted based on actual packet data payload sizes. | 07-01-2010 |
| 20110010502 | Cache Implementing Multiple Replacement Policies - In an embodiment, a cache stores tags for cache blocks stored in the cache. Each tag may include an indication identifying which of two or more replacement policies supported by the cache is in use for the corresponding cache block, and a replacement record indicating the status of the corresponding cache block in the replacement policy. Requests may include a replacement attribute that identifies the desired replacement policy for the cache block accessed by the request. If the request is a miss in the cache, a cache block storage location may be allocated to store the corresponding cache block. The tag associated with the cache block storage location may be updated to include the indication of the desired replacement policy, and the cache may manage the block in accordance with the policy. For example, in an embodiment, the cache may support both an LRR and an LRU policy. | 01-13-2011 |
| 20110010504 | Combined Transparent/Non-Transparent Cache - In one embodiment, a memory that is delineated into transparent and non-transparent portions. The transparent portion may be controlled by a control unit coupled to the memory, along with a corresponding tag memory. The non-transparent portion may be software controlled by directly accessing the non-transparent portion via an input address. In an embodiment, the memory may include a decoder configured to decode the address and select a location in either the transparent or non-transparent portion. Each request may include a non-transparent attribute identifying the request as either transparent or non-transparent. In an embodiment, the size of the transparent portion may be programmable. Based on the non-transparent attribute indicating transparent, the decoder may selectively mask bits of the address based on the size to ensure that the decoder only selects a location in the transparent portion. | 01-13-2011 |
| 20110010520 | Block-Based Non-Transparent Cache - In an embodiment, a non-transparent memory unit is provided which includes a non-transparent memory and a control circuit. The control circuit may manage the non-transparent memory as a set of non-transparent memory blocks. Software executing on one or more processors may request a non-transparent memory block in which to process data. The control circuit may allocate a first block, and may return an address (or other indication) of the allocated block so that the software can access the block. The control circuit may also provide automatic data movement between the non-transparent memory and a main memory system to which the non-transparent memory unit is coupled. For example, the automatic data movement may include filling data from the main memory system to the allocated block, or flushing the data in the allocated block to the main memory system after the processing of the allocated block is complete. | 01-13-2011 |
| 20110010521 | TLB Prefetching - In an embodiment, a memory management unit (MMU) is configured to retain a block of data that includes multiple page table entries. The MMU is configured to check the block in response to TLB misses, and to supply a translation from the block if the translation is found in the block without generating a memory read for the translation. In some embodiments, the MMU may also maintain a history of the TLB misses that have used translations from the block, and may generate a prefetch of a second block based on the history. For example, the history may be a list of the most recently used Q page table entries, and the history may show a pattern of access that are nearing an end of the block. In another embodiment, the history may comprise a count of the number of page table entries in the block that have been used. | 01-13-2011 |
| Patent application number | Description | Published |
|---|
| 20090013413 | Systems and methods for providing privacy settings for applications associated with a user profile - Systems and methods for providing privacy settings for applications associated with a user profile are provided. Exemplary methods include receiving a request from a member of a web-based social network to install an application in association with a member profile, installing the requested application, providing privacy settings selections to control access to data associated with the installed application, receiving a privacy settings selection from the member, and displaying data associated with the application based on the privacy settings selection. | 01-08-2009 |
| 20090031301 | Personalized platform for accessing internet applications - The present invention provides a system and method for providing a personalized platform for accessing internet applications. According to one embodiment of the invention, a social network provider receives a request for installation of an application from a user of the social network, installs the application at multiple points in the user's social network environment, and personalizes interfaces with the application at these integration points based on information about the user available from the social network. The present invention enables applications to be integrated in the social network environment at multiple integration points and to be personalized for and configured by the user. | 01-29-2009 |
| 20090049525 | Platform for providing a social context to software applications - The present invention provides a system and method for providing a social context to software applications. According to one embodiment of the invention, a user of a social network authorizes access by an external software application to information available in the social network. At some time later, the user of the social network uses an application designed by a third-party software developer. The application contacts the social network provider for permission to access the information available in the social network. If access has been authorized, the application incorporates the information from the social network into its interaction with the user, providing a social context to the user's interaction with the application. | 02-19-2009 |
| 20090070412 | Providing Personalized Platform Application Content - A social networking website maintains a profile for each user of the website. The profile includes data associated with a user, such as a connection to one or more plurality of other users of the social networking website or user preferences. The social networking website communicates with one or more third-party application servers to provide one or more applications to social networking website users. When a social networking website user requests an application provided by a third-party application server, the social networking website communicates a subset of the user's profile to the third-party application server, allowing the third-party application server to use this profile data to personalize the application performed for the user. A privacy settings associated with a user profile allows the social networking website to limit the profile data communicated to the third-party application server. | 03-12-2009 |
| 20090144392 | Sharing Digital Content On A Social Network - Embodiments of the invention provide techniques for more effectively and easily sharing on a social networking system digital content obtained from an external system. In one embodiment a user selects a control for sharing content from the external system that causes a sharing request to be sent. The sharing request is received by the social networking website, and an interface is presented to the user requesting sharing parameters. The user provides sharing parameters through the interface that are received by the social networking website. Content is retrieved from the external system and is transmitted to one or more destinations in the social networking website based at least in part on the sharing parameters. The sharing parameters may include selection parameters for indicating which content to share, formatting parameters for specifying how to format the content, and destination parameters indicating particular destinations in the social networking website for the content. | 06-04-2009 |
