Abstract: Aspects of the disclosure are directed to a high performance connection scheduler for reliable transport protocols in data center networking. The connection scheduler can handle enqueue events, dequeue events, and update events. The connection scheduler can include a connection queue, scheduling queue, and quality of service arbiter to support scheduling a large number of connections at a high rate.

Abstract: Techniques are described for performing complaint prioritization using one or more machine learning models for customer communications. For example, a computing system includes a memory and one or more processors in communication with the memory. The one or more processors are configured to receive communication data indicative of a service inquiry from a user device, generate a set of emotion factor values that indicate a measure of particular emotions in the service inquiry, determine, using a machine learning model and based on the set of emotion factor values, an emotional priority score for the service inquiry, and determine a response priority order for the service inquiry based on at least the emotional priority score.

Abstract: Techniques are described for determining a likelihood that a customer communication is fraudulent using one or more machine learning models. For example, a computing system includes a memory and one or more processors in communication with the memory. The one or more processors are configured to: receive a set of emotion factor values for communication data of a current communication associated with a customer, wherein each emotion factor value indicates a measure of a particular emotion factor in the current communication; classify, using an emotion variance model running on the one or more processors, the current communication into an emotional fraud category based on the set of emotion factor values for the current communication associated with the customer; and determine a risk score for the current communication indicative of a probability that the current communication is fraudulent based on at least the emotional fraud category for the current communication.

Abstract: Aspects of the disclosure are directed to a memory allocator for assigning contiguous memory space for data packets in on-chip memory of a network interface card. The memory allocator includes a plurality of sub-allocators that correspond to a structure of entries, where each entry represents a quanta of memory allocation. The sub-allocators are organized in decreasing size in the memory allocator based on the amount of memory quanta they can allocate.

Abstract: Disclosed in some examples are methods, systems, and machine readable mediums which provide summaries of topics determined within a corpus of documents. These summaries may be used by customer service associates, analysts, or other users to quickly determine both topics discussed and contexts of those topics over a large corpus of text. For example, a corpus of documents may be related to customer complaints and the topics may be summarized to produce summaries such as “credit report update due to stolen identity.” These summarizations may be used to efficiently spot trends and issues.

Abstract: Various embodiments herein disclose a method camping a User Equipment (UE) on a cell, the method comprising: creating a combined Most Recently Used (MRU) list by merging a list 4G MRU frequencies with a Public Land Mobile Network (PLMN) having a 5GC and a list of 5G MRU frequencies, determining whether one of a 4G cell with 5G core (5GC) and a 5G cell is available for camping by performing a MRU scan on the combined MRU list; performing one of: camping on one of the 4G cell with 5G core and the 5G cell in response to determining that one of the 5G cell and the 4G cell with 5G core is available and performing a 4G MRU frequency scan on a list of 4G without 5GC MRU frequencies in response to determining that one of the 4G cell with 5G core and the 5G cell is not available.

Abstract: Described are examples for providing a system for managing configuration and policies for a virtualized wide area network (vWAN) support on a wide area network (WAN). The vWAN includes a plurality of virtual network entities associated with geographic locations including the physical computing resources of the WAN and virtual connections between the virtual network entities. The system includes a network safety component for managing configurations and policies of the vWAN on the WAN. The network safety component receives a change to a policy or configuration of the vWAN from an operator of a network connected to the vWAN. The network safety component evaluates a set of safety rules for the operator based on the change and a network state of a physical WAN underlying the vWAN. The network safety component generates an error message in response to at least one of the set of safety rules failing the evaluation.

Abstract: Certain aspects of the present disclosure provide techniques for wireless communication by a first network entity. The techniques may generally involve generating a message with entries that represent blocks of physical resource blocks (PRBs), for transmitting reference signals over a fronthaul interface using modulation compression; transmitting the message to a second network entity via the fronthaul interface; and processing reference signals, transmitted in the blocks of PRBs on the fronthaul interface using modulation compression.

Abstract: A hash table system, including a plurality of hash tables, associated with respective hash functions, for storing key-value pairs; an overflow memory for storing key-value pairs moved from the hash tables due to collision; and an arbiter for arbitrating among commands including update commands, match commands, and rehash commands, wherein for each system clock cycle, the arbiter selects as a selected command one of an update command, a match command, or a rehash command, and wherein the hash table system completes execution of each selected command within a bounded number of system clock cycles.

Abstract: Compressing connection state information for a network connection including receiving an input bitmap having a sequence of bits describing transmit states and receive states; partitioning the input bitmap into a plurality of equal size blocks; partitioning each of the blocks into a plurality of equal sized sectors; generating a block valid sequence indicating the blocks having at least one bit set; generating, for each block having at least one bit set, a sector information sequence, the sector information sequence indicating, for the corresponding block, the sectors that have at least one bit set and an encoding type for each sector; and generating one or more symbols by encoding each sector that has at least one bit set.

Abstract: Aspects of the disclosure are directed to high performance connection cache eviction for reliable transport protocols in data center networking. Connection priorities for connection entries are determined to store the connection entries in a cache based on their connection priority. During cache eviction, the connection entries with a lowest connection priority are evicted from the cache. Cache eviction can be achieved with low latency at a high rate.

