bluuebunny/crossref_metadata_2025 huggingface dataset:
TOLERANCE DESIGN OF ANALOG CIRCUITS USING A BRANCH-AND-BOUND BASED APPROACH
Authors: PEHL MICHAEL , GRAEB HELMUT
Published: January 2013

The design of circuits which are robust against variations in operating and process conditions is crucial in today's IC industry. In the analog design flow this problem can be tackled during the sizing of a new circuit. However, hardly any methods are available which support the designer to compute such a robust design if discrete parameters should be considered in this design step. Discrete parameters arise predominantly if a layout-friendly sizing should be computed in the sense that, e.g., a manufacturing grid for the transistor lengths and widths is considered or that transistor multipliers are used to allow the layout of a transistor as multifinger or common centroid structure without applying rounding operations to the carefully computed sizing. This paper presents a new Branch-and-Bound based approach which allows the automatic computation of a robust design using classical and realistic worst case analysis. The results of the sizing of three circuits show that the new approach is highly efficient. The robustness of the results computed by the new approach is validated by Monte Carlo analyses.
ON THE ROLE OF SCREENING AND EDUCATIONAL CAMPAIGNS ON CONTROLLING HCV IN CORRECTIONAL INSTITUTIONS
Authors: MUSHAYABASA S. , BHUNU C. P. , MAGOMBEDZE G. , STEWART A. G. R.
Published: January 2013

The prevalence of infection with hepatitis C virus (HCV) is higher among prison inmates compared with the general population because of the high proportion of intravenous drug misusers. In this paper, a mathematical model for the spread of HCV in correctional institutions is developed and analyzed. The impact of educational campaigns and screening of HCV infected individuals is examined. In the presence of screening, the study suggests that targeted education campaigns of more than 50% will be highly effective in controlling the sharing of injection equipment among intravenous drug users, thereby reducing HCV prevalence within the correctional institutions. Further, we applied optimal control theory to the proposed model. The controls represent educational campaigns and screening. The objective is based on minimizing cumulative latent and infectious cases within the correctional institution, while maximizing the number of susceptible nonintravenous drug misusers. The optimal control is characterized and numerically solved. Overall, the application of optimal control theory in this study suggests that, more effort should be devoted to educational campaigns compared to screening.
INVESTIGATION OF TSUNAMI PROPAGATION CHARACTERISTICS IN RIVER AND ON LAND INDUCED BY THE GREAT EAST JAPAN EARTHQUAKE 2011
Authors: ADITYAWAN MOHAMMAD BAGUS , ROH MIN , TANAKA HITOSHI , MANO AKIRA , UDO KEIKO
Published: January 2013

The Great East Japan Earthquake of March 11, 2011 generated a massive tsunami wave that severely damaged coastal areas of Japan. Furthermore, the wave propagated into rivers, causing damage upstream far from shore. Videos recorded during this tsunami event were collected and analyzed to estimate the celerity of tsunami propagation in river and on the land. The result shows good comparison with estimation based on theoretical approaches that use water level measurement data. It was found that the tsunami celerity in river is approximately 25–30 km/h, and moved upstream with gradual deceleration. However, wave celerity on land was decreased significantly due to debris and dominant ground friction. The propagation trend in river mainstream and floodplain behaves differently in the location where the mainstream is not parallel to the embankment. Tsunami discharge and velocity in a river induced by tsunami wave were estimated based on continuity equation using the measured water level variation along the Sunaoshi River. The maximum estimated discharge is approximately 152 m3/s with the maximum velocity of 1.4 m/s.
DETERMINISTIC STUDY ON THE POTENTIAL LARGE TSUNAMI HAZARD IN TAIWAN
Authors: WU TSO-REN
Published: January 2013

Taught by the lesson from the 2011 Tōhoku earthquake and tsunami, we aim to probe into the potential large-scale trench-typed tsunami threats to Taiwan by means of the deterministic method. In this paper, 18 trench-typed tsunami sources and the 4 fault-typed tsunami sources will be constructed. The detailed construction, including the rupture length and width, the scale of seismic moment, the slip as well as the dip angle, will be elaborated. The tsunami numerical model, COMCOT, will be applied to simulate tsunami propagation, run-up and inundation; multi-nested grids will be used for a complete simulation of the process of a tsunami from the beginning to the inundation. The simulation result shows that tsunami source from the northern segment of the Manila Trench will pose a serious threat to the safety of Taiwan's southwest coast. The tsunami energy from the Yap Trench can be substantially projected onto Taiwan, and threatens the coasts of northern, eastern, southern, as well as south-western Taiwan. The tsunami source from off the coast of Hualien will have a greater influence on the east coast of Taiwan.
A performance and energy comparison of convolution on GPUs, FPGAs, and multicore processors
Authors: Fowers Jeremy , Brown Greg , Wernsing John , Stitt Greg
Published: January 2013

