Abstract: Systems, methods, and other embodiments associated with the recovery of a lost site key value used in encryption are described. In one embodiment, site key recovery logic is configured to analyze an encrypted data item to identify a bin number and a hash table index within a header of the encrypted data item. The bin number is derived from a first portion of the site key value and the hash table index is derived from the site key value. The site key value includes at least the first portion and a second portion. A bin recovery process is performed on the bin number to recover the first portion. A filter matching process is performed using the first portion and a site key filter to recover the second portion. An index matching process is performed using the second portion and the hash table index to recover the site key value.

Abstract: Herein is described a data-parallel algorithm for topic modeling in which the memory requirements are streamlined for implementation on a highly-parallel architecture, such as a GPU. Specifically, approximate counters are used in a large mixture model or clustering algorithm (e.g., an uncollapsed Gibbs sampler) to decrease memory usage over what is required when conventional counters are used. The decreased memory usage of the approximate counters allows a highly-parallel architecture with limited memory to process more computations for the large mixture model more efficiently. Embodiments describe binary Morris approximate counters, general Morris approximate counters, and Csrös approximate counters in the context of an uncollapsed Gibbs sampler, and, more specifically, for a Greedy Gibbs sampler.

Abstract: Methods, systems, and computer readable media for applying a subscriber based policy to a network service data flow are disclosed. According to one example, the method includes determining, based on message traffic communicated between a user equipment device and an operator network via GTP, a private socket address that identifies the user equipment device and conducting network address translation (NAT) on a spoofed Internet protocol (IP) protocol data unit (PDU) that includes the private socket address in order to derive a corresponding public socket address. The method further includes provisioning, in a network element positioned in the operator network, a mapping record that correlates the private socket address to the public socket address, and utilizing, by the network element, the mapping record to apply at least one subscriber-based policy to received service data flow associated with the user equipment device.

Abstract: This disclosure describes, generally, methods and systems for implementing in-lane exception handling. The method includes displaying, on a user terminal display device, a first user interface (UI) configured to display application data in organized rows and columns, receiving, by a data management system, updates and/or edits to the application data, and calculating, by the data management system, the updated and/or edited application data. The method further includes analyzing, by the data management system, the updates and/or edits to determine one or more of associated errors, warnings, and exceptions, and displaying, within the first UI, a graphical representation for each of the errors, warnings, and exceptions in the row and/or column of the application data where the error, warning, or exception has occurred.

Abstract: Techniques are provided for performing sentiment analysis on words in a first data set. An example embodiment includes generating a word embedding model including a first plurality of features. A value indicating sentiment for the words in the first data set can be determined using a convolutional neural network (CNN). A second plurality of features are generated based on bigrams identified in the data set. The bigrams can be generated using a co-occurrence graph. The model is updated to include the second plurality of features, and sentiment analysis can be performed on a second data set using the updated model.

Abstract: Techniques are provided for limiting access to a feature in an application. Certain application features, such as access controlled features, are not generally accessible to all users of an integration cloud service system. When a user makes a request to access an access controlled feature, the system can determine whether user information satisfies the requirements to access a requested access controlled feature. If the user satisfies the requirements for the requested access controlled feature, an access key can be dynamically generated based on the user information.

Abstract: Methods and systems are disclosed for generating more random data or ensuring more random data than provided by single sources. Entropy is gathered among multiple random or pseudo-random sources at different frequencies. The entropy is pushed, pulled, or otherwise presented to a pseudo-random number generator when there is enough entropy. The determination of enough entropy can be through a modified Hamming distance. The frequencies of polling for entropy from the entropy sources can be jittered by a random amount.

Abstract: Systems, methods, and computer-readable mediums are presented that may provide for an interface to a relational database. A request may be received for data stored in a relationship database, wherein the request is received from a spreadsheet application. In response to the request for data stored in the relational database, a plurality of tables in the relational database may be accessed to retrieve the data indicated in the request. The retrieved data may be translated from the plurality of tables of the relational database into a format for output to the spreadsheet application. The translated data may be output to the spreadsheet application.

Abstract: A data approval system is provided. The system comprises a transaction model comprising program code for implementing one or more computer-implemented methods for use in an approval process, the approval process comprising an approval operation; a plurality of differentiated data-handling modules adapted to provide different methods for managing data during the approval process, wherein each module comprises program code for implementing one or more computer-implemented methods; and a storage device for storing configuration parameters that are configurable for a particular approval process; wherein the data approval system is adapted to select one or more data-handling modules from the plurality of modules to manage data during the approval process based on the configuration parameters.

