bluuebunny/crossref_metadata_2025_split huggingface dataset:
Impairment of Cardiac Function and Remodeling Induced by Myocardial Infarction in Rats are Attenuated by the Nonpeptide Angiotensin‐(1–7) Analog AVE 0991
Authors: Zeng Wu‐tao , Chen Wei‐yan , Leng Xiu‐yu , Tang Li‐long , Sun Xiu‐ting , Li Cui‐ling , Dai Gang 
Published: December 2010

SUMMARYAims: We evaluated effects of the nonpeptide angiotensin (ANG)‐(1–7) analog AVE 0991 (AVE) on cardiac function and remodeling as well as transforming growth factor‐beta1 (TGF‐β1)/tumor necrosis factor‐alpha (TNF‐α) expression in myocardial infarction rat models. Methods and Results: Sprague–Dawley rats underwent either sham surgery or coronary ligation. They were divided into four groups: sham, control, AVE, and AVE+A‐779 [[D‐Ala7]‐ANG‐(1–7), a selective antagonist for the ANG‐(1–7)] group. After 4 weeks of treatment, the AVE group displayed a significant elevation in left ventricular fractional shorting (LVFS) (25.5 ± 7.3% vs. 18.4 ± 3.3%, P < 0.05) and left ventricular ejection fraction (LVEF) (44.8 ± 7.6% vs. 32.7 ± 6.5%, P < 0.05) when compared to the control group, but no effects on the left ventricular end‐diastolic and end‐systolic diameters (LVDd and LVDs, respectively) were observed. In addition, we found that the myocyte diameter (18 ± 2 μm vs. 22 ± 4 μm, P < 0.05), infarct size (42.6 ± 3.6% vs. 50.9 ± 4.4%, P < 0.001) and collagen volume fraction (CVF) (16.4 ± 2.2% vs. 25.3 ± 3.2%, P < 0.001) were significantly reduced in the AVE group when compared to the control group. There were no differences in LVFS, LVEF, myocyte diameter, and infarct size between the control and AVE+A‐779 groups. AVE also markedly attenuated the increased mRNA expression of collagen I (P < 0.001) and collagen III (P < 0.001) and inhibited the overexpression of TGF‐β1 (P < 0.05) and TNF‐α (P < 0.05) compared to the control group. Conclusion: AVE could improve cardiac function and attenuate ventricular remodeling in MI rat models. It may involve the inhibition of inflammatory factors TGF‐β1/TNF‐α overexpression and the action on the specific receptor Mas of ANG‐(1–7).
Perioperative Acupuncture and Postoperative Acupressure Can Prevent Postoperative Vomiting following Paediatric Tonsillectomy Or Adenoidectomy: A Pragmatic Randomised Controlled Trial
Authors: Liodden Ingrid , Howley Michael , Grimsgaard Anne Sameline , Fønnebø Vinjar Magne , Borud Einar Kristian , Alraek Terje , Norheim Arne Johan 
Published: December 2010

Objective To investigate the effectiveness of acupuncture and acupressure as supplements to standard treatment for postoperative vomiting in children undergoing tonsillectomy and/or adenoidectomy. Methods A pragmatic, open, block-randomised controlled trial. The results were analysed according to the intention-to-treat principle. The study was conducted without extra resources in a normal setting at the day-surgery department of Lovisenberg Diakonale Hospital in Oslo. 154 children with an American Society of Anesthesiologists grade 1–2, weighing at least 10 kg, were included. Children with concomitant gastrointestinal diseases, emesis or antiemetic treatment <24 h preoperatively, rash or local infection over the actual acupuncture points were excluded together with patients whose parents’ informed consent could not be obtained. The intervention group received acupuncture at pericardium 6 bilaterally, at a depth of approximately 0.7 cm with a median of 21 min during anaesthesia, followed by acupressure wristbands for 24 h and standard treatment. The control group received standard treatment. The primary end point was the occurrence of vomiting or retching during 24 h postoperatively. Results Children in the acustimulation group experienced less retching and vomiting than the control group—46.8% versus 66.2% (p=0.015). The effect of acustimulation was specifically pronounced in girls and children aged 1–3 years. Conclusion This trial indicates the effectiveness of acustimulation as an adjunct to standard treatment. The results should encourage and promote the implementation of acustimulation for postoperative vomiting in children undergoing adenoidectomy or tonsillectomy.
Molecular phylogeny of two coelomycetous fungal genera with stellate conidia,ProsthemiumandAsterosporium, on Fagales trees
Authors: Tanaka Kazuaki , Mel’nik Vadim A. , Kamiyama Maasa , Hirayama Kazuyuki , Shirouzu Takashi 
Published: December 2010

