Magnetization reversal and exchange bias effects in hard/soft ferromagnetic bilayers with orthogonal anisotropies

21 p.

Visualization by High Resolution Immunoelectron Microscopy of the Transient Receptor Potential Vanilloid-1 at Inhibitory Synapses of the Mouse Dentate Gyrus

We have recently shown that the transient receptor potential vanilloid type 1 (TRPV1), a non-selective cation channel in the peripheral and central nervous system, is localized at postsynaptic sites of the excitatory perforant path synapses in the hippocampal dentate molecular layer (ML). In the present work, we have studied the distribution of TRPV1 at inhibitory synapses in the ML. With this aim, a preembedding immunogold method for high resolution electron microscopy was applied to mouse hippocampus. About 30% of the inhibitory synapses in the ML are TRPV1 immunopositive, which is mostly localized perisynaptically (similar to 60% of total immunoparticles) at postsynaptic dendritic membranes receiving symmetric synapses in the inner 1/3 of the layer. This TRPV1 pattern distribution is not observed in the ML of TRPV1 knock-out mice. These findings extend the knowledge of the subcellular localization of TRPV1 to inhibitory synapses of the dentate molecular layer where the channel, in addition to excitatory synapses, is present.

Distribution of Healthcare resources II.Study and Comparison of a Linear Programming Problem and its Dual. Resolution and Evaluation of a Practical Case and its Programming using Excel and Win QSB.

[EN]This research had as primary objective to model different types of problems using linear programming and apply different methods so as to find an adequate solution to them. To achieve this objective, a linear programming problem and its dual were studied and compared. For that, linear programming techniques were provided and an introduction of the duality theory was given, analyzing the dual problem and the duality theorems. Then, a general economic interpretation was given and different optimal dual variables like shadow prices were studied through the next practical case: An aesthetic surgery hospital wanted to organize its monthly waiting list of four types of surgeries to maximize its daily income. To solve this practical case, we modelled the linear programming problem following the relationships between the primal problem and its dual. Additionally, we solved the dual problem graphically, and then we found the optimal solution of the practical case posed through its dual, following the different theorems of the duality theory. Moreover, how Complementary Slackness can help to solve linear programming problems was studied. To facilitate the solution Solver application of Excel and Win QSB programme were used.

Beyond Q-Resolution and Prenex Form: a Proof System for Quantified Constraint Satisfaction

We consider the quanti fied constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built from conjunction and quanti fication, whether or not the sentence is true on the structure. We present a proof system for certifying the falsity of QCSP instances and develop its basic theory; for instance, we provide an algorithmic interpretation of its behavior. Our proof system places the established Q-resolution proof system in a broader context, and also allows us to derive QCSP tractability results.