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

620 results about "Pareto optimal" patented technology

Statistical tracking of global server load balancing for selecting the best network address from ordered list of network addresses based on a set of performance metrics

Server load-balancing operation-related data, such as data associated with a system configured for global server load balancing (GSLB) that orders IP addresses into a list based on a set of performance metrics, is tracked. Such operation-related data includes inbound source IP addresses (e.g., the address of the originator of a DNS request), the requested host and zone, identification of the selected “best” IP addresses resulting from application of a GSLB algorithm and the selection metric used to decide on an IP address as the “best” one. Furthermore, the data includes a count of the selected “best” IP addresses selected via application of the GSLB algorithm, and for each of these IP addresses, the list of deciding performance metrics, along with a count of the number of times each of these metrics in the list was used as a deciding factor in selection of this IP address as the best one. This tracking feature allows better understanding of GSLB policy decisions (such as those associated with performance, maintenance, and troubleshooting) and intelligent deployment of large-scale resilient GSLB networks.
Owner:AVAGO TECH INT SALES PTE LTD

System and method for data collection, evaluation, information generation, and presentation

A system and method for the optimal allocation of investment funds among a portfolio of investments, and the optimal selection of candidate investments for the portfolio to optimize the financial risk of the investor relative to the financial returns. The system and method create risk tolerance functions for the investor which describe the investor's monetary utility through probability preferences with respect to specific currency amounts relative to the investor's overall assets restricted to the investors monetary range of interest. The risk tolerance function is then used in conjunction with a computed probability density function of the investment portfolio to create a probability density function of the investor's probability preferences with respect to the investor's risk tolerance function. The probability density function expresses the dispersion of risk preferences that the investor would experience as a result of the investment allocation. Investment funds are allocated to the investments of the portfolio by maximizing the expected value of the probability density function of the investor's probability preferences within a rich environment of possible parameters
Owner:RELENTLESS INTPROP LLC +1

End-to-end monitoring and optimization of a content delivery network using anycast routing

Some embodiments implement systems and methods to monitor CDN performance from the end user's perspective. To achieve full end-to-end monitoring, the systems and methods monitor the performance of Anycast routing for routing an end user to the optimal PoP of the CDN and monitor the performance of different routes that deliver content from the optimally selected PoP back to the end user. Systems and methods are also provided to leverage the monitored performance in order to automatically optimize the performance of the CDN by optimizing or modifying Anycast routing and by performing route grooming as needed to ensure that the optimal route is selected to deliver content to different sets of end users that request content from a particular PoP.
Owner:EDGIO INC

Statistical tracking for global server load balancing

Server load-balancing operation-related data, such as data associated with a system configured for global server load balancing (GSLB) that orders IP addresses into a list based on a set of performance metrics, is tracked. Such operation-related data includes inbound source IP addresses (e.g., the address of the originator of a DNS request), the requested host and zone, identification of the selected “best” IP addresses resulting from application of a GSLB algorithm and the selection metric used to decide on an IP address as the “best” one. Furthermore, the data includes a count of the selected “best” IP addresses selected via application of the GSLB algorithm, and for each of these IP addresses, the list of deciding performance metrics, along with a count of the number of times each of these metrics in the list was used as a deciding factor in selection of this IP address as the best one. This tracking feature allows better understanding of GSLB policy decisions (such as those associated with performance, maintenance, and troubleshooting) and intelligent deployment of large-scale resilient GSLB networks.
Owner:AVAGO TECH INT SALES PTE LTD

Recursive and trellis-based feedback reduction for MIMO-OFDM with rate-limited feedback

Techniques are provided for reducing feedback while maintaining performance in a MIMO-OFDM system. The disclosed techniques employ finite-rate feedback methods that uses vector quantization compression. The disclosed methods / techniques generally involve: receiving a plurality of symbols from a plurality of sub-carriers at a receiver; selecting a plurality of indices of codewords corresponding to a codebook of pre-coding weighting matrices for the sub-carriers based on vector quantization compression of the codewords; and transmitting the selected indices over a wireless channel to a transmitter. Finite state vector quantization feedback makes use of a finite state vector quantizer (FSVQ), which is a recursive vector quantizer (VQ) with a finite number of states. In finite state vector quantization feedback, optimal precoding matrices (beamforming vectors) are selected sequentially across subcarriers. In a trellis-based feedback method, the optimal precoding matrices are selected at the same time for all subcarriers by searching for the optimum choice of matrices along a trellis using the Viterbi algorithm (dynamic programming).
Owner:UNIV OF CONNECTICUT

