Abstract: A method for characterizing average performance in a data processing system is provided. This method consists of adding meta-tool level variables to a verification tool. These meta-tool variables keep track, at once, of all concurrent streams of execution that the tool is considering in its reachability analysis. The image of an initial state variable is found and then divided into a frontier of new states and a set of previously reached states. The previously reached states are ignored and the image of the frontier is found. This process continues until the frontier is empty and all possible states have been reached. In one embodiment of the present invention, the probabilities of the paths can be considered by sampling and holding input data using SMV (a model checking tool) variables.

Abstract: A method and system of providing listing recommendations to users of a network-based commerce system including a plurality of listings arranged in a plurality of divisions is described. The method includes identifying a division of the plurality of divisions based on user interaction with the network-based commerce system, and identifying at least one frequently used search term associated with the division. A link is provided to the user to listings associated with the frequently used search term. The search terms may be ranked by retrieving frequently used search terms from a first memory location and determining a number of listings in each division associated with each frequently used search term. Each frequently used search term may then be ranked based on the number of listings in each division.

Abstract: A method and system for transmitting video data are disclosed. The method includes receiving a first video image and comparing the first video image to at least one stock image where each of the stock images is associated with a corresponding index value. If a match between at least a portion of the first video image and one of the at least one stock images is detected, the index value corresponding to the matching stock image is transmitted over a transmission medium. In one embodiment, the method further includes receiving the transmitted index value and generating the corresponding stock image from the index value. The method of may further includes comparing the first video image with a set of stock images. If it is determined that the first image does not match to any of the set of stock images, then a new index value is assigned to the first image and the first image is added to the set of stock images.

Abstract: An apparatus performs a process for partitioning a netlist. The process picks a unique color for each clock and traverses the clock tree coloring the latches in support of that clock tree with that color. The process then colors the fanout logic cones for each latch and notes any coloring collisions. In the case of a multicolored gate, the process retimes the network by moving the terminating latch backwards, towards the collision, to enable single coloring of the gate. The process then performs a depth-first search on the fanout logic of each primary input to the first latch encountered or a primary output. If a primary output is encountered, the path is colored with a color representing the free-run domain. Otherwise, the process colors the path with the color of the terminating latch. Next, the process duplicates the fanin cones for remaining multicolored gates so that a copy of the logic can be incorporated with each independent domain.

Abstract: A coverage analysis process and apparatus assigns a unique label for every unique cycle of data produced by simulation or testing. The labels are substituted for the signal evaluations producing a graph of labels over time. The coverage analysis then generates a function, which represents the graph and the function is stored. The functions are analyzed and compared to determine coverage information. The coverage analysis process and apparatus provides significant data compression and represents the coverage in a form, which can easily be analyzed and compared.

Abstract: A method of verifying a digital circuit in which state transition information is extracted from the output of a non-formal first verification technique. A formal verification tool is then applied to the extracted state transition information to extend the verification coverage of the digital circuit beyond the coverage that is achieved using the first verification technique. In one embodiment, the method includes the initial step of applying a first verification technique such as a simulation technique to a model of the digital circuit. In the preferred embodiment, the application of the formal verification tool comprises applying a model checker to the extracted state transition data to achieve a formal verification of the state machine represented by the state transition diagram. In one embodiment, the extracted state transition information includes a set of data points each representing a present state, a present input, and a next state.

Abstract: The present invention is directed to novel indazolyl-substituted pyrroline compounds of Formula (I): 1

Abstract: A high performance voice transformation apparatus and method is provided in which voice input is transformed into a symbolic representation of phonemes in the voice input. The symbolic representation is used to retrieve output voice segments of a selected target speaker for use in outputting the voice input in a different voice. In addition, voice input characteristics are extracted from the voice input and are then applied to the output voice segments to thereby provide a more realistic human sounding voice output.

Abstract: A method for automatically generating a set of specifications against which a model of the digital circuit can be verified. In one embodiment, the method includes an initial step in which a specification class that corresponds to a type of behavior of the digital circuit is defined. A set of specification formulae that satisfies the defined specification class is then enumerated. Each formula in the set of formulae is then applied to the model of the digital circuit to determine whether the digital circuit satisfies the corresponding formula. The definition of the specification class preferably includes a set of input conditions, a set of output or response conditions, and a temporal component. Preferably, the enumeration of the specification formulae includes all specification formulae that satisfy the specification class. The application of the set of formulae to the model of the digital circuit is preferably achieved with a verification engine such as a model checker.

Abstract: A system and method for compressing data on a computer system is disclosed. The method and system include separating the data into a plurality of segments. The plurality of segments includes a plurality of unique segments. The method and system also include providing a plurality of code words. Each of the plurality of code words corresponds to a unique segment of the plurality of unique segments. The method and system also include providing a representation of the data. The representation includes the plurality of code words for the plurality of segments. The plurality of code words in the representation replaces the plurality of segments. As a result, the data in the representation could be accessed randomly.