Prosthemium (teleomorph Pleomassaria ) and Asterosporium (teleomorph unknown) are coelomycetous genera with stellate conidia on Fagales trees. Their morphological resemblance suggests their close relationship, but phylogenetic relatedness remains unknown. They have been distinguished on the basis of either conidiomatal morphology (pycnidia in Prosthemium and acervuli in Asterosporium) or their differing conidial septation (euseptate in Prosthemium and distoseptate in Asterosporium). To reveal their phylogenetic affinities and clarify reliable distinguishing phenotypical characters, five species of Prosthemium and two species of Asterosporium were investigated using sequences of the small subunit, large subunit, and internal transcribed spacer region of nuclear ribosomal DNA and β-tubulin gene from 43 isolates of these species. The analyses revealed the following: (i) Asterosporium typified by Asterosporium asterospermum on Fagus is a member of the Sordariomycetes and is distinct from Prosthemium belonging to the Dothideomycetes; (ii) Asterosporium betulinum on Betula species should be excluded from Asterosporium and transferred to Prosthemium as Prosthemium neobetulinum nom. nov.; (iii) conidial septation does not seem to have a diagnostic value, whereas conidiomatal morphology is useful in distinguishing both genera; (iv) the number and length of conidial arms are useful criteria in distinguishing Prosthemium species. A new species, Prosthemium intermedium sp. nov., found on both Betula ermanii and Betula maximowicziana , is described and illustrated.
Conservation genetics of Hill’s thistle (Cirsium hillii)
Authors: Freeland Joanna R. , Gillespie Joy , Ciotir Claudia , Dorken Marcel E. 
Published: December 2010

Populations at the edges of their geographical ranges are often characterized by reduced genetic diversity and increased genetic differentiation. These patterns may be exacerbated by specialized associations between plants and uncommon habitats. Together, reduced diversity and increased subdivision may increase the risk of population extirpation, an issue that is particularly important for plants classified as rare or threatened. Hill’s thistle (Cirsium hillii (Canby) Fernald), is a perennial herb endemic to the Great Lakes region and is considered threatened in Canada where its northernmost distribution occurs. We used microsatellite markers to genotype plants from 11 populations of Hill’s thistle that span the range of the species distribution within Canada. These data were used to investigate levels of genetic diversity within populations and genetic differentiation between populations, and to evaluate associations between patterns of genetic variation and those expected under ongoing habitat loss. Genetic differentiation among populations was low, although significant pairwise FST values, along with the presence of private alleles in most populations, was consistent with moderate to low gene flow. Nevertheless, in comparison with a congeneric rare species (Cirsium pitcheri) that occurs in the same geographical region in Canada, genetic diversity within most populations was high, and we suggest that this is at least partially attributable to this species’ combination of sexual and clonal reproduction. Despite high levels of genetic diversity, Hill’s thistle should probably remain a designated species at risk because of ongoing habitat loss; however, our data suggest that Hill’s thistle is unlikely to suffer from reduced genetic diversity in the foreseeable future.
STABILITY OF (α, β, γ)-DERIVATIONS ON LIE C*-ALGEBRAS
Authors: GORDJI M. ESHAGHI , GHOBADIPOUR N. 
Published: December 2010

