Abstract: Device structures for sheets of light active material. A first substrate has a transparent first conductive layer. A pattern of light active semiconductor elements are fixed to the first substrate. The light active semiconductor elements have an n-side and a p-side. Each light active semiconductor element has either of the n-side or the p-side in electrical communication with the transparent conductive layer. A second substrate has a second conductive layer. An adhesive secures the second substrate to the first substrate so that the other of said n-side or said p-side of each said light active semiconductor element is in electrical communication with the second conductive layer. Thus forming a solid-state light active device.

Abstract: A photo-radiation source for the selective polymerization of photo-radiation-curable organic material. In a first embodiment, a first electrode is provided with a second electrode disposed adjacent to the first electrode, and defining a gap therebetween. A photo-radiation emission layer is disposed in the gap. The photo-radiation emission layer includes a charge-transport matrix material and an emissive particulate dispersed within the charge-transport matrix material. The emissive particulate receives electrical energy through the charge-transport matrix material applied as a voltage to the first electrode and the second electrode photo-radiation. The emissive particulate generates photo-radiation in response to the applied voltage. This photo-radiation is effective for the selective polymerization of photo-radiation curable organic material.

Abstract: A method of making a light active sheet. A bottom substrate having an electrically conductive surface is provided. A hotmelt adhesive sheet is provided. Light active semiconductor elements, such as LED die, are embedded in the hotmelt adhesive sheet. The LED die each have a top electrode and a bottom electrode. A top transparent substrate is provided having a transparent conductive layer. The hotmelt adhesive sheet with the embedded LED die is inserted between the electrically conductive surface and the transparent conductive layer to form a lamination. The lamination is run through a heated pressure roller system to melt the hotmelt adhesive sheet and electrically insulate and bind the top substrate to the bottom substrate.

Abstract: The instructions in a computer program are converted into a form of weakest precondition so as to produce a verification condition that is to be evaluated by a theorem prover. In generating the weakest precondition, labels are introduced for values of variables at control join points. In two preferred embodiments, the computer program is converted into a set of guarded commands prior to the application of weakest precondition operators. In one embodiment, as part of the process of generating the verification condition, assignment commands that assign values to variables are removed from the program through use of a “dynamic single assumption” technique. In another embodiment, the weakest precondition is expressed in terms of strongest postconditions. In both embodiments, a simplified verification condition is produced in which duplications of sets of instructions following a choice operator is avoided.

Abstract: The present invention provides isolated nucleic acid and amino acid sequences of sweet taste receptors comprising two heterologous G-protein coupled receptor polypeptides from the T1R family of sensory G-protein coupled receptors, antibodies to such receptors, methods of detecting such nucleic acids and receptors, and methods of screening for modulators of sweet taste receptors.

Abstract: A tool and method for automatically producing near-optimal code sequences are particularly useful for generating near-optimal code sequences in inner loops, crucial subroutines, and device drivers. As a novel functional and architectural strategy, the invention contemplates applying technologies that would be normally in automatic theorem proving to the problem of automatic code generation. The aspect of the automatic theorem proving is realized by matching followed by planning with satisfiability search. Notably also, the present invention targets a goal-oriented, cycle budget limited code sequence in producing the near-optimal code sequence.

Abstract: The instructions in a computer program are converted into a form of weakest precondition so as to produce a verification condition that is to be evaluated by a theorem prover. In generating the weakest precondition, labels are introduced for values of variables at control join points. In two preferred embodiments, the computer program is converted into a set of guarded commands prior to the application of weakest precondition operators. In one embodiment, as part of the process of generating the verification condition, assignment commands that assign values to variables are removed from the program through use of a “dynamic single assumption” technique. In another embodiment, the weakest precondition is expressed in terms of strongest postconditions. In both embodiments, a simplified verification condition is produced in which duplications of sets of instructions following a choice operator is avoided.

Abstract: The instructions in a computer program are converted into a form of weakest precondition so as to produce a verification condition that is to be evaluated by a theorem prover. In generating the weakest precondition, labels are introduced for values of variables at control join points. In two preferred embodiments, the computer program is converted into a set of guarded commands prior to the application of weakest precondition operators. In one embodiment, as part of the process of generating the verification condition, assignment commands that assign values to variables are removed from the program through use of a “dynamic single assumption” technique. In another embodiment, the weakest precondition is expressed in terms of strongest postconditions. In both embodiments, a simplified verification condition is produced in which duplications of sets of instructions following a choice operator is avoided.

