Abstract: A curve function device and an operation method thereof are provided. The curve function device includes a lookup table, a weight calculation circuit, and a linear function circuit. According to first partial bits of an input value, a bias value of a current segment and a bias value of a next segment can be extracted from the lookup table. The weight calculation circuit can calculate a weight value of the current segment according to the bias value of the current segment and the bias value of the next segment. The linear function circuit can calculate a linear function value by using the bias value of the current segment, the weight value of the current segment, and second partial bits of the input value. This linear function value can be used as an approximate value of the curve function.

Abstract: Apparatus performs various modal interval computations, while accounting for various modal interval operand configurations that are not amenable to ordinary computational operations. Upon detecting an exponent field of all 1's, the apparatus adapts various conventions involving leading bits in the fraction field of the modal interval endpoints to return a result having a useful meaning. Unary, binary and ternary modal interval operations with decorations are contemplated.

Abstract: A media processing apparatus and method for frame rate control based on rendered objects. The media processing apparatus receives a first plurality of image frames which may include a first plurality of objects from a first image capturing device. The media processing apparatus receives a first user input corresponding to a first object from a first media rendering device. The media processing apparatus determines a first speed of movement of the first object based on an analysis of a first set of consecutive image frames from the first plurality of image frames and calculates a first frame rate based on the determined first speed of movement of the first object. The first image capturing device captures a second plurality of image frames at the first frame rate. The media processing apparatus transmits the captured second plurality of image frames to the first media rendering device.

Abstract: Systems and methods are described for efficiently detecting an optimal number of behaviors to model software system performance data and the aspects of the software systems that best separate the behaviors. The behaviors may be ranked according to how well fitting functions partition the performance data.

Abstract: The present invention relates to a current multiplier primarily in the field of power conversion. The invention relates to a controlled current multiplier with a resonant winding to assist with, for example, power conversion. In particular, but not solely, the invention may broadly consist in a current multiplier comprising: a primary winding associated with a power source; a secondary winding associated with a load; a resonant winding associated with a capacitance; and a control means for controlling an output of the secondary winding to the load, the control means associated with the primary or resonant winding. This allows, for instance, control of the high current output to be placed on a low current winding.

Abstract: In some aspects, a quantum simulation method includes generating a set of models representing a quantum system. The set of models includes subsystem models representing respective fragments of the quantum system. The quantum system is simulated by operating the set of models on a computer system that includes a classical processor unit and multiple unentangled quantum processor units (QPUs), and the unentangled QPUs operate the respective subsystem models. In some examples, density matrix embedding theory (DMET) is used to compute an approximate ground state energy for the quantum system.

Abstract: In a general aspect, user requests for access distributed quantum computing resources in a distributed quantum computing system are managed. In a general aspect, a job request for accessing a quantum computing resource is received. The job request includes a user id and a program. On authentication of a user associated with the job request, a job identifier is assigned to the job request, and a particular quantum computing resource is selected for the job request. The job request is individualized based on user permissions and pushed onto a queue to be processed for execution by the quantum computing resource.

Abstract: Examples of the present disclosure describe systems and methods of automatic inline detection based on static data. In aspects, a file being received by a recipient device may be analyzed using an inline parser. The inline parser may identify sections of the file and feature vectors may be created for the identified sections. The feature vectors may be used to calculate a score corresponding to the malicious status of the file as the information is being analyzed. If a score is determined to exceed a predetermined threshold, the file download process may be terminated. In aspects, the received files, file fragments, feature vectors and/or additional data may be collected and analyzed to build a probabilistic model used to identify potentially malicious files.

Abstract: Techniques for performing cost function deformation in quantum approximate optimization are provided. The techniques include mapping a cost function associated with a combinatorial optimization problem to an optimization problem over allowed quantum states. A quantum Hamiltonian is constructed for the cost function, and a set of trial states are generated by a physical time evolution of the quantum hardware interspersed with control pulses. Aspects include measuring a quantum cost function for the trial states, determining a trial state resulting in optimal values, and deforming a Hamiltonian to find an optimal state and using the optimal state as a next starting state for a next optimization on a deformed Hamiltonian until an optimizer is determined with respect to a desired Hamiltonian.