Petr Novotný and Jiřĺ Hrivnák [14] investigated and generalized the concept of Lie derivations via certain complex parameters and obtained various Lie and Jordan operator algebras as well as two one-parametric sets of linear operators. Moreover, they established the structure and properties of (α, β, γ)-derivations of Lie algebras. We say a functional equation (ξ) is stable if any function g satisfying the equation (ξ) approximately is near to true solution of (ξ). In the present paper, we investigate the stability of (α, β, γ)-derivations on Lie C*-algebras associated with the following functional equation [Formula: see text]
ON THE BRAIDING OF AN ANN-CATEGORY
Authors: Quang Nguyen Tien , Hanh Dang Dinh 
Published: December 2010

A braided Ann-category [Formula: see text] is an Ann-category [Formula: see text] together with the braiding c such that ([Formula: see text], ⊗, a, c, (1, l, r)) is a braided tensor category, and c is compatible with the distributivity constraints. The paper shows the dependence of the left (or right) distributivity constraint on other axioms. Hence, the paper shows the relation to the concepts of distributivity category due to M. L. Laplaza and ring-like category due to A. Fröhlich and C.T.C Wall. The center construction of an almost strict Ann-category is an example of a non-symmetric braided Ann-category.
Design Assurance Strategy and Toolset for Partially Reconfigurable FPGA Systems
Authors: Kępa K. , Morgan F. , Kościuszkiewicz K. , Braun L. , Hübner M. , Becker J. 
Published: December 2010

The growth of the Reconfigurable Computing (RC) systems community exposes diverse requirements with regard to functionality of Electronic Design Automation (EDA) tools. Low-level design tools are increasingly required for RC bitstream debugging and IP core design assurance, particularly in multiparty Partially Reconfigurable (PR) designs. While tools for low-level analysis of design netlists do exist, there is increasing demand for automated and customisable bitstream analysis tools.
This article discusses the need for low-level IP core verification within PR-enabled FPGA systems and reports FDAT (FPGA Design Analysis Tool), a versatile, modular and open tools framework for low-level analysis and verification of FPGA designs. FDAT provides a set of high-level Application Programming Interfaces (APIs) abstracting the Xilinx FPGA fabric, the implemented design (e.g., placed and routed netlist) and the related bitstream. A lightweight graphic front-end allows custom visualisation of the design within the FPGA fabric. The operation of FDAT is governed by “recipe” scripts which support rapid prototyping of the abstract algorithms for system-level design verification. FDAT recipes, being Python scripts, can be ported to embedded FPGA systems, for example, the previously reported Secure Reconfiguration Controller (SeReCon) which enforces an IP core spatial isolation policy in order to provide run-time protection to the PR system.
The paper illustrates the application of FDAT for bit-pattern analysis of Virtex-II Pro and Virtex-5 inter-tile routing and verification of the spatial isolation between designs.
An architecture for recycling intermediates in a column-store
Authors: Ivanova Milena G. , Kersten Martin L. , Nes Niels J. , Gonçalves Romulo A.P. 
Published: December 2010

Automatic recycling of intermediate results to improve both query response time and throughput is a grand challenge for state-of-the-art databases. Tuples are loaded and streamed through a tuple-at-a-time processing pipeline, avoiding materialization of intermediates as much as possible. This limits the opportunities for reuse of overlapping computations to DBA-defined materialized views and function/result cache tuning. In contrast, the operator-at-a-time execution paradigm produces fully materialized results in each step of the query plan. To avoid resource contention, these intermediates are evicted as soon as possible.
In this article we study an architecture that harvests the byproducts of the operator-at-a-time paradigm in a column-store system using a lightweight mechanism, the recycler. The key challenge then becomes the selection of the policies to admit intermediates to the resource pool, to determine their retention period, and devise the eviction strategy when facing resource limitations. The proposed recycling architecture has been implemented in an open-source system. An experimental analysis against the TPC-H ad-hoc decision support benchmark and a complex, real-world application (SkyServer) demonstrates its effectiveness in terms of self-organizing behavior and its significant performance gains. The results indicate the potentials of recycling intermediates and charts a route for further development of database kernels.
I/O efficient algorithms for serial and parallel suffix tree construction
Authors: Ghoting Amol , Makarychev Konstantin 
Published: December 2010