Framework for generating mixed-mode operations in loop-level simdization

A method, computer program product, and information handling system for generating mixed-mode operations in the compilation of program code for processors having vector or SIMD processing units is disclosed. In a preferred embodiment of the present invention, program instructions making up the body of a loop are abstracted into virtual vector instructions. These virtual vector instructions are treated, for initial code optimization purposes, as vector instructions (i.e., instructions written for the vector unit). The virtual vector instructions are eventually expanded into native code for the target processor, at which time a determination is made for each virtual vector instruction as to whether to expand the virtual vector instruction into native vector instructions, into native scalar instructions, into calls to pre-defined library functions, or into a combination of these. A cost model is used to determine the optimal choice of expansion based on hardware / software constraints, performance costs / benefits, and other criteria.
Owner:IBM CORP

Power distribution network double layer planning method considering the time sequence and the reliability

ActiveCN106815657AAvoid repeated traversalImproving the Efficiency of Reliability CalculationsForecastingMathematical modelNew energy
The invention relates to a power distribution network double layer planning method considering the time sequence and the reliability. The method comprises: according to the meteorological files and the load power statistical data, obtaining the typical daily power time sequence curves of the wind electricity, the photovoltaic output and the load in different seasons; based on the opportunistic constraint planning method, creating a power distribution network framework and a distributed power capacity double layer planning mathematical model, including the objective function and the constraint condition; using the particle swarm optimization algorithm to solve the model and using the minimum spanning tree algorithm to ensure the radiation and connectivity structure of the distribution network during the iterative process; and obtaining the target network framework and the Pareto optimal solution set of the distributed power capacity so as to generate the best planning scheme. The invention solves the problems that unnecessary investment into the a power distribution network incurred by the fact that a traditional power distribution network planning method containing a distributed power supply cannot reflect the typical output characteristic of a distribution type new energy; and 2) that by incorporating the power distribution network power supply reliability into a model target function, the reliability target can be realized at the planning stage.
Owner:STATE GRID FUJIAN ELECTRIC POWER CO LTD +2

View selection for a multidimensional database

Selection of certain views of a multidimensional database to materialize may be accomplished using an efficient and effective solution. A set of all potential views may be stored in a structure. A path in the structure may then be traversed in an indicated direction through the structure, the path including two or more potential views and beginning at an indicated view. Then two or more immaterialized views in the path may be compared to each other to determine which immaterialized view is the optimum choice for maximizing benefit if selected to be materialized. Then the traversing and comparing may be continually iterated through, each iteration utilizing an indicated direction different than the last, each iteration also utilizing an indicated view set at the optimum choice determined by the last iteration, the iterating continuing until it converges on a single view. That single view may then be selected for materialization.
Owner:ORACLE INT CORP

System and method of eliminating or minimizing LO-related interference from tuners

Disclosed are systems and methods of eliminating or reducing interference resulting from harmonics of local oscillator frequencies of mixers. In one embodiment, a determination is made as to a zone or zones in which harmonics result in undesired spur generation. Inter-tuner spurs and intra-tuner spurs may be identified such that frequency information of the identified spurs may be utilized to define a plurality of exclusion zones. LO frequencies may subsequently be efficiently selected in view of the exclusion zone information. Embodiments may also determine a score for identified spurs which may be used to optimally select from within a set of spur-generating local oscillator frequencies.
Owner:CSR TECH INC

Method and system to clear counters used for statistical tracking for global server load balancing

