Abstract: Disclosed is a system for positioning fiber and electronics cables within a server room, which includes a wire-pulley system which includes a wire operably coupled to a first pulley wheel and a second pulley wheel. The wire is looped around the first and second pulley wheel such that a point in the wire is laterally movable between the first and second pulley wheels when the first and second pulley wheels are rotated. The system for positioning cables includes a cable carrier which is removably coupled to the point in the wire. The cable carrier includes a first panel, and a second panel hingedly coupled to the first panel. The first panel and second panel each include a plurality of receiving slots, where the receiving slots are configured to removably receive a distal end of various cables.

Abstract: Systems, devices, and methods of the present invention involve discourse trees. In an example, a method involves generating a discourse tree. The method includes identifying, from the discourse tree, a central entity that is associated with a rhetorical relation of type elaboration and corresponds to a topic node that identifies a central entity of the text. The method includes determining a subset of elementary discourse units of the discourse tree that are associated with the central entity. The method includes forming generalized phrases from the subset of elementary discourse units. The method includes forming tuples from the generalized phrases, where a tuple is an ordered set of words in normal form. The method involves responsive to successfully converting an elementary discourse unit associated with an identified tuple into a logical representation, updating the ontology with an entity from the identified tuple.

Abstract: Embodiments relate to improving efficiency of data analytics performed on sets of entity data in which different entity properties having very different update frequencies. Time-based analytical queries track the entity states at each moment within a given time window. Analytical queries are executed over a massive number of entity states while using a reasonable memory footprint. The technique partitions the entity properties into partial historical snapshots of data and combines the partial snapshots on demand only as needed to execute analytical queries over business entities. A complete entity state having values for all entity properties is not required to execute most queries. Only partial snapshots including values referenced by the query need to be combined to satisfy the query. Using partial snapshots minimizes data replication, and the snapshots can be efficiently combined into entity states sufficient for query execution.

Abstract: A method for updating software in one or more servers in a managed system includes bootstrapping of shared secrets to secure communication, using an object store with publicly accessible URLs as a mailbox system between a patch agent locally at the managed system and a patch management server located remotely. The object store provides for indirect and asynchronous communication, allowing the patch management server to manage the updates, whereas the patch agent executes the updates. The patch management server keeps track of update results, and when an update is unsuccessful it performs and supports a remediation process. Both the patch agent and the patch management server keep full logs of the update results to allow for auditing.

Abstract: A computing device may receive a plurality of scanning requests with at least one scanning request in the plurality identifying a target address of a target network. The computing device may for at least a subset of the plurality of scanning requests: generate a scanner instance and a virtual network interface card (VNIC) in response to the scanning request. The scanner instance and the VNIC communicating with a routing namespace that can communicate with two or more scanner instances simultaneously. Until the target address has been scanned: one or more packets can be sent from the scanner instance to the target address via the routing namespace and VNIC. The one or more packets can be wrapped in one or more packet wrappers identifying the target address and the target network. In response to the target address being scanned, the scanner instance and VNIC can be decommissioned.

Abstract: Techniques are described herein for routing queries to particular nodes of a multi-node database system based on the query. A database table is partitioned into a plurality of affinity groups. Each affinity group is assigned a particular node as the master node of the affinity group. A mapping is sent to a query router indicating the master node for each affinity group of the plurality of affinity groups. The query router determines, for a particular query, a target node to which to send the particular query based on the mapping and the particular query.

Abstract: An example system and method for selectively conveying content via User Interface (UI) display screen sections of Business Intelligence (BI) software and for facilitating user interaction therewith, e.g., so as to impart usefulness or preference ratings thereto, which can then affect subsequently displayed content. An example method includes providing one or more UI controls enabling a user to provide an input query and to interact with resulting content (i.e., query results, also called search results), where the user interaction with the content provides information (e.g., context information) indicative of a usefulness or preference rating pertaining to the content; thereby enabling modifications to subsequently retrieved content in accordance with the usefulness or preference rating(s). Such rating(s) may be aggregated from plural users of an associated software application.

Abstract: Techniques discussed herein relate to provisioning one or more virtual cloud-computing edge devices at a physical cloud-computing edge device. A manifest may be generated/utilized to specify various attributes of the virtual cloud-computing edge devices to be executed at a physical cloud-computing edge device. A first set of resources corresponding to a first virtual cloud-computing edge device may be obtained from memory of a centralized cloud-environment and provisioned at the first virtual cloud-computing edge device. Similar operations may be performed with respect to a second virtual cloud-computing edge device. The techniques described herein split the physical edge device into multiple virtual device resources that can be utilized in combination or separately to extend the functionality and versatility of the physical edge device.

Abstract: Disclosed is an approach to implement a multi-tenant DNS resolver for secure communications for a virtual cloud environment. The approach can perform split-horizon DNS forwarding via an intermediate customized DNS server.

Abstract: The present disclosure generally relates to systems and methods for operation research optimization. The systems and methods include receiving, at a data processing system, a payload including a request for optimizing a service and processing the payload using a meta learning classifier. The processing includes extracting a problem and use case characteristics from the payload, predicting at least one machine learning model capable of solving the problem having the use case characteristics, and executing the at least one machine learning model to solve the problem. The systems and methods also include outputting a solution to the problem for optimizing the service from the at least one machine learning model, and providing the solution to a computing device.