Over the past three decades, the suffix tree has served as a fundamental data structure in string processing. However, its widespread applicability has been hindered due to the fact that suffix tree construction does not scale well with the size of the input string. With advances in data collection and storage technologies, large strings have become ubiquitous, especially across emerging applications involving text, time series, and biological sequence data. To benefit from these advances, it is imperative that we have a scalable suffix tree construction algorithm.
The past few years have seen the emergence of several disk-based suffix tree construction algorithms. However, construction times continue to be daunting—for example, indexing the entire human genome still takes over 30 hours on a system with 2 gigabytes of physical memory. In this article, we will empirically demonstrate and argue that all existing suffix tree construction algorithms have a severe limitation—to glean reasonable disk I/O efficiency, the input string being indexed must fit in main memory. This limitation is attributed to the poor locality exhibited by existing suffix tree construction algorithms and inhibits both sequential and parallel scalability. To deal with this limitation, we will show that through careful algorithm design, one of the simplest suffix tree construction algorithms can be rearchitected to build a suffix tree in a tiled manner, allowing the execution to operate within a fixed main memory budget when indexing strings of any size. We will also present a parallel extension of our algorithm that is designed for massively parallel systems like the IBM Blue Gene. An experimental evaluation will show that the proposed approach affords an improvement of several orders of magnitude in serial performance when indexing large strings. Furthermore, the proposed parallel extension is shown to be scalable—it is now possible to index the entire human genome on a 1024 processor IBM Blue Gene system in under 15 minutes.
The evolution of an x86 virtual machine monitor
Authors: Agesen Ole , Garthwaite Alex , Sheldon Jeffrey , Subrahmanyam Pratap 
Published: December 2010

Twelve years have passed since VMware engineers first virtualized the x86 architecture. This technological breakthrough kicked off a transformation of an entire industry, and virtualization is now (once again) a thriving business with a wide range of solutions being deployed, developed and proposed. But at the base of it all, the fundamental quest is still the same: running virtual machines as well as we possibly can on top of a virtual machine monitor.
We review how the x86 architecture was originally virtualized in the days of the Pentium II (1998), and follow the evolution of the virtual machine monitor forward through the introduction of virtual SMP, 64 bit (x64), and hardware support for virtualization to finish with a contemporary challenge, nested virtualization.
Online cache modeling for commodity multicore processors
Authors: West Richard , Zaroo Puneet , Waldspurger Carl A. , Zhang Xiao 
Published: December 2010

Modern chip-level multiprocessors (CMPs) contain multiple processor cores sharing a common last-level cache, memory interconnects, and other hardware resources. Workloads running on separate cores compete for these resources, often resulting in highlyvariable performance. It is generally desirable to co-schedule workloads that have minimal resource contention, in order to improve both performance and fairness. Unfortunately, commodity processors expose only limited information about the state of shared resources such as caches to the software responsible for scheduling workloads that execute concurrently. To make informed resourcemanagement decisions, it is important to obtain accurate measurements of per-workload cache occupancies and their impact on performance, often summarized by utility functions such as miss-ratio curves (MRCs)
In this paper, we first introduce an efficient online technique for estimating the cache occupancy of individual software threads using only commonly-available hardware performance counters. We derive an analytical model as the basis of our occupancy estimation, and extend it for improved accuracy on modern cache configurations, considering the impact of set-associativity, line replacement policy, and memory locality effects. We demonstrate the effectiveness of occupancy estimation with a series of CMP simulations in which SPEC benchmarks execute concurrently on multiple cores. Leveraging our occupancy estimation technique, we also introduce a lightweight approach for online MRC construction, and demonstrate its effectiveness using a prototype implementation in the VMware ESX Server hypervisor. We present a series of experiments involving SPEC benchmarks, comparing the MRCs we construct online with MRCs generated offline in which various cache sizes are enforced via static page coloring
Challenges in building scalable virtualized datacenter management
Authors: Soundararajan Vijayaraghavan , Govil Kinshuk 
Published: December 2010

