Abstract: The present invention is an apparatus in which selection from a graphic editing command menu is easy. An apparatus according to the present invention includes, a cursor moving unit for moving a cursor in accordance with an input operation, a graphic presence decision unit for deciding whether a graphic element is present at a moved cursor position, a command menu memory unit for storing a menu of graphic editing commands for each graphic element, a menu reading unit for reading a command menu which corresponds to a graphic element when it is decided that a graphic element is present, a command menu display unit for displaying a command menu which is read, a menu item selecting unit for selecting a menu item which is displayed at the moved cursor position in accordance with an input operation, and a command executing unit for executing a graphic editing command of the selected menu item.

Abstract: A method is disclosed for interactive documentation of a database framework and data continued in a relational database, such as for example, an engineering database having data related to the manufacturing and testing of semiconductor devices. A plurality of documentation levels is provided wherein each documentation level includes a view of the database framework and wherein at least one documentation level includes a high level view of the database framework. The documentation levels include descriptions and definitions of the views of the database framework, and the views of the database framework include descriptions and definitions of entities, attributes and schema of the data in the database. One documentation level, from the plurality of documentation levels, is displayed including the view of the database framework. One or more user selectable items is displayed on the display device with each documentation level.

Abstract: A fast string indexing method efficiently stores, searches, and removes alphanumeric or binary strings utilizing a compacted search tree. The number of levels in the search tree is minimized by having a node represent more than one character when possible. Each inner node of the tree contains a hash table array for successive hashing, which also minimizes the time required to traverse a given node. Searches may be performed for partial matches, such as wild cards at the character level. Multiple indices may be opened independently and concurrently on the same table of string entries.

Abstract: A method and apparatus for expandable biometric searching are provided. The method preferably includes forming a plurality of biometric records. Each of the biometric records includes at least one biometric index and biometric data associated with the at least one biometric index. The method also includes assigning each of the plurality of biometric records to a plurality of biometric data groups so that each of the plurality of biometric data groups includes a full range of biometric indexes and about the same number of biometric records. Each of the plurality of biometric data groups is preferably uncorrelated to the biometric indexes. The method further preferably includes assigning each of the plurality of biometric data groups to a plurality of biometric searching engines so that each of the plurality of biometric data groups is assigned to only one of the plurality of biometric searching engines.

Abstract: A method and apparatus for expandable biometric searching are provided. The apparatus preferably includes a database having a plurality of biometric data groups. Each of the plurality of biometric data groups includes a plurality of biometric records stored therein, and each of the biometric records includes at least one biometric index and biometric data associated with the at least one biometric index. The apparatus also includes a plurality of biometric searching engines. Each of the plurality of biometric searching engines preferably include a data group manager connected to the plurality of biometric data groups for managing the plurality of data groups. The data group manager includes multi-dimensional search space constructing means for constructing a multi-dimensional search space and internal map constructing means for constructing internal maps for each data group being managed.

Abstract: A system for indexing and retrieving graphic and sound data ("entity data") employs a thesaurus of descriptors and equivalent words (e.g., synonyms, metonyms, foreign language equivalents, and misspellings). The system can be used, for example, to index and retrieve images, sounds, and related data for social expression cards, video segments, multimedia presentations, photographs, audio data, and the like. The thesaurus is built by allowing the user to specify a number of descriptors and equivalent words ("meaning referent sets") for each entity data, incorporating these descriptors and meaning referent sets into the thesaurus, and linking the entity data to the meaning referent sets in the thesaurus by using entity identifiers. Entity data can then be retrieved by prompting the user to specify a list of descriptors, locating the descriptors and any associated meaning referent sets in the thesaurus, and retrieving entity data linked to these meaning referent sets.

Abstract: The invention provides a calendar interface system associated with a host computer for returning date-compliant data to an application running remotely from the host and requesting date data and a method for modifying such systems to be date compliant.

Abstract: A method and system for efficiently managing the manipulation of documents too large to be legibly displayed within a computer screen. Initially, a window is provided within which only a portion of an entire document may be displayed legibly. A graphic representation of the entire document is then exhibited within the window. A portion of the graphic representation of the entire document is displayed as a human discernable representation. A remaining portion of the graphic representation of the entire document is displayed as a compressed representation of a portion of the document. The compressed representation is iconic in nature such that a representation nearest the bottom and the top of the document, and furthest away from the human discernable portion, appears as increasingly iconic characters or graphics.

Abstract: A method of phonetic spelling check is disclosed. The method includes providing a phonetic mapping representing the relationship between letters and corresponding phonetic symbols, wherein each of the letters maps to at least one of the phonetic symbols, and the phonetic mapping is established in accordance with rules of English pronunciation. The letters may include English letters, phonetic alphabets and wild cards. Next, generate phonetic string including the phonetic symbols according to replaceability of the phonetic symbols by separately processing the English letters, phonetic alphabets and wild cards. Finally, filter out a portion of the phonetic strings according to some spelling rules of English language.

Abstract: A neural network including a number of synaptic weighting elements, and a neuron stage; each of the synaptic weighting elements having a respective synaptic input connection supplied with a respective input signal; and the neuron stage having inputs connected to the synaptic weighting elements, and being connected to an output of the neural network supplying a digital output signal. The accumulated weighted inputs are represented as conductances, and a conductance-mode neuron is used to apply nonlinearity and produce an output. The synaptic weighting elements are formed by memory cells programmable to different threshold voltage levels, so that each presents a respective programmable conductance; and the neuron stage provides for measuring conductance on the basis of the current through the memory cells, and for generating a binary output signal on the basis of the total conductance of the synaptic elements.