Abstract: A method for monitoring a computing system including multiple endpoints, includes monitoring, in at least some of the endpoints, operating-system (OS) system calls relating to a transport protocol having no handshake mechanism. First and second endpoints, which exchange a flow of packets with one another using the transport protocol, are identified from among the multiple endpoints. A deduction is made, from the monitored system calls, which of the first and second endpoints acts as a server in the flow of packets, and which of the first and second endpoints acts as a client in the flow of packets.

Abstract: A security platform running on a server includes (a) protocol stacks each configured to receive and to transmit IP data packets over a network interface, wherein the protocol stacks have predetermined performance characteristics that are different from each other and wherein each protocol stack includes one or more program interfaces to allow changes to its performance characteristics; (b) application programs each configured to receive and transmit payloads of the IP data packets, wherein at least two of the application programs are customized to handle different content types in the payloads and wherein each application program accesses the program interface of at least one protocol stack to tune performance characteristics of the protocol stack; (c) classifiers configured to inspect at a given time IP data packets then received in the network interface to select one of the protocol stack and one of the application programs to service the data packets; and (d) a control program to load and run the selected

Abstract: Various methods, apparatuses, and media for producing a report are provided. A first input that includes raw data and derived data is received, and mathematical relationships between the derived data and the raw data are determined. The mathematical relationships are used for generating executable code, which is then applied to newly inputted raw data to produce the report.

Abstract: A vehicle application enabling system is provided and includes a latency characterization and prediction module and an application enable module. The latency characterization and prediction module includes: an estimate sample module configured to collect and store obtained latency estimates, where the obtained latency estimates are associated with transmission of signals in a network for one or more vehicle applications; a sample characterization module configured to characterized the obtained latency estimates; a trend module configured to determine a trend based on the characterized obtained latency estimates; a point projection module configured to generate projected latency estimates based on the trend; and a projection characterization module configured to characterize the projected latency estimates. The application enable module is configured to determine whether to enable the one or more vehicle applications based on the characterization of the projected latency estimates.

Abstract: One embodiment provides for a method that includes performing, by a processor, active learning of large scale entity resolution using a distributed compute memoing cache to eliminate redundant computation. Link feature vector tables are determined for intermediate results of the active learning of large scale entity resolution. The link feature vector tables are managed by a two-level cache hierarchy.

Abstract: There are disclosed devices, system and methods for a machine learning binary classifier automatically tolerating training data that is incorrect by determining a correct and an incorrect likelihood ratio that each training data entry has a correctly and an incorrectly labeled output. The correct and an incorrect likelihood ratio are combined with a correct and an incorrect priori odds ratio that the set of training data entries have correctly and incorrect labeled output labels. These two combinations are a correct probability and an incorrect probability that each entry of the set of entries has a correctly and an incorrect labeled output. A logistic regression model if fit to a combination of the correct probability and the incorrect probability for each training data entry to complete the training.

Abstract: An execution unit is described. The execution unit includes an arithmetic logic unit (ALU) circuit having a first input to receive a first value and a second input to receive a second value. The ALU circuit includes circuitry to determine an absolute value of the first value and to add the absolute value to the second value. The first input is coupled to a first data path having register space and an output of another ALU of the execution unit circuit as alternative sources of the first value. The second input is coupled to a second data path having the register space as a source for the second value.

Abstract: Described herein are methods, systems, and media for generating a quantum-ready or quantum-enabled software development kit (SDK) for a quantum computing system. Such methods may comprise accepting user input from an application at an application interface, which application is executed on a digital computer, and implementing one or more algorithms, at an algorithms layer, that may be solved heuristically or exactly depending on the requirements of the user input. The one or more algorithms may abstract away a complexity of the application; transforming the one or more algorithms from the application space into the one or more instructions in polynomial unconstrained binary optimization (PUBO) form. The one or more instruction may be executed in PUBO form at the common interface solver layer.

Abstract: A computer system can generate a materialized query table (MQT) for data from a base table that has a plurality of rows and columns that each contain stored data. The computer system can receive a query to data stored in a row from the base table. The system can identify a column in the row and determine that data from a cell in the row and the column is above a threshold memory size. The system can generate, in response to determining that the data being above the threshold memory size, an MQT that includes data for the row and that includes a reference pointer that points to a location shared with another table.

