Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.

225 results about "Flowchart" patented technology

A flowchart is a type of diagram that represents a workflow or process. A flowchart can also be defined as a diagrammatic representation of an algorithm, a step-by-step approach to solving a task. The flowchart shows the steps as boxes of various kinds, and their order by connecting the boxes with arrows. This diagrammatic representation illustrates a solution model to a given problem. Flowcharts are used in analyzing, designing, documenting or managing a process or program in various fields.

Systems and methods for encoding knowledge for automated management of software application deployments

A method of encoding knowledge is disclosed, which can be used to automatically detect problems in software application deployments. The method includes accessing a source of knowledge describing a problem known to occur in deployments of a particular software application, and which identifies a plurality of conditions associated with the problem. An encoded representation of the knowledge source is generated according to a predefined knowledge encoding methodology. The encoded representation is adapted to be applied automatically by a computer to analyze data representing a current state of a monitored deployment of the software application to detect whether the conditions and the problem exist therein. In various implementations, the encoded representation of the knowledge can include queries for deployment information, information concerning the relative importance of the conditions to a detection of the problem, and/or logical constructs for computing a confidence value in the existence of the problem and for determining whether to report the problem if some of the conditions are not true. The knowledge source can comprise a text document (such as a knowledge base article), a flowchart of a diagnostic troubleshooting method, and the like. Also disclosed are methods of at least partially automating the encoding process.

Workflow realization method and workflow system capable of customizing flow in user-defined manner

The invention provides a workflow realization method capable of customizing a flow in a user-defined manner. The method comprises the following steps of: establishing a WYSIWYG (What You See Is What You Get) webpage flow editor; drawing a flow diagram by a system manager; starting a platform program and generating an operation code so as to generate a corresponding workflow operation program; filling in a system by a terminal user, submitting a form, and triggering and starting the workflow working program; and sequentially operating all the flows by the system until the flows are finished. The invention further provides a workflow system capable of customizing the flow in the user-defined manner and the workflow system comprises a defining module, an analyzing module, a workflow engine module, a flow execution module and a database module. According to the invention, the problem that the existing workflows need to be modified by programmers or a modification tool is separated from a user is solved; and the workflow realization method and the workflow system have the advantages of easiness of modification and maintenance, time conservation and cost conservation.

Systems, methods and computer program products for designing, deploying and managing interactive voice response (IVR) systems

An IVR system may be designed by accepting designer inputs to generate, on a display screen, a flowchart of interconnected flowchart processing blocks and flowchart decision blocks that represent a process flow of processing steps and branches, respectively, in the IVR system. By allowing the designer to generate a flowchart of interconnected flowchart processing blocks and flowchart decision blocks on a single display screen, a potentially simplified graphical user interface may be provided for designing an IVR system. The flowchart of interconnected flowchart processing blocks and flowchart decision blocks may be executed, based on at least one designer input on a keypad image, to simulate or test the IVR system. A self-documenting audit trail may be provided during the design of the IVR system. These audit trails may be associated with a version of the IVR system, so that multiple versions of the system may be managed. When deploying the IVR system, caller inputs may be sequentially stored in an order in which they were provided by the caller, to provide call logging. Regulatory compliance thereby may be facilitated.

Apparatus for generating software logic rules by flowchart design

A apparatus implemented using a programmable computer that automatically generates the rules required by a software rules engine as a process flow diagram is designed. The apparatus includes a developer interface; an editing interface, and a rules generator. A developer interface enables the user to define functions and variables together with their properties from the business application. An editing interface allows the user to define the logical rules the business would follow in performing the business application by constructing a process flow diagram and associated tables using the functions and variables defined in the developer interface. The rules generator then automatically parses the flow diagrams and tables defined by the business user and, using the functions and variables defined in the developer interface, generates rules for a rules engine. The rules can then be deployed to a controller that implements the process automatically based on the input rules.

System and method for defining dialog intents and building zero-shot intent recognition models

A system and method of creating the natural language understanding component of a speech / text dialog system. The method involves a first step of defining user intent in the form of an intent flow graph. Next, (context, intent) pairs are created from each of the plurality of intent flow graphs and stored in a training database. A paraphrase task is then generated from each (context, intent) pair and also stored in the training database. A zero-shot intent recognition model is trained using the plurality of (context, intent) pairs in the training database to recognize user intents from the plurality of paraphrase tasks in the training database. Once trained, the zero-shot intent recognition model is applied to user queries to generate semantic outputs.

