Abstract: Collecting data via a display page is disclosed. A data entry field that does not display a current value associated with the data entry field is provided in the display page. A display field configured to display at least a portion of the current value associated with the data entry field is included in the display page selectively, e.g., at a time when a display criteria is satisfied.

Abstract: Pharmaceutical compositions comprising modafinil in the form of particles of defined size and methods for preparing same. The particle size of modafinil can have a significant effect on the potency and safety profile of the drug.

Abstract: A measuring and diluting cup for preparing pharmaceutical doses is provided. The cup comprises an upstanding body having an open mouth and a hollow interior bounded by a sidewall. The cup also has a pharmaceutical measuring compartment. The pharmaceutical measuring compartment is opposite the open mouth and forms a bottom of the hollow interior. The cup also has a diluent measuring compartment which is adjacent the open mouth. The pharmaceutical measuring compartment captures a measured volume smaller than the volume of the diluent measuring compartment, and the pharmaceutical measuring compartment opens to the diluent measuring compartment. The upstanding body is substantially cylindrical and the pharmaceutical measuring compartment has a cylindrical or conical region concentric with the upstanding body. The pharmaceutical measuring compartment has a smaller diameter than the upstanding body.

Abstract: Mixtures of a modafinil compound with a cyclodextrin, methods for their use, and compositions thereof are disclosed, along with complexes comprising a modafinil compound and a cyclodextrin which are taste-masked and suitable for oral consumption in an aqueous solution.

Abstract: Pharmaceutical compositions comprising modafinil in the form of particles of defined size and methods for preparing same. The particle size of modafinil can have a significant effect on the potency and safety profile of the drug.

Abstract: A technique is provided to delete a leaf from a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as a leaf to be deleted. Using the pattern, the tree is walked to identify the location of the leaf to be deleted. The leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. The technique also is applicable to deleting a prefix of a prefix.

Abstract: A method and apparatus are used for finding the longest prefix match in a variable length prefix search when searching a direct table within a routing table structure of a network processor. The search through the routing table structure is expedited by hashing a first segment of an internet protocol address with a virtual private network number followed by concatenating the unhashed bits of the IP address to the result of the hash operation to form an input key. Patterns are compared a bit at a time until an exact match or the best match is found. The search is conducted in a search tree that provides that the matching results will be the best possible match.

Abstract: A method and apparatus for providing hypermedia content maintained remotely on a network to a wireless device without a browser are described. A Short Message Service (SMS) request for Internet-based content is received from the wireless device at a proxy server, via an SMS Center (SMSC). The SMS request is transmitted to the SMSC on a wireless network. The proxy server transcodes the SMS request from a character set of the SMSC to a character set of an application and extracts a keyword from the trancoded request. The proxy server maintains a mapping of keywords to URLs. The proxy server looks up the extracted keyword in the keyword-to-URL mapping to identify the URL of an application associated with the keyword. The proxy server constructs an HTTP POST operation containing the keyword and the URL, and submits the HTTP POST operation to the application over a wireline network such as the Internet.

Abstract: The present invention relates to a method and system for compressing a tree structure. The method of the present invention includes providing a compressed format block for representing a plurality of levels of the tree structure, where the plurality of levels comprises a set of nodes. The method also includes compressing each node in the set of nodes into the compressed format block, such that the plurality of levels is traversed in a single memory access.

Abstract: The present invention relates to a method and system for storing a plurality of multi-field classification rules in a computer system. Each multi-field classification rule includes a rule specification that itself includes a plurality of fields and a plurality of field definitions corresponding to the fields. The method of the present invention includes providing a virtual rule table, where the table stores a plurality of field definitions, and for each of the plurality of multi-field classification rules, compressing the rule specification by replacing at least one field definition with an associated index into the virtual rule table. The method also includes storing each of the compressed rule specifications and the virtual rule table in a shared segment of memory.

Abstract: The present invention relates to a method and system for managing a plurality of multi-field classification rules. The method includes providing a first table that includes a plurality of entries corresponding to a plurality of rules relating to an ingress context and providing a second table that includes a plurality of entries corresponding to a plurality of rules relating to an egress context. The method also includes utilizing the first table and the second table to identify any rules relating to the ingress context and any rules relating to the egress context that match a search key.

Abstract: Novel data structures, methods and apparatus for finding a full match between a search pattern and a pattern stored in a leaf of the search tree. A key is input, a hash function is performed on the key, a direct table (DT) is accessed, and a tree is walked through pattern search control blocks (PSCBs) until reaching a leaf. The search mechanism uses a set of data structures that can be located in a few registers and regular memory, and then used to build a Patricia tree structure that can be manipulated by a relatively simple hardware macro. Both keys and corresponding information needed for retrieval are stored in the Patricia tree structure. The hash function provides an n->n mapping of the bits of the key to the bits of the hash key.

Abstract: Novel data structures, methods and apparatus for finding the longest prefix match search when searching tables with variable length patterns or prefixes. To find the exact match or the best matching prefix, patterns have to be compared a bit at a time until the exact or first: match is found. This requires “n” number of comparisons or memory accesses to identify the closest matching pattern. The trees are built in such a way that the matching result is guaranteed to be a best match, whether it is an exact match or a longest prefix match. Using the trail of all the birds and associated prefix lengths enables determination of the correct prefix result from the trail. By construction, the search tree provides the best matching prefix at or after the first compare during walking of the trail or tree.

Abstract: Pharmaceutical compositions comprising modafinil. The pharmaceutical compositions can have a release profile which is different than that of traditional pharmaceutical compositions of modafinil.

Abstract: Novel data structures, methods and apparatus for finding a full match between a search pattern and a pattern stored in a leaf of the search tree. A key is input, a hash function is performed on the key, a direct table (DT) is accessed, and a tree is walked through pattern search control blocks (PSCBS) until reaching a leaf. The search mechanism uses a set of data structures that can be located in a few registers and regular memory, and then used to build a Patricia tree structure that can be manipulated by a relatively simple hardware macro. Both keys and corresponding information needed for retrieval are stored in the Patricia tree structure. The hash function provides an n->n mapping of the bits of the key to the bits of the hash key. The data structure that is used to store the hash key and the related information in the tree is called a leaf. Each leaf corresponds to a single key that matches exactly with the input key. The leaf contains the key as well as additional information.

Abstract: Compositions of modafinil and methods of treating neurologically related conditions with the administration of modafinil. Also compositions that include modafinil and one or more excipients such as diluents, disintegrants, binders and lubricants.

Abstract: Pharmaceutical compositions comprising modafinil in the form of particles of defined size. The particle size of modafinil can have a significant effect on the potency and safety profile of the drug.

Abstract: In one embodiment, a method for providing proxy based caching services to a client device is provided. The method comprises selectively removing cookies from a message by an origin server to the client device; and caching the removed cookies separately for each unique combination of user identifier and client device identifier in the message.