Abstract: An example quantum circuit assembly includes a quantum circuit component with a plurality of qubits operable by selectively applying control signals to various terminals of the qubits. The assembly further includes an array of analog memory cells, a DAC configured to sequentially generate analog values/signals to be stored in different ones of the analog memory cells, and a switching arrangement configured to selectively apply control signals to various ones of qubit terminals, where each control signal is applied by the switching arrangement electrically connecting an output terminal of a different analog memory cell of the array of analog memory cells to one of the qubit terminals. Performing digital-to-analog conversion ahead of performing qubit operations and storing results of the conversion in different analog memory cells allows pre-generating and storing analog voltages required for qubit operations that may be carried out during the qubit coherence time.

Abstract: An entropy decoder is configured to, for horizontal and vertical components of motion vector differences, derive a truncated unary code from the data stream using context-adaptive binary entropy decoding with exactly one context per bin position of the truncated unary code, which is common for horizontal and vertical components of the motion vector differences, and an Exp-Golomb code using a constant equi-probability bypass mode to obtain the binarizations of the motion vector differences. A desymbolizer is configured to debinarize the binarizations of the motion vector difference syntax elements to obtain integer values of the horizontal and vertical components of the motion vector differences. A reconstructor is configured to reconstruct a video based on the integer values of the horizontal and vertical components of the motion vector differences.

Abstract: Apparatus performs various modal interval computations, while accounting for various modal interval operand configurations that are not amenable to ordinary computational operations. Upon detecting an exponent field of all 1's, the apparatus adapts various conventions involving leading bits in the fraction field of the modal interval endpoints to return a result having a useful meaning.

Abstract: A universal quantum computer may be emulated by a classical computing system that uses an electronic signal of bounded duration and amplitude to represent an arbitrary initial quantum state. The initial quantum state may be specified by inputs provided to the system and may be encoded in the signal, which is derived from a collection of phase-coherent coherent basis signals. Unitary quantum computing gate operations, including logical operations on qubits or operations that change the phase of a qubit, may be performed using analog electronic circuits within the quantum computing emulation device. These circuits, which may apply a matrix transformation to the signals representing the initial quantum state, may include four-quadrant multipliers, operational amplifiers, and analog filters. A measurement component within the quantum computing emulation device may produce a digital signal output representing the transformed quantum state.

Abstract: An apparatus for providing anonymity in geographic data for probe devices in a geographic region for a location-based service includes at least a database and a triangulation calculator. The database is configured to store trajectory data based on sequences of sensor measurements of the probe devices. The triangulation calculator is configured to calculate triangles from the trajectory data. Each of the triangles is defined by vertices. The triangulation calculator is configured to calculate a similarity score for the vertices based on trajectory data associated with adjacent vertices. At least one vertex is modified in response to the similarity score.

Abstract: A computer-automated method is described for identifying and remediating anomalous data points for acquired performance parameter (e.g., KPI) values for components of a mobile wireless data network—such as PDSNs. The remediated data point sets is thereafter used as input to a forecasting model rendering a forecast for a mobile wireless network performance indicator/parameter. Data point sequence seasonality is exploited to improve the detection of anomalous data points. Furthermore, correcting data point sets is reiterated until changes between two iterations of the correction process are within a threshold magnitude for terminating the iterative data point sequence correction process.

Abstract: Systems and methods for evaluating a loss function or a gradient of the loss function. In one example embodiment, a computer-implemented method includes partitioning a weight matrix into a plurality of blocks. The method includes identifying a first set of labels for each of the plurality of blocks with a score greater than a first threshold value. The method includes constructing a sparse approximation of a scoring vector for each of the plurality of blocks based on the first set of labels. The method includes determining a correction value for each sparse approximation of the scoring vector. The method includes determining an approximation of a loss or a gradient of a loss associated with the scoring function based on each sparse approximation of the scoring vector and the correction value associated with the sparse approximation of the scoring vector.

Abstract: A system includes a processor and a memory. The memory stores instructions executable by the processor to receive sensor data including floating-point numbers. The memory stores instructions to convert the floating-point numbers to integer numbers based on a parameter set. The memory stores instructions to actuate a vehicle component based on the integer numbers.

