bluuebunny/crossref_metadata_2025_split huggingface dataset:
Organization of the honey bee mushroom body: Representation of the calyx within the vertical and gamma lobes
Authors: Strausfeld Nicholas J. 
Published: September 2002

AbstractStudies of the mushroom bodies of Drosophila melanogaster have suggested that their gamma lobes specifically support short‐term memory, whereas their vertical lobes are essential for long‐term memory. Developmental studies have demonstrated that the Drosophila gamma lobe, like its equivalent in the cockroach Periplaneta americana, is supplied by a special class of intrinsic neuron—the clawed Kenyon cells—that are the first to differentiate during early development. To date, however, no account identifies a corresponding lobe in the honey bee, another taxon used extensively for learning and memory research. Received opinion is that, in this taxon, each of the mushroom body lobes comprises three parallel divisions representing one of three concentric zones of the calyces, called the lip, collar, and basal ring. The present account shows that, although these zones are represented in the lobes, they occupy only two thirds of the vertical lobe. Its lowermost third receives the axons of the clawed class II Kenyon cells, which are the first to differentiate during early development and which represent the whole calyx. This component of the lobe is anatomically and developmentally equivalent to the gamma lobe of Drosophila and has been here named the gamma lobe of the honey bee. A new class of intrinsic neurons, originating from perikarya distant from the mushroom body, provides a second system of parallel fibers from the calyx to the gamma lobe. A region immediately beneath the calyces, called the neck, is invaded by these neurons as well as by a third class of intrinsic cell that provides connections within the neck of the pedunculus and the basal ring of the calyces. In the honey bee, the gamma lobe is extensively supplied by afferents from the protocerebrum and gives rise to a distinctive class of efferent neurons. The terminals of these efferents target protocerebral neuropils that are distinct from those receiving efferents from divisions of the vertical lobe that represent the lip, collar, and basal ring. The identification of a gamma lobe unites the mushroom bodies of evolutionarily divergent taxa. The present findings suggest the need for critical reinterpretation of studies that have been predicated on early descriptions of the mushroom body's lobes. J. Comp. Neurol. 450:4–33, 2002. © 2002 Wiley‐Liss, Inc.
Immunohistochemical localization and biochemical characterization of ghrelin in the brain and stomach of the frog Rana esculenta
Authors: Galas Ludovic , Chartrel Nicolas , Kojima Masayasu , Kangawa Kenji , Vaudry Hubert 
Published: September 2002

AbstractGhrelin is a 28‐amino acid n‐octanoylated peptide recently isolated from the rat stomach as an endogenous ligand of the growth hormone secretagogue receptor. So far, the occurrence of ghrelin has not been investigated in submammalian vertebrates. In the present work, we have studied the anatomic distribution and biochemical characterization of ghrelin‐like immunoreactivity in the brain and stomach of the frog Rana esculenta by using two distinct antisera directed against rat ghrelin. In the brain, sparse ghrelin‐positive cells were detected in three nuclei of the diencephalon, namely the suprachiasmatic nucleus and the posterior tuberculum in the hypothalamus, and the posterodorsal aspect of the lateral nucleus in the thalamus. A few ghrelin‐immunoreactive neurons were also found in the mesencephalon, i.e., in the pretoral gray and the anterodorsal tegmental nucleus. Ghrelin‐containing fibers were widely distributed in the frog brain. In particular, diffuse networks of immunoreactive processes were observed in various regions of the telencephalon, including the medial pallium, the striatum, the nucleus of the diagonal band of Broca, the nucleus accumbens, and the amygdala. In the diencephalon, the magnocellular nucleus, the suprachiasmatic nucleus, the posterior tuberculum, and the ventrolateral and lateral thalamic nuclei were moderately to densely innervated with ghrelin‐containing fibers. A moderate density of positive fibers was also found in different areas of the mesencephalon such as the nucleus of the medial longitudinal fasciculus, the pretoral gray, and the tegmentum. In the stomach, a few brightly immunofluorescent cells were detected in the mucosa. The distribution pattern and morphologic characteristics of ghrelin‐containing cells in the stomach suggest that they correspond to endocrine cells. Reversed‐phase high performance liquid chromatography analysis of frog brain and stomach extracts, combined with RIA detection, revealed that ghrelin‐immunoreactive material eluted as a single peak with a retention time slightly shorter than that of synthetic rat ghrelin. The present data provide the first evidence that a ghrelin‐related peptide is present in submammalian vertebrates. The occurrence of ghrelin‐containing cells in the hypothalamus and the stomach mucosa suggests that, in amphibians, ghrelin may exert both neuroendocrine and endocrine activities. J. Comp. Neurol. 450:34–44, 2002. © 2002 Wiley‐Liss, Inc.
Antagonism of vasoactive intestinal peptide mRNA in the suprachiasmatic nucleus disrupts the rhythm of FRAs expression in neuroendocrine dopaminergic neurons
Authors: Gerhold Lynnette M. , Sellix Michael T. , Freeman Marc E. 
Published: September 2002