Recent architectural trends have focused on increased parallelism via multicore processors and increased heterogeneity via accelerator devices (e.g., graphics-processing units, field-programmable gate arrays). Although these architectures have significant performance and energy potential, application designers face many device-specific challenges when choosing an appropriate accelerator or when customizing an algorithm for an accelerator. To help address this problem, in this article we thoroughly evaluate convolution, one of the most common operations in digital-signal processing, on multicores, graphics-processing units, and field-programmable gate arrays. Whereas many previous application studies evaluate a specific usage of an application, this article assists designers with design space exploration for numerous use cases by analyzing effects of different input sizes, different algorithms, and different devices, while also determining Pareto-optimal trade-offs between performance and energy.
PS-TLB
Authors: Li Yong , Melhem Rami , Jones Alex K.
Published: January 2013

Traversing the page table during virtual to physical address translation causes pipeline stalls when misses occur in the translation-lookaside buffer (TLB). State-of-the-art translation proposals typically optimize a single aspect of translation performance (e.g., translation sharing, context switch performance, etc.) with potential trade-offs of additional hardware complexity, increased translation latency, or reduced scalability. In this article, we propose the
partial sharing TLB
(PS-TLB), a fast and scalable solution that reduces off-chip translation misses without sacrificing the timing-critical requirement of on-chip translation. We introduce the
partial sharing buffer
(PSB) which leverages application page sharing characteristics using minimal additional hardware resources. Compared to the leading TLB proposal that leverages sharing, PS-TLB provides a more than 45% improvement in translation latency with a 9% application speedup while using fewer storage resources. In addition, the page classification and PS-TLB architecture provide further optimizations including an over 30% reduction of interprocessor interrupts for coherence, and reduced context switch misses with fewer resources compared with existing methods.
A script-based autotuning compiler system to generate high-performance CUDA code
Authors: Khan Malik , Basu Protonu , Rudy Gabe , Hall Mary , Chen Chun , Chame Jacqueline
Published: January 2013

This article presents a novel compiler framework for CUDA code generation. The compiler structure is designed to support
autotuning
, which employs empirical techniques to evaluate a set of alternative mappings of computation kernels and select the mapping that obtains the best performance. This article introduces a
Transformation Strategy Generator
, a meta-optimizer that generates a set of
transformation recipes
, which are descriptions of the mapping of the sequential code to parallel CUDA code. These recipes comprise a search space of possible implementations. This system achieves performance comparable and sometimes better than manually tuned libraries and exceeds the performance of a state-of-the-art GPU compiler.
Layout-oblivious compiler optimization for matrix computations
Authors: Cui Huimin , Yi Qing , Xue Jingling , Feng Xiaobing
Published: January 2013

Most scientific computations serve to apply mathematical operations to a set of preconceived data structures, e.g., matrices, vectors, and grids. In this article, we use a number of widely used matrix computations from the LINPACK library to demonstrate that complex internal organizations of data structures can severely degrade the effectiveness of compiler optimizations. We then present a data-layout-oblivious optimization methodology, where by isolating an abstract representation of the computations from complex implementation details of their data, we enable these computations to be much more accurately analyzed and optimized through varying state-of-the-art compiler technologies. We evaluated our approach on an Intel 8-core platform using two source-to-source compiler infrastructures, Pluto and EPOD. Our results show that while the efficiency of a computational kernel differs when using different data layouts, the alternative implementations typically benefit from a common set of optimizations on the operations. Therefore separately optimizing the operations and the data layout of a computation could dramatically enhance the effectiveness of compiler optimizations compared with the conventional approaches of using a unified representation.
Optimal DPM and DVFS for frame-based real-time systems
Authors: Gerards Marco E. T. , Kuper Jan
Published: January 2013

Dynamic Power Management (DPM) and Dynamic Voltage and Frequency Scaling (DVFS) are popular techniques for reducing energy consumption. Algorithms for optimal DVFS exist, but optimal DPM and the optimal combination of DVFS and DPM are not yet solved.

In this article we use well-established models of DPM and DVFS for frame-based systems. We show that it is not sufficient—as some authors argue—to consider only individual invocations of a task. We define a schedule that also takes interactions between invocations into account and prove—in a theoretical fashion—that this schedule is optimal.
Profile-guided floating- to fixed-point conversion for hybrid FPGA-processor applications
Authors: Chen Doris , Singh Deshanand
Published: January 2013

The key to enabling widespread use of FPGAs for algorithm acceleration is to allow programmers to create efficient designs without the time-consuming hardware design process. Programmers are used to developing scientific and mathematical algorithms in high-level languages (C/C++) using floating point data types. Although easy to implement, the dynamic range provided by floating point is not necessary in many applications; more efficient implementations can be realized using fixed point arithmetic. While this topic has been studied previously [Han et al. 2006; Olson et al. 1999; Gaffar et al. 2004; Aamodt and Chow 1999], the degree of full automation has always been lacking. We present a novel design flow for cases where FPGAs are used to offload computations from a microprocessor. Our LLVM-based algorithm inserts value profiling code into an unmodified C/C++ application to guide its automatic conversion to fixed point. This allows for fast and accurate design space exploration on a host microprocessor before any accelerators are mapped to the FPGA. Through experimental results, we demonstrate that fixed-point conversion can yield resource savings of up to 2x--3x reductions. Embedded RAM usage is minimized, and 13%--22% higher

