Abstract: Methods and apparatus are provided for improved startup of a voltage controlled delay loop that has an injection clock and a return clock. A control signal is determined for a plurality of delay elements in a voltage controlled delay loop by obtaining a histogram count of a number of occurrences of at least one predefined logic value for a plurality of delay settings of the voltage controlled delay loop; determining a histogram count that approximately corresponds to an alignment of at least one edge in the injection and return clocks; and determining the control signal based on the determined histogram count that approximately corresponds to the alignment. The voltage controlled delay loop can be started using the determined control signal. The histogram count can be obtained for a plurality of PVT combinations and the control signal can then be determined for each PVT combination.

Abstract: A memory circuit includes a plurality of bit line structures, a plurality of word line structures intersecting the plurality of bit line structures to form a plurality of cell locations; and a plurality of cells located at the plurality of cell locations. Each of the cells is selectively coupled to a corresponding one of the bit line structures under control of a corresponding one of the word line structures, and each of the cells in turn includes a logical storage element having at least a first n-type field effect transistor and at least a first p-type field effect transistor. The at least first n-type field effect transistor is formed with a relatively thick buried oxide layer sized to reduce capacitance of the bit line structures, and the at least first p-type field effect transistor is formed with a relatively thin buried oxide layer.

Abstract: N applications are placed on M virtualized servers having power management capability. A time horizon is divided into a plurality of time windows, and, for each given one of the windows, a placement of the N applications is computed, taking into account power cost, migration cost, and performance benefit. The migration cost refers to cost to migrate from a first virtualized server to a second virtualized server for the given one of the windows. The N applications are placed onto the M virtualized servers, for each of the plurality of time windows, in accordance with the placement computed in the computing step for each of the windows.

Abstract: Apparatus for distributing streaming multimedia to at least one end client over a network includes memory and at least one processor operatively connected to the memory. The processor is operative: (i) to receive the streaming multimedia from at least one multimedia source via at least one of a plurality of channels in the network; (ii) when a channel change request generated by the end client for changing a channel and corresponding multimedia content from the multimedia source is not detected, to deliver the at least one multimedia stream to the end client at a first data rate; and (iii) when the channel change request has been detected, to deliver the at least one multimedia stream to the end client at a second rate for a prescribed period of time after receiving the channel change request and, after the prescribed period of time, to deliver the at least one multimedia stream to the end client at the first data rate, wherein the second data rate is greater than the first data rate.

Abstract: Configuration parameter name-value pairs are obtained for each of a plurality of component instances in a deployed software solution. A candidate set of configuration dependencies between different ones of the plurality of component instances in the deployed software solution is identified, based on the configuration parameter name-value pairs. The candidate set of configuration dependencies includes true dependencies and false dependencies. The candidate set of configuration dependencies is rank-ordered to obtain a rank-ordered list, such that a probability of the true dependencies getting a higher rank is greater than a probability of the false dependencies getting a higher rank.

Abstract: To predict edges in a non-cumulative graph, based on a sequence of non-cumulative previous occurrences of the graph, the sequence of non-cumulative previous occurrences of the graph is obtained, and topological properties of each of the previous occurrences of the graph are extracted. Topological similarities between each of the previous occurrences of the graph are computed based on the topological properties. The edges of the graph are predicted by computing a score for each possible edge of the graph, based upon the topological similarities.

Abstract: Techniques are disclosed for influencing behavior of enterprise operations during process enactment using provenance data. For example, a computer-implemented method of influencing a behavior of an enterprise process comprises the following steps. Provenance data is generated, wherein the provenance data is based on collected data associated with at least a partial actual execution of the enterprise process and is indicative of a lineage of one or more data items. A provenance graph is generated that provides a visual representation of the generated provenance data, wherein nodes of the graph represent records associated with the collected data and edges of the graph represent relations between the records. At least a portion of the generated provenance data from the graph is analyzed to generate an execution pattern corresponding to the at least partial actual execution of the enterprise process. The execution pattern is compared to one or more previously stored patterns.

Abstract: Methods and apparatus are provided for detecting a loss of lock condition in a clock and data recovery system. A loss of lock condition is detected in a clock and data recovery system that generates a recovered clock signal from a received signal by sampling the received signal for a plurality of different phases using one or more latches clocked by the recovered clock; evaluating the samples to monitor a data eye associated with the received signal; and detecting the loss of lock condition if the data eye does not satisfy one or more predefined conditions. Generally, the predefined conditions identify a loss of the data eye (e.g., when the data eye cannot be substantially detected), for example, based on a degree of opening of the data eye. The clock and data recovery system can optionally be restarted if the loss of lock condition is detected.

