Abstract: In one embodiment, an additive manufacturing system includes a dispensing nozzle configured to dispense material to be used to manufacture a component, a barrel to which the nozzle is mounted, the barrel being configured to deliver the material to the dispensing nozzle, a barrel heater that surrounds the barrel, the barrel heater including a heating element configured to heat the barrel heater, the nozzle, and the material contained within the nozzle before it is dispensed from the nozzle, and a supplemental heater configured to heat previously deposited material so as to increase bonding and merging of the material that is being dispensed with the previously deposited material.

Abstract: Broadcasts of a probe request are detected from a wireless station with the MAC address for an unauthorized access point in order to begin association between the wireless station and the unauthorized access point. Responsive to the probe request detection, a spoofed probe response is transmitted including a MAC address of the unauthorized access point to the station to appear as if sent by the unauthorized access point. The probe response includes a NAV element and the MAC address of the unauthorized access point, the NAV element set at a value high enough to prevent the station from transmitting to the unauthorized access point during a period.

Abstract: Systems and methods include creating a graph of a network having i) vertices representing ports, and ii) edges representing possible connections between vertices; receiving a request for one or more paths in the network; traversing the graph to determine the one or more paths; responsive to encountering a non-local constraint in the graph, adding a traversal state based thereon; and responsive to satisfying the non-local constraint in the graph, removing the traversal state based thereon.

Abstract: Systems and methods for constrained path computation in networks with connectivity and resource availability rules build the necessary constraints directly into the routing graph so that all paths found are by construction satisfying of all the constraints. This is in contrast to the conventional approach of finding multiple paths and then applying the constraints. The present disclosure efficiently addresses the necessary constraints in the routing graph. Path Computation Engine (PCE) performance in terms of time to return acceptable paths to the user generically degrades as network scale (typically expressed through length and number of paths) increases. The present disclosure keeps the input graph small even though the graphs have expanded functionality to address constraints.

Abstract: Broadcasts of a probe request are detected from a wireless station with the MAC address for an unauthorized access point in order to begin association between the wireless station and the unauthorized access point. Responsive to the probe request detection, a spoofed probe response is transmitted including a MAC address of the unauthorized access point to the station to appear as if sent by the unauthorized access point. The probe response includes a NAV element and the MAC address of the unauthorized access point, the NAV element set at a value high enough to prevent the station from transmitting to the unauthorized access point during a period.

Abstract: Systems and methods include receiving a request for a path from a source node to a destination node in a network with the request including N unordered inclusion nodes, N?1; adding a virtual vertex in a graph with edges connected to each of the N inclusion nodes, wherein the graph includes the virtual vertex, vertices representing nodes in the network, and edges representing links; determining a shortest path from the source node to the virtual vertex and removing an edge from a first inclusion node, that is on the shortest path, from the virtual vertex; if N>1, determining a shortest path N times to find path segments between the N inclusion nodes, removing an edge from each of the N inclusion nodes from the virtual vertex when on a corresponding shortest path; and determining a shortest path from a last inclusion node to the destination node.

Abstract: A system includes one or more client instances of a client hosted by a platform, in which the one or more client instances include an agent portal. The agent portal may receive a request from a customer related to a customer issue, determine a context for the customer issue based on one or more attributes, and determine a subset of actions as recommended actions based on factors to resolve the customer issue. The factors may include the context, historical data associated with the customer, and/or a client interest associated with the client. Moreover, the agent portal may rank the recommended actions as ranked recommended actions, display the ranked recommended actions for selection by the agent, and provide a guidance corresponding to a selected recommended action.

Abstract: Systems and methods include, responsive to defining a routing graph that includes vertices for each node of a plurality of nodes in a network and edges for links interconnecting the plurality of nodes, receiving a request for k shortest paths, where k is an integer>0, between a source node and a destination node of the plurality of nodes; and determining the k shortest paths utilizing a k-shortest path algorithm that utilizes two threads in parallel for each shortest path query, wherein the two threads include i) a shortest path query from the source node to the destination node and ii) a shortest path query from the destination node to the source node. The determining further includes, responsive to a first thread in each shortest path query obtaining a result, utilizing the result from the first thread and terminating a second thread.

Abstract: High performance and scalable multi-layer topology discovery systems and methods provide awareness of what services are present across a multi-layer network. The present disclosure achieves a high level of performance in service discovery, and, in addition, provides a form of scalability in proportion to network size by distributing service observation across servers in a cluster. The present disclosure defines a concept of change-proportional online run-time efficiency and thus provides an optimal design. Further, the present disclosure achieves horizontal scale, leveraging multiple cores across multiple servers.

Abstract: Disclosed herein is a system comprising a) a nozzle comprising an aperture configured to dispense a material to form a material layer on a build plate, and b) one or more members positioned in a spatial configuration along the x and z-axis relative to the nozzle such that the one or more members are configured to apply a compression load on the layer of the material and to form a manufactured part having a reduced void fraction.