F
max

than the original floating-point implementation is observed. In a case study, we show that 17% reduction in logic and 24% reduction in register usage can be realized by using our algorithm in conjunction with a High-Level Synthesis (HLS) tool.
Lock-contention-aware scheduler
Authors: Cui Yan , Wang Yingxin , Chen Yu , Shi Yuanchun
Published: January 2013

In response to the increasing ubiquity of multicore processors, there has been widespread development of multithreaded applications that strive to realize their full potential. Unfortunately, lock contention within operating systems can limit the scalability of multicore systems so severely that an increase in the number of cores can actually lead to reduced performance (i.e., scalability collapse).

Existing efforts of solving scalability collapse mainly focus on making critical sections of kernel code fine-grained or designing new synchronization primitives. However, these methods have disadvantages in scalability or energy efficiency. In this article, we observe that the percentage of lock-waiting time over the total execution time for a lock intensive task has a significant correlation with the occurrence of scalability collapse. Based on this observation, a lock-contention-aware scheduler is proposed. Specifically, each task in the scheduler monitors its percentage of lock waiting time continuously. If the percentage exceeds a predefined threshold, this task is considered as lock intensive and migrated to a Special Set of Cores (i.e., SSC). In this way, the number of concurrently running lock-intensive tasks is limited to the number of cores in the SSC, and therefore, the degree of lock contention is controlled. A central challenge of using this scheme is how many cores should be allocated in the SSC to handle lock-intensive tasks. In our scheduler, the optimal number of cores is determined online by the model-driven search.

The proposed scheduler is implemented in the recent Linux kernel and evaluated using micro- and macrobenchmarks on AMD and Intel 32-core systems. Experimental results suggest that our proposal is able to remove scalability collapse completely and sustains the maximal throughput of the spin-lock-based system for most applications. Furthermore, the percentage of lock-waiting time can be reduced by up to 84%. When compared with scalability collapse reduction methods such as requester-based locking scheme and sleeping-based synchronization primitives, our scheme exhibits significant advantages in scalability, power consumption, and energy efficiency.
HC-CART
Authors: Chrysos Grigorios , Dagritzikos Panagiotis , Papaefstathiou Ioannis , Dollas Apostolos
Published: January 2013

Data mining is a new field of computer science with a wide range of applications. Its goal is to extract knowledge from massive datasets in a human-understandable structure, for example, the decision trees. In this article we present an innovative, high-performance, system-level architecture for the Classification And Regression Tree (CART) algorithm, one of the most important and widely used algorithms in the data mining area. Our proposed architecture exploits parallelism at the decision variable level, and was fully implemented and evaluated on a modern high-performance reconfigurable platform, the Convey HC-1 server, that features four FPGAs and a multicore processor. Our FPGA-based implementation was integrated with the widely used “rpart” software library of the R project in order to provide the first fully functional reconfigurable system that can handle real-world large databases. The proposed system, named HC-CART system, achieves a performance speedup of up to two orders of magnitude compared to well-known single-threaded data mining software platforms, such as WEKA and the R platform. It also outperforms similar hardware systems which implement parts of the complete application by an order of magnitude. Finally, we show that the HC-CART system offers higher performance speedup than some other proposed parallel software implementations of decision tree construction algorithms.
Fair CPU time accounting in CMP+SMT processors
Authors: Luque Carlos , Moreto Miquel , Cazorla Francisco J. , Valero Mateo
Published: January 2013

Processor architectures combining several paradigms of Thread-Level Parallelism (TLP), such as CMP processors in which each core is SMT, are becoming more and more popular as a way to improve performance at a moderate cost. However, the complex interaction between running tasks in hardware shared resources in multi-TLP architectures introduces complexities when accounting CPU time (or CPU utilization) to tasks. The CPU utilization accounted to a task depends on both the time it runs in the processor and the amount of processor hardware resources it receives. Deploying systems with accurate CPU accounting mechanisms is necessary to increase fairness. Moreover, it will allow users to be fairly charged on a shared data center, facilitating server consolidation in future systems.

In this article we analyze the accuracy and hardware cost of previous CPU accounting mechanisms for pure-CMP and pure-SMT processors and we show that they are not adequate for CMP+SMT processors. Consequently, we propose a new accounting mechanism for CMP+SMT processors which: (1) increases the accuracy of accounted CPU utilization; (2) provides much more stable results over a wide range of processor setups; and (3) does not require tracking all hardware shared resources, significantly reducing its implementation cost. In particular, previous proposals lead to inaccuracies between 21% and 79% when measuring CPU utilization in an 8-core 2-way SMT processor, while our proposal reduces this inaccuracy to less than 5.0%.
Polyhedral parallel code generation for CUDA
Authors: Verdoolaege Sven , Carlos Juega Juan , Cohen Albert , Ignacio Gómez José , Tenllado Christian , Catthoor Francky
Published: January 2013

