31 results about "Constraint programming" patented technology

The present invention provides systems and methods for dynamic detection and prevention of electronic fraud and network intrusion using an integrated set of intelligent technologies. The intelligent technologies include neural networks, multi-agents, data mining, case-based reasoning, rule-based reasoning, fuzzy logic, constraint programming, and genetic algorithms. The systems and methods of the present invention involve a fraud detection and prevention model that successfully detects and prevents electronic fraud and network intrusion in real-time. The model is not sensitive to known or unknown different types of fraud or network intrusion attacks, and can be used to detect and prevent fraud and network intrusion across multiple networks and industries.

A method is provided for translating sets of constraint declarations to imperative code sequences based on defining an instantiatable object per set, inserting calls to a notification callback mechanism on state modification and defining calls in the constraint context as imperative code sequences that, in response to these callbacks, take actions to maintain these constraints. This notification and callback mechanism can also be employed in connection with external events, thereby providing for efficient implementation of event-sequenced imperative procedures in a constraint programming language.

The invention relates to an operating safety assessment method based on distribution network fault lost load recovery values, belonging to the technical field of power system dispatching automation and power grid simulation. The method comprises the steps of: carrying out N-1 fault scanning on a distribution network, and carrying out recovery and optimization calculation on lost electrical loads in each fault so as to obtain recoverable lost electrical load values; after the scanning is completed, accumulating lost electrical loads recovered each time so as to obtain a total recovered lost electrical load value; and establishing distribution network operating safety indicators according to a total lost electrical load value, a total recoverable lost electrical load value and the total recovered lost electrical load value. During the recovery and optimization of fault lost loads, active, reactive, voltage and radial operating restricted detailed distribution network recovery and optimization models are taken into account, and the problem of mixed integer quadratic constraint programming is solved by adopting a branch and bound method. According to the method, indicators for distribution network operating safety assessment are developed based on the optimization models, and then, the operating conditions and the safety of a network configuration of the current distribution network can be reflected.

The invention discloses a robot joint acceleration constraint planning method and system, belonging to the field of robot motion track kinematics planning. Including: establishing the D-H model of each link of the robot, obtaining the homogeneous transformation matrix and the rotation transformation matrix of the D-H link coordinate system; respectively transforming the centroid coordinates of each link from the base coordinate system to the corresponding D-H In the H-link coordinate system, obtain the equivalent moment of inertia on the motor shaft of each joint under the current pose; consider the influence of the load, update the equivalent moment of inertia; establish the dynamic equation of each link, and obtain the acceleration and motor output The functional relationship of the torque; according to the equivalent moment of inertia and the functional relationship, the amplitude constraint of the acceleration is obtained. The invention can comprehensively consider the influence of the gravity of the connecting rod of the robot and the end load on the equivalent moment of inertia of the motor shaft of each rotating joint, and analyze the maximum value of the acceleration of the motor shaft of the joint in this posture, thereby improving the motion efficiency.

Systems and methods to define a scenario of conditions comprising the steps of defining at least one condition for at least one educational objective, the at least one condition being represented by a constraint and scheduling the conditions into a scenario of conditions. In some embodiments, the scheduling is performed by analyzing the constraints using constraint programming. In some embodiments, the constraints comprise mathematical or computational constraints representing a range of variables. Also disclosed are systems and methods to monitor a scenario of conditions.

Systems and methods to define a scenario of conditions comprising the steps of defining at least one condition for at least one educational objective, the at least one condition being represented by a constraint and scheduling the conditions into a scenario of conditions. In some embodiments, the scheduling is performed by analyzing the constraints using constraint programming. In some embodiments, the constraints comprise mathematical or computational constraints representing a range of variables. Also disclosed are systems and methods to monitor a scenario of conditions.

The invention discloses an orderly charging optimization scheduling method for electric vehicles based on the Logic-Benders decomposition algorithm. The specific steps are as follows: firstly, based on the mixed integer linear programming, the main model for selecting the charging mode of the electric vehicle is constructed; secondly, based on the constraint programming, the electric vehicle is constructed The charging timing optimization sub-model; finally, the main sub-model is iteratively solved using the Logic-Benders decomposition algorithm. On the premise of ensuring the user's charging demand, the present invention realizes the optimal economic efficiency of the electric vehicle charging scheduling system by selecting the charging mode of the electric vehicle and optimizing the charging sequence.

The invention discloses a circuit breaker reliability evaluation method based on a glowworm optimization algorithm. The circuit breaker reliability evaluation method comprises the following steps: determining a main fault mode of the circuit breaker; establishing a circuit breaker fault tree; establishing a fuzzy judgment matrix between the fault factors of the circuit breaker; converting a fuzzy consistency qualification used for solving each fault factor weight into a constrained optimization problem; according to an established constraint programming problem equation, importing the glowworm optimization algorithm to solve the severity weight of each fault factor; and establishing a circuit breaker reliability evaluation model to carry out reliability evaluation and obtain a circuit breaker reliability evaluation result. When the fuzzy judgment matrixes are inconsistent, circuit breaker reliability evaluation can be carried out, and the practicability of the method is improved. In addition, when the circuit breaker reliability evaluation method calculates the severity weight of each fault factor, the glowworm optimization algorithm is introduced. Compared with the traditional calculation method, the circuit breaker reliability evaluation method has the advantages of being high in convergence precision and high in convergence speed and can more simply and quickly realize circuit breaker reliability evaluation.

A multi-day and multi-person trip planning system comprises a planning graph of nodes interconnected by transit arcs which both have associated time-variable costs and time. A user specifies user objectives within trip destinations and customizes a plurality of user preferences for a multi-day, multi-person, multi-modal trip. An optimizer compiles a plurality of permutations of visiting plans within the planning graph which satisfy the specified user objectives including routing to a plurality of trip destinations. The optimizer compares the permutations using mixed integer programming or constraint programming to identify at least one optimized visiting plan having a lowest aggregate associated cost or shortest travel time that also satisfies a plurality of constraints determined by the customizable user preferences or environment condition. Then the user interface presents at least one optimized visiting plan to a user or route related coupons.

Embodiments presented herein provide techniques for executing a block-based (BB) workflow to solve a constraint programming (CP) model related to a semiconductor manufacturing environment. Embodiments include receiving at least one BB workflow comprising a plurality of blocks. The plurality of blocks may specify a set of operations. Embodiments include accessing a plurality of block definitions corresponding to the plurality of blocks. Embodiments include executing the at least one BB workflow by performing the set of operations based on the plurality of block definitions, including extracting data from the semiconductor manufacturing environment, the data comprising both static data and dynamic data related to equipment in the manufacturing environment, creating the CP model based on the data and at least one constraint defined in the BB workflow, using a solver to determine a solution to the CP model; and publishing the solution to at least one component in the semiconductor manufacturing environment.