Abstract: The current invention provides a mechanism for detecting and recovering from glitches on data strobes. In one embodiment, data is captured from an interlace by a receiver using at least one data strobe that is provided by the transmitter along with the data. A write address counter that is clocked by the data strobe is used to count the active edges of the data strobe. A read address counter that is periodically synchronized with the write address counter, but that is clocked by an internal clock of the receiver, is used to count units of data being received from the interface. Periodically, the contents of the read and write counters are compared. If the contents are not the same, a glitch has occurred on the data strobe. The glitch is recoverable if it occurs on, or after, a last strobe edge of a data transfer.

Abstract: A mechanism is disclosed for performing I/O operations using queue banks within a data processing system that supports multiple processing partitions. A queue bank is a re-useable area of memory allocated for performing I/O operations. All memory locking and address-translation functions are generally performed only once for a queue bank to reduce system overhead. After a queue bank has been used to perform an I/O operation, some processing is performed to make it available for re-use. This processing determines whether the queue bank contains memory that is being removed from a current processing partition. If so, a delay is imposed so that the queue bank is not made available for immediate re-use. This creates a window of time wherein all queue banks that contain the affected memory are inactive, thereby allowing the affected memory to be removed from the partition without halting on-going I/O activity.

Abstract: A system, method, and machine readable medium for monitoring and administering a distributed application implementation is disclosed where an agent is associated with an application server. The agent monitors and collects information relating to all active distributed data sessions occurring on the application server and transmits the session information to a central data repository, for example, a database. The central data repository stores data session information relating to a plurality of application servers and may contain session information relating to application servers located in a plurality of server farms. A software application is provided that is capable of receiving input from a user related to the session data in the central data repository, querying the repository and returning a subset of session data relating to the user's input. Query results are displayed to the user allowing for administration of the distributed computing environment across multiple servers and server farms.

Abstract: Clustering biometric templates is performed by determining fiduciary templates and cluster seed templates, both from a gallery of biometric templates. Similarity vectors are formed by comparing members of the cluster seed templates to the fiduciary templates. The gallery is then partitioned into clusters based upon the similarity vectors, and the clusters are populated from the remainder of the gallery. Partitioning may be performed by a classifier that implements a supervised machine learning algorithm that is trained with the similarity vectors, such as a multi-decision tree classification system. Matching may be accommodated by accessing a probe template, determining a cluster neighborhood for the probe template, and searching the cluster neighborhood to determine whether the gallery includes a match corresponding to the probe template. The same similarity metric is used both to partition a gallery into clusters, and in matching a probe template to the so-clustered gallery.

Abstract: An apparatus and method for detecting and analyzing imagery, wherein the apparatus includes an image data acquisition means, an image data conversion means, and an adaptive thresholding means. The image data acquisition means acquires image data from a document. The acquired image data is converted into a grayscale image frame by the image data conversion means. In addition, the adaptive thresholding means converts the grayscale image frame into a bi-tonal frame.

Abstract: Various approaches for processing a B+tree data structure of a database are disclosed. In one approach a method determines a pattern of multi-column key values. In response to an insert transaction into the database that requires a new index page and before performing the insert transaction, the method generates a plurality of new multi-column key values based on the pattern and stores one or more of the plurality of multi-column key values in one or more new index pages. Before performing the insert, the method further commits to retentive storage of the one or more new index pages and new data pages as linked to the B+tree. After committing the one or more new index pages and new data pages, the method then proceeds to processes and commits the insert transaction.

Abstract: In a three-tier ERP implementation, multiple servers are interconnected through one or more network infrastructure. Users may observe poor performance due to the complexity and the number of interconnected components in the implementation. Herein is devised a process for tuning the software component by applying tuning techniques to the OS, SAP application and Database Management System software. For each component, the process identifies potential tuning opportunities of various subcomponents. The process is iterated numerous times through all software components while applying the tuning techniques to derive the most optimal performance for the ERP implementation.

Abstract: Various approaches for updating system monitoring policy parameters. In one approach, updates to the monitoring policy parameters are transmitted to an event server via an event report. The event server transmits the event report to a subcomponent manager executing on the monitored system. The subcomponent manager determines to which of a plurality of monitoring subcomponents the update is to be applied. The subcomponent manager then suspends the execution thread of the monitoring subcomponents, updates monitoring policy parameters of the subcomponent with data from the event report, and thereafter resumes the execution thread of the subcomponents. The subcomponent then operates with the updated monitoring policy parameters.

Abstract: A multiprocessor system in which a defer phase response method is utilized that allows for a deferring agent to interrupt the normal flow of bus transactions once it gains control of system interface bus. The deferring agent is allowed to look ahead to determine if a continuous stream of defer phase cycles are pending transfer. If pending, the deferring agent will not release control of the bus until the pending defer phase cycles have been depleted. The look ahead feature allows expedited return of higher priority defer data, while minimizing bus dead cycles caused by interleaving defer phase cycles with normal bus traffic.

Abstract: An apparatus and method for selectively deriving Error Correction Codes (ECCs) or other data integrity information for integration into merged data blocks. First data is merged into second data that is error-protected using an ECC generated by a coding algorithm. Bytes or other data units are identified in the first data to be merged into the second data. It is determined whether each of the check bits of the ECC will differ from its original state in response to merging the first and second data. The check bits of the ECC that have been determined to differ from their respective original states are modified to create a “merged ECC.” The resulting data block includes the merged data and the merged ECC.

