The mutation causing the black-and-tan pigmentation phenotype of Mangalitza pigs maps to the porcine ASIP locus but does not affect its coding sequence

The gene for agouti signaling protein (ASIP) is centrally involved in the expression of coat color traits in animals. The Mangalitza pig breed is characterized by a black-and-tan phenotype with black dorsal pigmentation and yellow or white ventral pigmentation. We investigated a Mangalitza x Piétrain cross and observed a coat color segregation pattern in the F2 generation that can be explained by virtue of two alleles at the MC1R locus and two alleles at the ASIP locus. Complete linkage of the black-and-tan phenotype to microsatellite alleles at the ASIP locus on SSC 17q21 was observed. Corroborated by the knowledge of similar mouse coat color mutants, it seems therefore conceivable that the black-and-tan pigmentation of Mangalitza pigs is caused by an ASIP allele a(t), which is recessive to the wild-type allele A. Toward positional cloning of the a(t) mutation, a 200-kb genomic BAC/PAC contig of this chromosomal region has been constructed and subsequently sequenced. Full-length ASIP cDNAs obtained by RACE differed in their 5' untranslated regions, whereas they shared a common open reading frame. Comparative sequencing of all ASIP exons and ASIP cDNAs between Mangalitza and Piétrain pigs did not reveal any differences associated with the coat color phenotype. Relative qRT-PCR analyses showed different dorsoventral skin expression intensities of the five ASIP transcripts in black-and-tan Mangalitza. The a(t) mutation is therefore probably a regulatory ASIP mutation that alters its dorsoventral expression pattern.

The Utilization of Classical Spin Monte Carlo Methods to Simulate the Magnetic Behavior of Extended Three-Dimensional Cubic Networks Incorporating M(II) Ions with an S = 5/2 Ground State Spin

The numerical simulations of the magnetic properties of extended three-dimensional networks containing M(II) ions with an S = 5/2 ground-state spin have been carried out within the framework of the isotropic Heisenberg model. Analytical expressions fitting the numerical simulations for the primitive cubic, diamond, together with (10−3) cubic networks have all been derived. With these empirical formulas in hands, we can now extract the interaction between the magnetic ions from the experimental data for these networks. In the case of the primitive cubic network, these expressions are directly compared with those from the high-temperature expansions of the partition function. A fit of the experimental data for three complexes, namely [(N(CH3)4][Mn(N3)] 1, [Mn(CN4)]n 2, and [FeII(bipy)3][MnII2(ox)3] 3, has been carried out. The best fits were those obtained using the following parameters, J = −3.5 cm-1, g = 2.01 (1); J = −8.3 cm-1, g = 1.95 (2); and J = −2.0 cm-1, g = 1.95 (3).

Bufferless Compression of Asynchronously Sampled ECG Signals in Cubic Hermitian Vector Space.

Asynchronous level crossing sampling analog-to-digital converters (ADCs) are known to be more energy efficient and produce fewer samples than their equidistantly sampling counterparts. However, as the required threshold voltage is lowered, the number of samples and, in turn, the data rate and the energy consumed by the overall system increases. In this paper, we present a cubic Hermitian vector-based technique for online compression of asynchronously sampled electrocardiogram signals. The proposed method is computationally efficient data compression. The algorithm has complexity O(n), thus well suited for asynchronous ADCs. Our algorithm requires no data buffering, maintaining the energy advantage of asynchronous ADCs. The proposed method of compression has a compression ratio of up to 90% with achievable percentage root-mean-square difference ratios as a low as 0.97. The algorithm preserves the superior feature-to-feature timing accuracy of asynchronously sampled signals. These advantages are achieved in a computationally efficient manner since algorithm boundary parameters for the signals are extracted a priori.