Systems, devices and / or methods for managing items

Abstract

Certain example embodiments may provide a method comprising: representing, by a set of machine instructions, an activity of an item as a node of a graph; the relation of the items is expressed as the edges of the graph; obtaining a first probability of completing the activity within a predetermined period of time using the normal distribution and the associated p value; and presenting a first user interface indicating a probability of completion of the activity within the predetermined time period.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0001] Various potentially practical and useful embodiments may be more readily understood through the following detailed description of certain exemplary embodiments, with reference to the exemplary accompanying drawings, in which:

[0002] Figure 1 is a side view of an exemplary embodiment of system 1000;

[0003] Figure 2 is a flow chart of an exemplary embodiment of method 2000; and

[0004] Figure 3 is a block diagram of an exemplary embodiment of an information device 3000. DETAILED DESCRIPTION

[0005] Certain exemplary embodiments may provide a method, which includes, via a set of machine instructions: representing activities of a project as nodes of a graph; representing relationships of the project as edges of the graph; utilizing a normal distribution and an associated p-value to obtain a first probability of completing the activity within a predetermined time period; and presenting a first user interface indicating the probability of completing the activity within the predetermined time period.

[0006] The current methodology used by the project scheduling industry uses the Critical Path Method (“CPM”) and depicts project activities as a series of time-based bars, known as a Gantt chart. Such graphs / charts can be used to closely monitor and control project activities. However, this methodology assumes a deterministic single point estimate of the duration and scheduled completion of an activity, which is often not accurately applied to some real-world projects.

[0007] Another approach was developed by the U.S. Navy around 1958 and is called the Program Evaluation and Review Technique ("PERT"), which employs probabilistic three-point estimates to determine the level of schedule and cost variation in a project. While PERT is useful for estimating the amount of uncertainty in achieving a specified project deadline and budget, PERT has been used in the early planning and pre-execution stages of a project and faces challenges in terms of continued updating after a project has begun.

