Abstract: The invention relates to elastic expanded polymer foams and also a process for producing expanded polymer foams by sintering a mixture comprising foam particles P1 and P2 composed of different thermoplastic polymers or polymer blends, wherein the foam particles P1 are obtained by prefoaming expandable, thermoplastic polymer particles comprising A) from 45 to 97.9 percent by weight of a styrene polymer, B1) from 1 to 45 percent by weight of a polyolefin having a melting point in the range from 105 to 140° C., B2) from 0 to 25 percent by weight of a polyolefin having a melting point below 105° C., C1) from 0.1 to 25 percent by weight of a styrene-butadiene or styrene-isoprene block copolymer, C2) from 0.0 to 10 percent by weight of a styrene-ethylene-butylene block copolymer, D) from 1 to 15 percent by weight of a blowing agent, E) from 0 to 5 percent by weight of a nucleating agent, where the sum of A) to E) is 100% by weight.

Abstract: Expandable, thermoplastic polymer bead material composed of a multiphase polymer mixture which comprises blowing agent and has at least one continuous phase of a thermoplastic polymer, where at least two different disperse phases P1 and P2 are present, disperse in the continuous phase, and also to processes for its production, and to use for the production of elastic molded foams.

Abstract: A flame retardant comprising a) at least one sulfur compound of the formula (I) A1-(Z1)m—(S)n—(Z2)p-A2??(I) where the definitions of the symbols and indices are as follows: A1 and A2 are identical or different, being C6-C12-aryl, cyclohexyl, Si(ORa)3, a saturated, partially unsaturated, or aromatic, mono- or bicyclic ring having from 3 to 12 ring members and comprising one or more heteroatoms from the group of N, O, and S, where the system is unsubstituted or has substitution by one or more substituents of the group of O, OH, S, SH, COORb, CONRcRd, C1-C18-alkyl, C1-C18-alkoxy, C1-C18-thioalkyl, C6-C12-aryl, C6-C12-aryloxy, C2-C18-alkenyl, C2-C18-alkenoxy, C2-C18-alkynyl, and C2-C18-alkinoxy; Z1 and Z2 are identical or different, being —CO— or —CS—; Ra is C1-C18-alkyl; Rb, Rc, and Rd are identical or different, being H, C1-C18-alkyl, C6-C12-aryl, or an aromatic, mono- or bicyclic ring having from 3 to 12 ring members and comprising one or more heteroatoms from the group of N, O, and S; m and p are

Abstract: Phosphine sulfide derivatives of the formula (I), S?PR1R2R3??(I) are suitable as flame retardants, in particular for polymers, where the definitions of the symbols in the formula (I) are as follows: R1 and R2 are identical or different, being C1-C12-alkyl, C3-C8-cycloalkyl, which may have no substitution or may have one or more C1-C4-alkyl groups as substituents, C2-C12-alkenyl, C2-C12-alkynyl, C6-C10-aryl, or C8-C10-aryl-C1-C4-alkyl; R3 is H, SH, SR4, OH, OR5 or a —(Y1)n—[P(?X1)R6—(Y2)n]m—P(?X2)R7R8 group; or two groups R1, R2, R3 form, together with the phosphorus atom bonded thereto, a ring system; X1 and X2 are identical or different, being O or S; Y1 and Y2 are identical or different, being O or S; R4, R5, R6, R7 and R8 are identical or different, being independently from one another C1-C12-alkyl, C3-C8-cycloalkyl, which may have no substitution or may have one or more C1-C4-alkyl groups as substituents, C2-C12-alkenyl, C2-C12-alkynyl, C6-C10-aryl, or C6-C10-aryl-C1-C4-alkyl; n is 1 if Y1 and, respec

Abstract: A polymer foam with density in the range from 5 to 120 kg/m3, comprising a) a polymer component, comprising at least one styrene polymer, b) from 0.

