Abstract: A method for selecting a preferred cache for the download of digital data from a plurality of caches is disclosed. The method comprises the steps of requesting an address of the preferred cache and selecting the preferred cache from the plurality of caches. The selection of the preferred cache is derived from a location identifier of a client requesting the download of the digital data.

Abstract: A multiplier circuit is disclosed including a Wallace tree block and a carry propagation adder. The Wallace tree block includes a sum calculation block adding partial products for each digit and a carry calculation block adding carries obtained in the addition by the sum calculation block. In the case of multiplication over an extension field (finite field GF(2n)) of two, a result of calculation by the sum calculation block is outputted. The carry propagation adder adds the result of calculation by the sum calculation block and a result of calculation by the carry calculation block. In the case of multiplication for integers (finite field GF(p)), a result of calculation by the carry propagation adder is outputted.

Abstract: Techniques for problem determination are provided. The techniques include identifying one or more configuration items in two or more systems connected to one or more networks, performing a comparison of one or more common configuration items from the one or more configuration items in the two or more systems connected to one or more networks, and using the comparison to detect deviation between one or more configuration items of one of the two or more systems and one or more respective configuration items in the other one or more systems.

Abstract: The present invention allows for direct chip-to-chip connections using the shortest possible signal path.

Abstract: A technique for analyzing two or more data streams respectively generated from two or more components of a controllable process includes the following steps. In a first step, a statistical analysis is performed on each of the two or more data streams to generate first analysis results in the form of respective statistical results for the two or more data streams. In a second step, at least a portion of the statistical results from at least one of the two or more data streams is combined with at least a portion of the statistical results from at least another one of the two or more data streams to yield second analysis results. The controllable process is adjustable based on at least one of the first analysis results and the second analysis results.

Abstract: A technique for use in a client, wherein the client supports a state-based signaling protocol (e.g., Session Initiation Protocol or SIP), includes initiating a given session state between the client and a server that also supports the state-based signaling protocol, and refreshing the given session state in a randomized manner. Further, a technique for use in a server, wherein the server supports a state-based signaling protocol (again, e.g., SIP), includes randomly assigning an expiration time duration for a given session state between the server and a client that also supports the state-based signaling protocol, and reporting the randomly assigned expiration time for the given session state to the client. By randomizing various behaviors of the client, the server, or both, bursty traffic in the communication network is reduced or eliminated.

Abstract: Techniques for constructing change plans from one or more component interactions are provided. For example, one computer-implemented technique includes observing at least one interaction between two or more components of at least one distributed computing system, consolidating the at least one interaction into at least one interaction pattern, and using the at least one interaction pattern to construct at least one change plan, wherein the at least one change plan is useable for managing the at least one distributed computing system.

Abstract: Techniques for dynamically selecting a server state for one or more servers in a cluster of servers are provided. The techniques include tracking each active and sleep state of each server in a cluster of servers, and selecting a server state for one or more servers in the cluster of servers to meet one or more workload level requirements of the cluster of servers, wherein selecting a server state for one or more servers comprises scheduling a transition between one or more active and sleep states for the one or more servers, wherein scheduling the transition comprises using power consumption information for each state and transition time information for each transition.

Abstract: Techniques are disclosed for capturing, storing, querying and analyzing provenance data for automatic discovery of enterprise process information. For example, a computer-implemented method for managing a process associated with an enterprise comprises the following steps. Data associated with an actual end-to-end execution of an enterprise process is collected. Provenance data is generated based on at least a portion of the collected data, wherein the provenance data is indicative of a lineage of one or more data items. A provenance graph that provides a visual representation of the generated provenance data is generated, wherein nodes of the graph represent records associated with the collected data and edges of the graph represent relations between the records. The generated provenance graph is stored in a repository for use in analyzing the enterprise process.

Abstract: A method of detecting deadlock in a multithreading program is provided. An invocation graph is constructed having a single root and a plurality of nodes corresponding to one or more functions written in code of the multithreading program. A resource graph is computed in accordance with one or more resource sets in effect at each node of the invocation graph. It is determined whether cycles exist between two or more nodes of the resource graph. A cycle is an indication of deadlock in the multithreading program.

Abstract: A scheduler is adapted to schedule packets or other data blocks for transmission from a plurality of transmission elements in timeslots of a frame in a communication system. In scheduling for a given frame, the scheduler initially designates each of the transmission elements as eligible to transmit one or more data blocks in the given frame, and selects from among those of the transmission elements designated as eligible at least one of the transmission elements for scheduling in a next available timeslot of the given frame. The scheduler then adjusts the eligibility status of the selected transmission element(s), and repeats the selecting and adjusting operations for one or more remaining timeslots of the given frame. The scheduler in an illustrative embodiment may be implemented in a network processor integrated circuit or other processing device of the communication system.