[0008] Certain exemplary embodiments use the PERT technique in the day-to-day monitoring and control of projects. Certain exemplary embodiments provide various codes and queries that have been constructed to extract useful information about the status of a project and the likelihood of achieving schedule and / or cost goals. Certain exemplary embodiments include machine instructions that execute on a Neo4j (Neo4j is a registered trademark of Neo Technology of San Mateo, California) graph database management system and can be run on a local computer, a distributed network, and / or a cloud-based server. Certain exemplary embodiments utilize the normal distribution (also known as the z distribution) and the associated p-value to obtain the probability of achieving a test result (i.e., completing a project and / or activity before a given time and within a specified budget). The normal distribution (z distribution), p-values, and queries for deriving case-related probabilities have been implemented in machine instructions based on logical, path, and pattern matching queries written in the Cypher query language. In certain exemplary embodiments, the PERT method (and several variants, such as modified PERT and / or triangular distribution, etc.) can be used in conjunction with CPM. Certain exemplary embodiments utilize path finding and shortest path algorithms (e.g., Dijkstra's shortest path algorithm, A* algorithm, k-shortest path, single-source shortest path, all-pairs shortest path) to determine critical and near-critical paths, where activity / task durations are mapped to path weights and relationships applied to graph directions.

[0009] Certain exemplary embodiments provide a method for quickly assessing the level of uncertainty contained in a schedule by representing activities as nodes (or vertices) and relationships as edges. The present application utilizes relationships between predecessor and successor tasks, including: finish-start, start-start, finish-finish, and start-finish. Certain exemplary embodiments provide a method based on logical, path, and pattern matching queries written in Cypher query language. Lag and lead are also used in exemplary machine instructions. Certain exemplary embodiments perform forward and backward passes on a project schedule using queries written in Cypher query language to determine early start, early finish, late start, late finish, free float, and / or total float (or slack). Certain exemplary embodiments calculate and track the critical path of the project at each point in time, the risk level and probability of achieving various milestones and budget goals, resource allocation and allocation, and joint or combined schedule and cost risks at any desired confidence level. Certain exemplary embodiments provide novel implementations of standard normal distribution (z distribution) and its p-values, which are used to quantify schedule and / or cost uncertainty and confidence levels. Risks can then be integrated to assess and determine the results before and after risk mitigation.

[0010] Certain exemplary embodiments are built according to industry best practices and standards for assessing schedule health, such as the U.S. Defense Contract Management Agency (DCMA) 14-point assessment and customized quality checks. Schedule and cost performance can be tracked by applying earned value management techniques and S-curves, which have been implemented in machine instructions based on logic and pattern matching. Graphs and charts can be drawn to help visualize the level of uncertainty for activities and resources and the entire project path. Certain exemplary embodiments can be used as a stand-alone tool or in conjunction with other machine instructions.

[0011] Certain exemplary embodiments are built to perform machine learning and graph algorithms, such as betweenness centrality on weighted paths, applied to project schedules in novel ways to provide business intelligence and rank the most critical activities. Because the schedule is depicted as a system of nodes and edges, what-if scenario analysis can be quickly performed to evaluate, experiment with, and optimize approaches from countless alternatives based on logical, path, and pattern matching queries written in the Cypher query language.

[0012] Certain exemplary embodiments provide a method that includes simplifying the understanding of project schedules and the factors that drive project planning. Certain exemplary embodiments utilize visual techniques to enhance applications that provide the foundation of project schedules. Complex paths are made easy to grasp by using an unconventional approach, using network analysis to represent activities as nodes and their relationships as edges. Critical paths and their evolution are easily detected. Potential risks to successful schedule implementation can be quantified, eliminated and / or managed. Unlike certain exemplary deployment critical path method (CPM) processes that use a deterministic approach, certain exemplary embodiments use a novel implementation of the PERT process to probabilistically evaluate and schedule projects. Interactive nodes in the network can be used to highlight and control activities, resources, costs, and risks. Forward and backward passes can be automated, and the underlying structure of large, complex schedules can be captured and visualized using Neo4j graphical machine instructions. Calculation and query algorithms for schedules based on network attributes have been developed. Unprecedented graph network and machine learning concepts are combined and directed to project progress (scheduling) (e.g., betweenness centrality, graph traversal, pattern matching, distance and path algorithms, proximity, node importance, historical graph evolution tracking, and link prediction) to discover hidden patterns and gain a deeper understanding of trends than using certain other methods. Certain exemplary embodiments bring key principles together to introduce a powerful and novel tool to address modern scheduling challenges and provide the entire planning team with a way to change the paradigm of future project control and management.

[0013] Certain exemplary embodiments provide an interactive graphical network for visualizing and representing project activities as nodes; computation and query algorithms for schedules based on network attributes, machine learning for project scheduling, automatic round tripping, probabilistic PERT analysis, and CPM, schedule risk, and cost risk analysis.

[0014] Certain exemplary embodiments visualize activities as interacting nodes and their paths as edges, computation and query algorithms for schedules based on network attributes, automatic forward and backward passes to help assess the health of the schedule and the interactivity of key activities in the schedule, and machine learning to allow machine learning of patterns in project schedules.

[0015] Certain exemplary embodiments provide rich visualization and interactivity of project activities represented as nodes in a graph network. This enables the application of PERT analysis concepts to analyze project schedules and incorporate risk prediction. Machine learning techniques are applied to the graph, enabling computers to learn from the structure of the schedule. Advanced queries and algorithms for the calculation of schedules based on network attributes have been developed.

[0016] Certain exemplary embodiments include code and algorithms developed with the goal of simplifying the application of network analysis to project schedules. Any project schedule can be easily represented as a graphical network to infer rich insights. Certain exemplary embodiments provide written code and queries to automatically solve common business problems and depict project activities as nodes for enhanced visualization and deep interactivity. The visualization capabilities provided by depicting the project schedule as a system of interactive nodes bring a wealth of information beyond the traditional Gantt charts used in some processes. Certain exemplary embodiments provide information directly from queries written to automate and filter specific details about project activities. Certain exemplary embodiments can be used as a standalone tool or in conjunction with additional machine instructions built to analyze various aspects of a project schedule.

[0017] Figure 11 is a block diagram of an exemplary embodiment of a system 1000, which may include a smartphone 1300, an information device 1100, a tablet computer 1200, a network 1400, a first server 1500, a second server 1600, a third server 1700, and a fourth server 1800. The first server 1500 may include a first user interface 1520 and may be coupled to a first database 1540. The second server 1600 may include a second user interface 1620 and may be coupled to a second database 1640. The third server 1700 may include a third user interface 1720, a processor 1760, a machine instruction 1780, and may be coupled to a third database 1740. The fourth server 1800 may include a fourth user interface 1820 and may be coupled to a fourth database 1840. Any of the methods and / or steps may be performed in whole or in part by the tablet computer 1200, the smartphone 1300, the information device 1100, and / or the first server 1500. Second server 1600, third server 1700, and / or fourth server 1800 may each be associated with an implementation of a system for planning and / or managing a project. In certain exemplary embodiments, system 1000 may be used to implement one or more methods disclosed herein.

[0018] Figure 2 21 is a flow chart of an exemplary embodiment of method 2000. At activity 2100, the activity of the project is represented as a node of a graph through a set of machine instructions. In some exemplary embodiments, the node of the graph is an interactive node through which the activity of the project is controlled.

[0019] At activity 2200, relationships of items are represented as edges of a graph through a set of machine instructions.

[0020] At activity 2300, one or more relationships between a predecessor activity and a successor activity on a graph are defined through a set of machine instructions. These relationships may include at least one of the following:

[0021] Finish to Start;

[0022] Start to Start;

[0023] Finish to finish; and / or

[0024] Start to finish.

[0025] At activity 2400, the normal distribution and associated p-value may be utilized to:

[0026] Obtaining a first probability of completing the activity within a predetermined time period; and / or

[0027] Get a second probability of completing the activity within the specified budget.

[0028] At activity 2500, a first user interface is presented. The first user interface can indicate a first probability of completing the activity within a predetermined time period.

[0029] In some exemplary embodiments, the first user interface is presented in response to at least one of the following:

[0030] betweenness centrality;

[0031] Graph traversal;

[0032] Pattern matching;

[0033] Distance and path algorithms;

[0034] Proximity;

[0035] Node importance; and / or

[0036] Historical graph evolution tracking; and forecasting.

[0037] At activity 2600, resource allocations are recommended for the project.

[0038] At activity 2700, a machine instruction uses at least one of a lag and a lookahead.

[0039] At activity 2800, progress is automatically determined with a predetermined confidence level.

[0040] At activity 2900, cost risks are automatically determined at a predetermined confidence level.

[0041] At activity 2950, ​​a second user interface is presented. The second user interface may:

[0042] Display the critical path of the project;

[0043] Displays the risk level of the project.

[0044] Shows the probability of achieving project milestones;

[0045] Shows the probability of achieving the project budget target;

[0046] Draw graphs indicating the level of uncertainty along the project path;

[0047] Displays automatically determined joint schedule risk and cost risk at predefined joint confidence levels;

[0048] Displays changed or defined relationship types to adjust project schedule;

[0049] Show the progress of the project updated over time;

[0050] Present project performance indicators through earned value management based on calculations derived from the PERT method;

[0051] Display resources represented as nodes to allow presentation and analysis of labor and non-labor resource allocations;

[0052] Presents the project progress based on forward and backward passes between graph nodes: early start, early finish, late start, late finish, total float (slack time)

[0053] and / or free float time; and

[0054] Shows the "health" of the project progress through quality checks performed or evaluated based on user-defined criteria.

[0055] In certain exemplary embodiments, the set of machine instructions (machine instruction set) is executed on a Neo4j graph database management system.

[0056] In certain exemplary embodiments, the probability of completing a project activity within a predetermined time period is determined in response to machine learning.

[0057] Figure 3 is a block diagram of an exemplary embodiment of an information device 3000, which in certain operational embodiments may include, for example Figure 1 The information device 1100, the tablet computer 1200, the smart phone 1300, and / or the first server 1500. The information device 3000 may include any of a number of circuits and / or components, for example, one or more network interfaces 3100, one or more processors 3200, one or more memories 3300 containing instructions 3400, one or more input / output devices 3500, and / or one or more user interfaces 3600 coupled to the one or more input / output devices 3500, etc.

[0058] In certain exemplary embodiments, through one or more user interfaces 3600 (e.g., a graphical user interface), a user can view a presentation of information related to "researching, designing, modeling, creating, developing, constructing, manufacturing, operating, maintaining, storing, marketing, selling, delivering, selecting, specifying, requesting, ordering, receiving, returning, rating and / or recommending any products, services, methods and / or information described herein."

[0059] Certain exemplary embodiments may utilize any of a variety of graph databases and / or libraries, such as Neo4j, InfiniteGraph (InfiniteGraph is a registered trademark of Objectivity, Inc. located in San Jose, California), igraph (igraph is open source software), NetworkX (NetworkX is a Python library and free software for studying graphs and networks), TIBCO graph database (TIBCO is a registered trademark of TIBCO Software Inc. located in Palo Alto, California), Dgraph Labs (Dgraph is a registered trademark of Dgraph Labs, Inc. located in Houston, Texas), Amazon Neptune (Amazon Neptune is a registered trademark of Amazon Technologies, Inc. located in Seattle, Washington), OrientDB (OrientDB is open source software), TigerGraph (TigerGraph is a registered trademark of TigerGraph, Inc. located in Redwood City, California), and the like.

[0060] Certain exemplary embodiments may utilize any of a variety of query languages, such as the Cypher query language (which is an open source language used with Neo4j), but may be adapted for use with other languages, such as Apache TinkerPop Gremlin (Apache TinkerPop Gremlin is open source software), SPARQL (SPARQL is open source software), Graph Query Language (“GQL”, is open source software), as well as code written in other computing languages, such as Python (Python is open source software), R (R is open source software), and the like.

[0061] Certain exemplary embodiments may utilize alternative graph models, such as a tag property graph model and / or a Resource Description Framework ("RDF") model, among others.

[0062] The labeled attribute graph model is represented by a set of nodes, relations, attributes, and labels. Nodes for both data and associated relations are named, and can store attributes represented as key-value pairs. Nodes can be labeled and / or grouped. Edges representing relations can have two properties: they can have a start node and an end node, and be directed, making the graph a directed graph. Relations can also have attributes. Direct storage of relations allows for essentially constant-time traversal.

[0063] The RDF model is a directed graph consisting of triple statements. An RDF graph statement is represented by: 1) a node representing the subject, 2) an arc from the subject to the object representing the predicate, and 3) a node representing the object. Each of the three parts of a statement can be identified by a uniform resource identifier. An object can also be a literal value.