Abstract: A system performs tunneling of real-time communications (“RTC”). The system establishes a tunnel between a tunneling client and a tunneling server. The system then receives a packet over the tunnel. The packet is configured according to an outer transport protocol of the tunnel and includes a datagram-based payload and a stream-based header. The system processes the packet according to a datagram-based outer transport protocol based on information in the stream-based header.

Abstract: Embodiments include systems and methods for improving link performance and tracking capability of a baud-rate clock data recovery (CDR) system using transition pattern detection. For example, a multi-level signal is received via a data channel and converted to a pseudo-NRZ signal. CDR early/late voting can be derived from the converted (baud-rate) pseudo-NRZ signal and from error signals from the received PAM4 signal, and the voting can be implemented with different phase error detector (PED) functional approaches. Different approaches can yield different CDR performance characteristics and can tend to favor different PAM4 transition patterns. Embodiments can identify jittery patterns for a particular CDR implementation and can add features to the CDR to filter out those patterns from being used for CDR early/late voting.

Abstract: Embodiments include systems and methods for implementing a multi-rate FIR by using rate-dependent bit stuffing on the cursor, while using rate-independent (e.g., full-rate) spacing on the pre- and post-cursor. For example, in the FIR data path, the cursor bit output is generated using bit stuffing, depending on a selected rate mode (e.g., full-rate, half-rate, quarter-rate, eighth-rate, etc.), but the spacing of the pre-cursor, cursor, and post-cursor are maintained at 1 UI apart (i.e., the full-rate spacing) for all rate modes. Such an approach can appreciably reduce complexity of the logic and can appreciably relieve the critical timing path.

Abstract: Techniques for asynchronous management of physical components are disclosed. A request to perform an operation in a tape library, including a physical task to be performed by a component, is received. Based on the request, a message handler is initialized. The message handler executes in an execution thread. State data associated with the component is retrieved from persistent storage. Using the state data, a code object representing the component is instantiated. Using the message handler and the code object, instructions are transmitted to the component to perform the physical task. A process, executing in a different execution thread, receives a message from the component indicating completion of the physical task. Based on the message, another message handler is initialized that updates persistent storage associated with the component.

Abstract: The present application present systems and methods for leveraging existing sources of information to supplement and enhance job opening postings and other types of business postings. A plurality of sources, including social network sites, talent profiles, and/or surveys and questionnaires are accessed in order to retrieve data relating to a business object. The retrieved data is transformed, such that it may be used to supplement job opening postings and other types of postings with job description data, work culture data, and other business-related data in order to build a social brand for the business.

Abstract: Systems and methods can use a testing framework for testing an event processing system. The testing framework operates to send a stream of input events for an event processing system, wherein each said input event is associated with a timestamp that is based on a system time, and wherein said event processing system processes the stream of input events in a batch mode with one or more sliding cycles. Furthermore, the testing framework can determine a base time for an event window in the system time, wherein said event window includes one or more input events in a sliding cycle that corresponds to a plurality of expected output events associated with a shared timestamp, and applies the event window on the stream of input events that are sent to the event processing system.

Abstract: Techniques for providing enrollment services for various types of electronic devices in a communication network is disclosed. The electronic devices may include devices associated with a user and headless devices not associated with any user. In certain embodiments, a device enrollment system is disclosed that controls the authentication and enrollment of both user devices and headless devices within a communication network. The device enrollment system detects a particular device within a communication, identifies a type of enrollment policy to be applied to the device based on a type of the device, applies a set of enrollment rules to the device in accordance with the enrollment policy and enrolls the device if the device satisfies one or more criteria specified by the enrollment rules.

Abstract: Snapshotting and instantiating a virtual topology are described. A virtual topology includes a set of virtual topology entities (VTEs), each associated with VTE characteristics. A snapshot engine traverses each VTE in a virtual topology instantiated on a physical topology. The snapshot engine stores the VTE characteristics of each traversed VTE in a virtual topology template. The virtual topology template may be used to deploy the same virtual topology onto another physical topology. Additionally or alternatively, a deployment engine receives a virtual topology template and/or user commands for instantiating a virtual topology. The deployment engine generates deployment commands based on the virtual topology template and/or user commands. The deployment engine identifies VTE characteristics of each VTE based on the deployment commands. The deployment engine instantiates each VTE onto a physical topology.

