Du M Li

US Patent:

20100077035, Mar 25, 2010

Filed:

Sep 23, 2008

Appl. No.:

12/235744

Inventors:

Du Li - Palo Alto CA, US
Umesh Chandra - Sunnyvale CA, US

Assignee:

NOKIA CORPORATION - Espoo

International Classification:

G06F 15/82
G06F 15/16

US Classification:

709206, 709228

Abstract:

Methods and systems for optimizing server polling by a mobile client are described, thereby allowing mobile terminals to conserve battery life by more efficiently using resources such as the processor and transceiver in the mobile terminal. A broker system may be used to minimize wireless communication traffic used for polling. A broker stub intercepts server polling messages at the client, multiplexes the sever requests together, and forwards the multiplexed message to a broker skeleton that de-multiplexes and forwards the messages as appropriate. Polling may also be dynamically adapted based on user behavior, or a server guard may be used to monitor changes to data, and notify a client to poll its respective server when the server guard detects new or updated data on that server for that client.

US Patent:

20110208810, Aug 25, 2011

Filed:

Apr 29, 2011

Appl. No.:

13/097186

Inventors:

Du Li - Palo Alto CA, US
Umesh Chandra - Sunnyvale CA, US

Assignee:

NOKIA CORPORATION - Espoo

International Classification:

G06F 15/16

US Classification:

709203

Abstract:

Methods and systems for optimizing server polling by a mobile client are described, thereby allowing mobile terminals to conserve battery life by more efficiently using resources such as the processor and transceiver in the mobile terminal A broker system may be used to minimize wireless communication traffic used for polling. A broker stub intercepts server polling messages at the client, multiplexes the sever requests together, and forwards the multiplexed message to a broker skeleton that de-multiplexes and forwards the messages as appropriate. Polling may also be dynamically adapted based on user behavior, or a server guard may be used to monitor changes to data, and notify a client to poll its respective server when the server guard detects new or updated data on that server for that client.

US Patent:

20130238741, Sep 12, 2013

Filed:

Mar 9, 2012

Appl. No.:

13/416323

Inventors:

Johan KRISTIANSSON - Lulea, SE
Andreas EKEROTH - Lulea, SE
Du LI - Palo Alto CA, US

Assignee:

Telefonaktiebolaget L M Ericsson (publ) - Stockholm

International Classification:

G06F 15/167

US Classification:

709213

Abstract:

A first control node and a method therein for selecting the first control node or a second control node to act as a server are provided. The first and second control nodes are comprised in an overlay network. The first control node obtains a first indication relating to a ranking of a suitability of the first control node to act as the server. Furthermore, the first control node receives a second indication from the second control node. The second indication relates to a ranking of a suitability of the second control node to act as the server. Then, the first control node selects, based on the first and second indications, one of the first and second control nodes to act as the server for managing a master representation of a distributed shared memory being accessible within the overlay network.

US Patent:

20130288703, Oct 31, 2013

Filed:

Sep 1, 2010

Appl. No.:

13/819824

Inventors:

Guang Yang - San Jose CA, US
Du Li - Palo Alto CA, US
Yifei Jiang - Longmont CA, US
Zhigang Liu - Sunnyvale CA, US

International Classification:

H04W 64/00

US Classification:

4554561

Abstract:

A system that uses historical position information accumulated in an apparatus to determine whether locations and/or routes may be classified as significant. A classification of a location or route as significant may be utilized in configuring localization in the apparatus. Localization configuration may include, for example, setting a type technology utilized in determining apparatus position.

US Patent:

20130303184, Nov 14, 2013

Filed:

Sep 23, 2010

Appl. No.:

13/825364

Inventors:

Guang Yang - San Jose CA, US
Du Li - Palo Alto CA, US
Yifei Jiang - Longmont CA, US
Zhigang Liu - Sunnyvale CA, US

Assignee:

Nokia Corporation - Espoo

International Classification:

H04W 8/22
H04W 64/00

US Classification:

4554561

Abstract:

A system for detecting state transitions when apparatuses move between significant places or routes without having to employ high resolution, and high energy cost, localization technologies. Apparatuses may receive position information via lower resolution/lower energy cost localization resources, and this information may be used to determine whether the current position of the apparatus corresponds to a significant place or route. If the apparatus is determined to be positioned in a significant place or route, a further determination may be made as to whether at least one second level classifier exists for the significant place or route. Second level classifiers may be utilized to determine when apparatuses transition from one state (e.g., one significant place or route) to another. Upon detection of a state transition based on the second level classifier, a new localization configuration may be applied in the apparatus.

US Patent:

20150271280, Sep 24, 2015

Filed:

Jun 5, 2015

Appl. No.:

14/732009

Inventors:

- Stockholm, SE
Du LI - Palo Alto CA, US

International Classification:

H04L 29/08

Abstract:

Methods and apparatus for determining recommended geographic server locations for online social networks by attempting to minimize user-server latency and inter-user communications latency. In an embodiment, geographic and relationship information for a plurality of users is acquired. The plurality of users may belong to one or more networks. The acquired information is transformed into a graph. A first plurality of clusters is generated with a first clustering algorithm. A second plurality of clusters is generated by iteratively examining pairs of the first plurality clusters, and swapping nodes between the examined clusters if it will reduce a total cut weight of the graph and locate each pair of nodes within a defined maximum distance from the centroid of the target cluster. In an embodiment, a method uses a joint analysis approach based upon characteristics of a plurality of existing networks.

US Patent:

20140195470, Jul 10, 2014

Filed:

Jan 8, 2013

Appl. No.:

13/736589

Inventors:

- Stockholm, SE
Du Li - Palo Alto CA, US

Assignee:

TELEFONAKTIEBOLAGET L M ERICSSON (PUB) - STOCKHOLM

International Classification:

G06N 5/02

US Classification:

706 46

Abstract:

A method for grouping trips of a mobile device, a trip including a set of trip traces from a plurality of traces collected from base stations. Each base station includes a unique station-ID. Each trace includes a station-ID and an association time indicating when the mobile device was associated with the base station. The mobile device is associated with at most one base station at any point in time. The method to group two trips by calculating an edit distance using an approximate string matching algorithm. The method includes identifying traces for the two trips, extracting ordered sets of station-IDs from the traces, calculating the edit distance between the two trips by applying the approximate string matching algorithm, to the ordered sets of station-IDs, checking if the edit distance is less than a preset edit distance threshold, and grouping the two trips into a group of trips.

US Patent:

20140143407, May 22, 2014

Filed:

Nov 21, 2012

Appl. No.:

13/684125

Inventors:

- Stockholm, SE
Du LI - Palo Alto CA, US

Assignee:

TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) - Stockholm

International Classification:

H04L 29/08

US Classification:

709224

Abstract:

Methods and apparatus for determining recommended geographic server locations for online social networks by attempting to minimize user-server latency and inter-user communications latency. In an embodiment, geographic and relationship information for a plurality of users is acquired. The plurality of users may belong to one or more networks. The acquired information is transformed into a graph. A first plurality of clusters is generated with a first clustering algorithm. A second plurality of clusters is generated by iteratively examining pairs of the first plurality clusters, and swapping nodes between the examined clusters if it will reduce a total cut weight of the graph and locate each pair of nodes within a defined maximum distance from the centroid of the target cluster. In an embodiment, a method uses a joint analysis approach based upon characteristics of a plurality of existing networks.