AbstractThis study was designed to determine whether there is a functional relationship between cfos expression in vasoactive intestinal peptide (VIP) ‐containing neurons of the suprachiasmatic nucleus (SCN) and Fos‐related antigens (FRAs) expression in neuroendocrine dopaminergic neurons of the arcuate (ARN) and periventricular (PeVN) nuclei of the hypothalamus. Brains were obtained from ovariectomized (OVX) female rats killed at 12:00 AM, 7:00 AM, 9:00 AM, 12:00 PM, and 7:00 PM (12 hours illumination beginning 6:00 AM). Antibodies against FRAs and tyrosine hydroxylase (TH) identified activated neuroendocrine dopaminergic neurons. Antibodies against cfos and VIP identified activated VIP‐immunoreactive (IR) neurons in the SCN. The proportion of neuroendocrine dopaminergic neurons in the ARN and PeVN expressing FRAs was greatest and equivalent at 7:00 AM, 9:00 AM, 12:00 PM, and 12:00 AM. At 7:00 PM, the proportion of neuroendocrine dopaminergic neurons expressing FRAs was significantly lower than all other time points. In the SCN, a subpopulation of VIP‐IR neurons maximally expressed cfos at 7:00 AM, which decreased through 9:00 AM. cFos was not expressed at 7:00 PM and 12:00 AM in VIP‐IR neurons. Antisense VIP oligonucleotides were injected into the SCN to determine whether attenuation of VIP expression disturbs rhythms in neuroendocrine dopaminergic neuronal activity. OVX rats were infused with either antisense VIP oligonucleotides or scrambled sequence oligonucleotides bilaterally (0.5 μg in 0.5 μl of saline per side) in the SCN. Animals were killed 34 hours (7:00 PM) and 46 hours (7:00 AM) after receiving infusions, and brains were recovered. Administration of antisense VIP oligonucleotides decreased VIP protein expression in the SCN and prevented the decrease in the percentage of neuroendocrine dopaminergic neurons expressing FRAs at 7:00 PM but did not affect FRAs expression at 7:00 AM when compared with animals receiving scrambled oligonucleotides. These data suggest that VIP fibers from the SCN may relay time‐of‐day information to neuroendocrine dopaminergic neurons to inhibit their activity and, thus, initiate prolactin release in the evening. J. Comp. Neurol. 450:135–143, 2002. © 2002 Wiley‐Liss, Inc.
BEM‐analysis of interaction of elastic waves with unilateral interface crack
Authors: Bing‐Zheng Gai , Qingcai Chen 
Published: September 2002

AbstractIn this paper, to solve the problems of the interaction between the unilateral interface cracks and elastic wave, a new numerical method based on boundary element method (BEM) has been proposed. In this method, an iterating–correcting process of the solution in frequency domain and the correction in time domain has been designed to eliminate the mutual interference between the time and frequency domain. As an illustration to the algorithm, an interface crack between two half‐planes under the attack of harmonic plane elastic wave has been analysed in detail. The contact configurations and stress field at the crack surface, and dynamic stress intensity factor (DSIF) at the crack tip have been given. Copyright © 2001 John Wiley & Sons, Ltd.
The non‐linear analysis of flexibly connected space frames
Authors: Erdem Hakan , Aksogan Orhan , Arslan H. Murat 
Published: September 2002

