Abstract: A computer determines to which of a plurality of levels each of a plurality of road types for which a path search is performed corresponds, according to a distance between a departure point and a destination point. Next, the computer performs a first path search for the road type associated with a first level from the departure point to the destination point, and a second path search for the road type associated with the first level from the destination point to the departure point. Then, the computer performs a third path search for the road type associated with a second level according to a point obtained in the first path search and a point obtained in the second path search, and generates path information according to a result of the first path search, the second path search, and the third path search.

Abstract: A computer determines to which of a plurality of levels each of a plurality of road types for which a path search is performed corresponds, according to a distance between a departure point and a destination point. Next, the computer performs a first path search for the road type associated with a first level from the departure point to the destination point, and a second path search for the road type associated with the first level from the destination point to the departure point. Then, the computer performs a third path search for the road type associated with a second level according to a point obtained in the first path search and a point obtained in the second path search, and generates path information according to a result of the first path search, the second path search, and the third path search.

Abstract: A computer refers to observation data formed by observing, at plural timings, a travel time taken for a vehicle to pass through a road section. The computer then obtains a first statistical value of the travel time at a first time of a prediction target day based on the observation data. The computer further obtains a second statistical value of the travel time at a second time later than the first time. The computer then calculates a prediction value of the travel time at the second time based on the first statistical value, the second statistical value, and the travel time observed at the first time. The computer calculates the prediction value such that a difference between the second statistical value and the prediction value at the second time is smaller than a difference between the first statistical value and the travel time observed at the first time.

Abstract: A computer performs a path search from a first node to a second node by using nodes and links connecting two nodes and to which a cost is set. A first search method is used to search for one node from among nodes to be searched which are adjacent to the searched-for node and have not yet been searched for. Then, the distance between the searched-for node and the second node is recorded, and the searched-for node is recorded as an already-searched-for node. Next, the first search method is changed to a second search method in which a number of nodes to be searched is prevented from increasing according to distances between the second node and two or more searched-for nodes obtained as a result of performing searching and recording plural times. Then, path information is generated according to a node searched for by the second search method.

Abstract: A computer performs a path search from a departure point to a destination point and a path search from the destination point to the departure point while changing a target from a road type at a level other than the highest level to a road type at a higher level, according to a first grouping of a plurality of road types, and performs a path search for the road type at the highest level in a first process. Next, the computer performs similar path searches in an area to be searched based on a result of the first process, according to a second grouping in which a greater number of road types is classified as the highest level in a second process. Then, the computer generates path information according to a result of the second process.

Abstract: A computer performs a path search from a departure point to a destination point and a path search from the destination point to the departure point while changing a target from a road type at a level other than the highest level to a road type at a higher level, according to a first grouping of a plurality of road types, and performs a path search for the road type at the highest level in a first process. Next, the computer performs similar path searches in an area to be searched based on a result of the first process, according to a second grouping in which a greater number of road types is classified as the highest level in a second process. Then, the computer generates path information according to a result of the second process.

Abstract: A computer determines to which of a plurality of levels each of a plurality of road types for which a path search is performed corresponds, according to a distance between a departure point and a destination point. Next, the computer performs a first path search for the road type associated with a first level from the departure point to the destination point, and a second path search for the road type associated with the first level from the destination point to the departure point. Then, the computer performs a third path search for the road type associated with a second level according to a point obtained in the first path search and a point obtained in the second path search, and generates path information according to a result of the first path search, the second path search, and the third path search.

Abstract: A computer performs a path search from a first node to a second node by using nodes and links connecting two nodes and to which a cost is set. A first search method is used to search for one node from among nodes to be searched which are adjacent to the searched-for node and have not yet been searched for. Then, the distance between the searched-for node and the second node is recorded, and the searched-for node is recorded as an already-searched-for node. Next, the first search method is changed to a second search method in which a number of nodes to be searched is prevented from increasing according to distances between the second node and two or more searched-for nodes obtained as a result of performing searching and recording plural times. Then, path information is generated according to a node searched for by the second search method.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: An information processing system such as a portable telephone or PC is provided in which operating convenience for displaying the notification of copyright protection information is improved. The system includes an interface for receiving first information regarding a video and/or a audio and second information for restricting a processing of the first information, a memory for storing the first and second information received by the interface, and a processor for processing the video and/or the audio based on the first information stored in the memory and displaying information for restricting the processing of the first information based on the stored second information while the video and/or the audio based on the first information is being processed.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.