bluuebunny/crossref_metadata_2025_split huggingface dataset:
Programming languages for programmable networks
Authors: Rexford Jennifer 
Published: October 2012

Today's computer networks perform a bewildering array of tasks, from routing and access control, to traffic monitoring and load balancing. To support wireless users accessing services hosted in the cloud, enterprise and data-center networks are under increasing pressure to support client mobility, virtual-machine migration, resource isolation between cloud services, and energy-efficient operation. Yet, network administrators must configure the network through closed and proprietary interfaces to heterogeneous devices, such as routers, switches, firewalls, load balancers, network address translators, and intrusion detection systems. Not surprisingly, configuring these complex networks is expensive and error-prone, and innovation in network management proceeds at a snail's pace.
During the past several years, the networking industry and research community have pushed for greater openness in networking software, and a clearer separation between networking devices and the software that controls them. This broad trend is known as Software Defined Networking (SDN). A hallmark of SDN is having an open interface for controller software running on a commodity computer to install packet-processing rules in the underlying switches. In particular, the OpenFlow protocol (see www.openflow.org) has significant momentum. Many commercial switches support OpenFlow, and a number of campus, data-center, and backbone networks have deployed the new technology.
With the emergence of open interfaces to network devices, the time is ripe to rethink the design of network software, to put networking on a stronger foundation and foster innovation in networked services. The programming languages community can play a vital role in this transformation, by creating languages, compilers, run-time systems, and testing and verification techniques that raise the level of abstraction for programming the network. In this talk, we give an overview of Software Defined Networking, and survey the early programming-languages research in this area. We also outline exciting opportunities for interdisciplinary research at the intersection of programming languages and computer networks.
Run your research
Authors: Klein Casey , Clements John , Dimoulas Christos , Eastlund Carl , Felleisen Matthias , Flatt Matthew , McCarthy Jay A. , Rafkind Jon , Tobin-Hochstadt Sam , Findler Robert Bruce 
Published: October 2012

Formal models serve in many roles in the programming language community. In its primary role, a model communicates the idea of a language design; the architecture of a language tool; or the essence of a program analysis. No matter which role it plays, however, a faulty model doesn't serve its purpose.
One way to eliminate flaws from a model is to write it down in a mechanized formal language. It is then possible to state theorems about the model, to prove them, and to check the proofs. Over the past nine years, PLT has developed and explored a lightweight version of this approach, dubbed Redex. In a nutshell, Redex is a domain-specific language for semantic models that is embedded in the Racket programming language. The effort of creating a model in Redex is often no more burdensome than typesetting it with LaTeX; the difference is that Redex comes with tools for the semantics engineering life cycle.
Edit lenses
Authors: Hofmann Martin , Pierce Benjamin , Wagner Daniel 
Published: October 2012

A lens is a bidirectional transformation between a pair of connected data structures, capable of translating an edit on one structure into an appropriate edit on the other. Many varieties of lenses have been studied, but none, to date, has offered a satisfactory treatment of how edits are represented. Many foundational accounts only consider edits of the form "overwrite the whole structure," leading to poor behavior in many situations by failing to track the associations between corresponding parts of the structures when elements are inserted and deleted in ordered lists, for example. Other theories of lenses do maintain these associations, either by annotating the structures themselves with change information or using auxiliary data structures, but every extant theory assumes that the entire original source structure is part of the information passed to the lens.
We offer a general theory of edit lenses, which work with descriptions of changes to structures, rather than with the structures themselves. We identify a simple notion of "editable structure"--a set of states plus a monoid of edits with a partial monoid action on the states--and construct a semantic space of lenses between such structures, with natural laws governing their behavior. We show how a range of constructions from earlier papers on "state-based" lenses can be carried out in this space, including composition, products, sums, list operations, etc. Further, we show how to construct edit lenses for arbitrary containers in the sense of Abbott, Altenkirch, and Ghani. Finally, we show that edit lenses refine a well-known formulation of state-based lenses, in the sense that every state-based lens gives rise to an edit lens over structures with a simple overwrite-only edit language, and conversely every edit lens on such structures gives rise to a state-based lens.
Exact solutions and bounds for general art gallery problems
Authors: Kröller Alexander , Baumgartner Tobias , Fekete Sándor P. , Schmidt Christiane 
Published: October 2012