AbstractThis study considers the effect of the non‐linear behaviour of connections and geometric non‐linearity on the behaviour of space frames. The Richard model (Comput. Struct. 1993; 46: 55) has been used for the non‐linear moment–rotation relation of the connections and the behaviour of the material is assumed to be linearly elastic. The tangent stiffness matrix has been obtained from the solution of the pertinent linear differential equation that governs the moment–curvature relation of a prismatic member, including the above‐mentioned non‐linear effects. The non‐linear equilibrium equations that show up are solved iteratively using an incremental loading procedure. The iterative procedure is repeated until the unbalanced forces are less than a predefined tolerance. Consequently, the errors emerging due to the linearization of the non‐linear analysis can be made as small as desired. An example problem is solved using the computer program written to implement the proposed analysis and the results are in good agreement with those in the literature. Copyright © 2002 John Wiley & Sons, Ltd.
Experiences from integrating algorithmic and systemic load balancing strategies
Authors: Banicescu Ioana , Ghafoor Sheikh , Velusamy Vijay , Russ Samuel H. , Bilderback Mark 
Published: September 2002

AbstractLoad balancing increases the efficient use of existing resources for parallel and distributed applications. At a coarse level of granularity, advances in runtime systems for parallel programs have been proposed in order to control available resources as efficiently as possible by utilizing idle resources and using task migration. Simultaneously, at a finer granularity level, advances in algorithmic strategies for dynamically balancing computational loads by data redistribution have been proposed in order to respond to variations in processor performance during the execution of a given parallel application. Combining strategies from each level of granularity can result in a system which delivers advantages of both. The resulting integration is systemic in nature and transfers the responsibility of efficient resource utilization from the application programmer to the runtime system. This paper presents the design and implementation of a system that combines an algorithmic fine‐grained data parallel load balancing strategy with a systemic coarse‐grained task‐parallel load balancing strategy, and reports on recent experimental results of running a computationally intensive scientific application under this integrated system. The experimental results indicate that a distributed runtime environment which combines both task and data migration can provide performance advantages with little overhead. It also presents proposals for performance enhancements of the implementation, as well as future explorations for effective resource management. Copyright © 2001 John Wiley & Sons, Ltd.
Analysis and measurement of the effect of kernel locks in SMP systems
Authors: Kaieda Akihiro , Nakayama Yasuichi , Tanaka Atsuhiro , Horikawa Takashi , Kurasugi Toshiyasu , Kino Issei 
Published: September 2002

AbstractThis article reports the use of case studies to evaluate the performance degradation caused by the kernel‐level lock. We define the lock ratio as a ratio of the execution time for critical sections to the total execution time of a parallel program. The kernel‐level lock ratio determines how effective programs work on symmetric multiprocessor (SMP) systems. We have measured the lock ratios and the performance of three types of parallel programs on SMP systems with Linux 2.0: matrix multiplication, parallel make, and WWW server programs. Experimental results show that the higher the lock ratio of parallel programs, the worse their performance becomes. Copyright © 2001 John Wiley & Sons, Ltd.
Code generator for the HPF Library and Fortran 95 transformational functions
Authors: van Waveren Matthijs , Addison Cliff , Harrison Peter , Orange Dave , Brown Norman , Iwashita Hidetoshi 
Published: September 2002

AbstractOne of the language features of the core language of HPF 2.0 (High Performance Fortran) is the HPF Library. The HPF Library consists of 55 generic functions. The implementation of this library presents the challenge that all data types, data kinds, array ranks and input distributions need to be supported. For instance, more than 2 billion separate functions are required to support COPY_SCATTER fully. The efficient support of these billions of specific functions is one of the outstanding problems of HPF. We have solved this problem by developing a library generator which utilizes the mechanism of parameterized templates. This mechanism allows the procedures to be instantiated at compile time for arguments with a specific type, kind, rank and distribution over a specific processor array. We describe the algorithms used in the different library functions. The implementation gives the ease of generating a large number of library routines from a single template. The templates can be extended with special code for specific combinations of the input arguments. We describe in detail the implementation and performance of the matrix multiplication template for the Fujitsu VPP5000 platform. Copyright © 2002 John Wiley & Sons, Ltd.
Implementation and evaluation of HPF/SX V2
Authors: Murai Hitoshi , Araki Takuya , Hayashi Yasuharu , Suehiro Kenji , Seo Yoshiki 
Published: September 2002