Abstract: A computer implemented method for engineering a process bus system, a substation engineering tool, and a substation communication configuration tool are provided. The computer implemented method obtains, from the substation engineering tool, engineering data associated intelligent electronic device(s) deployable in a substation, using an SCD file, generates publisher-subscriber data by determining a publisher logical device and a subscriber logical device from the IEDs and the connections therebetween, based on the engineering data, stores into the engineering data the publisher-subscriber data, transfers the engineering data to the substation communication configuration tool via the SCD file, and automatically maps, in the substation communication configuration tool, the publisher logical device and the subscriber logical device with the GOOSE and SMV information based on the engineering data and the publisher-subscriber data.

Abstract: A method, apparatus, and computer program are disclosed. The method may be performed by one or more processors and may comprise receiving first data representing an infrastructure of a computer network, the first data comprising an indication of hosts which form at least part of the computer network and one or more software resources on respective hosts. The method may also comprise receiving second data from a vulnerability scanning software, the second data comprising an indication of one or more vulnerabilities detected in the one or more software resources provided on at least some of the hosts of the computer network. Using a combination of the first data and the second data, output data may be generated representing a risk profile of the computer network infrastructure, the output data indicating one or more subsets of hosts, determined as being at risk of being affected by the detected vulnerabilities by virtue of the software resources they provide for output on a user interface.

Abstract: The techniques described herein enable the use of a time factor for traffic management and routing. A system is configured to analyze traffic for a service over a period of time and identify (e.g., learn) traffic patterns that reflect a substantial effect on traffic during a particular real-world event. Using the traffic patterns identified via the analysis, the system can provide valuable time-based traffic information to service providers. A service provider can then create a predefined time-based profile that is used by a traffic manager to switch from a current traffic routing configuration to a different traffic routing configuration that better accommodates an expected traffic load for various endpoints. The predefined time-based profile specifies a scheduled time at which the switch is to occur, and this scheduled time can correspond to a start time for a real-world event that is known to cause an increase or decrease in traffic.

Abstract: A hash table system, including a plurality of hash tables, associated with respective hash functions, for storing key-value pairs; an overflow memory for storing key-value pairs moved from the hash tables due to collision; and an arbiter for arbitrating among commands including update commands, match commands, and rehash commands, wherein for each system clock cycle, the arbiter selects as a selected command one of an update command, a match command, or a rehash command, and wherein the hash table system completes execution of each selected command within a bounded number of system clock cycles.

Abstract: A packet cache system includes a cache memory allocator for receiving a memory address corresponding to a non-cache memory and allocated to a packet, and associating the memory address with a cache memory address; a hash table for storing the memory address and the cache memory address, with the memory address as a key and the cache memory address as a value; a cache memory for storing the packet at a location indicated by the cache memory address; and an eviction engine for determining one or more cached packets to remove from the cache memory and place in the non-cache memory when occupancy of the cache memory is high.

Abstract: A flow rate control method for solicited data communications includes receiving, at a first node of a communications network, a request-to-send (RTS) signal from a second node of the communications network, the RTS signal indicating a size of a solicited data transmission of the second node, determining, by the first node, whether a rate-limiting counter is above zero, wherein the rate-limiting counter is programmed to increase at a programmed rate and in response to the rate-limiting counter being above zero, scheduling, by the first node, a clear-to-send (CTS) signal to be sent from the first node to the second node over the communications network, and subtracting, by the first node, a value corresponding to the size of the solicited data transmission of the second node from the rate-limiting counter.

Abstract: This disclosure relates generally to methods and systems for screening and design of corrosion inhibitors. Conventional techniques in the art for predicting the inhibition efficiency of the molecule are not so accurate, where the inhibition efficiency is one of the important parameter for screening and design of corrosion inhibitors. In the present disclosure, the IE prediction model is developed by training a multi-task network model using the molecular descriptors of different classes of the molecules, and also the experimental conditions of the molecule. Further, a unique screening technique is disclosed that screens the molecules using various parameters including the inhibition efficiency of the molecule, an energy gap of the molecule, a synergistic effect of the molecules and an interaction energy of the molecules. Further the present disclosure allows to design a new molecule by making changes to the molecules that suits based on the end applications.

Abstract: Methods for obtaining in-situ, multi-temperature measurements of fluid properties, such as saturation pressure and asphaltene onset pressure include obtaining a sample of formation fluid using a downhole acquisition tool positioned in a wellbore in a geological formation. The downhole acquisition tool may be stationed at a first depth in the wellbore that has an ambient first temperature. While stationed at the first depth, the downhole acquisition tool may test a first fluid property of the sample to obtain a first measurement point at approximately the first temperature. The downhole acquisition tool may be moved to a subsequent station at a new depth with an ambient second temperature, and another measurement point obtained at approximately the second temperature. From the measurement points, a temperature-dependent relationship of the first fluid property of the first formation fluid may be determined.

Abstract: Versions of an application are managed by receiving a request for a version of an application, retrieving, responsive to the received request, a version of a master application component based at least in part on version data that associates a version of the master application component with the version of the application, retrieving a relationship operable to relate the version of the master application component with a corresponding version of a first component on which the master application component depends for a function of the application, retrieving the corresponding version of the first component, responsive to the retrieving of the relationship, assembling the version of the application based at least in part on the retrieved version of the master component, the retrieved relationship, and the retrieved first component, and providing for an execution of the assembled version of the application.