bluuebunny/crossref_metadata_2025_split huggingface dataset:
Does Universal Controllability of Physical Systems Prohibit Thermodynamic Cycles?
Authors: Janzing Dominik , Wocjan Paweł 
Published: December 2018

Here we study the thermodynamic cost of computation and control using ‘physically universal’ cellular automata (CAs) or Hamiltonians. The latter were previously defined as systems that admit the implementation of any desired transformation on a finite target region by first initializing the state of the surrounding and then letting the system evolve according to its autonomous dynamics. This way, one obtains a model of control where each region can play both roles, the controller or the system to be controlled. In physically universal systems every degree of freedom is indirectly accessible by operating on the remaining degrees of freedom. In a nutshell, the thermodynamic cost of an operation is then given by the size of the region around the target region that needs to be initialized. In the meantime, physically universal CAs have been constructed by Schaeffer (in two dimensions) and Salo & Törmä (in one dimension). Here we show that in Schaeffer’s CA the cost for implementing n operations grows linearly in n, while operating in a thermodynamic cycle requires sublinear growth to ensure zero cost per operation in the limit n → ∞. Although this particular result need not hold for general physically universal CAs, this strong notion of universality does imply a certain kind of instability of information, which could result in lower bounds on the cost of protecting information from its noisy environment. The technical results of the paper are sparse and quite simple. The contribution of the paper is mainly conceptual and consists in illustrating the type of thermodynamic questions raised by models of control that rely on the concept of physical universality.
A much better replacement of the Michaelis–Menten equation and its application
Authors: Li Banghe , Li Bo , Shen Yuefeng 
Published: December 2018

Michaelis–Menten equation is a basic equation of enzyme kinetics and gives acceptable approximations of real chemical reaction processes. Analyzing the derivation of this equation yields the fact that its good performance of approximating real reaction processes is due to Michaelis–Menten curve (8). This curve is derived from Quasi-Steady-State Assumption (QSSA), which has been proved always true and called Quasi-Steady-State Law by Banghe Li et al. [Quasi-steady state laws in enzyme kinetics, J. Phys. Chem. A 112(11) (2008) 2311–2321].Here, we found a polynomial equation with total degree of four [Formula: see text] (14), which gives more accurate approximation of the reaction process in two aspects: during the quasi-steady-state of the reaction, Michaelis–Menten curve approximates the reaction well, while our equation [Formula: see text] gives better approximation; near the end of the reaction, our equation approaches the end of the reaction with a tangent line the same to that of the reaction process trajectory simulated by mass action, while Michaelis–Menten curve does not. In addition, our equation [Formula: see text] differs to Michaelis–Menten curve less than the order of [Formula: see text] as [Formula: see text] approaches [Formula: see text].By considering the above merits of [Formula: see text], we suggest it as a replacement of Michaelis–Menten curve. Intuitively, this new equation is more complex and harder to understand. But, just because of its complexity, it provides more information about the rate constants than Michaelis–Menten curve does.Finally, we get a better replacement of the Michaelis–Menten equation by combing [Formula: see text] and the equation [Formula: see text].
An Efficient UAV Hijacking Detection Method Using Onboard Inertial Measurement Unit
Authors: Feng Zhiwei , Guan Nan , Lv Mingsong , Liu Weichen , Deng Qingxu , Liu Xue , Yi Wang 
Published: December 2018

With the fast growth of civil drones, their security problems meet significant challenges. A commercial drone may be hijacked by a GPS-spoofing attack for illegal activities, such as terrorist attacks. The target of this article is to develop a technique that only uses onboard gyroscopes to determine whether a drone has been hijacked.
Ideally, GPS data and the angular velocities measured by gyroscopes can be used to estimate the acceleration of a drone, which can be further compared with the measurement of the accelerometer to detect whether a drone has been hijacked. However, the detection results may not always be accurate due to some calculation and measurement errors, especially when no hijacking occurs in curve trajectory situations. To overcome this, in this article, we propose a novel and simple method to detect hijacking only based on gyroscopes’ measurements and GPS data, without using any accelerometer in the detection procedure. The computational complexity of our method is very low, which is suitable to be implemented in the drones with micro-controllers. On the other hand, the proposed method does not rely on any accelerometer to detect attacks, which means it receives less information in the detection procedure and may reduce the results accuracy in some special situations. While the previous method can compensate for this flaw, the high detection results also can be guaranteed by using the above two methods. Experiments with a quad-rotor drone are conducted to show the effectiveness of the proposed method and the combination method.
Prediction and bounds on shared cache demand from memory access interleaving
Authors: Brock Jacob , Ding Chen , Lavaee Rahman , Liu Fangzhou , Yuan Liang 
Published: December 2018