This article addresses the compilation of a sequential program for parallel execution on a modern GPU. To this end, we present a novel source-to-source compiler called PPCG. PPCG singles out for its ability to accelerate computations from any static control loop nest, generating multiple CUDA kernels when necessary. We introduce a multilevel tiling strategy and a code generation scheme for the parallelization and locality optimization of imperfectly nested loops, managing memory and exposing concurrency according to the constraints of modern GPUs. We evaluate our algorithms and tool on the entire PolyBench suite.
PARTANS
Authors: Lutz Thibaut , Fensch Christian , Cole Murray
Published: January 2013

GPGPUs are a powerful and energy-efficient solution for many problems. For higher performance or larger problems, it is necessary to distribute the problem across multiple GPUs, increasing the already high programming complexity.

In this article, we focus on abstracting the complexity of multi-GPU programming for stencil computation. We show that the best strategy depends not only on the stencil operator, problem size, and GPU, but also on the PCI express layout. This adds nonuniform characteristics to a seemingly homogeneous setup, causing up to 23% performance loss. We address this issue with an autotuner that optimizes the distribution across multiple GPUs.
Abstracts of recent doctoral dissertations in computer algebra
Authors: Johnson Jeremy
Published: January 2013

Each month we are pleased to present abstracts of recent doctoral dissertations in Computer Algebra and Symbolic Computation. We encourage all recent Ph.D. graduates (and their supervisors), who have defended in the past two years, to submit their abstracts for publication in CCA. Please send abstracts to the CCA editors  for consideration.
POLY
Authors: Monagan Michael , Pearce Roman
Published: January 2013

We demonstrate how a new data structure for sparse distributed polynomials in the Maple kernel significantly accelerates a large subset of Maple library routines. The POLY data structure and its associated kernel operations (degree, coeff, subs, has, diff, eval, ...) are programmed for high scalability, allowing polynomials to have hundreds of millions of terms, and very low overhead, increasing parallel speedup in existing routines and improving the performance of high level Maple library routines.
Automated artifact-free seafloor surface reconstruction with two-step ODETLAP
Authors: Lau Tsz-Yam , Franklin W. Randolph
Published: January 2013

We present an updated artifact-free seafloor surface reconstruction scheme which preserves more terrain features than our previous attempt using overdetermined Laplacian Partial Differential Equation (ODETLAP) and automates the adjustment of smoothing parameter. The high resolution version of such a surface fitting problem remains a challenge since we are still confined to extremely unevenly distributed depth samples collected along and near the ships, in which case numerous generic reconstruction algorithms generate unacceptable surfaces featuring abnormal depth fluctuations which are correlated with the trackline locations. Previously we reported the use a modified ODETLAP scheme, which integrates data-density-dependent smoothing into the reconstruction process, to generate surfaces which are free from such acquisition footprint. However, that scheme still suffers from terrain feature loss due to smoothing, and the reliance of human to decide appropriate smoothing factor. This paper aims to fix these two problems with a two-step ODETLAP procedure. The procedure first applies an accuracy-biased ODETLAP to complete the missing depth data from the given samples. After that, the vigorous depth fluctuations along the tracklines are removed by applying a smoothing-biased ODETLAP on the completed depth grid. To decide the optimal smoothing factor automatically, the procedure computes the areas of the individual bumps on the reconstructed surface. A surface suffering heavily from the artifacts has many small bumps but few big ones. Smoothing reduces such skewness. We find that for many datasets, the artifact is mostly gone when the coefficient of variation of the areas drops to around 1.3. Using that value to gauge the smoothing factor, the automated scheme successfully generates artifact-free seafloor surfaces within a limited error budget.
Knowledge acquisition about places
Authors: Winter Stephan , Janowicz Krzysztof , Richter Kai-Florian , Vasardani Maria
Published: January 2013

Place, a concept originating from human geography [1, 2], has recently become a hot topic in GIScience: place is important in human cognition and communication, and hence, is a high priority for human-computer interaction research. But place is also a challenging concept to model, reason with, and analyze in information systems, because of its fluency with context shifts, and its underspecification [3]. Thinking about knowledge acquisition methods---from geographic information retrieval from big data to dedicated user generated content---they seem to involve several disciplines such as computational linguistics, data mining, artificial intelligence, and geographic information science.
On the equivalence of PLSI and projected clustering
Authors: Aggarwal Charu C.
Published: January 2013

The problem of projected clustering was first proposed in the ACMSIGMOD Conference in 1999, and theProbabilistic Latent Semantic Indexing (PLSI)technique was independently proposed in the ACMSIGIR Conference in the same year. Since then, more than two thousand papers have been written on these problems by the database, data mining and information retrieval communities,along completely independent lines of work. In this paper, we show that these two problems are essentially equivalent, under a probabilistic interpretation to the projected clustering problem. We will show that the EM-algorithm, when applied to the probabilistic version of the projected clustering problem, can be almost identically interpreted as the PLSI technique. The implications of this equivalence are significant, in that they imply the cross-usability of many of the techniques which have been developed for these problems over the last decade. We hope that our observations about the equivalence of these problems will stimulate further research which can significantly improve the currently available solutions for either of these problems.
The HERMIT in the machine
Authors: Farmer Andrew , Gill Andy , Komp Ed , Sculthorpe Neil
Published: January 2013