[0064] definition

[0065] When the following terms are used substantively herein, the accompanying definitions apply. These terms and definitions are presented without prejudice and are consistent with this application, and the right to redefine these terms during the prosecution of this application or any application claiming priority to this application is reserved. For purposes of interpreting the claims of any patent claiming priority to this application, each definition (or redefined term, if the original definition is amended during the prosecution of such patent) serves as a clear and unequivocal disclaimer of subject matter outside of that definition.

[0066] a - At least one.

[0067] Implement - To execute successfully.

[0068] ACID – an acronym for atomicity, consistency, isolation, and durability – defines a set of database transaction properties designed to guarantee that data remains valid despite errors, power failures, and other incidents.

[0069] Activity - an action, behavior, step, and / or process or part thereof.

[0070] Adapt - suitable or appropriate for a particular purpose or situation.

[0071] Adjust - change to a desired state.

[0072] Allocate - The process of allocating something.

[0073] Allow - Position to facilitate action.

[0074] Analyze-Evaluate.

[0075] and / or - combining or replacing.

[0076] Device - An appliance or device used for a specific purpose.

[0077] Associate – connect, join together and / or relate.

[0078] Automatic - To act or operate in a manner that is essentially free from external influence or control. For example, an automatic light switch can turn on when it "sees" a person in its field of vision without the person having to manually operate the light switch.

