摘要:
A problem solving operation apparatus obtains an optimum solution for a given problem through a combined use of a plurality of optimum solution search techniques of a genetic algorithm, and other search techniques like a hill climbing method. A combination of the optimum solution search techniques applied to each of a group of solution candidates varies according to each state. When a search efficiency in a single state is lowered, the problem solving operation apparatus immediately causes a state transition to the next state, thus enabling a search of an optimum solution through the use of another combination of more efficient optimum solution search techniques. Because a state transition constantly maintains a high search efficiency, this problem solving operation apparatus can reach an optimum solution in a short amount of time.
摘要:
A problem solver apparatus for solving optimization problems, which finds better solutions at a higher speed by utilizing both genetic algorithms and OR-based techniques. When an optimization problem is given to the problem solver apparatus, a searching strategy optimization unit creates a population of individuals using a genetic algorithm. Each individual has a chromosome to indicate a solution searching strategy. Upon receipt of such a population, a solution searching unit searches for solutions according to the strategies respectively indicated by the chromosomes of the individuals, thus obtaining candidate solutions. This group of candidate solutions is returned to the searching strategy optimization unit. The searching strategy optimization unit calculates fitness values of respective candidate solutions in the received candidate group. The searching strategy optimization unit applies some genetic operators to the individuals, thereby producing a new generation population. The produced new generation population is directed to the solution searching unit to perform another search. The problem solver apparatus repeats the above procedure until the candidate solutions show some acceptable fitness values. Lastly, the fittest candidate solution is chosen as the final solution of the optimization problem.
摘要:
A portable mobile unit for alerting on incoming of a signal by a ringing sound, comprises: a ringing sound generator for generating the ringing sound in a plurality of patterns; and a controller for controlling operations of the portable mobile unit, wherein the controller select one pattern from the a plurality of patterns based on conditions which are set up in advance, when the signal comes in, so as to control the ringing sound generator to generate the ringing sound for alerting a user of the incoming call, thereby providing the portable mobile unit being superior in the usability, with which various conditions can be grasped by means of change in the ringing sound when the telephone call comes in, while achieving the discrimination of the ringing sound for alerting of the incoming call.
摘要:
A uniform-density layout problem requires an optimal layout of multiple elements in a predetermined region under a set of conditions including a density-uniformization condition. The method determines an optimal solution to the problem and comprises the steps of: (a) obtaining an initial layout of the multiple elements in the predetermined region; (b) generating a linear combination of a first objective function, which represents the remaining conditions other than the density-uniformalization condition, and a second objective function, which represents the density-uniformalization condition, as a third objective function, which is assumed to represent the set of conditions of the problem; and (c) optimizing the third objective function by executing an iterative-improvement algorithm on the third objective function using the initial layout as an initial solution. The invention is especially useful to determine a layout of multiple circuit elements in designing LSI circuits and the like.
摘要:
A data processing apparatus has a dictionary control unit in which pieces of dictionary data stored in a dictionary buffer are compared with pieces of input data to be compressed input one after another, a piece of particular dictionary data agreeing with a piece of particular input data is expelled from the dictionary buffer, the dictionary data stored in the dictionary buffer are placed close together in a direction, and the particular input data is written in the dictionary buffer. Also, a data processing apparatus has an occurrence frequency producing editor for counting an occurrence frequency of each of types of pieces of input data to be compressed and producing an occurrence frequency table formed of a plurality of occurrence frequencies of the types of the input data to be compressed, a data comparing editor for predicting an occurrence of a piece of next input data subsequent to a piece of input data, and a code converting editor for converting the types of pieces of input data according to the occurrence prediction of the next input data in the data comparing editor on condition that a type of a piece of input data is converted into a piece of compressed data having a shorter bit length as an occurrence probability of the type of the input data is higher.
摘要:
The invention provides an arrangement optimization problem processing apparatus for arranging a plurality of nodes in an optimum condition in a two- or more-dimensional space, by which an optimum arrangement of a plurality of nodes can be determined at a high speed even where a node arrangement optimization problem having a large problem scale is to be processed. The arrangement optimization problem processing apparatus includes a hyper node formation section for grouping the plurality of nodes to form a plurality of hyper nodes each formed from a set of nodes, a hyper node arrangement section for executing an optimization problem solution algorithm to determine solutions to a problem of arrangement of the plurality of hyper nodes formed by the hyper node formation section in the generation space and arranging the plurality of hyper nodes in the generation space based on one of the determined solutions.
摘要:
A cellular phone is provided with a melody sound reproducing unit comprising: a speaker for providing specified output in a range between a first frequency and a second frequency; a signal generator for supplying an audio signal to the speaker; a memory for storing signal data corresponding to an audio signal to be generated by the signal generator; and a controller for controlling the signal generator based on the signal data, wherein the signal data is stored in the memory when the frequency of the corresponding audio signal is in a range between the first frequency and the second frequency, and the audio signal whose frequency is in a range between the first frequency and the second frequency is supplied to the speaker.
摘要:
A portable mobile unit for alerting on incoming of a signal by a ringing sound, comprises: a ringing sound generator for generating the ringing sound in a plurality of patterns; and a controller for controlling operations of the portable mobile unit, wherein the controller select one pattern from the a plurality of patterns based on conditions which are set up in advance, when the signal comes in, so as to control the ringing sound generator to generate the ringing sound for alerting a user of the incoming call, thereby providing the portable mobile unit being superior in the usability, with which various conditions can be grasped by means of change in the ringing sound when the telephone call comes in, while achieving the discrimination of the ringing sound for alerting of the incoming call.
摘要:
The present invention relates to a technique relating to a method of processing a layout optimization problem. In connection with an element layout optimization problem in which it is requested to optimally arrange a plurality of elements within a space of two or more dimension, a first algorithm executing step is carried out. In this step, when information concerning the state of initial layout of the plurality of elements is available, a genetic algorithm is executed, thereby reducing non-uniformity in density of the plurality of elements staying in the initial layout. Subsequently, a second algorithm executing step is executed. In this step, when there are input data regarding the state of layout unbalance reduction halfway stage of the plurality of elements after reduction of non-uniformity in density in the first algorithm executing step, a local layout unbalance reducing algorithm is executed, thereby further reducing non-uniformity in density of the plurality of elements staying in the layout unbalance reduction halfway stage. As a result, the layout optimization problem of optimally arranging the plurality of elements in a space is processed. In this way, an element layout optimization problem of large scale is also processed.
摘要:
The invention provides a technique regarding an optimal solution search method suitable for use for optimization of a system, wherein genetic algorithms can be executed at a high speed to allow an optimal solution to a problem to be searched for at a high speed. The optimal solution search method wherein candidates for solution to a problem are represented as chromosomes which are arrangements of genes and genetic operations are performed for individual chromosomes for each generation to successively update the generation to search for an optimal solution to the problem based on fitness values calculated from gene arrangements of the chromosomes.