Abstract: A fuel tank including a built-in component is provided. The built-in component includes: a carrier part being a rigid body including a plurality of engaging parts, and a plurality of struts each including an engageable part to be engaged with one of the engaging parts. The engageable part of the strut includes an upper contact surface and a lower contact surface, which are formed spaced apart from each other in a height direction. The engaging parts of the carrier part each includes a biasing part that, when the strut is engaged with the engaging part, enters a space between the upper contact surface and the lower contact surface and generates biasing forces in directions to move the upper contact surface and the lower contact surface away from each other.

Abstract: A fuel tank manufacturing apparatus for a fuel tank, the fuel tank having therein a built-in component with a head portion, a neck portion, and a shoulder portion, and having the built-in component anchored to a tank body with a part of a parison wrapped around the neck portion during molding the tank body, includes: a pair of molding dies to have the parison transferred to the built-in component by blow molding; and shaping devices respectively provided in the pair of molding dies, wherein the shaping devices each include: an end surface to contact the parison; a recess provided in the end surface to receive the head portion and the neck portion and covered by the shoulder portion during molding; and an air hole provided in an area of a bottom surface of the recess corresponding to the head portion through which air pressure is applied toward the head portion.

Abstract: Provided is a fuel tank having a built-in component placeable with high accuracy. The fuel tank has a built-in component, and the built-in component includes: a carrier as a rigid body having fittings; and pillars having fitted portions to be respectively fitted into the fittings of the carrier; wherein the fittings include at least one slidable fitting having one of the fitted portions of the pillars slidably fitted thereinto due to post-molding shrinkage of the fuel tank, and a fixed fitting having another one of the fitted portions of the pillars fitted thereinto so as not to be slidable, wherein a slidable direction of the at least one slidable fitting is directed toward the fixed fitting.

Abstract: A fuel tank manufacturing apparatus for a fuel tank, the fuel tank having therein a built-in component with a head portion, a neck portion, and a shoulder portion, and having the built-in component anchored to a tank body with a part of a parison wrapped around the neck portion during molding the tank body, includes: a pair of molding dies to have the parison transferred to the built-in component by blow molding; and shaping devices respectively provided in the pair of molding dies, wherein the shaping devices each include: an end surface to contact the parison; a recess provided in the end surface to receive the head portion and the neck portion and covered by the shoulder portion during molding; and an air hole provided in an area of a bottom surface of the recess corresponding to the head portion through which air pressure is applied toward the head portion.

Abstract: Provided is a fuel tank having a built-in component placeable with high accuracy. The fuel tank has a built-in component, and the built-in component includes: a carrier as a rigid body having fittings; and pillars having fitted portions to be respectively fitted into the fittings of the carrier; wherein the fittings include at least one slidable fitting having one of the fitted portions of the pillars slidably fitted thereinto due to post-molding shrinkage of the fuel tank, and a fixed fitting having another one of the fitted portions of the pillars fitted thereinto so as not to be slidable, wherein a slidable direction of the at least one slidable fitting is directed toward the fixed fitting.

Abstract: A novel search method having an advantage over the DSR 472 method the search accuracy of which is currently said to be the highest level is proposed. At the feature value computation stage, the two-dimensional image used in computation of the three-dimensional model feature value (excluding a contour feature value) is corrected so that the gray scales of the pixels are emphasized more as the distance from the center of the two-dimensional image increases.

Abstract: A novel search method having an advantage over the DSR 472 method the search accuracy of which is currently said to be the highest level is proposed. At the feature value computation stage, the two-dimensional image used in computation of the three-dimensional model feature value (excluding a contour feature value) is corrected so that the gray scales of the pixels are emphasized more as the distance from the center of the two-dimensional image increases.

Abstract: A data retrieval system having a database storing data as a vector that has been digitized based on a keyword. The system has capability of generating a residual vector from the data to compute a covariance matrix and an eigenvector of the covariance matrix. The system further has the capability for generating and storing a set of basic vectors from the set of the computed eigenvectors, and for reading out the data and at least one of the eigenvectors from a memory. This is utilized to compute a contribution of the eigenvector to the data, and for contracting or enlarging a residual vector to store. The system selects a keyword to be used for labeling according to a similarity between the stored basic vector and the data, and a weight on the similarity so as to store the keyword in a memory.

Abstract: A method is provided for retrieving information from massive databases (i.e., databases with millions of documents) in real time, that allows users to control the trade-off between accuracy in retrieved results and response times. The method may be applied to databases with contents, i.e., documents which have been modeled with a clearly defined metric that enables computation of distances between any two documents, so that pairs of documents which are “closer” with respect to the metric are more similar than pairs of documents which are “further apart”. Our method can be applied to similarity ranking and/or can be combined together with other methods to increase the scalability of information retrieval, detection, ranking, and tracking.

Abstract: To provide an information retrieval system, a method for information retrieval, a program for executing the information retrieval, and a storage medium comprising the program for executing the information retrieval The information retrieval system according to the present invention comprises: means for generating and storing a predetermined type matrix from said document-attribute matrix, means for generating said document-attribute submatrix from documents being added to said database during a specific time period, means for updating said predetermined type matrix using knowledge with respect to said document-attribute submatrix and for executing the singular value decomposition on updated said predetermined type matrix to execute dimension reduction of all document-attribute matrices stored within said database, and means for retrieving information with respect to a user input query using said dimension reduced document-attribute matrix.