The importance of reasoning about and refactoring programs is a central tenet of functional programming. Yet our compilers and development toolchains only provide rudimentary support for these tasks. This paper introduces a programmatic and compiler-centric interface that facilitates refactoring and equational reasoning. To develop our ideas, we have implemented HERMIT, a toolkit enabling informal but systematic transformation of Haskell programs from
inside
the Glasgow Haskell Compiler's optimization pipeline. With HERMIT, users can experiment with optimizations and equational reasoning, while the tedious heavy lifting of performing the actual transformations is done for them.

HERMIT provides a transformation API that can be used to build higher-level rewrite tools. One use-case is prototyping new optimizations as clients of this API before being committed to the GHC toolchain. We describe a HERMIT application - a read-eval-print shell for performing transformations using HERMIT. We also demonstrate using this shell to prototype an optimization on a specific example, and report our initial experiences and remaining challenges.
Template your boilerplate
Authors: Adams Michael D. , DuBuisson Thomas M.
Published: January 2013

Generic programming allows the concise expression of algorithms that would otherwise require large amounts of handwritten code. A number of such systems have been developed over the years, but a common drawback of these systems is poor runtime performance relative to handwritten, non-generic code. Generic-programming systems vary significantly in this regard, but few consistently match the performance of handwritten code. This poses a dilemma for developers. Generic-programming systems offer concision but cost performance. Handwritten code offers performance but costs concision.

This paper explores the use of Template Haskell to achieve the best of both worlds. It presents a generic-programming system for Haskell that provides both the concision of other generic-programming systems and the efficiency of handwritten code. Our system gives the programmer a high-level, generic-programming interface, but uses Template Haskell to generate efficient, non-generic code that outperforms existing generic-programming systems for Haskell.

This paper presents the results of benchmarking our system against both handwritten code and several other generic-programming systems. In these benchmarks, our system matches the performance of handwritten code while other systems average anywhere from two to twenty times slower.
Feat
Authors: Duregård Jonas , Jansson Patrik , Wang Meng
Published: January 2013

In mathematics, an enumeration of a set
S
is a bijective function from (an initial segment of) the natural numbers to
S
. We define "functional enumerations" as efficiently computable such bijections. This paper describes a theory of functional enumeration and provides an algebra of enumerations closed under sums, products, guarded recursion and bijections. We partition each enumerated set into numbered, finite subsets.

We provide a generic enumeration such that the number of each part corresponds to the size of its values (measured in the number of constructors). We implement our ideas in a Haskell library called
testing-feat
, and make the source code freely available. Feat provides efficient "random access" to enumerated values. The primary application is property-based testing, where it is used to define both random sampling (for example QuickCheck generators) and exhaustive enumeration (in the style of SmallCheck). We claim that functional enumeration is the best option for automatically generating test cases from large groups of mutually recursive syntax tree types. As a case study we use Feat to test the pretty-printer of the Template Haskell library (uncovering several bugs).
Monoids
Authors: Yorgey Brent A.
Published: January 2013

The
monoid
is a humble algebraic structure, at first glance even downright boring. However, there's much more to monoids than meets the eye. Using examples taken from the
diagrams
vector graphics framework as a case study, I demonstrate the power and beauty of monoids for library design. The paper begins with an extremely simple model of diagrams and proceeds through a series of incremental variations, all related somehow to the central theme of monoids. Along the way, I illustrate the power of compositional semantics; why you should also pay attention to the monoid's even humbler cousin, the
semigroup
; monoid homomorphisms; and monoid actions.
Dependently typed programming with singletons
Authors: Eisenberg Richard A. , Weirich Stephanie
Published: January 2013

Haskell programmers have been experimenting with dependent types for at least a decade, using clever encodings that push the limits of the Haskell type system. However, the cleverness of these encodings is also their main drawback. Although the ideas are inspired by dependently typed programs, the code looks significantly different. As a result, GHC implementors have responded with extensions to Haskell's type system, such as GADTs, type families, and datatype promotion. However, there remains a significant difference between programming in Haskell and in full-spectrum dependently typed languages. Haskell enforces a phase separation between runtime values and compile-time types. Therefore, singleton types are necessary to express the dependency between values and types. These singleton types introduce overhead and redundancy for the programmer.

This paper presents the singletons library, which generates the boilerplate code necessary for dependently typed programming using GHC. To compare with full-spectrum languages, we present an extended example based on an Agda interface for safe database access. The paper concludes with a detailed discussion on the current capabilities of GHC for dependently typed programming and suggestions for future extensions to better support this style of programming.
xmonad in Coq
(experience report)
Authors: Swierstra Wouter
Published: January 2013