Dynamic and evolutionary placement in an event-driven component-oriented network data processing system

Method, system and computer readable program code for dynamic and evolutionary component placement in an event processing system having producers, consumers, a plurality of nodes between the producers and the consumers, and a flow graph representing operator components to be executed between the producers and the consumers. A description of a change to the system is received. At each node, next-hop neighbor nodes for each consumer are identified. A routing value is assigned to each next-hop neighbor node for each consumer and the routing values are updated according to an update rule that represents a chromosome in a routing probe. The update rule in a routing probe is selectively updated from a plurality of update rules at the consumer. The probability of selecting a particular update rule is reinforced or decayed based on the success of an update rule in allowing routing probes to create many different efficient routes. At each producer, nests of scouting probes are adaptively selected from an available set of nests and dispatched to execute hypothetical placement of a query by an independent agent called a “leader”. A placement of the operator components that minimizes performance cost of the system relative to the hypothetical placement is selected. Each scouting probe contains chromosomes that guide placement. Scouting probes in two different nests have different chromosomes. The performance cost of the hypothetical changed placement is evaluated and the performance evaluation is used to evolve at least one chromosome of a scouting ant in each nest.

Method and apparatus for obtaining profile data for use in optimizing computer programming code

Program execution profile data is collected by direct measurement of some code paths, and by inferring data for unmeasured paths. The data collection process may cause errors, which are propagated by the inferencing process. The profile data thus constructed is further enhanced by detecting certain data mismatches, and adjusting inferred data to reduce the scope of errors propagated during the inferencing process. Preferably, a control flow graph of the program being measured is constructed. Mismatches in the total weights of input arcs versus output arcs are detected. For certain specific types of mismatches, it can be known or guessed which count is incorrect, and this count is accordingly corrected. Correction of arc counts proceeds recursively until it is no longer possible to correct mismatches. Additionally, certain other conditions are adjusted as presumed inaccuracies.

Configuration of machine processes

The invention relates to a method for creation, editing, monitoring and / or optimizing the overall machine process of a programmable machine or installation, supported at the user end by a graphics editor. In this case, the programmable machine or installation is first of all assembled as a system of individual machine units which are involved in the overall machine process during particular time periods, by carrying out a number of partial machine processes. These partial machine processes of the machine units which are involved in the overall machine process are first of all synchronized with one another, after their definition, and are then configured. All of the above method steps are carried out on the basis of a two-dimensional flowchart (I), which is produced by the graphics editor,in the chart area of which symbols relating to the associated process are entered for all the partial machine processes involved in the overall machine process. In this case, the process symbols are positioned or repositioned by the graphics editor such that they are arranged in one machine component dimension corresponding to their association with a machine unit and in a time dimension corresponding to the synchronization of their associated partial machine processes with further partial machine processes of the same machine unit or with partial machine processes of other machine units.

Multilayer flowchart dialogue organizing linguistic data-based natural language question-answering method

InactiveCN101739434ASpecial data processing applicationsShortest distanceNatural language question answering
The invention relates to an information retrieval and natural language question-answering system and the field of natural language processing, in particular to a question-answer library-based natural language question-answering system. The invention aims to provide a method for making a context of a dialogue of the question-answering system have coherence, which is named a multilayer flowchart dialogue organizing linguistic data-based natural language question-answering method. The method is characterized in that: a multilayer flowchart is used for saving logical relationships among the linguistic data. Two nodes having shorter distance in the flowchart have larger correlation degree, which is taken as a basis to select the node having larger correlation degree in the dialogue. The method can effectively improve contextual coherence of the dialogue of the question-answering system.

Methods for Identifying Actions in a Flowchart

Tools, methods and systems for identifying coordinated actions in a flowchart representing a multimedia experience. These include displaying a graphical view of a flowchart representing a multimedia experience and defining, within the flowchart, a cell including a primary action configured to trigger playback of a primary media asset and secondary actions configured to trigger playback of secondary media assets, wherein each of the secondary actions has a timing coordinated with the primary action. The tools, methods and systems further include displaying a representation of the primary action, displaying representations of the secondary actions in chronological order according to their timing, and visually associating each of the representations of the secondary actions with the representation of the primary action.