Abstract: Application customization enables many different types of customers, from small companies to large multinational enterprises, to use various applications provided by a cloud service provider. To accommodate these customizations, previous systems generally require manual human intervention to identify custom, customized, and cloud service provider authorization policies (also referred to herein as “seed” authorization policies) and to decide how each type of authorization policy should be upgraded. When applications are customized, artifacts that represent those customizations can be created. In some embodiments, the customizations can include new resources or entitlements, and grants to new roles. In addition to new resources, entitlements, and grants, existing resources, entitlements, and grants can be modified and artifacts corresponding to those modifications can be generated.

Abstract: In accordance with an embodiment, described herein is a system and method for generating messages guiding a user in creating an integration flow in a cloud-based integration service. The cloud-based integration service can include a web interface application for a current integration flow, and a runtime for executing the current integration flow. A plurality of complete integration flow definitions can be provided, each defining a plurality of integration components for a particular type of integration flow. The system can select a complete integration flow definition based on the type of the current integration flow, dynamically update the complete integration flow definition, and compare the current integration flow against the selected complete integration flow definition. Based on the comparison, the system can generate one or more messages for graphical display in the web interface application, to guide the user in creating the current integration flow.

Abstract: A serial form of a serializable exposed first module element of a module in a module system is analyzed. An unexposed and/or inaccessible second module element expressed in the serial form is identified as a potential error condition. A corrective execution is executed and/or a warning is presented.

Abstract: An optical source includes semiconductor optical amplifiers, with a semiconductor other than silicon, which provide an optical gain medium. Moreover, a photonic chip in the optical source, which is optically coupled to the semiconductor optical amplifiers, includes ring resonators that selectively pass corresponding optical signals having carrier wavelengths provided by the semiconductor optical amplifiers, where a given ring resonator and a reflector on one of the semiconductor optical amplifier defines an optical cavity, and the ring resonators have different radii with associated resonance wavelengths corresponding to the carrier wavelengths.

Abstract: System and Methods for non-uniform memory (NUMA) garbage collection are provided. Multiple memories and processors are categorized into local groups. A heap space is divided into multiple pools and stored in each of the memories. Garbage collection threads are assigned to each of the local groups. Garbage collection is performed using the garbage collection threads for objects contained in the pools using the garbage collector threads, memory, and processor assigned to each local group, minimizing remote memory accesses.

Abstract: In certain embodiments, a Service Deployment Infrastructure (SDI) request engine is disclosed. The SDI request engine performs the tracking, management and provisioning of services subscribed to by customers of the cloud infrastructure system. The SDI request engine is deployed to process large volumes of provisioning requests and deliver time critical applications for customers. The SDI request engine translates each request into a list of tasks of various sizes based on the requirement and configuration of the request. In some embodiments, the SDI request engine imposes control and management on both request and task levels in order to execute, rollback, retry or fail a task automatically and accurately.

Abstract: Herein is described a data-parallel algorithm for topic modeling on a distributed system in which memory and communication bandwidth requirements are streamlined for distributed implementation. According to embodiments, a distributed LDA Gibbs sampling algorithm shares approximate counter values amongst the nodes of a distributed system. These approximate counter values are repeatedly aggregated and then shared again to perform the distributed LDA Gibbs sampling. In order to maintain the shared counter values as approximate counter values of sixteen bits or less, approximate counter values are summed to produce aggregate approximate counter values. These small aggregate approximate counter values are shared between the nodes of the distributed system. As such, the addition of various types of approximate counters is described herein.

Abstract: A process that executes client software in a computer, hereinafter client process, starts execution of at least a portion of server software, hereinafter listener. The client process retrieves from the listener, an identifier of a port in the computer, at which the listener waits to receive one or more messages, which may contain commands. The client process connects to a server process in another computer and sends only to the server process, at least a command and client information that includes at least the port identifier of its listener. Any remote computer(s) that may receive and execute the command, use the client information to send back information related to the command, directly to the port identifier of the listener started by the client process. Any messages received at the listener's port identifier are processed, e.g. by displaying any output generated in execution of the command by the remote computer(s).

Abstract: Methods, devices, and systems are described to modify the life cycle of a Google Android® application, in its application manifest file and byte code, such that the execution of the application can be controlled via policies and security governed by a workspace application installed on an Android-based device. Dummy wrapper classes are inserted into the byte code for network and I/O system calls that call security code before calling the original classes.