This report documents the insights gained from implementing the core functionality of xmonad, a popular window manager written in Haskell, in the Coq proof assistant. Rather than focus on verification, this report outlines the technical challenges involved with incorporating Coq code in a Haskell project.
Layout-sensitive language extensibility with SugarHaskell
Authors: Erdweg Sebastian , Rieger Felix , Rendel Tillmann , Ostermann Klaus
Published: January 2013

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more scenarios (e.g., arrow notation in GHC), and some Haskell programmers implement preprocessors for their individual needs (e.g., idiom brackets in SHE). But manually written preprocessors cannot scale: They are expensive, error-prone, and not composable. Most researchers and programmers therefore refrain from using the syntactic notations they need in actual Haskell programs, but only use them in documentation or papers. We present a syntactically extensible version of Haskell, SugarHaskell, that empowers ordinary programmers to implement and use custom syntactic sugar.

Building on our previous work on syntactic extensibility for Java, SugarHaskell integrates syntactic extensions as sugar libraries into Haskell's module system. Syntax extensions in SugarHaskell can declare arbitrary context-free and layout-sensitive syntax. SugarHaskell modules are compiled into Haskell modules and further processed by a Haskell compiler. We provide an Eclipse-based IDE for SugarHaskell that is extensible, too, and automatically provides syntax coloring for all syntax extensions imported into a module.

We have validated SugarHaskell with several case studies, including arrow notation (as implemented in GHC) and EBNF as a concise syntax for the declaration of algebraic data types with associated concrete syntax. EBNF declarations also show how to extend the extension mechanism itself: They introduce syntactic sugar for using the declared concrete syntax in other SugarHaskell modules.
Planar Printed Shorted Monopole Antenna with Coupled Feed for LTE/WWAN Mobile Handset Applications
Authors: Kang Do-Gu , Sung Youngje
Published: January 2013

A shorted monopole antenna with coupled feed for LTE/WWAN mobile handset applications is described. The basic resonance of the shorted monopole combines with the resonance formed by the coupling between the coupling strip and the feeding pad to cover the LTE700, GSM850, and GSM900 bands. Both the feeding pad and the coupling strip operate with the shorting strip as a loop antenna. The resonance of the loop antenna and the harmonics of the shorted monopole combine to cover the GSM1800, GSM1900, UMTS, and LTE2300 bands. A stable and omnidirectional radiation pattern with reasonable gain has been observed over the operating bandwidth.
Pacemaker Related Infective Endocarditis fromStaphylococcus Lugdunensis: A Case Report
Authors: Ward Michael , Boehm Kevin M.
Published: January 2013

Staphylococcus lugdunensisis a common skin flora not typically associated with infection. There are, however, several cases reported in the literature ofStaphylococcus lugdunensisas a causative bacterium of various infections. This paper reports an additional case of pacemaker associated endocarditis withStaphylococcus lugdunensisas the causative bacterium.
Analysis of Primary Stability of Dental Implants Inserted in Different Substrates Using the Pullout Test and Insertion Torque
Authors: Oliscovicz Nathalia Ferraz , Shimano Antônio Carlos , Marcantonio Junior Élcio , Lepri César Penazzo , dos Reis Andréa Candido
Published: January 2013

The aim of the study was to evaluate mechanical behavior of implants inserted in three substrates, by measuring the pullout strength and the relative stiffness. 32 implants (Master Porous-Conexao, cylindrical, external hexagon, and surface treatment) were divided into 4 groups (n=8): pig rib bone, polyurethane Synbone, polyurethane Nacional 40 PCF, and pinus wood. Implants were installed with the exact distance of 5 mm of another implant. The insertion torque (N·cm) was quantified using the digital Kratos torque meter and the pullout test (N) was performed by an axial traction force toward the long axis of the implant (2 min/mm) through mount implant devices attached to a piece adapted to a load cell of 200 Kg of a universal testing machine (Emic DL10000). Data of insertion torque and maximum pullout force were submitted to one-way ANOVA and Bonferroni tests (α=0.05). Polyurethane Nacional 40 PCF and pinus wood showed the highest values of insertion torque and pullout force, with significant statistical difference (P<0.05) with other groups. The analysis showed stiffness materials with the highest values for primary stability.
A Case of Prolonged Delayed Postdural Puncture Headache in a Patient with Multiple Sclerosis Exacerbated by Air Travel
Authors: Porhomayon Jahan , Zadeii Gino , Yarahamadi Alireza , Nader Nader D.
Published: January 2013

The developments of new spinal needles and needle tip designs have reduced the incidence of postdural puncture headache (PDPH). Although it is clear that reducing the loss of CSF leak from dural puncture reduces the headache, there are areas regarding the pathogenesis, treatment, and prevention of PDPH that remain controversial. Air travel by itself may impose physiological alteration in central nervous system that may be detrimental to patients with PDPH. This case report highlights a case of a young female patient who suffered from a severe incapacitating PDPH headache during high-altitude flight with a commercial jet.
The Zwitterionic Imidazolium Salt: First Used for Synthesis of 4‐Arylidene‐2‐phenyl‐5(4H)‐oxazolones under Solvent‐Free Conditions
Authors: Zhou Baocheng , Chen Wenxing
Published: January 2013