Abstract: Techniques for extracting information from a formatted document are provided. The techniques include combining one or more visual layout rules, one or more mark-up rules and one or more text-based rules in connection with a formatted document, and specifying one or more rules from the one or more visual layout rules, one or more mark-up rules and one or more text based rules to extract information from the formatted document.

Abstract: Techniques for constructing and using models in accordance with service level management are disclosed. In one aspect of the invention, a technique for constructing a model (e.g., a system model) representative of a resource for use in managing a service associated with the resource, comprises the following steps/operations. A set of resource metrics is obtained in accordance with a resource abstract model (RAM) associated with the resource. Then, a model representative of the resource is constructed based on at least a portion of the set of resource metrics obtained from the resource abstract model.

Abstract: Techniques are disclosed for schedule management. By way of example, a method for managing performance of tasks in threads associated with at least one processor comprises the following steps. One or more units of a first task type are executed. A count of the one or more units of the first task type executed is maintained. The count represents one or more credits accumulated by the processor for executing the one or more units of a first task type. One or more units of a second task type are executed. During execution of the one or more units of a second task type, a request to execute at least one further unit of the first task type is received. The amount of credits in the count is checked. When it is determined that there is sufficient credit in the count, the request to execute the at least one further unit of the first task type is forgone, and execution of the one or more units of the second task type continues.

Abstract: Methods are provided for assisting in the organization of information accessed through a web browser. At least one item of information accessed through the web browser is captured and visually represented in a defined organizational area of a display. A relevance index is calculated for each item of information that is visually represented to a current web-browsing behavior. The relevance index is conveyed for each item of information to the current web-browsing behavior to a user of the web browser.

Abstract: A method for the distribution of digital objects in a peer-to-peer network is disclosed. The digital objects are distributed in a plurality of pieces. At least some of a plurality of peers are connected to other ones of the plurality of peers and at least one of the peers is connected to at least one cache.

Abstract: Improved descriptive query techniques are provided. More particularly, techniques are provided for specifying and processing descriptive queries for data providers grouped into provider kinds with hierarchical containment relationships. The query may include arbitrary boolean combinations of arbitrary tests on the values of attributes of the data providers.

Abstract: A circuit and method for securing against non-reset of a device associated with the circuit, the circuit comprising: a first register for holding a first multi-bit value and to produce a first multi-bit output value related to the first multi-bit value; a second register for holding a second multi-bit value and to produce a second multi-bit output value related to the second multi-bit value; an inverter means arranged to invert only one of the first and second output values; and a comparator arranged to compare the inverted and non-inverted output values to produce a comparator output, wherein the first and second registers are arranged such that they are subject to substantially the same operational conditions.

Abstract: A method and apparatus are disclosed for transmitting symbols in a multiple antenna communication system. The disclosed frame structure comprises a preamble having a plurality of long training symbols that are transmitted on a plurality transmit antennas. At least a portion of the frame is delayed on at least one transmit antenna. The disclosed frame formats of the present invention are backwards compatible to existing single antenna communication systems. The delay amount, D, can be approximately equal to one OFDM time sample period, T. The delayed version can be obtained by introducing a time delay into a signal on the delayed branch(es) or by cyclically shifting at least a portion of each frame on the delayed branch(es). The entire frame or only the preamble portion of each frame can be delayed.

Abstract: Techniques for computing an enterprise process compliance index are provided. The techniques include obtaining an enterprise process, obtaining a compliance policy, segmenting the enterprise process into at least one process step and the compliance policy in at least one policy clause, and computing an enterprise process compliance index, wherein computing the enterprise process compliance index comprises determining an applicability of the at least one process step to the at least one policy clause.

Abstract: A traffic balancing system, traffic balancing device and traffic balancing method that converts IP packets by switching IP address of the destination host between the dual stack hosts communicating with each other, in order to control traffic balancing in the networks.

Abstract: Data pertaining to interactions between a plurality of customers is obtained. A graph is formed, having a plurality of nodes representing the customers and a plurality of edges representing interactions between the customers. A sub-set of the customers are denoted as previously churned customers. A spreading activation model is applied to the graph to identify, based on the graph and the previously churned customers, the potential churning customers.

Abstract: A method and apparatus are disclosed for establishing a bound on the effect of task interference in an instruction cache shared by multiple tasks. The bound established by the present invention is the maximum number of “live” frames of a given task that are coexistent during the execution of an application. A “live cache frame” contains a block that is accessed in the future without an intervening eviction. The eviction of blocks from a live frame by an interrupt causes a future miss that would not otherwise occur and evictions from live frames are the only evictions that cause misses that would not otherwise occur. The invention provides a more accurate estimate of the maximum additional execution time of a task that results from servicing an interrupt during its execution. Additional accuracy is obtained by exploiting knowledge of the character of an intervening task to achieve a tighter bound, when possible.