Search

Jane Jan Phones & Addresses

  • Castro Valley, CA
  • Cupertino, CA
  • Santa Clara, CA
  • Sunnyvale, CA

Work

Company: Uber Jul 2016 Position: Technical lead

Education

Degree: Masters School / High School: University of Dhaka 2009 to 2011

Resumes

Resumes

Jane Jan Photo 1

Technical Lead

View page
Location:
Cupertino, CA
Work:
Uber
Technical Lead
Education:
University of Dhaka 2009 - 2011
Masters

Publications

Us Patents

Intersection-Based Routing

View page
US Patent:
20200408538, Dec 31, 2020
Filed:
Jun 25, 2020
Appl. No.:
16/911823
Inventors:
- San Francisco CA, US
Karapet Shaginyan - San Francisco CA, US
Jane Alam Jan - Cupertino CA, US
International Classification:
G01C 21/34
G01C 21/36
Abstract:
Systems and methods are provided for receiving a start location and a destination location, determining a road segment corresponding to the destination location, and identifying a node nearest the road segment corresponding to the destination location, whereby the node corresponds to a nearest left-hand node for a right-hand driving country or a nearest right-hand node for a left-hand driving country. The systems and methods further provide for generating a first route from the start location to the node nearest the road segment corresponding to the destination location, generating a second route from the node nearest the road segment corresponding to the destination location, to the destination location, and combining the first route and the second route to generate a final route. Thus, the final route comprises a route from the start location, through the node nearest the road segment corresponding to the destination location, to the destination location.

Vehicle Routing Guidance To An Authoritative Location For A Point Of Interest

View page
US Patent:
20200041298, Feb 6, 2020
Filed:
Oct 14, 2019
Appl. No.:
16/601510
Inventors:
- San Francisco CA, US
Sheng Yang - Fremont CA, US
Vasudev Parameswaran - Fremont CA, US
Shivendra Pratap Singh - Redwood CIty CA, US
Jane Alam Jan - Santa Clara CA, US
International Classification:
G01C 21/34
G06F 7/14
G06F 7/02
G06F 7/20
G01C 21/36
Abstract:
An authoritative candidate is selected for determining a location of a point of interest (POI). Source data including name, address, and location for POIs is received from multiple data sources. The received data is normalized for ease of comparison, and coordinates for each candidate are compared to coordinates of other candidates to determine which candidate if any is an authoritative location for the POI. The candidate locations are compared using two models a metric-based scoring system and a machine learning model that may utilize a gradient boosted decision tree. The authoritative candidate can be used to render digital maps that include the POI. In addition, the authoritative candidate's location can be used to provide vehicle route guidance to the POI.

Managing Materialized Views In Eventually Consistent Distributed Data Stores

View page
US Patent:
20190332698, Oct 31, 2019
Filed:
Apr 25, 2018
Appl. No.:
15/962896
Inventors:
- Redmond WA, US
Roman A. Averbukh - Sunnyvale CA, US
Yanwei Zhang - Hillsboro OR, US
Andrew J. Carter - Mountain View CA, US
Jane Alam Jan - Santa Clara CA, US
Assignee:
Microsoft Technology Licensing, LLC - Redmond WA
International Classification:
G06F 17/30
Abstract:
The disclosed embodiments provide a system for managing a materialized view of data in a data store. During operation, the system obtains a first creation time of a first materialized view of the data in the data store. Next, the system verifies that the first materialized view is not affected by deletions applied to the data since the first creation time. The system then identifies one or more additions to the data that are not included in the first materialized view. Finally, the system applies the additions to the first materialized view to maintain an eventual consistency of the first materialized view with the data store.

Vehicle Routing Guidance To An Authoritative Location For A Point Of Interest

View page
US Patent:
20180340787, Nov 29, 2018
Filed:
May 26, 2017
Appl. No.:
15/606555
Inventors:
- San Francisco CA, US
Sheng Yang - Fremont CA, US
Vasudev Parameswaran - Fremont CA, US
Shivendra Pratap Singh - Redwood City CA, US
Jane Alam Jan - Santa Clara CA, US
International Classification:
G01C 21/34
G06N 99/00
Abstract:
An authoritative candidate is selected for determining a location of a point of interest (POI). Source data including name, address, and location for POIs is received from multiple data sources. The received data is normalized for ease of comparison, and coordinates for each candidate are compared to coordinates of other candidates to determine which candidate if any is an authoritative location for the POI. The candidate locations are compared using two models a metric-based scoring system and a machine learning model that may utilize a gradient boosted decision tree. The authoritative candidate can be used to render digital maps that include the POI. In addition, the authoritative candidate's location can be used to provide vehicle route guidance to the POI.