Abstract: An embodiment of the present invention is a technique for recording relevant information in a graphical user interface (GUI) window. Relevant information on an analysis window is saved in a summary report array using one of an automatic recording mode and a selective recording mode. The analysis window is part of the GUI to analyze state information from a panel dump file retrieved from a computer system. The saved relevant information is displayed on a report window.

Abstract: In general, techniques for secure communicating over a virtual IPMB of a mainframe computing system are described herein. More specifically, the mainframe computing system comprises a plurality of independent computing cells communicatively coupled together by a network interconnect and that form a plurality of partitions. Each partition is a logical association of one or more of the cells to define a single execution environment. Each cell further executes a virtual intelligent platform management interface (IPMI) protocol to define and configure a respective logical intelligent platform management bus (IPMB) for each of the partitions. Each of the IPMBs logically interconnects with each of the other cells included within the same partition, and each is defined for communication of IMPI messages over the network interconnect. The cells securely communicate the IPMI messages between each of the one or more other cells of each partition via the respective logical IPMB of each partition.

Abstract: A tree-based datastore comprising a forest of interconnected trees is generated and/or accessed. The tree-based datastore comprises a first tree that depends from a first root node and may include a plurality of branches. Each of the branches of the first tree ends in a leaf node. Each leaf node may represent an end product, as described more fully below. A second root of the same tree-based datastore is linked to each leaf node representing an end product. Hence, the second root is essentially a root to an inverted order of the first tree, but the first tree is not duplicated. Finally, the tree-based datastore comprises a plurality of trees in which the root node of each of these trees is an elemental node, as described more fully below. The root node of each of these trees may be linked to one or more nodes in one or more branches of the first tree. The nodes of the tree-based datastore contain only pointers to other nodes in the tree-based datastore.

Abstract: A method of and apparatus for efficiently providing video on demand services to a cable television subscriber. The provider system consists of two major subsystems. The first subsystem, called a video server, streams video to video on demand subscribers through the cable television network. The second subsystem, called the transaction server, performs virtually all remaining provider functions including, security, accounting, storage and spooling of video data, etc. The transaction server preferably uses a large scale mainframe computer. The video server subsystem may be a partitioned portion of same large scale mainframe computer.

Abstract: Methods and systems for containing data errors in a computing system are disclosed. One method includes receiving data from an endpoint at the communication interface in response to a data request. The method also includes detecting an error in the data. The method further includes ignoring subsequent data received from the endpoint.

Abstract: A telephony-based messaging system application is built for use by a particular customer. The application is stored on a computer readable medium and includes a set of modules, where each module comprises call flows, code and a Customization List. The Customization List includes one or more tables each having a list of names and a modifiable list of corresponding DTMF signal identifiers. With this architecture, the particular customer is permitted to change the mapping between caller-entered DTMF signals and the corresponding actions taken by the messaging system by modifying the list of DTMF signal identifiers, i.e., without modifying the call flows or code.

Abstract: In general, techniques for communicating within a mainframe computing system via a virtual Intelligent Platform Management Interface (IPMI) protocol are described herein. More specifically, the mainframe computing system comprises a first cell that forms an Ethernet message to directly encapsulate an IPMI message without further encapsulating the IPMI message within any other protocol message. The mainframe computing system further comprises other cells. The cell further transmits the Ethernet message to at least one of the other cells. The first cell couples to the other cells via an Ethernet interconnect however, and not an IPMB. The cells overcome this limitation by communicating via the virtual IPMI protocol, which allows each cell to leverage pre-configured support of IPMI over the Ethernet interconnect and thereby forgo the requirement of an IPMB to communicate via IPMI.

Abstract: A connector assembly is provided having a cable end plug with a body adapted to be connected to a cable with a connector part, and at least one outwardly extending flange on the body. A mating receptacle receives the cable end plug. The receptacle has a body with a complementary connector part to the cable end plug connector part. A retention clip is connected to the receptacle body, and includes at least one spring arm extending outwardly therefrom with a distal entry ramp portion, a retaining shoulder portion and a flange receiving portion. A thickness of the flange is approximately equal to a depth of the flange receiving portion so that the retaining shoulder portion engages behind the flange in a connected position of the cable end plug in the mating receptacle. For release, the retaining shoulder can be set at an angle of at least 94° to the flange receiving portion to form a release ramp that allows disengagement when a sufficiently high predetermined release force is applied to the cable end plug.

Abstract: An intermediate representation of sequences of instructions for a stacked based computer is a code graph using a numbering method on the nodes of the graph, along with a set of relations among the nodes, to determine, in a single pass, the independence of each node or sub-graph represented by the node. The numbering is a post-order that directly, by numerical comparison defines the relevant hierarchical relationships among sub-graphs. The sub-graph of a particular node may have one or more alias nodes that refers to target nodes, a target node being a node representing an argument which is the result of a previous program instruction. For a subgraph to be considered independent, any aliases generated by nodes within the subgraph must themselves be contained in it, and conversely, any aliases in the subgraph must have been generated by nodes also within it.

Abstract: A method and apparatus is presented allowing multiple data pointers or addresses to be transferred without acknowledgment to Memory Controller (506) and Memory Controller (510) of Data Controller (500). Data is then transferred in response to the data pointers from BUFFER (512) and Buffer (514) and may be stalled during the transfer in favor of a second data transfer. Once the second data transfer finishes, the first data transfer may be completed.