Digital processing systems and methods for managing sprints using linked electronic boards

Information

  • Patent Grant
  • 11829953
  • Patent Number
    11,829,953
  • Date Filed
    Friday, December 30, 2022
    a year ago
  • Date Issued
    Tuesday, November 28, 2023
    7 months ago
Abstract
Systems, methods, and computer-readable media for managing a plurality of sprints using a plurality of electronically linked boards are disclosed. A low-level board with rows and columns is generated, containing sprint-related function data associated with the plurality of sprints. At least one internal column and at least one external column are generated on the low-level board, for linking to an associated high-level board. Group-by controls are presented, and in response to activation of an internal control, rows on the low-level are organized board into first groups based on common internal column data. In response to activation of the external control, rows on the low-level board are reorganized into second groups by common external column data. Links to the at least one associated high-level board are accessed on the low-level board, and data from the at least one associated high-level board is extracted and imported onto the low-level board.
Description

The present disclosure relates to systems and methods for collaborative work systems. More particularly, disclosed systems and methods provide improvements in collaborative software development systems, providing controls for organizing and visualizing data in one or more databases.


BACKGROUND

Operation of modern enterprises can be complicated and time consuming. In many cases, managing the operation of a single project requires integration of several employees, departments, and other resources of the entity. To manage the challenging operation, project management software applications may be used. Such software applications allow a user to organize, plan, and manage resources by providing project-related information in order to optimize the time and resources spent on each project. It would be useful to improve these software applications to increase operation management efficiency.


Software development often involves different methodologies or frameworks depending on the use case and needs of the software product. Scrums and other project management techniques may assist in managing software development and completion of features within a project. Agile methods of management may include scrums, or iterative, incremental frameworks for developing and sustaining products. Software development may include sprints to manage work for development teams. Sprints, which may be an iterative timeframe for development, may be used across a variety of tasks or goals for a project or multiple projects. As such, it may be beneficial to utilize tools to track and assist teams with tasks and sprints.


In some examples, data boards or tables may contain various information regarding software development, including data about tasks and sprints of a project. Sometimes, such boards and tables may be difficult to set up for use with sprints because, for example, data may be presented in a manner which may not capture all the details of the statuses of sprints. Software sprints may be difficult to scale and manage a complex variety of tasks and sprints across projects. For example, users of a software management tool may experience difficulty in building a sprint framework. The sprint framework may not display sprint data in an efficient or effective manner. Difficulty in associating tasks and project data with different sprints may lead to overcomplicated boards that may be difficult for a user to operate. Improvements in sprint management tools are desirable to address these technical drawbacks.


SUMMARY

Consistent with disclosed embodiments, systems, methods, and computer readable media for performing operations for managing a plurality of sprints using a plurality of electronically linked boards. The at least one processor may perform operations comprising generating a low-level board with rows and columns, the rows and columns for containing sprint-related function data associated with the plurality of sprints. The at least one processor may perform operations comprising generating at least one internal column and at least one external column on the low-level board, the at least one external column for containing links to at least one associated high-level board. The at least one processor may perform operations comprising presenting an activatable internal group-by control, presenting an activatable external group-by control, receiving a first indication of activation of the internal group-by control, and in response to the first indication, organizing rows on the low-level board into first groups based on common internal column data. The at least one processor may perform operations comprising receiving a second indication of activation of the external group-by control, and in response to the second indication, reorganizing rows on the low-level board into second groups by common external column data, accessing on the low-level board, the links to the at least one associated high-level board, extracting data from the at least one associated high-level board, and importing the extracted data onto the low-level board.


Consistent with disclosed embodiments, systems, methods, and computer readable media for managing at least one task across a plurality of workflow management boards based on electronic data value changes across the plurality of workflow management boards are disclosed. The method may comprise generating a low-level board with rows and columns, the rows and columns for containing sprint-related function data associated with a plurality of sprints. The method may comprise generating at least one internal column and at least one external column on the low-level board, the at least one external column for containing links to at least one associated high-level board. The method may comprise presenting an activatable internal group-by control, presenting an activatable external group-by control, receiving a first indication of activation of the internal group-by control, and in response to the first indication, organizing rows on the low-level board into first groups based on common internal column data. The method may comprise receiving a second indication of activation of the external group-by control, and, in response to the second indication, reorganizing rows on the low-level board into second groups by, common external column data, accessing on the low-level board, the links to the at least one associated high-level board, extracting data from the at least one associated high-level board, and importing the extracted data onto the low-level board.


Consistent with disclosed embodiments, systems, methods, and computer readable media for managing at least one task across a plurality of workflow management boards based on electronic data value changes across the plurality of workflow management boards are disclosed. Systems, methods, devices, and non-transitory computer readable media may comprise at least one processor. The at least one processor may be configured to generate a low level board with rows and columns, the rows and columns for containing sprint-related function data associated with a plurality of sprints. The at least one processor may be configured to generate at least one internal column and at least one external column on the low-level board, the at least one external column for containing links to at least one associated high-level board. The at least one processor may be configured to present an activatable internal group-by control, present an activatable external group-by control, receive a first indication of activation of the internal group-by control, in response to the first indication, organize rows on the low-level board into first groups based on common internal column data. The at least one processor may be configured to receive a second indication of activation of the external group-by control, and in response to the second indication, reorganize rows on the low-level board into second groups by common external column data, access on the low-level board, the links to the at least one associated high-level board, extract data from the at least one associated high-level board, and, import the extracted data onto the low-level board.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 87-1 is a flowchart of an exemplary workflow method for managing a plurality of sprints, consistent with disclosed embodiments.



FIG. 87-2 illustrates an example of a low-level board, consistent with some disclosed embodiments.



FIG. 87-3 illustrates an example of a high-level board, consistent with some disclosed embodiments.



FIG. 87-4 illustrates an example of a group-by control, consistent with some disclosed embodiments.



FIG. 87-5 illustrates an example of a low-level board, consistent with some disclosed embodiments.



FIG. 87-6 illustrates an example of a low-level board, consistent with some disclosed embodiments.



FIG. 87-7 is a block diagram of an exemplary computing device which may be employed in connection with disclosed embodiments.



FIG. 87-8 is a block diagram of an exemplary computing architecture for collaborative work systems, consistent with disclosed embodiments.



FIG. 87-9 illustrates an example of an electronic collaborative word processing document, consistent with disclosed embodiments.





DETAILED DESCRIPTION

Exemplary embodiments are described with reference to the accompanying drawings. The figures are not necessarily drawn to scale. While examples and features of disclosed principles are described herein, modifications, adaptations, and other implementations are possible without departing from the spirit and scope of the disclosed embodiments. Also, the words “comprising,” “having,” “containing,” and “including,” and other similar forms are intended to be equivalent in meaning and be open ended in that an item or items following any one of these words is not meant to be an exhaustive listing of such item or items, or meant to be limited to only the listed item or items. It should also be noted that as used herein and in the appended claims, the singular forms “a,” “an,” and “the” include plural references unless the context clearly dictates otherwise.


In the following description, various working examples are provided for illustrative purposes. However, is to be understood the present disclosure may be practiced without one or more of these details.


Throughout, this disclosure mentions “disclosed embodiments,” which refer to examples of inventive ideas, concepts, and/or manifestations described herein. Many related and unrelated embodiments are described throughout this disclosure. The fact that some “disclosed embodiments” are described as exhibiting a feature or characteristic does not mean that other disclosed embodiments necessarily share that feature or characteristic.


This disclosure presents various mechanisms for collaborative work systems. Such systems may involve software that enables multiple users to work collaboratively. By way of one example, workflow management software may enable various members of a team to cooperate via a common online platform. It is intended that one or more aspects of any mechanism may be combined with one or more aspect of any other mechanisms, and such combinations are within the scope of this disclosure.


This disclosure is constructed to provide a basic understanding of a few exemplary embodiments with the understanding that features of the exemplary embodiments may be combined with other disclosed features or may be incorporated into platforms or embodiments not described herein while still remaining within the scope of this disclosure. For convenience, and form of the word “embodiment” as used herein is intended to refer to a single embodiment or multiple embodiments of the disclosure.


Certain embodiments disclosed herein include devices, systems, and methods for collaborative work systems that may allow a user to interact with information in real time. To avoid repetition, the, functionality of some embodiments is described herein solely in connection with a processor or at least one processor. It is to be understood that such exemplary descriptions of functionality apply equally to methods and computer readable media and constitutes a written description of systems, methods, and computer readable media. The underlying platform may allow a user to structure a systems, methods, or computer readable media in many ways using common building blocks, thereby permitting flexibility in constructing a product that suits desired needs. This may be accomplished through the use of boards. A board may be a table configured to contain items (e.g., individual items presented in horizontal rows) defining objects or entities that are managed in the platform (task, project, client, deal, etc.). Unless expressly noted otherwise, the terms “board” and “table” may be considered synonymous for purposes of this disclosure. In some embodiments, a board may contain information beyond which is displayed in a table. Boards may include sub-boards that may have a separate structure from a board, Sub-boards may be tables with sub-items that may be related to the items of a board, Columns intersecting with rows of items may together define cells in which data associated with each item may be maintained. Each column may have a heading or label defining an associated data type. When used herein in combination with a column, a row may be presented horizontally and a column vertically. However, in the broader generic sense as used herein, the term “row” may refer to one or more of a horizontal and/or a vertical presentation. A table or tablature as used herein, refers to data presented in horizontal and vertical rows, (e.g., horizontal rows and vertical columns) defining cells in which data is presented. Tablature may refer to any structure for presenting data in an organized manner, as previously discussed, such as cells presented in horizontal rows and vertical columns, vertical rows and horizontal columns, a tree data structure, a web chart, or any other structured representation, as explained throughout this disclosure. A cell may refer to a unit of information contained in the tablature defined by the structure of the tablature. For example, a cell may be defined as an intersection between a horizontal row with a vertical column in a tablature having rows and columns. A cell may also be defined as an intersection between a horizontal and a vertical row, or as an intersection between a horizontal and a vertical column. As a further example, a cell may be defined as a node on a web chart or a node on a tree data structure. As would be appreciated by a skilled artisan, however, the disclosed embodiments are not limited to any specific structure, but rather may be practiced in conjunction with any desired organizational arrangement. In addition, tablature may include any, type of information, depending on intended use. When used in conjunction with a workflow management application, the tablature may include any information associated with one or more tasks, such as one or more status values, projects, countries, persons, teams, progress statuses, a combination thereof, or any other information related to a task.


While a table view may be one way to present and manage the data contained on a board, a table's or board's data may be presented in different ways. For example, in some embodiments, dashboards may be utilized to present or summarize data derived from one or more boards. A dashboard may be a non-table form of presenting data, using, for example, static or dynamic graphical representations. A dashboard may also include multiple non-table forms of presenting data. As discussed later in greater detail, such representations may include various forms of graphs or graphics. In some instances, dashboards (which may also be referred to more generically as “widgets”) may include tablature. Software links may interconnect one or more boards with one or more dashboards thereby enabling the dashboards to reflect data presented on the boards. This may allow, for example, data from multiple boards to be displayed and/or managed from a common location. These widgets may provide visualizations that allow a user to update data derived from one or more boards.


Boards (or the data associated with boards) may be stored in a local memory on a user device or may be stored in a local network repository. Boards may also be stored in a remote repository and may be accessed through a network. In some instances, permissions may be set to limit board access to the board's “owner” while in other embodiments a user's board may be accessed by other users through any of the networks described in this disclosure. When one user makes a change in a hoard, that change may be updated to the board stored in a memory or repository and may be pushed to the other user devices that access that same board. These changes may be made to cells, items, columns, boards, dashboard views, logical rules, or any other data associated with the boards. Similarly, when cells are tied together or are mirrored across multiple hoards, a change in one board may cause a cascading change in the tied or mirrored boards or dashboards of the same or other owners.


Boards and widgets may be part of a platform that may enable users to interact with information in real time in collaborative work systems involving electronic collaborative word processing documents. Electronic collaborative word processing documents (and other variations of the term) as used herein are not limited to only digital files for word processing, but may include any other processing document such as presentation slides, tables, databases, graphics, sound files, video files or any other digital document or file. Electronic collaborative word processing documents may include any digital file that may provide for input, editing, formatting, display, and/or output of text, graphics, widgets, objects, tables, links, animations, dynamically updated elements, or any other data object that may be used in conjunction with the digital file. Any information stored on or displayed from an electronic collaborative word processing document may be organized into blocks. A block may include any organizational unit of information in a digital file, such as a single text character, word, sentence, paragraph, page, graphic, or any combination thereof. Blocks may include static or dynamic information, and may be linked to other sources of data for dynamic updates. Blocks may be automatically organized by the system, or may be manually selected by a user according to preference. In one embodiment, a user may select a segment of any information in an electronic word processing document and assign it as a particular block for input, editing, formatting, or any other further configuration.


An electronic collaborative word processing document may be stored in one or more repositories connected to a network accessible by one or more users through their computing devices. In one embodiment, one or more users may simultaneously edit an electronic collaborative word processing document. The one or more users may access the electronic collaborative word processing document through one or more user devices connected to a network. User access to an electronic collaborative word processing document may be managed through permission settings set by an author of the electronic collaborative word processing document. An electronic collaborative word processing document may include graphical user interface elements enabled to support the input, display, and management of multiple edits made by multiple users operating simultaneously within the same document.


Various embodiments are described herein with reference to a system, method, device, or computer readable medium. it is intended that the disclosure of one is a disclosure of all. For example, it is to be understood that disclosure of a computer readable medium described herein also constitutes a disclosure of methods implemented by the computer readable medium, and systems and devices for implementing those methods, via for example, at least one processor. It is to be understood that this form of disclosure is for ease of discussion only, and one or more aspects of one embodiment herein may be combined with one or more aspects of other embodiments herein, within the intended scope of this disclosure.


Embodiments described herein may refer to a non-transitory computer readable medium containing instructions that when executed by at least one processor, cause the at least one processor to perform a method. Non-transitory computer readable mediums may be any medium capable of storing data in any memory in a way that may be read by any computing device with a processor to carry out methods or any other instructions stored in the memory. The non-transitory computer readable medium may be implemented as hardware, firmware, software, or any combination thereof. Moreover, the software may preferably be implemented as an application program tangibly embodied on a program storage unit or computer readable medium consisting of parts, or of certain devices and/or a combination of devices. The application program may be uploaded to, and executed by, a machine comprising any suitable architecture. Preferably, the machine may be implemented on a computer platform having hardware such as one or more central processing units (“CPUs”), a memory, and input/output interfaces. The computer platform may also include an operating system and microinstruction code. The various processes and functions described in this disclosure may be either part of the microinstruction code or part of the application program, or any combination thereof, which may be executed by a CPU, whether or not such a computer or processor is explicitly shown. In addition, various other peripheral units may be connected to the computer platform such as an additional data storage unit and a printing unit. Furthermore, a non-transitory computer readable medium may be any computer readable medium except for a transitory propagating signal.