The zwitterionic imidazolium salt was prepared and characterized by 1H NMR. It was first used for synthesis of azlactones via Erlenmeyer synthesis from aromatic aldehydes and hippuric acid under solvent‐free conditions. It was found that aldehyde substituents play an important role in these reactions. Better conversions and therefore higher isolated yields were observed when electron‐withdrawing groups (EWG‐) were present in the aromatic aldehyde. Opposite results were shown when electron‐donating groups (EDG‐) were present in the aromatic aldehyde. However, azlactones were obtained in moderate to high yields.
Rossby Solitary Waves Generated by Wavy Bottom in Stratified Fluids
Authors: Yang Hongwei , Yin Baoshu , Zhong Bo , Dong Huanhe
Published: January 2013

Rossby solitary waves generated by a wavy bottom are studied in stratified fluids. From the quasigeostrophic vorticity equation including a wavy bottom and dissipation, by employing perturbation expansions and stretching transforms of time and space, a forced KdV-ILW-Burgers equation is derived through a new scale analysis, modelling the evolution of Rossby solitary waves. By analysis and calculation, based on the conservation relations of the KdV-ILW-Burgers equation, the conservation laws of Rossby solitary waves are obtained. Finally, the numerical solutions of the forced KdV-ILW-Burgers equation are given by using the pseudospectral method, and the evolutional feature of solitary waves generated by a wavy bottom is discussed. The results show that, besides the solitary waves, an additional harmonic wave appears in the wavy bottom forcing region, and they propagate independently and do not interfere with each other. Furthermore, the wavy bottom forcing can prevent wave breaking to some extent. Meanwhile, the effect of dissipation and detuning parameter on Rossby solitary waves is also studied. Research on the wavy bottom effect on the Rossby solitary waves dynamics is of interest in analytical geophysicalfluid dynamics.
Stabilizing Fuzzy Output Control for a Class of Nonlinear Systems
Authors: Krokavec Dušan , Filasová Anna
Published: January 2013

The paper presents new conditions suitable in design of a stabilizing output controller for a class of continuous-time nonlinear systems, represented by Takagi-Sugeno models. Taking into account the affine properties of the TS model structure and applying the fuzzy control scheme relating to the parallel distributed output compensators, the sufficient design conditions are outlined in terms of linear matrix inequalities. The proposed procedure decouples the Lyapunov matrix and the system parameter matrices in the LMIs and guarantees global stability of the system. Simulation result illustrates the design procedure and demonstrates the performances of the proposed design method.
A Tunable 3‐Terminal GMR Device Based on a Hybrid Magnetic‐Electric‐Barrier Nanostructure
Authors: Kong Y. H. , Chen S. Y. , Zhang G. L. , Fu X.
Published: January 2013

We propose a giant magnetoresistance (GMR) device, which can be experimentally realized by depositing two ferromagnetic (FM) strips and a Schottky metal (SM) stripe in parallel configuration on top of the GaAs heterostructure. The GMR effect ascribes a significant electron transmission difference between the parallel and antiparallel magnetization configurations of two FM stripes. Moreover, the MR ratio depends strongly on the magnetic strength of the magnetic barrier (MB) and the electric barrier (EB) height induced by an applied voltage to the SM stripe. Thus, this system can be used as a GMR device with tunable MR by an applied voltage to SM stripe or by magnetic strength of the MB.
Biomarkers in Multiple Sclerosis: An Up-to-Date Overview
Authors: Katsavos Serafeim , Anagnostouli Maria
Published: January 2013

During the last decades, the effort of establishing satisfactory biomarkers for multiple sclerosis has been proven to be very difficult, due to the clinical and pathophysiological complexities of the disease. Recent knowledge acquired in the domains of genomics-immunogenetics and neuroimmunology, as well as the evolution in neuroimaging, has provided a whole new list of biomarkers. This variety, though, leads inevitably to confusion in the effort of decision making concerning strategic and individualized therapeutics. In this paper, our primary goal is to provide the reader with a list of the most important characteristics that a biomarker must possess in order to be considered as reliable. Additionally, up-to-date biomarkers are further divided into three subgroups, genetic-immunogenetic, laboratorial, and imaging. The most important representatives of each category are presented in the text and for the first time in a summarizing workable table, in a critical way, estimating their diagnostic potential and their efficacy to correlate with phenotypical expression, neuroinflammation, neurodegeneration, disability, and therapeutical response. Special attention is given to the “gold standards” of each category, like HLA-DRB1* polymorphisms, oligoclonal bands, vitamin D, and conventional and nonconventional imaging techniques. Moreover, not adequately established but quite promising, recently characterized biomarkers, like TOB-1 polymorphisms, are further discussed.
Optimization of GMAW Process Parameters Using Particle Swarm Optimization
Authors: Sreeraj P. , Kannan T. , Maji Subhashis
Published: January 2013