Virtualization drives higher resource utilization and makes provisioning new systems very easy and cheap. This combination has led to an ever-increasing number of virtual machines: the largest data centers will likely have more than 100K in few years, and many deployments will span multiple data centers. Virtual machines are also getting increasingly more capable, consisting of more vCPUs, more memory, and higher-bandwidth virtual I/O devices with a variety of capabilities like bandwidth throttling and traffic mirroring
To reduce the work for IT administrators managing these environments, VMware and other companies provide several monitoring, automation, and policy-driven tools. These tools require a lot of information about various aspects of each VM and other objects in the system, such as physical hosts, storage infrastructure, and networking. To support these tools and the hundreds of simultaneous users who manage the environment, the management software needs to provide secure access to the data in real-time with some degree of consistency and backwardcompatibility, and very high availability under a variety of failures and planned maintenance. Such software must satisfy a continuum of designs: it must perform well at large-scale to accommodate the largest datacenters, but it must also accommodate smaller deployments by limiting its resource consumption and overhead according to demand. The need for high-performance, robust management tools that scale from a few hosts to cloud-scale poses interesting challenges for the management software. This paper presents some of the techniques we have employed to address these challenges
vApp
Authors: Schmidt René W. , Grarup Steffen 
Published: December 2010

In the past decade, virtualization has swept through the x86 server landscape and caused a dramatic change in how enterprise datacenters are organized both from a physical infrastructure level and an organizational level. This has lead to a datacenter where all resources and services are virtualized, paving the way for a complete decoupling of the applications from the physical infrastructure. This is known as cloud computing or more specifically, Infrastructure as a Service (IaaS).
The decoupling of the application from the deployment platform is a fundamental shift from previous generations of datacenter infrastructure. To utilize this decoupling, a well-defined interface between the application and the cloud provider must exist. We describe the core requirements for this interface and introduce a concrete implementation of such an interface, called the vApp container. The vApp container is built on top of the Open Virtualization Format. We also introduce the concept of a vService dependency that is used to decouple a vApp from infrastructure services and to support mobility between cloud providers. Finally, the paper provides several examples of vApps and service integrations and discusses how development tools can be optimized for the vApp container
On Fixed Point Theorems for Multivalued Contractions
Authors: Liu Zeqing , Sun Wei , Kang ShinMin , Ume JeongSheok 
Published: December 2010

AbstractThree concepts of multivalued contractions in complete metric spaces are introduced, and the conditions guaranteeing the existence of fixed points for the multivalued contractions are established. The results obtained in this paper extend genuinely a few fixed point theorems due to Ćirić (2009) Feng and Liu (2006) and Klim and Wardowski (2007). Five examples are given to explain our results.
Spatial and Verbal rhetorics of power: Constructing late old kingdom history
Authors: Richards Janet 
Published: December 2010

AbstractIn writing ancient Egyptian social and political history, we take for granted that we should privilege neither textual nor material cultural evidence; rather, we should weave narratives incorporating both strands in weights commensurate with the actual profile of available data in a specific time and place. The mosaic of data available from the later Old Kingdom provides an especially compelling rationale for adopting this multidimensional approach. Earlier accounts of this pivotal era in ancient Egyptian history have relied most heavily on textual evidence ‐ not least because for the first time there existed lengthy biographical inscriptions of government officials providing tantalizing detail on individual political careers and legitimizing verbal rhetoric regarding possible historical events. In this particular period, however, the amounts of such textual data are outweighed in sheer quantity by contemporary archaeological remains. I have previously argued that spatial patterning, both in the synchronic distribution of these remains and (perhaps more compellingly) in the shifts of these patterns over time, should play an equal or even more prominent role in writing a socio-political history of this particular period. A primary case study explored in this essay is the late Old Kingdom mortuary landscape at Abydos where new data has emerged strengthening the diachronic evidence for the manipulation of a spatial rhetoric of political ideology, providing further insight into ancient Egyptian elites’ responses to perceived or real crises in centralized control of the country. This phenomenon at Abydos was only one part of a broader program of materializing central authority throughout the Egyptian Nile Valley at a time when the verbal rhetoric of royal power was limited in voice, audience, and context.