As used herein, a non-transitory computer-readable storage medium refers to any type of physical memory on which information or data readable by at least one processor can be stored. Examples of memory include Random Access Memory (RAM), Read-Only Memory (ROM), volatile memory, nonvolatile memory, hard drives, CD ROMs, DVDs, flash drives, disks, any other optical data storage medium, any physical medium with patterns of holes, markers, or other readable elements, a PROM, an EPROM, a FLASH-EPROM or any other flash memory, NVRAM, a cache, a register, any other memory chip or cartridge, and networked versions of the same. The terms “memory” and “computer-readable storage medium” may refer to multiple structures, such as a plurality of memories or computer-readable storage mediums located within an input unit or at a remote location. Additionally, one or more computer-readable storage mediums can be utilized in implementing a computer-implemented method. The memory may include one or more separate storage devices collocated or disbursed, capable of storing data structures, instructions, or any other data. The memory may further include a memory portion containing instructions for the processor to execute. The memory may also be used as a working scratch pad for the processors or as a temporary storageAccordingly, the term computer-readable storage medium should be understood to include tangible items and exclude carrier waves and transient signals.


Some embodiments may involve at least one processor. Consistent with disclosed embodiments, “at least one processor” may constitute any physical device or group of devices having electric circuitry that performs a logic operation on an input or inputs. For example, the at least one processor may include one or more integrated circuits (IC), including application-specific integrated circuit (ASIC), microchips, microcontrollers, microprocessors, all or part of a central processing unit (CPU), graphics processing unit (GPU), digital signal processor (DSP), field-programmable gate array (FPGA), server, virtual server, or other circuits suitable for executing instructions or performing logic operations. The instructions executed by at least one processor rimy, for example, be pre-loaded into a memory integrated with or embedded into the controller or may be stored in a separate memory. The memory may include a Random Access Memory (RAM), a Read-Only Memory (ROM), a hard disk, an optical disk, a magnetic medium, a flash memory, other permanent, fixed, or volatile memory, or any other mechanism capable of storing instructions. In some embodiments, the at least one processor may include more than one processor. Each processor may have a similar construction or the processors may be of differing constructions that are electrically connected or disconnected from each other. For example, the processors may be separate circuits or integrated in a single circuit. When more than one processor is used, the processors may be configured to operate independently or collaboratively, and may be co-located or located remotely from each other. The processors may be coupled electrically, magnetically, optically, acoustically, mechanically or by other means that permit them to interact.


Consistent with the present disclosure, disclosed embodiments may involve a network. A network may constitute any type of physical or wireless computer networking arrangement used to exchange data. For example, a network may be the Internet, a private data network, a virtual private network using a public network, a Wi-Fi network, a LAN or WAN network, a combination of one or more of the forgoing, and/or other suitable connections that may enable information exchange among various components of the system. In sonic embodiments, a network may include one or more physical links used to exchange data, such as Ethernet, coaxial cables, twisted pair cables, fiber optics, or any other suitable physical medium for exchanging data. A network may also include a public switched telephone network (“PSTN”) and/or a wireless cellular network. A network may be a secured network or unsecured network. In other embodiments, one or more components of the system may communicate directly through a dedicated communication network. Direct communications may use any suitable technologies, including, for example, BLUETOOTH™, BLUETOOTH LE™ (BLE), Wi-Fi, near field communications (NFC), or other suitable communication methods that provide a medium for exchanging data and/or information between separate entities.


Certain embodiments disclosed herein may also include a computing device for generating features for work collaborative systems, the computing device may include processing circuitry communicatively connected to a network interface and to a memory, therein the memory contains instructions that, when executed by the processing circuitry, configure the computing device to receive from a user device associated with a user account instruction to generate a new column of a single data type for a first data structure, wherein the first data structure may be a column oriented data structure, and store, based on the instructions, the new column within the column-oriented data structure repository, wherein the column-oriented data structure repository may be accessible and may be displayed as a display feature to the user and at least a second user account. The computing devices may be devices such as mobile devices, desktops, laptops, tablets, or any other devices capable of processing data. Such computing devices may include a display such as an LED display, augmented reality (AR), virtual reality (VR) display.


Disclosed embodiments may include and/or access a data structure. A data structure consistent with the present disclosure may include any collection of data values and relationships among them. The data may be stored linearly, horizontally, hierarchically, relationally, non-relationally, uni-dimensionally, multidimensionally, operationally, in an ordered manner, in an unordered manner, in an object-oriented manner, in a centralized manner, in a decentralized manner, in a distributed manner, in a custom manner, or in any manner enabling data access. By way of non-limiting examples, data structures may include an array, an associative array, a linked list, a binary tree, a balanced tree, a heap, a stack, a queue, a set, a hash table, a record, a tagged union, ER model, and a graph. For example, a data structure may include an XML database, an RDBMS database, an SQL database or NoSQL alternatives for data storage/search such as, for example, MongoDB, Redis, Couchbase, Datastax Enterprise Graph, Elastic Search, Splunk, Solr, Cassandra, Amazon DynamoDB, Scylla, HBase, and Neo4J. A data structure may be a component of the disclosed system or a remote computing component (e.g., a cloud-based data structure). Data in the data structure may be stored in contiguous or non-contiguous memory. Moreover, a data structure, as used herein, does not require information to be co-located. It may be distributed across multiple servers, for example, that may be owned or operated by the same or different entities. Thus, the term “data structure” as used herein in the singular is inclusive of plural data structures.


Certain embodiments disclosed herein may include a processor configured to perform methods that may include triggering an action in response to an input. The input may be from a user action or from a change of information contained in a user's table or board, in another table, across multiple tables, across multiple user devices, or from third-party applications. Triggering may be caused manually, such as through a user action, or may be caused automatically, such as through a logical rule, logical combination rule, or logical templates associated with a board. For example, a trigger may include an input of a data item that is recognized by at least one processor that brings about another action.


In some embodiments, the methods including triggering may cause an alteration of data and may also cause an alteration of display of data contained in a board or in memory. An alteration of data may include a recalculation of data, the addition of data, the subtraction of data, or a rearrangement of information. Further, triggering may also cause a communication to be sent to a user, other individuals, or groups of individuals. The communication may be a notification within the system or may be a notification outside of the system through a contact address such as by email, phone call, text message, video conferencing, or any other third-party communication application.


Some embodiments include one or more of automations, logical rules, logical sentence structures and logical (sentence structure) templates. While these terms are described herein in differing contexts, in a broadest sense, in each instance an automation may include a process that responds to a trigger or condition to produce an outcome; a logical rule may underly the automation in order to implement the automation via a set of instructions; a logical sentence structure is one way for a user to define an automation; and a logical template/logical sentence structure template may be a fill-in-the-blank tool used to construct a logical sentence structure. While all automations may have an underlying logical rule, all automations need not implement that rule through a logical sentence structure. Any other manner of defining a process that respond to a trigger or condition to produce an outcome may be used to construct an automation.


Other terms used throughout this disclosure in differing exemplary conte is may generally share the following common definitions.


In some embodiments, machine learning algorithms (also referred to as machine learning models or artificial intelligence in the present disclosure) may be trained using training examples, for example in the cases described below. Some non-limiting examples of such machine learning algorithms may include classification algorithms, data regressions algorithms, image segmentation algorithms, visual detection algorithms (such as object detectors, face detectors, person detectors, motion detectors, edge detectors, etc.), visual recognition algorithms (such as face recognition, person recognition, object recognition, etc.), speech recognition algorithms, mathematical embedding algorithms, natural language processing algorithms, support vector machines, random forests, nearest neighbors algorithms, deep learning algorithms, artificial neural network algorithms, convolutional neural network algorithms, recursive neural network algorithms, linear machine learning models, non-linear machine learning models, ensemble algorithms, and so forth. For example, a trained machine learning algorithm may, comprise an inference model, such as a predictive model, a classification model, a regression model, a clustering model, a segmentation model, an artificial neural network (such as a deep neural network, a convolutional neural network, a recursive neural network, etc,), a random forest, a support vector machine, and so forth. In some examples, the training examples may include example inputs together with the desired outputs corresponding to the example inputs. Further, in some examples, training machine learning algorithms using the training examples may generate a trained machine learning algorithm, and the trained machine learning algorithm may be used to estimate outputs for inputs not included in the training examples. In some examples, engineers, scientists, processes and machines that train machine learning algorithms may further use validation examples and/or test examples. For example, validation examples and/or test examples may include example inputs together with the desired outputs corresponding to the example inputs, a trained machine learning algorithm and/or an intermediately trained machine learning algorithm may be used to estimate outputs for the example inputs of the validation examples and/or test examples, the estimated outputs may be compared to the corresponding desired outputs, and the trained machine learning algorithm and/or the intermediately trained machine learning algorithm may be evaluated based on a result of the comparison. In some examples, a machine learning algorithm may have parameters and hyper parameters, where the hyper parameters are set manually by a person or automatically by a process external to the machine learning algorithm (such as a hyper parameter search algorithm), and the parameters of the machine learning algorithm are set by the machine learning algorithm according to the training examples. In some implementations, the hyper-parameters are set according to the training examples and the validation examples, and the parameters are set according to the training examples and the selected hyper-parameters.


Disclosed embodiments may involve managing a plurality of sprints using a plurality of electronically linked boards. A sprints may relate to a portion of development of a computer software, or a time period during which one or more individuals may work to develop or complete an improvement or addition to a system, computer program, software application, or other item. In some embodiments, a sprint may include strategies, plans, methods, or procedures for designating time frames, periods, or intervals for developing a product, solution, or service. For example, sprints may include strategies for issue management, team management, task management, scrums, frameworks, workflows, agile development, scrums, product development, software development, project management, product management, or any other planning method for software development, programming, application development, engineering. For example, sprints may include management strategies for achieving goals in designated time periods to develop a software product. In some embodiments, sprints may involve a series of iterations to separate a project or product into subcomponents of the project or product. For example, a sprint may include a management strategy to complete a product in a specific amount of time. In some embodiments, a sprint may include strategies for developing software within a specific, short, fixed-length time period. A skilled artisan may recognize that a sprint may involve iterations of planning, backlogs, scrum, review, user stories, or burn down charts. In some embodiments, a plurality of sprints may include at least one sprint occurring in series or parallel. Electronically linked boards may include boards, as described herein, which may connect, mirror, transmit, copy, relay, refer, share, or communicate data, inputs, outputs, features, details, or any other form of information. In some embodiments, electronically linked boards may share information between one or more boards. For example, data in rows and columns of a board may be shared with at least one other board. In some embodiments, stored data or metadata may identify one or more links between rows, columns, and/or cells of a high level board and a low level board. Disclosed embodiments may involve electronic data value changes across a plurality of workflow management boards. Workflow management may include infrastructure for set-up, performance and monitoring for a sequence of tasks, a series of steps to complete a specific task, organizing tasks, streamlining processes, routing, distribution, coordination, agile systems, lean systems, scrum systems, waterfall systems, Kanban systems, or adaptive systems. Electronic data value changes may include changes, alterations, transitions, or transformations in values of data or information.


Disclosed embodiments may involve managing time-sensitive tasks using electronically linked boards. Time-sensitive tasks may not be limited to sprints, as discussed herein. Time-sensitive tasks may include assignments with a dependency on time, such as timed projects, timed assignments, tasks classified by priority, iterative tasks, or periodical tasks. Disclosed embodiments may involve linking or connecting data and information regarding time-sensitive tasks between one or more boards. In some embodiments, time-sensitive data may be contained in columns external to a board. In some embodiments, time-sensitive task data may be contained in a high-level board. In some embodiments, a low-level board may be linked to at least one high-level board, and data associated with one or more time-sensitive tasks may be imported from one board to another. In some embodiments, linking boards and importing data may be performed in response to an indication of activation of one or more group-by controls.


Disclosed embodiments may involve generating a low-level board with rows and columns, the rows and columns for containing sprint-related function data associated with the plurality of sprints. In some embodiments, generating a board may include presenting or displaying at least one board including a low-level board. A low-level board may include at least one board containing, displaying, sharing, or presenting, information regarding project, product, or software development. A low-level board may include groupings of information presented in rows and columns of tables, as described herein. In some embodiments, a low-level board may contain rows and columns containing sprint-related function data. Sprint-related function data may include information or data such as to sprints, scrums, team members, tasks, persons, dates, issues, timelines, deadlines, goals, sprint summaries, statuses, progress, activity, or any other details regarding management of software development. For example, sprint-related function data may include features, tasks, owners, statuses, priorities, descriptions, due dates, timelines, bugs, roles, and other datum points.


In some embodiments, a low-level board may contain data corresponding to one or more tasks of a project, such as a software development project. A low-level board may be organized by project or specific tasks. Different tasks may be aggregated together and displayed on a table or board, such as a low-level board. In some embodiments, different low-level boards may contain information corresponding to different projects. For example, smaller projects within a larger a software development may each have a corresponding low-level board.



FIG. 87-2 is an example configuration of a low-level board, consistent with disclosed embodiments. In some embodiments, a low-level board may include controls to filter, sort, arrange, or organize sprint-related function data. For example, low-level board 87-2-00 may include board controls 87-2-10. Low-level board 87-2-00 may include sprint-level function data, as described herein. For example, low-level board 87-2-00 may include column headings 87-2-20. Column headings 87-2-20 may correspond include sprint-level function data, including owner, status, priority, type, role, task description, story points, dependencies, due dates, sprint names, epics, and timelines. In some embodiments, a low-level board may include multiple, distinct tables comprising rows and columns.


In some embodiments, at least one processor may generate at least one internal column and at least one external column on the low-level board. An internal column may include sets, categories, classifications, or other arrangements of storing information as described herein. In some embodiments, an internal column may include information or data collected, originating, or obtained from the same board or table the column exists in. In some embodiments, an internal column may contain data related to specific tasks of a project. For example, an internal column may contain information inputted directly into the cells of the column on the low-level board. In some embodiments, an internal column may not access data contained within boards different than the board the internal column exists in. An internal column may contain sprint-related function data. In some embodiments, an external column may include information or data collected, originating, or obtained from a board or table different from the board the column exists in. In some embodiments, an external column may access data contained within other boards or tables. For example, an external column may present data or information that is extracted from another board. In some embodiments, internal columns and external columns may, include blank values or cells with no value.