Custom database system and method of building the same

A master application is installed on an organizational computer system to guide organizational personnel through the steps of constructing a customized database. Upon selecting a computer server and platform to host the database, organizational processes are divided into building blocks having well-defined input-output relationships. The application provides a list of organizational types and business processes in the form of modules that facilitate the construction of an organizational data flowchart that extends to all users of the system. Each user has a user identification that predetermines the ability of an end user to input data, receive reports and have other privileges associated therewith. An end user is provided with a graphical interface with the database, the graphical interface being customizable to a format chosen by the end user. The inventive application is not language specific but rather is scripted onto the underlying database with SQL program language to construct the entire database including constraints, triggers, procedures, indices and key fields. A database system is thereby provided that includes a transactional database housed on a first computer server for receipt of data input. A processing database optionally also providing reporting is in communication with the transactional database for receipt of the data input from the transactional database and process data. A user computer interface transmits the data input to the transactional database.

Performance evaluation apparatus, performance evaluation method, program and computer readable recording medium

From an application program described in the form of a flow graph, input and output arcs are extracted. Packet rates on the input and output arcs are extracted, and it is determined whether the packet rates of the input arc and the output arc are lower than an upper-limit value of a pipeline transfer rate of a processor element. Based on the determination result, it is determined whether it is possible to execute the described flow graph program in the processor element. Performance evaluation of a program to be executed by a data driven processor based on an asynchronous pipeline transfer control can be carried out with ease and in a short time.

Method of inquiring e-mail sending status in real time

A method of inquiring status of a sent e-mail includes displaying a screen of e-mail list having records each including size, subject, sending time, success times, failure times, and times to be sent; clicking the e-mail in the list to enter a screen about details of sent e-mails including a success sending portion and a failure sending portion including status description for indicating the cause of failure; linking the status description to enter a description screen including a flowchart for illustrating steps of the e-mail sending wherein the step is highlighted if an error is occurred therein and a corresponding description is shown; and showing an icon in an area on a computer screen for indicating whether the sent e-mail is a success or not. The sender is able to immediately send the failed e-mail again after correcting the error as shown.

Design method of production flow

The invention relates to a design method of a production flow. In the method, a final assembly (FA) process technique flowchart is drawn: firstly, selecting that the FA process technique flowchart of which spacecraft needs to be generated under a product tree, wherein the FA process technique flowchart comprises parallel operation nodes (M3, M4) and key nodes (M6, M7), and the next node is drawn after the key nodes (M6, M7) are finished; an FA process route chart is drawn: firstly, selecting to generate a process route chart of the FA process, wherein the process route chart comprises parallel operation nodes (K3, K4) and key nodes (K6, K7), the next node is drawn after the key nodes (K6, K7) are finished, the meeting position of arrows of parallel nodes is represented by a hollow or solid circle, and a numeric ordinal (K1) is generated automatically after a geometric figure is increased at one time; the incidence relation between the nodes in a graph is defined: establishing the congruent relationship M-K of the node M in the process flowchart and the node K in the process route chart and adding the corresponding process and the nodes K in the corresponding process in each pixel in the graph after drawing the FA process technique flowchart; a procedure information K-procedure is added in the process route chart: each node in a procedure route chart does not correspond to each procedure in a procedure list, each node in the process route chart can correspond to a plurality of procedures in the procedure list, but one procedure in the procedure list only belongs to one node in the procedure route chart; graphs are browsed: the graphs are managed by adopting the product tress mode; when one type on a structural tree is selected, the corresponding process technique flowchart can be displayed; sub-nodes in the process technique flowchart form the process route chart, and each pixel in the process route chart can display the corresponding.

Factored assert chains

Factored assert chains allow for improved tracking of implicit information in a computer program. The compiler may generate assert statements at various points in the program where there is implicit information. The dominator tree for the program or section of program may then be constructed. Then φ-nodes may be inserted throughout a control flow graph. Following that, for each statement in the program or section of program, an assert chain may be constructed from each use to the most recent available assert statement for the variable. Then, if the statement is an assert statement, each use may be kept track of as a mapping to an assertion, otherwise a mapping of any reference to an assert statement for each definition may be deleted. This may then iterate through the dominator tree. At the end, a series of factored assert chains remains, which may be utilized by the compiler to improve the efficiency of generated code.
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products