AbstractWe are developing HPF/SX V2, a High Performance Fortran (HPF) compiler for vector parallel machines. It provides some unique extensions as well as the features of HPF 2.0 and HPF/JA. In particular, this paper describes four of them: (1) the ON directive of HPF 2.0; (2) the REFLECT and LOCAL directives of HPF/JA; (3) vectorization directives; and (4) automatic parallelization. We evaluate these features through some benchmark programs on NEC SX‐5. The results show that each of them achieved a 5–8 times speedup in 8‐CPU parallel execution and the four features are useful for vector parallel execution. We also evaluate the overall performance of HPF/SX V2 by using over 30 well‐known benchmark programs from HPFBench, APR Benchmarks, GENESIS Benchmarks, and NAS Parallel Benchmarks. About half of the programs showed good performance, while the other half suggest weakness of the compiler, especially on its runtimes. It is necessary to improve them to put the compiler to practical use. Copyright © 2002 John Wiley & Sons, Ltd.
Optimization of element‐by‐element FEM in HPF 1.1
Authors: Okuda Hiroshi , Anan Norihisa 
Published: September 2002

AbstractIn this study, Poisson's equation is numerically evaluated by the element‐by‐element (EBE) finite‐element method in a parallel environment using HPF 1.1 (High‐Performance Fortran). In order to achieve high parallel efficiency, the data structures have been altered to node‐based data instead of mixtures of node‐ and element‐based data, representing a node‐based EBE finite‐element scheme (nEBE). The parallel machine used in this study was the NEC SX‐4, and experiments were performed on a single node having 32 processors sharing common memory. The HPF compiler used in the experiments is HPF/SX Rev 2.0 released in 1997 (unofficial), which supports HPF 1.1. Models containing approximately 200 000 and 1 500 000 degrees of freedom were analyzed in order to evaluate the method. The calculation time, parallel efficiency, and memory used were compared. The performance of HPF in the conjugate gradient solver for the large model, using the NEC SX‐4 compiler option ‐noshrunk, was about 85% that of the message passing interface. Copyright © 2002 John Wiley & Sons, Ltd.
High‐performance numerical pricing methods
Authors: Moritsch Hans , Benkner Siegfried 
Published: September 2002

AbstractThe pricing of financial derivatives is an important field in finance and constitutes a major component of financial management applications. The uncertainty of future events often makes analytic approaches infeasible and, hence, time‐consuming numerical simulations are required. In the Aurora Financial Management System, pricing is performed on the basis of lattice representations of stochastic multidimensional scenario processes using the Monte Carlo simulation and Backward Induction methods, the latter allowing for the exploitation of shared‐memory parallelism. We present the parallelization of a Backward Induction numerical pricing kernel on a cluster of SMPs using HPF+, an extended version of High‐Performance Fortran. Based on language extensions for specifying a hierarchical mapping of data onto an SMP cluster, the compiler generates a hybrid‐parallel program combining distributed‐memory and shared‐memory parallelism. We outline the parallelization strategy adopted by the VFC compiler and present an experimental evaluation of the pricing kernel on an NEC SX‐5 vector supercomputer and a Linux SMP cluster, comparing a pure MPI version to a hybrid‐parallel MPI/OpenMP version. Copyright © 2002 John Wiley & Sons, Ltd.
Achieving performance under OpenMP on ccNUMA and software distributed shared memory systems
Authors: Chapman B. , Bregier F. , Patil A. , Prabhakar A. 
Published: September 2002