Abstract: A circuit includes an amplifier having an input and an output; and at least one transistor comprising at least one terminal and at least one isolated well. The input of the amplifier is electrically connected to the at least one terminal of the transistor; and the output of the amplifier is electrically connected to the at least one isolated well of the at least one transistor.

Abstract: Techniques are presented for automatically selecting information sources that are most relevant to user queries. Results of searches returned by information sources for queries are analyzed and the information sources are ranked based on this analysis. The information sources that have high rankings for a query are subsequently used to search for relevant results. This process can be adaptive, as the returned results of old queries can be analyzed at a later date to update the ranking of the information sources, automatic searches can be performed to update the ranking of the information sources, new queries can be used for analysis and stored, new information sources added, and old information sources deleted. A linguistic library is used to store personal categories for one or more users and general categories. Each category is associated with keywords and ranked lists of information sources. The library also contains general categories, taxonomies, and dictionaries.

Abstract: Methods and apparatus are provided for identifying constraint violation repairs in data that is comprised of a plurality of records, where each record has a plurality of cells. A database is processed, based on a plurality of constraints that data in the database must satisfy. At least one constraint violation to be resolved is identified based on a cost of repair and the corresponding records to be resolved and equivalent cells are identified in the data that violate the identified at least one constraint violation. A value for each of the equivalent cells can optionally be determined, and the determined value can be assigned to each of the equivalent cells. The at least one constraint violation selected for resolution may be, for example, the constraint violation with a lowest cost. The cost of repairing a constraint is based on a distance metric between the attributes values.

Abstract: A method and apparatus are provided for determining a plurality of filter tap weights or biases (or both) for a noise predictive filter used to generate one or more signal dependent branch metrics. A filter tap weight or filter bias (or both) are adaptively accumulated for each possible data condition. The data conditions may comprise, for example, each possible data pattern for a given data dependency length. The appropriate accumulated filter tap weight or bias to update can be selected based on a data condition associated with the current received data. The filter tap weights associated with a delay 0 tap can be adapted for each filter condition except for a single normalizing condition, whose corresponding delay 0 tap remains fixed.

Abstract: Methods and apparatus are provided for improved physical re-read operations in a hard disk drive. The disclosed methods and apparatus selectively retain data in a hard disk drive. A signal is read in an iterative read channel by assigning a reliability metric to each of a plurality of segments in a read signal; repeating the assigning step for a plurality of read operations; and selectively retaining the segments based on the assigned reliability metric. The read signal can be obtained by positioning a transducer over a storage media. The reliability metric may be based on soft bit decisions; log likelihood ratios or a noise estimation of a given segment.

Abstract: Phase and frequency detectors and techniques are disclosed. For example, apparatus comprises a first circuit for receiving first and second clock signals and for generating at least one signal indicative of a phase difference between the first and second clock signals. The apparatus also comprises a second circuit for receiving the at least one signal generated by the first circuit and, in response to the at least one received signal, generating at least one output signal, wherein a frequency associated with the at least one output signal is proportional to a frequency difference between the first and second clock signals.

Abstract: Techniques for forming a real-time activity group are provided. The techniques include creating a set of one or more users, annotating each user in the set with one or more corresponding real-time attributes, and using the one or more real-time attributes to identify one or more connections between the one or more users in the set to form a real-time activity group within the set of one or more users, wherein the one or more connections are based on an activity request.

Abstract: An access node of a communication system comprises a plurality of transmitters adapted for communication with at least one receiver. The access node is operative to simultaneously estimate channel coefficients between multiple ones of the transmitters and the receiver, and to utilize the estimated channel coefficients to control at least one data signal sent by at least one of the multiple transmitters to the receiver. In the process of simultaneously estimating the channel coefficients, the access node transmits a plurality of distinct probing signals, each of which is generated based on a distinct combination of a common probing sequence and a selected one of a plurality of different frequency expansions. The access node may comprise at least a portion of at least one central office of a DSL communication system.

Abstract: A plurality of pure operator type rules are instantiated within a domain of a telecommunications operator and a plurality of pure application type rules are instantiated within a domain of a third party telecommunications application provider. The plurality of pure operator type rules and the plurality of pure application type rules are associated with a composite service. A plurality of network components are established to transmit given events of a plurality of protocol-level events to at least one of the domain of the telecommunications operator and the domain of the third party telecommunications application provider. The composite service is deployed in an execution engine of the third party telecommunications application provider.