45 results about "Partial representation" patented technology

A method for identifying malicious encrypted network traffic associated with a malware software component communicating via a network, the method comprising: defining, for the malware, a portion of network traffic including a plurality of contiguous bytes occurring at a predefined offset in a network communication of the malware; extracting the defined portion of network traffic for each of a plurality of disparate network connections for the malware; evaluating a metric for each byte in each extracted portion; representing each extracted portion in a matrix data structure as an image of pixels wherein each pixel corresponds to a byte of the extracted portion; training a neural network based on the images for the extracted portions such that subsequent network traffic can be classified bythe neural network to identify malicious network traffic associated with the malware based on an image generated to represent the defined portion of the subsequent network traffic.

A calculating unit for reducing an input number with respect to a modulus, wherein the input number has input number portions of different significances, wherein the input number portions represent the input number with respect to a division number, wherein the modulus has modulus portions of different significances, and wherein the modulus portions represent the modulus with respect to the division number, includes a unit for estimating a result of an integer division of the input number by the modulus using a stored most significant portion of the number, a stored most significant portion of the modulus and the number, and for storing the estimated result in a memory of the calculating unit, and a unit for calculating a reduction result based on a subtraction of a product of the modulus and a value derived from the estimated result from the number.

A system for monitoring a fetus during gestation comprises an input for receiving a plurality of electric signals measured on a surface of a maternal body; and a processor for providing a fetal electrocardiogram based on the received electric signals and based on an orientation of the fetus, wherein the fetal electrocardiogram represents a projection of a fetal cardiac potential vector according to a predetermined projection direction that is fixed with respect to the fetus. The fetal vector electrocardiogram is projected according to the projection direction. An at least partial representation of a fetal vector electrocardiogram is provided in dependence on the plurality of electric signals and indicative of a time path of an electrical field vector generated by a fetal heart of the fetus.

A content addressable memory (CAM) device, method, and method of generating entries for range matching are disclosed. A CAM device (800) according to one embodiment can include a pre-encoder (806) that encodes range bit values W into additional bits E. Additional bits E can indicate compression of range rules according to particular bit pairs. A CAM array (802) can include entries that store compressed range code values (RANGE) with corresponding additional bit values (ENC). Alternate embodiments can include pre-encoders that encode portions of range values (K1 to Ki) in a “one-hot” fashion. Corresponding CAM entries can include encoded value having sections that each represent increasingly finer divisions of a range space.

A network includes multiple segments and bridges interconnecting the segments, with hosts coupled to the segments. The bridges are smart bridges that each perform a host location initialization function. The host location initialization function in one bridge is performed in corporation with all other bridges in the bridged network via an instance through a propagation order spanning tree (POST). The initialization method includes obtaining prior host location information which is at least a partial representation of the host locations in the bridged network before the network topology change, obtaining hints on host location changes resulting from the network topology change, and modifying the prior host location information according to the hints to construct host location information for initialization. Location information for at least a portion of the hosts in the bridged network is preserved or discovered quickly each time when the network topology changes.

Interpolation of signed values A and B is efficiently performed by simple circuitry. To calculate an interpolated value C based on a 4-bit values A (bits a3a2a1a0) and B (bits b3b2b1b0) expressing a negative number by twos complement notation and a 4-bit interpolation rate D (bits d3d2d1d0) consisting of only a decimal part, a basic expression of C=(1−D)*A+D*B is transformed into an expression composed of an unsigned part that includes a sum of products with a bit di or a logically inverted value ei of the bit di (i=0, 1, 2, and 3), and indicates an absolute value of the interpolated value C, and a signed part indicating a sign of the interpolated value C. Then, 7 bits of bits c6 through c0 are generated from an arithmetic operation of the unsigned part, and logic judgement of the signed part is performed by considering a carry from the digit of the bit c6 of the arithmetic operation of the unsigned part to generate a bit c7. Significant digits of the obtained 8-bit value (bits c7 through c0) are outputted as an interpolated value.

Evaluate the validity of a dictionary in which a notation word is associated with a canonical word. This is accomplished using an apparatus which evaluates the validity of a dictionary for converting a notation word written in a text, the apparatus comprising: a dictionary recording portion which records, for each of word categories, at least one notation word in association with a canonical word representing the at least one notation word; a relation recording portion which records, on the condition that a canonical word of one category corresponds to a notation word of another category, the dependence relation that the one category depends on that other category; and an evaluation portion which evaluates, on the condition that the canonical word of a first category corresponds to a notation word of a second category in the dictionary recording portion and that the dependence relation that the first category depends on the second category is not recorded in the relation recording portion, the notation word to be invalid as a word represented by the canonical word.

A method and system for optimizing SOAP messages combines mechanisms of accelerating the composition of SOAP messages, reducing SOAP parsing overheads, and reducing SOAP message sizes by leveraging elements of the previous two techniques and policies for configuring these mechanisms. A byte-level partial representation of a SOAP message may be constructed upon its first use and each new instantiation of the same message is composed from this representation and the encoded parameters or return values. SOAP message parsing may be accelerated using a cache of associations. Each entry may associate the byte-level encoding of an XML tag with its component in the internal data representation of the received message. These two techniques can be used independently on one or both SOAP endpoints.

A calculating unit for reducing an input number with respect to a modulus, wherein the input number has input number portions of different significances, wherein the input number portions represent the input number with respect to a division number, wherein the modulus has modulus portions of different significances, and wherein the modulus portions represent the modulus with respect to the division number, includes a unit for estimating a result of an integer division of the input number by the modulus using a stored most significant portion of the number, a stored most significant portion of the modulus and the number, and for storing the estimated result in a memory of the calculating unit, and a unit for calculating a reduction result based on a subtraction of a product of the modulus and a value derived from the estimated result from the number.

A multi-ownership tree-map visualization system can include a tree-map configured to visualize a set of interrelated nodes in which at least one individual node in the set is related to at least two parent nodes in the set. The system further can include an event handler programmed to process a proximity event associated with a specific portion of the tree-map by highlighting multiple portions of the tree-map in which the portions represent a single node in the set. In this regard, the proximity event can include a mouse-over event, a mouse-click event, or a keyboard selection event, to name a few. The system yet further can include logic for displaying a call-out box for each portion of the tree-map associated with the single node in the set.