The classical Art Gallery Problem asks for the minimum number of guards that achieve visibility coverage of a given polygon. This problem is known to be NP-hard, even for very restricted and discrete special cases. For the case of vertex guards and simple orthogonal polygons, Cuoto et al. have recently developed an exact method that is based on a set-cover approach. For the general problem (in which both the set of possible guard positions and the point set to be guarded are uncountable), neither constant-factor approximation algorithms nor exact solution methods are known.
We present a primal-dual algorithm based on linear programming that provides lower bounds on the necessary number of guards in every step and—in case of convergence and integrality—ends with an optimal solution. We describe our implementation and give experimental results for an assortment of polygons, including nonorthogonal polygons with holes.
Engineering highway hierarchies
Authors: Sanders Peter , Schultes Dominik 
Published: October 2012

Highway hierarchies exploit hierarchical properties inherent in real-world road networks to allow fast and exact point-to-point shortest-path queries. A fast preprocessing routine iteratively performs two steps: First, it removes edges that only appear on shortest paths
close
to source or target; second, it identifies low-degree nodes and bypasses them by introducing shortcut edges. The resulting hierarchy of highway networks is then used in a Dijkstra-like bidirectional query algorithm to considerably reduce the search space size without losing exactness. The crucial fact is that ‘far away’ from source and target it is sufficient to consider only high-level edges.

Experiments with road networks for a continent show that using a preprocessing time of around 15 min, one can achieve a query time of around 1ms on a 2.0GHz AMD Opteron.
Highway hierarchies can be combined with goal-directed search, they can be extended to answer many-to-many queries, and they can be used as a basis for other speed-up techniques (e.g., for transit-node routing and highway-node routing).
An SDP approach to multi-level crossing minimization
Authors: Chimani Markus , Hungerländer Philipp , Jünger Michael , Mutzel Petra 
Published: October 2012

