Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Lakshman, NJ

Jan Parthiban Lakshman, Cedar Knolls, NJ US

Patent application numberDescriptionPublished
20110086096MODIFIED RELEASE 1- [ (3-HYDROXY-ADAMANT-1-YLAMINO)-ACETYL] -PYRROLIDINE-2 (S) -CARBONITRILE FORMULATION - The subject invention provides a pharmaceutical tablet formulation comprising per unit dosage form e.g. per tablet the following ingredients: 04-14-2011

Jay Lakshman, Cedar Knolls, NJ US

Patent application numberDescriptionPublished
20100152299Process for making compositions with poorly compressible therapeutic compounds - A process for preparing solid dosage forms that contain poorly compressible therapeutic compound. The process, for example, provides for the inventive use of an extruder, especially a twin screw extruder, to melt granulate a therapeutic compound(s) with a granulation excipient.06-17-2010

Jay P. Lakshman, Cedar Knolls, NJ US

Patent application numberDescriptionPublished
20100021539Modified Release 1-[(3-Hydroxy-Adamant-1-Ylamino)-Acetyl]-Pyrrolidine-2(S)-Carbonitrile Formulation - The subject invention provides a pharmaceutical tablet formulation comprising per unit dosage form e.g. per tablet the following ingredients: 01-28-2010

Jay P. Lakshman, Bridgewater, NJ US

Patent application numberDescriptionPublished
20100209480GALENICAL FORMULATIONS OF ORGANIC COMPOUNDS - The present invention relates to a pharmaceutical oral fixed dose combination comprising 08-19-2010
20110037185CONTINUOUS PROCESS FOR MAKING PHARMACEUTICAL COMPOSITIONS - A process for manufacturing solid oral dosage forms in an equipment train that comprises multiple pieces of apparatus designed for unit operations, such as blending, extruding, cooling, milling and finishing. The equipment in the equipment train allow for the transfer of raw materials and intermediate-processed materials from one apparatus to the next using transfer means, for example, gravity, vacuum, belts, and the like.02-17-2011

Mahesh K. Lakshman, Hackensack, NJ US

Patent application numberDescriptionPublished
20100179312CONVERTIBLE NUCLEOSIDE DERIVATIVES - The present invention is directed to convertible nucleosides and polymer supported convertible nucleosides for use in SNAP displacement reactions. The convertible nucleosides can be used to synthesize numerous substituted purine and pyrimidine derivatives.07-15-2010

Tirunell Lakshman, Morganville, NJ US

Patent application numberDescriptionPublished
20110016119SYSTEM AND METHOD FOR MANAGING USER PROFILES - The present invention relates to a system and method for managing user profiles based on keyword content associated with a user. The user associated keyword content represents a website requested by the user or video data viewed by the user, in which the user profile is created and maintained at the customer premise equipment as opposed to the network infrastructure associated with the service provider. For example, the system includes a customer premise equipment (CPE) configured to create a user profile. The user profile includes at least one keyword representing keyword content associated with the user and at least one score representing importance of a corresponding keyword.01-20-2011
20110029374DYNAMIC AD SCHEDULING METHOD FOR IMPROVING UTILITY IN INTERACTIVE TV ENVIRONMENT - Example embodiments provide scheduling a plurality of ads to be shown to a plurality of viewers of a multimedia network. One example embodiment includes determining target view rates for each of the plurality of ads based on expected revenue associated with each of the plurality of ads, determining, for each of the plurality of ads, a queue value based on a target view rate and an actual view rate associated with the ad, the actual view rate being a number of views of the ad in a previous time slot, and selectively showing ads, from among the plurality of ads, to the plurality of viewers based on the queue values.02-03-2011
20110035277SYSTEM FOR SCHEDULING ADVERTISEMENTS AND METHOD THEREOF - The system for scheduling advertisements includes at least one ad bidder and an ad scheduler. The ad bidder is configured to receive bidding information for a plurality of ads from one or more advertisers. The bidding information for each ad includes at least one target profile information and a bid associated with the target profile information. The bid indicates expected revenue for showing the ad to a viewer having actual profile information corresponding to the target profile information associated with the bid. The ad scheduler is configured to schedule which of the plurality of ads is received by which of a plurality of viewers based on the actual profile information of the plurality of viewers and the bidding information such that an ad scheduled for one of the plurality of viewers is influenced by a correspondence of the scheduled ad to others of the plurality of viewers.02-10-2011

Tirunell V. Lakshman, Eatontown, NJ US

