Microsoft Technology Licensing, LLC

Sanjib Saha

Lee B Graber

Bimal Kumar Mehta

Paul Maybee

Fernando Gonzalez

Janet Lynn Schneider

Eldar Azerovich Musayev

Kevin Bowen Smith

Yossi Levanoni

Frank Gorgenyi

Jean-Emile Elien

Satish Ramchandra Thatte

Kartik Paramasivam

Affan Arshad Dar

Johannes Klein

Balasubramanian Sriram

Cristina Del Amo Casado

Ashish Vijay Gadre

Mark A Inderhees

Lanny D Natucci, Jr

Stuart J Harper

Shaun C Hedrick

Paul F Ringseth

Akash Jeevan Sagar

Stephen P DiAcetis

Balinder Malhi

Siunie A Sutjahjo

Parmjeet Singh

Wei-Lun Lo

Anandhi Somasekaran

David Mahlon Hoover

Xin Chen

Jonathan Matthew Kay

Mithun Sibi Thomas

Manohar Bangalore Puttaswamaiah

Sriram Balasubramanian

Sumitra Sujanani

Allen Zhang

David Michael Callaghan

Anatoliy Burukhin

Sergey Karamov

Wayne A Clark

Gang Zhao

Neil A Brench

Siddhartha Roy

Daniel Estrada Alva

Abhijit Chatterjee

Andrei V Nagornyi

Alexander Dadjomov

Jack Lee Miller

Stephen P Diacetis

Lanny D Natucci

Lanny D Natucci Jr

A method for personalizing resource strings within a user interface of a computing device. The method includes accessing a personalization editor via the computing device, and receiving a user modification to a resource string associated with one or more applications. The method also includes storing an original unmodified resource string associated with the resource string, the modified resource string, and the associated applications. The method also includes receiving a request from a first application for a first resource string associated with a specified resource identifier. The method also includes determining if the first resource string has an associated modified resource string stored in the personalized resource string database, and displaying the modified resource string based on the first resource string being determined to be associated with the modified resource string stored in the personalized resource string database.

Personalization of resource strings in a computing device

In a device for de-duplicating localized resources including a processor and a memory in communication with the processor, the memory includes executable instructions that, when executed by the processor, cause the processor to control the device to perform functions of accessing, from a data storage, a source resource package and a localized resource package containing first and second resources, respectively; filtering the localized resource package to identify the second resources that are not duplicates of the first resources; creating, based on the first resources, a language-neutral resource collection including a plurality of language-neutral resources; creating a localized resource collection including the second resources that are not duplicates of the first resources; and creating a deployment resource package containing the language-neutral and localized resource collections.

De-duplication of localized resources

Techniques described herein provide multi-factor authentication based on positioning data. Generally described, configurations disclosed herein enable a system to authorize a particular action using positioning data, and possibly other data, associated with an identity. For example, when a user wishes to change a password or access a secured account, the system can authenticate a user if a device associated with the user is located in the secure area. The system can authenticate a user if a requested operation and/or a predetermined pattern of movement associated with the user is detected. For instance, the system allows the user to change the password when the user's computer has followed a predetermined pattern of movement, and when one or more verification procedures meets one or more criteria while the location of the computing device is within the predetermined area.

Multi-factor authentication using positioning data

A system and method of using metrics to control throttling and swapping in a message processing system is provided. A workload status of a message processing system is determined, and the system polls for a new message according to the workload status. The message processing system identifies a blocked instance and calculates an expected idle time for the blocked instance. The system dehydrates the blocked instance if the expected idle time exceeds a predetermined threshold.

Use of metrics to control throttling and swapping in a message processing system

The location of a computing device is determined, and the location of an area of interest that is a geographic area referred to as a geo-fence is identified. The accuracy of the determined location of the computing device has an associated uncertainty, so the exact position of the computing device cannot typically be pinpointed. In light of this, the uncertainty associated with the determined location is evaluated relative to the size of the geo-fence in order to determine whether the computing device is inside the geo-fence or outside the geo-fence. Based on this determination, various actions can be taken if the user is entering the geo-fence, exiting the geo-fence, remaining in the geo-fence for at least a threshold amount of time, and so forth.

Detecting geo-fence events using varying confidence levels

A device location is determined, and the location of an area of interest that is a geographic area referred to as a geo-fence is identified. Multiple geo-fences can be identified by the device, and different geo-fences can be associated with different programs on the device. An operating system of the device implements multiple different periods of operation for the device, including a conservation period during which certain programs are not typically scheduled to run, and an execution period during which such programs are typically scheduled to run. A system identifies geo-fence events, which occur when the device enters or exits the geo-fence. The system maintains a record of the geo-fence events for each of multiple geo-fences, and provides to a program selected ones of those geo-fence events at a time when the program is scheduled to run on the device during an execution period of the operating system.

