107 results about "PLANC" patented technology

A method of producing a reconfigurable circuit device for running a computer program of moderate complexity such as multimedia processing. Code for the application is compiled into Control Flow Graphs representing distinct parts of the application to be run. From those Control Flow Graphs are extracted basic blocks. The basic blocks are converted to Data Flow Graphs by a compiler utility. From two or more Data Flow Graphs, a largest common subgraph is determined. The largest common subgraph is ASAP scheduled and substituted back into the Data Flow Graphs which also have been scheduled. The separate Data Flow Graphs containing the scheduled largest common subgraph are converted to data paths that are then combined to form code for operating the application. The largest common subgraph is effected in hardware that is shared among the parts of the application from which the Data Flow Graphs were developed. Scheduling of the overall code is effected for sequencing, providing fastest run times and the code is implemented in hardware by partitioning and placement of processing elements on a chip and design of the connective fabric for the design elements.

This invention relates generally to a system for processing database queries, and more particularly to a method for generating high level language or machine code to implement query execution plans. The present invention provides a method for generating executable machine code for query execution plans, that is adaptive to dynamic runtime conditions, that is compiled just in time for execution and most importantly, that avoids the bounds checking, pointer indirection, materialization and other similar kinds of overhead that are typical in interpretive runtime execution engines.

A Cellular Multi-Processor Serve provides partitions having different Operating Systems such as Windows, Unix OS2200 (Unisys), Master Control Program (Unisys) or other Operating Systems, which could be designated as OS-A or OS-B. The present method and system collects and scans availability and reliability information which involve non-windows partitions with respect to planned and unplanned stops, system starts and different categories of error conditions.

A sampling-based system and method for adaptively optimizing a computer program executing in an execution environment that comprises one or more compiler devices for providing various levels of program optimization. The system comprises a runtime measurements sub-system for monitoring execution of the computer program to be optimized, the monitoring including obtaining raw profile data samples and characterizing the raw profile data; a controller device for receiving the characterized raw profile data from the runtime measurements sub-system and analyzing the data for determining whether a level of program optimization for the executing program is to be performed by a compiler device, the controller generating a compilation plan in accordance with a determined level of optimization; and, a recompilation sub-system for receiving a compilation plan from the controller and invoking a compiler device for performing the level of program optimization of the executing program in accordance with the compilation plan.

This invention relates generally to a system for processing database queries, and more particularly to a method for generating high level language or machine code to implement query execution plans. In one preferred embodiment, the method begins by receiving a subject query, and then forming an execution plan corresponding to the subject query. The execution plan will typically have a sequence of component snippets or pieces and corresponding processes for implementing the pieces. For at least one piece in the plan, the process then (a) generates source code using different code generation techniques as a function of expected runtime processing machine types; and then (b) compiles the generated source code to form machine executable code for implementing the subject query. As a result, the query executed directly as machine executable code thereby avoiding runtime interpretation of the pieces in the execution plan.

This invention relates generally to a system for processing database queries, and more particularly to a method for generating high level language or machine code to implement query execution plans. in one preferred embodiment, the method begins by receiving a subject query, and then forming an execution plan corresponding to the subject query. The execution plan will typically have a sequence of component snippets or pieces and corresponding processes for implementing the pieces. For at least one piece in the plan, the process then (a) generates source code using different code generation techniques as a function of expected runtime processing machine types; and then (b) compiles the generated source code to form machine executable code for implementing the subject query. As a result, the query executed directly as machine executable code thereby avoiding runtime interpretation of the pieces in the execution plan.

There is provided a system and a computerized method of remediating a given program running in an operating system, the method comprising: querying a stateful model to retrieve a group of entities related to the given program; terminating at least a sub set of the group of entities related to the given program; generating a remediation plan including one or more operations linked to the given program, the one or mare operations being retrieved based on the group in the stateful model; and executing the remediation plan by undoing at least part of the one or more operations linked to the given program thereby restoring state of the operating system to a state prior to the given program being executed. There is further provided a computerized method of detecting malicious code related to a program in an operating system in a live environment.

A dialog system that includes a dialog manager to manage a conversation between the dialog system and a user, and to associate the conversation with a complex activity, and a plan engine to execute a plan script in connection with the complex activity, the plan script including a set of atomic dialog activities and logic to control a data and sequence flow of the atomic dialog activities, the set of atomic dialog activities being sub-activities of the complex activity, the complex activity being specified via a declarative activity specification language that connects the atomic dialog activities with a process.