[0079] Backward pass - A method used to move through a project network diagram in reverse order; the backward pass determines the value of late starts and late finishes so that the duration and / or critical path of the project can be estimated.

[0080] Betweenness Centrality - A graph centrality measure based on shortest paths.

[0081] Budget - A financial plan for a defined time period.

[0082] May - be able to in at least some embodiments.

[0083] Cause - to have an effect.

[0084] Change - make different.

[0085] Closeness - the average length of the shortest paths between a node and all other nodes in the graph.

[0086] Complete - substantially all or everything.

[0087] Includes - includes but is not limited to.

[0088] Confidence - the probability that something will happen.

[0089] Configure - To make it suitable or adaptable for a particular purpose or situation.

[0090] Construct - to manufacture and / or design.

[0091] Control - Direct one or more activities.

[0092] Transform - to shift, adjust and / or change.

[0093] Cost Risk – The risk that a project will cost more than originally estimated and / or budgeted.

[0094] CPM - an acronym for Critical Path Method, is an algorithm for scheduling a set of project activities.

[0095] Create-produce.

[0096] Critical Path - One or more activities that define the longest competing segment of a path, where one or more subsequent activities must occur after one or more preceding activities when there are multiple activities in the critical path.

[0097] Cypher Query Language - A declarative graph query language that allows expressive and efficient querying of data in property graphs.

[0098] Define - establish outline, form, or structure.

[0099] Determine - to obtain, calculate, decide, infer, and / or ascertain.

[0100] Equipment - a machine, article of manufacture and / or collection thereof.

[0101] Distance and Path Algorithm - A method of analyzing graphs of predicted time intervals in one or more predetermined activity sequences.

[0102] Earned Value Management - A method of measuring the actual amount of work completed on a project and forecasting the total project cost and completion date based on trend analysis.

[0103] Often the term "earned value" is defined as "budgeted cost of work performed" or BCWP. This budgeted cost of work performed measure enables project managers to calculate a performance index or burn rate for cost and schedule performance.

[0104] Early Finish / Early Finish - The earliest point in time at which the unfinished portion of an activity (or project) can be completed, based on network logic and any schedule constraints utilizing the critical path method.

[0105] Edge - A model of the relationship between a first activity and a second activity.

[0106] Estimate - to approximately and / or provisionally calculate and / or determine.

[0107] Evaluate - to calculate or estimate.

[0108] Finish-to-Finish (Finish-Finish) - A dependency relationship in which the first activity must be completed before the second activity can be completed.

[0109] Finish to Start (Finish-Start) - A dependency relationship in which the first activity must finish before the second activity can start.

[0110] Forward pass - A method used to move forward through a project network diagram; backward pass determines the duration and / or critical path of a project.

[0111] Free Float - The amount of time a task can be delayed without affecting subsequent tasks.

[0112] Generate – create, produce, cause and / or realize.

[0113] Graph - A mathematical structure used to model pairwise relationships between activities.

[0114] Haptic - involves the human sense of motion and / or the human sense of touch. The multitude of potential tactile experiences includes multiple sensations, sensory differences in body positions, and time-based sensory changes that are sensed at least in part in non-visual, non-auditory, and non-olfactory ways, including haptic touch (being touched), active touch, grasping, pressure, friction, traction, sliding, stretching, force, torque, impact, penetration, vibration, motion, acceleration, jerk, pulse, direction, limb position, gravity, texture, gap, depression, viscosity, pain, itch, humidity, temperature, thermal conductivity, and heat capacity.