Abstract: Techniques for cache invalidation across distributed microservices are disclosed, including: monitoring, by a resource manager, a resource that is available for obtaining by a set of one or more resource utilizers, wherein a resource utilizer in the set of one or more resource utilizers obtains a version of the resource; publishing, by the resource manager, a notification stream including notifications associated with the resource, wherein the resource utilizer subscribes to the notification stream including the notifications associated with the resource; detecting, by the resource manager, a modification of the resource; responsive to detecting the modification of the resource: publishing a notification to the notification stream that indicates the modification to the resource.

Abstract: Embodiments decrypt or partially decrypt an encoded message or a private key, the encoded message or private key encoded by a public-key cryptography algorithm. Embodiments encode the public-key cryptography algorithm using a language of a program synthesizer and construct a grammar for the program synthesizer. Embodiments train the program synthesizer with training data comprising input-output pairs and execute the trained program synthesizer to generate a mathematical formula. Embodiments validate the generated mathematical formula and then perform the decrypting using the trained and validated program synthesizer.

Abstract: A method may include determining that a non-constant value of a variable corresponding to a variable node of the abstract syntax tree flows into an operator node in the abstract syntax tree. The method may further include adding, to the abstract syntax tree, a check taint node including functionality to: make a taint status determination that the non-constant value is tainted, and return the non-constant value to the operator node. The operator node generates a result value by executing an operator using the non-constant value. The method may further include adding, to the abstract syntax tree, a set taint node that stores, based on the taint status determination, the result value in a second tainted object, and performing, using the abstract syntax tree, a taint analysis of the source code to identify a vulnerability in the source code.

Abstract: Techniques are disclosed for automatic scene detection and character extraction. In one example, audiovisual content with video frames, an audio recording, and timing information is received. A score, based on the frame's visual characteristics, is determined for a first frame and subsequent frames. The first frame's score and subsequent frame's scores are compared to determine if the difference between the scores is above a threshold. When the difference in scores is above a threshold, the subsequent frame is classified as a new scene. The audiovisual content is segmented into scenes and textual characters are identified in at least one frame from each scene. The characters are stored and indexed in a searchable database with the timing information for the scene where the characters were identified. The audio recording is transcribed and the transcribed words are stored and indexed in the searchable database with timing information.

Abstract: Systems and methods for providing multicast group (MCG) membership relative to partition membership in a high performance computing environment. In allowing a subnet manager of a local subnet to be instructed that all ports that are members of the relevant partition should be set up as members for a specific multicast group, the SM can perform a more efficient multicast-routing process. It is also possible to limit the IB client interaction with subnet administration conventionally required to handle join and leave operations. Additionally, subnet manager overhead can be reduced by creating a spanning tree for the routing of multicast packets that includes each of the partition members added to the multicast group, instead of creating a spanning tree after each multicast group join request is received, as conventionally required.

Abstract: Techniques are disclosed for summarizing, diagnosing, and correcting the cause of anomalous behavior in computing systems. In some embodiments, a system identifies a plurality of time series that track different metrics over time for a set of one or more computing resources. The system detects a first set of anomalies in a first time series that tracks a first metric and assigns a different respective range of time to each anomaly. The system determines whether the respective range of time assigned to an anomaly overlaps with timestamps or ranges of time associated with anomalies from one or more other time series. The system generates at least one cluster that groups metrics based on how many anomalies have respective ranges of time and/or timestamps that overlap. The system may preform, based on the cluster, one or more automated actions for diagnosing or correcting a cause of anomalous behavior.

Abstract: A method for optimized routing of service based interface (SBI) request messages to remote network function (NF) repository functions (NRFs) using indirect communications via a service communication proxy (SCP) includes, at an SCP including at least one processor, receiving an SBI request message. The method further includes forwarding the SBI request message to a remote NRF. The method further includes determining that the remote NRF is unable to process the SBI request message, and, in response to determining that the remote NRF is unable, identifying a georedundant mate of the remote NRF. The method further includes forwarding the SBI request message to the georedundant mate NRF of the remote NRF that is unable to process the SBI request message.

Abstract: Techniques are disclosed for efficient generation and maintenance of interface components in an infrastructure-as-a-service (IaaS) environment. A system may receive a request to display a dashboard of components. A declarative metadata set of components is generated and a multi-use agent to parse the declarative metadata set. The multi-use agent may be replicated according to the parsed declarative definition in order to create multiple instances of the multi-use agent corresponding to the one or more determined interface components. The multiple instances of the multi-use agent may then generate and maintain the interface components in real-time. Component generation may be distributed among systems to prevent excessive data transfers and wasteful communications.

Abstract: Unsorted sparse dictionary encodings are transformed into unsorted-dense or sorted-dense dictionary encodings. Sparse domain codes have large gaps between codes that are adjacent in order. Unlike spare codes, dense codes have smaller gaps between adjacent codes; consecutive codes are dense codes that have no gaps between adjacent codes. The techniques described herein are relational approaches that may be used to generate sparse composite codes and sorted codes.

Abstract: Techniques for managing network-accessible infrastructure metadata are provided. A method includes receiving a resource request comprising resource metadata corresponding to a network-accessible infrastructure resource, determining whether to commit the resource request based at least in part on a constraint associated with the network-accessible infrastructure resource, and, in accordance with a determination to commit the resource request: generating, by the computer system, a resource identifier describing resource metadata in accordance with the resource request, storing, by the computer system, the resource metadata in a data store in communication with the computer system, receiving, by the computer system, a data request to provide the resource metadata described by the resource identifier, and providing, by the computer system, the resource metadata described by the resource identifier in accordance with the data request.