Abstract:
PROBLEM TO BE SOLVED: To shorten processing time of an SOAP message for request in a requester 11 such as mobile equipment or the like. SOLUTION: A sequence specifying means 26 divides one SOAP message (master SOAP message) as one request related to a WEB service into the divisions of an SAP header 21 and an SOAP body 22. A division preparing means 27 prepares the division of the SOAP body 22 of the master SOAP message and the division of the SOAP header 21 of the master SOAP message in the order. A transmitting means 28 performs transmission processing in parallel with the preparation processing of a division preparing means 27, and assigns one SOAP message (=slave SOAP message) including the contents to each division, and transmits each slave SOAP message to the provider in the order of preparation. COPYRIGHT: (C)2006,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To make efficiently generable meshes of high quality by taking existing meshes as a model when generating meshes for a prescribed shape model. SOLUTION: The mesh generation system 10 which generates meshes to be used for finite element analysis is provided with a mesh characteristic extraction part 11 which takes existing meshes as the input to extract characteristics of these meshes and a mesh generation part 13 which takes the shape model as a mesh generation object as the input to generate meshes for this shape model on the basis of characteristics of existing meshes extracted by the mesh characteristic extraction part 11.
Abstract:
PROBLEM TO BE SOLVED: To automatically group many faces constituting a three-dimensional shape into a plurality of areas, while reflecting the intention of a designer. SOLUTION: A clustering part 32 accepts shape models, respectively showing faces constituting a three-dimensional shape and constraint condition data showing which faces among these faces has to be absolutely included in a different (or same) cluster. The part 32 first selects faces that must necessarily be included in the same cluster from a shape model DB 26 and prepares an initial cluster by combining them. Furthermore, the part 32 successively combines clusters with one another the directions of normal lines of which are near and which give smooth frame lines after being combined, and outputs a cluster respectively guaranteeing the area which is equal to or larger than an appropriate area as the final processing result.
Abstract:
PROBLEM TO BE SOLVED: To provide a curved meshing method which can mesh a trim curved surface and a complicated curved surface shape, can control the size distribution of elements to be generated, can generate the triangle elements of designated shapes and also can attain a fully automatic method. SOLUTION: At first, a curved surface to be meshed is inputted together with the tensors set at each point on time curved surface. Then a bubble is generated in a parameter space corresponding to the curved surface in response to the tensor that is deformed according to the correspondence relation between the curved surface and the parameter space. The bubble is moved in the parameter space by the inter-bubble force that is designated by a prescribed rule and then deformed by means of a deformed tensor. At the same time, the number of bubbles is controlled. Thus, the bubbles are stably arranged in the parameter space. Then the connection relation is decided in the parameter space for the mesh nodes, i.e., the center points of bubbles arranged in the parameter space. Finally, a mesh is generated on the curved surface based on the positions and the connection relation of mesh nodes.
Abstract:
PURPOSE: To increase the rendering speed of the Radio City Method by improving the mesh generating efficiency of the method by holding the irradiation state of each light source at every area formed by luminance discontinuing lines. CONSTITUTION: A shadow polygon generating section 13 generates a shadow polygon at every screening surface related to a displayed picture and a luminance discontinuing line calculating section 15 calculates a luminance discontinuing line at every light receiving surface. Since the light receiving surface is divided into several areas when the luminance discontinuing line is calculated, a luminance discontinuing line loop forming section 17 creates a luminance discontinuing line loop so as to recognize the areas. A light source state managing section 19 confirms whether or not each area is irradiated with the light from a light source and whether the formed shadow is a half shadow or full shadow (irradiation state) based on the loop. A mesh generating section 21 divides the area into meshes by using the data generated by the section 19 and a picture generating section 23 makes calculation required for the generation of a picture at every element of the divided meshes.
Abstract:
PURPOSE: To speedily generate an equal value surface for visualizing volume data. CONSTITUTION: This method generates the equal value surface formed by the set of grid points with a specific scalar value from volume data consisting of plural polyhedrons consisting of a prescribed number of grid points with a scalar value as visualized data. The method is provided with a pole extracting step for extracting grid points with a maximum or minimum scalar value among the grid points in volume data, a pole graph data preparing step for extracting information concerning a line segment combining between the grid points extracted as poles to store as pole graph data and an equal value surface generating step for generating the equal value surface concerning the scalar value designated by a user based on pole graph data.
Abstract:
PROBLEM TO BE SOLVED: To provide a method and a system for displaying information, which effectively can display the information obtained by data mining. SOLUTION: The system for displaying the information comprises a process unit 100 for accumulating an attribute for each node in a hierarchical data structure based on a condition for the accumulation, a filtering process unit 200 for selecting the node to display data obtained from the hierarchical data structure after a result being accumulated by the process unit 100 is filtered based on a predetermined processing condition, and a process unit 300 for visualization, which generates a graphic image to represent each attribute of the data corresponding to each node by using a predetermined component for the visualization after the nodes to be displayed is selected by the filtering process 200 as components for the hierarchical data structure for reflecting the hierarchical structure of the hierarchical data structure. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To realize single sign-on with little influence on the performance when service is provided via a network. SOLUTION: An authentication system includes a provider 20 for providing service, a security token service 40, and a proxy service 30 intervening between the security token service 40 and the provider 20. The proxy service 30 stores the result of authentication by the security token service 40 and, under fixed conditions, carries out as proxy the authentication of a client based on the authentication result stored in the service itself without transferring authentication request received from the provider 20 to the security token service 40. Further, the provider 20 provides service to the client 10 without requesting for authentication when service use history of the client 10 stored in the provider itself clearly indicates that the service may be provided. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To display the hierarchical structure of graph data and the connection relation between nodes so that the both can easily be grasped at the same time through the graphics display of the hierarchical graph data. SOLUTION: Graphics images of the hierarchical graph data to be processed are generated one after another from higher layer. When a subgraph as a graphics image of a specific layer is generated and a subgraph of a lower layer for a specific node of the subgraph is generated, the size of the node whose low-layer subgraph is generated is so varied to include the subgraph of the low layer and another node nearby the size-varied node is moved without interfering with the subgraph of the low layer.
Abstract:
PURPOSE: To easily obtain the starting point of a stream line by using the result of finite element method analysis by calculating the starting point of the stream line moving from a singular point at an infinitesimal distance by each specific value, calculating the stream line from the starting point, and displaying it on a display. CONSTITUTION: Tetrahedral lattice data are collected (step 23), the data are the position data of the vertexes of each tetrahedral lattice and speed data at the points, and a singular point is calculated for each tetrahedron (step 25). However, there does not always exist any point with a speed 0 in the tetrahedron and when there is the singular point, Jacobian J is calculated, and an eigenvalue and an eigenvector are calculated (step 27). Then, when the speed is 0 at the singular point, stream line can not be drawn from that point, and a point separated from the singular point at an infinitesimal distance is defined as the starting point (step 29), and the stream line is calculated from this starting point, and displayed on a display or the like.