[0115] Historical Graphical Evolution Tracking - A record of how the organization of potential project activities has changed over time.

[0116] Importance - A measure of the importance of an activity in a project.

[0117] Show - indicate.

[0118] Information device - any device capable of processing data and / or information, such as any general and / or special purpose computer, such as a personal computer, workstation, server, minicomputer, mainframe, supercomputer, computer terminal, laptop, wearable computer and / or personal digital assistant (PDA), mobile terminal, Bluetooth device, communicator, "smart" phone (such as Treo type device), message service (such as Blackberry) receiver, pager, fax machine, cellular phone, traditional phone, telephone equipment, program microprocessor or microcontroller and / or peripheral integrated circuit components, ASIC or other integrated circuits, hardware electronic logic circuit (such as discrete component circuit) and / or programmable logic device (such as PLD, PLA, FPGA or PAL, etc.). In general, any device that has a finite state machine capable of utilizing at least a portion of the methods, structures and / or graphical user interfaces described herein can be used as an information device. An information device may include components such as one or more network interfaces, one or more processors, one or more memories containing instructions and / or one or more input / output (I / O) devices, one or more user interfaces coupled to the I / O devices, etc.

[0119] Initialize - prepare something for use and / or some future event.

[0120] Input / Output (I / O) Device - any sensory-oriented input and / or output device, such as audio, visual, tactile, olfactory and / or taste-oriented devices, including, for example, monitors, displays, projectors, overhead displays, keyboards, keypads, mice, trackball joysticks, game controllers, steering wheels, touch pads, touch panels, pointing devices, microphones, speakers, camcorders, cameras, scanners, printers, tactile devices, vibrators, tactile simulators and / or touch pads, and may include ports to which I / O devices can be attached or connected.

[0121] Integrated Cost and Schedule Risk Analysis - A method that utilizes project cost information and that provides: (1) more accurate cost estimates than those that ignore or only partially incorporate schedule risk, and (2) an indication of the significance of schedule risk to cost risk when the duration of activities using labor-type (time-dependent) resources is at risk.

[0122] Interaction - Pertaining to the actions that occur between a user and an information device through a user interface.

[0123] Hard logic - Planning rules that specify tasks that must be completed before subsequent tasks can begin.

[0124] Health - An assessment of the project schedule to determine (1) whether any tasks are missing predecessors or successors; (2) whether any hard constraints exist; (3) whether any out-of-sequence activities exist; and / or (4) whether any relationship type issues exist in the project schedule.

[0125] Joint Confidence Interval - A process in integrated cost and schedule risk analysis used to estimate the likelihood that both cost and schedule will meet a certain confidence level; the process combines the project's cost, schedule, and risk into a complete picture.

[0126] Joint Confidence Level - A confidence level that reflects the project's cost and schedule risks.

[0127] Joint Schedule Risk - The possibility of not meeting the schedule and the impact of such failure.

[0128] Labor / Labor - Work performed by people.

[0129] Lag - occurs later in time.

[0130] Late Finish - The latest time an activity can be completed without delaying the completion of the project.

[0131] Late Start - The latest time an activity can begin without affecting the planned project finish date.

[0132] Ahead of time - happening earlier.

[0133] Risk Grade / Risk Level – The possibility that the required process may not be completed.

[0134] Logic-a

[0135] Machine Instructions - instructions suitable for causing a machine (e.g., an information device) to perform one or more specific activities, operations, or functions. These instructions may sometimes form an entity referred to as a "processor," "kernel," "operating system," "program," "application," "utility," "subroutine," "script," "macro," "file," "project," "module," "library," "class," and / or "object," and may be embodied as machine code, source code, object code, compiled code, assembled code, interpretable code, and / or executable code, etc., in hardware, firmware, and / or software.

[0136] Machine learning - algorithms used by information devices in order to efficiently perform specific tasks without the use of explicit instructions, but instead relying on patterns and reasoning. It is considered a form of artificial intelligence.

[0137] Machine-readable medium - a physical structure from which a machine can retrieve data and / or information. Examples include memory, punch cards, etc.

[0138] May - be allowed and / or permitted in at least some embodiments.

[0139] Storage device - a device capable of storing analog or digital information (e.g., instructions and / or data). Examples include non-volatile memory, volatile memory, random access memory, RAM, read-only memory, ROM, flash memory, magnetic media, hard disk, floppy disk, tape, optical media, optical disk, CD, digital versatile disk, DVD, and / or RAID array, etc. The storage device may be coupled to a processor and / or may store instructions suitable for execution by the processor, e.g., according to embodiments disclosed herein.

[0140] Method - A process, procedure, and / or collection of related activities used to accomplish something.

[0141] Milestones – important points of progress in a process.

[0142] Neo4j Graph Database Management System - ACID-compliant transactional database with native graph storage and processing capabilities from Neo4j, Inc., a San Mateo, California-based company.

