The Ventral Premammillary Nucleus Links Fasting-Induced Changes in Leptin Levels and Coordinated Luteinizing Hormone Secretion

Physiological conditions of low leptin levels like those observed during negative energy balance are usually characterized by the suppression of luteinizing hormone (LH) secretion and fertility. Leptin administration restores LH levels and reproductive function. Leptin action on LH secretion is thought to be mediated by the brain. However, the neuronal population that mediates this effect is still undefined. The hypothalamic ventral premammillary nucleus (PMV) neurons express a dense concentration of leptin receptors and project to brain areas related to reproductive control. Therefore, we hypothesized that the PMV is well located to mediate leptin action on LH secretion. To test our hypothesis, we performed bilateral excitotoxic lesions of the PMV in adult female rats. PMV-lesioned animals displayed a clear disruption of the estrous cycle, remaining in anestrus for 15-20 d. After apparent recovery of cyclicity, animals perfused in the afternoon of proestrus showed decreased Fos immunoreactivity in the anteroventral periventricular nucleus and in gonadotropin releasing hormone neurons. PMV-lesioned animals also displayed decreased estrogen and LH secretion on proestrus. Lesions caused no changes in mean food intake and body weight up to 7 weeks after surgery. We further tested the ability of leptin to induce LH secretion in PMV-lesioned fasted animals. We found that complete lesions of the PMV precluded leptin stimulation of LH secretion on fasting. Our findings demonstrate that the PMV is a key site linking changing levels of leptin and coordinated control of reproduction.

Gamma-linolenic acid inhibits both tumour cell cycle progression and angiogenesis in the orthotopic C6 glioma model through changes in VEGF, Flt1, ERK1/2, MMP2, cyclin D1, pRb, p53 and p27 protein expression

Background: Gamma-linolenic acid is a known inhibitor of tumour cell proliferation and migration in both in vitro and in vivo conditions. The aim of the present study was to determine the mechanisms by which gamma-linolenic acid (GLA) osmotic pump infusion alters glioma cell proliferation, and whether it affects cell cycle control and angiogenesis in the C6 glioma in vivo. Methods: Established C6 rat gliomas were treated for 14 days with 5 mM GLA in CSF or CSF alone. Tumour size was estimated, microvessel density (MVD) counted and protein and mRNA expression measured by immunohistochemistry, western blotting and RT-PCR. Results: GLA caused a significant decrease in tumour size (75 +/- 8.8%) and reduced MVD by 44 +/- 5.4%. These changes were associated with reduced expression of vascular endothelial growth factor (VEGF) (71 +/- 16%) and the VEGF receptor Flt1 (57 +/- 5.8%) but not Flk1. Expression of ERK1/2 was also reduced by 27 +/- 7.7% and 31 +/- 8.7% respectively. mRNA expression of matrix metalloproteinase-2 (MMP2) was reduced by 35 +/- 6.8% and zymography showed MMP2 proteolytic activity was reduced by 32 +/- 8.5%. GLA altered the expression of several proteins involved in cell cycle control. pRb protein expression was decreased (62 +/- 18%) while E2F1 remained unchanged. Cyclin D1 protein expression was increased by 42 +/- 12% in the presence of GLA. The cyclin dependent kinase inhibitors p21 and p27 responded differently to GLA, p27 expression was increased (27 +/- 7.3%) while p21 remained unchanged. The expression of p53 was increased (44 +/- 16%) by GLA. Finally, the BrdU incorporation studies found a significant inhibition (32 +/- 11%) of BrdU incorporation into the tumour in vivo. Conclusion: Overall the findings reported in the present study lend further support to the potential of GLA as an inhibitor of glioma cell proliferation in vivo and show it has direct effects upon cell cycle control and angiogenesis. These effects involve changes in protein expression of VEGF, Flt1, ERK1, ERK2, MMP2, Cyclin D1, pRb, p53 and p27. Combination therapy using drugs with other, complementary targets and GLA could lead to gains in treatment efficacy in this notoriously difficult to treat tumour.

X-ray spectrometry: a powerful tool for the measurement of complete fusion of weakly bound nuclei