Cache in multicore machines is often shared, and the cache performance depends on how memory accesses belonging to different programs interleave with one another. The full range of performance possibilities includes all possible interleavings, which are too numerous to be studied by experiments for any mix of non-trivial programs.
This paper presents a theory to characterize the effect of memory access interleaving due to parallel execution of non-data-sharing programs. The theory uses an established metric called the footprint (which can be used to calculate miss ratios in fully-associative LRU caches) to measure cache demand, and considers the full range of interleaving possibilities. The paper proves a lower bound for footprints of interleaved traces, and then formulates an upper bound in terms of the footprints of the constituent traces. It also shows the correctness of footprint composition used in a number of existing techniques, and places precise bounds on its accuracy.
Dynamic vertical memory scalability for OpenJDK cloud applications
Authors: Bruno Rodrigo , Ferreira Paulo , Synytsky Ruslan , Fydorenchyk Tetiana , Rao Jia , Huang Hang , Wu Song 
Published: December 2018

The cloud is an increasingly popular platform to deploy applications as it lets cloud users to provide resources to their applications as needed. Furthermore, cloud providers are now starting to offer a "pay-as-you-use" model in which users are only charged for the resources that are really used instead of paying for a statically sized instance. This new model allows cloud users to save money, and cloud providers to better utilize their hardware.
However, applications running on top of runtime environments such as the Java Virtual Machine (JVM) cannot benefit from this new model because they cannot dynamically adapt the amount of used resources at runtime. In particular, if an application needs more memory than what was initially predicted at launch time, the JVM will not allow the application to grow its memory beyond the maximum value defined at launch time. In addition, the JVM will hold memory that is no longer being used by the application. This lack of dynamic vertical scalability completely prevents the benefits of the "pay-as-you-use" model, and forces users to over-provision resources, and to lose money on unused resources.
We propose a new JVM heap sizing strategy that allows the JVM to dynamically scale its memory utilization according to the application's needs. First, we provide a configurable limit on how much the application can grow its memory. This limit is dynamic and can be changed at runtime, as opposed to the current static limit that can only be set at launch time. Second, we adapt current Garbage Collection policies that control how much the heap can grow and shrink to better fit what is currently being used by the application.
The proposed solution is implemented in the OpenJDK 9 HotSpot JVM, the new release of OpenJDK. Changes were also introduced inside the Parallel Scavenge collector and the Garbage First collector (the new by-default collector in HotSpot). Evaluation experiments using real workloads and data show that, with negligible throughput and memory overhead, dynamic vertical memory scalability can be achieved. This allows users to save significant amounts of money by not paying for unused resources, and cloud providers to better utilize their physical machines.
mPart: miss-ratio curve guided partitioning in key-value stores
Authors: Byrne Daniel , Onder Nilufer , Wang Zhenlin 
Published: December 2018

