Patent application number | Description | Published |
20080247313 | Slot-Cache for Caching Aggregates of Data with Different Expiry Times - Techniques for collecting and displaying sensor data captured by a spatially and temporally representative sample of sensors requested in a search query are described. The sensors are represented in an index structure (e.g., a data tree) having a plurality of leaf nodes and internal nodes. The leaf nodes are associated with sensors and the internal nodes are allotted with caches having cache slots for storing sensor data with various expiry times. In response to a query, the index structure is leveraged to identify a set of nodes associated with sensors of a user selected spatial region. Sensor data having an expiry time greater than a user specified expiry time is then collected from one or more cache slots of the set of nodes. In this manner, the number of sensors to be probed to collect the sensor data is reduced. | 10-09-2008 |
20080259875 | Sleep Scheduling for Geographically Distributed Network Nodes - Techniques for implementing sleep scheduling in a distributed network environment are described. The sleep scheduling attempts to optimize routing of communication among nodes of the distributed network, while still conserving energy by allowing nodes to occasionally transition to sleep mode. The sleep scheduling is performed as a function of the number of awake neighboring nodes. | 10-23-2008 |
20080263061 | Self-Tuning Index for Flash-Based Databases - Techniques for self-tuning indices for databases, including flash-based databases, are described. Using a data tree structure wherein the nodes of the data tree may operate in two modes (e.g. disk mode or log mode), a self-tuning index determines whether it is more economical to perform a requested operation on a node in its current mode or in an alternate mode. The operation is then performed on the node using the more economical mode. | 10-23-2008 |
20080263114 | EFFICIENT ACCESS OF FLASH DATABASES - Techniques for efficient access to flash databases are described. In one implementation, a method includes performing an operation on a flash database, supplementing at least one portion of a node translation table corresponding to at least one node involved in the operation, and semantically compressing at least one portion of the node translation table. The semantic compression includes discarding at least one log entry that is rendered obsolete by at least one subsequent log entry, and incrementing a version number of the log entries corresponding to the at least one portion of the node translation table. In further embodiments, discarding at least one log entry includes discarding at least one log entry that is at least one of opposed by or overruled by at least one subsequent log entry. | 10-23-2008 |
20100290617 | SECURE OUTSOURCED AGGREGATION WITH ONE-WAY CHAINS - Secure outsourced aggregation of data using one-way chains is discussed in this application. Each input data source such as a sensor generates a Verifiable Synopsis (“VS”) which includes sensor data, an Inflation Free Proof (“IFP”) generated using a cryptographic function and a Self-Authenticating Value (“SEAL”) chain generated using a one-way function. An aggregator takes a plurality VSs from multiple data sources and aggregates them together into one. Maximum value, top-k, count, count distinct, sum, average, and other aggregate functions may be used. Folded VS provides a concise proof that no value greater than the maximum value was reported by a sensor, thus providing a check against deflation of sensor data. Similarly, the cryptographic function of the IFP provides a mechanism to prevent inflation of the sensor data. Thus it becomes possible at a portal to verify that aggregated data has not been inflated or deflated by the aggregator. | 11-18-2010 |
20120316956 | Client-Server Joint Personalization for Private Mobile Advertising - The subject disclosure is directed towards personalizing content (e.g., advertisement) delivery to a mobile device such as a smartphone, without violating user privacy. A user decides how much context information (from the device's sensor readings and/or other data) to share with an advertisement server. Based on this limited, partial context information, the server selects a subset of advertisements from those available and sends them to the client. The client then picks the most relevant one based on richer, more granular context data, e.g., more (or even all) of the device's sensor readings and possibly other non-revealed information such as user preference data. The optimization of selecting the most relevant advertisement to display is done jointly by the user and the server, with the server selecting a subset of advertisements based upon partial context, and the client selecting from the subset based upon full context. | 12-13-2012 |
20120323926 | Efficient Optimization over Uncertain Data - The subject disclosure is directed towards using fingerprints, comprising lists of simulation results corresponding to partial (random sampled) simulation results, to determine whether a full simulation may be avoided by reusing simulation results from a previous full simulation. Before running a full simulation, a current fingerprint is obtained via a partial simulation. If a previous fingerprint matches (is identical or similar to) the current fingerprint, the associated previous results are reused. Also described is indexing fingerprint data to facilitate efficient lookup-based fingerprint matching. | 12-20-2012 |
20130166712 | CLOUD-EDGE TOPOLOGIES - The description relates to cloud-edge topologies. Some aspects relate to cloud-edge applications and resource usage in various cloud-edge topologies. Another aspect of the present cloud-edge topologies can relate to the specification of cloud-edge applications using a temporal language. A further aspect can involve an architecture that runs data stream management systems (DSMSs) engines on the cloud and cloud-edge computers to run query parts. | 06-27-2013 |
20140372160 | CONTEXT-AWARE MOBILE CROWDSOURCING - The subject disclosure is directed towards a context-aware mobile crowd sourcing service/system. Context information is automatically collected for a mobile device via mobile-device sensors. When a task is received that specifies context-related criteria, a worker is selected for that task based at least in part upon the context information associated with that worker's mobile device. Sensors on the device may be leveraged to capture information related to performing the task. Also described is a cross-platform task configuration that allows a task to be written once and run on different mobile device platforms. | 12-18-2014 |
20140372216 | CONTEXTUAL MOBILE APPLICATION ADVERTISEMENTS - Aspects of the subject disclosure are directed towards retrieving advertisements relevant to application content based upon keywords extracted from the application content. In one aspect, a client-side component scrapes application page content to obtain keywords and feature-based weights for those keywords. The keywords are sent to an advertisement server, which returns an advertisement based upon one or more of the keywords. Also described is the hashing of keywords before sending to the advertisement server to protect client privacy, and the use of a Bloom filter to avoid sending keywords to the advertisement server that do not correspond to (e.g., popular) advertisement keywords. | 12-18-2014 |