Patent application numberDescriptionPublished
20100269024METHOD AND APPARATUS FOR MULTISET MEMBERSHIP TESTING USING COMBINATORIAL BLOOM FILTERS - A method and apparatus providing improved set membership determination and group membership identification of candidate data elements using a single Bloom filter programmed to provide a plurality of non-zero f-bit binary vectors, where each of the f-bit binary vectors is associated with a respective group. The Bloom filter is programmed using one or more (but not all) of a plurality of hash filter sets.10-21-2010
20100329133NETWORK DETECTION OF REAL-TIME APPLICATIONS USING INCREMENTAL LINEAR REGRESSION - Method and apparatus using incremental linear regression to derive a traffic flow signature indicative of a particular application within a packet stream.12-30-2010

T.v. Lakshman, Morganville, NJ US

Patent application numberDescriptionPublished
20100316051PACKET PROCESSING USING BRAIDED TRIES - Packets are processed (e.g., routed or classified) in accordance with a braided trie, which represents the combination of two or more different original tries (e.g., representing different forwarding/classification tables). The different tries are combined by twisting the mappings for specific trie nodes to make the shapes of the different tries more similar. Each node in the braided trie contains a braiding bit for at least one original trie indicating the mapping for that trie's node. Trie braiding can significantly reduce the number of nodes used to represent the different original tries, thereby reducing memory usage and improving scalability. Braided tries can be used for such applications as virtual routers and packet classification in which different forwarding/classification tables are represented by a single braided trie stored in shared memory.12-16-2010
20100322255PROVIDING CLOUD-BASED SERVICES USING DYNAMIC NETWORK VIRTUALIZATION - The invention is directed to providing cloud-based services using dynamic network virtualization. Embodiments of the invention provide a cloud-based service over a system that has a dynamic network virtualization architecture. The architecture includes a set of distributed forwarding elements with centralized control, and at least one virtual machine that is bound to one of the forwarding elements. These features enable the virtual machine to be migrated across a wide area network while maintaining its original IP address and service continuity.12-23-2010
20110075571DISTRIBUTED VIRTUAL HOME AGENT FOR MOBILE INTERNET PROTOCOL - The present invention provides a method and apparatus for a distributed virtual home agent. One embodiment of the method includes implementing a first primary home agent on a first portion of a plurality of hardware elements that operate according to a mobile Internet Protocol (IP) and a second primary home agent on a second portion of the plurality of hardware elements. A first backup home agent is implemented on the second portion of the plurality of hardware elements and a second backup home agent is implemented on the first portion of the plurality of hardware elements. Packets addressed to the first or second primary home agent can be directed to both the first and second portions of the plurality of hardware elements so that states of the first and second backup home agents mirror states of the first and second primary home agents, respectively.03-31-2011
20110090911METHOD AND APPARATUS FOR TRANSPARENT CLOUD COMPUTING WITH A VIRTUALIZED NETWORK INFRASTRUCTURE - A capability is provided for providing transparent cloud computing with a virtualized network infrastructure. A method for enabling use of a resource of a data center as an extension of a customer network includes receiving, at a forwarding element (FE), a packet intended for a virtual machine hosted at an edge domain of the data center, determining a VLAN ID of the VLAN for the customer network in the edge domain, updating the packet to include the VLAN ID of the VLAN for the customer network in the edge domain, and propagating the updated packet from the FE toward virtual machine. The edge domain supports a plurality of VLANs for a respective plurality of customer networks. The packet includes an identifier of the customer network and a MAC address of the virtual machine. The VLAN ID of the VLAN for the customer network in the edge domain is determined using the identifier of the customer network and the MAC address of the virtual machine. The FE may be associated with the edge domain at which the virtual machine is hosted, an edge domain of the data center that is different than the edge domain at which the virtual machine is hosted, or the customer network. Depending on the location of the FE at which the packet is received, additional processing may be provided as needed.04-21-2011
20110137930METHOD AND APPARATUS FOR GENERATING A SHAPE GRAPH FROM A BINARY TRIE - A capability is provided for representing a set of data values using data structures, including converting a binary trie data structure representing the set of data values to a shape graph data structure representing the set of data values. The shape graph data structure is generated from the binary trie data structure based on the shapes of the sub-trees rooted at the nodes of the binary trie data structure. The shape graph includes vertices representing shapes of the sub-trees of the binary trie data structure. A shape graph data structure permits operations similar to the operations that may be performed on the binary trie data structure for performing lookups for data values from the set of data values, while at the same time reducing the structural redundancy of the binary trie data structure such that the shape graph data structure provides significant improvements in memory usage over the binary trie data structure.06-09-2011

T. V. Lakshman, Morganville, NJ US

Patent application numberDescriptionPublished
20110044201LINE-RATE, REAL-TIME-TRAFFIC DETECTOR - A line-rate, real-time-traffic detector classifies a network traffic flow as real-time when it determines the smoothness of the packet arrival rate of the network traffic flow is bounded by an empirically derived bound. In some embodiments, to improve performance, a tighter smoothness bound is applied to the smoothness calculations performed on a first set of packet arrival times, while a looser smoothness bound is applied to a second set of packet arrival times, the second set inclusive of and larger than the first.02-24-2011