Abstract: Performing an arithmetic operation in a data processing unit, including calculating a number of iterations for performing the arithmetic operation with a given number of bits per iteration. The number of bits per iteration is a positive natural number. A number of consecutive digit positions of a digit in a sequence of bits represented in the data processing unit is counted. The length of the sequence is a multiple of the number of bits per iteration. A quotient of the number of consecutive digit positions divided by the number of bits per iteration is calculated, as well as a remainder of the division.

Abstract: A decoder for decoding a data stream into which media data is coded has a mode switch configured to activate a low-complexity mode or a high-efficiency mode depending on the data stream, an entropy decoding engine configured to retrieve each symbol of a sequence of symbols by entropy decoding using a selected one of a plurality of entropy decoding schemes, a desymbolizer configured to desymbolize the sequence of symbols to obtain a sequence of syntax elements, a reconstructor configured to reconstruct the media data based on the sequence of syntax elements, selection depending on the activated low-complexity mode or the high-efficiency mode.

Abstract: An entropy decoder is configured to, for horizontal and vertical components of motion vector differences, derive a truncated unary code from the data stream using context-adaptive binary entropy decoding with exactly one context per bin position of the truncated unary code, which is common for horizontal and vertical components of the motion vector differences, and an Exp-Golomb code using a constant equi-probability bypass mode to obtain the binarizations of the motion vector differences. A desymbolizer is configured to debinarize the binarizations of the motion vector difference syntax elements to obtain integer values of the horizontal and vertical components of the motion vector differences. A reconstructor is configured to reconstruct a video based on the integer values of the horizontal and vertical components of the motion vector differences.

Abstract: An entropy decoder is configured to, for horizontal and vertical components of motion vector differences, derive a truncated unary code from the data stream using context-adaptive binary entropy decoding with exactly one context per bin position of the truncated unary code, which is common for horizontal and vertical components of the motion vector differences, and an Exp-Golomb code using a constant equi-probability bypass mode to obtain the binarizations of the motion vector differences. A desymbolizer is configured to debinarize the binarizations of the motion vector difference syntax elements to obtain integer values of the horizontal and vertical components of the motion vector differences. A reconstructor is configured to reconstruct a video based on the integer values of the horizontal and vertical components of the motion vector differences.

Abstract: A parallel LU-factorization method executed in a parallel computer including a plurality of processing nodes which execute LU-factorization in parallel, the method causes each of the plurality of processing nodes to execute processing of; measuring a first time period, which is a time period from when a matrix product for a matrix of a first size is completed to when communication with a different processing node out of the plurality of processing nodes is completed; and altering a size of a matrix to be used for a matrix product to a second size smaller than the first size in a case where the measured first time period is equal to or longer than a predetermined time period.

Abstract: In one embodiment, a device in a network receives traffic records indicative of network traffic between different sets of host address pairs. The device identifies one or more address grouping constraints for the sets of host address pairs. The device determines address groups for the host addresses in the sets of host address pairs based on the one or more address grouping constraints. The device provides an indication of the address groups to an anomaly detector.

Abstract: An apparatus to facilitate processing of a sparse matrix is disclosed. The apparatus includes a plurality of processing units each comprising one or more processing elements, including logic to read operands, a multiplication unit to multiply two or more operands and a scheduler to identify operands having a zero value and prevent scheduling of the operands having the zero value at the multiplication unit.

Abstract: The present invention extends to methods, systems, and computing system program products for iteratively calculating kurtosis for Big Data. Embodiments of the invention include iteratively calculating one or more components of a kurtosis in a modified computation subset based on the one or more components of the kurtosis calculated for a previous computation subset and then calculating the kurtosis based on the iteratively calculated components. Iteratively calculating kurtosis avoids visiting all data elements in the modified computation subset and performing redundant computations thereby increasing calculation efficiency, saving computing resources and reducing computing system's power consumption.

