Abstract:
PROBLEM TO BE SOLVED: To provide an apparatus for forming a hologram pattern at high speed. SOLUTION: The formation apparatus for forming a hologram pattern comprises a selection means by which, as a cross section range which is a range used for forming a hologram pattern in a plurality of cross sections parallel to a hologram pattern in a stereoimage, when the cross sections are seen through from a predetermined observation point on the hologram pattern, a cross section range overlapping a cross section range in another cross section is selected; a depth direction integration means to calculate a depth direction integral function by integrating an inverse diffraction function which specifies the hologram pattern displaying each point of the stereoimage with respect to each of a plurality of lattice points in a cross section range, with respect to a lattice point in each of a plurality of cross section ranges overlapping the above lattice points when a plurality of cross section ranges are seen through from the observation point; and a Fourier inverse transform means to form the hologram pattern by subjecting the depth direction integral function to two-dimensional Fourier inverse transform with respect to a plurality of lattice points in a cross section range. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PURPOSE: To cope with such a case as to plot many spheres and pipings at a high speed. CONSTITUTION: This device is provided with a texture memory 27 for storing the color information on the surface of an object and the depth information on the object, a read means for reading the chrominance information on the surface of the object and the depth information required for plotting the object in response to the reception of a command for plotting the object stored in the memory corresponding to specified size and position, and the chrominance information and the depth information when it is required. the processing means of magnification and reduction, etc., for performing magnification, reduction and depth change processing to the chrominance information on the surface of the object and the depth information on the object, a color processing for executing a processing for the chrominance information of the surface of the object for which the processing of the magnification and the reduction, etc., is performed and a hidden surface processing means for performing a hidden surface elimination processing for the surface of the object to be plotted from the chrominance information on the surface of the object, the depth information on the abject and the position specified by the command.
Abstract:
PURPOSE: To efficiently execute the function of texture mapping in a computer graphics interface. CONSTITUTION: In this computer graphics device 10, a texture generator 14 is connected to fragment generators 32 to 38 through a command bus 16. The generator 14 is connected to a texture data bus 20 through a texture memory cluster 22 constituted of an address generator 62 connected to a texture coordinate bus 18, a filter 66 and eight memories 64A to 64H. In addition the generator 14 is connected to the texture data bus through clusters 24 to 28. Plotting processors 42 to 48 to which frame memories 52 to 58 are connected correspondingly are connected to the bus 20. Texture mapping is executed by efficiently utilizing the texture memory cluster.
Abstract:
PROBLEM TO BE SOLVED: To enable a user to automatically search a message which matches his or her interest and includes a speech of high importance, within a discussion thread. SOLUTION: Degrees in which preliminarily registered words expressing approval, opposition, criticism, consent, etc. are included in contents of each message are expressed numerically. A positive point is given to a message to which a reply of a message including agreeable and positive words is received, and a negative point is given to a message to which a reply of a message including critical and negative words is received. A positive point is given to a message including words matching user's interest. These points are totalized to calculate the total degree of importance of each message, and messages having high total degrees of importance are determined to match user's interest. COPYRIGHT: (C)2008,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To quantitatively evaluate efficiency in an organization structure. SOLUTION: An organization efficiency evaluation device is provided with; an inter-section information transmission frequency acquisition part which acquires an inter-section information transmission frequency which is a frequency in transmission and reception of information between a plurality of sections in an organization; a group stipulation data acquisition part which acquires group stipulation data which stipulate a group including one or more sections in the organization; an inter-group information transmission frequency computing part which computes an inter-group information transmission frequency, with which information is transmitted and received between a plurality of groups, based on the inter-section information transmission frequency; and an organization efficiency computing part which computes efficiency in an organization structure stipulated by the group stipulation data based on the inter-group information transmission frequency. COPYRIGHT: (C)2006,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a method and device for determining a fluctuating reward amount according to performance by avoiding that a value brought to a customer by solution remains at a qualitative evaluation stage, and reward calculation is performed by building up costs such as personnel expense and quantitatively evaluating an effect in terms of a set KPI, considering the risk of KPI achievement. SOLUTION: The system for supporting advance evaluation of a service for improving business comprises an input means for accepting selection of an index showing a degree of improvement of the business, and accepting a plurality of future scenarios which affect the success/failure of improvement of the business, a storage means for storing the index and the plurality of scenarios, and an arithmetic means for computing each primary estimate value of the index in the event of each scenario, and computing each secondary estimated value based on each primary estimated value and each primary risk corresponding to each primary estimated value. COPYRIGHT: (C)2007,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To draw out the performance of a whole system as much as possible by detecting the increase/decrease of a feature variable in a quene for transmitting/receiving processed results between plural groups and changing the allotment of processing in the respective groups based on the increase/ decrease of the feature variable. SOLUTION: A processing allotment controller 11 monitors command queues 1 (7), 2 (9) and detects the increase/decrease of a feature variable to be an index in the case of changing the processing allotment. When the feature variable of the command quene 1 (7) is reduced to more than a prescribed threshold, the controller 11 instructs a processor group 1 (1) to execute only a process 0 and instructs a processor group 2 (3) also to execute a process 1. When the feature variable of the command queue 2 (9) is reduced to more than the prescribed threshold, the allotment processes are adjusted between both processor groups 2 (3) and 3 (5).
Abstract:
PROBLEM TO BE SOLVED: To transmit picture information with high resolution even with the small band width of a transmission path by transmitting information of respective pixels in each block in order of the values of corresponding matrix elements in a dither matrix. SOLUTION: CPU 7 executes a processing by using a main memory 9. A plotting instruction is outputted to a plotting controller 11 at the time of plotting in the display 27 of a monitor 3. The plotting controller 11 reads required data from a frame memory 1(15) and writes data in the frame memory 1(15). A transfer controller 19 outputs data of the pixel in the frame memory 1(15) to the monitor 3 with a transmission path 5. In this case, a dirty bit memory 17 is referred. Then, the plural pixels in the frame memory 1(15) are divided into the plural blocks by the size of the dither matrix and corresponding pixel data are transmitted in order of the values of the matrix elements of the dither matrix in the blocks.