82results about How to "Satisfy constraints" patented technology

A video transcoding system and method employing an improved rate control algorithm. A plurality of frames in an input video bitstream are received by the system, in which each frame is in a first coding format. Each frame in the input bitstream is decoded, and complexity information indicating the complexity of the frame after decoding is obtained. An estimated number of bits to allocate for the respective frame is calculated. Using a rate estimation model that employs the complexity information for the respective frame, a picture cost for the frame is calculated based on the estimated number of bits allocated to encode the frame, and a parameter of the rate estimation model. A target cost for the respective frame is calculated based at least in part on the picture cost 10 and the complexity information for the frame. A quantization parameter (QP) is calculated that, when used to encode the respective frame in a second coding format, would generate an encoded frame having an actual cost approximately equal to the target cost. The respective frame is encoded using the calculated QP, and the frames encoded in the second coding format are provided in an output video bitstream.

A distribution plan that indicates how to encode and distribute backup data across multiple data centres may be generated. The distribution plan may be generated such that one or more characteristics of the distribution plan, such as costs, are optimized while constraints on the plan, such as protection level, recovery point objective (RPO), and recovery time objective (RTO) are satisfied. The protection level may indicate the number of the data centres that are to remain available such that the backup data is recoverable from encoded fragments of the backup data stored in the data centres that remain available.

The invention discloses a vehicle collision avoidance system and a track planning method thereof. The system comprises a forward looking radar, a camera, a vehicle speed sensor, a yaw angular velocity sensor, a sideslip angle sensor, a signal processing module, an electronic control unit (ECU), a throttle controller, a steering controller and a braking controller. When a vehicle is driven, signals which are transmitted by all sensors through the signal processing module are collected in real time by the electronic control unit, the road condition and the vehicle condition of the vehicle at the moment are judged in real time, if hazardous conditions possibly occur, a continuous collision avoidance executable track is generated by the ECU according to a track planning program preset in the ECU, and the related signals are output to the throttle controller, the steering controller and the braking controller for corresponding operations, so that the hazardous conditions are avoided. According to the vehicle collision avoidance system, a driver can be assisted to operate the vehicle in case of an emergency, so that the active driving safety performance can be increased.

Embodiments of the present invention provide a system and method for searching and reporting on semistructured data that can include dynamic metadata. One embodiment can comprise providing a user interface to a user based on an object type definition for an object type that allows the user to specify search criteria associated with a set of metadata, mapping the user search criteria to a query that comprises at least one structured query constraint and at least one unstructured query constraint, processing the query to search a set of data objects containing semistructured data associated with the object type according to the query and returning a set of results to the user. The search results can be returned to a user based on user-specified reporting parameters. Additionally, the reporting definition can be saved as an object for future execution.

A curve may be reshaped by determining new locations for its control points that minimize some measure of the change in the curve (typically, the “energy” of the change), while meeting the specified editing constraints. For example, a designer or other user may indicate an editing constraint by selecting a point anywhere on a curve and moving it to a new location. In response, the unconstrained control points may be moved automatically and simultaneously to optimal new locations. The resulting change in the curve may be aesthetically pleasing and satisfy the editing constraints. This curve editing technique may allow designers to be more productive by providing predictable and intuitive results while enabling curves to be directly manipulated.

A method allocates resources in an orthogonal frequency-division multiple access (OFDMA) network including a set of base stations (BSs), and a set of mobile stations (MSs) for each BS. Each cell includes a center and edge zone. A node weighted constraint graph is constructed for the network. Maximal independent sets in the graph are searched as sub-channels are allocated to the MSs in edge zones. Remaining bandwidth is allocated to the MSs in the center zones. Power is assigned to the sub-channels so that inter-cell interference is minimized and traffic load is maximized.

A method optimizes a dose of radiation for a radio-therapy treatment subject to constraints on diagnostic parameters of the radio-therapy treatment. The method determines a point of a polytope arranged in a coordinate system of the diagnostic parameters, such that a position of the point in the coordinate system is determined at least in part by values of each diagnostic parameter. The polytope is convex with boundaries formed by intersecting half-spaces of feasible values of each diagnostic parameter specified by the constraints. The point is the closest point of the polytope to an origin of the coordinate system with regard to a weighted Euclidean distance norm. The method determines a distribution of the dose of radiation for the radio-therapy treatment using the values of the diagnostic parameters corresponding to the position of the point.

An interactive system and method automates the control and management of routing changes that are focused on specific routes or particular network hot spots. Based on the premise that the user is aware of a particular problem that needs to be solved, the system leads the user through an end-to-end process from the identification of the problem to the generation of configuration instructions for effecting a selected solution. A graphic user interface provides a visualization of the current routing and alternative routings, to facilitate the analysis and selection of an improved routing, if any. Throughout the process, the effect of each proposed routing change on the overall network performance is determined, so that the selection of a preferred solution can be made in the appropriate context, and globally sub-optimal solutions can be avoided.