Abstract: A decoder for decoding a data stream into which media data is coded has a mode switch configured to activate a low-complexity mode or a high-efficiency mode depending on the data stream, an entropy decoding engine configured to retrieve each symbol of a sequence of symbols by entropy decoding using a selected one of a plurality of entropy decoding schemes, a desymbolizer configured to desymbolize the sequence of symbols to obtain a sequence of syntax elements, a reconstructor configured to reconstruct the media data based on the sequence of syntax elements, selection depending on the activated low-complexity mode or the high-efficiency mode.

Abstract: An entropy decoder is configured to, for horizontal and vertical components of motion vector differences, derive a truncated unary code from the data stream using context-adaptive binary entropy decoding with exactly one context per bin position of the truncated unary code, which is common for horizontal and vertical components of the motion vector differences, and an Exp-Golomb code using a constant equi-probability bypass mode to obtain the binarizations of the motion vector differences. A desymbolizer is configured to debinarize the binarizations of the motion vector difference syntax elements to obtain integer values of the horizontal and vertical components of the motion vector differences. A reconstructor is configured to reconstruct a video based on the integer values of the horizontal and vertical components of the motion vector differences.

Abstract: An entropy decoder is configured to, for horizontal and vertical components of motion vector differences, derive a truncated unary code from the data stream using context-adaptive binary entropy decoding with exactly one context per bin position of the truncated unary code, which is common for horizontal and vertical components of the motion vector differences, and an Exp-Golomb code using a constant equi-probability bypass mode to obtain the binarizations of the motion vector differences. A desymbolizer is configured to debinarize the binarizations of the motion vector difference syntax elements to obtain integer values of the horizontal and vertical components of the motion vector differences. A reconstructor is configured to reconstruct a video based on the integer values of the horizontal and vertical components of the motion vector differences.

Abstract: Methods of implementing fixed-point polynomials in hardware logic include distributing a defined error bound for the whole polynomial between operators in a data-flow graph for the polynomial by solving an optimization problem that outputs an accuracy parameter and a precision parameter for each node. Each operator is then itself optimized to satisfy the part of the error bound allocated to that operator and as defined by the accuracy and precision parameters.

Abstract: The present invention extends to methods, systems, and computing system program products for decrementally calculating correlation for Big Data or streamed data. Embodiments of the invention include decrementally calculating one or more components of a correlation for two modified computation subsets based on one or more components of the correlation calculated for two previous computation subsets and then calculating the correlation for the modified computation subsets based on the decrementally calculated components. Decrementally calculating the components of a correlation avoids visiting all data elements in the modified computation subsets and performing redundant computations thereby increasing calculation efficiency, saving computation resources, and reducing computing system's power consumption.

Abstract: The present invention extends to methods, systems, and computing system program products for iteratively calculating kurtosis for streamed data. Embodiments of the invention include iteratively calculating one or more components of a kurtosis in an adjusted computation window based on the one or more components of the kurtosis calculated for a previous computation window and then calculating the kurtosis based on the iteratively calculated components. Iteratively calculating a kurtosis avoids visiting all data elements in the adjusted computation window and performing redundant computations thereby increasing calculation efficiency, saving computing resources and reducing computing system's power consumption.

Abstract: An entropy decoder is configured to, for horizontal and vertical components of motion vector differences, derive a truncated unary code from the data stream using context-adaptive binary entropy decoding with exactly one context per bin position of the truncated unary code, which is common for horizontal and vertical components of the motion vector differences, and an Exp-Golomb code using a constant equi-probability bypass mode to obtain the binarizations of the motion vector differences. A desymbolizer is configured to debinarize the binarizations of the motion vector difference syntax elements to obtain integer values of the horizontal and vertical components of the motion vector differences. A reconstructor is configured to reconstruct a video based on the integer values of the horizontal and vertical components of the motion vector differences.

Abstract: A method of transmitting data from a transmitter device to a plurality of receiver devices each of which is connected to the transmitter device via a respective wire connection the method comprising transmitting a common signal onto all or both of the respective wire connections and using a multiple access technique to enable respective virtual data channels to be generated for transmitting data from the transmitter device to each of the receiver devices via its own respective virtual data channel.