Abstract: Techniques for executing multiple Virtual Private Network (VPN) endpoints associated with an Endpoint Pool Address are disclosed. A VPN endpoint manager determines traffic attributes of traffic addressed to the Endpoint Pool Address. The VPN endpoint manager selects a quantity of VPN endpoints to be executed for processing the traffic based on the traffic attributes. The VPN endpoint manager causes execution of a plurality of VPN endpoints corresponding to the selected quantity. The VPN endpoint manager selects one VPN endpoint, from the VPN endpoint pool, to process each data packet addressed to the Endpoint Pool Address. The VPN endpoint manager may select different VPN endpoints to process data packets of different VPN sessions. The VPN endpoint manager may transfer a VPN session from one VPN endpoint to another VPN endpoint. The VPN endpoints in the VPN endpoint pool operate concurrently to process data packets addressed to the Endpoint Pool Address.

Abstract: Operations include addressing a component error. An error management system obtains a vendor-specific error code from a hardware storage expander. The vendor-specific error code corresponds to an error state of a hardware component. Based on a mapping between a vendor-specific error code and a common error code, the system converts the vendor-specific error code to a common error code. Next, the system executes a diagnostic process for determining an operation for handling any errors corresponding to the common error code. Based on the operation determined by the diagnostic process, the system determines a vendor-specific instruction code. The system transmits the vendor-specific instruction code to the hardware storage expander for addressing the error state of the hardware component of the hardware storage expander.

Abstract: Operations include determining whether to cache resources accessed by a query based on the execution time of the query. The system identifies a set of executions of a same query. The system determines a cumulative execution time for the set of executions of the same query. If the cumulative execution time exceeds a threshold value, then the system caches a resource used for execution of the query.

Abstract: We disclose a system that optimizes deployment of sensors in a computer system. During operation, the system generates a training data set by gathering a set of n signals from n sensors in the computer system during operation of the computer system. Next, the system uses an inferential model to replace one or more signals in the set of n signals with corresponding virtual signals, wherein the virtual signals are computed based on cross-correlations with unreplaced remaining signals in the set of n signals. Finally, the system generates a design for an optimized version of the computer system, which includes sensors for the remaining signals, but does not include sensors for the replaced signals. During operation, the optimized version of the computer system: computes the virtual signals from the remaining signals; and uses the virtual signals and the remaining signals while performing prognostic pattern-recognition operations to detect incipient anomalies that arise during execution.

Abstract: Operations include estimating, in real time, a runtime of a query. The query optimization system receives set of query definitions for defining a target query. The system uses the set of query definition elements to determine an estimated runtime for the target query. If the estimated runtime exceeds some acceptable threshold value, then the system determines a modification to the set of query definition elements. The system uses the modification to generate a modified query, corresponding to a lower estimated runtime.

Abstract: The present disclosure relates to exporting local applications to cloud systems and provisioning the exported application on the cloud systems. Additionally, templates can be generated for the provisioned application, and each template can be individually customized and deployed to a destination as an application environment with a defined topology. Rapidly and dynamically generating deployable templates of provisioned applications enables cloud-based distributed versioning of the applications.

Abstract: Techniques are described herein for automatic generation of multi-source breadth-first search (MS-BFS) from high-level graph processing language. In an embodiment, a method involves a computer analyzing original software instructions. The original software instructions are configured to perform multiple breadth-first searches to determine a particular result. Each breadth-first search originates at each of a subset of vertices of a graph. Each breadth-first search is encoded for independent execution. Based on the analyzing, the computer generates transformed software instructions configured to perform a MS-BFS to determine the particular result. Each of the subset of vertices is a source of the MS-BFS. In an embodiment, parallel execution of the MS-BFS is regulated with batches of vertices. In an embodiment, the original software instructions are expressed in Green-Marl graph analysis language.

Abstract: A system and method can support application interoperation in a transactional middleware environment. A first transaction server operates to initiate a global transaction, wherein the first transaction server that is associated with a first format identifier (ID), and wherein the global transaction includes a plurality of branches and each said branch is associated with an individual branch qualifier. Furthermore, the first transaction server can direct at least one branch of the global transaction from the first transaction server to a second transactional server, wherein each said transactional server is associated with a second format identifier (ID), and configure a plurality of branches in the global transaction to share a common format identifier (ID).

Abstract: Techniques are disclosed for dynamically switching user identity when generating a web service request by receiving, at a client application, an invocation of a web service, the invocation associated with a first authenticated user identity of a first user, identifying a second user identity, verifying that a switch from the first user identity to the second user identity is permitted by switching rules, including the second user identity in a service request when the switch is permitted, and communicating the service request to the web service. The switching rules can include associations between initial user identities and permitted user identities. Verifying that a switch is permitted can include searching the associations for an entry having an initial user identity that matches the first authenticated user identity and a new user identity that matches the second user identity, wherein the switch is permitted when the entry is found.