Server load-balancing operation-related data, such as data associated with a system configured for global server load balancing (GSLB) that orders IP addresses into a list based on a set of performance metrics, is tracked. Such operation-related data includes inbound source IP addresses (e.g., the address of the originator of a DNS request), the requested host and zone, identification of the selected “best” IP addresses resulting from application of a GSLB algorithm, and the selection metric used to decide on an IP address as the “best” one. The data includes a count of the selected “best” IP addresses selected via application of the GSLB algorithm, and for each of these IP addresses, the list of deciding performance metrics, along with a count of the number of times each of these metrics in the list was used as a deciding factor in selection of this IP address as the best one. This tracking feature allows better understanding of GSLB policy decisions (such as those associated with performance, maintenance, and troubleshooting) and intelligent deployment of large-scale resilient GSLB networks. The counters can be cleared as needed and without having to reload the system.
Owner:AVAGO TECH INT SALES PTE LTD

Route planning method based on multi-target glowworm swarm algorithm

The invention provides a route planning method based on a multi-target glowworm swarm algorithm and belongs to the technical field of route planning. The method includes: modeling a route planning problem, initializing the multi-target glowworm swarm algorithm, updating the glowworm position, determining a non-inferior solution set, updating an external archived file, judging whether a preset maximum iteration number is achieved or not, and determining a Pareto optimal route. The basic glowworm swarm algorithm is improved based on the Pareto dominant conception, and global searching and parallel computing capacities of the glowworm swarm algorithm are well used. Multiple route performance indexes are considered simultaneously during planning, a group of Pareto optimal solution sets can be obtained by planning once, and high flexibility is achieved. Further, the route panning method is different from traditional route planning methods for a single target and route planning methods of using a weighing method to convert multiple targets into the single target, and can better meet practical requirements of route planning.
Owner:哈尔滨哈船导航技术有限公司

Creating optimized physical implementations from high-level descriptions of electronic design using placement-based information

An electronic design automation system provides optimization of RTL models of electronic designs, to produce detailed constraints and data precisely defining the requirements for the back-end flows leading to design fabrication. The system takes a RTL model of an electronic design and maps it into an efficient, high level hierarchical representation of the hardware implementation of the design. Automatic partitioning partitions the hardware representation into functional partitions, and creates a fully characterized performance envelope for a range of feasible implementations for each of the partitions, using accurate placement based wire load models. Chip-level optimization selects and refines physical implementations of the partitions to produce compacted, globally routed floorplans. Chip-level optimization iteratively invokes re-partitioning passes to refine the partitions and to recompute the feasible implementations. In this fashion, a multiple-pass process converges on an optimal selection of physical implementations for all partitions for the entire chip that meet minimum timing requirements and other design goals. The system outputs specific control and data files which thoroughly define the implementation details of the design through the entire back-end flow process, thereby guaranteeing that the fabricated design meets all design goals without costly and time consuming design iterations.
Owner:SYNOPSYS INC

Multi-objective evolutionary algorithm based engineering design optimization

Systems and methods of obtaining a set of better converged and diversified Pareto optimal solutions in an engineering design optimization of a product (e.g., automobile, cellular phone, etc.) are disclosed. According to one aspect, a plurality of MOEA based engineering optimizations of a product is conducted independently. Each of the independently conducted optimizations differs from others with parameters such as initial generation and / or evolutionary algorithm. For example, populations (design alternatives) of initial generation can be created randomly from different seed of a random or pseudo-random number generator. In another, each optimization employs a particular revolutionary algorithm including, but not limited to, Nondominated Sorting Genetic Algorithm (NSGA-II), strength Pareto evolutionary algorithm (SPEA), etc. Furthermore, each independently conducted optimization's Pareto optimal solutions are combined to create a set of better converged and diversified solutions. Combinations can be performed at one or more predefined checkpoints during evolution process of the optimization.
Owner:ANSYS

Multiobjective optimization apparatus, multiobjective optimization method and multiobjective optimization program

A multiobjective evolutionary algorithm unit feeds a set of parameters of an individual to a search history storage device in a fitness estimating unit and to an optimization target. The optimization target outputs a set of sampled values of fitnesses on the basis of the set of parameters of the individual. The search history storage device stores the set of parameters of the individual and a set of sampled values as a search history. The fitness estimating module computes a set of estimated values of true fitnesses on the basis of the search history stored in the search history storage device for output to the multiobjective evolutionary algorithm unit. The multiobjective evolutionary algorithm unit determines a Pareto-optimal population in accordance with a genetic algorithm on the basis of a plurality of sets of estimated values.
Owner:YAMAHA MOTOR CO LTD

