Samarium(III) fluoride

Samarium(III) fluoride (SmF₃) is a slightly hygroscopic solid fluoride. At room temperature, it has orthorhombic structure with space group Pnma – β-YF₃ type with lattice constants a = 666,9 pm, b = 705,9 pm, c = 440,5 pm. Above 495 °C, it has the rhombohedral LaF₃ structure (space group P3cl) – with lattice constants a = 707, c = 724 pm.

Conditions/substances to avoid are: open flame, moisture, strong acids.

References

SMF 120.9

The SMF 120 Subtype 9 is a new SMF record made available IBM's WebSphere Application Server for z/OS Version 7. Its design is based on customer feedback regarding the data required when operating WAS z/OS. The previous WAS z/OS SMF records were Subtypes 1, 3, 5, 6, 7 and 8. Those subtypes continue to exist, but Subtype 9 may be viewed as a replacement.

The shorthand way of referring to SMF 120 Subtype 9 is SMF 120.9.

The SMF 120.9 was provided to address two shortcomings in the previous SMF design for WAS z/OS:

The SMF 120.9 activity record is based on a per request design. There is no longer any need to correlate data points across records to determine statistical information per request. The information contained in an SMF 120.9 record contains the data for each request.

The overhead of turning on SMF 120.9 has been measured at approximately 1.5% of system CPU for the basic activity records.

SMF

SMF may refer to:

Organizations

Entertainment

PCP

PCP may refer to:

Computing

Medicine and pharmaceutics

Politics

Probabilistically checkable proof

In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. The algorithm is then required to accept correct proofs and reject incorrect proofs with very high probability. A standard proof (or certificate), as used in the verifier-based definition of the complexity class NP, also satisfies these requirements, since the checking procedure deterministically reads the whole proof, always accepts correct proofs and rejects incorrect proofs. However, what makes them interesting is the existence of probabilistically checkable proofs that can be checked by reading only a few bits of the proof using randomness in an essential way.

Probabilistically checkable proofs give rise to many complexity classes depending on the number of queries required and the amount of randomness used. The class PCP[r(n),q(n)] refers to the set of decision problems that have probabilistically checkable proofs that can be verified in polynomial time using at most r(n) random bits and by reading at most q(n) bits of the proof. Unless specified otherwise, correct proofs should always be accepted, and incorrect proofs should be rejected with probability greater than 1/2. The PCP theorem, a major result in computational complexity theory, states that PCP[O(log n),O(1)] = NP.

Peruvian Communist Party

The Peruvian Communist Party (in Spanish: Partido Comunista Peruano) is a communist party in Peru. It was founded in 1928 by José Carlos Mariátegui, under the name Partido Socialista del Perú (Socialist Party of Peru). In 1930 the name was changed to PCP. PCP is often identified as PCP [Unidad], to separate it from the Communist Party of Peru.

Jorge Del Prado was the general secretary between 1966 and 1991. In 1980 the PCP and other left-wing groups formed the United Left.

The main political base of the PCP is currently located at Plaza Ramón Castilla, Lima and is led by Roberto De La Cruz Huama. PCP publishes Unidad (Unity) and Nuestra Bandera (Our Flag).

In the 2011 general election the party took part in the successful Peru Wins alliance of Ollanta Humala.

See also

External links