AbstractOpenMP is emerging as a viable high‐level programming model for shared memory parallel systems. It was conceived to enable easy, portable application development on this range of systems, and it has also been implemented on cache‐coherent Non‐Uniform Memory Access (ccNUMA) architectures. Unfortunately, it is hard to obtain high performance on the latter architecture, particularly when large numbers of threads are involved. In this paper, we discuss the difficulties faced when writing OpenMP programs for ccNUMA systems, and explain how the vendors have attempted to overcome them. We focus on one such system, the SGI Origin 2000, and perform a variety of experiments designed to illustrate the impact of the vendor's efforts. We compare codes written in a standard, loop‐level parallel style under OpenMP with alternative versions written in a Single Program Multiple Data (SPMD) fashion, also realized via OpenMP, and show that the latter consistently provides superior performance. A carefully chosen set of language extensions can help us translate programs from the former style to the latter (or to compile directly, but in a similar manner). Syntax for these extensions can be borrowed from HPF, and some aspects of HPF compiler technology can help the translation process. It is our expectation that an extended language, if well compiled, would improve the attractiveness of OpenMP as a language for high‐performance computation on an important class of modern architectures. Copyright © 2002 John Wiley & Sons, Ltd.
Efficient parallel programming on scalable shared memory systems with High Performance Fortran
Authors: Benkner Siegfried , Brandes Thomas 
Published: September 2002

AbstractOpenMP offers a high‐level interface for parallel programming on scalable shared memory (SMP) architectures. It provides the user with simple work‐sharing directives while it relies on the compiler to generate parallel programs based on thread parallelism. However, the lack of language features for exploiting data locality often results in poor performance since the non‐uniform memory access times on scalable SMP machines cannot be neglected. High Performance Fortran (HPF), the de‐facto standard for data parallel programming, offers a rich set of data distribution directives in order to exploit data locality, but it has been mainly targeted towards distributed memory machines.In this paper we describe an optimized execution model for HPF programs on SMP machines that avails itself with mechanisms provided by OpenMP for work sharing and thread parallelism, while exploiting data locality based on user‐specified distribution directives. Data locality does not only ensure that most memory accesses are close to the executing threads and are therefore faster, but it also minimizes synchronization overheads, especially in the case of unstructured reductions. The proposed shared memory execution model for HPF relies on a small set of language extensions, which resemble the OpenMP work‐sharing features. These extensions, together with an optimized shared memory parallelization and execution model, have been implemented in the ADAPTOR HPF compilation system and experimental results verify the efficiency of the chosen approach. Copyright © 2002 John Wiley & Sons, Ltd.
The personality structure questionnaire (PSQ): a measure of the multiple self states model of identity disturbance in cognitive analytic therapy
Authors: Pollock Philip H. , Broadbent Matthew , Clarke Sue , Dorrian Angela , Ryle Anthony 
Published: September 2002

AbstractThe Multiple Self‐States Model (MSSM) of Cognitive Analytic Therapy (CAT) conceptualizes identity disturbances in personality, particularly borderline personality disorder. The Personality Structure Questionnaire (PSQ) has been devised to measure deficits in personality integrity and represent an assessment measure of the MSSM. A spectrum of multiplicity in the self and dissociation is implied within the MSSM with gradation from borderline personality to dissociative identity disorder. The construction, psychometric properties, reliability, validity and clinical utility of the PSQ as a measure of the MSSM are described based on data from the present study and that of Broadbent, Clarke and Ryle (The Personality Structure Questionnaire: a brief self‐report measure of personality integration. Unpublished manuscript) and its relationship to psychological constructs of identity integrity is investigated. A series of non‐clinical and clinical groups of participants were administered the PSQ and other standardized measures. The PSQ was shown to be a reliable self‐report measure and factor analysis revealed it to be unidimensional and to correlate convergently with multiplicity, dissociation and constructs related to identity disturbance. Regression analysis indicated the PSQ to be predicted by greater multiplicity. The PSQ, in combination with other constructs, also discriminated between diagnosed clinical groups (psychotherapy patients, borderline personality disorder and dissociative identity disorder). The PSQ is shown to be a brief, psychometrically sound self‐report measure of identity disturbance as conceptualized by the MSSM in CAT. The applicability of the PSQ and its relevance to the concepts of multiplicity and dissociation within the MSSM of CAT are discussed. Copyright © 2001 John Wiley & Sons, Ltd.