Abstract: A method, system and computer program product for reversing effects of reparameterization is disclosed. The method comprises receiving an original design, an abstracted design, and a first trace over the abstracted design. One or more conditional values are populated into the first trace over the abstracted design, and a k-step satisfiability check is cast to obtain a second trace. One or more calculated values are concatenated to an initial gate set in the second trace with one or more established values to a generated subset of the initial design in the abstracted trace to form a new trace, and one or more effects of a reparameterization are reversed by returning the new trace over the initial design.

Abstract: A method, system and computer program product for reversing effects of reparameterization is disclosed. The method comprises receiving an original design, an abstracted design, and a first trace over the abstracted design. One or more conditional values are populated into the first trace over the abstracted design, and a k-step satisfiability check is cast to obtain a second trace. One or more calculated values are concatenated to an initial gate set in the second trace with one or more established values to a generated subset of the initial design in the abstracted trace to form a new trace, and one or more effects of a reparameterization are reversed by returning the new trace over the initial design.

Abstract: Expandable, thermoplastic polymer bead material, comprising A) from 45 to 98.8 percent by weight of a styrene polymer, B1) from 1 to 45 percent by weight of a polyolefin whose melting point is in the range from 105 to 140° C., B2) from 0 to 25 percent by weight of a polyolefin whose melting point is below 105° C., C1) from 0.1 to 9.9 percent by weight of a styrene-butadiene block copolymer, C2) from 0.1 to 9.9 percent by weight of a styrene-ethylene-butylene block copolymer, D) from 1 to 15 percent by weight of a blowing agent, E) from 0 to 5 percent by weight of a nucleating agent where the entirety of A) to E) gives 100% by weight, and also processes for production of the same, and use for the production of elastic molded-foam moldings.

Abstract: A method, system, and computer program product for preserving critical inputs. According to an embodiments of the present invention, an initial design including one or more primary inputs which cannot be eliminated, one or more primary inputs which can be eliminated, one or more targets, and one or more state elements are received. A cut of said initial design including one or more cut gates is identified, and a relation of one or more values producible to said one or more cut gates in terms of said one or more primary inputs which cannot be eliminated, said one or more primary inputs which can be eliminated and said one or more state elements is computed. Said relation is synthesized to form a gate set, and an abstracted design is formed from said gate set. Verification is performed on said abstracted design to generate verification results.

Abstract: A method, system and computer program product for building decision diagrams efficiently in a structural network representation of a digital circuit using a dynamic resource constrained and interleaved depth-first-search and modified breadth-first-search schedule is disclosed. The method includes setting a first size limit for a first set of one or more m-ary decision representations describing a logic function and setting a second size limit for a second set of one or more m-ary decision representations describing a logic function. The first set of m-ary decision representations of the logic function is then built with one of the set of a depth-first technique or a breadth-first technique until the first size limit is reached, and a second set of m-ary decision representations of the logic function is built with the other technique until the second size limit is reached.

Abstract: Methods and systems are provided for reducing an original circuit design into a simplified circuit design by merging gates that may not be equivalent but can be demonstrated to preserve target assertability with respect to the original circuitry design. A composite netlist is created from the simplified netlist and the original netlist. The composite netlist includes a number of targets that imply the existence of a target in the simplified netlist and a corresponding target in the original netlist. The implications are verified and then validated to ensure the simplied circuit design is a suitable replacement for the original circuit design.

Abstract: A method, system and computer program product for building decision diagrams efficiently in a structural network representation of a digital circuit using a dynamic resource constrained and interleaved depth-first-search and modified breadth-first-search schedule is disclosed. The method includes setting a first size limit for a first set of one or more m-ary decision representations describing a logic function and setting a second size limit for a second set of one or more m-ary decision representations describing a logic function. The first set of m-ary decision representations of the logic function is then built with one of the set of a depth-first technique or a breadth-first technique until the first size limit is reached, and a second set of m-ary decision representations of the logic function is built with the other technique until the second size limit is reached.