FIG. 87-2 is an example configuration of a low-level board, consistent with disclosed embodiments. Low-level board 87-2-00 may include a variety of rows and columns, such as internal columns and external columns. As described herein, internal columns may contain information corresponding to the presented board. For example, internal column 87-2-15 may contain information or data related to a task description, including task status, priority, type, description, and role. In some embodiments, low-level board 87-2-00 may include external columns 87-2-30 which may include descriptions of sprints including labels, indications, tags, markers, and notes. Information may be directly inputted into cells in internal column 87-2-15 such that changes to cells of internal column 87-2-15 may be reflected on the low-level board 87-2-00. Low-level board 87-2-00 may include external column 87-2-40. External column 87-2-40 may contain data extracted from, shared, mirrored, or collected from a board separate to the low-level board 87-2-00 which it is displayed on. In some embodiments, cells of external column 87-2-40 may not be directly manipulated on low-level board 87-2-00. External columns 87-2-40 may be identified as an external column by specific indication or markings.


In some embodiments, at least one external column may link to at least one associated high-level board. In some embodiments, links may include connections between electronically linked boards, as described herein. Links may include forms of data sharing including communication and mirroring. For example, links may include connecting or communication between boards to mirror information such that data contained on one board is displayed on another board. A high-level board may include at least one board containing, displaying, sharing, or presenting information regarding project, product, or software development, or sprints. The high-level board may be organized differently than the low-level board. In some embodiments, the high-level board may organize or display information or data based on categories. In some embodiments, a high-level board may track, audit, monitor, or observe a project. For example, a high-level board may track a project across one or more sprints. The high-level board may contain high-level data or information regarding the project it tracks, including metadata. In some embodiments, an associated high-level board may correspond to data or information contained in a low-level board. In some embodiments, a low-level board may correspond to one or more high-level boards. For example, different groups of data contained in a low-level board may associate with different high-level boards.


Disclosed embodiments may involve each row of a plurality of rows on the at least one associated high-level board being configured to hold data associated with a specific sprint. A specific sprint may include sprints with different names, different goals, or different sprint data. As discussed herein, the high-level board may include a plurality of rows and columns. In some embodiments, each row in the high-level board may hold or contain data associated with different sprints. As an example, in high-level hoard 87-3-00, rows 87-3-40 include a plurality of rows each holding data associated with a different sprint. In some embodiments, the at least one associated high-level board may be configured to hold sprint backlog data or metadata. The high-level board may include sprint metadata, sprint name, sprint duration, sprint goals, risk, effort, uncertainty, task progress, backlog, bugs, activity status, and other indications or metadata. Sprint backlog data may include tasks, items, issues, bugs, or other work intended to be completed during a specific sprint. Metadata may include descriptions of other data including structure, identity, attributes, context, features, administration, or reference information. Metadata may include sets of data describing or giving information about other data or information. For example, metadata may describe information about a sprint, such as sprint name, duration, goals, risk, effort required, work complexity, uncertainty, dates, progress, tasks, backlogs, bugs, or status. In some embodiments, metadata may comprise sprint metadata including data associated with one or more attributes about a sprint.



FIG. 87-3 is an example configuration of a high-level board, consistent with disclosed embodiments. High-level board 87-3-00 may include columns 87-3-10. High-level board 87-3-00 may contain or hold sprint backlog data or metadata within cells of rows and columns 87-3-111 In some embodiments, columns 87-3-10 may have headings corresponding to sprint-related function data or sprint metadata including, for example, sprint name, goals, activity status, and timeline. External column 87-2-30 on low-level board 87-2-00 may contain links to associated high-level board 87-3-00. For example, external column 87-3-30 on high-level board 87-3-00 may be linked to external column 87-2-30. In some embodiments, rows 87-3-40 on high-level board 87-3-00 may include a plurality of rows which may hold data associated with a specific sprint from name column 87-3-50.


In some embodiments, at least one processor may cause one or more displays to present an activatable internal group-by control. Activatable controls may include controls, triggers, switches, mechanisms, buttons, drop-downs, or other actuators for interacting with a board, dashboard, or other software configuration. Group-by controls may include a function or capability for sorting, arranging, categorizing, classifying, reorganizing, ordering, combining, or other organizing of information or data into sets, groups, or other divisions. Internal group-by controls may include organizing information based on information that is internal to the board. As discussed herein, internal may include information local to, directly inputted into, or accessible to a board. Disclosed embodiments may involve presenting an activatable external group-by control. External group-by controls may include organizing information based on information that is external to the board. As discussed herein, external may include information or data collected, originating, or obtained from a board or table different from the board the control is presented on.



FIG. 87-4 is an example configuration of a group-by control, consistent with disclosed embodiments. Group-by control 87-4-00 may include one or more activatable controls that may be interactable. For example, group-by control 87-4-00 may include a drop-down menu with activatable internal group-by controls 87-4-10 and activatable external group-by controls 87-4-20. Activatable internal group-by controls 87-4-10 or activatable external group-by controls 87-4-20 may be selected, clicked, or pressed. As an example, activatable internal group-by controls may include roles, statuses, priorities, or types. As an example, activatable external group-by controls may include tasks due dates, descriptions, epics, and sprint names. In some embodiments, group-by controls may be accessed on a board. For example, board controls 87-2-10 on low-level board 87-2-00 (as referenced in FIG. 87-2) may present a configuration to access group-by controls.


In some embodiments, at least one processor may receive a first indication of activation of the internal group-by control. In some embodiments, an indication of activation may include a mouse click, press, gesture, or other feedback cue confirming a selection of an option. In some embodiments, an indication of activation may include a response of a change in configuration of a board. For example, a first indication of activation of an internal group-by column may involve selecting a criteria, rule, basis, standard, or grouping, such as internal data. In some embodiments, group-by control 87-4-00 may present options including selecting internal group-by controls 87-4-10. For example, receiving a first indication of activation may include selecting internal group-by controls 87-4-10 as a grouping basis. In some embodiments, the basis for grouping may depend on the internal column chosen.


In some embodiments in response to the first indication, at least one processor may organize rows on the low-level board into first groups based on common internal column data. Common internal column data may include data, values, entries, inputs or information contained in cells of internal columns. In some embodiments, common internal column data may comprise data values in a cell of internal columns with a value equivalent to one or more other data values in the same internal column. For example, an internal column may contain a set of data, and within the set, there may be at least one group of equivalent data such that one or more values are equivalent to each other, and each such group may be regarded as common internal data. The common internal data may serve as a basis to organize rows on the low-level board. In some embodiments, each set of equivalent data may represent a category, classification, or group to organize rows. Organizing rows may include arranging, grouping, ordering, assembling, structuring, or otherwise sorting rows of a board or table. For example, after receiving an indication of activation, rows may be organized on a low-level board according to first groups determined b common internal column data from a certain internal column groups may include a first classification of rows on the board.



FIG. 87-5 is an example configuration of groups of a low-level board, consistent with disclosed embodiments. For example, a low-level board may appear in the configuration of low-level board 87-2-00, as referenced in FIG. 87-2. Low-level board 87-2-00 may include internal column 87-2-15. Internal column 87-2-15 may have a column header which may comprise a set or classification of information related to tasks, including task priority, Task priority may include various values such as high priority, medium priority, and low priority, or blank cells. Internal column 87-2-15 may include common internal column data. For example, cells of internal column 87-2-15 include one or more values with equivalent values such as high priority, low priority, or medium priority, and the equivalent values may represent common internal column data. A first indication of activation of an internal group-by control may be selected, and in response to the first indication, rows on the low-level board 87-2-00 may be organized into first groups. For example, the low-level board 87-2-00 may be organized into first groups on low-level board 87-5-00, as referenced on FIG. 87-5. In some embodiments, the board may be organized into groups based on common internal column data such that each unique entry in the internal column creates a group header in the organized low-level board. Low-level board 87-5-00 may include first groups based on the internal column data of internal column 87-2-15, including groupings of high priority 87-5-10, medium priority 87-5-20, low priority 87-5-30, and blank 87-5-40. Individual cells within internal column 87-2-15 may be associated with a row. In some embodiments, organizing rows on the low-level board may include mapping such rows into first groups of low-level board 87-5-00. For example, low-level board 87-2-00 (FIG. 87-2) may include rows with data values in internal column 87-2-5 corresponding to a medium priority, such as the rows corresponding to task 387-2-70 or task 5. Upon organizing, these corresponding rows may be sorted in low-level board 87-5-00 (FIG. 87-5) in a first group of medium priority 87-5-20. In this example, the corresponding rows are now configured as task 387-5-70 and task 5 contained within the first group of medium priority 87-5-20.


Disclosed embodiments may involve receiving a second indication of activation of the external group-by control. In some embodiments, a second indication of activation of an external group-by column may involve selecting a criteria, rule, basis, standard, or grouping, such as external data. In some embodiments, group—by control 87-4-00 may present options including selecting external group-by controls 87-4-20. For example, receiving a second indication of activation may include selecting external group-by controls 87-4-10 as a grouping basis. In some embodiments, the basis for grouping may depend on the external column chosen.


In some embodiments in response to the second indication, at least one processor may reorganize rows on the low-level board into second groups based on common external column data. Common external column data may include data, values, entries, or information contained in cells of external columns. Common external common data may include data mirrored or linked from columns from other boards. In some embodiments, common external column data may comprise data values in a cell of external columns with a value equivalent to one or more other data values in the same external column. For example, an external column may contain a set of data, and within the set, there may be at least one group of equivalent data such that one or more values are equivalent to each other, and each such group may be regarded as common external data. The common external data may serve as a basis to reorganize rows on the low-level board. In some embodiments, each set of equivalent data may represent a category, classification, or group to organize rows. Reorganizing rows may include a new arrangement, grouping, ordering, assembling, structuring, or otherwise sorting of rows of a board or table. In some embodiments, reorganizing rows may include maintaining the same arrangement of one or more rows in the board. For example, after receiving an indication of activation, rows may be reorganized on a low-level board according to second groups determined by common external column data from a specific external column. Second groups may include a second classification of rows on the board. In some embodiments, the second classification may be the same as the first classification.


In some embodiments, in response to selection of an external group-by, a board may be reorganized by common external column data into second groups such that each second group may be a new heading determined by the common external column data. External data may be extracted from associated boards via the external columns, and the external data may be presented in the associated second group. In some embodiments, boards may be grouped by a relationship with another board.


In some embodiments, the external group-by control and internal group-by control may be configured for simultaneous reorganization of one or more rows on the low-level board, based on common internal column data and common external column data. Simultaneous performance may involve one or more processes or actions occurring in a similar time frame, caused by a common trigger, or executed on the same board. For example, the external group-by control and internal group-by control may be configured to simultaneously group a board based on one or more rule sets or predetermined settings.



FIG. 87-6 is an example configuration of groups of a low-level board, consistent with disclosed embodiments. For example, a low-level board may appear in the configuration of low-level board 87-2-00, as referenced in FIG. 87-2. Low-level board 87-2-00 may include external column 87-2-40. External column 87-2-40 may have a column header which may comprise a set or classification of information related to sprints, including sprint name or sprint timeline. Sprint names may include names or labels corresponding to one or more sprints of a project. External column 87-2-40 may include common external column data. For example, cells of external column 87-2-40 may include one or more values with equivalent values such as shared sprint names, and the equivalent values may represent common external column data. A second indication of activation of an external group-by control may be selected, and in response to the second indication, rows on the low-level board 87-2-00 may be reorganized into second groups. For example, the low-level board 87-2-00 may be reorganized into second groups on low-level board 87-6-00, as referenced on FIG. 87-6. In some embodiments, the board may be reorganized into groups based on common external column data such that each unique entry in the external column creates a group header in the reorganized low-level board. In the example of low-level board 87-6-00, the board is grouped by an external column of sprints. Low-level board. 87-6-00 may include second groups based on the external column data of external column 87-2-40 including groupings of sprints such as sprint two 87-6-10, sprint one 87-6-20, and sprint three 87-6-30. Grouping sprint two 87-6-10 may be comprised of rows of low-level board 87-2-00 with values in external column 87-2-40 corresponding to a specific sprint, such as sprint two. In some embodiments, reorganizing rows on the low-level board may include mapping such rows into second groups of low-level board 87-6-00. Grouping sprint one 87-6-20 may be comprised of rows of low-level board 87-2-00 with values in external column 87-2-40 corresponding to a specific sprint, such as sprint one. Grouping sprint A 87-6-30 may be comprised of rows of low-level board 87-2-00 with values in external column 87-2-40 corresponding to a specific sprint, such as sprint A.


In some embodiments, data associated with a specific sprint may be linked to the specific sprint via at least one external column. For example, sprint data may be contained in high-level board 87-3-00. In some embodiments, external column 87-3-30 may link data from another board to high-level board 87-3-30. Such data may include sprint data such as a sprint timeline or timeframe. The sprint data linked by external column 87-3-30 may then appear in the high-level board 87-3-00. In some embodiments, the external group-by may be configured to reorganize rows on the low-level board into a plurality of groups by common external column data, access on the low-level board, the additional links to the plurality of high-level boards, extract additional data from the plurality of associated high-level boards, and import the extracted data onto the low-level board. For example, a low-level board may be associated with a plurality of high-level boards, such as at least one high-level board containing sprint data for a specific project and one or more boards containing other data regarding software development. The external group-by may provide the option to link external columns containing data from these associated high-level boards to the low-level board. Common external column data may be used to reorganize the rows on the low-level board. The additional links may be accessed, and additional data from the associated high-level boards may be extracted, and imported onto the low-level board, as discussed herein.


As discussed herein, internal columns and external columns may also be comprised of linkage columns. Linkage columns may include columns within a board that may link the board with at least one other board. Linkage columns may connect, mirror, transmit, copy, relay, refer, share, or communicate data, inputs, outputs, features, details, or any other form of information between the one or more columns of the board. Disclosed embodiments may involve at least one external column being a linkage column. In some embodiments, the low-level board may include a plurality of linkage columns. A plurality of linkage columns may involve one or more linkage columns in the same board, which may link to one or more linkage columns in one or more separate boards. In some embodiments, each of the plurality of linkage columns may contain additional links to each of a plurality of associated high-level boards. As discussed herein, a board such as a low-level board may be connected to a plurality of associated high-level boards, which may comprise at least one high-level board. In some embodiments, additional links may comprise one or more links to a column of another board. For example, additional links on a low-level board may link to one or more linkage columns on at least one high-level board.