Abstract: A system and method for increasing the speed of operation of a theorem prover relating to program verification using adaptive pattern matching technique is disclosed. Source code in a specific programming language is converted to one or more formulae, each representing a specific reformulation of the source code that facilitates program verification. Each formula derived from the source code is converted into an E-graph which is a particular type of a directed acyclic graph having leaf nodes and interior nodes. Some of the nodes of an E-graph may be related to other nodes through equivalence relationships. Equivalence relationships between a group of nodes is stored in a data structure called an equivalence class. A collection of rules defining the grammar of the programming language is stored in an axiom database. Rules and conjectures can dynamically be added to the axiom database. Each rule or conjecture to be tested is converted into a pattern.

Abstract: A method for facilitating the comparison of two computerized documents. The method includes loading a first document into a random access memory (RAM), loading a second document into the RAM, reducing the first document into a first sequence of tokens, reducing the second document into a second sequence of tokens, converting the first set of tokens to a first (multi)set of shingles, converting the second set of tokens to a second (multi)set of shingles, determining a first sketch of the first (multi)set of shingles, determining a second sketch of the second (multi)set of shingles, and comparing the first sketch and the second sketch. The sketches have a fixed size, independent of the size of the documents. The resemblance of two documents is provided using a sketch of each document. The sketches may be computed fairly fast and given two sketches the resemblance of the corresponding documents can be computed in linear time in the size of the sketches.

Abstract: An integrated reflector lamp includes a sealed envelope enclosing a high pressure gas discharge device. A shell has a rim portion which receives the sealed envelope and an opposing basal portion carrying a screw base. A ballast for igniting and operating the discharge device is enclosed within the shell between the screw base and the sealed envelope. The sealed envelope includes a reflective surface which directs light emitted by the discharge device. The reflective surface also provides effective heat management for preventing overheating of the ballast by the heat generated by the discharge device. The integrated lamp has photometrics and luminous efficacy which exceeds that of corresponding halogen and halogen IR reflector lamps while having an overall planform which fits within that of the corresponding lamp.

Abstract: Using an input device of a computer system, a graphic drawing is defined to include at least one graphic component. The graphic component is subject to a plurality of constraints. At least one of the constraints is redundant with respect to the other constraints. Approximate linear equations are substituted for the constraints. A subset of the equations are selected to determine a converging solution for the redundantly constrained graphic drawing.

Abstract: A high pressure gas discharge lamp system includes a high pressure discharge lamp selected to have a lowest lamp resonant frequency above the audible, on a current basis above about 19 kHz and on a power basis of above about 38 kHz. The ballast circuit energizes the discharge device so as to have a fundamental frequency below the lowest lamp resonant frequency and above the audible, while keeping the magnitude of any harmonics above the lowest lamp resonant frequency sufficiently small so as to avoid acoustic resonance. By operating below the lowest lamp resonant frequency, greatly simplifying ballast construction and cost. According to one embodiment, the discharge vessel encloses a discharge space which is circular cylindrical and having a L:ID ratio of about 1:1 to maximize the lowest lamp resonant frequency.

Abstract: A method for facilitating the comparison of two computerized documents. The method includes loading a first document into a random access memory (RAM), loading a second document into the RAM, reducing the first document into a first sequence of tokens, reducing the second document into a second sequence of tokens, converting the first set of tokens to a first (multi)set of shingles, converting the second set of tokens to a second (multi)set of shingles, determining a first sketch of the first (multi)set of shingles, determining a second sketch of the second (multi)set of shingles, and comparing the first sketch and the second sketch. The sketches have a fixed size, independent of the size of the documents. The resemblance of two documents is provided using a sketch of each document. The sketches may be computed fairly fast and given two sketches the resemblance of the corresponding documents can be computed in linear time in the size of the sketches.

Abstract: A high pressure gas discharge lamp system includes a high pressure discharge lamp selected to have a lowest lamp resonant frequency above the audible, on a current basis above about 19 kHz and on a power basis of above about 38 kHz. The ballast circuit energizes the discharge device so as to have a fundamental frequency below the lowest lamp resonant frequency and above the audible, while keeping the magnitude of any harmonics above the lowest lamp resonant frequency sufficiently small so as to avoid acoustic resonance. By operating below the lowest lamp resonant frequency, greatly simplifying ballast construction and cost. According to one embodiment, the discharge vessel encloses a discharge space which is circular cylindrical and having a L:ID ratio of about 1:1 to maximize the lowest lamp resonant frequency.