Abstract: An adaptive contention-aware thread scheduler may place software threads for pairs of applications on the same socket of a multi-socket machine for execution in parallel. Initial placements may be based on profile data that characterizes the machine and its behavior when multiple applications execute on the same socket. The profile data may be collected during execution of other applications. It may identify performance counters within the cores of the processor sockets whose values are suitable for predicting whether the performance of a pair of applications will suffer when executed together on the same socket (e.g., values indicative of their demands for particular shared resources). During execution, the scheduler may examine the performance counters (or performance metrics derived therefrom) and determine different placement decisions (e.g., placing an application with high demand for resources of one type together with an application with low demand for those resources).

Abstract: A method, apparatus, and stored instructions are provided for transforming an initial query by eliminating a subquery nested within the initial query. The initial query may include an outer query that references a first instance of a particular data object. The initial query may also include set operator(s). At least a particular set operator may include a particular subquery that references a different instance of the particular data object. A query processor may transform the initial query to a transformed query that excludes the particular set operator and the particular subquery. The transformed query may instead include an added predicate that is based at least in part on the particular subquery. The added predicate may reference the first instance of the particular data object without referencing the different instance of the particular data object. The transformed query may be used for query execution instead of the initial query.

Abstract: An embodiment includes a first feedback tap, a second feedback tap, and a summation circuit. The summation circuit may include a first load and a second load coupled to each other at an internal circuit node, and coupled in series between a power supply node and an output node. The summation circuit may be configured to receive, via a serial communication link, an input signal indicative of a series of data symbols, and to generate an output voltage level on the output node based upon a current data symbol. The first feedback tap, coupled to the output node, may be configured to sink a first current from the output node based upon a first previously received data symbol. The second feedback tap, coupled to an intermediate circuit node, may be configured to sink a second current from the intermediate circuit node based upon a second previously received data symbol.

Abstract: A system and method which supports a low contention queue in a multithreaded processing environment such as a distributed data grid. The queue is optimized to reduce memory contention and queue processing overhead, and is lock-free. The queue includes a doubly-linked list of nodes, wherein each node is associated with a value, a reference to a next node and a reference to a previous node. Furthermore, the queue allows one or more consumer threads to access the queue via a reference to a last removed node from the doubly linked list, and allows one or more producer threads to insert a new node via a reference to a tail node in the doubly-linked list. The low queue efficiently serves large number of threads with reduced contention, overhead, and latency, thereby improving performance in a multithreaded processing environment such as a distributed data grid.

Abstract: A method of handling event subscriptions and notifications may include receiving a request from a client system to subscribe to an event type, and receiving a template from the client system. The template may define data that should be returned to the client system when an event of the event type occurs. In response to the event of the event type occurring, the method may also include packaging data associated with the event according to the template received from the client system to generate an event notification. The method may further include sending the event notification to the client system.

Abstract: Systems, devices, and methods of the present invention calculate a rhetorical relationship between one or more sentences. In an example, a computer-implemented method accesses a sentence comprising a plurality of fragments. At least one fragment includes a verb and a words. Each word includes a role of the words within the fragment. Each fragment is an elementary discourse unit. The method generates a discourse tree that represents rhetorical relationships between the sentence fragments. The discourse tree includes nodes including nonterminal and terminal nodes, each nonterminal node representing a rhetorical relationship between two of the sentence fragments, and each terminal node of the nodes of the discourse tree is associated with one of the sentence fragments. The method matches each fragment that has a verb to a verb signature, thereby creating communicative discourse tree.

Abstract: Methods and systems for creating a compact tree node representation of an XML document. One implementation commences by allocating memory for storing an XML tree index data structure, then allocating another separate portion of memory to store a hash table. Then, traversing an XML document to process the traversed nodes as follows: (a) when the traversed node is an element node, then adding the element node to the XML tree index data structure (b) when the traversed node is a text node, then populating a text node index into the XML tree index data structure and copying the text node values to the hash table, and (c) when the traversed node is an attribute node, then populating an attribute node index into the XML tree index data structure. Such a structure supports fast index-based tree restructuring, and permits very large XML document to be accessed within tight memory size constraints.