Abstract: A system and method for creating audiovisual programming has media elements, such as audiovisual clips, stored in a library. A database contains selected information about each of the media elements. The stored information in the database does not dictate the temporal sequence of the media elements. Media elements are selected in response to a request for media programming, and arranged in a temporal organization. A user does not select the individual media elements or their temporal organization. Transitions between audiovisual clips are determined by the system based on information stored in the database and predetermined preferences as to types of transitions. Transition information includes a variety of possible transition points in an individual clip, capable of selection by the system. Separate transitions for the audio and video portions of audiovisual clips may be provided.

Abstract: A method and apparatus for displaying a three-dimensional picture is disclosed. The picture display apparatus includes a display device for displaying a three-dimensional picture, a pointing device for pointing a position in the picture displayed in the display device, a holding device for holding the control information of a plurality of possible stop points pre-determined in a three-dimensional space, and a control device for causing the three-dimensional picture to be displayed on the display device based on the control information of the possible stop points in the three-dimensional space held by the holding device. The possible stop points correspond to positions in the picture pointed by the pointing device. The producer of a virtual reality can easily reflect the intention of a three-dimensional virtual reality, while the user can easily walk in the three-dimensional virtual reality.

Abstract: In a computerized method for labeling data records, data records are received in an index server. The records are parsed into words, and the words are stored in a full-text index. Labels are added to the data records and the full-text index. The data records are accessed by searching the full-text index using queries including the words and the labels of the data records. Labels can be removed from the full-text index.

Abstract: The present invention includes reorganization of a Database Management System (DBMS). The reorganization of the present invention is implemented by recording a first current Relative Byte Address (RBA). Then, data is copied from the old area in the table space to a new area in the table space in reorganized form. In the present invention, throughout most of reorganization a user maintains access to the DBMS's normal facilities to read and write to the old area. The DBMS uses its normal facilities to record writing, which occurs during reorganization, in a log. The reorganization in accordance with the present invention reads the log (that has been written to during reorganization) and processes the log to the new area to bring the new area up to date. This process is performed with the use of a RID mapping table. Finally, at the end of reorganization, the user's access is switched from the old area to the new area.

Abstract: Disclosed is a system to diagnose and handle errors in an automated hierarchical storage management system. A host system requests an access operation on a first file, such as a logical volume, in a first storage device, such as a magnetic hard disk drive. A server processes the host request to determine whether the first file is resident in the first storage device. The server initiates a recall of a second file, such as a physical volume, in a second storage device, such as tape cartridges, optical disks, etc., corresponding to the first file upon determining that the first file is not resident in the first storage device. The second file is then copied from the second storage device to the first file in the first storage device upon determining that the second file is accessible. The server further determines whether the recall of the second file has failed.

Abstract: A single transaction technique for a journaling file system of a computer operating system in which a single file system transaction is opened for accumulating a plurality of current synchronous file system operations. The plurality of current synchronous file system operations are then performed and the single file system transaction closed upon completion of the last of the file system operations. The single file system operation is then committed to a computer mass storage device in a single write operation without the necessity of committing each of the separate synchronous file system operations with individual writes to the storage device thereby significantly increasing overall system performance. The technique disclosed is of especial utility in conjunction with UNIX System V based or other journaling operating systems.

Abstract: Methods and systems are provided for database-style access to a directory services repository stored on a computer network. A directory services application programming interface is controlled by a driver. The driver translates relational database language statements, such as ODBC-compliant SQL statements, into an executable API sequence that produces an API result. The driver also translates the API result into a relational database result. The repository may be a Novell Directory Services repository or an X.500 directory services repository. The invention maps an effective class of the repository to a table identified in the relational database language statement. Each object that is an instance of the effective class is mapped to a row in the table, and each attribute maps to a column of the table. As a result, the invention allows database tools such as report generators to work with the information stored in the repository.

Abstract: A programming model for component-based server applications provides declarative and programmatic access control at development without knowledge of the security configuration at deployment. The developer defines the server application access control by defining logical classes of users, called roles. The developer also can declare access privileges of the roles at package, component and interface levels of the server application. At development, the roles are bound to the particular security configuration of the server computer. The programming model also provides application programming and integration interfaces with which the developer can programmatically define access control of the roles to the server application's processing services.

Abstract: Database system and methods are described for improving execution speed of database queries (e.g., for decision support) by provides methods employing spline histograms for improving the determination of selectivity estimates. The general approach improves histogram-based cost estimates as follows. The constant associated with a predicate (e.g., in r.a>5, the constant is "5") is used to do a binary search in an array of histogram boundary values, for determining a particular histogram cell. Once a cell has been found, the system employs interpolation to find out how much of the cell has been selected. Once this interpolation value is found, it is used with a cell weighting and a spline value or weighting to estimate the selectivity of the predicate value, which takes into account how data values are distributed within the cell. As a result of increased accuracy of estimates, the system can formulate better query plans and, thus, provides better performance.

Abstract: An improved method and system for displaying original documents and translations and transcriptions thereof is provided. In a preferred embodiment, separate spatially aligned bitmaps are created and displayed in a main display and translation window. Image scrolling and movement of the translation window facilitate review and study of larger document pages. An overview feature with logical links to subject matter categories and a left to right mirroring feature are provided in preferred embodiments.