Abstract: A system and method for automatically building helpsets is disclosed. There are a number of features that are provided by the present invention, including recursive building of subhelpsets, running a variety of scripts (e.g., post-processing scripts), creating topic identification (ID) map files, creating index files (e.g., XML index files), and creating full-test-search index files. Helpset building can be automatically initiated (e.g., at predetermined or scheduled times, in response to trigger events, etc.). Arguments or “parameters” (e.g., feature option selections, output control indications, etc,) can be passed on a command line or by an initialization file to initiate helpset building. The helpsets can be built based on information in standard help source files. Referenced files are included in a final output and files that are not referenced are not included helping to keep a full-test-search index file “clean” and final file output (e.g. JAR) footprint minimized.

Abstract: The present invention relates to a positional information service. A service center comprises a database for retaining bubble data in which spatial range information in a three-dimensional space is associated with retrieval information for obtaining service information to be provided, an extracting section for extracting, on the basis of positional information transmitted from the user terminal, specified retrieval information corresponding to specified spatial range information including the positional information, of the spatial range related in the database, and a providing section for providing, to the terminal, specified service information corresponding to the specified retrieval information extracted in the extracting section. This enables acquisition of information on a building in a predetermined range from the user terminal position or service information on a store existing in a specified building in a visual range, and further allows precise seizing of the user's moving direction.

Abstract: A computer data processing system. A method for clustering data in a database comprising providing a database having a number of data records having both discrete and continuous attributes. Grouping together data records from the database which have specified discrete attribute configurations. Clustering data records having the same or similar specified discrete attribute configuration based on the continuous attributes to produce an intermediate set of data clusters. And, merging together clusters from the intermediate set of data clusters to produce a clustering model.

Abstract: An improved data structure is provided by modifying a public-domain data structure known as a “heap”. When these improvements are applied, the resultant data structure is known as a “pile.” This invention further describes a pipelined hardware implementation of a pile. Piles offer many advantages over heaps: they allow for fast, pipelined hardware implementations with increased throughput, making piles practical for a wide variety of new applications; they remove the requirement to track and update the last position in the heap; they reduce the number of memory reads accesses required during a delete operation; they require only ordinary, inexpensive RAM for storage in a fast, pipelined implementation; and they allow a random mixture of back-to-back insert, remove, and swap operations to be performed without stalling the pipeline.