Multi-objective optimization scheduling method for electric vehicle charging station including photovoltaic power generation system

The invention discloses a multi-objective optimization scheduling method for an electric vehicle charging station including a photovoltaic power generation system, and belongs to the technical field of smart power grids. Power purchase cost minimization and circulating electric quantity minimization of an energy storage system are used as objective functions, and a multi-objective optimization scheduling model of the electric vehicle charging station including the photovoltaic power generation system is built; the decision variable of the scheduling model and the constraint condition of the decision variable are determined; basic data are determined; solution is carried out through a multi-objective optimization algorithm to obtain a non-dominated solution leading surface, and then multiple Pareto optimal solutions are obtained; according to the low comprehensive cost of the main circulating electric quantity of the energy storage system and the power purchase cost, the charging station scheduling optimal scheme is selected at last. The multi-objective optimization scheduling method is suitable for the electric vehicle charging station including the photovoltaic power generation system of various cities with rich light sources; the scheduling scheme of the electric vehicle charging station including the photovoltaic power generation system is optimized; theoretical bases and technical supporting can be provided for the scheduling of the electric vehicle charging station including the photovoltaic power generation system; the operation economical efficiency of the charging station is improved.
Owner:NORTH CHINA ELECTRIC POWER UNIV (BAODING)

Method for delay-optimizing technology mapping of digital logic

A delay-optimizing technology-mapping process for an electronic design automation system selects the best combination of library devices to use in a forward and a backward sweep of circuit trees representing a design. A technology selection process in an electronic design automation-system comprises the steps of partitioning an original circuit design into a set of corresponding logic trees. Then, ordering the set of corresponding logic trees into an ordered linear list such that each tree-T that drives another ordered tree precedes the other ordered tree, and such that each ordered tree that drives the tree-T precedes the tree-T. Next, sweeping forward in the ordered linear list while computing a set of Pareto-optimal load / arrival curves for each of a plurality of net nodes that match a technology-library element. And, sweeping backward in the ordered linear list while using the set of Pareto-optimal load / arrival curves for each of the net nodes and a capacitive load to select a best one of the technology-library elements with a shortest signal arrival time. Wherein, only those net nodes that correspond to gate inputs are considered, and any capacitive loads are predetermined.
Owner:CADENCE DESIGN SYST INC

High-rigidity and light-weight design method considering uncertainty of slide block mechanism of press machine

The invention discloses a high-rigidity and light-weight design method considering uncertainty of a slide block mechanism of a press machine. The high-rigidity and light-weight design method comprises the steps of: establishing a high-rigidity and light-weight design model considering the uncertainty of the slide block mechanism of the press machine; adopting an optimized Latin hypercube sampling method for a test design, obtaining a target function response value corresponding to each sample point through collaborative simulation and building a Kriging agent model; converting an uncertain target function into a certain target function based on an order relation of interval numbers; and calculating a target function interval by utilizing an internal structure analysis way, finding a Pareto optimal solution collection of a converted certain optimal problem by utilizing a multi-target genetic algorithm, if the precision requirement is not satisfied, performing important sampling at the place where the extreme value of the target function interval locates, and updating the target function sample collection and the agent model to perform iterative optimization. The high-rigidity and light-weight design method considering uncertainty of the slide block mechanism of the press machine, disclosed by the invention, has the advantages of establishing the uncertain optimization model of the slide block mechanism according with the practical project for solving and really realizing the light-weight and high-rigidity design of the slide block mechanism.
Owner:ZHEJIANG UNIV

System and method for providing customized interactive and flexible nutritional counseling

A system provides via multiple communications channels flexible nutritional counseling that encourages users to adhere to a sensible diet. The system may recommend a compliant meal having nutritional content that is within certain dietary parameters applicable to the user. However, the system may also recommend a non-compliant meal having nutritional content that is not within the dietary parameters, but is a sensible choice in view of constraints that make it impossible or infeasible to select a compliant meal. Thus, the system may recommend a meal that is not an optimal selection, but that is a best selection from among a set of non-compliant options. Accordingly, the user has flexibility to deviate from optimal choices as practically necessary or desirable. The user confirms meals actually consumed, and the system can account for an indulgence when recommending a next meal, and / or send a motivational message to the user encouraging compliant behavior.
Owner:FOUNTAIN MOBILE

