Abstract: A method, network system and computer storage medium for DDoS defence in a packet-switched network are provided. The method is performed by a network system and includes: measuring a plurality of network parameters in incoming network traffic; ranking the plurality of measured network parameters based on machine learning; measuring a subset of the plurality of network parameters in incoming network traffic; determining an incoming network packet to be part of a DDoS attack or not by machine learning of the subset of the plurality of network parameters; and blocking an incoming network packet when the incoming network packet is determined to be part of a DDoS attack.

Abstract: Methods, non-transitory machine-readable media, and computing devices for transitioning tasks and interrupt service routines are provided. An example method includes processing, by a plurality of processor cores of a storage controller, tasks and interrupt service routines. A performance statistic is determined corresponding to the plurality of processor cores. Based on detecting that the performance statistic passes a threshold, a number of the plurality of processor cores that are assigned to the tasks and the interrupt service routines are reduced.

Abstract: A method for managing computation load of a fog node is disclosed, wherein a computation capacity of the fog node is predicted to become unavailable to a fog network. The method comprises identifying a candidate set of nodes for computational load transfer from the fog node. The method further comprises obtaining a computation graph representing computation in the fog network, and using a learning model to identify a morphism from the obtained computation graph to a new computation graph, in which the fog node is not included. The identified morphism comprises a sequence of one or more morphing operations that replaces the fog node in the obtained computation graph with a topology of one or more nodes selected from the candidate set. The method further comprises causing computation performed at the fog node to be transferred to one or more nodes of the candidate set.

Abstract: Methods, non-transitory machine-readable media, and computing devices for transitioning tasks and interrupt service routines are provided. An example method includes processing, by a plurality of processor cores of a storage controller, tasks and interrupt service routines. A performance statistic is determined corresponding to the plurality of processor cores. Based on detecting that the performance statistic passes a threshold, a number of the plurality of processor cores that are assigned to the tasks and the interrupt service routines are reduced.

Abstract: A system and method is disclosed for root cause analysis and early warning of inventory problems. The system includes a server coupled with a database and configured to access the data describing inventory policy parameters of a supply chain network, the data describing one or more demand patterns and one or more replenishment patterns of the supply chain network, and the data describing the supply chain network comprising a plurality of entities, each entity configured to supply one or more items to satisfy a demand. The server is further configured to optimize the inventory policy parameters for each of the one or more items according to the one or more demand patterns and the one or more replenishment patterns and store the optimized inventory policy parameters in the database for each of the one or more items.

Abstract: A system for dynamically configuring and scheduling input/output (I/O) workloads among processing cores is disclosed. Resources for an application that are related to each other and/or not multicore safe are grouped together into work nodes. When these need to be executed, the work nodes are added to a global queue that is accessible by all of the processing cores. Any processing core that becomes available can pull and process the next available work node through to completion, so that the work associated with that work node software object is all completed by the same core, without requiring additional protections for resources that are not multicore safe. Indexes track the location of both the next work node in the global queue for processing and the next location in the global queue for new work nodes to be added for subsequent processing.

Abstract: In one aspect, a method performed by a network node for predicting a probability of state change of a node (e.g., a fog node) in a network is provided. The network node determines a set of weights based on attributes of the node. The network node estimates the probability of state change of the node using the determined set of weights and a set of one or more attribute values related to the node where determining the set of weights includes maximizing an evaluation value associated to the node.

Abstract: A terminal includes a terminal body and/or a first wing that may extend from the terminal body. The first wing that may have an end portion, a middle portion and/or a connecting portion. The inner surface of the end portion may be in contact with an inner surface of the middle portion. A terminal may include a second wing that may extend from the terminal body. An outer surface of the middle portion of the first wing may contact an outer surface of the middle portion of the second wing. A first wing and a second wing may be disposed on opposite sides of the terminal body. The second wing may include an end portion, a middle portion, and/or a connecting portion. A connecting portion of the first wing and a connecting portion of the second wing may both connect to the terminal body.

Abstract: A terminal assembly includes a body, a wire, a first wing extending from the body and crimped around a first portion of the wire, and a second wing extending from the body and crimped around a second portion of the wire. The second portion may extend from the first portion. The first wing may extend circumferentially around at least 50% of the first portion and/or around less than 75% of the first portion. The first wing may provide a first channel and the second wing may provide a second channel. The first portion of a wire may be disposed at least partially in the first channel. The second portion of a wire may be disposed at least partially in the second channel. The first portion and the second portion may form a loop portion of the wire that may be disposed outside of the first channel and the second channel.

Abstract: A system and method for improving storage system operation is disclosed. A storage system includes a first tier with high-performance redundancy and a second tier with capacity efficient redundancy. The first tier and the second tier are built from the same storage devices in a storage pool so each storage device includes both the first and second tiers. The storage system stores write data initially to the first tier. When demand for the data falls below a threshold, the storage system migrates the write data to the second tier. This is done by changing the mapping of underlying physical locations on the storage devices where the write data is stored so that the underlying physical locations are logically associated with the second tier instead of the first tier. After remapping, the storage system also computes parity information for the migrated write data and stores it in the second tier.

