Abstract: A switcher device comprises a multiplexer coupled in-between at least one input and output cards. The multiplexer detects the presence of an event signal from an activated sink. In response to the detection of the event signal, a processor changes an address of an HDCP receiver from a first address to a second address for enabling the at least one source to authenticate with the input card and enabling the output card to authenticate with the at least one sink for security protocol encryption. In response to the non-detection of the event signal, the processor changes the address of an HDCP receiver from the second address to the first address for disabling the at least one source from initiating a first authentication with the input card, therefore the output card also does not attempt to initiate a second authentication with the at least one sink for security protocol encryption.

Abstract: A switcher device comprises a multiplexer coupled in-between at least one input and output cards. The multiplexer detects the presence of an event signal from an activated sink. In response to the detection of the event signal, the switch dynamically switches to a closed position in order to enable the at least one source to authenticate with the input card and the output card to authenticate with the at least one sink for security protocol encryption. In response to the non-detection of the event signal, the switch switches dynamically to an open position in order to disable the at least one source from authenticating with the input card, therefore the output card also does not attempt to authenticate with the at least one sink for security protocol encryption.

Abstract: A switcher device comprises a multiplexer coupled in-between at least one input and output cards. The multiplexer detects the presence of an event signal from an activated sink. In response to the detection of the event signal, a processor changes an address of an HDCP receiver from a first address to a second address for enabling the at least one source to authenticate with the input card and enabling the output card to authenticate with the at least one sink for security protocol encryption. In response to the non-detection of the event signal, the processor changes the address of an HDCP receiver from the second address to the first address for disabling the at least one source from initiating a first authentication with the input card, therefore the output card also does not attempt to initiate a second authentication with the at least one sink for security protocol encryption.

Abstract: Presented is a method for determining the maximum number of key selection vectors (KSVs) supported by an HDCP source. The method includes providing a number of KSVs to the HDCP source, determining whether the HDCP source has entered a failure mode in response to the provided number of KSVs, increasing or decreasing the number of KSVs in response to the HDCP source not entering or entering the failure mode, providing the increased or decreased number of KSVs to the HDCP source, determining whether the HDCP source has entered the failure mode in response to the provided increased or decreased number of KSVs, and repeating the increasing, decreasing, and determining steps until the difference between a lowest number of provided KSVs resulting in the HDCP source entering the failure mode and a highest number of provided KSVs resulting in the HDCP source not entering the failure mode is one.

Abstract: Systems, methods, and articles of manufacture to provide cloud resource orchestration are disclosed. An example method includes converting, with a processor, a plurality of constraints and a goal for a cloud deployment into a constraint optimization problem, calculating, with the processor, a solution for the constraint optimization problem, and generating instructions to perform cloud resource orchestration for the cloud deployment based on the solution of the constraint optimization problem.

Abstract: Presented is a method for determining the maximum number of key selection vectors (KSVs) supported by an HDCP source. The method includes transmitting a number of KSVs to the HDCP source, determining whether the HDCP source has entered a failure mode in response to the transmitted number of KSVs, increasing or decreasing the number of KSVs in response to the HDCP source not entering or entering the failure mode, transmitting the increased or decreased number of KSVs to the HDCP source, determining whether the HDCP source has entered the failure mode in response to the transmitted increased or decreased number of KSVs, and repeating the increasing, decreasing, and determining steps until the difference between a lowest number of transmitted KSVs resulting in the HDCP source entering the failure mode and a highest number of transmitted KSVs resulting in the HDCP source not entering the failure mode is one.

Abstract: An aspect of the disclosed technology is a general-purpose platform that may be used to provide resilient cloud services. Tasks may be written as procedures in general-purpose programming languages that directly manipulate resources via control interfaces. In one implementation, resource states, such as router configurations and virtual machine states, associated with a cloud customer that provides communications services, may be abstracted into tables in a relational or semi-structured database. State changes that have been written to the database tables are automatically propagated by the database to appropriate customer physical devices, such as network elements, thereby implementing various customer network operations.