Abstract: The disclosed embodiments relate to the design of an integer division circuit, which comprises: a dividend-input that receives an integer dividend A; a divisor-input that receives an integer divisor B; a quotient-output that outputs an integer quotient q; and a division engine that executes the Goldschmidt method to divide A by B to produce q. During a pre-processing operation, which commences executing before the Goldschmidt method starts executing, the division engine determines whether A<B. If A<B, the division engine sets q=0 without having to execute the Goldschmidt method.

Abstract: Techniques for performing garbage collection on an object array using array chunk references is described. A garbage collector (GC) thread identifies an object array to be processed. The GC thread divides the object array into array chunks. The GC thread generates array chunk references corresponding respectively to the array chunks. Each array chunk reference comprises: (a) chunk start bits representing a memory address of a start of a corresponding array chunk, and (b) chunk length bits representing a chunk length of the corresponding array chunk. The GC thread pushes the array chunk references onto the processing stack. A single processing stack concurrently stores multiple array chunk references, associated with a same object array. One or more of the array chunk references, that are associated with the same object array and stored on the processing stack, may be distributed to other GC threads for processing.

Abstract: A query optimization system is described that, at runtime, optimizes the execution pipeline generated for a query. Based upon communications between nodes in the execution pipeline, the execution pipeline generated for a query is optimized by modifying the execution pipeline to create a modified execution pipeline. The modified execution pipeline is then executed to execute the query and results obtained for the query. The changes or modifications made to an execution pipeline may include changing the capabilities (e.g., changes to inputs and/or outputs of a node, changing the task(s) or function(s) performed by the node) of one or more nodes within the execution pipeline. The changes may include changing the position of one or more nodes within a directed acyclic graph representing the execution pipeline.

Abstract: Systems, devices, and methods of the present invention calculate a rhetorical relationship between one or more sentences. In an example, a computer-implemented method accesses a sentence comprising a plurality of fragments. At least one fragment includes a verb and a words. Each word includes a role of the words within the fragment. Each fragment is an elementary discourse unit. The method generates a discourse tree that represents rhetorical relationships between the sentence fragments. The discourse tree includes nodes including nonterminal and terminal nodes, each nonterminal node representing a rhetorical relationship between two of the sentence fragments, and each terminal node of the nodes of the discourse tree is associated with one of the sentence fragments. The method matches each fragment that has a verb to a verb signature, thereby creating communicative discourse tree.

Abstract: The present disclosure relates to synchronizing entity identifiers across multiple data centers. In some embodiments, an entity identifier translation server may be deployed within a cloud-based distributed environment. The entity identifier translation server may receive data from multiple different data centers and detect changes/updates to entity identifiers within the data centers. In response to detected changes, the entity identifier translation server may identify one or more corresponding entity identifiers within the other data centers. For each of the corresponding entity identifiers within the other data centers, the entity identifier translation server may determine whether or not the corresponding entity identifier is to be synchronized with the newly-changed entity identifier in the first data center, and if so, may initiate synchronization processes.

Abstract: The present disclosure generally relates to storing, processing, and classification of content resources, such as documents, web-based resources, and other content. More particularly, the present disclosure describes techniques for distributed storage of network session data in hierarchical data structures stored on multiple servers and/or physical storage devices, and techniques for analyzing and classifying the distributed hierarchical structures. Such techniques may include executing different machine-learning algorithms on different servers and/or different storage devices, and generating node mapping data between a plurality of different hierarchical structures and a top-level derivative hierarchy that references the underlying hierarchical structures in order to access and manage the different distributed taxonomies within the underlying hierarchical structures.

Abstract: In certain embodiments, a Service Deployment Infrastructure (SDI) request engine is disclosed. The SDI request engine can perform tracking, management and provisioning of services subscribed to by users of a computer infrastructure system. The SDI request engine can be deployed to process large volumes of provisioning requests and deliver time critical applications for customers. The SDI request engine can translate each request into a list of tasks of various sizes based on the requirement and configuration of the request, and store each task in a queue. In certain embodiments, the SDI request engine may evaluate a dynamic weight associated with each task to prioritize the processing of tasks, which may improve the overall throughput of request processing.

Abstract: Methodologies and systems are described herein whereby the electrical performance of a device may be tested. In one or more embodiments, a system for testing the electrical performance comprises a monitoring device configured to perform a set of operations including concurrently monitoring at least three different test points of a device under test (DUT) and aggregating test data comprising signal information collected concurrently from at least three different test points of the DUT. In one or more embodiments, the system is configured to monitor at least three channels wherein at least one channel corresponds to a frequency range of less than 300 kHz and the phases of signals on at least three channels are different.