Web applications employ key-value stores to cache the data that is most commonly accessed. The cache improves an web application's performance by serving its requests from memory, avoiding fetching them from the backend database. Since the memory space is limited, maximizing the memory utilization is a key to delivering the best performance possible. This has lead to the use of multi-tenant systems, allowing applications to share cache space. In addition, application data access patterns change over time, so the system should be adaptive in its memory allocation.
In this work, we address both multi-tenancy (where a single cache is used for multiple applications) and dynamic workloads (changing access patterns) using a model that relates the cache size to the application miss ratio, known as a miss ratio curve. Intuitively, the larger the cache, the less likely the system will need to fetch the data from the database. Our efficient, online construction of the miss ratio curve allows us to determine a near optimal memory allocation given the available system memory, while adapting to changing data access patterns. We show that our model outperforms an existing state-of-the-art sharing model, Memshare, in terms of overall cache hit ratio and does so at a lower time cost. We show that for a typical system, overall hit ratio is consistently 1 percentage point greater and 99.9th percentile latency is reduced by as much as 2.9% under standard web application workloads containing millions of requests.
Verification of coarse-grained reconfigurable arrays through random test programs
Authors: Egger Bernhard , Song Eunjin , Lee Hochan , Shin Daeyoung 
Published: December 2018

We propose and evaluate a framework to test the functional correctness of coarse-grained reconfigurable array (CGRA) processors for pre-silicon verification and post-silicon validation. To reflect the reconfigurable nature of CGRAs, an architectural model of the system under test is built directly from the hardware description files. A guided place-and-routing algorithm is used to map operations and operands onto the heterogeneous processing elements (PE). Test coverage is maximized by favoring unexercised parts of the architecture. Requiring no explicit knowledge about the semantics of operations, the random test program generator (RTPG) framework seamlessly supports custom ISA extensions.
The proposed framework is applied to the Samsung Reconfigurable Processor, a modulo-scheduled CGRA integrated in smartphones, cameras, printers, and smart TVs. Experiments demonstrate that the RTPG is versatile, efficient, and quickly achieves a high coverage. In addition to detecting all randomly inserted faults, the generated test programs also exposed two yet unknown actual faults in the architecture.
Coherent explicit dictionary application for Haskell
Authors: Winant Thomas , Devriese Dominique 
Published: December 2018

Type classes are one of Haskell's most popular features and extend its type system with ad-hoc polymorphism. Since their conception, there were useful features that could not be offered because of the desire to offer two correctness properties: coherence and global uniqueness of instances. Coherence essentially guarantees that program semantics are independent from type-checker internals. Global uniqueness of instances is relied upon by libraries for enforcing, for example, that a single order relation is used for all manipulations of an ordered binary tree.
The features that could not be offered include explicit dictionary application and local instances, which would be highly useful in practice. In this paper, we propose a new design for offering explicit dictionary application, without compromising coherence and global uniqueness. We introduce a novel criterion based on GHC's type argument roles to decide when a dictionary application is safe with respect to global uniqueness of instances. We preserve coherence by detecting potential sources of incoherence, and prove it formally. Moreover, our solution makes it possible to use local dictionaries. In addition to developing our ideas formally, we have implemented a working prototype in GHC.
Ghosts of departed proofs (functional pearl)
Authors: Noonan Matt 
Published: December 2018

Library authors often are faced with a design choice: should a function with preconditions be implemented as a partial function, or by returning a failure condition on incorrect use? Neither option is ideal. Partial functions lead to frustrating run-time errors. Failure conditions must be checked at the use-site, placing an unfair tax on the users who have ensured that the function's preconditions were correctly met.
In this paper, we introduce an API design concept called ``ghosts of departed proofs'' based on the following observation: sophisticated preconditions can be encoded in Haskell's type system with no run-time overhead, by using proofs that inhabit phantom type parameters attached to newtype wrappers. The user expresses correctness arguments by constructing proofs to inhabit these phantom types. Critically, this technique allows the library user to decide when and how to validate that the API's preconditions are met.
The ``ghosts of departed proofs'' approach to API design can achieve many of the benefits of dependent types and refinement types, yet only requires some minor and well-understood extensions to Haskell 2010. We demonstrate the utility of this approach through a series of case studies, showing how to enforce novel invariants for lists, maps, graphs, shared memory regions, and more.
Drak/STK17A Drives Neoplastic Glial Proliferation through Modulation of MRLC Signaling
Authors: Chen Alexander S. , Wardwell-Ozgo Joanna , Shah Nilang N. , Wright Deidre , Appin Christina L. , Vigneswaran Krishanthan , Brat Daniel J. , Kornblum Harley I. , Read Renee D. 
Published: December 2018