We describe how the method of detection of delayed K x-rays produced by the electron capture decay of the residual nuclei can be a powerful tool in the investigation of the effect of the breakup process on the complete fusion (CF) cross-section of weakly bound nuclei at energies close to the Coulomb barrier. This is presently one of the most interesting subjects under investigation in the field of low-energy nuclear reactions, and the difficult experimental task of separating CF from the incomplete fusion (ICF) of one of the breakup fragments can be achieved by the x-ray spectrometry method. We present results for the fusion of the (9)Be + (144)Sm system. Copyright (c) 2008 John Wiley & Sons, Ltd.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

Sparse partition universal graphs for graphs of bounded degree

In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Delta. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N(2-1/Delta)log(1/Delta)N) edges, with N = [B`n] for some constant B` that depends only on Delta. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Delta is O(n(2-1/Delta)log(1/Delta)n) Our approach is based on random graphs; in fact, we show that the classical Erdos-Renyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Delta. The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed. (C) 2011 Elsevier Inc. All rights reserved.

New insights on surface-enhanced Raman scattering based on controlled aggregation and spectroscopic studies, DFT calculations and symmetry analysis for 3,6-bi-2-pyridyl-1,2,4,5-tetrazine adsorbed onto citrate-stabilized gold nanoparticles

Asystematic study on the surface-enhanced Raman scattering (SERS) for 3,6-bi-2-pyridyl-1,2,4,5-tetrazine (bptz) adsorbed onto citrate-modified gold nanoparticles (cit-AuNps) was carried out based on electronic and vibrational spectroscopy and density functional methods. The citrate/bptz exchange was carefully controlled by the stepwise addition of bptz to the cit-AuNps, inducing flocculation and leading to the rise of a characteristic plasmon coupling band in the visible region. Such stepwise procedure led to a uniform decrease of the citrate SERS signals and to the rise of characteristic peaks of bptz, consistent with surface binding via the N heterocyclic atoms. In contrast, single addition of a large amount of bptz promoted complete aggregation of the nanoparticles, leading to a strong enhancement of the SERS signals. In this case, from the distinct Raman profiles involved, the formation of a new SERS environment became apparent, conjugating the influence of the local hot spots and charge-transfer (CT) effects. The most strongly enhanced vibrations belong to a(1) and b(2) representations, and were interpreted in terms of the electromagnetic and the CT mechanisms: the latter involving significant contribution of vibronic coupling in the system. Copyright (C) 2010 John Wiley & Sons, Ltd.

Effect of mechanical coating with Ni and Ni-5% Al on the structure and electrochemical properties of the Mg-50% Ni alloy

The Mg-Ni metastable alloys (with amorphous or nanocrystalline structures) are promising candidates for anode application in nickel-metal hydride rechargeable batteries due to its large hydrogen absorbing capacity, low weight, availability, and relative low price. In spite of these interesting features, improvement on the cycle life performance must be achieved to allow its application in commercial products. In the present paper, the effect of mechanical coating of a Mg-50 at.% Ni alloy with Ni and Ni-5 at.% Al on the structure, powder morphology, and electrochemical properties is investigated. The coating additives, Mg-Ni alloy and resulting nanocomposites (i.e., Mg-Ni alloy + additive) were investigated by means of X-ray diffraction and scanning electron microscopy. The Mg-Ni alloy and nanocomposites were submitted to galvanostatic cycles of charge and discharge to evaluate their electrode performances. The mechanical coating with Ni and Ni-5% Al increased the maximum discharge capacity of the Mg-Ni alloy from of 221 to 257 and 273 mA h g(-1), respectively. Improvement on the cycle life performance was also achieved by mechanical coating.

Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem

The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.

From the road network database to a graph for localization purposes

The problems of finding best facility locations require complete and accurate road network with the corresponding population data in a specific area. However the data obtained in road network databases usually do not fit in this usage. In this paper we propose our procedure of converting the road network database to a road graph which could be used in localization problems. The road network data come from the National road data base in Sweden. The graph derived is cleaned, and reduced to a suitable level for localization problems. The population points are also processed in ordered to match with that graph. The reduction of the graph is done maintaining most of the accuracy for distance measures in the network.

Optimization of cable cycles : a trade-off between reliability and cost

This paper elaborates the routing of cable cycle through available routes in a building in order to link a set of devices, in a most reasonable way. Despite of the similarities to other NP-hard routing problems, the only goal is not only to minimize the cost (length of the cycle) but also to increase the reliability of the path (in case of a cable cut) which is assessed by a risk factor. Since there is often a trade-off between the risk and length factors, a criterion for ranking candidates and deciding the most reasonable solution is defined. A set of techniques is proposed to perform an efficient and exact search among candidates. A novel graph is introduced to reduce the search-space, and navigate the search toward feasible and desirable solutions. Moreover, admissible heuristic length estimation helps to early detection of partial cycles which lead to unreasonable solutions. The results show that the method provides solutions which are both technically and financially reasonable. Furthermore, it is proved that the proposed techniques are very efficient in reducing the computational time of the search to a reasonable amount.

Fred: An approach to generating real, correct, reusable programs from proofs

In this paper we describe our system for automatically extracting "correct" programs from proofs using a development of the Curry-Howard process. Although program extraction has been developed by many authors, our system has a number of novel features designed to make it very easy to use and as close as possible to ordinary mathematical terminology and practice. These features include 1. the use of Henkin's technique to reduce higher-order logic to many-sorted (first-order) logic; 2. the free use of new rules for induction subject to certain conditions; 3. the extensive use of previously programmed (total, recursive) functions; 4. the use of templates to make the reasoning much closer to normal mathematical proofs and 5. a conceptual distinction between the computational type theory (for representing programs)and the logical type theory (for reasoning about programs). As an example of our system we give a constructive proof of the well known theorem that every graph of even parity, which is non-trivial in the sense that it does not consist of isolated vertices, has a cycle. Given such a graph as input, the extracted program produces a cycle as promised.

Perspective: LaGuardia Community College Newsletter Vol. 1, No. 5

A newsletter published periodically to keep the faculty, students, staff, and community informed about the activities taking place on the campus of LaGuardia Community College. Cover article: SONY SHIFT SCHEDULED SOON, SPOKESMAN SAYS. Other entries include: CUNY TEACHING EXCELLENCE AWARD TO PROFESSOR MILLER; CHILD CARE LEAVE ADOPTED BY BHE; NINETY SENIOR CITIZENS RECEIVE CERTIFICATES; COLLEGE COMMENCEMENT TO BE HELD AT QUEENS COLLEGE AUDITORIUM; DEAN PALMER TO SING AT SEPT. 16, COMMENCEMENT; FOUR MORE PARAPROFESSIONALS COMPLETE DEGREES.”

On the welfare costs of business-cycle fluctuations and economic-growth variation in the 20th century

Lucas (1987) has shown a surprising result in business-cycle research: the welfare cost of business cycles are very small. Our paper has several original contributions. First, in computing welfare costs, we propose a novel setup that separates the effects of uncertainty stemming from business-cycle fluctuations and economic-growth variation. Second, we extend the sample from which to compute the moments of consumption: the whole of the literature chose primarily to work with post-WWII data. For this period, actual consumption is already a result of counter-cyclical policies, and is potentially smoother than what it otherwise have been in their absence. So, we employ also pre-WWII data. Third, we take an econometric approach and compute explicitly the asymptotic standard deviation of welfare costs using the Delta Method. Estimates of welfare costs show major differences for the pre-WWII and the post-WWII era. They can reach up to 15 times for reasonable parameter values -β=0.985, and ∅=5. For example, in the pre-WWII period (1901-1941), welfare cost estimates are 0.31% of consumption if we consider only permanent shocks and 0.61% of consumption if we consider only transitory shocks. In comparison, the post-WWII era is much quieter: welfare costs of economic growth are 0.11% and welfare costs of business cycles are 0.037% - the latter being very close to the estimate in Lucas (0.040%). Estimates of marginal welfare costs are roughly twice the size of the total welfare costs. For the pre-WWII era, marginal welfare costs of economic-growth and business- cycle fluctuations are respectively 0.63% and 1.17% of per-capita consumption. The same figures for the post-WWII era are, respectively, 0.21% and 0.07% of per-capita consumption.