Abstract: The present invention discloses a method, a computer system, a computer readable medium and a sever. The method of the present invention comprises steps of; creating said document matrix from said documents using at least one attribute; creating a scaled residual matrix based on said document matrix using a predetermined function; executing singular value decomposition to obtain a basis vector corresponding to the largest singular value; re-constructing said residual matrix and scaling dynamically said re-constructed residual matrix to obtain another basis vector; repeating said singular value decomposition step to said re-constructing step to create a predetermined set of basis vector; and executing reduction of said document matrix to perform detection, retrieval and identification of said documents in said database.

Abstract: Provides a computer executable dimension reduction method, a program for causing a computer to execute the dimension reduction method, a dimension reduction device and a retrieval engine using the dimension reduction device. A dimension reduction device for reducing the dimension of a numerical matrix with a computer to provide a dimension reduction matrix and the information comprises a processing part for generating a dimension reduction matrix or the index data for dimension reduction using a random average matrix RAV to store the dimension reduction matrix or the index data. The processing part further comprises a shuffle vector generating part for generating a shuffle vector useful as the shuffle information, and a non-normalized basis vector generating part for generating the non-normalized basis vectors from the numerical elements of the data vector specified by the shuffle vector to store the non-normalized basis vectors.

Abstract: A method is provided for retrieving information from massive databases (i.e., databases with millions of documents) in real time, that allows users to control the trade-off between accuracy in retrieved results and response times. The method may be applied to databases with contents, i.e., documents which have been modeled with a clearly defined metric that enables computation of distances between any two documents, so that pairs of documents which are “closer” with respect to the metric are more similar than pairs of documents which are “further apart”. Our method can be applied to similarity ranking and/or can be combined together with other methods to increase the scalability of information retrieval, detection, ranking, and tracking.

Abstract: A data retrieval system having a database storing data as a vector that has been digitized based on a keyword. The system has capability of generating a residual vector from the data to compute a covariance matrix and an eigenvector of the covariance matrix. The system further has the capability for generating and storing a set of basic vectors from the set of the computed eigenvectors, and for reading out the data and at least one of the eigenvectors from a memory. This is utilized to compute a contribution of the eigenvector to the data, and for contracting or enlarging a residual vector to store. The system selects a keyword to be used for labeling according to a similarity between the stored basic vector and the data, and a weight on the similarity so as to store the keyword in a memory.

Abstract: The present invention discloses a method, a computer system, a computer readable medium and a sever. The method of the present invention comprises steps of; creating said document matrix from said documents using at least one attribute; creating a scaled residual matrix based on said document matrix using a predetermined function; executing singular value decomposition to obtain a basis vector corresponding to the largest singular value; re-constructing said residual matrix and scaling dynamically said re-constructed residual matrix to obtain another basis vector; repeating said singular value decomposition step to said re-constructing step to create a predetermined set of basis vector; and executing reduction of said document matrix to perform detection, retrieval and identification of said documents in said database.

Abstract: [Objective] To provide an information retrieval system, a method for information retrieval, a program for executing the information retrieval, and a storage medium comprising the program for executing the information retrieval

Abstract: Morphing is performed without self-intersection in a vector space, for the outlines for various types and shapes of figures. The morphing is performed by apparatus containing an outline extractor, for receiving two target figures for the morphing process and for extracting a set of outlines for each of the target figures; an outline tree generator and an outline tree arrangement unit, for retaining one specific outline of each of the two sets of outlines and for deleting the other outlines; an outline editor, for performing a smoothing process for the two outlines for the target figures that are retained by the outline tree arrangement unit in order to prevent self-intersection during the morphing process; and a sequence generator and a morphing viewer, for performing the morphing process in response to the progress made by the smoothing process performed by the smoothing processor.

Abstract: A data compression method for processing topological structures of various geometric models. A topological transformation is performed for a three-dimensional (3D) geometric model that is to be compressed, and a triangle mesh is generated. A conventional triangle mesh compression method is employed. Associated data required for the performance of a reverse operation for the topological transformation are prepared. As a result, topological data for the 3D geometric model is compressed. As needed, the data for the compressed triangle mesh and associated operation data are output. Furthermore, a necessary process (e.g., a compression process) is also performed for geometric data for the 3D geometric model, and the resultant data are either stored or output. For the decompression of compressed data, the compressed triangle mesh is decompressed using the method employed for compression, and a triangle mesh is generated.

Abstract: Morphing is performed without self-intersection in a vector space, for the outlines for various types and shapes of figures. The morphing is performed by apparatus containing an outline extractor, for receiving two target figures for the morphing process and for extracting a set of outlines for each of the target figures; an outline tree generator and an outline tree arrangement unit, for retaining one specific outline of each of the two sets of outlines and for deleting the other outlines; an outline editor, for performing a smoothing process for the two outlines for the target figures that are retained by the outline tree arrangement unit in order to prevent self-intersection during the morphing process; and a sequence generator and a morphing viewer, for performing the morphing process in response to the progress made by the smoothing process performed by the smoothing processor.

Abstract: Information is embedded in a three-dimensional geometric model in a visible or invisible state by changing geometric parameters of a three-dimensional geometric model. The three-dimensional geometric model comprises polyhedrons, lines, a set of points, or curved surfaces which are primitives (components) of the model. Each primitive is defined by a geometric parameter. The geometric shape of a three-dimensional geometric model is defined by a set of many geometric parameters. The information is embedded by changing the geometric parameters of a plurality of primitives constituting a three-dimensional geometric model.