Abstract

Glioblastoma (GBM) and lower grade gliomas (LGG) are the most common primary malignant brain tumors and are resistant to current therapies. Genomic analyses reveal that signature genetic lesions in GBM and LGG include copy gain and amplification of chromosome 7, amplification, mutation, and overexpression of receptor tyrosine kinases (RTK) such as EGFR, and activating mutations in components of the PI3K pathway. In Drosophila melanogaster, constitutive co-activation of RTK and PI3K signaling in glial progenitor cells recapitulates key features of human gliomas. Here we use this Drosophila glioma model to identify death-associated protein kinase (Drak), a cytoplasmic serine/threonine kinase orthologous to the human kinase STK17A, as a downstream effector of EGFR and PI3K signaling pathways. Drak was necessary for glial neoplasia, but not for normal glial proliferation and development, and Drak cooperated with EGFR to promote glial cell transformation. Drak phosphorylated Sqh, the Drosophila ortholog of nonmuscle myosin regulatory light chain (MRLC), which was necessary for transformation. Moreover, Anillin, which is a binding partner of phosphorylated Sqh, was upregulated in a Drak-dependent manner in mitotic cells and colocalized with phosphorylated Sqh in neoplastic cells undergoing mitosis and cytokinesis, consistent with their known roles in nonmuscle myosin-dependent cytokinesis. These functional relationships were conserved in human GBM. Our results indicate that Drak/STK17A, its substrate Sqh/MRLC, and the effector Anillin/ANLN regulate mitosis and cytokinesis in gliomas. This pathway may provide a new therapeutic target for gliomas.

Significance: These findings reveal new insights into differential regulation of cell proliferation in malignant brain tumors, which will have a broader impact on research regarding mechanisms of oncogene cooperation and dependencies in cancer.
See related commentary by Lathia, p. 1036
Is Time From Last Hospitalization for Heart Failure to Placement of a Primary Prevention Implantable Cardioverter-Defibrillator Associated With Patient Outcomes?
Authors: Ambrosy Andrew P. , Parzynski Craig S. , Friedman Daniel J. , Fudim Marat , Hernandez Adrian F. , Fonarow Gregg C. , Masoudi Frederick A. , Al-Khatib Sana M. 
Published: December 2018

Background:
Landmark studies have demonstrated the safety and efficacy of implantable cardioverter-defibrillators (ICDs) in selected stable ambulatory patients with heart failure (HF) with a reduced ejection fraction receiving optimal medical therapy. It is not known whether a recent hospitalization for HF before ICD placement is associated with subsequent outcomes.

Methods:
A post hoc analysis was performed of Medicare beneficiaries enrolled in the National Cardiovascular Data Registry’s ICD Registry with a known diagnosis of HF and an ejection fraction ≤35% underdoing a new ICD placement for primary prevention. Patients were grouped based on the timing of ICD placement from the last hospitalization for HF. The association between timing of ICD placement and outcomes was assessed by using multivariable logistic regression models.

Results:

The final analytic cohort included 81 180 patients undergoing initial ICD placement for primary prevention who were currently hospitalized for HF (n=11 563, 14%), hospitalized for HF within 3 months (n=6252, 8%), or hospitalized for HF >3 months previously or had no previous hospitalizations for HF (n=63 365, 78%). Patients currently or recently hospitalized for HF had a higher unadjusted composite periprocedural complication rate (2.60% versus 1.71% versus 1.25%,
P
<0.001). After adjusting for potential confounders, patients currently hospitalized for HF were at higher risk for death (odds ratio, 2.25; 95% CI, 2.02–2.52;
P
<0.001) and all-cause readmission (odds ratio, 1.89; 95% CI, 1.79–1.99;
P
<0.001) at 90 days.

Conclusion:
Older patients currently or recently hospitalized for HF undergoing initial ICD placement for primary prevention experienced a higher rate of periprocedural complications and were at increased risk of death in comparison with those receiving an ICD without recent HF hospitalization. Additional prospective, real-world, pragmatic, comparative effectiveness studies should be conducted to define the optimal timing of ICD placement.
Event Time Extraction with a Decision Tree of Neural Classifiers
Authors: Reimers Nils , Dehghani Nazanin , Gurevych Iryna 
Published: December 2018

