-
1.发明专利
公开(公告)号：JP2003256855A
公开(公告)日：2003-09-12
申请号：JP2002043161
申请日：2002-02-20
Applicant: IBM
Inventor： IKEHATA HIROKO , ITO TAKAYUKI , KAJINAGA YASUMASA
Abstract: PROBLEM TO BE SOLVED: To provide a method for visualizing statistical data by which highly visible plotting is conducted at all times by arranging rectangles corresponding to individual data in an order corresponding to the partition values of hierarchies and displaying a desired rectangle in a shape close to a square. SOLUTION: A plurality of band-shaped areas are formed in an area expressing whole statistical data to be processed, and rectangles expressing the individual statistical data are arranged in the band-shaped areas, so that the image data of the area expressing the whole statistical data can be generated. Furthermore, with respect to the column of the rectangles in the image data, the rectangles corresponding to the individual data adjacent to each other in the statistical data are rearranged in each band-shaped area so as to be made adjacent to each other also in the image, so that the image data can be updated. COPYRIGHT: (C)2003,JPO
-
公开(公告)号：JP2002163486A
公开(公告)日：2002-06-07
申请号：JP2000347349
申请日：2000-11-14
Applicant: IBM
Inventor： KAJIMA HISATSUGU , KAJINAGA YASUMASA
Abstract: PROBLEM TO BE SOLVED: To give a solution of the problem of deciding the successful bidder of such a combination auction where bidding of large amount of transaction object (merchandise) is performed when there are many kinds of and a large amount of stocks. SOLUTION: After-mentioned two kinds of restrictions are given to the combination of allowable merchandise. 1. Single bidding can be performed with respect to only one kind of merchandise. 2. The involution relation of the combination of biddable merchandise has hierarchical structure. The optimal partial set of biddings is selected from the set of the biddings restricted like this by applying a dynamic programming.
-
Search Results
2
records
(took 0.017 seconds)