In some embodiments, at least one processor may access, on the low-level board, the links to the at least one associated high-level board. Accessing may include acquiring, reading, obtaining, connecting, locating, gathering, or transferring links, data, information, or values. In some embodiments, accessing links may include obtaining the rows or columns of a board or table. For example, accessing links may include obtaining the rows or columns of one or more high-level boards associated with a low-level board. In some embodiments, the at least one processor may extract data from the at least one associated high-level board. Extracting data may include retrieving, pulling out, capturing, restoring, or mirroring data, information, values, or metadata from a different board. In some embodiments, data may be extracted from multiple boards, such as multiple high-level boards. Disclosed embodiments may involve importing the extracted data onto the low-level board. Importing may involve bringing in, pulling in, conveying, transporting, moving, transferring, relaying, inserting, presenting, mirroring, copying displaying, or otherwise transmitting data or information. In some embodiments, importing extracted data may include transmitting information contained in one board to another. For example, importing extracted data may include pulling in data contained in a high-level board to a low-level board. In some embodiments, importing may include displaying the transmitted information or data. For example, importing extracted data may include copying data from one or more rows of columns of a table or board and presenting the copied data in another board.


As an example, low-level board 87-6-00 is an exemplary configuration of a low-level board containing imported extracted data. Low-level board may be associated with high-level board 87-3-00 (FIG. 87-3). Extracted data may include metadata, sprint metadata, and data contained within columns of high-level board 87-3-00. For example, low-level board 87-6-00 may be grouped by sprints. External column 87-3-50 may be a basis or may be considered a rule for grouping, and groups in associated low-level board 87-6-00 may be reorganized by the categories of the names of the sprints. In some embodiments, external or imported data may be marked or labeled. In some embodiments, the extracted data may be imported and presented on the low-level board 87-6-00. For an example of grouping by sprints, activity and sprint timeline may be extracted from high-level board 87-3-00 and imported into low-level board 87-6-00, The imported data may include metadata presented on the low-level board, such as imported metadata 87-6-40. In some embodiments, at least some of the imported extracted data may be presented in each of the groups in the low-level board. For example, the corresponding sprint metadata extracted from each row in high-level board 87-3-00 may be presented as metadata 87-6-40, 87-6-41, 87-6-42 on each group in the low-level board 87-6-00. In some embodiments, each group in a reorganized low-level board may contain imported data.


In some embodiments, at least one processor may aggregate data from the items of the low-level board that are linked to. Low-level boards that are linked to may include boards that are linked to a column, row, cell, or other data value in a high-level board. Aggregation of data may include combining, collecting, mixing, summing, or processing data. Aggregation of data may include combining different sets, pieces, or values of data into one or more different sets of data. In some embodiments, aggregation of data may include processing different values of data and presenting them on a board as a different set of data or a summary of the data. For example, a low-level board linked to a high-level board corresponding to sprint data may have data aggregated. The data may be processed and presented on the low-level board. As an example, low-level board 87-6-00 may be grouped by sprints, and include priority data 87-645 regarding different tasks within the grouping of sprint two 87-6-10. Data aggregation may combine the different priority data from tasks within sprint two grouping 87-6-10, and combine the priority data and present it as aggregated data 87-6-50. In some embodiments, aggregated data 87-6-50 may be presented as a battery widget or pie chart, providing a summary or overview of the different values of priority data within the grouping.


In some embodiments, linkage between different boards, such as a low-level board and a high—level board, may be utilized for timed assignments, iterative projects, or projects with deadlines or specified timeframes. Timeframe data may be contained in a high-level board, and may be imported and presented on a low-level board.


In some embodiments, the imported data may influence one or more of a sorting or an arrangement of items in at least one group of the low-level board. Influencing may involve causing, determining, affecting, effecting, modifying, impacting, or inducing. In some embodiments, the imported data may influence a sorting or arrangement of items by determining the classification or categorization of data within the low-level board. For example, imported data such as sprint name may cause the low-level board to by categorized by names of the sprints.



FIG. 87-1 illustrates a flowchart of an exemplary computer-based process for a workflow for managing sprints. FIG. 87-1 includes steps 87-1-10 to 87-1-30. In some embodiments, the process may be implementing using at least one processor of computing device 87-7-100 or user device 87-8-220-1, discussed with respect to FIGS. 87-8 and 87-8, respectively, Referring to FIG. 87-1, at step 87-1-10, at least one processor may generate a low-level board with rows and columns, the rows and columns for containing sprint-related function data associated with a plurality of sprints. At step 87-1-12, the at least one processor may generate at least one internal column and at least one external column on the low-level board, the at least one external column for containing links to at least one associated high-level board. At step 87-1-14, the at least one processor may present an activatable internal group-by control. At step 87-1-16, the at least one processor may present an activatable external group-by control. At step 87-1-18, the at least one processor may receive a first indication of activation of the internal group-by control. At step 87-1-20, in response to the first indication, the at least one processor may organize rows on the low-level board into first groups based on common internal column data. At step 87-1-22, the at least one processor may receive a second indication of activation of the external group-by control. At step 87-1-24, in response to the second indication, the at least one processor may reorganize rows on the low-level board into second groups by common external column data. At step 87-1-26, the at least one processor may access on the low-level board, the links to the at least one associated high-level board. At step 87-1-28, the at least one processor may extract data from the at least one associated high-level board. At step 87-1-30, the at least one processor may import the extracted data onto the low-level board,



FIG. 87-7 is a block diagram of an exemplary computing device 87-7-00 for generating a column and/or row oriented data structure repository for data consistent with some embodiments. The computing device 87-7-100 may include processing circuitry 87-7-110, such as, for example, a central processing unit (CPU). In some embodiments, the processing circuitry 87-7-110 may include, or may be a component of, a larger processing unit implemented with one or more processors. The one or more processors may be implemented with any combination of general-purpose microprocessors, microcontrollers, digital signal processors (DSPs), field programmable gate array (FPGAs), programmable logic devices (PLDs), controllers, state machines, gated logic, discrete hardware components, dedicated hardware finite state machines, or any other suitable entities that can perform calculations or other manipulations of information.


The processing circuitry such as processing circuitry 87-7-110 may be coupled via a bus 87-7-105 to a memory 120.


The memory 87-7-120 may further include a memory portion 87-7-122 that may contain instructions that when executed by the processing circuitry 87-7-110, may perform the method described in more detail herein. The memory 87-7-120 may be further used as a working scratch pad for the processing circuitry 87-7-110, a temporary storage, and others, as the case may be. The memory 87-7-120 may be a volatile memory such as, but not limited to, random access memory (RAM), or non-volatile memory (NVM), such as, but not limited to, flash memory. The processing circuitry 87-7-110 may be further connected to a network device 87-7-140, such as a network interface card, for providing connectivity between the computing device 87-7-100 and a network, such as a network 87-8-210, discussed in more detail with respect to FIG. 2 below. The processing circuitry 110 may be further coupled with a storage device 130. The storage device 87-7-130 may be used for the purpose of storing single data type column-oriented data structures, data elements associated with the data structures, or any other data structures. While illustrated in FIG. 87-7 as a single device, it is to be understood that storage device 130 may include multiple devices either collocated or distributed.


The processing circuitry 87-7-110 and/or the memory 120 may also include machine-readable media for storing software. “Software” as used herein refers broadly to any type of instructions, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise. Instructions may include code (e.g., in source code format, binary code format, executable code format, or any other suitable format of code), The instructions, when executed by the one or more processors, may cause the processing system to perform the various functions described in further detail herein,



FIG. 87-8 is a block diagram of computing architecture 87-8-200 that may be used in connection with various disclosed embodiments. The computing device 87-7-100, as described in connection with FIG. 87-8, may be coupled to network 87-8-210. The network 87-8-210 may enable communication between different elements that may be communicatively coupled with the computing device 100, as further described below. The network 87-8-210 may include the Internet, the world-wide-web (WWW), a local area network (LAN), a wide area network (WAN), a metro area network (MAN), and other networks capable of enabling communication between the elements of the computing architecture 87-8-200. In some disclosed embodiments, the computing device 87-7-100 may be a server deployed in a cloud computing environment.


One or more user devices 87-8-220-1 through user device 87-8-220-rn, where ‘m’ in an integer equal to or greater than 1, referred to individually as user device 87-8-220 and collectively as user devices 87-8-220, may be communicatively coupled with the computing device 87-7-100 via the network 87-8-210. A user device 87-8-220 may be for example, a smart phone, a mobile phone, a laptop, a tablet computer, a wearable computing device, a personal computer (PC), a smart television and the like. A user device 87-8-220 may be configured to send to and receive from the computing device 87-7-100 data and/or metadata associated with a variety of elements associated with single data type column-oriented data structures, such as columns, rows, cells, schemas, and the like.


One or more data repositories 87-8-230-1 through data repository 87-8-230-n, where ‘n’ in an integer equal to or greater than 1, referred to individually as data repository 87-887-8-230 and collectively as data repository 87-8-230, may be communicatively coupled with the computing device 87-7-100 via the network 87-8-210, or embedded within the computing device 87-7-100. Each data repository 87-8-230 may be communicatively connected to the network 87-8-210 through one or more database management services (DBMS) 87-8-235-1 through DBMS 87-8-235-n. The data repository 87-8-230 may be for example, a storage device containing a database, a data warehouse, and the like, that may be used for storing data structures, data items, metadata, or any information, as further described below. In some embodiments, one or more of the repositories may be distributed over several physical storage devices, e.g., in a cloud-based computing environment. Any storage device may be a network accessible storage device, or a component of the computing device 87-7-100.



FIG. 87-9 is an exemplary embodiment of a presentation of an electronic collaborative word processing document 87-9-301 via an editing interface or editor 87-9-300. The editor 87-9-300 may include any user interface components 87-9-302 through 87-9-312 to assist with input or modification of information in an electronic collaborative word processing document 87-9-301. For example, editor 87-9-300 may include an indication of an entity 87-9-312, which may include at least one individual or group of individuals associated with an account for accessing the electronic collaborative word processing document. User interface components may provide the ability to format a title 87-9-302 of the electronic collaborative word processing document, select a view 87-9-304, perform a lookup for additional features 306, view an indication of other entities 87-9-308 accessing the electronic collaborative word processing document at a certain time (e.g., at the same time or at a recorded previous time), and configure permission access 87-9-310 to the electronic collaborative word processing document. The electronic collaborative word processing document 87-9-301 may include information that may be organized into blocks as previously discussed. For example, a block 87-9-320 may itself include one or more blocks of information. Each block may have similar or different configurations or formats according to a default or according to user preferences. For example, block 87-9-322 may be a “Title Block” configured to include text identifying a title of the document, and may also contain, embed, or otherwise link to metadata associated with the tide. A block may be pre-configured to display information in a particular format (e.g., in bold font). Other blocks in the same electronic collaborative word processing document 87-9-301, such as compound block 87-9-320 or input block 87-9-324 may be configured differently from title block 87-9-322. As a user inputs information into a block, either via input block 87-9-324 or a previously entered block, the platform may provide an indication of the entity 87-9-318 responsible for inputting or altering the information. The entity responsible for inputting or altering the information in the electronic collaborative word processing document may include any entity accessing the document, such as an author of the document or any other collaborator who has permission to access the document.


Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art. The materials, methods, and examples provided herein are illustrative only and not intended to be limiting.


Implementation of the method and system of the disclosed embodiments may involve performing or completing certain selected tasks or steps manually, automatically, or a combination thereof. Moreover, according to actual instrumentation and equipment of preferred embodiments of the method and system of the disclosed embodiments, several selected steps may be implemented by hardware (HW) or by software (SW) on any operating system of any firmware, or by a combination thereof. For example, as hardware, selected steps of the disclosure could be implemented as a chip or a circuit. As software or algorithm, selected steps of the disclosure could be implemented as a plurality of software instructions being executed by a computer using any suitable operating system. In any case, selected steps of the method and system of the disclosure could be described as being performed by a data processor, such as a computing device for executing a plurality of instructions.


As used herein, the terms “machine-readable medium” “computer-readable medium” refers to any computer program product, apparatus and/or device (e.g., magnetic discs, optical disks, memory, Programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term “machine-readable signal” refers to any signal used to provide machine instructions and/or data to a programmable processor.


Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, specially designed ASICs (application specific integrated circuits), computer hardware, firmware, software, and/or combinations thereof. These various implementations can include implementation in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, coupled to receive data and instructions from, and to transmit data and instructions to, a storage system, at least one input device, and at least one output device.


Although the present disclosure is described with regard to a “computing device”, a “computer”, or “mobile device”, it should be noted that optionally any device featuring a data processor and the ability to execute one or more instructions may be described as a computing device, including but not limited to any type of personal computer (PC), a server, a distributed server, a virtual server, a cloud computing platform, a cellular telephone, an IP telephone, a smartphone, a smart watch or a PDA (personal digital assistant). Any two or more of such devices in communication with each other may optionally comprise a “network” or a “computer network”.


To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having a display device (a LED (light-emitting diode), (I)LED (organic LED), or LCD (liquid crystal display) monitor/screen) for displaying information to the user and a keyboard and a pointing device (e.g., a mouse or a trackball) by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback), and input from the user can be received in any form, including acoustic, speech, or tactile input.