The read latency caused by job start preparation of a future job is at least partly hidden within the current job by reading information for job start preparation of the future job integrated with the execution of the current job. Instructions for job start preparation are preferably instrumented (701) into the current job and executed (702), whenever possible, in parallel with the instructions of the current job. The integrated job start preparation may include table look-ups, register file updating, instruction fetching and preparation. If the scheduled job order is allowed to change during execution, it is typically necessary to test (703) whether the next job is still valid before starting the execution, it is typically necessary to test (703) whether the next job is still valid before starting the execution of the next job and take appropriate actions (704; 705, 706) depending on the outcome of the test. In addition to reduced job start preparation time, unused slots in the instruction-parallel execution of the current job may be filled up by the added read instructions, thus providing more efficient utilization of the multiple functional execution units of the processor.

A compilation technique for computer programs forms a data flow graph of vertices which are analysed to form clusters C for parallel execution where those clusters are added to up to the point at which arbitrary selection between further vertices C, D to be added must be made. This data flow graph with these small clusters is then scheduled such that the clusters do not overlap with other clusters or with vertices outside of clusters. This starting point scheduled data flow graph is then subject to iterative processing whereby a window of timestamps is analysed to see if a candidate cluster formed by the parallel execution of the vertices within that window will result in faster execution whilst avoiding exceeding architectural constraints, such as register occupancy. If the rescheduled vertices do improve performance without exceeding architectural constraints, then this new schedule is adopted and the following vertices are subject to an adjustment in their timestamps to account for this. A window at a different point within the schedule is then adopted and an attempted rescheduling examined. This process is repeated until no progress is being made in reducing the overall execution time.

The invention discloses an engineering construction progress plan management and control system and method based on a BIM model. The system and method are used for effectively managing and controllingplan progress data. The invention belongs to the technical field of engineering construction, and the system is characterized in that the system at least comprises a BIM coding standard establishmentmodule used for establishing a unified BIM coding standard; a BIM model establishing module which is used for establishing a BIM model; an engineering construction plan generation module which is used for generating an engineering construction plan based on the BIM model; a plan displaying and compiling module which is used for displaying and compiling a plan based on a BIM model; a BIM model changing module; a progress feedback module: after plan editing is completed, the actual progress is obtained in real time; a plan progress simulation module; and an analysis module which is used for analyzing progress plan influence factors.

A method for scheduling a flag generating instruction and a subsequent instruction. The subsequent instruction has a data dependency on the flag generating instruction. The flag generating instruction is translated into first and second instructions. The subsequent instruction is translated into at least a third instruction. The first instruction, when executed, generates a result and intermediate flag generation data. The second instruction, when executed, generates a plurality of flags. The first instruction is scheduled to execute before the second and third instructions. The second instruction is scheduled to execute before the third instruction if the third instruction has a data dependency on the second instruction, otherwise the third instruction may be scheduled to execute before the second instruction.

There is provided a system and a computerized method of remediating one or more operations linked to a given program running in an operating system, the method comprising: querying a stateful model to retrieve a group of entities related to the given program; terminating at least a sub set of the group of entities related to the given program; generating a remediation plan including one or more operations linked to the given program, the one or more operations being retrieved based on the group in the stateful model; and executing the remediation plan by undoing at least part of the one or more operations linked to the given program thereby restoring state of the operating system to a state prior to the given program being executed. There is further provided a computerized method of detecting malicious code related to a program in an operating system in a live environment.

An accepting unit (110) accepts various parameters required to create a program from a parameter managing unit (109). A producing unit (112) loads a model of a program code from a model storing unit (128) on the basis of the parameters and replaces a part of the program code with the parameters to produce a source code. An instructing unit (120) detects that the producing unit (112) produces the source code to start a compiling unit (114). The compiling unit (114) compiles the source code produced by the producing unit (112) to create a research program. In this manner, a research program can be automatically created without advanced special knowledge.

A compilation technique for computer programs forms a data flow graph of vertices which are analysed to form clusters C for parallel execution where those clusters are added to up to the point at which arbitrary selection between further vertices C, D to be added must be made. This data flow graph with these small clusters is then scheduled such that the clusters do not overlap with other clusters or with vertices outside of clusters. This starting point scheduled data flow graph is then subject to iterative processing whereby a window of timestamps is analysed to see if a candidate cluster formed by the parallel execution of the vertices within that window will result in faster execution whilst avoiding exceeding architectural constraints, such as register occupancy. If the rescheduled vertices do improve performance without exceeding architectural constraints, then this new schedule is adopted and the following vertices are subject to an adjustment in their timestamps to account for this. A window at a different point within the schedule is then adopted and an attempted rescheduling examined. This process is repeated until no progress is being made in reducing the overall execution time.