We present an approach based on semidefinite programs (SDP) to tackle the multi-level crossing minimization problem. We are given a layered graph (i.e., the graph's vertices are assigned to multiple parallel levels) and are asked for an ordering of the nodes on each level such that, when drawing the graph with straight lines, the resulting number of crossings is minimized. Solving this step is crucial in what is probably the most widely used graph drawing scheme, the Sugiyama framework.
The problem has received a lot of attention in both the fields of heuristics and exact methods. For a long time, integer linear programming (ILP) approaches were the only exact algorithms applicable, at least for small graphs. Recently, SDP formulations for the special case of two levels were proposed and dominated the ILP for dense instances.
In this article, we present a new SDP formulation for the general multi-level version that, for two levels, is even stronger than the aforementioned specialized SDP. As a by-product, we also obtain an SDP-based heuristic, which in practice always gives (near-)optimal solutions.
We conduct a large set of experiments, both on randomized and on real-world instances, and compare our approach to a state-of-the-art ILP-based branch-and-cut implementation. The SDP clearly dominates for denser graphs, while the ILP approach is usually faster for sparse instances. However, even for such sparse graphs, the SDP solves more instances to optimality than the ILP. In fact, there is no single instance that the ILP solved that the SDP did not. Overall, our experiments reveal that, for sparse graphs, one should usually try to find an optimal solution with the ILP first. If this approach does not solve the instance to optimality within reasonable time, the SDP still has a good chance to do so.
Being able to solve larger real-world instances than reported before, we are also able to evaluate heuristics for this problem. In this article, we do so for the traditional barycenter-heuristic (showing that it leaves a large gap to the true optimum) and the state-of-the-art upward-planarization method (showing that it is usually close to the optimum).
Grid sifting
Authors: Bachmaier Christian , Brunner Wolfgang , Gleißner Andreas 
Published: October 2012

Directed graphs are commonly drawn by the Sugiyama algorithm where first vertices are placed on distinct hierarchical levels, and second vertices on the same level are permuted to reduce the overall number of crossings. Separating these two phases simplifies the algorithms but diminishes the quality of the result.
We introduce a combined leveling and crossing reduction algorithm based on sifting, which prioritizes few crossings over few levels. It avoids type 2 conflicts, which are crossings of edges whose endpoints are dummy vertices. This helps straightening long edges spanning many levels. The obtained running time is roughly quadratic in the size of the input graph and independent of dummy vertices.
Sentiment analysis of speech prosody for dialogue adaptation in a diet suggestion program
Authors: Crouch Scott , Khosla Rajiv 
Published: October 2012

In recent years, programs have been developed which allow robots to engage in simple dialogues with hospital and aged-care patients in order to provide information on and give healthrelated advice. To enable the robot to be persuasive and be accepted by the patient, it must not only understand their responses, but also understand their emotional state [1]. This information can then be used to modify the robot's responses. In an example dialogue, the robot asks whether the patient believes they overeat, to which the patient might respond "I don't overeat". If the patient has responded in a negative emotional tone, this may indicate a refusal to acknowledge the problem rather than the absence of it. In addition, the robot needs to learn to avoid responses which may provoke the patient. At that stage the goal of the robot is to convince the patient to acknowledge the problem before developing ways to solve it.
One method of collecting data about patients' emotional state is to analyze prosodic features of their speech. Prosodic features are the patterns of frequency, energy (volume), and rate of speech. Prosodic features have been known for a long time to reflect the speaker's emotional state, as was first documented by Charles Darwin in The Descent of Man [2], which also showed that, even in other animals whose vocalizations contain no linguistic properties, feelings can be expressed.
The main motivation for the development of this software is to improve upon a diet-suggestion dialogue system currently being developed and tested in aged-care homes.1 The elderly subject engages in dialogue with a health care robot, which provides suggestions to that person's diet, whilst also raising their motivation levels, and improve their perception of the robotic agent.
Genetically Mediated Nf1 Loss in Mice Promotes Diverse Radiation-Induced Tumors Modeling Second Malignant Neoplasms
Authors: Choi Grace , Huang Brian , Pinarbasi Emile , Braunstein Steve E. , Horvai Andrew E. , Kogan Scott , Bhatia Smita , Faddegon Bruce , Nakamura Jean L. 
Published: October 2012

Abstract
Second malignant neoplasms (SMN) are therapy-induced malignancies and a growing problem in cancer survivors, particularly survivors of childhood cancers. The lack of experimental models of SMNs has limited understanding of their pathogenesis. It is currently not possible to predict or prevent this devastating late complication. Individuals with neurofibromatosis I (NF1) are at increased risk of developing therapy-induced cancers for unclear reasons. To model SMNs, we replicated clinical radiotherapy and delivered fractionated abdominal irradiation to Nf1+/− and wild-type mice. Similar to irradiated cancer survivors, irradiated wild-type and Nf1+/− mice developed diverse in-field malignancies. In Nf1+/− mice, fractionated irradiation promoted both classical NF1-associated malignancies and malignancies unassociated with the NF1 syndrome but typical of SMNs. Nf1 heterozygosity potentiated the mutagenic effects of irradiation, as evidenced by the significantly reduced survival after irradiation and tumor development that was often characterized by synchronous primary tumors. Interestingly, diverse radiation-induced tumors arising in wild-type and Nf1+/− mice shared a genetic signature characterized by monoallelic loss of Nf1 and the adjacent Trp53 allele. These findings implicate Nf1 loss as mediating tumorigenesis in a broad range of cell types and organs extending beyond the classical NF1 tumor histologies. Examining clinical SMN samples, we found LOH of NF1 in SMNs from non-NF1 patients. Nf1 heterozygosity confers broad susceptibility to genotoxin-induced tumorigenesis, and this paradigm serves as an experimental platform for future studies of SMNs. Cancer Res; 72(24); 6425–34. ©2012 AACR.
Identification and Acute Targeting of Gaps in Atrial Ablation Lesion Sets Using a Real-Time Magnetic Resonance Imaging System
Authors: Ranjan Ravi , Kholmovski Eugene G , Blauer Joshua , Vijayakumar Sathya , Volland Nelly A. , Salama Mohamed E. , Parker Dennis L. , MacLeod Rob , Marrouche Nassir F. 
Published: October 2012

Background—
Radiofrequency ablation is routinely used to treat cardiac arrhythmias, but gaps remain in ablation lesion sets because there is no direct visualization of ablation-related changes. In this study, we acutely identify and target gaps using a real-time magnetic resonance imaging (RT-MRI) system, leading to a complete and transmural ablation in the atrium.

Methods and Results—

A swine model was used for these studies (n=12). Ablation lesions with a gap were created in the atrium using fluoroscopy and an electroanatomic system in the first group (n=5). The animal was then moved to a 3-tesla MRI system where high-resolution late gadolinium enhancement MRI was used to identify the gap. Using an RT-MRI catheter navigation and visualization system, the gap area was ablated in the MR scanner. In a second group (n=7), ablation lesions with varying gaps in between were created under RT-MRI guidance, and gap lengths determined using late gadolinium enhancement MR images were correlated with gap length measured from gross pathology. Gaps up to 1.0 mm were identified using gross pathology, and gaps up to 1.4 mm were identified using late gadolinium enhancement MRI. Using an RT-MRI system with active catheter navigation gaps can be targeted acutely, leading to lesion sets with no gaps. The correlation coefficient (
R
2
) between the gap length was identified using MRI, and the gross pathology was 0.95.

Conclusions—
RT-MRI system can be used to identify and acutely target gaps in atrial ablation lesion sets. Acute targeting of gaps in ablation lesion sets can potentially lead to significant improvement in clinical outcomes.
Comorbidity and Ventricular and Vascular Structure and Function in Heart Failure With Preserved Ejection Fraction
Authors: Mohammed Selma F. , Borlaug Barry A. , Roger Véronique L. , Mirzoyev Sultan A. , Rodeheffer Richard J. , Chirinos Julio A. , Redfield Margaret M. 
Published: October 2012

Background—
Patients with heart failure and preserved ejection fraction (HFpEF) display increased adiposity and multiple comorbidities, factors that in themselves may influence cardiovascular structure and function. This has sparked debate as to whether HFpEF represents a distinct disease or an amalgamation of comorbidities. We hypothesized that fundamental cardiovascular structural and functional alterations are characteristic of HFpEF, even after accounting for body size and comorbidities.

Methods and Results—
Comorbidity-adjusted cardiovascular structural and functional parameters scaled to independently generated and age-appropriate allometric powers were compared in community-based cohorts of HFpEF patients (n=386) and age/sex-matched healthy n=193 and hypertensive, n=386 controls. Within HFpEF patients, body size and concomitant comorbidity-adjusted cardiovascular structural and functional parameters and survival were compared in those with and without individual comorbidities. Among HFpEF patients, comorbidities (obesity, anemia, diabetes mellitus, and renal dysfunction) were each associated with unique clinical, structural, functional, and prognostic profiles. However, after accounting for age, sex, body size, and comorbidities, greater concentric hypertrophy, atrial enlargement and systolic, diastolic, and vascular dysfunction were consistently observed in HFpEF compared with age/sex-matched normotensive and hypertensive.

Conclusions—
Comorbidities influence ventricular-vascular properties and outcomes in HFpEF, yet fundamental disease-specific changes in cardiovascular structure and function underlie this disorder. These data support the search for mechanistically targeted therapies in this disease.
Analysis of water sorption and thermal conductivity of expanded polystyrene insulation materials
Authors: Lakatos Ákos , Kalmár Ferenc 
Published: October 2012

This article presents the results of water sorption properties investigation and thermal conductivity measurements of expanded polystyrene thermal insulation materials with different mass densities. The sorption behaviour of the expanded polystyrene materials was achieved in a Climacell 111 type climatic chamber, after drying in a Venticell 111 type desiccator apparatus. The relative humidity varied from 25% to 90% at 293 K for 240 min. The thermal conductivity of each sample was determined using a Holometrix 2000 (HLS) heat flow meter. In this article, the sorption isotherms, sorption kinetics, thermal conductivities and the prediction of changes in function of water content of four pure expanded polystyrene (30, 100, 150, 200 and grey) slabs with different densities (14, 17.5, 23.7 and 27.5 kg/m3) and one expanded polystyrene mixed with graphite are given (grey expanded polystyrene). Practical application: The thermal conductivity as well as the moisture content are key thermal transport properties of building materials. The role of insulating materials in the building energy and moisture balance is more significant when compared with the other materials of the building structures. The laboratory measurements of these values of the insulating materials are very important either for the manufacturers or the contractors. The available bibliographic data for these materials are strongly incomplete and somewhere out of date.
Effect of Vocal Fold Injury Location on Vibratory Parameters in Excised Canine Larynges
Authors: Krausert Christopher R. , Ying Di , Choi Seong Hee , Hoffman Matthew R. , Jiang Jack J. 
Published: October 2012

ObjectiveTo investigate the effect of vocal fold injury location on vibratory amplitude and lateral phase difference.Study DesignRepeated measures with each excised canine larynx serving as own control.SettingBasic science study conducted in university laboratory.MethodsVocal fold vibration of excised canine larynges was recorded with a high‐speed camera before and after inducing vocal fold injury at 1 of 5 locations: anterior, middle, posterior, medial, or superior. Medial and superior injuries were created within the middle third of the vocal fold. Five larynges were used for each of the 5 injury locations. Kymography was performed at the midpoint of the vocal folds for each video. Pre‐ and postinjury vibratory amplitude and lateral phase difference were compared for each location.ResultsThe anterior and medial injuries produced consistent decreases in vibratory amplitude. Middle and posterior injuries might slightly decrease amplitude. Superior injuries seemed to have no effect on amplitude. Anterior and medial injuries induced phase asymmetry between the right and left vocal folds. Middle injuries appeared to affect phase difference slightly, whereas posterior and superior injuries had no effect.ConclusionInjury to the anterior or medial portions of the vocal fold may be most likely to cause abnormal vocal fold vibration. Using caution in these locations during phonosurgery may favor superior postoperative vocal outcomes.
A preliminary randomized controlled study on the effectiveness of vestibular-specific neuromuscular training in children with hearing impairment
Authors: Rajendran Venkadesan , Roy Finita Glory , Jeevanantham Deepa 
Published: October 2012

Objective: To determine the effectiveness of vestibular-specific neuromuscular training on motor skills, balance and health-related quality of life in children with hearing impairment. Design: Controlled, randomized, preliminary study. Setting: Rehabilitation school for children with hearing impairment. Subjects and intervention: Twenty-three children with mean age of 7.5–8.1 years with hearing impairment were randomized to either the intervention or the control group. Children in the experimental group ( n = 11) participated in vestibular-specific neuromuscular training for six weeks and the children in the control group continued their regular activities followed at school. Outcome measures: Measurement of motor skills (Test of Gross Motor Development-2), postural control (Pediatric Reach Test, One Leg Standing Balance Test and postural sway meter) and health-related quality of life (PedsQL Generic Core Scale). Results: Following intervention, the scores of motor skills (Test of Gross Motor Development P = 0.02; throw for distance P = 0.042; kick for distance P = 0.08; jump for distance P = 0.001; 15-yard dash P = 0.001), postural control measures (Pediatric Reach Test P = 0.001; One Leg Standing Test P = 0.03; and anteroposterior sway (eyes open P = 0.007, eyes closed P = 0.03); mediolateral sway (eyes open P = 0.014, eyes closed P = 0.017) and health-related quality of life ( P = 0.01) improved significantly in the experimental group and not in the control group. Conclusion: The findings of the study suggest that vestibular-specific neuromuscular training programme may improve the motor skills, balance and health-related quality of life in children with hearing impairment.