Patents Examined by Peter Y. Wang
  • Patent number: 5475376
    Abstract: In a safety-deposit box system including a safety-deposit box, a system controller, and a safety-deposit box controller, a multi-function key is used. The safety-deposit box has a lock and the multi-function key has a metal portion and an electronic memory. Information electronically stored on the electronic memory is read by a reception device and sent to a determination device in the system controller. The determination device compares the sent information with information prerecorded in an electronic memory in the system controller. When the two sets of information agree, the system controller outputs a signal to the safety-deposit box controller. After receiving the signal, the safety-deposit box controller checks mechanical appropriateness of the metal key portion and, if mechanically appropriate, unlocks the lock.
    Type: Grant
    Filed: February 24, 1995
    Date of Patent: December 12, 1995
    Assignee: Itoki Co., Ltd.
    Inventors: Masaru Chikamitue, Kengo Ishibashi, Hiroshi Ito, Kentaro Adachi
  • Patent number: 5475839
    Abstract: Tests are performed prior to or during the boot operation to determine whether files are corrupted. This may indicate the presence of a virus. If a potential error is detected, boot is halted, allowing the user to boot from uncorrupted files. In another embodiment, an uniquely formatted floppy diskette is used as an access diskette serves as a hardware key to gain access. In another embodiment, a host controls information stored locally. In another embodiment, security from unauthorized access is provided once a valid user has legitimately accessed a computer. In response to a predefined hot key or a predetermined period of time during which the user has not provided input, portions of the computer are disabled. Upon entry of access information by the valid user, the disabled features are enabled. In another embodiment, access to the computer is made more difficult in response to invalid access attempts.
    Type: Grant
    Filed: November 16, 1994
    Date of Patent: December 12, 1995
    Assignee: National Semiconductor Corporation
    Inventors: Bruce W. Watson, R. Jeff Lee
  • Patent number: 5471610
    Abstract: Character string retrieval method and system for deciding en bloc whether or not a plurality of search terms as designated exist in a text composed of characters expressed in the form of character codes is characterized by inclusion of a character string storage unit for storing a text, a filtering unit for fetching character codes from a text read out from the character string storage unit to thereby output only those character codes that are included in the search term, and a character string matching unit for matching en bloc to decide whether or not the aforementioned search term exists in the string of character codes outputted from the filtering unit.
    Type: Grant
    Filed: March 15, 1993
    Date of Patent: November 28, 1995
    Assignee: Hitachi, Ltd.
    Inventors: Hisamitsu Kawaguchi, Katsumi Tada, Kanji Kato, Masatsugu Shinozaki
  • Patent number: 5471612
    Abstract: An electronic spreadsheet system of the present invention includes a Formula Evaluator having a preferred interface and methods for compiling spreadsheet formulas into native machine language for a target processor/coprocessor. Methods are provided for improved cell lookups, whereby a system memory address for a cell record may be compiled directly into the machine language sequence for a compiled formula. Additional methods are provided for simplifying error checking. The methods adapt NaN (IEEE format) values for encoding spreadsheet ERR and NA values, so that the on-chip logic of the coprocessor may be employed for correctly propagating ERR and NA values. Preferred auditing methodology is also described, which includes further modifying the format of NaN values so that a NaN encoding an ERR or NA also embeds the address of the originating cell (i.e., the first cell which first gave rise to the ERR or NA value).
    Type: Grant
    Filed: March 3, 1994
    Date of Patent: November 28, 1995
    Assignee: Borland International, Inc.
    Inventor: Roger Schlafly
  • Patent number: 5471614
    Abstract: A method and an apparatus for the concurrency control in the database system, in which each transaction can be executed properly according to its scale. In the apparatus, a processing time for each transaction is estimated, a timestamp appropriate for each transaction is determined from the estimated processing time and a current time, and a concurrency control is carried out according to the determined timestamps for the transactions to be executed concurrently.
    Type: Grant
    Filed: October 10, 1990
    Date of Patent: November 28, 1995
    Assignee: Kabushiki Kaisha Toshiba
    Inventor: Mitsuru Kakimoto
  • Patent number: 5471613
    Abstract: A system, program and method for graphically representing a WHERE or HAVING clause of an SQL query directed to a relational database. Logical operators are defined and linked to predicates using a tree structure format. The tree is not binary in character and consequently exhibits a 1:1 relation between the predicates and tree leaves. The tree structure representation provides intuitive feedback to the user defining the query. Preferably the SQL format and tree structure graphic format queries appear simultaneously on the video display of the computer system used to define the query.
    Type: Grant
    Filed: August 11, 1994
    Date of Patent: November 28, 1995
    Assignee: International Business Machines Corporation
    Inventors: Kenneth R. Banning, Wendy S. James, Shih-Gong Li, Anton Versteeg
  • Patent number: 5467472
    Abstract: A method and system for generating and maintaining property sets is provided. In a preferred embodiment, a property set stream is generated. The stream comprises three parts: a header, a section locator array, and one or more sections. The header contains information for uniquely identifying the property set and for identifying the number of sections within the property set. The section locator array contains a unique identifier for each section and an offset indicating where the section resides within the stream. The third part, the section definitions, contains the information necessary to maintain groups of properties for each section. Each section contains a section header, a property locator array, and an array of property type/value pairs. The section header indicates both the size of the section and the number of properties defined within the section.
    Type: Grant
    Filed: April 15, 1994
    Date of Patent: November 14, 1995
    Assignee: Microsoft Corporation
    Inventors: Antony Williams, Edward A. Martinez, Dean J. Hachamovitch
  • Patent number: 5459863
    Abstract: A network database. The network database is arranged in a plurality of domains in a logical hierarchy. Each domain of the hierarchy represents a body of information associated with a logically related group of users or related group of computers. A relative naming scheme is implemented in which a domain stores the names of only its parent domain and child domains. This permits reconfiguration of the network to be accomplished without changing the database structure. Each domain stores information in a hierarchical structure known as a "directory." Each directory consists of a list of zero or more "properties," each having an associated name and ordered list of values.
    Type: Grant
    Filed: June 8, 1994
    Date of Patent: October 17, 1995
    Assignee: NeXT Computer, Inc.
    Inventor: Bradley Taylor
  • Patent number: 5455947
    Abstract: A log file control system is used in a complex system which includes a plurality of computer systems connected for communications. Additionally, the complex system includes a data base which is shared among the computer systems and a high-speed storage unit which is also shared among the computer systems. Further, a saving unit is present in each of the computer systems for saving log data, outputted by a transaction processed in the computer system, in a backout file for the computer system. A serializing unit in each of the computer systems exclusively obtains a log data buffer of the complex system, according to an inter-system exclusive control table, and transmits the serialized log data to the log data buffer. When the log data buffer issues a request for transmitting the data to a log file, an accumulating unit in the computer system transmits the data according to the request from the log data buffer.
    Type: Grant
    Filed: May 28, 1993
    Date of Patent: October 3, 1995
    Assignee: Fujitsu Limited
    Inventors: Hitoshi Suzuki, Koichi Shiga
  • Patent number: 5455945
    Abstract: A system for extracting and dynamically displaying data from a database comprises a central processing unit, an input device, a program memory, a display device, a printer, mass storage, and a network. The program memory comprises management records for retrieving and updating information in the database, and dynamic documents for presenting database information to the user. The information from one or more underlying commercial databases is structured and reorganized into management records. The management records interact with the dynamic documents to reformat the data into the form desired by the user. Both the management records and dynamic documents are also used to execute operations on the data in the database such as sorts, filters, and logical and mathematical functions. The present invention also include a plurality of unique methods for extracting and updating data in the underlying databases.
    Type: Grant
    Filed: May 19, 1993
    Date of Patent: October 3, 1995
    Inventor: Richard VanderDrift
  • Patent number: 5454106
    Abstract: Information is retrieved from a database using natural language (NL) queries and graphical interfaces and displays. A query is separated into tokens which are parsed into elements. The parsed elements are matched to a list of database names. If all the parsed elements can be uniquely matched to database names, a database query is constructed and used to query the database to retrieve information and to present to a user. However, when an ambiguous query is encountered, i.e. all of whose elements cannot be uniquely matched with database names, the understood components of the ambiguous query, i.e., those elements matching database names, are presented the user along with relationships of the elements to other names in the database so that the user can use an interface to explore the database by accessing and displaying this database information and these relationships. The interface can take the form of views on a graphical interface.
    Type: Grant
    Filed: May 17, 1993
    Date of Patent: September 26, 1995
    Assignee: International Business Machines Corporation
    Inventors: Luanne M. Burns, Ashok Malhotra
  • Patent number: 5454102
    Abstract: A self-generating node network (or directed graph) which represents the structure and contents of structured data. The node network creates itself from a root node by querying the structured data for structural-type elements and data-type elements. In response to the query, the root node builds one of two types of nodes: a list node and a data node. Data nodes are built in response to queries indicating data-type elements, and they store pointer tags to pieces of data in the structured data. List nodes are built in response to queries indicating structural-type elements. List nodes can build and contain further list nodes and data nodes, and they store a list of the nodes that they contain. Communication within the node network is carried out only between directly adjacent nodes, that is, between a parent node and a child node. Commands issued to the network, such as commands to write out the node network, are issued to the network via the root node.
    Type: Grant
    Filed: January 19, 1993
    Date of Patent: September 26, 1995
    Assignee: Canon Information Systems, Inc.
    Inventors: Hien Tang, Randy A. Cwikowski
  • Patent number: 5454105
    Abstract: A document search method and system for searching and retrieving a document containing a specific character string in response to search requests issued by a plurality of search request sources. When a search request is received in the course of execution of a search processing for an earlier prior search request, the former is stored in a queue buffer. When a plurality of search requests have been stored in a queue buffer in this manner, a search processing is performed for the plurality of search requests simultaneously as stored. The results of search processing as performed are then distributively outputted to the relevant search request sources, respectively. Output buffers for storing a set of search results of the search processings performed in the past may be provided in correspondence to the search request sources, respectively, for screening the documents for which the character string search is to be performed.
    Type: Grant
    Filed: March 15, 1993
    Date of Patent: September 26, 1995
    Assignee: Hitachi, Ltd.
    Inventors: Atsushi Hatakeyama, Kanji Kato, Satoshi Asakawa, Hisamitsu Kawaguchi
  • Patent number: 5452448
    Abstract: A read/write replica of a file in a file server is updated through a communication line by a client. At the same time, a replica server detects the update data by using a virtual communication line between the client and a read-only replica of the file. The update data are used for refreshing the read-only replica. The refreshing process makes it unnecessary to send the update data from the file server to the replica server. Also, communication is made between the file server and the replica server to confirm validity of the update information taken in by the replica server to maintain equality of the files of the file server and the replica server. This can efficiently refresh the read-only replica of the replica server in a distributed data processing system without re-sending the update data.
    Type: Grant
    Filed: March 10, 1993
    Date of Patent: September 19, 1995
    Assignee: Hitachi, Ltd.
    Inventors: Taketoshi Sakuraba, Junji Fukuzawa, Takaki Kuroda
  • Patent number: 5448733
    Abstract: This is a variable length data search apparatus which uses a latch, added to each word of a cell array. In this apparatus, the search operation is self controlled by using the previous matching signals stored in the latches. A character string (ABCA), from a data string (BABCABB . . . ), is stored, in order, in an associative memory containing, e.g., six rows having addresses 1 to 6, and the first character of the data string is sent to a buffer and a comparison is made. This sequence is repeated for each character but now the comparison is made only at the cell rows addresses which are adjacent the cell rows, which matched the previous character. This means that even if the length of the search character string is a variable length, only the number of times the comparison operation is repeated varies and this permits the search to be completed in an extremely short time as compared to the prior art.
    Type: Grant
    Filed: July 14, 1994
    Date of Patent: September 5, 1995
    Assignee: International Business Machines Corp.
    Inventors: Akashi Satoh, Hideto Niijima
  • Patent number: 5446889
    Abstract: A computer-based method for identifying the head of a linked list stored in a memory comprises the steps of (a) retrieving an element of the list from the memory, (b) identifying from the pointer of the retrieved element, the next subsequent stored element of the list, (c) marking the next subsequent stored element; and (d) repeating steps (a) through (c) for each stored element of the list. After processing each element, the stored element that is not marked is identified as the head of the linked list. In an alternate embodiment, an element of the list is selected as a possible candidate for head of the list, and the list is then traversed from the selected element to the end of the list. A count of the number of linkages between the selected element and the end of list is generated as the list is traversed, and each element accessed while traversing the list is marked "visited". Each other element of the list is then processed in the same manner, except that elements already visited are not processed.
    Type: Grant
    Filed: July 21, 1994
    Date of Patent: August 29, 1995
    Assignee: Unisys Corporation
    Inventors: James Prestifilippo, Clark C. Kogen
  • Patent number: 5446895
    Abstract: A measurement analysis software method and apparatus directed by computer hardware in which information is stored at the project level wherein a project comprises a collection of work tasks with a time frame and a work product to be delivered, information is stored at the application level wherein an application comprises a cohesive collection of automated procedures and data supporting a business objective, such as reporting payroll information, and one or more components modules or sub-systems and a direct relationship is provided between information stored at the project level and information stored at the application level. There is also provided integration of measurement, metric and attribute data including data repositories for measurement, metric and attribute data at said project and application levels.
    Type: Grant
    Filed: March 31, 1994
    Date of Patent: August 29, 1995
    Inventors: Leonard R. White, Caroline K. White
  • Patent number: 5442786
    Abstract: A method for creating a hierarchical data tree includes the initial step of providing a computer information processing system with a data base which interacts with user input to build the data tree based upon system responses. The user initially designates a source field and a next record field and the system searches the data base for records which have a target field matching the designated source field. The next record field of each record determines interaction with records, which have target fields matching the displayed record's source field. If a response is expected from the user, the user may either accept the record displayed or provide a separate user response as a selection. If no response is expected, according to the next record field, the system automatically selects the first matching record found. The system records the selection, whether from the system or from the user, utilizing a block of computer memory.
    Type: Grant
    Filed: April 28, 1994
    Date of Patent: August 15, 1995
    Inventor: Robert E. Bowen
  • Patent number: 5440737
    Abstract: A volume group 4 consists of a plurality of volume subgroups 41 to 4n. For example, volume subgroup 41 includes volumes 41-1 to 41-a on electronic disk units, and volume subgroup 4n includes volumes 4n-1 to 4n-d on magnetic disk units. Prioritized volume subgroups Table 5 for temporary file allocation contains priority values 11 to 1m to be assigned to user programs and the corresponding prioritized volume subgroups 511 to 51m. At the request of temporary file allocation from the user program, a temporary file allocation means 2 receives the priority 11 from a priority returning means 3, and in reference to the prioritized volume subgroups Table 5, allocates the temporary files preferentially to suitable volumes of a volume subgroup included in the corresponding prioritized volume subgroup to the priority value 11.
    Type: Grant
    Filed: July 22, 1994
    Date of Patent: August 8, 1995
    Assignee: NEC Corporation
    Inventor: Masako Uchinuma
  • Patent number: 5440738
    Abstract: An apparatus for determining the status of files stored, e.g., on the disk drive of a computer compares the name of a file to be inventoried (the "member" or "suspect" file) against a list of names of component files belonging to certain known file sets. If the member file's name compares favorably with one or more names of the component files the apparatus runs tests on the member file. These include comparing data stored in the member file with data patterns of the matching component files. The apparatus determines the confidence factor of the association between the member file and the matching component file based, at least in part, on the test results. Depending on the level of the confidence factor, it generates an output signal including the name of member file and the name of the set of the matching component file.
    Type: Grant
    Filed: October 20, 1994
    Date of Patent: August 8, 1995
    Assignee: Tally Systems Corporation
    Inventors: Philip B. Bowman, Richard L. Cohen, Brett J. Robichaud, Charles A. Muntz