Abstract: A method and system for determining a probability of inferring an unknown attribute value for an attribute of interest for a target node in a social network. The method comprises the steps of receiving as an input attribute values and link relationships for a plurality of additional nodes in the social network, creating a simplified network using the input values and relationships, and calculating the probability of inferring the unknown attribute value for the target node.

Abstract: A system and method for automatically extracting relevant key concepts from a free-text document and indexing the document using the extracted key concepts. The indexing mechanism applies syntactic and semantic filters to filter out irrelevant terms. The remaining terms are deemed to be key concepts for the free-text document. An input search query is compared against the key concepts extracted for the free-text document for determining whether the document satisfies the query. Prior to applying the search query, additional scenario-specific terms are added to the search query in order to improve retrieval performance. The query expansion mechanism generates a list of candidate expansion concepts, filters the list of candidate expansion concepts based on a user-entered scenario concept, and expands the input query based on the candidate expansion concepts remaining after the filtering process.

Abstract: A method and system for determining a probability of inferring an unknown attribute value for an attribute of interest for a target node in a social network. The method comprises the steps of receiving as an input attribute values and link relationships for a plurality of additional nodes in the social network, creating a simplified network using the input values and relationships, and calculating the probability of inferring the unknown attribute value for the target node.

Abstract: A database event detection and notification system includes a rule definer for defining a high level rule which can include conceptual terms (e.g. bad, heavy) and as cooperative operators (e.g. approximate, similar-to, near-to). A rule converter converts the high level rule into a low level rule in which the conceptual terms and cooperative operators are quantified. An event manager detects and evaluates an event generated by the database or a Local Event Detector (LED). A rule manager applies the low level rule to the event detected by the event manager, and an action manager performs an action in accordance with the application of the rule by the rule manager. The action can include notifying a specified person or program that the event has occurred. The rule converter and the action manager utilize a Type Abstraction Hierarchy (TAH) for converting the high level rule into the low level rule and performing the action respectively. The rule comprises an attribute.

Abstract: A system for obtaining target data from a conventional computer database in response to an input query which has at least one attribute includes a Type Abstraction Hierarchy (TAH) manager for providing a TAH structure including relaxation conditions for said at least one attribute. A control unit successively applies a database query which corresponds to the input query to and receives data from the database, with progressively relaxed conditions of the attribute(s) being provided by the TAH manager, until the target data in the form of a specified number of ranked answers which satisfy the attribute conditions is obtained. The attribute relaxation process can be controlled such as relaxation order, preference list, reject, etc. to obtain user and context specific answers. The system can produce approximate answers or answers to query with conceptual terms. The input query can including cooperative operators such as "APPROXIMATELY", "NEAR TO" or "SIMILAR TO" or conceptual terms (e.g.

Abstract: Multiaccess memory modules are each connected by means of a bus to a system ddress multiplexer and to a system data multiplexer/demultiplexer. Each module includes a multiaccess memory connected to the system address multiplexer through a component address demultiplexer and a single bus for being addressed. Each multiaccess memory is also connected to the system data multiplexer/demultiplexer through a component data multiplexer/demultiplexer and a single bus for reading or sensing the memory and writing data into the memory. The memory cells of the multiaccess memory components consist of capacitor storage cells, also known as metal oxide silicon (semiconductor) (MOS) capacitors.

Abstract: Memory apparatus for use in a data processing system and which includes in ts entirety a number of multi-access modules each formed of a plurality of data bit cells. Each module is accessed through multiple independent channels and each channel is capable of servicing a different request during the same memory cycle. Structurally, each independent channel is coupled by a drive line to a data bit storage cell and each drive line is energizable to close a switch mechanism for connecting a read-write bit line circuit to the cell. Individual cells have their own independent bit line circuits and switch mechanisms. Thus, plural requests for a read-out of a single cell can be serviced simultaneously. Special circuitry is suggested for resolving conflicts arising in situations involving simultaneous read-write or write requests addressed to a single cell.

Abstract: A statistical multiplexing system is provided for computer communications, in which asynchronous user messages are transmitted from the individual terminals to the central processor, or other remote location, in random order. The messages are statistically multiplexed, with time slots being assigned in the communication channel as each message is received from the terminals, and with no time slots being assigned for idle periods, which greatly increases channel utilization. A buffer memory is required in the system to temporarily store messages from the terminals at statistical peaks. To improve channel efficiency, several characters for the same terminal may be collected together in the system to form an addressed data sub-block so as to reduce address label requirements. These sub-blocks are assembled into multiplexed data blocks by a microprocessor and stored in the buffer memory.

Abstract: A statistical multiplexing system is provided which includes two microprocessors with independent local memories, the microprocessors being designated as the "send microprocessor" and the "receive microprocessor," respectively. Communication between the two microprocessors is provided by an interprocess communication facility which comprises a first-in-first-out memory, and such communication is initiated by interrupt signals to the respective microprocessors. The send microprocessor assembles characters from different terminals, echos characters back to the different terminals in accordance with a local echoing function, collects characters from the same terminal into data sub-blocks with block time-out interrupts, multiplexes the data sub-blocks, forms the data sub-blocks into data blocks and transmits the data blocks to remote stations according to data destination addresses in the data blocks.