Abstract: The present invention relates to inhibitors of DNMT containing zinc moiety derivatives that have enhanced or unique properties as inhibitors of DNA methyl transferases (DNMT) and their use in the treatment of DNMT related diseases and disorders such as cancer. The said derivatives may further act as HDAC inhibitors.

Abstract: The present invention relates to the compositions, methods, and applications of a novel approach to selective inhibition of several cellular or molecular targets with a single small molecule. More specifically, the present invention relates to multi-functional small molecules wherein one functionality is capable of inhibiting histone deacetylases (HDAC) and the other functionality is capable of inhibiting a different cellular or molecular pathway involved in aberrant cell proliferation, differentiation or survival.

Abstract: The present invention relates to quinazoline containing zinc-binding moiety based derivatives that have enhanced and unexpected properties as inhibitors of epidermal growth factor receptor tyrosine kinase (EGFR-TK) and their use in the treatment of EGFR-TK related diseases and disorders such as cancer. The said derivatives may further act as HDAC inhibitors.

Abstract: The states associated with a programmable state machine are reordered to compress the storage of transitions which define the state machine. To reorder the states, a score is computed and assigned to each of the states. Next, the states are sorted according to their computed scores. In some embodiments, to compute the score for each current state based on the received input symbol, the number of times that the input symbol causes transition to similar states is added. The sum of the scores in each row of the table is representative of the score for the associated current state associated with that row. The states are sorted according to their score and a new state transition table is generated in accordance with the reordered states.

Abstract: The present invention relates to fused bicyclic pyrimidine containing zinc-binding moiety based derivatives that have unique properties as protein tyrosine kinase (PTK) inhibitors and their use in the treatment of PTK related diseases and disorders such as cancer. The said derivatives may further act as HDAC inhibitors.

Abstract: The present invention relates to quinazoline containing zinc-binding moiety based derivatives that have enhanced and unexpected properties as inhibitors of epidermal growth factor receptor tyrosine kinase (EGFR-TK) and their use in the treatment of EGFR-TK related diseases and disorders such as cancer. The said derivatives may further act as HDAC inhibitors.

Abstract: The present invention relates to tyrosine kinase inhibitors that contain a zinc-binding moiety and their use in the treatment of tyrosine related diseases and disorders such as cancer. The said derivatives may further act as HDAC inhibitors.

Abstract: The present invention relates to substituted 2-indolinone containing zinc-binding moiety based derivatives that have enhanced or unique properties as inhibitors of protein tyrosine kinase (PTK) receptors and their use in the treatment of PTK related diseases and disorders such as cancer. The said derivatives may further act as HDAC inhibitors.

Abstract: A method for transcoding a CELP based compressed voice bitstream from source codec to destination codec. The method includes processing a source codec input CELP bitstream to unpack at least one or more CELP parameters from the input CELP bitstream and interpolating one or more of the plurality of unpacked CELP parameters from a source codec format to a destination codec format if a difference of one or more of a plurality of destination codec parameters including a frame size, a subframe size, and/or sampling rate of the destination codec format and one or more of a plurality of source codec parameters including a frame size, a subframe size, or sampling rate of the source codec format exist. The method includes encoding the one or more CELP parameters for the destination codec and processing a destination CELP bitstream by at least packing the one or more CELP parameters for the destination codec.

Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.

Abstract: An architecture for an integrated circuit apparatus and method that allows significant performance improvements for signature based network applications. In various embodiments the architecture allows high throughput classification of packets into network streams, packet reassembly of such streams, filtering and pre-processing of such streams, pattern matching on header and payload content of such streams, and action execution based upon rule-based policy for multiple network applications, simultaneously at wire speed. The present invention is improved over the prior art designs, in performance, flexibility and pattern database size.

Abstract: An architecture for an integrated circuit apparatus and method that allows significant performance improvements for signature based network applications. In various embodiments the architecture allows high throughput classification of packets into network streams, packet reassembly of such streams, filtering and pre-processing of such streams, pattern matching on header and payload content of such streams, and action execution based upon rule-based policy for multiple network applications, simultaneously at wire speed. The present invention is improved over the prior art designs, in performance, flexibility and pattern database size.

Abstract: A method for upgrading one or more security applications, e.g., anti-spam, anti-virus, intrusion detection/prevention. The method includes deriving a second hardware logic from a security knowledge base. The method includes operating a computing system including a security device. The computer system is coupled to the one or more computer networks, e.g., local area networks, wide area networks, Internet. The security device has one or more security logic processors, which include one or more respective first hardware logic. The method transfers an FPGA image representative of at least the second hardware logic through the computer network to one or more first memory devices. The method includes temporarily halting one or more of the security logic processors at a predetermined portion of the stream of information according to a specific embodiment.

Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.

Abstract: An apparatus for processing CELP-based frames includes a first module for extracting a CELP parameter from a source codec, a second module coupled to the first module adapted to interpolate between a CELP parameter of the source codec and a destination codec, the CELP parameter being selected from a group consisting of a frame size, a subframe size, and a sampling rate, a third module coupled to the second module adapted to map the CELP parameter from the source codec to a CELP parameter of the destination codec, a fourth module coupled to the third module adapted to construct a destination output CELP frame based upon the CELP parameter from the destination codec, and a controller coupled the first, second, third and fourth modules, adapted to oversee an operation of the modules, adapted to receive instructions from an external application, and adapted to provide status information to the external application.

Abstract: A programmable finite state machine (FSM) includes, in part, a first address calculation logic block, a first lookup table, a second address calculation logic block, and a second lookup table. The first address calculation logic block generates an address for the first lookup table based on the received input symbol and the current state. The data stored in first look-up table at the generated address is used by the second address calculation logic block to compute an address for the second lookup table. Data stored in the second lookup table is the next state to which the FSM transitions. The programmable FSMs uses redundant information of the transition table to compress these transitions and thus requires a smaller memory while maintaining a high data throughput. The data in the first and second lookup tables are coded and supplied by a compiler. The FSM operation may optionally be pipelined.

Abstract: A first security processing stage performs a first multitude of tasks and a second security processing stage performs a second multitude of tasks. The first and second multitude of tasks may include common tasks. The first security processing stage is a prefilter to the second security processing stage. The input data received as a data stream is first processed by the first security processing stage, which in response, generates one or more first processed data streams. The first processed data streams may be further processed by the second security processing stage or may bypass the second security processing stage. The first security processing stage operates at a speed greater than the speed of the second security processing stage.

Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.

Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.

Abstract: A pattern matching system includes, in part, a multitude of databases each configured to store and supply compressed data for matching to the received data. The system divides each data stream into a multitude of segments and optionally computes a data pattern from the data stream prior to the division into a multitude of segments. Segments of the data pattern are used to define an address for one or more memory tables. The memory tables are read such that the outputs of one or more memory tables are used to define the address of another memory table. If during any matching cycle, the data retrieved from any of the successively accessed memory tables include an identifier related to any or all previously accessed memory tables, a matched state is detected. A matched state contains information related to the memory location at which the match occurs as well as information related to the matched pattern, such as the match location in the input data stream.