Pathway-specific targeting of GAB(A) a receptor subtypes to somatic and dendritic synapses in the central amygdala

Neurons in the central amygdala express two distinct types of ionotropic GABA receptor. One is the classical GABA(A) receptor that is blocked by low concentrations of bicuculline and positively modulated by benzodiazepines. The other is a novel type of ionotropic GABA receptor that is less sensitive to bicuculline but blocked by the GABA(C) receptor antagonist (1,2,5,6-tetrohydropyridine-4-yl) methylphosphinic acid (TPMPA) and by benzodiazepines. In this study, we examine the distribution of these two receptor types. Recordings of GABAergic miniature inhibitory postsynaptic currents (mIPSCs) showed a wide variation in amplitude. Most events had amplitudes of 100 pA. Large-amplitude events also had rise times faster than small-amplitude events. Large-amplitude events were fully blocked by 10 muM bicuculline but unaffected by TPMPA. Small amplitude events were partially blocked by both bicuculline and TPMPA. Focal application of hypertonic sucrose to the soma evoked large-amplitude mIPSCs, whereas focal dendritic application of sucrose evoked small-amplitude mIPSCs. Thus inhibitory synapses on the dendrites of neurons in the central amygdala express both types of GABA receptor, but somatic synapses expressed purely GABA(A) receptors. Minimal stimulation revealed that inhibitory inputs arising from the laterally located intercalated cells innervate dendritic synapses, whereas inhibitory inputs of medial origin innervated somatic inhibitory synapses. These results show that different types of ionotropic GABA receptors are targeted to spatially and functionally distinct synapses. Thus benzodiazepines will have different modulatory effects on different inhibitory pathways in the central amygdala.

Proteomic analysis of normal and malignant prostate tissue to identify novel proteins lost in cancer

BACKGROUND. Alterations of important protein pathways, including loss of prostate secretory granules, and disruption of the prostatic secretory pathway have been identified as early events in malignancy. In this study, proteomics was used to map the differences in protein expression between normal and malignant prostate tissues and to identify and analyze differentially expressed proteins in human prostate tissue with particular regard to the proteins lost in malignancy. METHODS. Small quantities of normal and malignant prostate tissue were taken fresh from 34 radical prostatectomy cases. After histological examination, proteins were solubilized from selected tissues and separated using two-dimensional electrophoresis. Using image analysis, the proteome of normal and malignant tissues were mapped and differentially expressed proteins (present in normal and absent in malignant tissue) were identified and subsequently analyzed using peptide mass finger printing and N-terminal sequencing. Western blotting and immunohistochemistry were performed to examine expression profiles and tissue localization of candidate proteins. RESULTS. Comparison of protein maps of normal and malignant prostate were used to identify 20 proteins which were lost in malignant transformation, including prostate specific antigen (PSA), alpha-l antichymotrypsin (ACT), haptoglobin, and lactoylglutathione lyase. Three of the 20 had not previously been reported in human prostate tissue (Ubiquitin-like NEDD8, calponin, and a follistatin-related protein). Western blotting confirmed differences in the expression profiles of NEDD8 and calponin, and immunohistochemistry demonstrated differences in the cellular localization of these two proteins in normal and malignant prostate glands. CONCLUSIONS. The expression of NEDD8, calponin, and the follistatin-related protein in normal prostate tissues is a novel finding and the role of these important functional proteins in normal prostate and their loss or reduced expression in prostate malignancy warrants further investigations. (C) 2002 Wiley-Liss, Inc.

An equivalent algorithm for simulating thermal effects of magma intrusion problems in porous rocks

An equivalent algorithm is proposed to simulate thermal effects of the magma intrusion in geological systems, which are composed of porous rocks. Based on the physical and mathematical equivalence, the original magma solidification problem with a moving boundary between the rock and intruded magma is transformed into a new problem without the moving boundary but with a physically equivalent heat source. From the analysis of an ideal solidification model, the physically equivalent heat source has been determined in this paper. The major advantage in using the proposed equivalent algorithm is that the fixed finite element mesh with a variable integration time step can be employed to simulate the thermal effect of the intruded magma solidification using the conventional finite element method. The related numerical results have demonstrated the correctness and usefulness of the proposed equivalent algorithm for simulating the thermal effect of the intruded magma solidification in geological systems. (C) 2003 Elsevier B.V. All rights reserved.