End-to-end monitoring and optimization of a content delivery network using anycast routing

Some embodiments implement systems and methods to monitor CDN performance from the end user's perspective. To achieve full end-to-end monitoring, the systems and methods monitor the performance of Anycast routing for routing an end user to the optimal PoP of the CDN and monitor the performance of different routes that deliver content from the optimally selected PoP back to the end user. Systems and methods are also provided to leverage the monitored performance in order to automatically optimize the performance of the CDN by optimizing or modifying Anycast routing and by performing route grooming as needed to ensure that the optimal route is selected to deliver content to different sets of end users that request content from a particular PoP.
Owner:EDGIO INC

Multi-target reactive power optimization method for electric system

The invention discloses a multi-target reactive power optimization method for an electric system, which belongs to the field of reactive power optimization for electric systems. The method includes: modifying the Memetic algorithm to adapt to multi-target optimization, applying the modified Memetic algorithm to the problem of multi-target reactive power optimization for the electric system, and working out a Pareto optimal solution of the multi-target problem; and judging whether algorithm convergence conditions are met or not, and if yes, completing optimization and outputting optimization results. The multi-target reactive power optimization method has the advantages that the algorithm for solving the problem of multi-target reactive power optimization is provided, the method is more suitable for solving the multi-target problem while giving play to existing advantages of the Memetic algorithm which integrates local searching and evolutionary computation and has high global search capacity and the like, and searching efficiency is improved while algorithm robustness is improved.
Owner:NORTH CHINA ELECTRIC POWER UNIV (BAODING)

Method for planning global path of robot under risk source environment

The invention discloses a method for planning the global path of a robot under risk source environment, which aims at providing a method for planning the global path capable of ensuring the robot to quickly accomplish tasks in high efficiency under the risk source environment; the method comprises the following steps of: (1) detecting and determining the information of the work environment of therobot, wherein the information comprises the starting point and the target point of the robot, the position and the shape of an obstruction, and the position of a risk source; (2) building the mode for the work environment of the robot; (3) defining the length of the path and the risk degree as two performance indexes for evaluating the good and bad of the path, wherein the two performance indexes are two target functions of the path planning problem; (4) globally optimizing the two target functions defined in the step (3) by utilizing improved multi-target particle group optimal algorithm soas to obtain a group of Pareto optimal path collection; (5) adopting a fuzzy membership function to simulate the preference of the decision maker on the task, and selecting an approving eclectic solution from the Pareto optimal path collection as the final moving path of the robot.
Owner:CHINA UNIV OF MINING & TECH

System and method for automatic selection of a good buy in price-comparison sites when the user buys more than one product at the same time

Price comparison sites on the Internet, which allow users to compare prices across multiple shops (or in other words allow shopping meta-search), are very popular today. However, these price comparison sites perform optimizations for only one item at a time but not for combinations of more than one item which can be purchased from more than one dealer. In other words, If the user wants to buy for example multiple books at the same time or for example a number of computer parts at the same time, he has to search for the best shop for each item separately, and then any attempt for example to optimize the shipping costs by aggregating more than one item from the same shop have to be done manually by the user, which can take quite a long time, and the user many times will not succeed to reach the best option or even close to it. The present invention describes a system and method for automatic finding of one or more acceptable or near-optimal suggestions for dividing the order between various vendors (preferably in terms of at least item prices plus shipment costs) in price-comparison sites when the user buys more than one product at the same time, preferably by using efficient and practical heuristics, and preferably with automatically offering additional complementary services when needed. The invention solves many problems that are involved in accomplishing this in an efficient and practical manner, and also describes additional preferable features.
Owner:MAYER YARON

Methods for cross-market brand advertising, content metric analysis, and placement recommendations