Abstract: The precision of up-sampling operations in a layered coding system is preserved when operating on video data with high bit-depth. In response to bit-depth requirements of the video coding or decoding system, scaling and rounding parameters are determined for a separable up-scaling filter. Input data are first filtered across a first spatial direction using a first rounding parameter to generate first up-sampled data. First intermediate data are generated by scaling the first up-sampled data using a first shift parameter. The intermediate data are then filtered across a second spatial direction using a second rounding parameter to generate second up-sampled data. Second intermediate data are generated by scaling the second up-sampled data using a second shift parameter. Final up-sampled data may be generated by clipping the second intermediate data.

Abstract: A method is disclosed for preprocessing a problem involving discrete optimization over a plurality of variables, the method comprising obtaining an indication of a problem involving discrete optimization; converting the problem involving discrete optimization into a problem suitable for a given optimization oracle architecture of an optimization oracle; providing a given number of times M the problem suitable for the given optimization oracle architecture to the optimization oracle; for each providing of the problem, performing a given number K of calls to the optimization oracle; each call generating a given configuration; obtaining a variable selection criterion, the variable selection criterion for determining at least one variable of the plurality of generated configurations that can be fixed; determining at least one variable that matches the variable selection criterion and a corresponding value for each variable; fixing the at least one determined variable at the corresponding value in the problem invo

Abstract: An entropy decoder is configured to, for horizontal and vertical components of motion vector differences, derive a truncated unary code from the data stream using context-adaptive binary entropy decoding with exactly one context per bin position of the truncated unary code, which is common for horizontal and vertical components of the motion vector differences, and an Exp-Golomb code using a constant equi-probability bypass mode to obtain the binarizations of the motion vector differences. A desymbolizer is configured to debinarize the binarizations of the motion vector difference syntax elements to obtain integer values of the horizontal and vertical components of the motion vector differences. A reconstructor is configured to reconstruct a video based on the integer values of the horizontal and vertical components of the motion vector differences.

Abstract: The video-motion segmentation method using a randomized voting is provided which includes receiving the video, extracting a plurality of feature points from the video, and grouping the plurality of feature points by applying a randomized voting method using a score histogram on each of the at least some feature points of the plurality of feature points.

Abstract: Described here is a system and method for image reconstruction that can automatically and iteratively produce multiple images from one set of acquired data, in which each of these multiple images corresponds to a subset of the acquired data that is self-consistent, but inconsistent with other subsets of the acquired data. The image reconstruction includes iteratively minimizing the rank of an image matrix whose columns each correspond to a different image, and in which one column corresponds to a user-provided prior image of the subject. The rank minimization is constrained subject to a consistency condition that enforces consistency between the forward projection of each column in the image matrix and a respective subset of the acquired data that contains data that is consistent with data in the subset, but inconsistent with data not in the subset.

Abstract: In one embodiment, the present invention includes a method for receiving a rounding instruction and an immediate value in a processor, determining if a rounding mode override indicator of the immediate value is active, and if so executing a rounding operation on a source operand in a floating point unit of the processor responsive to the rounding instruction and according to a rounding mode set forth in the immediate operand. Other embodiments are described and claimed.

Abstract: An entropy decoder is configured to, for horizontal and vertical components of motion vector differences, derive a truncated unary code from the data stream using context-adaptive binary entropy decoding with exactly one context per bin position of the truncated unary code, which is common for horizontal and vertical components of the motion vector differences, and an Exp-Golomb code using a constant equi-probability bypass mode to obtain the binarizations of the motion vector differences. A desymbolizer is configured to debinarize the binarizations of the motion vector difference syntax elements to obtain integer values of the horizontal and vertical components of the motion vector differences. A reconstructor is configured to reconstruct a video based on the integer values of the horizontal and vertical components of the motion vector differences.

Abstract: The present embodiments relate to circuitry that efficiently performs double-precision floating-point addition operations, single-precision floating-point addition operations, and fixed-point addition operations. Such circuitry may be implemented in specialized processing blocks. If desired, each specialized processing block may efficiently perform a single-precision floating-point addition operation, and multiple specialized processing blocks may be coupled together to perform a double-precision floating-point addition operation. In some embodiments, four specialized processing blocks that are arranged in a one-way cascade chain may compute the sum of two double-precision floating-point number. If desired, two specialized processing blocks that are arranged in a two-way cascade chain may compute the sum of two double-precision floating-point numbers.