Multi-Tenant Distribution Of Graph Database Caches

View page
US Patent:
20180239796, Aug 23, 2018
Filed:
Feb 21, 2017
Appl. No.:
15/438194
Inventors:
- Sunnyvale CA, US
Jane Alam Jan - Santa Clara CA, US
Brent D. Miller - Sunnyvale CA, US
Tianqiang Li - Fremont CA, US
Assignee:
LinkedIn Corporation - Sunnyvale CA
International Classification:
G06F 17/30
Abstract:
The disclosed embodiments provide a system for performing multi-tenancy distribution of a graph database cache. During operation, the system obtains a cache of a set of records in a graph database storing a graph, wherein the graph includes a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. Next, the system identifies one or more records in the cache that fail a validation test. The system then merges a remainder of the cache with online updates to the subset of records to produce a merged version of the cache. Finally, the system distributes the merged version to one or more instances of the graph database for use in processing queries of the graph database.

Partitioning And Replicating Data In Scalable Distributed Data Stores

View page
US Patent:
20170262521, Sep 14, 2017
Filed:
Apr 11, 2016
Appl. No.:
15/096068
Inventors:
- Mountain View CA, US
Andrew J. Carter - Mountain View CA, US
Joshua D. Ehrlich - Mountain View CA, US
Jane Alam Jan - Santa Clara CA, US
Assignee:
LinkedIn Corporation - Mountain View CA
International Classification:
G06F 17/30
Abstract:
The disclosed embodiments provide a system for processing data. During operation, the system generates a first distribution of a set of partitions comprising a graph database across a first set of storage nodes in a first cluster. Next, the system replicates the graph database by generating a second, different distribution of the set of partitions across a second set of storage nodes in a second cluster. The system then identifies one or more partitions storing data associated with the query and uses a set of mappings comprising the set of partitions, the first and second sets of storage nodes, and the first and second clusters to select one or more storage nodes containing the one or more partitions. Finally, the system transmits one or more portions of the query to the selected storage nodes.

Throughput-Based Fan-Out Control In Scalable Distributed Data Stores

View page
US Patent:
20170262524, Sep 14, 2017
Filed:
Apr 11, 2016
Appl. No.:
15/096067
Inventors:
- Mountain View CA, US
Andrew J. Carter - Mountain View CA, US
Joshua D. Ehrlich - Mountain View CA, US
Jane Alam Jan - Santa Clara CA, US
Assignee:
LinkedIn Corporation - Mountain View CA
International Classification:
G06F 17/30
Abstract:
The disclosed embodiments provide a system for processing data. During operation, the system determines a current incoming queries per second (QPS) to one or more components for processing queries of a graph database, wherein the graph database is replicated across multiple clusters and distributed among a set of storage nodes in each of the clusters. Next, the system uses the current incoming QPS to estimate, for the one or more components, an expected QPS associated with fanning out of the queries to the clusters. The system then selects a number of clusters in the multiple clusters for fanning out of a query based on the expected QPS and one or more throughput limits for the one or more components. Finally, the system transmits the query to one or more of the storage nodes in the selected number of clusters.

Fan-Out Control In Scalable Distributed Data Stores

View page
US Patent:
20170262551, Sep 14, 2017
Filed:
Apr 11, 2016
Appl. No.:
15/096070
Inventors:
- Mountain View CA, US
Andrew J. Carter - Mountain View CA, US
Joshua D. Ehrlich - Mountain View CA, US
Jane Alam Jan - Santa Clara CA, US
Assignee:
LinkedIn Corporation - Mountain View CA
International Classification:
G06F 17/30
H04L 12/715
Abstract:
The disclosed embodiments provide a system for processing data. During operation, the system identifies a query type of a query of a graph database storing a graph, wherein the graph comprises nodes, edges between pairs of nodes, and predicates. Next, the system determines, based on the query type, a number of clusters on which the graph database is replicated for fanning out of the query. The system then selects a set of storage nodes in the determined number of clusters for processing of the query. Finally, the system generates a fan-out of the query to the selected storage nodes.
Jane Alam Jan from Castro Valley, CA, age ~38 Get Report