Abstract: Presented is a method for determining the maximum number of key selection vectors (KSVs) supported by an HDCP source. The method includes providing a number of KSVs to the HDCP source, determining whether the HDCP source has entered a failure mode in response to the provided number of KSVs, increasing or decreasing the number of KSVs in response to the HDCP source not entering or entering the failure mode, providing the increased or decreased number of KSVs to the HDCP source, determining whether the HDCP source has entered the failure mode in response to the provided increased or decreased number of KSVs, and repeating the increasing, decreasing, and determining steps until the difference between a lowest number of provided KSVs resulting in the HDCP source entering the failure mode and a highest number of provided KSVs resulting in the HDCP source not entering the failure mode is one.

Abstract: The disclosed technology involves the use of relational databases in conjunction with declarative language and network-wide, database abstractions to manage and operate networks. The data model creates a logically centralized database abstraction and access point for managing data relevant to network management. Exemplary managed data includes router configurations, network status and provisioning data. This information resides in a single database system which is tightly integrated with the operational network. Transactional write operations are used to change network configurations, and enforce constraints to detect and prevent policy violations during operation. In accordance with one aspect of the disclosed technology, a network operation is implemented by means of a series of database commands—read and/or write—from and to database view tables.

Abstract: Presented is a method for determining the maximum number of key selection vectors (KSVs) supported by an HDCP source. The method includes transmitting a number of KSVs to the HDCP source, determining whether the HDCP source has entered a failure mode in response to the transmitted number of KSVs, increasing or decreasing the number of KSVs in response to the HDCP source not entering or entering the failure mode, transmitting the increased or decreased number of KSVs to the HDCP source, determining whether the HDCP source has entered the failure mode in response to the transmitted increased or decreased number of KSVs, and repeating the increasing, decreasing, and determining steps until the difference between a lowest number of transmitted KSVs resulting in the HDCP source entering the failure mode and a highest number of transmitted KSVs resulting in the HDCP source not entering the failure mode is one.

Abstract: In one embodiment, the disclosed technology involves modeling network elements, such as router configurations and link information, as well as any generic network status, as data in a relational database. Various network data, such as router states and link states are abstracted into tables in the relational database. Network management operations may then be represented as a series of transactional database queries and insertions. As a result, the database automatically propagates, to the appropriate network elements, state changes that are written to database tables, thereby implementing various network operations. Tables in the database can be constructed at various levels of abstraction, as required to satisfy network operational demands. Programmability is provided by a declarative language composed of a series of database queries and insertions.

Abstract: In one embodiment, the disclosed technology involves modeling network elements, such as router configurations and link information, as well as any generic network status, as data in a relational database. Various network data, such as router states and link states are abstracted into tables in the relational database. Network management operations may then be represented as a series of transactional database queries and insertions. As a result, the database automatically propagates, to the appropriate network elements, state changes that are written to database tables, thereby implementing various network operations. Tables in the database can be constructed at various levels of abstraction, as required to satisfy network operational demands. Programmability is provided by a declarative language composed of a series of database queries and insertions.

Abstract: A method (which can be computer implemented) for inferring component associations among a plurality of components in a distributed computing system includes the steps of obtaining status information for each pertinent component of the plurality of components, forming an N by D matrix, X, based on the status information, and factorizing the matrix X to obtain a first matrix indicative of the component associations to be inferred and a second matrix indicative of failure explanations for corresponding ones of the probe instances. N is a number of probe instances associated with a given time frame. D is a number of the plurality of components for which the associations are to be inferred. Techniques are also presented for forming a database with the status information.

Abstract: A method (which can be computer implemented) fox inferring component associations among a plurality of components in a distributed computing system includes the steps of obtaining status information fox each pertinent component of the plurality of components, forming an N by D matrix, X, based on the status information, and factorizing the matrix X to obtain a first matrix indicative of the component associations to be inferred and a second matrix indicative of failure explanations for corresponding ones of the probe instances. N is a number of probe instances associated with a given time flame. D is a number of the plurality of components fox which the associations are to be inferred. Techniques are also presented for forming a database with the status information.

Abstract: The present invention provides a method of synthesizing nanosized abrasive particles and methods of using the same in chemical mechanical polishing slurry applications. The nanosized abrasive particles according to the invention are produced by hydrothermal synthesis. The crystallites of the particles include cerium atoms and atoms of metals other than cerium. In a preferred embodiment of the invention, the crystallites exhibit a cubic crystal lattice structure. The differences in electric potential between the cerium atoms and the atoms of metals other than cerium facilitate the polishing of films without the need for chemical oxidizers.