Patent application number | Description | Published |
20130060905 | Accessing Hardware Devices Using Web Server Abstractions - In the new architecture, a client that desires access to a piece of hardware sends HTTP requests to a device server. The server receives a HTTP requests, accesses a device on behalf of the client, and send the device's response back to the client in the form of an HTTP response. This architecture has three primary advantages. First, it offers a clean interface for clients where all devices are accessed as if they are web servers. Second, it helps make devices more secure whereby clients can be prevented from accessing hardware directly, and all device access is forced through the narrow HTTP access protocol and checked for compliance with a desired security policy. Third, since HTTP allows local and remote servers to be contacted, the proposed architecture makes it easy for clients to communicate with devices that are not physically co-resident with the client but which are accessible via a network connection. | 03-07-2013 |
20130173513 | CONTEXT-BASED DEVICE ACTION PREDICTION - The described implementations relate to automatically performing device actions. One implementation can obtain a contextual value of a contextor. The implementation can decide, using a decision engine, whether to perform an action on a computing device based on the contextual value. In an instance when the decision engine decides that the action is to be performed, the implementation can perform the action on the computing device. The implementation can also update the decision engine using feedback related to the action. As a specific example, the action can be prelaunching an application before a user has requested to execute the application. Prelaunching the application can reduce application latency relative to waiting for the user to request to execute the application before launching the application. | 07-04-2013 |
20140070991 | ESTIMATING AND PREDICTING STRUCTURES PROXIMATE TO A MOBILE DEVICE - The description relates to mobile device location. One example can identify global navigation satellite system (GNSS) satellites expected to be in line-of-sight of a mobile device. This example can detect differences between received GNSS data signals and expected GNSS data signals from the expected GNSS satellites. The example can also determine a direction from the mobile device of an obstruction that is causing at least some of the detected differences. | 03-13-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 |
Patent application number | Description | Published |
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 |
20130159223 | Virtual Sensor Development - Embodiments include processes, systems, and devices for developing a virtual sensor. The virtual sensor includes one or more inference models. A decision engine utilizes an inference model associated with a mobile device to determine another inference model that is configured to accept physical sensor data from another mobile device. In this way, the virtual sensor can be developed for use with many mobile devices using initial inference models developed for a small number of mobile devices or a single mobile device. Embodiments also include methods to select mobile devices from which to request physical sensor data for virtual sensor input. Embodiments also include architectures that provide a library of virtual sensors. | 06-20-2013 |
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 |
Patent application number | Description | Published |
20090012953 | Method and system for continuous, dynamic, adaptive searching based on a continuously evolving personal region of interest - Embodiments of the present invention are directed to flexible, user-adapted, continuous searching, on behalf of a particular user, for points of interest relevant to the user's current location within a specifically computed personal region of interest. In a general case, the personal region of interest is computed as a function of the user's level of disposition towards the searched-for points of interest. The level of disposition towards the searched-for points of interest may, in turn, be based on two or more of the user's location, the current date and time, a history of the user's interaction with the POI-searching system, including user-initiated searches and user selections from displayed search results, a user profile developed for, and continuously updated on behalf of, the user, and a current context for the search, as specified by a search query or by other context-specifying means. The personal region of interest generally defines an abstract area, volume, or hypervolume within which method and system embodiments of the present invention search for points of interest. | 01-08-2009 |
20090012955 | Method and system for continuous, dynamic, adaptive recommendation based on a continuously evolving personal region of interest - Embodiments of the present invention are directed to flexible, user-adapted, continuous searching, on behalf of a particular user, for points of interest relevant to the user's current location within a specifically computed personal region of interest. In a general case, the personal region of interest is computed as a function of the user's level of disposition towards the searched-for points of interest. The level of disposition towards the searched-for points of interest may, in turn, be based on two or more of the user's location, the current date and time, a history of the user's interaction with the POI-searching system, including user-initiated searches and user selections from displayed search results, a user profile developed for, and continuously updated on behalf of, the user, and a current context for the search, as specified by a search query or by other context-specifying means. The personal region of interest generally defines an abstract area, volume, or hypervolume within which method and system embodiments of the present invention search for points of interest. | 01-08-2009 |
20100057690 | Automated information-provision system - Various system embodiments of the present invention are directed to an automated concierge system through which users of the automated concierge system can request and obtain many types of information and services. Unlike traditional search engines and electronic query-processing interfaces, the automated concierge systems provide much greater flexibility with respect to means of access, including types of electronic devices and communications media that can be used to access the concierge services, greater flexibility in the timing of responses to information and service requests, more efficient information and service provision, and access to a much broader range of information sources and service providers. The automated concierge systems that represent embodiments of the present invention provide state-associated searches, in contrast to the stateless searches generally provided by search engines and many electronic query-processing interfaces, and employ a generally asynchronous message-based interface, rather than the rigid request/response interfaces provided by traditional search engines and other electronic query-processing systems. | 03-04-2010 |
20100185605 | METHOD AND SYSTEM FOR CONTINUOUS, DYNAMIC, ADAPTIVE SEARCHING BASED ON A CONTINUOUSLY EVOLVING PERSONAL REGION OF INTEREST - Embodiments of the present invention are directed to flexible, user-adapted, continuous searching, on behalf of a particular user, for points of interest relevant to the user's current location within a specifically computed personal region of interest. In a general case, the personal region of interest is computed as a function of the user's level of disposition towards the searched-for points of interest. The level of disposition towards the searched-for points of interest may, in turn, be based on two or more of the user's location, the current date and time, a history of the user's interaction with the POI-searching system, including user-initiated searches and user selections from displayed search results, a user profile developed for, and continuously updated on behalf of, the user, and a current context for the search, as specified by a search query or by other context-specifying means. The personal region of interest generally defines an abstract area, volume, or hypervolume within which method and system embodiments, of the present invention search for points of interest. | 07-22-2010 |
20140297415 | METHOD AND SYSTEM FOR CONTINUOUS, DYNAMIC, ADAPTIVE RECOMMENDATION BASED ON A CONTINUOUSLY EVOLVING PERSONAL REGION OF INTEREST - Embodiments of the present invention are directed to flexible, user-adapted, continuous searching, on behalf of a particular user, for points of interest relevant to the user's current location within a specifically computed personal region of interest. In a general case, the personal region of interest is computed as a function of the user's level of disposition towards the searched-for points of interest. The level of disposition towards the searched-for points of interest may, in turn, be based on two or more of the user's location, the current date and time, a history of the user's interaction with the POI-searching system, including user-initiated searches and user selections from displayed search results, a user profile developed for, and continuously updated on behalf of, the user, and a current context for the search, as specified by a search query or by other context-specifying means. The personal region of interest generally defines an abstract area, volume, or hypervolume within which method and system embodiments of the present invention search for points of interest. | 10-02-2014 |
Patent application number | Description | Published |
20090154674 | SELECTIVE PRE-AUTHORIZED CREDIT FOR INCOMING CALLS - Establishing a connection from a caller to a user using a pre-authorized credit from the user is described. A processor identifies one or more source identifications (IDs) for receiving pre-authorized credit for the incoming call. One or more destinations are specified to receive the incoming call. The processor defines a rule associated with the one or more destinations and the one or more source IDs. An interface receives the incoming call directed to one of the destinations from the caller. A storage area stores the defined rule. The incoming call and the caller are determined as a function of the one of the destinations, one or more identified source IDs and the defined rule. The pre-authorized credit is issued for the incoming call from the caller if it is determined that the incoming call to the destination satisfies the defined rule. The processor routes the incoming call to the user. | 06-18-2009 |
20090157824 | AGGREGATE COMMUNICATIONS WITH INTELLIGENT SOURCING - Selecting a source account for an outgoing communication content of a user is described. A collection of source accounts is associated with the user. Each source account has an individual content storage storing communication content associated with the corresponding source account. A user's authentication is validated for using the collection of source accounts. One source account in the collection is designated as a primary source account. The source accounts in the collection are aggregated to a primary content storage. The user is authenticated to sign in to the primary source account. Instructions are received from the user for generating a communication content from the primary source account and the primary content storage. Instructions are received from the user for selecting one of the source accounts in the collection as the source account for the generated communication content, and the user is signed in to the primary source account. | 06-18-2009 |
20110227791 | SELECTING BEACONS FOR LOCATION INFERENCE - Location inference using selected beacons. Data is received representing a set of beacons observed by a computing device. The beacons are located within a first geographic area. A subset (e.g., a clique) of the beacons is selected based on a coverage area of each of the beacons, where each of the beacons in the selected subset has a coverage area that overlaps with the coverage area of each of the other beacons in the selected subset. Using known or estimated positions of the beacons, a second geographic area is defined based on the selected subset of beacons and the beacon reference data and the coverage areas associated therewith. The second geographic area, smaller than the first geographic area, represents an approximate location of the computing device. In some embodiments, the computing device is calculated to be within the second geographic area with 95% probability. | 09-22-2011 |
20120027011 | INTELLIGENT FORMATTING OF VOIP TELEPHONE NUMBERS - A system and method are disclosed for intelligent formatting of VoIP telephone numbers. The intelligent VoIP formatting system includes a presentation and user interface layer, an E.164 formatting engine, a location routine, and a database of telephone number data which are used to deconstruct input telephone numbers and reconstruct them as E.164 compliant telephone numbers. | 02-02-2012 |
20140328219 | SECURED COMMUNICATION VIA LOCATION AWARENESS - A method and system for collecting and verifying the location information of a calling party and a device of the calling party is provided. More specifically, a method and system is provided for determining whether the identity of the calling party can be confirmed, via evaluating location information, with an acceptable degree of certainty. The location information may be provided by the calling party or obtained from various sources over a digital communication channel. Some of the provided location information which can be accidentally or intentionally altered is identified and evaluated to determine its accuracy as part of the verification process of the caller's identity. | 11-06-2014 |
Patent application number | Description | Published |
20100325098 | ELIDING SYNCHRONIZATION IN A CONCURRENT DATA STRUCTURE - A concurrent data structure allows synchronization to be elided for read accesses. Processing resources that remove one or more elements of the concurrent data structure are allowed to delete the elements only after all other processing resources have reached a safe point. Each processing resource maintains an indicator that indicates whether the processing resource has reached as safe point (i.e., will not access the concurrent data structure). When the indicators indicate that all processing resources have reached a safe point, elements of the data structure may be deleted. | 12-23-2010 |
20120089967 | DYNAMIC DATA AND COMPUTE RESOURCE ELASTICITY - An execution environment in a computer system provides dynamic data and compute resources elasticity for user code to improve execution efficiency. The execution environment translates the user code into a runtime agnostic representation with a set of tasks. For each task, the execution environment determines a level of concurrency for executing the task based on the size of the set of input data for the task, the amount of compute resources available at the time of invocation of the task, and any context-sensitive heuristics provided by the user code. | 04-12-2012 |
20120089968 | RUNTIME AGNOSTIC REPRESENTATION OF USER CODE FOR EXECUTION WITH SELECTED EXECUTION RUNTIME - An execution environment in a computer system allows user code to be executed using multiple execution runtimes. The execution environment translates the user code into a runtime agnostic representation, selects an execution runtime for executing the runtime agnostic representation, and invokes a scheduler for the selected execution runtime. The scheduler dispatches tasks from the runtime agnostic representation for execution by the computer system using concurrency mechanisms in the selected execution runtime. | 04-12-2012 |
20120089969 | DECLARATIVE PROGRAMMING MODEL WITH A NATIVE PROGRAMMING LANGUAGE - An execution environment in a computer system supports a declarative programming model where user code is written with a query syntax in a native programming language to express inherent parallelism in terms of data flow. The execution environment translates queries in the user code into a runtime agnostic representation and dynamically selects an execution runtime for executing the runtime agnostic representation. | 04-12-2012 |
20120137277 | VERIFICATION OF A DATAFLOW REPRESENTATION OF A PROGRAM THROUGH STATIC TYPE-CHECKING - Functionality is described for providing a compiled program that can be executed in a parallel and a distributed manner by any selected runtime environment. The functionality includes a compiler module for producing the compiled program based on a dataflow representation of a program (i.e., a dataflow-expressed program). The dataflow-expressed program, in turn, includes a plurality of tasks that are connected together in a manner specified by a graph (such as a directed acyclic graph). The compiler module also involves performing static type-checking on the dataflow-expressed program to identify the presence of any mismatch errors in the dataflow-expressed program. By virtue of this approach, the above-described functionality can identify any errors in constructing the graph prior to its instantiation and execution in a runtime environment. | 05-31-2012 |
20120158840 | NON-GREEDY CONSUMPTION BY EXECUTION BLOCKS IN DATAFLOW NETWORKS - Processing messages in dataflow networks. The method includes, at a first entity, receiving from a second entity a first offer of a first message to process. The method further includes determining to not process the first message. As a result of determining to not process the first message, such an indication is made to the second entity. Further as a result of determining to not process the first message, an indication is stored that the second entity offered a message. The indication includes an indicator correlated to the second entity. Subsequent to indicating to the second entity, using the indication the method includes indicating to the second entity availability to process a message. | 06-21-2012 |
Patent application number | Description | Published |
20150072953 | COMPOSITIONS AND METHODS FOR JOINT HEALTH - The present disclosure provides mixtures of prenylated flavonoids, stilbenes, or both with flavans or curcuminoids or both capable of modulating joint inflammation, joint pain, joint stiffness, cartilage degradation, or improving mobility, range of motion, flexibility, joint physical function, or any combination thereof. Such a mixture of prenylated flavonoids, stilbenes, or both with flavans or curcuminoids or both can optionally be used in combination with other joint management agents, such as non-steroidal anti-inflammatory agents/analgesics, COX/LOX inhibiting agents, glucosamine compounds, neuropathic pain relief agents, or the like. | 03-12-2015 |
Patent application number | Description | Published |
20120246659 | TECHNIQUES TO OPTIMIZE UPGRADE TASKS - Techniques to prioritize and optimize the execution of upgrade operations are described. A technique may include determining the size of data blocks that are to be copied from one storage medium to another, and the dependencies of upgrade tasks on the data blocks and on other tasks. A task may be prioritized according to a weight that includes the cumulative sizes of the data blocks that it and its dependent tasks depend on. A data block copying may be prioritized according to the cumulative weights of the tasks that depend on that data block. Some embodiments may perform several data copying and/or tasks in parallel, rather than sequentially. Other embodiments are described and claimed. | 09-27-2012 |
20120310918 | UNIQUE JOIN DATA CACHING METHOD - Enterprise systems, methods and computer program products are disclosed for providing caching of data retrieved from joined tables and an inheritance table hierarchy of a database in an enterprise. The computer implemented method comprises creating a queue of cursors of a statement associated with a database; evaluating a cursor of the queue and marking as one of a unique record and an object of an inheritance table; and, if a cursor of the queue is marked as one of a unique record and a unique object, then, storing data associated with one of the unique record and object in a data cache for subsequent retrieval, thus avoiding costly network calls. If the process leaves a cursor unevaluated, the method retrieves data from an enterprise database associated with the statement. The process is implemented on an application object server including a data access layer and a kernel instance. | 12-06-2012 |
20120323937 | BULK CREATE, UPDATE AND DELETE (CUD) DATABASE OPERATIONS FOR TABLE INHERITANCE - Enterprise systems, methods and computer program products are disclosed for providing bulk create (insert), update and delete operations for table inheritance in an enterprise resource system using an object-oriented language supporting polymorphism. The computer implemented method comprises receiving a request for one of a create, update and delete operation with respect to data of first and second tables of an inheritance table hierarchy; creating a temporary table comprising a surrogate key and a record identifier; establishing a filter condition with fields from different tables in table inheritance; and one of creating, updating and deleting data from the different tables in table inheritance according to the filter condition. The process is implemented on an application object server including a compiler for the object-oriented language, a kernel instance and a data access layer. | 12-20-2012 |