The invention relates to a prediction technique for the equivalent forced outage rate of a thermal power generating unit, which is characterized in that a C-language is adopted to compile computing software used for the prediction of the equivalent forced outage rate of the thermal power generating unit; the computing software runs on a server for the computing of the reliability and availability of the thermal power generating unit; the computing software comprises the method as follows: basic data is input or called, an equivalent forced outage repair coefficient which takes out planned outage is computed; the undetermined parameters of a calculation model for the equivalent forced outage repair coefficient are determined; the equivalent forced outage rate without regard to the influence caused by planed repair is computed; a modified coefficient of the planed repair type is determined, and the equivalent forced outage rate is predicted; an evaluation basis value of the equivalent forced outage rate is determined, and the quantitative evaluation of the equivalent forced outage rate of the thermal power generating unit is determined. The prediction technique has the advantages that the equivalent forced outage rate of the thermal power generating unit can be quantitative-predicted, and the equivalent forced outage rate of the thermal power generating unit can be led to be under controlled condition.

The invention discloses a mass data quality verification method based on Hadoop. The method comprises the following steps: formulating a data quality standard; for the DDL instruction, writing metadata information of the creation table into Hive; for the DQL statement, converting the SQL character string into an abstract syntax tree, performing syntax analysis on the abstract syntax tree, analyzing whether latest generated SQL semantics are wrong or not according to a data quality standard, and adding extension information; compiling the abstract syntax tree to generate a corresponding logic execution plan, optimizing the logic execution plan, converting the optimized logic execution plan into a physical plan, generating a MapReduce job, submitting the MapReduce job to the Yarn for execution, and finally returning an execution result; storing a returned execution result into the HDFS, and carrying out data visualization and abnormal data exporting, tracking and tracing. Therefore, thedata quality verification effects of abnormal data display, traceability, easy configuration and easy classification are achieved.

The invention discloses a BIM-based whole process consultation method. The method comprises the following steps of: 1, compiling a project BIM plan book and a BIM project management requirement standard file by using a computer system in combination with the condition of a project at the initial stage of the project, so as to determine the organization framework of a BIM team and the work divisionand work plan of each member; and step 2, establishing a design model, a construction model and a completion model according to the depth requirements of engineering BIM models, and creating corresponding BIM modeling standards and the like according to the requirements of BIM models of different stages and different depths. According to the method of the invention, a drawing problem is solved through the BIM technology; the practical problems of a construction site are solved; the visa and changes of the site are reduced; the quality of construction is improved; the progress of the construction is controlled; engineering cost is saved; project construction file management based on the BIM is provided for a project; and completion data and related equipment data are input into a buildinginformation model, and therefore, the difficulty of consultation service is reduced, and cost is reduced.

The invention is a system and method used for teaching and learning computer programming. This system incorporates visualization, plan abstraction and its integration, and language constructs into one teaching and learning environment known as VPCL. There are three phases of VPCL, Plan Observation or Rehearsal, Plan Integration or Composition, and Plan Creation or Innovation. The observation Phase teaches how a program (plan) is broken down into smaller components known as a plan with their relationship. Each plan may further break down into smaller plans. At the last level plans are illustrated by language constructs. The integration phase concentrates on how plans are related to each other to build a program using the four methods of integration. The creation phase concentrates on how a new plan is created using the existing plans along with system resources. VPCL can be applied to other problem solving tasks such as mathematics, science, physics, chemistry, biology, or linguistics.

The present invention is related to production schedules in a refinery and, more particularly, refinery production schedules by genetic programming in domain specific language. In this scenario, the present invention provides a method and an optimization system based on linear genetic programming oriented to grammar and with quantic inspiration using a domain specific language for the solution of oil programming problems, in addition to a readable medium comprising instructions to perform this said method. More specifically, the quantic chromosome keeps the superposition of states of all possible solutions and, through the evolutionary process and observation of quantic genes, the classical chromosome is created as a linear sequence of instructions to be performed. The performed instructions represent the scheduling. The orientation of this process is made through the use of a multiple-goal competence function that ranks evaluations about the operation time of the distillation units, the time for unloading ships, the use of the pipeline that moves oil between the terminal and the refinery, as well as factors such as the number of tanks exchanges and use of injection tanks in the distillation units.

A pre-pass and direct call mechanism which replaces the interpreter. The mechanism moves static decisions out of the repeated runtime path into a pre-pass operation. Advantageously, the mechanism reduces runtime overhead and improves overall performance of the DBMS during runtime, while maintaining the considerable investment in opcode generation and plan representation.

The invention provides a message fault tolerance method and system based on a Spark stream computing framework. The method comprises the following steps: creating a workflow program, setting a metadata check point task, and storing streaming computing information added into the program and a configuration version label into a storage system; setting a Spark stream to read messages from the messagequeue to obtain a data set, completing data set conversion operation in the Spark stream, and creating a logic execution plan; when state conversion exists in the Spark stream and a data check pointexists, setting a data set to perform state conversion processing, and adding a program and a configuration version label into a data check point task; when the system breaks down, setting the Spark stream to obtain the program and configuration version information in the check point, and when the program and configuration version information changes, starting a redo task and the check point, andwhen the program and configuration version information does not change, restarting the program; and starting a new version program, and performing subsequent data recovery processing through the new version check point.