[0143] Network - a plurality of nodes coupled in communication. A network may be and / or utilize any of a variety of subnetworks, such as circuit switched, public switched, packet switched, data, telephone, telecommunications, video distribution, cable, terrestrial, broadcast, satellite, broadband, enterprise, global, national, regional, wide area, backbone, packet switched TCP / IP, Fast Ethernet, Token Ring, public Internet, private, ATM, multi-domain and / or multi-regional subnetworks, one or more Internet service providers, and / or one or more information devices, such as switches, routers, and / or gateways that are not directly connected to a local area network, etc.

[0144] Network Interface - Any device, system, or subsystem capable of coupling an information device to a network. For example, a network interface may be a telephone, cellular phone, cellular modem, telephone data modem, fax modem, wireless transceiver, Ethernet card, cable modem, digital subscriber line interface, bridge, hub, router, or other similar device.

[0145] Node - A point on a graph that represents project activity.

[0146] Non-Labor / Non-Labor - Work performed in some way that does not use human labor.

[0147] Normal distribution - a type of continuous probability distribution of a real-valued random variable; the probability density function is:

[0148]

[0149] Where μ is the mean of the distribution and σ is the square root of the standard deviation of the distribution.

[0150] Get – receive or ascertain.

[0151] p-value - the probability of obtaining a test result that is at least as extreme as the result actually observed (as extreme as possible), assuming the null hypothesis is true.

[0152] Pattern matching - comparing a given sequence of activities to a known or predicted sequence of activities.

[0153] Execute - To complete something.

[0154] Performance - Activity. Performance can be measured by indicating the characteristics of the activity.

[0155] PERT - an acronym for "Project Evaluation and Review Technique", is a statistical tool used in project management designed to analyze and represent the tasks involved in completing a given project.

[0156] Plural / Multiple – The state of being plural and / or more than one.

[0157] Predetermined - established in advance.

[0158] Predict - Make predictions based on observation, experience, and / or scientific reasoning.

[0159] Probability - A quantitative expression of the likelihood of an event occurring.

[0160] Processor-a device and / or a machine-readable instruction set for performing one or more predetermined tasks. The processor may include any one or a combination of hardware, firmware and / or software. The processor may utilize mechanical, pneumatic, hydraulic, electrical, magnetic, optical, information, chemical and / or biological principles, signals and / or inputs to perform tasks. In some embodiments, the processor may act on information by manipulating, analyzing, modifying, converting, transmitting information for use by executable programs and / or information devices, and / or routing information to output devices. The processor may be used as a central processing unit, a local controller, a remote controller, a parallel controller and / or a distributed controller, etc. Unless otherwise specified, the processor may be a general-purpose device, such as a microcontroller and / or a microprocessor, such as a Pentium IV series microprocessor manufactured by Intel Corporation of Santa Clara, California. In some embodiments, the processor may be a dedicated device, such as an application-specific integrated circuit (ASIC) or a field programmable gate array (FPGA), which is designed to implement at least a portion of the embodiments disclosed herein in its hardware and / or firmware.

[0161] Project - A planned undertaking that includes multiple activities.

[0162] Provide - offer, supply, give and / or make available.

[0163] Quality checks - tests to determine if the project is on track.

[0164] Query - A precise request to retrieve information from a project management database.

[0165] Receive - to obtain, get, acquire and / or obtain in the form of a signal.

[0166] Recommend – To give advice, praise, commendation and / or approval.

[0167] Relate - connect and / or relate.

[0168] Relationship - a connection and / or association between a first activity and a second activity.

[0169] Present - make perceptible to humans, e.g., as data, commands, text, graphics, audio, video, animation, and / or hyperlinks, etc., e.g., by any visual, audio, and / or tactile means, e.g., by a display, monitor, electronic paper, eye implant, cochlear implant, speaker, etc.

[0170] Repeatedly - over and over again; repeatedly.

[0171] Representation - is specified in a particular model, which is contained in a particular machine instruction set.

[0172] Request - express a desire and / or request.

[0173] Resources - assets used during the project.

[0174] Resource Allocation - Assign assets to tasks.

[0175] Schedule / Timetable - A program plan indicating the timing for providing one or more services.

[0176] Choose - To make a choice from among alternatives.

[0177] Collection - A related plurality.

[0178] Signal - information, such as machine instructions for an activity and / or one or more letters, words, characters, symbols, signal signs, visual displays and / or special sounds, etc., with predetermined meanings, encoded as automatically detectable changes in physical variables, such as pneumatic, hydraulic, acoustic, fluid, mechanical, electrical, magnetic, optical, chemical and / or biological variables, such as power, energy, pressure, flow rate, viscosity, density, torque, impact, force, frequency, phase, voltage, current, resistance, magnetomotive force, magnetic field strength, magnetic field flux, magnetic flux density, magnetic reluctance, magnetic permeability, refractive index, light wavelength, polarization, reflectivity, transmittance, phase shift, concentration and / or temperature, etc. Depending on the context, the signal and / or the information encoded therein can be synchronous, asynchronous, hard real time, soft real time, non-real time, continuously generated, continuously changing, analog, discretely generated, discretely changing, quantized, digital, broadcast, multicast, unicast, transmitted, transmitted, received, continuously measured, discretely measured, processed, encoded, encrypted, multiplexed, modulated, spread, despread, demodulated, detected, demultiplexed, decrypted and / or decoded, etc.