To improve the corrosion-resistant properties of carbon steel cladding process is usually used. It is a process of depositing a thick layer of corrosion resistant material-over carbon steel plate. Most of the engineering applications require high strength and corrosion resistant materials for long-term reliability and performance. By cladding, these properties can be achieved with minimum cost. The main problem faced in cladding is the selection of optimum combinations of process parameters for achieving quality clad and hence good clad bead geometry. This paper highlights an experimental study to optimize various input process parameters (welding current, welding speed, gun angle, contact tip to work distance, and pinch) to get optimum dilution in stainless steel cladding of low-carbon structural steel plates using gas metal arc welding (GMAW). Experiments were conducted based on central composite rotatable design with full-replication technique and mathematical models were developed using multiple regression method. The developed models have been checked for adequacy and significance. Using particle swarm optimization (PSO) the parameters were optimized to get minimal dilution.
DLK1 Protein Expression during Mouse Development Provides New Insights into Its Function
Authors: Falix F. A. , Tjon-A-Loi M. R. S. , Gaemers I. C. , Aronson D. C. , Lamers W. H.
Published: January 2013

Delta-like 1 homolog (DLK1) is a noncanonical ligand in the Delta-Notch signalling pathway. Although Dlk1 mRNA is abundantly present embryonically and declines rapidly just before birth, Dlk1 knockouts display a relatively mild phenotype. To assess whether this mild phenotype was due to posttranscriptional regulation, we studied the expression of DLK1 protein in mouse embryos and found abundant expression in liver, lung, muscle, vertebrae, pancreas, pituitary, and adrenal gland(s). DLK1 expression was absent in heart, stomach, intestine, kidney, epidermis, and central nervous system. DLK1 protein expression, therefore, correlates well with the reported Dlk1 mRNA expression pattern, which shows that its expression is mainly regulated at the pretranslational level. The comparison of the reported expression patterns of Notch mRNA and those of DLK1 in organs where lineage commitment and branching morphogenesis are important developmental processes suggests that DLK1 is a ligand that prevents premature Notch-dependent differentiation, possibly by competing with canonical ligands.
CFD for Subcooled Flow Boiling: Parametric Variations
Authors: Rzehak Roland , Krepper Eckhard
Published: January 2013

We investigate the present capabilities of CFD for wall boiling. The computational model used combines the Euler/Euler two-phase flow description with heat flux partitioning. Very similar modeling was previously applied to boiling water under high pressure conditions relevant to nuclear power systems. Similar conditions in terms of the relevant nondimensional numbers have been realized in the DEBORA tests using dichlorodifluoromethane (R12) as the working fluid. This facilitated measurements of radial profiles for gas volume fraction, gas velocity, liquid temperature, and bubble size. Robust predictive capabilities of the modeling require that it is validated for a wide range of parameters. It is known that a careful calibration of correlations used in the wall boiling model is necessary to obtain agreement with the measured data. We here consider tests under a variety of conditions concerning liquid subcooling, flow rate, and heat flux. It is investigated to which extent a set of calibrated model parameters suffices to cover at least a certain parameter range.
Logic-Based Security Architecture for Systems Providing Multihop Communication
Authors: Almomani Iman , Al-Banna Eman , AL-Akhras Mousa
Published: January 2013

Security is a basic element of distributed systems such as ad hoc and sensor communication networks. Several standards define security requirements and enforcers, such as ITU-T Recommendations X.800 and X.805. It is essential to specify and analyze protocols to know which security requirements they achieve. This paper presents a logic-based security architecture (LBSA). LBSA is a systematic way to test if a protocol is secure by checking what security requirements are achieved. Different rules, actions, and sets which fit into the proposed LBSA are included, new ones are also added to complete the architecture. The key advantage of LBSA is that it enables a security protocol to prove its correctness mathematically. Mathematical proofs provided by LBSA cover more cases that usually cannot be covered exhaustively by simulation tools. This paper also specifies and analyzes several security enforcers and protocols and mathematically proves which security requirements they achieve. Mapping between security requirements and inference rules/actions is also provided to facilitate the use of LBSA. Some enforcers are analyzed using LBSA to demonstrate how they achieve security requirements. Finally, we take Ariadne protocol as a case study and show how to use the proposed LBSA architecture to prove that this protocol is secure.
Anionic Surfactant as a Corrosion Inhibitor for Synthesized Ferrous Alloy in Acidic Solution
Authors: Kellou-Kerkouche Farida , Benchettara Abdelkader , Amara Sif-Eddine
Published: January 2013

The effect of temperature on the corrosion behaviour of a synthesized iron-based alloy in 1 N sulphuric acid solution has been examined by means of three electrochemical techniques. Thereafter, we studied the influence of an anionic surfactant (sodium dodecyl benzene sulfonate) at various concentrations on the electrochemical behaviour of the ferrous alloy. The obtained results show that the temperature increase reduced the performance of the used alloy, in the acidic environment. Otherwise, the surfactant inhibits the alloy dissolution in the sulphuric acid, through its adsorption on the metal surface without modifying the mechanism of corrosion process. We also noticed that the highest inhibition effect is obtained at a concentration above its critical micelle concentration (CMC). Langmuir adsorption isotherm fits well with the experimental data.