Abstract: Methods, systems, and apparatus, including an apparatus for using probabilistic techniques to provide reformatted versions of digital components. In one aspect, a process includes obtaining data specifying a distribution parameter limit for a given reformattable digital component that is eligible for reformatting using a set of digital component extensions. For each of multiple digital component requests, a determination is made that a given digital component extension has an additional selection requirement that, when combined with a base selection requirement for the given reformattable digital component, would exceed the distribution parameter limit.

Abstract: Systems and methods for constrained path computation in networks with connectivity and resource availability rules build the necessary constraints directly into the routing graph so that all paths found are by construction satisfying of all the constraints. This is in contrast to the conventional approach of finding multiple paths and then applying the constraints. The present disclosure efficiently addresses the necessary constraints in the routing graph. Path Computation Engine (PCE) performance in terms of time to return acceptable paths to the user generically degrades as network scale (typically expressed through length and number of paths) increases. The present disclosure keeps the input graph small even though the graphs have expanded functionality to address constraints.

Abstract: A computational instance of a remote network management platform may be dedicated to a managed network. The computational instance may include persistent storage that contains: (i) mappings between end-user networks, services available to the end-user networks, and allocation identifiers, (ii) mappings between end-user networks, computing resources allocated to the end-user networks, and resource identifiers, and (iii) mappings between the respective allocation identifiers and the respective resource identifiers.

Abstract: A distributed software defined network (SDN) packet core system is configured to support a plurality of radio access technologies. The distributed SDN packet core system can include a cloud-based SDN centralized infrastructure instance and a plurality of local SDN infrastructure instances distributed in proximity to wireless access networks and radio access points thereof. The cloud-based centralized SDN infrastructure instance can be configured to handle network operations that are not latency sensitive. Each local SDN infrastructure instance can include a plurality of computer devices configured to execute a plurality of RAT specific control-plane modules and a plurality of RAT independent packet processing modules for performing latency sensitive network operations.

Abstract: High performance and scalable multi-layer topology discovery systems and methods provide awareness of what services are present across a multi-layer network. The present disclosure achieves a high level of performance in service discovery, and, in addition, provides a form of scalability in proportion to network size by distributing service observation across servers in a cluster. The present disclosure defines a concept of change-proportional online run-time efficiency and thus provides an optimal design. Further, the present disclosure achieves horizontal scale, leveraging multiple cores across multiple servers.

Abstract: A distributed software defined network (SDN) packet core system includes a plurality of interconnected local mobility domains (LMDs). Each LMD includes a plurality of radio access technology (RAT) specific front-end modules associated with at least one RAT and a mobility manager. Each RAT-specific front-end module is configured to handle intra-RAT and intra-LMD mobility events that involve switching connectivity of client devices between two radio access points coupled to the LMD and associated with a first common RAT that is also associated with that RAT-specific front-end module. The mobility manager is coupled to the front-end modules and is configured to handle intra-RAT and inter-LMD mobility events. The mobility manager can also be configured to handle inter-RAT and intra-LMD mobility events if the SDN packet core system supports more than one RAT.

Abstract: Embodiments of the present invention provide systems, methods, and computer storage media directed to facilitate identification of security policies for documents. In one embodiment, content features are identified from a set of documents having assigned security policies. The content features and corresponding security policies are analyzed to generate a security policy prediction model. Such a security policy prediction model can then be used to identify a security policy relevant to a document.

Abstract: A computational instance of a remote network management platform may be dedicated to a managed network. The computational instance may include persistent storage that contains: (i) mappings between end-user networks, services available to the end-user networks, and allocation identifiers, (ii) mappings between end-user networks, computing resources allocated to the end-user networks, and resource identifiers, and (iii) mappings between the respective allocation identifiers and the respective resource identifiers.

Abstract: Methods, systems, and apparatus, including an apparatus for using probabilistic techniques to provide reformatted versions of digital components. In one aspect, a process includes obtaining data specifying a distribution parameter limit for a given reformattable digital component that is eligible for reformatting using a set of digital component extensions. For each of multiple digital component requests, a determination is made that a given digital component extension has an additional selection requirement that, when combined with a base selection requirement for the given reformattable digital component, would exceed the distribution parameter limit.

Abstract: In one embodiment, an additive manufacturing system includes a dispensing nozzle configured to dispense material to be used to manufacture a component, a barrel to which the nozzle is mounted, the barrel being configured to deliver the material to the dispensing nozzle, a barrel heater that surrounds the barrel, the barrel heater including a heating element configured to heat the barrel heater, the nozzle, and the material contained within the nozzle before it is dispensed from the nozzle, and a supplemental heater configured to heat previously deposited material so as to increase bonding and merging of the material that is being dispensed with the previously deposited material.