[0179] Slack - The time interval in a project network that a task can be delayed without delaying subsequent tasks or the entire project.

[0180] Soft logic - Planning rules that specify tasks that can be performed in any order but must be dependent on another task.

[0181] Specify - Included in the description of the work to be done.

[0182] Start-to-Finish (Start-Finish) - A dependency relationship in which the first activity must start before the second activity can finish.

[0183] Start-to-Start (Start-to-Start) - A dependency relationship in which the first activity must start before the second activity can start.

[0184] Store - To place, save and / or retain data, usually in memory.

[0185] In essence - to a large extent.

[0186] System - a collection of mechanisms, devices, machines, articles of manufacture, processes, data, and / or instructions designed to perform one or more specific functions.

[0187] Goal - objective thing.

[0188] Time – the moment when something happens.

[0189] Time period - time interval.

[0190] Total Float - The amount of time a task can be delayed without affecting the overall project completion time.

[0191] Transmit - to send, provide, furnish and / or supply as a signal.

[0192] Traversal - Pertaining to modeling movement along a path in a drawing.

[0193] Type - A number of things that share common characteristics or properties that distinguish them as a group or class.

[0194] Uncertainty level - the probability that something may not occur.

[0195] Update - Change.

[0196] User interface-any device for presenting information to a user and / or requesting information from a user. A user interface includes at least one of text, graphics, audio, video, animation and / or tactile elements. Text elements may be provided by, for example, a printer, a monitor, a display, a projector, etc. Graphic elements may be provided by, for example, a monitor, a display, a projector and / or a visual indicator device (e.g., a light, a flag, a beacon, etc.). Audio elements may be provided by, for example, a speaker, a microphone and / or other sound generation and / or receiving devices. Video elements or animation elements may be provided by, for example, a monitor, a display, a projector and / or other visual devices. Tactile elements may be provided by, for example, very low frequency speakers, vibrators, tactile stimulators, tactile pads, simulators, keyboards, keypads, mice, trackball joysticks, game controllers, rollers, touch pads, touch panels, pointing devices and / or other tactile devices, etc. A user interface may include one or more text elements, such as one or more letters, numbers, symbols, etc. The user interface may include one or more graphical elements, such as images, pictures, drawings, icons, windows, title bars, panels, worksheets, tabs, drawers, matrices, tables, forms, calendars, outline views, frames, dialog boxes, static text, text boxes, lists, selection lists, pop-up lists, drop-down lists, menus, toolbars, docks, check boxes, radio buttons, hyperlinks, browsers, buttons, controls, color palettes, preview panels, color wheels, dials, sliders, scroll bars, cursors, status bars, steppers, and / or progress indicators, etc. The text and / or graphical elements may be used to select, program, adjust, change, specify appearance, background color, background style, border style, border thickness, foreground color, font, font style, font size, alignment, line spacing, indentation, maximum data length, validation, query, cursor type, pointer type, automatic resizing, position, and / or size, etc. The user interface may include one or more audio elements, such as a volume control, pitch control, speed control, voice selector, and / or one or more elements for controlling audio playback, speed, pause, fast forward, rewind, etc. The user interface may include one or more video elements, such as elements that control video playback, speed, pause, fast forward, rewind, zoom in, zoom out, rotate, and / or tilt, etc. The user interface may include one or more animation elements, such as elements that control animation playback, pause, fast forward, rewind, zoom in, zoom out, rotate, tilt, color, intensity, speed, frequency, appearance, etc. The user interface may include one or more tactile elements, such as elements that utilize tactile stimulation, force, pressure, vibration, motion, displacement, temperature, etc.

[0197] via (through) - through and / or by means of.

[0198] Weight - A value indicating importance.

[0199] Notice

[0200] By reading the detailed description and / or accompanying drawings of certain exemplary embodiments described above and / or included herein, those skilled in the art will readily understand other substantially and specifically practical and useful embodiments. It should be understood that there may be many variations, modifications and additional embodiments, and therefore, all such variations, modifications and embodiments should be considered within the scope of this application.

[0201] Therefore, regardless of the contents of any part of this application (e.g., title, field, background, summary, specification, abstract, drawings, etc.), unless expressly provided to the contrary, such as by explicit definition, assertion, or argument, with respect to any claim, whether of this application and / or any application claiming priority to this application, whether originally filed or otherwise:

[0202] It is not required to include any specifically described or illustrated features, functions, activities or elements, any specific sequence of activities, or any specific interrelationship of elements;

