Patent application number | Description | Published |
20120021815 | Motivational Deployment Mechanism For Networked Systems - The described implementations relate to networked or distributed systems and more particularly to providing motivation for deployment of networked systems. One technique gathers a solicitation hierarchy in a distributed system. This technique also tracks contribution to the distributed system of participants within the hierarchy. This technique further probabilistically determines a participant as a lottery winner based at least in part on the solicitation hierarchy and the contribution. | 01-26-2012 |
20130023216 | CLOUD SERVICE FOR OPTIMIZING WHITE-SPACE NETWORKS COEXISTENCE - The coexistence of a plurality of different wireless networks that concurrently operate in a common geographic region is optimized. A query is received from a wireless node requesting advice on specific portions of a radio frequency spectrum to use. A spectrum recommendation procedure is then run to generate advice on recommended portions of the radio frequency spectrum for the wireless node to use in order to minimize one or more of interference in the spectrum, or noise in the spectrum, or contention in the spectrum. A recommendation reply is then sent to the wireless node which includes information specifying the recommended portions of the radio frequency spectrum for the wireless node to use in order to minimize one or more of interference in the spectrum, or noise in the spectrum, or contention in the spectrum. | 01-24-2013 |
20130053054 | USING PREDICTIVE TECHNOLOGY TO INTELLIGENTLY CHOOSE COMMUNICATION - Selecting communication settings. A method includes observing at least one of present, prior, or anticipated future movement of a user. Based on the observed user movement, embodiments may predict one or more future locations of the user. Based on the one or more future locations of the user, a communication setting of a device is selected to be used by the user. | 02-28-2013 |
20130085821 | Strategy-Resistant Referral Reward Distribution - In a participatory system, a reward is distributed to participants based on their contributions to the system and the contributions of direct and indirect referrals of the participant (descendant referrals). A convex function is applied to the effective contribution of each participant to determine the weighted contribution of the participant, and the participant's reward is based on the participant's weighted contribution less the weighted contributions of child participants referred by the participant. | 04-04-2013 |
20130102324 | DEVICE-TO-DEVICE RELATIVE LOCALIZATION - Techniques for generating a real-time 3D position of one device relative another device are described herein. In one embodiment, a first device may be equipped with one or more transmitters and receivers to collect location information based on direct localized signal transmission between the first device and a second device. The first device may also be equipped with an accelerometer and/or digital compasses to assist in resolving ambiguous locations when the first device and the second device are not at an alignment position. Each device may transmit part or all of its collected location information to another device to assist in obtaining the relative location. Alternatively, a separate server may receive the location information from the devices and calculate the relative location of each device based on the received location information. | 04-25-2013 |
20130301622 | Dynamic Time-Spectrum Block Allocation For Cognitive Radio Networks - Dynamic time-spectrum block allocation for cognitive radio networks is described. In one implementation, without need for a central controller, peer wireless nodes collaboratively sense local utilization of a communication spectrum and collaboratively share white spaces for communication links between the nodes. Sharing local views of the spectrum utilization with each other allows the nodes to dynamically allocate non-overlapping time-frequency blocks to the communication links between the nodes for efficiently utilizing the white spaces. The blocks are sized to optimally pack the available white spaces. The nodes regularly readjust the bandwidth and other parameters of all reserved blocks in response to demand, so that packing of the blocks in available white spaces maintains a fair distribution of the overall bandwidth of the white spaces among active communication links, minimizes finishing time of all communications, reduces contention overhead among the nodes contending for the white spaces, and maintains non-overlapping blocks. | 11-14-2013 |
20140025912 | Efficiency of Hardware Memory Access using Dynamically Replicated Memory - Dynamically replicated memory is usable to allocate new memory space from failed memory pages by pairing compatible failed memory pages to reuse otherwise unusable failed memory pages. Dynamically replicating memory involves detecting and recording memory faults, reclaiming failed memory pages for later use, recovering from detected memory faults, and scheduling access to replicated memory pages. | 01-23-2014 |
20140064034 | DISTANCE MEASUREMENTS BETWEEN COMPUTING DEVICES - Some implementations provide techniques and arrangements for distance measurements between computing devices. Some examples determine a distance between devices based at least in part on a propagation time of audio tones between the devices. Further, some examples determine the arrival time of the audio tones by performing autocorrelation on streaming data corresponding to recorded sound to determine a timing of an autocorrelation peak indicative of a detection of an audio tone in the streaming data. In some cases, cross correlation may be performed on the streaming data in a search window to determine a timing of a cross correlation peak indicative of the detection of the audio tone in the streaming data. The location of the search window in time may be determined based at least in part on the timing of the detected autocorrelation peak. | 03-06-2014 |
20140156847 | Service Allocation in a Distributed Computing Platform - The techniques and arrangements described herein provide for updating services, host operating systems and other applications while satisfying update domain constraints. In some examples, one or more controller modules may maintain a data structure including a plurality of server update domains, each server update domain including a set of machines of a plurality of machines of a distributed computing system which may be concurrently updated. The one or more controller modules may allocate the plurality of instances to the plurality of machines such that a number of server update domains is minimized. | 06-05-2014 |
20140170978 | MOBILE COMPUTING DEVICE APPLICATION SHARING - Technologies pertaining to sharing an application installed on a mobile computing device with another computing device are described herein. An indication is received that the application is desirably shared with the another computing device. Responsive to receiving such indication, a communications channel is automatically established between the mobile computing device and the another computing device, and display data generated at the mobile computing device is transmitted to the another computing device by way of the communications channel. The display data is displayed on the another computing device. | 06-19-2014 |
20140256356 | CROWD SOURCED PATHWAY MAPS - Some implementations include identifying a location for a device perceived landmark. The location is identified by monitoring received signal strength of a signal of a wireless access point, detecting the location at which the trend in the received signal strength changes direction, and qualifying the location based on measurements taken form one or more inertial measurement unit sensors. | 09-11-2014 |