The invention discloses an unmanned aerial vehicle three-dimensional air route generation method based on hydrodynamics, and belongs to the air route programming field; according to the invention, a spherical obstacle flow steamline located at an original point along an X-axis incoming flow direction is firstly calculated; with a rotary translation matrix, a spherical obstacle flow steamline at any obstacle position in any incoming flow direction in a plane can be obtained; all the steamlines are merged into one steamline in two modes in accordance with whether a partial superposition condition is met; then the three-dimensional steamline is treated according to unmanned aerial vehicle restraint so as to obtain the unmanned aerial vehicle three-dimensional air route. The invention uses the phenomenon that running water can avoid rocks in the nature for reference, combines fluid calculation with air route programming, also considers the unmanned aerial vehicle restraint, and realizes the programming of a three-dimensional flying obstacle-avoided air route which is smooth and easy to fly. The invention is simple in landform modeling, few in calculation amount, can meet the unmanned aerial vehicle restraint, and is convenient for realization.

Packets are scheduled for transmission over a communication link in a network, using a Largest Weighted Delay First (LWDF) scheduling policy. A delay measure W_i, i=1, 2, . . . N, is computed for each of N packets, each associated with a corresponding one of N data flows and located in a head position in a corresponding one of N data flow queues. The computed delay measures are then weighted using a set of positive weights α₁, α₂, . . . , α_N. The packet having the largest weighted delay W_i/α_i associated therewith is then selected for transmission. In an embodiment configured to meet a quality of service (QoS) requirement specified in terms of a deadline T_i and an allowed deadline violation probability δ_i, e.g., a requirement specified by P(W_i>T_i)≦δ_i, the weights α_i in the set of positive weights α₁, α₂, . . . , α_N may be given by α_i=−T_i/log δ_i. The invention can also be used to meet other types of QoS requirements, including, e.g., requirements based on packet loss probabilities. For example, the QoS guarantee may be defined for a delay measure in the form of queue length Q_i, i=1, 2, . . . N, and an allowed queue length violation probability δ_i. In such an embodiment, the QoS requirement is specified by P(Q_i>H_i)≦δ_i, and the weights α_i in the set of positive weights α₁, α₂, . . . , α_N may be given by α_i=−H_i/log δ_i, where H_i represents an upper bound on the length of the queue.

The invention, which belongs to the field of underwater robots, discloses an unmanned aerial vehicle path planning method in an ocean current environment based on a population super-heuristic algorithm. A population is initialized and initial comprehensive cost values of all individuals in the whole population are obtained according to the cost function; a population basic operation set and a corresponding operation selection probability vector are set; one individual in the population and a population basic operation corresponding to the maximum probability in the operation selection probability vector are selected, the individual is operated, the basic operation of the population is repeated until the entire population is traversed, so that the iteration is completed; the operation selection probability vector is adjusted again and next iteration is carried out until the iteration number reaches a set value; and after iteration completion, an individual with the lowest cost value isselected, one group of control points is formed by combining a starting point, an end point and a fixed control point of a B-spline curve, and an optimal path is generated. Therefore, problems that the path planned based on the existing AUV path planning method is not smooth and is tracked difficultly, and the tracking energy consumption is high are solved.

An attachment structure for attaching a power plant including unducted propellers to a fuselage of an aircraft, the attachment structure being connected by first and second fasteners to respective front and rear spars penetrating into the fuselage and fastened to a carrier structure of the aircraft, and including a central longitudinal beam secured at its front end to a first frame, arranged in the plane of the front spar, that is secured at its rear end to a second rear frame, cantilevered out and arranged upstream from the unducted propellers, and that is secured to a third intermediate frame, arranged in the plane of the rear spar between the first and second frames. The first, second, and third frames are connected together by force-takeup beams, an assembly as constituted in this way forming a cradle for receiving the power plant via a standard attachment.

An existing network configuration is assessed, and potential changes to the existing configuration are identified that provide the greatest incremental improvements to the performance of the network. In a preferred embodiment, the user of the system identifies the maximum number (N) of changes that may be implemented in an existing network, and the system provides a set of possible reconfigurations, each requiring fewer than N changes. The user is presented a display of the potential improvement provided by each set as a function of the number of changes in the set, so that the relative incremental gain can be easily visualized. The objective function of the optimization may include conventional load-balancing objectives, or other objectives, such as a global minimization of path lengths.

This invention relates to a DVD-RCS superframe planning system comprising a method to specify input and an algorithm to generate optimal superframe layout. Specifically, this system allows automation of the superframe planning process. More specifically, this system generates an optimal layout that maximizes the user traffic while satisfying the requirements of operating at different symbol rates and a variety of slot types, coding types/rates and information lengths.

The disclosure relates in particular to the processing of commands targeting at least one element of a cluster including a plurality of elements, the at least one element having a link of dependency according to the at least one command with at least one other element. After having identified the at least one element and at least one dependency rule from the at least one command, a dependency graph is generated from the at least one identified element, by applying the at least one identified dependency rule, the dependency graph including peaks representing at least the element and the at least one other element, an action linked with the at least one command being associated with the peaks of the dependency graph. A sequence of instructions is then generated from the dependency graph.