Coalescing geo-fence events

A computing device includes at least one processor and a memory, the memory storing computer-executable instructions for causing the device to be configured to load a subset of geo-fences from secondary storage to primary storage for tracking by the computing device, the subset of geo-fences selected from a set of available geo-fences stored in the secondary storage, based on a selection criteria. The computing device further creates a boundary geo-fence with a radius corresponding to a distance between a current location of the computing device and an edge of a geo-fence in the subset of geo-fences that is furthest from the current location of the computing device. Upon detecting a geo-fence event associated with a new location of the computing device in relation to the boundary geo-fence, a new subset of geo-fences is re-loaded, and a new boundary geo-fence is created based on the new location of the computing device.

Scalability and reliability of hardware geo-fencing with failover support

Use of metrics to control throttling and swapping in a message processing

Systems and methods disclosed herein may include tracking one or more geo-fences using a GNSS hardware processor within a computing device. The tracking may use at least one GNSS signal. State changes of the one or more geo-fences during the tracking may be saved in a shared state database. The shared state database may be shared between the GNSS hardware processor and an application processor within the computing device. Upon detecting a deterioration of the at least one GNSS signal, tracking the one or more geo-fences may be switched from using the GNSS hardware processor to using the application processor. After the switching, an initial state of each of the one or more geo-fences may be set by using states currently stored in the shared state database prior to the switching.

Improving scalability and reliability of hardware geo-fencing with failover support

Techniques and tools for reducing power consumption of computing devices (e.g., mobile devices such as mobile phones and tablet computers) that perform position tracking operations are described. In described examples, a low-power processor calculates (e.g., in real time) position information (e.g., GPS position fixes) based on information received from a positioning system (e.g., GPS) and stores the position information for later use in a buffer associated with the low-power processor (e.g., in storage on the low-power processor). Described examples allow position information to be calculated in real time and stored while the device is in a low-power state, and can be used with location-based applications that do not require position information to be delivered to the application in real time.

Efficient power usage in position tracking operations

A source device can navigate towards a moving destination target device, such as when two mobile phones are moving towards each other. The source device can receive an initial position of the target and a route to the target. As the source device and target device simultaneously move, the route can be updated. For example, if a distance of movement exceeds a threshold (e.g., 1 mile) the route can be updated. In another embodiment, a target device can switch between position tracking devices so as to provide less accurate position information, but save power, or provide high accuracy position information at the cost of higher power consumption. Generally, the switching between position tracking devices and the frequency at which the route to the destination point can be based on the distance apart between the source device and target device.

Mobile navigation to a moving destination

Embodiments are directed to promptly reestablishing communication between nodes in a dynamic computer network and dynamically maintaining an address list in an unstable network. A computer system sends a message to other message queuing nodes in a network, where each node in the message queuing network includes a corresponding persistent unique global identifier. The computer system maintains a list of unique global identifiers and the current network addresses of those network nodes from which the message queuing node has received a message or to which the message queuing node has sent a message. The computer system goes offline for a period of time and upon coming back online, sends an announcement message to each node maintained in the list indicating that the message queuing node is ready for communication in the message queuing network, where each message includes the destination node's globally unique identifier and the node's current network address.

Asynchronous communication in an unstable network

An XLANG/s compiler detects convoy scenarios during compilation and generates runtime directives to correctly correlate incoming messages with business process instances. A convoy scenario, present in event driven processes, is defined by a correlation set initialized during a receive operation which is provided to a subsequent receive operation. The compiler detects those convoy scenarios by analyzing the control and dataflow of a XLANG/s program. Three convoy patterns are distinguished: (1) activation convoys, (2) uniform sequential convoys, and (3) non-uniform sequential convoys. XLANG/s allows declarative descriptions of convoy scenarios without requiring an understanding of the low-level details supporting their correct execution. Convoy scenarios are processed by statically analyzing a written workflow application to deduce the nature and type of convoy scenarios used by the application. Information is extracted at compile time to support the runtime infrastructure. The runtime infrastructure is tightly integrated with the underlying correlation and subscription evaluation framework.

Efficient processing of a convoy workflow scenario in a message driven process

A system and method of processing a message in an asynchronous architecture is provided. In the method, a determination is made that a response to a message sent by an instance of software code is to be received, where the response indicates whether the message succeeded or failed. Another determination is made as to whether the response has been received. If the response has not been received, the instance of the software code is stored in memory, thereby suspending the instance. The response is received, the instance resumed and the response is processed.

Handling a delivery failure as a program exception in a distributed asynchronous architecture

Growing community of inventors

Sammamish, WA, United States of America

Sanjib Saha