Mei Li Yang

US Patent:

7672855, Mar 2, 2010

Filed:

Feb 25, 2005

Appl. No.:

11/067154

Inventors:

Roy I. Peterkofsky - San Francisco CA, US
Hema Budaraju - Fremont CA, US
Mei Yang - Albany CA, US
Rongming Sun - Hayward CA, US
Mukundan Srinivasan - Foster City CA, US

Assignee:

Oracle International Corp. - Redwood Shores CA

International Classification:

G06Q 10/00
G06F 19/00

US Classification:

705 1, 705 7

Abstract:

Systems, methodologies, media, and other embodiments associated with transportation planning in light of drop trailer arrangements are described. One exemplary computer-implemented method embodiment includes receiving orders that describe items to be delivered to facilities as controlled by order requirements. The method may also include accessing a transportation planning model that includes information concerning shipping modes and carriers by which an order can be delivered to a facility. The transportation planning model may also include data concerning drop trailer arrangements between facilities and the carriers. The method may also include selectively consolidating orders into shipments based on the transportation planning model and the availability of a drop trailer arrangement. The method may also include selectively assigning shipments to loads based on the transportation planning model and the availability of a drop trailer action. The method may output an actionable plan of loads stored, for example, on a computer-readable medium.

US Patent:

7827051, Nov 2, 2010

Filed:

May 23, 2005

Appl. No.:

11/136167

Inventors:

Javier Nicolás Sánchez - San Carlos CA, US
Mei Yang - Albany CA, US
Rongming Sun - Hayward CA, US
Roy I. Peterkofsky - San Francisco CA, US
Hema Budaraju - Fremont CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 17/30

US Classification:

705 7, 705 8, 705 9, 705 10

Abstract:

A computer, for planning moves of freight automatically adds one or more layover(s) to a mission. Next, the computer determines one or more charge(s) for the layovers, using carriers' rules. Thereafter, the computer uses the charge(s) in deciding whether to include the mission in a transportation plan to be executed. In some embodiments, the computer automatically maintains, for the given mission, counts of attributes on which limits are imposed by a government or by carriers, such as driving time, on-duty time, and driving distance, and when any count exceeds a corresponding limit in the midst of a driving activity, the computer automatically divides up the current driving activity into a truncated driving activity and a remainder driving activity, separated by a layover activity. The computer also determines an estimated time of arrival, including the impact of required layovers, to reach destination(s), and whether layover(s) is/are required at the destination(s), e. g. due to consignee's receiving hours or due to congestion at consignee's dock.

US Patent:

8626540, Jan 7, 2014

Filed:

May 23, 2005

Appl. No.:

11/136045

Inventors:

Roy I. Peterkofsky - San Francisco CA, US
Hema Budaraju - Fremont CA, US
Mei Yang - Albany CA, US
Rongming Sun - Hayward CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06Q 10/00

US Classification:

705 711, 705 712

Abstract:

A computer, for planning moves of freight using vehicles, determines one or more attributes of a mission, based on a group of shipments being consolidated into the mission, computes a total amount of freight to be moved, and decides on feasibility of performing the mission, using a vehicle of a given type based at least on each of (A) the amount of freight, (B) one or more attributes of the mission, and (C) multiple effective capacities of freight moveable by the type of vehicle being selected, which depend on the mission attribute(s). Multiple effective capacities for each vehicle type, and corresponding values of mission attribute(s) at which they are to be applied are stored in the computer ahead of time, based on industry experience. Examples of mission attribute(s) include (1) number of stops, (2) type of stops (whether pooling or not), and (3) a combination thereof.

US Patent:

20060224423, Oct 5, 2006

Filed:

Apr 1, 2005

Appl. No.:

11/097435

Inventors:

Rongming Sun - Hayward CA, US
Mukundan Srinivasan - Foster City CA, US
Georges-Henri Moll - Villeneuve-Loubet, FR
Vinay Yadappanavar - Redwood City CA, US
Mei Yang - Albany CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 9/44

US Classification:

705007000

Abstract:

Systems, methodologies, media, and other embodiments associated with parallel optimization in transportation planning are described. One exemplary method embodiment may include selecting, in parallel, candidate loads to satisfy a set of orders, selecting final loads from the candidate loads, and in parallel selectively manipulating the final loads into a transportation plan that reduces a transportation cost.

US Patent:

20130117162, May 9, 2013

Filed:

May 25, 2012

Appl. No.:

13/480850

Inventors:

TAO FENG - San Jose CA, US
Mei Yang - San Ramon CA, US
Jeroen Dirks - Toronto CA, US
Zhisu Zhu - San Jose CA, US
Mukundan Srinivasan - Union City CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06Q 10/08

US Classification:

705 28

Abstract:

Embodiments of the invention provide systems and methods for fair share allocation of inventory levels throughout a supply chain. According to one embodiment, a first round main Linear Programming (LP) solve can generate an initial solution. Post-processing heuristics for fair sharing can be applied to the first round solve of the main LP. Circular sourcing heuristics can be applied to the first round solve when adjusting for fair sharing allocation requirements. For example, applying the circular sourcing heuristics to the first round solve of the main LP can comprise determining a firmed supply surplus and shortage based on a demand picture from the first round solve of the main LP adjusted for fair sharing. A second round main LP solve can be executed using the fixed inter-organizational transfer variables and fixed supply towards independent demand variables from the post-processing heuristics.

US Patent:

20180034769, Feb 1, 2018

Filed:

Aug 1, 2016

Appl. No.:

15/225368

Inventors:

- Santa Clara CA, US
Richard Lane - Mountain View CA, US
Ning Song - Milpitas CA, US
Mei Yang - Fremont CA, US
Gregor Maier - Alameda CA, US
Srinivasan Ramasubramanian - Sunnyvale CA, US

International Classification:

H04L 29/12
H04L 12/931
H04L 12/733

Abstract:

Methods, systems, and computer programs are presented for distributing network address translation (NAT) operations to a plurality of network devices on a network. One method includes an operation for identifying, by a controller that controls a network fabric, a plurality of switches in the network fabric, each switch having a module for NAT and being configured to forward packets received at the switch. The controller identifies hosts having at least one internal Internet Protocol (IP) address, and for each of the hosts, the controller selects one of the switches from the plurality of switches for performing the NAT for the host. Further, the controller configures the network fabric to cause the selected switch to perform the NAT for the host to enable the host to communicate with an external network. In case of switch failure, the system reallocates NAT loads to other switches for high availability.

US Patent:

20160234091, Aug 11, 2016

Filed:

Feb 10, 2015

Appl. No.:

14/618635

Inventors:

- Santa Clara CA, US
Srinivasan Ramasubramanian - Sunnyvale CA, US
Shrinivasa Kini - Santa Clara CA, US
Mei Yang - Fremont CA, US
Sudeep Dilip Modi - Milpitas CA, US
Gregor Mathias Maier - Alameda CA, US
Rajneesh Bajpai - San Jose CA, US

International Classification:

H04L 12/26
H04L 12/709
H04L 12/721
H04L 12/24

Abstract:

A packet forwarding network may include switches that forward network traffic between end hosts that are coupled to the forwarding network. An analysis network may be connected to the forwarding network. A controller may control the switches in the forwarding network to implement desired forwarding paths. The controller may configure the switches to form switch port groups. The controller may identify a port group that is connected to the analysis network. The controller may select a subset of the forwarded packets and may control selected switches to copy the subset to the identified port group. The controller may establish network tunnels between the switches and the port group. In this way, the controller may control the switches to perform efficient traffic monitoring regardless of the location on the forwarding network at which the traffic monitoring network is connected and without interfering with normal packet forwarding operations through the forwarding network.

US Patent:

20160020939, Jan 21, 2016

Filed:

Jul 21, 2014

Appl. No.:

14/337161

Inventors:

- Santa Clara CA, US
Vishnu Emmadi - Sunnyvale CA, US
Sudeep Dilip Modi - Milpitas CA, US
Kanzhe Jiang - Los Altos Hills CA, US
Kuang-Ching Wang - Central SC, US
Gregor Mathias Maier - Alameda CA, US
Mei Yang - Fremont CA, US
Robert W. Sherwood - Oakland CA, US
Mandeep Singh Dhami - San Jose CA, US

International Classification:

H04L 12/24

Abstract:

A network of switches having ports coupled to other switches or end hosts may be controlled by a controller. The controller may identify whether any switch ports have failed. In response to identifying that a port has failed at a first switch, the controller may modify link aggregation group mappings of the other switches to handle failover. The controller may modify the link aggregation group mapping of each other switch to include a first mapping that includes ports coupled to the first switch and a second mapping that does not include any ports coupled to the first switch. The controller may configure forwarding tables at the switches to forward network packets using the first or second mappings based on network topology information maintained by the controller.