The invention discloses an unmanned aerial vehicle three-dimensional air route generation method based on fluid mechanics, and belongs to the field of air route planning. The method comprises the steps of firstly calculating a ball obstacle flow-around flow line on an original point along an x-axis incoming flow direction, obtaining a flow-around flow line of any incoming flow direction and any obstacle position in a plane by utilizing a rotary translation matrix, merging all flow lines into one flow line by adopting two ways according to the situation that whether the flow lines are partially overlapped or not, and finally processing the three-dimensional flow line according to the constraint of the unmanned aerial vehicle to obtain an unmanned aerial vehicle three-dimensional air route. By referring to the phenomenon that running water in the nature can avoid rocks, the fluid calculation is combined with the air route planning; meanwhile, considering the flight constraint of the unmanned aerial vehicle, when the terrain is relatively complicated, the three-dimensional flight obstacle avoiding air route which is smooth and easy for the unmanned aerial vehicle to fly can be planned. According to the method, simplicity in terrain modeling can be realized, the calculation workload is small, the constraint of the unmanned aerial vehicle can be satisfied, and convenience in realization is achieved.

A link part for a turbine engine, in particular such as a turbojet, the link part being mounted between a fan cone and a fan disk supporting fan blades, the link part having an annular wall pierced by a plurality of orifices, each for receiving a fastener member and terminated by a substantially perpendicular rim having an outer surface that provides an aerodynamic extension of the fan between an outer surface of the fan cone and an outer surface of a fan blade platform, the annular wall being made of a first material that is composite and is provided on an inner surface of the rim with a ring made of a second material that is different from the first and that is suitable for radially retaining the fan blade platform.

A robot joint space point-to-point movement trajectory planning method. Joint space trajectory planning is performed according to the displacement of a robot from a start point to a target point during PTP movement and a limitation condition of a preset movement parameter physical quantity of each axis in a robot control system. An n-dimensional space is constructed by taking each axis of the robot as a vector, wherein n ≥2, and the movement parameter physical quantity of each axis of the robot is verified according to a vector relationship between the n axes of the robot, so that a trajectory planning curve of each axis of the robot satisfies the limitation condition of the preset movement parameter physical quantity. The method has a small amount of calculations and strong real-time performance, the movement curves are mild, the control time is optimal, and the algorithm execution effect is good.

A facility safety and compliance information system is provided as a Web-based application for managing information about deficiencies and repairs to facilities, that are subject to health and safety codes, security measures, and production and maintenance standards. The facility safety and compliance information system can maintain facility quality and keep maintenance costs in line, while also reducing liability and satisfying other regulatory constraints. The facility safety and compliance information system leverages computer information system, network, and communication technologies for automating the collection of data and the generation of regulatory and compliance documentation, while also improving the timeliness and accuracy of a facilities reporting, preparedness, and adherence to safety and compliance codes. In an exemplary embodiment of the facility safety and compliance information system, a Firestopping Information System (FIS) is provided for managing information about deficiencies and repairs to facilities that are subject to fire safety codes.

A system and related method for creating an efficient shipping strategy for shipping printed material is disclosed. The system includes a communication component, an analysis component and a shipping component. The communication component communicates printing instructions. The printing instructions include image data and at least one job parameter. The analysis component communicates with the communication component and determines at least one physical property of a print job when formed according to the printing instructions. The shipping component generates shipping information in accordance with the at least one physical property.

A judgment section determines whether or not a reduction in the power dissipation is possible by relocation of an improvement-target cell. If a reduction in the power dissipation is possible, a calculation section calculates the delay time of a target path including the improvement-target cell to obtain a possible shift distance of the improvement-target cell, within which the timing constraint is satisfied. A layout change section relocates the improvement-target cell within a range in which the power dissipation can be reduced and timing constraint can be satisfied.

The invention discloses a current-drive integrated circuit automatic wiring method which includes a reading-in step of reading in wiring information which includes information of a network to be wired, wiring design rules and current constraint, a trunk construction step of constructing a current drive trunk for avoiding obstacles according to the read-in wiring information, a detailed wiring step of achieving detailed wiring from all end points to the current drive trunk based on the constructed current drive trunk and a trunk optimizing step of optimizing line width of the current drive trunk to obtain a wiring result. The method can meet the requirement of the current for wiring line width constraint, effectively avoids wiring obstacles and optimizes wiring total area under the condition that an electric migration effect is avoided.

The invention provides a rocket power fixed-point landing guidance method. The rocket power fixed-point landing guidance method mainly comprises the steps of rocket power fixed-point landing guidancemodel establishment considering aerodynamic resistance, guidance model convexity processing and second-order cone programming problem rolling time domain optimization calculation. The method aims to solve the problem of fixed-point landing guidance under the synergistic effect of thrust and aerodynamic resistance of an engine in a power descending stage of an aircraft, and converts the original rocket power fixed-point landing guidance problem into a sequential second-order cone programming problem to be solved by adopting a technology of combining lossless relaxation and sequence iteration. Acurrent guidance period instruction is calculated through rolling time domain optimization, the adaptability of the guidance method to model parameter uncertainty and motion state deviation is improved, meanwhile, fuel optimality and guidance robustness are balanced through a control margin adjustment method, and return safety and landing control precision are effectively improved.