The invention discloses a comparison test method and device, computer equipment and a storage medium, and the method comprises the steps: receiving a test request of a to-be-tested application program of a current version, generating a corresponding test task according to the test request, executing the test task, executing a corresponding test operation on the to-be-tested application program of the current version, obtaining current test result data, comparing the current test result data with historical test result data of the to-be-tested application program of the historical version according to a preset rule to obtain a comparison result, and determining whether the to-be-tested application program of the current version passes the test or not according to the comparison result. According to the invention, the efficiency of software testers is improved, the test time is saved, the software test quality is greatly improved, the test time is shortened, the configured test cases and plans are automatically executed, and the test result data is fed back.

Embodiments of the invention provide systems and methods for handling internal compiler errors encountered during compilation of a computer program without breaking the compilation. Implementations of a computer-implemented compiler system include a compiler driver, configured to compile a computer program according to a set of compiler settings, and a number of compiler components, each corresponding to a portion of the computer program. Each compiler component is configured to detect an internal compiler error during compilation of the component; identify a recovery plan having a recovery target and at least one recovery setting; and direct the driver to continue compiling the computer program according to the recovery plan, such that the compilation recompiles from the recovery target and according to a modified set of compiler settings according to the at least one recovery setting.

A method and a system are presented for enabling coordinated executions of actions in a distributed computing system with untrusted local computing agents. A smart contract including plans is recorded in a blockchain database. Each plan includes actions to be executed by a respective one of the local computing agents. Execution of a first action of a first set of actions to be executed by a first local computing agent is requested. Execution of a second action of a second set of actions to be executed by a second local computing agent is requested. Responsive to determining, based on the smart contract, that the first action can be executed, the first local computing agent is caused to execute the first action and responsive to determining, based on the smart contract, that the second action cannot be executed, the second local computing agent is caused to not execute the second action.

The invention discloses a multi-language program execution method and device and a storage medium. The method specifically comprises the following steps: firstly, obtaining calculation tasks and corresponding data related to a plurality of different language mechanism models; then, obtaining a mechanism model involved in the calculation task; then, creating an execution plan according to the calculation task and the mechanism model, executing corresponding calculation or operation according to the execution plan, and when any mechanism model in the mechanism model needs to be executed in the calculation or operation, obtaining a mechanism model executor corresponding to the computer programming language for achieving the corresponding mechanism model; and sending the corresponding mechanism model and the to-be-calculated data to a mechanism model actuator, and receiving a calculation result returned by the mechanism model actuator. Therefore, the mechanism models realized by different computer programming languages can cooperate with the mechanism model actuators corresponding to the different computer programming languages to complete one computing task through the arrangement of the execution plan.

The invention provides a method for creating a safety closed-loop process based on MITRE ATT&CK, which comprises the following steps: 1) obtaining data to obtain an MITREATT&CK framework; 2) obtainingan opponent attack plan; 3) simulating an attack according to the opponent attack plan to obtain a simulated attack determination result; and 4) constructing an improvement plan according to a resultdetermined by the simulation attack. The MITRE ATT&CK provides a framework of a structure for researching and analyzing attacks. The threat modeling method and model suite of the matrix for each stage of the hand life cycle comprise changes of several main operating systems such as Windows, MacOS and Linux. It can provide context for describing attacks and help identify. An attack chain with a real simulation environment and upper and lower texts is created among an available data source, an MITREATT & CK matrix and a workflow of an analyst, so as to understand the defense capability gap.

A manufacturing process management (MPM) computer device is provided. The MPM computer device includes a processor and at least one memory device. The processor is in communication with the at least one memory device. The MPM computer device is configured to receive a first engineering design for a first configuration of a product to be assembled including a plurality of features, determine a plurality of parts associated with the plurality of features based on the received engineering design, and prior to completion of a manufacturing process plan, generate a manufacturing bill of materials based on the determined plurality of parts.

The invention discloses a data processing method. The method comprises the following steps: determining a target technical and battle method; obtaining a dependency tree corresponding to the target technical and tactical method; performing semantic analysis on the dependency tree to obtain a logic plan corresponding to the dependency tree; optimizing the logic plan to obtain a corresponding physical plan; and running the physical plan by using a streaming computing engine to obtain a computing result. The streaming computing technology is utilized, the efficiency of custom logic computing of mass data in a public security scene is greatly improved, the reliability and the flexibility of the system are improved, meanwhile, a user can see the result of a computed part without waiting for all data to be computed, and the usability of the system is improved.