Patents by Inventor NILADRI SEKHAR DE

NILADRI SEKHAR DE has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11093878
    Abstract: Systems, methods, and other embodiments are disclosed that are configured to generate and temporally associate task structures in a computerized project plan representing tasks of a project. In one embodiment, a temporally dependent relationship is formed between a successor task structure and a group of predecessor task structures within the computerized project plan, in response to user interaction with a graphical user interface associated with the computerized project plan. The temporally dependent relationship is formed by allowing a temporal event associated with the successor task structure to be recorded within the computerized project plan as having occurred only after a temporal criterion is recorded within the computerized project plan as having been met for a defined number of predecessor task structures in the group. The defined number is less than a total number of predecessor task structures in the group.
    Type: Grant
    Filed: July 1, 2015
    Date of Patent: August 17, 2021
    Assignee: Oracle International Corporation
    Inventors: Niladri Sekhar De, John S. John
  • Patent number: 10373092
    Abstract: Systems, methods, and other embodiments are disclosed that are configured to make tradeoffs between time and quality for tasks of a project in a computerized project plan. In one embodiment, at task of a project is represented as a task data structure in a computerized project plan. A time duration in which to complete the task may be automatically transformed in the task data structure by manually changing a quality level of a result of the task in the task data structure in response to user interaction with a graphical user interface of the computerized project plan. Similarly, the quality level of the result of the task may be automatically transformed in the task data structure by manually changing the time duration in which to complete the task in the task data structure in response to user interaction with the graphical user interface of the computerized project plan.
    Type: Grant
    Filed: September 8, 2015
    Date of Patent: August 6, 2019
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventor: Niladri Sekhar De
  • Publication number: 20170068916
    Abstract: Systems, methods, and other embodiments are disclosed that are configured to make tradeoffs between time and quality for tasks of a project in a computerized project plan. In one embodiment, at task of a project is represented as a task data structure in a computerized project plan. A time duration in which to complete the task may be automatically transformed in the task data structure by manually changing a quality level of a result of the task in the task data structure in response to user interaction with a graphical user interface of the computerized project plan. Similarly, the quality level of the result of the task may be automatically transformed in the task data structure by manually changing the time duration in which to complete the task in the task data structure in response to user interaction with the graphical user interface of the computerized project plan.
    Type: Application
    Filed: September 8, 2015
    Publication date: March 9, 2017
    Inventor: Niladri Sekhar DE
  • Publication number: 20170004431
    Abstract: Systems, methods, and other embodiments are disclosed that are configured to generate and temporally associate task structures in a computerized project plan representing tasks of a project. In one embodiment, a temporally dependent relationship is formed between a successor task structure and a group of predecessor task structures within the computerized project plan, in response to user interaction with a graphical user interface associated with the computerized project plan. The temporally dependent relationship is formed by allowing a temporal event associated with the successor task structure to be recorded within the computerized project plan as having occurred only after a temporal criterion is recorded within the computerized project plan as having been met for a defined number of predecessor task structures in the group. The defined number is less than a total number of predecessor task structures in the group.
    Type: Application
    Filed: July 1, 2015
    Publication date: January 5, 2017
    Inventors: Niladri Sekhar DE, John S. JOHN
  • Publication number: 20150186824
    Abstract: According to an aspect of the present disclosure, effort parameters for a task to be performed by a resource are maintained, the effort parameters together specifying a sequence of initial component efforts (as a number of base intervals) for the resource in each of a progression of super intervals in relation to performance of the task by the resource. A graph containing graphical elements representing the sequence of component efforts over the progression of super intervals is then sent for display. In response to receiving an input indicating a change of an effort parameter, a sequence of changed component efforts for the progression of super intervals is computed and the graph updated with the sequence of changed component efforts. Thus, a user may make desired changes to the component efforts and view the effect of such changes on all of the component efforts in an interactive manner.
    Type: Application
    Filed: December 31, 2013
    Publication date: July 2, 2015
    Applicant: Oracle International Corporation
    Inventor: Niladri Sekhar De
  • Publication number: 20150134393
    Abstract: An aspect of the present disclosure provides enhanced control to users in the placement of tasks along timelines. In an embodiment, task data specifying details of multiple tasks scheduled along a timeline, is maintained. The tasks are displayed along the timeline. A candidate position is received for a first task along the timeline. In response, the task data is examined to identify a set of tasks scheduled in a time slice covering the candidate position, and data related to identified set of tasks is collected. The collected data is then sent for display, for example, in a viewport associated with the first task.
    Type: Application
    Filed: November 14, 2013
    Publication date: May 14, 2015
    Applicant: Oracle International Corporation
    Inventors: NILADRI SEKHAR DE, Srinivasu Dudala, Surya Vedula
  • Publication number: 20150058053
    Abstract: An aspect of the present disclosure facilitates the shifting of a group of tasks along a timeline. In one embodiment, multiple tasks are sent for display along a timeline, with each task having a start time and an end time respectively equaling an original start value and an original end value along the timeline. In response to receiving data indicating a group of tasks and an offset, a new start value and a new end value for each of the tasks in the group is computed based on the offset. The start time and end time of each of the tasks in the group is set respectively to the computed new start value and new end value. The display of the timeline is updated (by resending the tasks) with the start time and end time of each task of the group set to the newly computed values. Thus, the received group of tasks is shifted along the timeline by the received offset.
    Type: Application
    Filed: August 20, 2013
    Publication date: February 26, 2015
    Applicant: Oracle International Corporation
    Inventors: Niladri Sekhar De, Srinivasu Dudala
  • Publication number: 20140310047
    Abstract: An aspect of the present invention simplifies scheduling of tasks of a project. In an embodiment, a user is provided the ability to specify a rejected list of dependencies, and such rejected dependencies are excluded when inferring dependencies between tasks of the project. The user may continue to add a set of tasks, have the dependencies (with the exclusion of rejected dependencies) inferred, reject more of the inferred dependencies, have the rejected dependencies added to the rejected list, during successive iterations. The output of such iterations may be processed further by a scheduling tool.
    Type: Application
    Filed: April 12, 2013
    Publication date: October 16, 2014
    Applicant: Oracle International Corporation
    Inventors: Niladri Sekhar De, Srinivasu Dudala, Surya Vedula
  • Publication number: 20140244334
    Abstract: An aspect of the present invention facilitates allocation of resources to tasks. In an embodiment, a user provides inputs representing tasks, resources, and duration of allocation of each of the resources to respective tasks in respective days. A unified graphical interface (UGI) indicating the tasks, the corresponding resources allocated for each task, and an extent of utilization of each resource in each day, is displayed. According to another aspect, the UGI includes the identifiers and daily capacities of each resource along a first direction, a timeline identifying days along a second direction (perpendicular to the display of the first direction), and vertical columns, with each column corresponding to a respective resource, wherein a width of a column identifies the daily capacity of the corresponding resource.
    Type: Application
    Filed: February 26, 2013
    Publication date: August 28, 2014
    Applicant: Oracle International Corporation
    Inventors: NILADRI SEKHAR DE, Surya Vedula