The systems and techniques described here can be implemented in a computing system that includes a back end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front end component (e.g., a client computer having a graphical user interface or a Web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back end, middleware, or front end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network (“LAN”), a wide area network (“WAN”), and the Internet.


The computing system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.


It should be appreciated that the above-described methods and apparatus may be varied in many ways, including omitting or adding steps, changing the order of steps and the type of devices used. It should be appreciated that different features may be combined in different ways. In particular, not all the features shown above in a particular embodiment or implementation are necessary in every embodiment or implementation of the present disclosure. Further combinations of the above features and implementations are also considered to be within the scope of some embodiments or implementations of the present disclosure.


While certain features of the described implementations have been illustrated as described herein, many modifications, substitutions, changes and equivalents will now occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fail within the scope of the implementations. It should be understood that they have been presented by way of example only, not limitation, and various changes in form and details may be made. Any portion of the apparatus and/or methods described herein may be combined in any combination, except mutually exclusive combinations. The implementations described herein can include various combinations and/or sub-combinations of the functions, components and/or features of the different implementations described.


Disclosed embodiments may include any one of the following features alone or in combination with one or more other features, whether implemented as a method, by at least one processor, and/or stored as executable instructions on non-transitory computer-readable media: A system for managing at least one task across a plurality of workflow management boards based on electronic data value changes across the plurality of workflow management boards, the system comprising at least one processor configured to: generate a low-level board with rows and columns, the rows and columns for containing sprint-related function data associated with a plurality of sprints; generate at least one internal column and at least one external column on the low-level board, the at least one external column for containing links to at least one associated high-level board; present an activatable internal group-by control; present an activatable external group-by control; receive a first indication of activation of the internal group—by control; in response to the first indication, organize rows on the low-level board into first groups based on common internal column data; receive a second indication of activation of the external group-by control; and in response to the second indication, reorganize rows on the low-level board into second groups by common external column data. The at least one processor may access, on the low-level board, the links to the at least one associated high-level board; extract data from the at least one associated high-level board; and import the extracted data onto the low-level board.


Disclosed embodiments may include any one of the following features alone or in combination with one or more other features, whether implemented as a method, by at least one processor, and/or stored as executable instructions on non-transitory computer readable media: generating a low-level board with rows and columns, the rows and columns for containing sprint—related function data associated with the plurality of sprints; generating at least one internal column and at least one external column on the low-level board, the at least external column for containing links to at least one associated high-level board; presenting an activatable internal group-by control; presenting an activatable external group-by control; receiving a first indication of activation of the internal group-by control; in response to the first indication, organizing rows on the low-level board into first groups based on common internal column data; receiving a second indication of activation of the external group-by control; and in response to the second indication: reorganizing rows on the low-level board into second groups by common external column data; accessing on the low-level board, the links to the at least one associated high-level board; extracting data from the at least one associated high-level board; and importing the extracted data onto the low-level board.


Disclosed embodiments may include any one of the following features alone or in combination with one or more other features, whether implemented as a method, by at least one processor, and/or stored as executable instructions on non—transitory computer readable media: generating a low-level board with rows and columns, the rows and columns for containing sprint-related function data associated with the plurality of sprints; generating at least one internal linkage column on the low-level board, the at least one linkage column for containing links to at least one associated high-level board; presenting an activatable group-by control; receiving an indication of activation of the group-by control on the linkage column, and in response to the indication, reorganizing rows on the low-level board into groups by common column data; accessing on the low-level board, the links to the at least one associated high-level board; extracting data from the at least one associated high-level board; and importing the extracted data onto the low-level board.


Disclosed embodiments may include each row of a plurality of rows on the at least one associated high-level board is configured to hold data associated with a specific sprint. Disclosed embodiments may include aggregation of data from the items of the low-level board that are linked to. Disclosed embodiments may include at least some of the imported extracted data is presented in each of the groups in the low-level board. Disclosed embodiments may include at least one associated high-level board is configured to hold sprint backlog data or metadata. Disclosed embodiments may include the at least one external column is a linkage column, the low-level board includes a plurality of linkage columns, and each of the plurality of linkage columns contains additional links to each of a plurality of associated high-level boards. Disclosed embodiments may include the low-level board includes a plurality of linkage external columns, and wherein each of the plurality of external columns contains additional links to each of a plurality of associated high-level boards. Disclosed embodiments include the external group-by is configured to: reorganize rows on the low-level board into a plurality of groups by common external column data; access on the low-level board, the additional links to the plurality of associated high-level boards; extract additional data from the plurality of associated high-level boards; and import the extracted additional data onto the low-level board. Disclosed embodiments may include the imported data influences one or more of a sorting or an arrangement of items in at least one group of the low-level board. Disclosed embodiments may, include the external group-by control and internal group-by control are configured for simultaneous performance to reorganize rows on the low-level board based on common internal column data and common external column data. Disclosed embodiments may include each row of a plurality of rows on the at least one associated high—level board is configured to hold data associated with a specific sprint. Disclosed embodiments may include data associated with the specific sprint is linked to the specific sprint via the at least one external column. Disclosed embodiments may include at least one associated high-level board is configured to hold sprint backlog data. Disclosed embodiments may include the imported data from the high-level is utilized in the low-level board.


Systems and methods disclosed herein involve unconventional improvements over conventional approaches. Descriptions of the disclosed embodiments are not exhaustive and are not limited to the precise forms or embodiments disclosed. Modifications and adaptations of the embodiments will be apparent from consideration of the specification and practice of the disclosed embodiments. Additionally, the disclosed embodiments are not limited to the examples discussed herein.


The foregoing description has been presented for purposes of illustration. It is not exhaustive and is not limited to the precise forms or embodiments disclosed. Modifications and adaptations of the embodiments will be apparent from consideration of the specification and practice of the disclosed embodiments. For example, the described implementations include hardware and software, but systems and methods consistent with the present disclosure may be implemented as hardware alone.


It is appreciated that the above described embodiments can be implemented by hardware, or software (program codes), or a combination of hardware and software. If implemented by software, it can be stored in the above-described computer-readable media. The software, when executed by the processor can perform the disclosed methods. The computing units and other functional units described in the present disclosure can be implemented by hardware, or software, or a combination of hardware and software. One of ordinary skill in the art will also understand that multiple ones of the above described modules/units can be combined as one module or unit, and each of the above described modules/units can be further divided into a plurality of sub-modules or sub-units.


The block diagrams in the figures illustrate the architecture, functionality-, and operation of possible implementations of systems, methods, and computer hardware or software products according to various exemplary disclosed embodiments. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code, which includes one or more executable instructions for implementing the specified logical functions. It should be understood that in some alternative implementations, functions indicated in a block may occur out of order noted in the figures. For example, two blocks shown in succession may be executed or implemented substantially concurrently, or two blocks may sometimes be executed in reverse order, depending upon the functionality involved. Some blocks may also be omitted. It should also be understood that each block of the block diagrams, and combination of the blocks, may be implemented by special purpose hardware-based systems that perform the specified functions or acts, or by combinations of special purpose hardware and computer instructions.


In the foregoing specification, embodiments have been described with reference to numerous specific details that can vary from implementation to implementation. Certain adaptations and modifications of the described embodiments can be made. Other embodiments can be apparent to those skilled in the art from consideration of the specification and practice of the disclosed embodiments. It is intended that the specification and examples be considered as example only, with a true scope and spirit of protection being indicated by the following claims. It is also intended that the sequence of steps shown in figures are only for illustrative purposes and are not intended to be limited to any particular sequence of steps. As such, those skilled in the art can appreciate that these steps can be performed in a different order while implementing the same method.


It will be appreciated that the embodiments of the present disclosure are not limited to the exact construction that has been described above and illustrated in the accompanying drawings, and that various modifications and changes may be made without departing from the scope thereof.


Other embodiments will be apparent to those skilled in the art from consideration of the specification and practice of the disclosed embodiments disclosed herein. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosed embodiments being indicated by the following claims.


Computer programs based on the written description and methods of this specification are within the skill of a software developer. The various programs or program modules can be created using a variety of programming techniques. One or more of such software sections or modules can be integrated into a computer system, non—transitory computer readable media, or existing software.


Moreover, while illustrative embodiments have been described herein, the scope includes any and all embodiments having equivalent elements, modifications, omissions, combinations (e.g., of aspects across various embodiments), adaptations or alterations based on the present disclosure. The elements in the claims are to be interpreted broadly based on the language employed in the claims and not limited to examples described in the present specification or during the prosecution of the application. These examples are to be construed as non-exclusive. Further, the steps of the disclosed methods can be modified in any manner, including by reordering steps or inserting or deleting steps. It is intended, therefore, that the specification and examples be considered as exemplary only, with a true scope and spirit being indicated by the following claims and their full scope of equivalents.

Claims
  • 1. A non-transitory computer readable medium containing instructions that when executed by at least one processor cause the at least one processor to perform operations for managing a plurality of sprints using a plurality of electronically linked boards, the operations comprising: generating a low-level board with rows and columns, the rows and columns for containing sprint-related function data associated with the plurality of sprints;generating at least one internal column and at least one external column on the low-level board, the at least one external column for containing links to at least one associated high-level board;presenting an activatable internal group-by control;presenting an activatable external group-by control;receiving a first indication of activation of the internal group-by control; in response to the first indication, organizing rows on the low-level board into first groups based on common internal column data;receiving a second indication of activation of the external group-by control; and in response to the second indication: reorganizing rows on the low-level board into second groups based on common external column data;accessing on the low-level board, the links to the at least one associated high-level board;extracting data from the at least one associated high-level board; andimporting the extracted data onto the low-level board.
  • 2. The non-transitory computer readable medium of claim 1, wherein each row of a plurality of rows on the at least one associated high-level board is configured to hold data associated with a specific sprint.
  • 3. The non-transitory computer readable medium of claim 1, wherein there is aggregation of data from the items of the low-level board that are linked to.
  • 4. The non-transitory computer readable medium of claim 1, wherein at least some of the imported extracted data is presented in each of the groups in the low-level board.
  • 5. The non-transitory computer readable medium of claim 1, wherein the at least one associated high-level board is configured to hold sprint backlog data or metadata.
  • 6. The non-transitory computer readable medium of claim 1, wherein the at least one external column is a linkage column, the low-level board includes a plurality of linkage columns, and each of the plurality of linkage columns contains additional links to each of a plurality of associated high-level boards.
  • 7. The non-transitory computer readable medium of claim 1, wherein the imported data influences one or more of a sorting or an arrangement of items in at least one group of the low-level board.
  • 8. A method for managing at least one task across a plurality of workflow management boards based on electronic data value changes across the plurality of workflow management boards, the method comprising: generating a low-level board with rows and columns, the rows and columns for containing sprint-related function data associated with a plurality of sprints;generating at least one internal column and at least one external column on the low-level board, the at least one external column for containing links to at least one associated high-level board;presenting an activatable internal group-by control;presenting an activatable external group-by control;receiving a first indication of activation of the internal group-by control; in response to the first indication, organizing rows on the low-level board into first groups based on common internal column data;receiving a second indication of activation of the external group-by control; and in response to the second indication: reorganizing rows on the low-level board into second groups based on common external column data;accessing on the low-level board, the links to the at least one associated high-level board;extracting data from the at least one associated high-level board; andimporting the extracted data onto the low-level board.
  • 9. The method of claim 8, wherein each row of a plurality of rows on the at least one associated high-level board is configured to hold data associated with a specific sprint.
  • 10. The method of claim 8, wherein there is aggregation of data from the items of the low-level board that are linked to.
  • 11. The method of claim 8, wherein at least some of the imported extracted data is presented in each of the groups in the low-level board.
  • 12. The method of claim 8, wherein the at least one associated high-level board is configured to hold sprint backlog data or metadata.
  • 13. The method of claim 8, wherein the at least one external column is a linkage column,the low-level board includes a plurality of linkage columns, andeach of the plurality of linkage columns contains additional links to each of a plurality of associated high-level boards.
  • 14. The method of claim 8, wherein the imported data influences one or more of a sorting or an arrangement of items in at least one group of the low-level board.
  • 15. A system for managing at least one task across a plurality of workflow management boards based on electronic data value changes across the plurality of workflow management boards, the system comprising: at least one processor configured to: generate a low-level board with rows and columns, the rows and columns for containing sprint-related function data associated with a plurality of sprints;generate at least one internal column and at least one external column on the low-level board, the at least one external column for containing links to at least one associated high-level board;present an activatable internal group-by control;present an activatable external group-by control;receive a first indication of activation of the internal group-by control; in response to the first indication, organize rows on the low-level board into first groups based on common internal column data;receive a second indication of activation of the external group-by control; and in response to the second indication: reorganize rows on the low-level board into second groups based on common external column data;access on the low-level board, the links to the at least one associated high-level board;extract data from the at least one associated high-level board; andimport the extracted data onto the low-level board.
  • 16. The system of claim 15, wherein each row of a plurality of rows on the at least one associated high-level board is configured to hold data associated with a specific sprint.
  • 17. The system of claim 15, wherein at least some of the imported extracted data is presented in each of the groups in the low-level board.
  • 18. The system of claim 15, wherein the at least one associated high-level board is configured to hold sprint backlog data or metadata.
  • 19. The system of claim 15, wherein the at least one external column is a linkage column,the low-level board includes a plurality of linkage columns, andeach of the plurality of linkage columns contains additional links to each of a plurality of associated high-level boards.
  • 20. The system of claim 15, wherein the imported data influences one or more of a sorting or an arrangement of items in at least one group of the low-level board.
US Referenced Citations (796)
Number Name Date Kind
4972314 Getzinger et al. Nov 1990 A
5220657 Bly et al. Jun 1993 A
5479602 Baecker et al. Dec 1995 A
5517663 Kahn May 1996 A
5632009 Rao et al. May 1997 A
5682469 Linnett et al. Oct 1997 A
5696702 Skinner et al. Dec 1997 A
5726701 Needham Mar 1998 A
5787411 Groff et al. Jul 1998 A
5880742 Rao et al. Mar 1999 A
5933145 Meek Aug 1999 A
6016438 Wakayama Jan 2000 A
6016553 Schneider et al. Jan 2000 A
6023695 Osborn et al. Feb 2000 A
6034681 Miller et al. Mar 2000 A
6049622 Robb et al. Apr 2000 A
6088707 Bates et al. Jul 2000 A
6108573 Debbins et al. Aug 2000 A
6111573 McComb et al. Aug 2000 A
6167405 Rosensteel, Jr. et al. Dec 2000 A
6169534 Raffel et al. Jan 2001 B1
6182127 Cronin et al. Jan 2001 B1
6185582 Zellweger et al. Feb 2001 B1
6195794 Buxton Feb 2001 B1
6266067 Owen et al. Jul 2001 B1
6275809 Tamaki et al. Aug 2001 B1
6330022 Seligmann Dec 2001 B1
6377965 Hachamovitch et al. Apr 2002 B1
6385617 Malik May 2002 B1
6460043 Tabbara et al. Oct 2002 B1
6496832 Chi et al. Dec 2002 B2
6509912 Moran et al. Jan 2003 B1
6510459 Cronin, III et al. Jan 2003 B2
6522347 Tsuji et al. Feb 2003 B1
6527556 Koskinen Mar 2003 B1
6567830 Madduri May 2003 B1
6606740 Lynn et al. Aug 2003 B1
6636242 Bowman-Amuah Oct 2003 B2
6647370 Fu et al. Nov 2003 B1
6661431 Stuart et al. Dec 2003 B1
6988248 Tang et al. Jan 2006 B1
7027997 Robinson et al. Apr 2006 B1
7034860 Lia et al. Apr 2006 B2
7043529 Simonoff May 2006 B1
7054891 Cole May 2006 B2
7237188 Leung Jun 2007 B1
7249042 Doerr et al. Jul 2007 B1
7272637 Himmelstein Sep 2007 B1
7274375 David Sep 2007 B1
7379934 Forman et al. May 2008 B1
7383320 Silberstein et al. Jun 2008 B1
7389473 Sawicki et al. Jun 2008 B1
7415664 Aureglia et al. Aug 2008 B2
7417644 Cooper et al. Aug 2008 B2
7461077 Greenwood Dec 2008 B1
7489976 Adra Feb 2009 B2
7617443 Mills et al. Nov 2009 B2
7685152 Chivukula et al. Mar 2010 B2
7707514 Forstall et al. Apr 2010 B2
7710290 Johnson May 2010 B2
7770100 Chamberlain et al. Aug 2010 B2
7827476 Roberts et al. Nov 2010 B1
7827615 Allababidi et al. Nov 2010 B1
7916157 Kelley et al. Mar 2011 B1
7921360 Sundermeyer et al. Apr 2011 B1
7933952 Parker et al. Apr 2011 B2
7954064 Forstall et al. May 2011 B2
8046703 Busch et al. Oct 2011 B2
8078955 Gupta Dec 2011 B1
8082274 Steinglass et al. Dec 2011 B2
8108241 Shukoor Jan 2012 B2
8136031 Massand Mar 2012 B2
8151213 Weitzman et al. Apr 2012 B2
8223172 Miller et al. Jul 2012 B1
8286072 Chamberlain et al. Oct 2012 B2
8365095 Bansal et al. Jan 2013 B2
8375327 Lorch et al. Feb 2013 B2
8386960 Eismann et al. Feb 2013 B1
8407217 Zhang Mar 2013 B1
8413261 Nemoy et al. Apr 2013 B2
8423909 Zabielski Apr 2013 B2
8543566 Weissman et al. Sep 2013 B2
8548997 Wu Oct 2013 B1
8560942 Fortes et al. Oct 2013 B2
8566732 Louch et al. Oct 2013 B2
8572173 Briere et al. Oct 2013 B2
8578399 Khen et al. Nov 2013 B2
8601383 Folting et al. Dec 2013 B2
8620703 Kapoor et al. Dec 2013 B1
8621652 Slater, Jr. Dec 2013 B2
8635520 Christiansen et al. Jan 2014 B2
8677448 Kauffman et al. Mar 2014 B1
8738414 Nagar et al. May 2014 B1
8812471 Akita Aug 2014 B2
8819042 Samudrala et al. Aug 2014 B2
8825758 Bailor et al. Sep 2014 B2
8838533 Kwiatkowski et al. Sep 2014 B2
8862979 Hawking Oct 2014 B2
8863022 Rhodes et al. Oct 2014 B2
8869027 Louch et al. Oct 2014 B2
8937627 Otero et al. Jan 2015 B1
8938465 Messer Jan 2015 B2
8954871 Louch et al. Feb 2015 B2
9007405 Eldar et al. Apr 2015 B1
9015716 Fletcher et al. Apr 2015 B2
9026897 Zarras May 2015 B2
9043362 Weissman et al. May 2015 B2
9063958 Müller et al. Jun 2015 B2
9129234 Campbell et al. Sep 2015 B2
9159246 Rodriguez et al. Oct 2015 B2
9172738 daCosta Oct 2015 B1
9183303 Goel et al. Nov 2015 B1
9223770 Ledet Dec 2015 B1
9239719 Feinstein et al. Jan 2016 B1
9244917 Sharma et al. Jan 2016 B1
9253130 Zaveri Feb 2016 B2
9286246 Saito et al. Mar 2016 B2
9286475 Li et al. Mar 2016 B2
9292587 Kann et al. Mar 2016 B2
9336502 Mohammad et al. May 2016 B2
9342579 Cao et al. May 2016 B2
9361287 Simon et al. Jun 2016 B1
9390059 Gur et al. Jul 2016 B1
9424287 Schroth Aug 2016 B2
9424333 Bisignani et al. Aug 2016 B1
9424545 Lee Aug 2016 B1
9430458 Rhee et al. Aug 2016 B2
9449031 Barrus et al. Sep 2016 B2
9495386 Tapley et al. Nov 2016 B2
9519699 Kulkarni et al. Dec 2016 B1
9558172 Rampson et al. Jan 2017 B2
9613086 Sherman Apr 2017 B1
9635091 Laukkanen et al. Apr 2017 B1
9679456 East Jun 2017 B2
9727376 Bills et al. Aug 2017 B1
9760271 Persaud Sep 2017 B2
9794256 Kiang et al. Oct 2017 B2
9798829 Baisley Oct 2017 B1
9811676 Gauvin Nov 2017 B1
9866561 Psenka et al. Jan 2018 B2
9870136 Pourshahid Jan 2018 B2
10043296 Li Aug 2018 B2
10067928 Krappe Sep 2018 B1
10078668 Woodrow et al. Sep 2018 B1
10169306 O'Shaughnessy et al. Jan 2019 B2
10176154 Ben-Aharon et al. Jan 2019 B2
10235441 Makhlin et al. Mar 2019 B1
10255609 Kinkead et al. Apr 2019 B2
10282405 Silk et al. May 2019 B1
10282406 Bissantz May 2019 B2
10311080 Folting et al. Jun 2019 B2
10318624 Rosner et al. Jun 2019 B1
10327712 Beymer et al. Jun 2019 B2
10347017 Ruble et al. Jul 2019 B2
10372706 Chavan et al. Aug 2019 B2
10380140 Sherman Aug 2019 B2
10423758 Kido et al. Sep 2019 B2
10445702 Hunt Oct 2019 B1
10452360 Burman et al. Oct 2019 B1
10453118 Smith et al. Oct 2019 B2
10474317 Ramanathan et al. Nov 2019 B2
10489391 Tomlin Nov 2019 B1
10489462 Rogynskyy et al. Nov 2019 B1
10496737 Sayre et al. Dec 2019 B1
10505825 Bettaiah et al. Dec 2019 B1
10528599 Pandis et al. Jan 2020 B1
10534507 Laukkanen et al. Jan 2020 B1
10540152 Krishnaswamy et al. Jan 2020 B1
10540434 Migeon et al. Jan 2020 B2
10546001 Nguyen et al. Jan 2020 B1
10564622 Dean et al. Feb 2020 B1
10573407 Ginsburg Feb 2020 B2
10579724 Campbell et al. Mar 2020 B2
10587714 Kulkarni et al. Mar 2020 B1
10628002 Kang et al. Apr 2020 B1
10698594 Sanches et al. Jun 2020 B2
10706061 Sherman et al. Jul 2020 B2
10719220 Ouellet et al. Jul 2020 B2
10733256 Fickenscher et al. Aug 2020 B2
10740117 Ording et al. Aug 2020 B2
10747950 Dang et al. Aug 2020 B2
10748312 Ruble et al. Aug 2020 B2
10754688 Powell Aug 2020 B2
10761691 Anzures et al. Sep 2020 B2
10795555 Burke et al. Oct 2020 B2
10817660 Rampson et al. Oct 2020 B2
D910077 Naroshevitch et al. Feb 2021 S
10963578 More et al. Mar 2021 B2
11010371 Slomka et al. May 2021 B1
11030259 Mullins et al. Jun 2021 B2
11042363 Krishnaswamy et al. Jun 2021 B1
11042699 Sayre et al. Jun 2021 B1
11048714 Sherman et al. Jun 2021 B2
11086894 Srivastava et al. Aug 2021 B1
11222167 Gehrmann et al. Jan 2022 B2
11243688 Remy et al. Feb 2022 B1
11429384 Navert Aug 2022 B1
11620615 Jiang Apr 2023 B2
20010008998 Tamaki et al. Jul 2001 A1
20010032248 Krafchin Oct 2001 A1
20010039551 Saito et al. Nov 2001 A1
20020002459 Lewis et al. Jan 2002 A1
20020065848 Walker et al. May 2002 A1
20020065849 Ferguson et al. May 2002 A1
20020065880 Hasegawa et al. May 2002 A1
20020069207 Alexander et al. Jun 2002 A1
20020075309 Michelman et al. Jun 2002 A1
20020082892 Raffel et al. Jun 2002 A1
20020138528 Gong et al. Sep 2002 A1
20030033196 Tomlin Feb 2003 A1
20030041113 Larsen Feb 2003 A1
20030051377 Chirafesi, Jr. Mar 2003 A1
20030058277 Bowman-Amuah Mar 2003 A1
20030065662 Cosic Apr 2003 A1
20030093408 Brown et al. May 2003 A1
20030101416 McInnes et al. May 2003 A1
20030135558 Bellotti et al. Jul 2003 A1
20030137536 Hugh Jul 2003 A1
20030187864 McGoveran Oct 2003 A1
20030200215 Chen et al. Oct 2003 A1
20030204490 Kasriel Oct 2003 A1
20040032432 Baynger Feb 2004 A1
20040098284 Petito et al. May 2004 A1
20040133441 Brady et al. Jul 2004 A1
20040138939 Theiler Jul 2004 A1
20040139400 Allam et al. Jul 2004 A1
20040162833 Jones et al. Aug 2004 A1
20040172592 Collie et al. Sep 2004 A1
20040212615 Uthe Oct 2004 A1
20040215443 Hatton Oct 2004 A1
20040230940 Cooper et al. Nov 2004 A1
20050034058 Mills et al. Feb 2005 A1
20050034064 Meyers et al. Feb 2005 A1
20050039001 Hudis et al. Feb 2005 A1
20050039033 Meyers et al. Feb 2005 A1
20050044486 Kotler et al. Feb 2005 A1
20050063615 Siegel et al. Mar 2005 A1
20050066306 Diab Mar 2005 A1
20050086360 Mamou et al. Apr 2005 A1
20050091314 Blagsvedt et al. Apr 2005 A1
20050091596 Anthony et al. Apr 2005 A1
20050096973 Heyse et al. May 2005 A1
20050114305 Haynes et al. May 2005 A1
20050125395 Boettiger Jun 2005 A1
20050165600 Kasravi et al. Jul 2005 A1
20050171881 Ghassemieh et al. Aug 2005 A1
20050216830 Turner et al. Sep 2005 A1
20050228250 Bitter et al. Oct 2005 A1
20050251021 Kaufman et al. Nov 2005 A1
20050257204 Bryant et al. Nov 2005 A1
20050278297 Nelson Dec 2005 A1
20050289170 Brown et al. Dec 2005 A1
20050289342 Needham et al. Dec 2005 A1
20050289453 Segal et al. Dec 2005 A1
20060009960 Valencot et al. Jan 2006 A1
20060013462 Sadikali Jan 2006 A1
20060015499 Clissold et al. Jan 2006 A1
20060015806 Wallace Jan 2006 A1
20060031148 O'Dell et al. Feb 2006 A1
20060031764 Keyser et al. Feb 2006 A1
20060036568 Moore et al. Feb 2006 A1
20060047811 Lau et al. Mar 2006 A1
20060053096 Subramanian et al. Mar 2006 A1
20060053194 Schneider et al. Mar 2006 A1
20060069604 Leukart et al. Mar 2006 A1
20060069635 Ram et al. Mar 2006 A1
20060080594 Chavoustie et al. Apr 2006 A1
20060090169 Daniels et al. Apr 2006 A1
20060106642 Reicher et al. May 2006 A1
20060107196 Thanu et al. May 2006 A1
20060111953 Setya May 2006 A1
20060129415 Thukral et al. Jun 2006 A1
20060136828 Asano Jun 2006 A1
20060150090 Swamidass Jul 2006 A1
20060173908 Browning et al. Aug 2006 A1
20060190313 Lu Aug 2006 A1
20060212299 Law Sep 2006 A1
20060224542 Yalamanchi Oct 2006 A1
20060224568 Debrito Oct 2006 A1
20060224946 Barrett et al. Oct 2006 A1
20060236246 Bono et al. Oct 2006 A1
20060250369 Keim Nov 2006 A1
20060253205 Gardiner Nov 2006 A1
20060271574 Villaron et al. Nov 2006 A1
20060287998 Folting et al. Dec 2006 A1
20060294451 Kelkar et al. Dec 2006 A1
20070027932 Thibeault Feb 2007 A1
20070033531 Marsh Feb 2007 A1
20070050322 Vigesaa et al. Mar 2007 A1
20070050379 Day et al. Mar 2007 A1
20070073899 Judge et al. Mar 2007 A1
20070092048 Chelstrom et al. Apr 2007 A1
20070094607 Morgan et al. Apr 2007 A1
20070101291 Forstall et al. May 2007 A1
20070106754 Moore May 2007 A1
20070118527 Winje et al. May 2007 A1
20070118813 Forstall et al. May 2007 A1
20070143169 Grant et al. Jun 2007 A1
20070168861 Bell et al. Jul 2007 A1
20070174228 Folting et al. Jul 2007 A1
20070174760 Chamberlain et al. Jul 2007 A1
20070186173 Both et al. Aug 2007 A1
20070220119 Himmelstein Sep 2007 A1
20070233647 Rawat et al. Oct 2007 A1
20070256043 Peters et al. Nov 2007 A1
20070282522 Geelen Dec 2007 A1
20070282627 Greenstein et al. Dec 2007 A1
20070283259 Barry et al. Dec 2007 A1
20070294235 Millett Dec 2007 A1
20070299795 Macbeth et al. Dec 2007 A1
20070300174 Macbeth et al. Dec 2007 A1
20070300185 Macbeth et al. Dec 2007 A1
20080004929 Raffel et al. Jan 2008 A9
20080005235 Hegde et al. Jan 2008 A1
20080033777 Shukoor Feb 2008 A1
20080034307 Cisler et al. Feb 2008 A1
20080034314 Louch et al. Feb 2008 A1
20080052291 Bender Feb 2008 A1
20080059312 Gern et al. Mar 2008 A1
20080059539 Chin et al. Mar 2008 A1
20080065460 Raynor Mar 2008 A1
20080077530 Banas et al. Mar 2008 A1
20080097748 Haley et al. Apr 2008 A1
20080104091 Chin May 2008 A1
20080126389 Mush et al. May 2008 A1
20080133736 Wensley et al. Jun 2008 A1
20080148140 Nakano Jun 2008 A1
20080155547 Weber et al. Jun 2008 A1
20080163075 Beck et al. Jul 2008 A1
20080183593 Dierks Jul 2008 A1
20080195948 Bauer Aug 2008 A1
20080209318 Allsop et al. Aug 2008 A1
20080216022 Lorch et al. Sep 2008 A1
20080222192 Hughes Sep 2008 A1
20080256014 Gould et al. Oct 2008 A1
20080256429 Penner et al. Oct 2008 A1
20080270597 Tenenti Oct 2008 A1
20080282189 Hofmann et al. Nov 2008 A1
20080295038 Helfman et al. Nov 2008 A1
20080301237 Parsons et al. Dec 2008 A1
20090006171 Blatchley et al. Jan 2009 A1
20090006283 Labrie et al. Jan 2009 A1
20090013244 Cudich et al. Jan 2009 A1
20090019383 Riley et al. Jan 2009 A1
20090024944 Louch et al. Jan 2009 A1
20090048896 Anandan Feb 2009 A1
20090049372 Goldberg Feb 2009 A1
20090077164 Phillips et al. Mar 2009 A1
20090077217 McFarland et al. Mar 2009 A1
20090083140 Phan Mar 2009 A1
20090094514 Dargahi et al. Apr 2009 A1
20090113310 Appleyard et al. Apr 2009 A1
20090132470 Vignet May 2009 A1
20090150813 Chang et al. Jun 2009 A1
20090174680 Anzures et al. Jul 2009 A1
20090192787 Roon Jul 2009 A1
20090198715 Barbarek Aug 2009 A1
20090222760 Halverson et al. Sep 2009 A1
20090248710 McCormack et al. Oct 2009 A1
20090271696 Bailor et al. Oct 2009 A1
20090276692 Rosner Nov 2009 A1
20090313201 Huelsman et al. Dec 2009 A1
20090313537 Fu et al. Dec 2009 A1
20090313570 Po et al. Dec 2009 A1
20090319623 Srinivasan et al. Dec 2009 A1
20090319882 Morrison et al. Dec 2009 A1
20090327240 Meehan et al. Dec 2009 A1
20090327301 Lees et al. Dec 2009 A1
20090327851 Raposo Dec 2009 A1
20090327875 Kinkoh Dec 2009 A1
20100017699 Farrell et al. Jan 2010 A1
20100031135 Naghshin et al. Feb 2010 A1
20100070845 Facemire et al. Mar 2010 A1
20100070895 Messer Mar 2010 A1
20100083164 Martin et al. Apr 2010 A1
20100088636 Yerkes et al. Apr 2010 A1
20100095219 Stachowiak et al. Apr 2010 A1
20100095298 Seshadrinathan et al. Apr 2010 A1
20100100427 McKeown et al. Apr 2010 A1
20100100463 Molotsi et al. Apr 2010 A1
20100114926 Agrawal et al. May 2010 A1
20100149005 Yoon et al. Jun 2010 A1
20100174678 Massand Jul 2010 A1
20100228752 Folting et al. Sep 2010 A1
20100241477 Nylander et al. Sep 2010 A1
20100241948 Andeen et al. Sep 2010 A1
20100241972 Spataro et al. Sep 2010 A1
20100241990 Gabriel et al. Sep 2010 A1
20100251090 Chamberlain et al. Sep 2010 A1
20100251386 Gilzean et al. Sep 2010 A1
20100257015 Molander Oct 2010 A1
20100262625 Pittenger Oct 2010 A1
20100287163 Sridhar et al. Nov 2010 A1
20100287221 Battepati et al. Nov 2010 A1
20100313119 Baldwin et al. Dec 2010 A1
20100324964 Callanan et al. Dec 2010 A1
20100332973 Kloiber et al. Dec 2010 A1
20110010340 Hung et al. Jan 2011 A1
20110016432 Helfman Jan 2011 A1
20110028138 Davies-Moore et al. Feb 2011 A1
20110047484 Mount et al. Feb 2011 A1
20110055177 Chakra et al. Mar 2011 A1
20110066933 Ludwig Mar 2011 A1
20110071869 O'Brien et al. Mar 2011 A1
20110106636 Spear et al. May 2011 A1
20110119352 Perov et al. May 2011 A1
20110179371 Kopycinski et al. Jul 2011 A1
20110205231 Hartley et al. Aug 2011 A1
20110208324 Fukatsu Aug 2011 A1
20110208732 Melton et al. Aug 2011 A1
20110209150 Hammond et al. Aug 2011 A1
20110219321 Gonzalez Veron et al. Sep 2011 A1
20110225525 Chasman et al. Sep 2011 A1
20110231273 Buchheit Sep 2011 A1
20110289397 Eastmond et al. Nov 2011 A1
20110289439 Jugel Nov 2011 A1
20110298618 Stahl et al. Dec 2011 A1
20110302003 Shirish et al. Dec 2011 A1
20120029962 Podgurny et al. Feb 2012 A1
20120035974 Seybold Feb 2012 A1
20120036462 Schwartz et al. Feb 2012 A1
20120066587 Zhou et al. Mar 2012 A1
20120072821 Bowling Mar 2012 A1
20120079408 Rohwer Mar 2012 A1
20120081762 Yamada Apr 2012 A1
20120084798 Reeves et al. Apr 2012 A1
20120086716 Reeves et al. Apr 2012 A1
20120086717 Liu Apr 2012 A1
20120089610 Agrawal et al. Apr 2012 A1
20120089914 Holt et al. Apr 2012 A1
20120089992 Reeves et al. Apr 2012 A1
20120096389 Flam et al. Apr 2012 A1
20120096392 Ording et al. Apr 2012 A1
20120102432 Breedvelt-Schouten et al. Apr 2012 A1
20120102543 Kohli et al. Apr 2012 A1
20120110515 Abramoff et al. May 2012 A1
20120116834 Pope et al. May 2012 A1
20120116835 Pope et al. May 2012 A1
20120131445 Oyarzabal et al. May 2012 A1
20120151173 Shirley et al. Jun 2012 A1
20120158744 Tseng et al. Jun 2012 A1
20120192050 Campbell et al. Jul 2012 A1
20120198322 Gulwani et al. Aug 2012 A1
20120210252 Fedoseyeva et al. Aug 2012 A1
20120215574 Driessnack et al. Aug 2012 A1
20120215578 Swierz, III et al. Aug 2012 A1
20120233150 Naim et al. Sep 2012 A1
20120233533 Yücel et al. Sep 2012 A1
20120246170 Iantorno Sep 2012 A1
20120254252 Jin et al. Oct 2012 A1
20120254770 Ophir Oct 2012 A1
20120260190 Berger et al. Oct 2012 A1
20120278117 Nguyen et al. Nov 2012 A1
20120284197 Sitrick et al. Nov 2012 A1
20120297307 Rider et al. Nov 2012 A1
20120303262 Alam et al. Nov 2012 A1
20120304098 Kuulusa Nov 2012 A1
20120311496 Cao et al. Dec 2012 A1
20120311672 Connor et al. Dec 2012 A1
20130018952 McConnell et al. Jan 2013 A1
20130018953 McConnell et al. Jan 2013 A1
20130018960 Knysz et al. Jan 2013 A1
20130024418 Sitrick et al. Jan 2013 A1
20130024760 Vogel et al. Jan 2013 A1
20130036369 Mitchell et al. Feb 2013 A1
20130041958 Post et al. Feb 2013 A1
20130054514 Barrett-Kahn et al. Feb 2013 A1
20130055113 Chazin et al. Feb 2013 A1
20130063490 Zaman et al. Mar 2013 A1
20130086460 Folting et al. Apr 2013 A1
20130090969 Rivere Apr 2013 A1
20130097490 Kotler et al. Apr 2013 A1
20130103417 Seto et al. Apr 2013 A1
20130104035 Wagner et al. Apr 2013 A1
20130111320 Campbell et al. May 2013 A1
20130117268 Smith et al. May 2013 A1
20130159832 Ingargiola et al. Jun 2013 A1
20130159907 Brosche et al. Jun 2013 A1
20130179209 Milosevich Jul 2013 A1
20130211866 Gordon et al. Aug 2013 A1
20130212197 Karlson Aug 2013 A1
20130212234 Bartlett et al. Aug 2013 A1
20130238363 Ohta et al. Sep 2013 A1
20130238968 Barrus Sep 2013 A1
20130246384 Victor Sep 2013 A1
20130262527 Hunter et al. Oct 2013 A1
20130268331 Bitz et al. Oct 2013 A1
20130297468 Hirsch et al. Nov 2013 A1
20130318424 Boyd Nov 2013 A1
20130339051 Dobrean Dec 2013 A1
20140006326 Bazanov Jan 2014 A1
20140019842 Montagna et al. Jan 2014 A1
20140033307 Schmidtler Jan 2014 A1
20140043331 Makinen et al. Feb 2014 A1
20140046638 Peloski Feb 2014 A1
20140052749 Rissanen Feb 2014 A1
20140058801 Deodhar et al. Feb 2014 A1
20140068403 Bhargav et al. Mar 2014 A1
20140074545 Minder et al. Mar 2014 A1
20140075301 Mihara Mar 2014 A1
20140082525 Kass et al. Mar 2014 A1
20140101527 Suciu Apr 2014 A1
20140108985 Scott et al. Apr 2014 A1
20140109012 Choudhary et al. Apr 2014 A1
20140111516 Hall et al. Apr 2014 A1
20140115515 Adams et al. Apr 2014 A1
20140115518 Abdukalykov et al. Apr 2014 A1
20140129960 Wang et al. May 2014 A1
20140136972 Rodgers et al. May 2014 A1
20140137003 Peters et al. May 2014 A1
20140137144 Järvenpää et al. May 2014 A1
20140172475 Olliphant et al. Jun 2014 A1
20140173401 Oshlag et al. Jun 2014 A1
20140181155 Homsany Jun 2014 A1
20140188748 Cavoue et al. Jul 2014 A1
20140195933 Rao DV Jul 2014 A1
20140214404 Kalia et al. Jul 2014 A1
20140215303 Grigorovitch et al. Jul 2014 A1
20140249877 Hull et al. Sep 2014 A1
20140278638 Kreuzkamp et al. Sep 2014 A1
20140278720 Taguchi Sep 2014 A1
20140280287 Ganti et al. Sep 2014 A1
20140280377 Frew Sep 2014 A1
20140281868 Vogel et al. Sep 2014 A1
20140281869 Yob Sep 2014 A1
20140289223 Colwell et al. Sep 2014 A1
20140304174 Scott et al. Oct 2014 A1
20140306837 Hauck, III Oct 2014 A1
20140310345 Megiddo et al. Oct 2014 A1
20140324497 Verma et al. Oct 2014 A1
20140324501 Davidow et al. Oct 2014 A1
20140365938 Black et al. Dec 2014 A1
20140372856 Radakovitz et al. Dec 2014 A1
20140372932 Rutherford et al. Dec 2014 A1
20150032686 Kuchoor Jan 2015 A1
20150033131 Peev et al. Jan 2015 A1
20150033149 Kuchoor Jan 2015 A1
20150035918 Matsumoto et al. Feb 2015 A1
20150067556 Tibrewal et al. Mar 2015 A1
20150074721 Fishman et al. Mar 2015 A1
20150074728 Chai et al. Mar 2015 A1
20150088822 Raja et al. Mar 2015 A1
20150095752 Studer et al. Apr 2015 A1
20150106736 Torman et al. Apr 2015 A1
20150125834 Mendoza May 2015 A1
20150142676 McGinnis et al. May 2015 A1
20150142829 Lee et al. May 2015 A1
20150153943 Wang Jun 2015 A1
20150154660 Weald et al. Jun 2015 A1
20150169514 Sah et al. Jun 2015 A1
20150169531 Campbell et al. Jun 2015 A1
20150188964 Sharma et al. Jul 2015 A1
20150212717 Nair et al. Jul 2015 A1
20150220491 Cochrane et al. Aug 2015 A1
20150242091 Lu et al. Aug 2015 A1
20150249864 Tang et al. Sep 2015 A1
20150261796 Gould et al. Sep 2015 A1
20150278699 Danielsson Oct 2015 A1
20150281292 Murayama et al. Oct 2015 A1
20150295877 Roman Oct 2015 A1
20150317590 Karlson Nov 2015 A1
20150324453 Werner Nov 2015 A1
20150331846 Guggilla et al. Nov 2015 A1
20150363478 Haynes Dec 2015 A1
20150370540 Coslovi et al. Dec 2015 A1
20150370904 Joshi et al. Dec 2015 A1
20150378542 Saito et al. Dec 2015 A1
20150378711 Cameron et al. Dec 2015 A1
20150378979 Hirzel et al. Dec 2015 A1
20150379472 Gilmour et al. Dec 2015 A1
20160012111 Pattabhiraman et al. Jan 2016 A1
20160018962 Low et al. Jan 2016 A1
20160026939 Schiffer et al. Jan 2016 A1
20160027076 Jackson et al. Jan 2016 A1
20160055134 Sathish et al. Feb 2016 A1
20160055374 Zhang et al. Feb 2016 A1
20160063435 Shah et al. Mar 2016 A1
20160068960 Jung et al. Mar 2016 A1
20160078368 Kakhandiki et al. Mar 2016 A1
20160088480 Chen et al. Mar 2016 A1
20160092557 Stojanovic et al. Mar 2016 A1
20160117308 Haider et al. Apr 2016 A1
20160170586 Gallo Jun 2016 A1
20160173122 Akitomi et al. Jun 2016 A1
20160210572 Shaaban et al. Jul 2016 A1
20160224532 Miller et al. Aug 2016 A1
20160231915 Nhan et al. Aug 2016 A1
20160232489 Skaaksrud Aug 2016 A1
20160246490 Cabral Aug 2016 A1
20160253982 Cheung et al. Sep 2016 A1
20160259856 Ananthapur Bache et al. Sep 2016 A1
20160275150 Bournonnais et al. Sep 2016 A1
20160299655 Migos et al. Oct 2016 A1
20160308963 Kung Oct 2016 A1
20160321235 He et al. Nov 2016 A1
20160321604 Imaeda et al. Nov 2016 A1
20160335302 Teodorescu et al. Nov 2016 A1
20160335303 Madhalam et al. Nov 2016 A1
20160335731 Hall Nov 2016 A1
20160335903 Mendoza Tascon Nov 2016 A1
20160344828 Häusler et al. Nov 2016 A1
20160350950 Ritchie et al. Dec 2016 A1
20160381099 Keslin et al. Dec 2016 A1
20170017779 Huang et al. Jan 2017 A1
20170031967 Chavan et al. Feb 2017 A1
20170041296 Ford et al. Feb 2017 A1
20170052937 Sirven et al. Feb 2017 A1
20170061342 Lore et al. Mar 2017 A1
20170061360 Rucker et al. Mar 2017 A1
20170061820 Firoozbakhsh Mar 2017 A1
20170063722 Cropper et al. Mar 2017 A1
20170075557 Noble et al. Mar 2017 A1
20170076101 Kochhar et al. Mar 2017 A1
20170090734 Fitzpatrick Mar 2017 A1
20170090736 King et al. Mar 2017 A1
20170091337 Patterson Mar 2017 A1
20170093876 Feng et al. Mar 2017 A1
20170109499 Doshi et al. Apr 2017 A1
20170111327 Wu Apr 2017 A1
20170116552 Deodhar et al. Apr 2017 A1
20170124042 Campbell et al. May 2017 A1
20170124048 Campbell et al. May 2017 A1
20170124055 Radakovitz et al. May 2017 A1
20170124740 Campbell et al. May 2017 A1
20170126772 Campbell et al. May 2017 A1
20170132296 Ding May 2017 A1
20170132652 Kedzlie et al. May 2017 A1
20170139874 Chin May 2017 A1
20170139884 Bendig et al. May 2017 A1
20170139891 Ah-Soon et al. May 2017 A1
20170140047 Bendig et al. May 2017 A1
20170140219 King et al. May 2017 A1
20170153771 Chu Jun 2017 A1
20170161246 Klima Jun 2017 A1
20170177888 Arora et al. Jun 2017 A1
20170185668 Convertino et al. Jun 2017 A1
20170200122 Edson et al. Jul 2017 A1
20170206366 Fay et al. Jul 2017 A1
20170212924 Semlani et al. Jul 2017 A1
20170220813 Mullins et al. Aug 2017 A1
20170221072 AthuluruTlrumala et al. Aug 2017 A1
20170228445 Chiu et al. Aug 2017 A1
20170228460 Amel et al. Aug 2017 A1
20170236081 Grady Smith et al. Aug 2017 A1
20170242921 Rota Aug 2017 A1
20170262786 Khasis Sep 2017 A1
20170270970 Ho et al. Sep 2017 A1
20170272316 Johnson et al. Sep 2017 A1
20170272331 Lissack Sep 2017 A1
20170277669 Sekharan Sep 2017 A1
20170285879 Pilkington et al. Oct 2017 A1
20170285890 Dolman Oct 2017 A1
20170301039 Dyer et al. Oct 2017 A1
20170315683 Boucher et al. Nov 2017 A1
20170315974 Kong et al. Nov 2017 A1
20170315979 Boucher et al. Nov 2017 A1
20170324692 Zhou Nov 2017 A1
20170351252 Kleifges et al. Dec 2017 A1
20170372442 Mejias Dec 2017 A1
20180011827 Avery et al. Jan 2018 A1
20180025084 Conlan et al. Jan 2018 A1
20180026954 Toepke et al. Jan 2018 A1
20180032492 Altshuller et al. Feb 2018 A1
20180032570 Miller et al. Feb 2018 A1
20180055434 Cheung et al. Mar 2018 A1
20180075104 Oberbreckling et al. Mar 2018 A1
20180075115 Murray et al. Mar 2018 A1
20180075413 Culver et al. Mar 2018 A1
20180075560 Thukral et al. Mar 2018 A1
20180081863 Bathla Mar 2018 A1
20180081868 Willcock et al. Mar 2018 A1
20180088753 Viégas et al. Mar 2018 A1
20180088989 Nield et al. Mar 2018 A1
20180089299 Collins et al. Mar 2018 A1
20180095938 Monte Apr 2018 A1
20180096417 Cook et al. Apr 2018 A1
20180109760 Metter et al. Apr 2018 A1
20180121994 Matsunaga et al. May 2018 A1
20180128636 Zhou May 2018 A1
20180129651 Latvala et al. May 2018 A1
20180157455 Troy et al. Jun 2018 A1
20180157467 Stachura Jun 2018 A1
20180157468 Stachura Jun 2018 A1
20180157633 He et al. Jun 2018 A1
20180173715 Dunne Jun 2018 A1
20180181650 Komatsuda et al. Jun 2018 A1
20180181716 Mander et al. Jun 2018 A1
20180210936 Reynolds et al. Jul 2018 A1
20180225270 Bhide et al. Aug 2018 A1
20180260371 Theodore et al. Sep 2018 A1
20180276417 Cerezo Sanchez Sep 2018 A1
20180293217 Callaghan Oct 2018 A1
20180293669 Jackson et al. Oct 2018 A1
20180329930 Eberlein et al. Nov 2018 A1
20180330320 Kohli Nov 2018 A1
20180357305 Kinast et al. Dec 2018 A1
20180365429 Segal Dec 2018 A1
20180367484 Rodriguez et al. Dec 2018 A1
20180373434 Switzer et al. Dec 2018 A1
20180373757 Schukovets et al. Dec 2018 A1
20190005094 Yi et al. Jan 2019 A1
20190012342 Cohn Jan 2019 A1
20190036989 Eirinberg et al. Jan 2019 A1
20190042628 Rajpara Feb 2019 A1
20190050445 Griffith et al. Feb 2019 A1
20190050812 Boileau Feb 2019 A1
20190056856 Simmons et al. Feb 2019 A1
20190065545 Hazel et al. Feb 2019 A1
20190068703 Vora et al. Feb 2019 A1
20190073350 Shiotani Mar 2019 A1
20190095413 Davis et al. Mar 2019 A1
20190108046 Spencer-Harper et al. Apr 2019 A1
20190113935 Kuo et al. Apr 2019 A1
20190114308 Hancock Apr 2019 A1
20190123924 Embiricos et al. Apr 2019 A1
20190130611 Black et al. May 2019 A1
20190138588 Silk et al. May 2019 A1
20190138653 Roller et al. May 2019 A1
20190147030 Stein May 2019 A1
20190155821 Dirisala May 2019 A1
20190179501 Seeley et al. Jun 2019 A1
20190208058 Dvorkin et al. Jul 2019 A1
20190236188 McKenna Aug 2019 A1
20190243879 Harley et al. Aug 2019 A1
20190251884 Burns et al. Aug 2019 A1
20190258461 Li et al. Aug 2019 A1
20190258706 Li et al. Aug 2019 A1
20190286839 Mutha et al. Sep 2019 A1
20190306009 Makovsky et al. Oct 2019 A1
20190324840 Malamut et al. Oct 2019 A1
20190325012 Delaney et al. Oct 2019 A1
20190347077 Huebra Nov 2019 A1
20190361879 Rogynskyy et al. Nov 2019 A1
20190361971 Zenger et al. Nov 2019 A1
20190364009 Joseph et al. Nov 2019 A1
20190371442 Schoenberg Dec 2019 A1
20190391707 Ristow et al. Dec 2019 A1
20200005248 Gerzi et al. Jan 2020 A1
20200005295 Murphy Jan 2020 A1
20200012629 Lereya et al. Jan 2020 A1
20200019548 Agnew et al. Jan 2020 A1
20200019595 Azua Jan 2020 A1
20200026397 Wohlstadter et al. Jan 2020 A1
20200042648 Rao Feb 2020 A1
20200050696 Mowatt et al. Feb 2020 A1
20200053176 Jimenez et al. Feb 2020 A1
20200125574 Ghoshal et al. Apr 2020 A1
20200134002 Tung et al. Apr 2020 A1
20200142546 Breedvelt-Schouten et al. May 2020 A1
20200151630 Shakhnovich May 2020 A1
20200159558 Bak et al. May 2020 A1
20200175094 Palmer Jun 2020 A1
20200192785 Chen Jun 2020 A1
20200247661 Rao et al. Aug 2020 A1
20200265112 Fox et al. Aug 2020 A1
20200279315 Manggala Sep 2020 A1
20200293616 Nelson et al. Sep 2020 A1
20200301678 Burman et al. Sep 2020 A1
20200301902 Maloy et al. Sep 2020 A1
20200327244 Blass et al. Oct 2020 A1
20200334019 Bosworth et al. Oct 2020 A1
20200348809 Drescher Nov 2020 A1
20200349320 Owens Nov 2020 A1
20200356740 Principato Nov 2020 A1
20200356873 Nawrocke et al. Nov 2020 A1
20200380212 Butler et al. Dec 2020 A1
20200380449 Choi Dec 2020 A1
20200387664 Kusumura et al. Dec 2020 A1
20200401581 Eubank et al. Dec 2020 A1
20210014136 Rath Jan 2021 A1
20210019287 Prasad et al. Jan 2021 A1
20210021603 Gibbons Jan 2021 A1
20210034058 Subramanian et al. Feb 2021 A1
20210035069 Parikh Feb 2021 A1
20210042796 Khoury et al. Feb 2021 A1
20210049524 Nachum Feb 2021 A1
20210049555 Shor Feb 2021 A1
20210055955 Yankelevich et al. Feb 2021 A1
20210056509 Lindy Feb 2021 A1
20210072883 Migunova et al. Mar 2021 A1
20210073526 Zeng et al. Mar 2021 A1
20210084120 Fisher et al. Mar 2021 A1
20210124749 Suzuki et al. Apr 2021 A1
20210124872 Lereya Apr 2021 A1
20210136027 Barbitta et al. May 2021 A1
20210149553 Lereya et al. May 2021 A1
20210150489 Haramati et al. May 2021 A1
20210165782 Deshpande et al. Jun 2021 A1
20210166196 Lereya et al. Jun 2021 A1
20210166339 Mann et al. Jun 2021 A1
20210173682 Chakraborti et al. Jun 2021 A1
20210174006 Stokes Jun 2021 A1
20210192126 Gehrmann et al. Jun 2021 A1
20210264220 Wei et al. Aug 2021 A1
20210326519 Lin et al. Oct 2021 A1
20220221591 Smith et al. Jul 2022 A1
Foreign Referenced Citations (18)
Number Date Country
2828011 Sep 2012 CA
103064833 Apr 2013 CN
107123424 Sep 2017 CN
107422666 Dec 2017 CN
107623596 Jan 2018 CN
107885656 Apr 2018 CN
112929172 Jun 2021 CN
3443466 Dec 2021 EP
20150100760 Sep 2015 KR
WO 2004100015 Nov 2004 WO
WO 2006116580 Nov 2006 WO
WO 2008109541 Sep 2008 WO
WO 2017202159 Nov 2017 WO
WO 2020187408 Sep 2020 WO
WO 2021096944 May 2021 WO
WO 2021144656 Jul 2021 WO
WO 2021161104 Aug 2021 WO
WO 2021220058 Nov 2021 WO
Non-Patent Literature Citations (27)
Entry
D'Elessio et al., Monday.com Walkthrough 2018/All Features, Platforms & Thoughts, Mar. 1, 2018, pp. 1-55, 2018.
Rordigo et al., Project Management with Monday.com: a 101 Introduction; Jul. 22, 2019, pp. 1-21, 2019.
International Search Report and Written Opinion of the International Searching Authority in PCT/IB2020/000658, dated Nov. 11, 2020 (12 pages).
International Search Report in PCT/IB2020/000974, dated May 3, 2021 (19 pages).
International Search Report in PCT/1B2021/000090 dated Jul. 27, 2021.
ShowMyPC, “Switch Presenter While Using ShowMyPC”; web archive.org; Aug. 20, 2016.
International Search Report and Written Opinion of the International Search Authority in PCT/162020/000024, dated May 3, 2021 (13 pages).
“Pivot table—Wikipedia”; URL: https://en.wikepedia.org/w/index.php?title=Pivot_table&oldid=857163289, originally retrieve on Oct. 23, 2019; retrieved on Jul. 16, 2021.
Vishal Singh, “A Theoretical Framework of a Bim-based Multi-Disciplinary Collaboration Platform”, Nov. 5, 2020, Automation in Construction, 20 (2011), pp. 134-144 (Year: 2011).
Edward a. Stohr, Workflow Automation: Overview and Research Issues, 2001, Information Systems Frontiers 3:3, pp. 281-296 (Year: 2001).
International Search Report and Written Opinion of the International Search Authority in PCT/1B2021/000297, dated Oct. 12, 2021 (20 pages).
Dapulse.com “features”.extracted from web.archive.or/web/2014091818421/https://dapulse.com/features; Sep. 2014 (Year: 2014).
Stephen Larson et al., Introducing Data Mining Concepts Using Microsoft Excel's Table Analysis Tools, Oct. 2015, [Retrieved on Nov. 19, 2021], Retrieved from the internet: <URL: https://dl.acm.org/doi/pdf/10.5555/2831373.2831394> 3 Pages (127-129) (Year: 2015).
Isaiah Pinchas etal., Lexical Analysis Tool, May 2004, [Retrieved on Nov. 19, 2021], Retrieved from the internet: <URL: https:// dl.acm.org/doi/pdf/10.1145/997140.997147> 9 Pages (66-74) (Year: 2004).
Sajjad Bahrebar et al., “A Novel Type-2 Fuzzy Logic for Improved Risk Analysis of Proton Exchange Membrane Fuel Cells in Marine Power Systems Application”, Energies, 11, 721, pp. 1-16, Mar. 22, 2018.
Pedersen et al., “Tivoli: an electronic whiteboard for informal workgroup meetings”, Conference on Human Factors in Computing Systems: Proceedings of the Interact '93 and CHI '93 conference on Human factors in computing systems; Apr. 24-29, 1993:391-398. (Year 1993).
Kollmann, Franz, “Realizing Fine-Granular Read and Write Rights on Tree Structured Documents.” in the Second International Conference on Availability, Reliability and Security (ARES'07), pp. 517-523. IEEE, 2007. (Year: 2007).
Baarslag, “Negotiation as an Interaction Mechanism for Deciding App Permissions.” in Proceedings of the 2016 CHI Conference Extended Abstracts on Human Factors in Computing Systems, pp. 2012-2019. 2016 (Year: 2016).
Peltier, “Clustered and Stacked Column and Bar Charts”, Aug. 2011, Peltier Technical Services, Inc., pp. 1-128; (Year: 2011).
Beate List, “An Evaluation of Conceptual Business Process Modelling Languages”, 2006, SAC'06, Apr. 23-27, pp. 1532-1539 (Year: 2006).
“Demonstracion en espanol de Monday.com”, published Feb. 20, 2019. https://www.youtube.com/watch?v=z0qydTgof1A (Year: 2019).
Desmedt, Yvo, and Arash Shaghaghi, “Function-Based Access Control (FBAC) From Access Control Matrix to Access Control Tensor.” in Proceedings of the 8th ACM CCS International Workshop on Managing Insider Security Threats, pp. 89-92. (2016).
Anupam, V., et al., “Personalizing the Web Using Site Descriptions”, Proceedings of the Tenth International Workshop on Database and Expert Systems Applications, ISBN: 0-7695-0281-4, DOI: 10.1109/DEXA.1999.795275, Jan. 1, 1999, pp. 732-738. (Year: 1999).
Gutwin, C. et al., “Supporting Informal Collaboration in Shared-Workspace Groupware”, J. Univers. Comput. Sci., 14(9), 1411-1434 (2008).
Barai, S., et al., “Image Annotation System Using Visual and Textual Features”, In: Proceedings of the 16th International Conference on Distributed Multi-media Systems, pp. 289-296 (2010).
B. Ionescu, C. Gadea, B. Solomon, M. Trifan, D. Ionescu and V. Stoicu-Tivadar, “Achat-centric collaborative environment for web-based real-time collaboration,” 2015 IEEE 10th Jubilee International Symposium on Applied Computational Intelligence and Informatics, Timisoara, Romania, 2015, pp. 105-110 (Year: 2015).
Susanne Hupfer, Li-Te Cheng, Steven Ross, and John Patterson. 2004. Introducing collaboration into an application development environment. In Proceedings of the 2004 ACM conference on Computer supported cooperative work (CSCW '04). Association for Computing Machinery, New York, NY, USA, 21-24 (Year: 2004).
Provisional Applications (6)
Number Date Country
63148092 Feb 2021 US
63122439 Dec 2020 US
63121803 Dec 2020 US
63078301 Sep 2020 US
63019396 May 2020 US
63018593 May 2020 US
Continuations (1)
Number Date Country
Parent 17242452 Apr 2021 US
Child 18048131 US
Continuation in Parts (1)
Number Date Country
Parent 18048131 Oct 2022 US
Child 18148881 US