Abstract: A method, system and computer program product for X-Saturated ternary simulation based reduction. An X-Saturated ternary simulation (XSTS) utility, which executes on a computer system, receives design information, where the design information includes a netlist. The XSTS utility initializes one or more data structures and/or variables and simulates, in a ternary fashion, the netlist at a time value by applying logical X values to all RANDOM gates of the netlist and to registers marked X_SATURATED. For each register of the netlist XSTS utility: determines whether or not the register departs from its expected prefix behavior, and if the register departs from its expected prefix behavior, the register is marked as X_SATURATED and the current state is updated with an X value upon the register. XSTS utility can store the current state in a data structure and can use the information from the data structure to simplify the design.

Abstract: Methods, systems and software products are provided to enhance the scalability of dependent state analysis element identification. In a method of partitioning a model representing a state machine, a variable is selected from the variables of the model, and a first set of variables are identified that support the selected variable. Then a second set of variables is identified that have overlapping support of the first set of variables. The second set of variables is a partition suitable for use in determining an overapproximation of the reachable states of the selected variable.

Abstract: A method, system and computer program product for performing synthesis of representations is disclosed. The method comprises receiving a representation of a relation and building a gate representing an OR function of one or more selected parent paths into a node of said representation of said relation. A synthesized gate for said gate representing said OR function and synthesis of a set of representations of relations by iterating said building step and said creating step over one or more variables in said representation of said relation is performed to accumulate a synthesized gate set, which synthesized gate set is returned.

Abstract: The invention relates to a method for the non-therapeutic treatment of pigs for the purpose of reducing the conversion ratio of the feed used to raise the pigs and/or for increasing the growth rate of the pigs. The treatment comprises orally administering at least one glycine compound to the pigs, which glycine compound corresponds to the following formula (I) or to a salt or an ester thereof: wherein R1 and R2 are independently an alkyl, an alkenyl or a hydroxyalkyl radical containing 1 to 18, preferably 1 to 6 carbon atoms or wherein R1 and R2 form jointly together with the N atom a heterocyclic 5- or 6-membered ring. The glycine compound is preferably N,N-dimethylglycine (DMG).

Abstract: A method, system and computer program product for integrating implication-based analysis and equivalent gate analysis to maintain transitive reduction in an implication graph over a sequence of graph operations. One or more gates of a design are identified that are equivalent in all reachable states. Equivalent gates are assigned to an equivalence class when all gates within the equivalence class are equal. During the implication-based analysis the system determines when one or more implication paths are associated with the one or more equivalence classes, and an implication is generated at the implication path associated with the equivalence classes. A transitively reduced graph is received depicting the implications and equivalence classes of the design. When one or more operations are assigned to the transitively reduced graph, the graph is automatically adjusted to maintain transitive reduction.

Abstract: A method, system and computer program product for performing synthesis of representations is disclosed. The method comprises receiving a representation of a relation and building a gate representing an OR function of one or more selected parent paths into a node of said representation of said relation. A synthesized gate for said gate representing said OR function and synthesis of a set of representations of relations by iterating said building step and said creating step over one or more variables in said representation of said relation is performed to accumulate a synthesized gate set, which synthesized gate set is returned.

Abstract: A method, system and computer program product for building decision diagrams efficiently in a structural network representation of a digital circuit using a dynamic resource constrained and interleaved depth-first-search and modified breadth-first-search schedule is disclosed. The method includes setting a first size limit for a first set of one or more m-ary decision representations describing a logic function and setting a second size limit for a second set of one or more m-ary decision representations describing a logic function. The first set of m-ary decision representations of the logic function is then built with one of the set of a depth-first technique or a breadth-first technique until the first size limit is reached, and a second set of m-ary decision representations of the logic function is built with the other technique until the second size limit is reached.

Abstract: A method, system and computer program product for building decision diagrams efficiently in a structural network representation of a digital circuit using a dynamic resource constrained and interleaved depth-first-search and modified breadth-first-search schedule is disclosed. The method includes setting a first size limit for a first set of one or more m-ary decision representations describing a logic function and setting a second size limit for a second set of one or more m-ary decision representations describing a logic function. The first set of m-ary decision representations of the logic function is then built with one of the set of a depth-first technique or a breadth-first technique until the first size limit is reached, and a second set of m-ary decision representations of the logic function is built with the other technique until the second size limit is reached.