In another embodiment, a computer-implemented method for processing and optimizing selection of placement, of advertising content related to a brand, in websites of a network is provided. The computer-implemented method is processed by a server in response to communication from a user that is connected to the server over the Internet. The method includes receiving from the user, attributes of an advertisement to be placed on a brand-centric website that relates to the brand, and also receiving selections for types of websites to place the advertisement. The types of websites do not have to be brand-centric websites, but should include content related to the brand. Then, the method includes obtaining metrics from selected websites and historical performance for similar advertisements when placed on the selected websites. The method includes processing the obtained metrics and historical performance to preliminarily define an advertising model. The advertising model defines a score correlated to effectiveness of the advertisement. Optimizing the advertising model is then performed to define a recommended advertising model, where the recommended advertising model defines optimal selections of websites for placement of the advertisement. The optimizing uses multivariable optimization to correlate the obtained metrics to a desired optimization criteria.
Owner:R2 SOLUTIONS

System and process for optimization of dentures

System and processes for optimal selection of teeth for dentures based on the anatomical measurements and bite impressions of the patient. This information is applied in an iterative manner to rules that balance the anatomical and aesthetic considerations to select the best teeth for a patient. The system may also use this information in an iterative manner to rules that balance the anatomical and aesthetic considerations to design the optimal denture base for the patient as well.
Owner:GLOBAL DENTAL SCI

Flexible job-shop scheduling multi-objective method

The invention discloses a flexible job-shop scheduling multi-objective method. The specific implementation procedures of the flexible job-shop scheduling multi-objective method are that: establishing a model for a multi-objective flexible job shop; optimizing the model by using an ant colony algorithm, and evaluating the result to check whether the scheme is the optimal scheme; and improving a pheromone updating rule according to the optimal scheme, and increasing convergence rate of the algorithm to obtain a Pareto optimal solution of a multi-objective flexible job shop scheduling problem. Compared with the prior art, the flexible job-shop scheduling multi-objective method effectively reduces workshop production cost, shortens the processing time, improves qualified rate of products, is high in practicability, and is easy to popularize.
Owner:QILU UNIV OF TECH

Gradient-based methods for multi-objective optimization

Concurrent Gradients Analysis (CGA), and two multi-objective optimization methods based on CGA are provided: Concurrent Gradients Method (CGM), and Pareto Navigator Method (PNM). Dimensionally Independent Response Surface Method (DIRSM) for improving computational efficiency of optimization algorithms is also disclosed. CGM and PNM are based on CGA's ability to analyze gradients and determine the Area of Simultaneous Criteria Improvement (ASCI). CGM starts from a given initial point, and approaches the Pareto frontier sequentially stepping into the ASCI area until a Pareto optimal point is obtained. PNM starts from a Pareto-optimal point, and steps along the Pareto surface in the direction that allows improving a subset of objective functions with higher priority. DIRSM creates local approximations based on automatically recognizing the most significant design variables. DIRSM works for optimization tasks with virtually any (small or large) number of design variables, and requires just 2-3 model evaluations per Pareto optimal point for the CGM and PNM algorithms.
Owner:SEVASTYANOVA OLGA

Method and system to compare data entities

The present invention relates in general to methods and systems for comparing and maximizing the optimal selection of a first set of one or more data objects to a set of second data objects. In one embodiment, the first set of data objects represent one or more tasks to be fulfilled by a set of capabilities represented by the second data objects. In one embodiment, methods and systems are provided that apply topic modeling and similarity metrics to determine the optimal selection. In one embodiment, methods and systems are provided to determine the appropriateness of a set of second data objects to satisfy the requirements of a first data object given interaction attributes. Embodiments may be used to compare mission requirements with potential team members to determine the appropriateness of team members and teams for a given mission based on interaction attributes of the team members and teams.
Owner:APTIMA

Co-optimization of blunt body shapes for moving vehicles

A method and associated system for multi-disciplinary optimization of various parameters associated with a space vehicle that experiences aerocapture and atmospheric entry in a specified atmosphere. In one embodiment, simultaneous maximization of a ratio of landed payload to vehicle atmospheric entry mass, maximization of fluid flow distance before flow separation from vehicle, and minimization of heat transfer to the vehicle are performed with respect to vehicle surface geometric parameters, and aerostructure and aerothermal vehicle response for the vehicle moving along a specified trajectory. A Pareto Optimal set of superior performance parameters is identified.
Owner:NASA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products