Virtual models of the HLA class I antigen processing pathway

Antigen recognition by cytotoxic CD8 T cells is dependent upon a number of critical steps in MHC class I antigen processing including proteosomal cleavage, TAP transport into the endoplasmic reticulum, and MHC class 1 binding. Based on extensive experimental data relating to each of these steps there is now the capacity to model individual antigen processing steps with a high degree of accuracy. This paper demonstrates the potential to bring together models of individual antigen processing steps, for example proteosome cleavage, TAP transport, and MHC binding, to build highly informative models of functional pathways. In particular, we demonstrate how an artificial neural network model of TAP transport was used to mine a HLA-binding database so as to identify H LA-binding peptides transported by TAP. This integrated model of antigen processing provided the unique insight that HLA class I alleles apparently constitute two separate classes: those that are TAP-efficient for peptide loading (HLA-B27, -A3, and -A24) and those that are TAP-inefficient (HLA-A2, -B7, and -B8). Hence, using this integrated model we were able to generate novel hypotheses regarding antigen processing, and these hypotheses are now capable of being tested experimentally. This model confirms the feasibility of constructing a virtual immune system, whereby each additional step in antigen processing is incorporated into a single modular model. Accurate models of antigen processing have implications for the study of basic immunology as well as for the design of peptide-based vaccines and other immunotherapies. (C) 2004 Elsevier Inc. All rights reserved.

A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

The Qu-Prolog unification algorithm: Formalisation and correctness

Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.

The central pathway of primary olfactory axons is abnormal in mice lacking the N-CAM-180 isoform

Although N-CAM has previously been implicated in the growth and fasciculation of axons, the development of axon tracts in transgenic mice with a targeted deletion of the 180-kD isoform of the neural cell adhesion molecule (N-CAM-180) appears grossly normal in comparison to wild-type mice. We examined the organization of the olfactory nerve projection from the olfactory neuroepithelium to glomeruli in the olfactory bulb of postnatal N-CAM-180 null mutant mice. Immunostaining for olfactory marker protein revealed the normal presence of fully mature primary olfactory neurons within the olfactory neuroepithelium of mutant mice. The axons of these neurons form an olfactory nerve, enter the nerve fiber layer of the olfactory bulb, and terminate in olfactory glomeruli as in wild-type control animals. The olfactory bulb is smaller and the nerve fiber layer is relatively thicker in mutants than in wild-type mice. Previous studies have revealed that the plant lectin Dolichos biflorus agglutinin (DBA) clearly stains the perikarya and axons of a subpopulation of primary olfactory neurons. Thus, DBA staining enabled the morphology of the olfactory nerve pathway to be examined at higher resolution in both control and mutant animals. Despite a normal spatial pattern of DBA-stained neurons within the nasal cavity, there was a distorted axonal projection of these neurons onto the surface of the olfactory bulb in N-CAM-180 null mutants. In particular, DBA-stained axons formed fewer and smaller glomeruli in the olfactory bulbs of mutants in comparison to wild-type mice. Many primary olfactory axons failed to exit the nerve fiber layer and contribute to glomerular formation. These results indicate that N-CAM-180 plays an important role in the growth and fasciculation of primary olfactory axons and is essential for normal development of olfactory glomeruli. (C) 1997 John Wiley & Sons, Inc.

Analysis and implementation of a new constant acceleration subcycling algorithm

An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.

The subcycled Newmark algorithm

The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.

Simulated-annealing-based genetic algorithm for modeling the optical constants of solids

We propose a simulated-annealing-based genetic algorithm for solving model parameter estimation problems. The algorithm incorporates advantages of both genetic algorithms and simulated annealing. Tests on computer-generated synthetic data that closely resemble optical constants of a metal were performed to compare the efficiency of plain genetic algorithms against the simulated-annealing-based genetic algorithms. These tests assess the ability of the algorithms to and the global minimum and the accuracy of values obtained for model parameters. Finally, the algorithm with the best performance is used to fit the model dielectric function to data for platinum and aluminum. (C) 1997 Optical Society of America.

Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.