[0203] No feature, function, activity or element is “essential”;

[0204] Any element can be integrated, separated and / or repeated;

[0205] any activity may be repeated, any activity may be performed by multiple entities, and / or any activity may be performed in multiple jurisdictions; and

[0206] Any activity or element may be explicitly excluded, the order of activities may be varied, and / or the interrelationships between elements may be varied.

[0207] In addition, when any number or range is described herein, unless otherwise expressly stated, the number or range is an approximate value. When any range is described herein, unless otherwise expressly stated, the range includes all values ​​therein and all subranges therein. For example, if a range of 1 to 10 is described, the range includes all values ​​therein, such as 1.1, 2.5, 3.335, 5, 6.179, 8.9999, etc., and includes all subranges therein, such as 1 to 3.65, 2.8 to 8.14, 1.93 to 9, etc.

[0208] When any claim element is followed by a reference sign, that reference sign is exemplary and does not limit the claim scope.No claim in this application is intended to invoke 35 USC 112, paragraph 6, unless the precise phrase "means for" is followed by a gerund.

[0209] Any information in any material (e.g., U.S. patents, U.S. patent applications, books, articles, etc.), if incorporated herein by reference, is incorporated by reference only to the extent that there is no conflict between such information and the other statements and drawings described herein. If such a conflict arises, including a conflict that would invalidate or seek priority for any claim herein, any such conflicting information in such material is expressly not incorporated by reference herein.

[0210] Therefore, each part of this application (e.g., title, field, background, summary, specification, abstract, drawings, etc.), except the claims themselves, should be construed as illustrative and not restrictive, and the scope of the subject matter protected by any patent issued based on this application shall be limited solely by the claims of that patent.

Claims

1. A method, characterized in that The method comprises: Through a set of machine instructions: Represent the project's activities as nodes of a graph; Represent the relationships of items as edges of a graph; deriving a first probability of completing the activity within a first predetermined time period using a normal distribution and an associated p-value; and A first user interface is presented that indicates a first probability of completing an activity within a first predetermined time period.

2. The method according to claim 1, characterized in that The method further comprises: The normal distribution and associated p-value are used to obtain a second probability of completing the activity within the specified budget.

3. The method according to claim 1, characterized in that The method further comprises: One or more relationships between the predecessor activity and the successor activity are defined graphically, including at least one of the following: Finish-Start; start-begin; Finished – Completed; and Start-Finish.

4. The method according to claim 1, characterized in that The method further comprises: At least one of a lag and a lookahead is utilized by a machine instruction.

5. The method according to claim 1, characterized in that The method further comprises: A second user interface is presented that displays a critical path for the project.

6. The method according to claim 1, characterized in that The method further comprises: A second user interface is presented that displays the project risk level.

7. The method according to claim 1, characterized in that The method further comprises: A second user interface is presented that displays the probability of achieving the project milestone.

8. The method according to claim 1, characterized in that The method further comprises: A second user interface is presented that displays the probability of achieving the project budget goal.

9. The method according to claim 1, characterized in that: The method further comprises: Recommend resource allocations for projects.

10. The method of claim 1, characterized in that The method further comprises: Automatically determine schedule risks at a predetermined confidence level.

11. The method of claim 1, characterized in that The method further comprises: Automatically determine cost risks at a predetermined confidence level.

12. The method of claim 1, characterized in that The method further comprises: Draw a graph indicating the level of uncertainty along the project path.

13. The method of claim 1, characterized in that: This set of machine instructions is executed on the Neo4j graph database management system.

14. The method of claim 1, characterized in that: A second probability of completing the activity of the project within a second predetermined time period is determined in response to the machine learning.

15. The method of claim 1, characterized in that: The nodes of the graph are interactive nodes, through which the activity of the project is controlled.

16. The method of claim 1, characterized in that: The first user interface is presented in response to at least one of the following: betweenness centrality; Graph traversal; Pattern matching; Distance and path algorithms; Proximity; Node importance; and Historical graph evolution tracking; and forecasting.

17. The method of claim 1, characterized in that The method further comprises: Automatically determine joint schedule and cost risks at predetermined joint confidence levels.

18. The method of claim 1, characterized in that The method further comprises: Change or define relationship types to adjust the schedule of your project.

19. The method of claim 1, characterized in that The method further comprises: Update the progress of the project over time.

20. The method of claim 1, characterized in that The method further comprises: Project performance indicators are presented through earned value management based on calculations derived from the PERT methodology.

21. The method of claim 1, characterized in that The method further comprises: Represent resources as nodes to allow presentation and analysis of labor and non-labor resource allocations.

22. The method of claim 1, characterized in that The method further comprises: Presents the progress of a project based on forward and backward passes between graph nodes to determine: early start, early finish, late start, late finish, total float (slack), and free float.

23. The method of claim 1, characterized in that The method also includes performing a quality check or assessing the "health" of the project's progress based on user-defined criteria.

Images