Abstract: Methods for the prevention and treatment of colorectal cancer are provided. Specifically, the method relates to the administration of an effective adenoma or microadenoma preventing amount of 6-fluoroursodeoxycholic acid (6-FUDCA) or a pharmaceutically acceptable salt or pharmaceutically acceptable conjugate thereof to a mammal in need of such treatment. The methods find general use in the prevention of the formation of secondary bile acids, the reduction of deoxycholic acid, and the protection against cytotoxic effects of other bioacids and carcinogens.

Abstract: A method for characterizing average performance in a data processing system is provided. This method consists of adding meta-tool level variables to a verification tool. These meta-tool variables keep track, at once, of all concurrent streams of execution that the tool is considering in its reachability analysis. The image of an initial state variable is found and then divided into a frontier of new states and a set of previously reached states. The previously reached states are ignored and the image of the frontier is found. This process continues until the frontier is empty and all possible states have been reached. In one embodiment of the present invention, the probabilities of the paths can be considered by sampling and holding input data using SMV (a model checking tool) variables.

Abstract: An apparatus performs a process for partitioning a netlist. The process picks a unique color for each clock and traverses the clock tree coloring the latches in support of that clock tree with that color. The process then colors the fanout logic cones for each latch and notes any coloring collisions. In the case of a multicolored gate, the process retimes the network by moving the terminating latch backwards, towards the collision, to enable single coloring of the gate. The process then performs a depth-first search on the fanout logic of each primary input to the first latch encountered or a primary output. If a primary output is encountered, the path is colored with a color representing the free-run domain. Otherwise, the process colors the path with the color of the terminating latch. Next, the process duplicates the fanin cones for remaining multicolored gates so that a copy of the logic can be incorporated with each independent domain.

Abstract: The present invention modifies the implementation of the Netscape security model to use an apparatus to set and get extended class data. More specifically, use of the apparatus to store the additional security information for later retrieval at the point where this information would have been written into the Java class data structure, and retrieve this information at the point it would have been read from the Java class data structure. The apparatus is implemented by creating a hash table of objects that store the extended class information. The hash key function uses the original class reference to lookup the classes shadow data structure.

Abstract: A system for conducting surveys to voters in multiple different languages and registering voters is provided over a network, such as the Internet. The system includes a programmed computer system representing at least one network server which provides an addressable voting site and registration site on the network, and a database storing voting information for building surveys in multiple languages and recording the results of the surveys, and registration information for building registration questionnaires and recording the results of the questionnaires. The network server accesses and updates the records of multiple tables of the database through a transaction server connected to the database. In response to a computer of a voter connecting to the network server over the network, the network server determines the language and country of the voter, and then dynamically constructs a survey in the voter's language in accordance with the voting information stored in the database.

Abstract: A system and method for compressing state transition data on a computer system is disclosed. The method and system include separating the state transition data into a plurality of segments and separating each of the plurality of segments into a plurality of subsegments. The method and system further include providing a plurality of code words. Each of the plurality of code words corresponds to a unique subsegment of the plurality of unique subsegments. The method and system also include providing a representation of each segment. The representation of each segment includes a portion of the plurality of code words. The portion of the plurality of code words replaces the plurality of subsegments in each of the plurality of segments. Thus, the present invention allows compressed state transition data to be used without full uncompression, allowing a system to be explicitly checked without substantial loss of information and without consuming memory.

Abstract: A method for compressing files utilizing a dictionary within a data-processing system is disclosed. A binary file commonly available to a data-compressing system during compression and to a data-decompressing system during decompression can be served as a dictionary file. A first dictionary array is initially generated utilizing the dictionary file. Each entry within the first dictionary array includes a set of unique bit patterns from the dictionary file. An input file is parsed into multiple blocks, with each block having the same length as each entry within the first dictionary array. The input file is then compared against the first dictionary array, and each entry within the first dictionary array that includes the same bit patterns as a block from the input file is marked accordingly. A second dictionary array that includes all the marked entries from the first dictionary array is subsequently generated, and this second dictionary array is utilized in the compression of the input file.

Abstract: This invention relates to automotive evaporative emissions canisters. Such structures of this type employ a carbon-filled foam which adds adsorptive performance to the canister without having to enlarge the canister or having to change the carbon in the canister to a higher performance carbon.

Abstract: The base-emitter junction of a bipolar transistor is first forward biased to place the transistor in a state of conduction and the forward bias is then removed. A discharge path is provided for the base-emitter capacitance of the transistor, this path including a source of reverse bias voltage for the base-emitter junction. A sensing circuit indicates when the base-emitter capacitance has discharged through the path sufficiently to permit the base-emitter junction to become reverse biased, which in turn indicates that the transistor has cutoff.

Abstract: A circuit and method for indicating the rise time in switching a transistor on, and the fall time in switching the transistor off. A voltage is produced indicative of the transistor collector current and this voltage is compared with first and second reference voltage levels indicative of 10% and 90% of the maximum collector current. To measure rise time, a pulse counter is started when the 10% level is reached and stopped when the 90% level is reached. To measure fall time, a second pulse counter is started when the 90% level is reached and stopped when the 10% level is reached.