Extracting the information from text when an event happened is challenging. Documents do not only report on current events, but also on past events as well as on future events. Often, the relevant time information for an event is scattered across the document. In this paper we present a novel method to automatically anchor events in time. To our knowledge it is the first approach that takes temporal information from the complete document into account. We created a decision tree that applies neural network based classifiers at its nodes. We use this tree to incrementally infer, in a stepwise manner, at which time frame an event happened. We evaluate the approach on the TimeBank-EventTime Corpus (Reimers et al., 2016) achieving an accuracy of 42.0% compared to an inter-annotator agreement (IAA) of 56.7%. For events that span over a single day we observe an accuracy improvement of 33.1 points compared to the state-of-the-art CAEVO system (Chambers et al., 2014). Without retraining, we apply this model to the SemEval-2015 Task 4 on automatic timeline generation and achieve an improvement of 4.01 points F1-score compared to the state-of-the-art. Our code is publically available.
Appellative in altniederländischen Ortsnamen
Authors: Quak Arend 
Published: December 2018

In connection with the work on the Old Dutch dictionary (onw) the appellatives in Old Dutch place names from C7–12 were also examined. On the basis of the place names beginning with F from the lexicon of Dutch place names before 1200, the method of finding appellatives in them is explained. For some unexplained place names, possible explanations are proposed.
Im Rahmen der Arbeit am altniederländischen Wörterbuch (onw) wurden auch die Appellative in Ortsnamen aus der altiederländischen Periode (7. bis 12. Jh.) in das Wörterbuch aufgenommen. Anhand der mit F anlautenden Ortsnamen im Lexikon der niederländischen Ortsnamen vor 1200 wird das Verfahren dabei erläutert. Auch werden Vorschläge gemacht für die Deutung einiger dunkler Ortsnamen.
This article is in German language.
Marking Boundaries in Beowulf: Æschere’s Head, Grendel’s Arm and the Dragon’s Corpse
Authors: Porck Thijs , Stolk Sander 
Published: December 2018

Abstract
In the Old English poem Beowulf, several body parts are put on display, including Grendel’s arm at Heorot and Æschere’s head on top of a cliff. The first instance has been widely discussed by various scholars, who have tried to find out why and where the arm was hung. By contrast, scholarly treatments of the second instance are relatively scarce. This article places the exhibition of Æschere’s head by Grendel’s mother in the context of similar practices of decapitation and display in Anglo-Saxon England. It will be argued that the placement of the head of Æschere on top of the cliff towering over Grendel’s mere resembles the Anglo-Saxon heafod stoccan, ‘head stakes’, which acted as boundary markers. The monster’s act, therefore, would not strike as foreign to the Anglo-Saxon audience, but would be familiar. As we will show, the identification of Æschere’s head as a boundary marker, placed at the edge of the monsters’ domain, also has some bearing on the interpretation of other potential boundary markers in the poem, including Grendel’s arm and the dragon’s corpse. Lastly, we will argue for a new reading of two textual cruces in Beowulf’s speech prior to his fight with Grendel.
Sprachmischung in den ‘Malbergischen Glossen’
Authors: Quak Arend 
Published: December 2018

Zusammenfassung
In den sogenannten ‘Malbergischen Glossen’ finden sich einige lateinisch-fränkische Mischformen: ort(o)fogal, ort(o)baum, ort(o)pund, ōlagart, vialacina und ein Lehnwort aus dem galloromanischen: pōdor. Sie werden hier nach Herkunft behandelt. Dazu kommt noch ein weiteres solches Wort hofporcus, das in flämischen Quellen des 12. Jahrhunderts erscheint und keine Entsprechung im Mittelniederländischen zu haben scheint. Auch dieses Wort dürfte nur eine beschränkte Verbreitung gehabt haben. Weiter werden einige frühe Lehnwörter aus dem Romanischen ins Altniederländische behandelt.