Abstract: A terminal assembly includes a body, a wire, a first wing extending from the body and crimped around a first portion of the wire, and a second wing extending from the body and crimped around a second portion of the wire. The second portion may extend from the first portion. The first wing may extend circumferentially around at least 50% of the first portion and/or around less than 75% of the first portion. The first wing may provide a first channel and the second wing may provide a second channel. The first portion of a wire may be disposed at least partially in the first channel. The second portion of a wire may be disposed at least partially in the second channel. The first portion and the second portion may form a loop portion of the wire that may be disposed outside of the first channel and the second channel.

Abstract: A terminal includes a terminal body and/or a first wing that may extend from the terminal body. The first wing that may have an end portion, a middle portion and/or a connecting portion. The inner surface of the end portion may be in contact with an inner surface of the middle portion. A terminal may include a second wing that may extend from the terminal body. An outer surface of the middle portion of the first wing may contact an outer surface of the middle portion of the second wing. A first wing and a second wing may be disposed on opposite sides of the terminal body. The second wing may include an end portion, a middle portion, and/or a connecting portion. A connecting portion of the first wing and a connecting portion of the second wing may both connect to the terminal body.

Abstract: A method of assembling a terminal assembly includes providing a terminal. The terminal may include a terminal body portion, a first wing, and/or a second wing. A first wing and the second wing may each include an end portion. The method may include bending an end portion of a first wing and/or an end portion of a second wing that may provide a first bent portion and a second bent portion. The method may include crimping the first bent portion and the second bent portion onto a wire. The terminal may be in a first position during bending and/or the terminal may be rotated to a second position after bending. The terminal may be in the second position during crimping. The first position and the second position may be substantially perpendicular.

Abstract: A method of assembling a terminal assembly includes providing a terminal having a terminal body, a first wing, and/or a second wing. The method may include removing an end portion of the first wing, and/or an end portion of the second wing to provide a shortened first wing and/or a shortened second wing. The method may include crimping the shortened first wing and/or the shortened second wing onto a wire. The end portion of the first wing and the end portion of the second wing may be removed simultaneously. The end portion of the first wing and/or the end portion of the second wing may be removed via a die.

Abstract: A method of assembling a terminal assembly includes providing a terminal. The terminal may include a terminal body portion, a first wing, and/or a second wing. A first wing and the second wing may each include an end portion. The method may include bending an end portion of a first wing and/or an end portion of a second wing that may provide a first bent portion and a second bent portion. The method may include crimping the first bent portion and the second bent portion onto a wire. The terminal may be in a first position during bending and/or the terminal may be rotated to a second position after bending. The terminal may be in the second position during crimping. The first position and the second position may be substantially perpendicular.

Abstract: Methods, non-transitory machine-readable media, and computing devices for transitioning tasks and interrupt service routines are provided. An example method includes processing, by a plurality of processor cores of a storage controller, tasks and interrupt service routines. A performance statistic is determined corresponding to the plurality of processor cores. Based on detecting that the performance statistic passes a threshold, a number of the plurality of processor cores that are assigned to the tasks and the interrupt service routines are reduced.

Abstract: Methods and systems for dynamic hashing in cache sub-systems are provided. The method includes analyzing a plurality of input/output (I/O) requests for determining a pattern indicating if the I/O requests are random or sequential; and using the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data, where for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value.

Abstract: Methods, non-transitory machine-readable media, and computing devices for transitioning tasks and interrupt service routines are provided. An example method includes processing, by a plurality of processor cores of a storage controller, tasks and interrupt service routines. A performance statistic is determined corresponding to the plurality of processor cores. Based on detecting that the performance statistic passes a threshold, a number of the plurality of processor cores that are assigned to the tasks and the interrupt service routines are reduced.

Abstract: A method for transferring semantic knowledge between domains of a network is disclosed, the network comprising a first domain and a second domain. The method comprises establishing a semantic knowledge base for the first domain, the semantic knowledge base comprising concepts of the first domain, properties of the first domain concepts, relationships between the first domain concepts, and constraints governing the first domain concepts. The method further comprises establishing a semantic information base for the second domain, the semantic information base comprising concepts of the second domain. The method further comprises, for a concept of the second domain, determining measures of similarity between the second domain concept and concepts of the first domain and identifying, on the basis of the determined measures of similarity, a first domain concept which is equivalent to the second domain concept.

Abstract: A method, network system and computer storage medium for DDoS defence in a packet-switched network are provided. The method is performed by a network system and includes: measuring a plurality of network parameters in incoming network traffic; ranking the plurality of measured network parameters based on machine learning; measuring a subset of the plurality of network parameters in incoming network traffic; determining an incoming network packet to be part of a DDoS attack or not by machine learning of the subset of the plurality of network parameters; and blocking an incoming network packet when the incoming network packet is determined to be part of a DDoS attack.