Miracle-dz/UniFAR-FTUs huggingface dataset:
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets

This paper studies, for UP, two topics that have been intensely studied for NP: Boolean hierarchies and the consequences of the existence of sparse Turing-complete sets. Unfortunately, as is often the case, the results for NP draw on special properties of NP that do not seem to carry over straightforwardly to UP. For example, it is known for NP (and more generally for any class containing \Sigma^* and \emptyset and closed under union and intersection) that the symmetric difference hierarchy, the Boolean hierarchy, and the Boolean closure all are equal. We prove that closure under union is not needed for this claim: For any class \cal K that contains \Sigma^* and \emptyset and is closed under intersection (e.g., UP, US, and FewP), the symmetric difference hierarchy over \cal K, the Boolean hierarchy over \cal K, and the Boolean closure of \cal K all are equal. On the other hand, we show that two hierarchies---the Hausdorff hierarchy and the nested difference hierarchy---which in the NP case are equal to the Boolean closure fail to be equal for the UP case in some relativized worlds. Regarding sparse Turing-complete sets for UP, we prove that if UP has sparse Turing-complete sets, then the levels of the unambiguous polynomial hierarchy are simpler than one would otherwise expect: they collapse one level in terms of their location in the promise unambiguous polynomial hierarchy. We obtain related results under the weaker assumption that UP has sparse Turing-hard sets.
Improving LSTM-CTC based ASR performance in domains with limited training data

This paper addresses the observed performance gap between automatic speech recognition (ASR) systems based on Long Short Term Memory (LSTM) neural networks trained with the connectionist temporal classification (CTC) loss function and systems based on hybrid Deep Neural Networks (DNNs) trained with the cross entropy (CE) loss function on domains with limited data. We step through a number of experiments that show incremental improvements on a baseline EESEN toolkit based LSTM-CTC ASR system trained on the Librispeech 100hr (train-clean-100) corpus. Our results show that with effective combination of data augmentation and regularization, a LSTM-CTC based system can exceed the performance of a strong Kaldi based baseline trained on the same data.
Simple and deterministic matrix sketching

A sketch of a matrix A is another matrix B which is significantly smaller than A but still approximates it well. Finding such sketches efficiently is an important building block in modern algorithms for approximating, for example, the PCA of massive matrices. This task is made more challenging in the streaming model, where each row of the input matrix can only be processed once and storage is severely limited. In this paper we adapt a well known streaming algorithm for approximating item frequencies to the matrix sketching setting. The algorithm receives n rows of a large matrix A ε ℜ n x m one after the other in a streaming fashion. It maintains a sketch B ℜ l x m containing only l << n rows but still guarantees that ATA BTB. More accurately, ∀x || x,||=1 0≤||Ax||2 - ||Bx||2 ≤ 2||A||_f 2 l Or BTB prec ATA and ||ATA - BTB|| ≤ 2 ||A||f2 l. This gives a streaming algorithm whose error decays proportional to 1/l using O(ml) space. For comparison, random-projection, hashing or sampling based algorithms produce convergence bounds proportional to 1/√l. Sketch updates per row in A require amortized O(ml) operations and the algorithm is perfectly parallelizable. Our experiments corroborate the algorithm's scalability and improved convergence rate. The presented algorithm also stands out in that it is deterministic, simple to implement and elementary to prove.
Chemical Factors Importantto Calcium Nephrolithiasis : Evidencefor Impaired HydroxycarboxylicAcid AbsorptionCausing Hyperoxaluria 0

An investigation of variables important to calcium stone formation in urine indicated significantly increased daily excretion of calcium and oxalate and decreased excretion of ascorbate and citrate by recurrent calcium stone formers. In addition, urine volume, sodium, mucopolysacchande, and protein were also significantly increased. We compared the uptake of citrate and ascorbate from the gut into the blood in normal controls and stone formers. These studies indicated significantly depressed absorption of both these hydroxycarboxyiic acids in recurrent calcium stone formers. We also found that concurrent administration of citrate inhibited ascorbate absorption and increased urinary oxalate excretion after an ascorbate load in normal subjects and stone formers. These findings suggest a mechanism that explains hyperoxaluria in stone patients on the basis of a malabsorption of citrate, ascorbate, and possibly other hydroxycarboxyIic acids.
Software systems as complex networks: structure, function, and evolvability of software collaboration graphs

Software systems emerge from mere keystrokes to form intricate functional networks connecting many collaborating modules, objects, classes, methods, and subroutines. Building on recent advances in the study of complex networks, I have examined software collaboration graphs contained within several open-source software systems, and have found them to reveal scale-free, small-world networks similar to those identified in other technological, sociological, and biological systems. I present several measures of these network topologies, and discuss their relationship to software engineering practices. I also present a simple model of software system evolution based on refactoring processes which captures some of the salient features of the observed systems. Some implications of object-oriented design for questions about network robustness, evolvability, degeneracy, and organization are discussed in the wake of these findings.
A Direct Ultrametric Approach to Additive Complexity and the Shub-Smale Tau Conjecture

The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the Straight-Line Program (SLP) complexity of f. A consequence of the truth of this conjecture is that, for the Blum-Shub-Smale model over the complex numbers, P differs from NP. We prove two weak versions of the Tau Conjecture and in so doing show that the Tau Conjecture follows from an even more plausible hypothesis. Our results follow from a new p-adic analogue of earlier work relating real algebraic geometry to additive complexity. For instance, we can show that a nonzero univariate polynomial of additive complexity s can have no more than 15+s^3(s+1)(7.5)^s s! =O(e^{s\log s}) roots in the 2-adic rational numbers Q_2, thus dramatically improving an earlier result of the author. This immediately implies the same bound on the number of ordinary rational roots, whereas the best previous upper bound via earlier techniques from real algebraic geometry was a quantity in Omega((22.6)^{s^2}). This paper presents another step in the author's program of establishing an algorithmic arithmetic version of fewnomial theory.
On the MacWilliams Identity for Convolutional Codes

The adjacency matrix associated with a convolutional code collects in a detailed manner information about the weight distribution of the code. A MacWilliams identity conjecture, stating that the adjacency matrix of a code fully determines the adjacency matrix of the dual code, will be formulated, and an explicit formula for the transformation will be stated. The formula involves the MacWilliams matrix known from complete weight enumerators of block codes. The conjecture will be proven for the class of convolutional codes where either the code itself or its dual does not have Forney indices bigger than one. For the general case, the conjecture is backed up by many examples, and a weaker version will be established.
Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes

The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end we introduce the concept of graph-cover decoding. Whereas in maximum-likelihood decoding all codewords in a code are competing to be the best explanation of the received vector, under graph-cover decoding all codewords in all finite covers of a Tanner graph representation of the code are competing to be the best explanation. We are interested in graph-cover decoding because it is a theoretical tool that can be used to show connections between linear programming decoding and message-passing iterative decoding. Namely, on the one hand it turns out that graph-cover decoding is essentially equivalent to linear programming decoding. On the other hand, because iterative, locally operating decoding algorithms like message-passing iterative decoding cannot distinguish the underlying Tanner graph from any covering graph, graph-cover decoding can serve as a model to explain the behavior of message-passing iterative decoding. Understanding the behavior of graph-cover decoding is tantamount to understanding the so-called fundamental polytope. Therefore, we give some characterizations of this polytope and explain its relation to earlier concepts that were introduced to understand the behavior of message-passing iterative decoding for finite-length codes.
Upper bound by Kolmogorov complexity for the probability in computable POVM measurement

We apply algorithmic information theory to quantum mechanics in order to shed light on an algorithmic structure which inheres in quantum mechanics. There are two equivalent ways to define the (classical) Kolmogorov complexity K(s) of a given classical finite binary string s. In the standard way, K(s) is defined as the length of the shortest input string for the universal self-delimiting Turing machine to output s. In the other way, we first introduce the so-called universal probability m, and then define K(s) as -log_2 m(s) without using the concept of program-size. We generalize the universal probability to a matrix-valued function, and identify this function with a POVM (positive operator-valued measure). On the basis of this identification, we study a computable POVM measurement with countable measurement outcomes performed upon a finite dimensional quantum system. We show that, up to a multiplicative constant, 2^{-K(s)} is the upper bound for the probability of each measurement outcome s in such a POVM measurement. In what follows, the upper bound 2^{-K(s)} is shown to be optimal in a certain sense.
Order independence and rationalizability

Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of rationalizability. In the case of dominance the criterion of order independence allowed us to clarify which notions and under what circumstances are robust. In the case of rationalizability this criterion has not been considered.In this paper we investigate the problem of order independence for rationalizability by focusing on three naturally entailed reduction relations on games. These reduction relations are distinguished by the adopted reference point for the notion of a better response. Additionally, they are parametrized by the adopted system of beliefs.We show that for one reduction relation the outcome of its (possibly transfinite) iterations does not depend on the order of elimination of the strategies. This result does not hold for the other two reduction relations. However, under a natural assumption the iterations of all three reduction relations yield the same outcome.The obtained order independence results apply to the frameworks considered in Bernheim [1984] and Pearce [1984]. For finite games the iterations of all three reduction relations coincide and the order independence holds for three natural systems of beliefs considered in the literature.
Translational Pharmacodynamics of Calcitonin Gene-Related Peptide Monoclonal Antibody LY2951742 in a Capsaicin-Induced Dermal Blood Flow Model

LY2951742, a monoclonal antibody targeting calcitonin gene-related peptide (CGRP), is being developed for migraine prevention and osteoarthritis pain. To support the clinical development of LY2951742, capsaicin-induced dermal blood flow (DBF) was used as a target engagement biomarker to assess CGRP activity in nonhuman primates and healthy volunteers. Inhibition of capsaicin-induced DBF in nonhuman primates, measured with laser Doppler imaging, was dose dependent and sustained for at least 29 days after a single intravenous injection of the CGRP antibody. This information was used to generate a pharmacokinetic/pharmacodynamic model, which correctly predicted inhibition of capsaicin-induced DBF in humans starting at a single subcutaneous 5-mg dose. As expected, the degree of inhibition in capsaicin-induced DBF increased with higher LY2951742 plasma concentrations. Utilization of this pharmacodynamic biomarker with pharmacokinetic data collected in phase I studies provided the dose-response relationship that assisted in dose selection for the phase II clinical development of LY2951742.
Studies of Hypercholesterolemia in the Nonhuman Primate: II. Fatty Streak Conversion to Fibrous Plaque

This report presents the second portion of the morphologic studies on chronic, dietinduced hypercholesterolemia in nonhuman primates (Macaca nemestrina) examined sequentially between 5 and 13 months. A direct relationship was observed between the rate of cholesterol increase, the level and duration of hypercholesterolemia, and the changes in the artery wall that led to the formation of fatty streaks and their conversion to fibrous plaques. A loss of endothelial continuity was first observed in the iliac arteries between 3 and 4 months of atherogenic diet and appears to be a critical step in the conversion of many fatty streaks to fibrous plaques. With breaks in endothelial junctions and exposure of some of the macrophages in a fatty streak, many of the lipid-filled macrophages appeared to detach and enter the circulation. The number of circulating foam cells increased precipitously between 3 and 4 months, the time when increased sites of endothelial dysjunction and macrophage egress were observed. Exposure of subendothelial macrophages also permitted adherence of platelets to these macrophages and to exposed connective tissue. Fibrous plaques were found at similar anatomic sites where endothelial denudation had been observed at earlier time points but were more prevalent in the abdominal aorta and iliac arteries. These changes subsequently occurred at every level of the aortic tree and appeared to progress in a cephalad fashion with increasing rate, level, and duration of hypercholesterolemia.The results of these studies stress the importance of following cholesterol levels of each animal throughout the entire period of the study and of sampling the entire arterial tree at every level with time. This helped us to understand the complicated interrelationships between the various cells in atherogenesis, provided further support for the “Response to Injury Hypothesis of Atherosclerosis” and helped to explain how hypercholesterolemia may be involved in the different stages of atherogenesis in nonhuman primates and possibly in humans.
Stress ulcer prophylaxis in non-critically ill patients: a prospective evaluation of current practice in a general surgery department.

RATIONALE, AIMS AND OBJECTIVES There is little evidence regarding the benefit of stress ulcer prophylaxis (SUP) outside a critical care setting. Overprescription of SUP is not devoid of risks. This prospective study aimed to evaluate the use of proton pump inhibitors (PPIs) for SUP in a general surgery department. METHOD Data collection was performed prospectively during an 8-week period on patients hospitalized in a general surgery department (58 beds) by pharmacists. Patients with a PPI prescription for the treatment of ulcers, gastro-oesophageal reflux disease, oesophagitis or epigastric pain were excluded. Patients admitted twice during the study period were not reincluded. The American Society of Health-System Pharmacists guidelines on SUP were used to assess the appropriateness of de novo PPI prescriptions. RESULTS Among 255 patients in the study, 138 (54%) received a prophylaxis with PPI, of which 86 (62%) were de novo PPI prescriptions. A total of 129 patients (94%) received esomeprazole (according to the hospital drug policy). The most frequent dosage was at 40 mg once daily. Use of PPI for SUP was evaluated in 67 patients. A total of 53 patients (79%) had no risk factors for SUP. Twelve and two patients had one or two risk factors, respectively. At discharge, PPI prophylaxis was continued in 33% of patients with a de novo PPI prescription. CONCLUSIONS This study highlights the overuse of PPIs in non-intensive care unit patients and the inappropriate continuation of PPI prescriptions at discharge. Treatment recommendations for SUP are needed to restrict PPI use for justified indications.
FGFR4 Role in Epithelial-Mesenchymal Transition and Its Therapeutic Value in Colorectal Cancer

Fibroblast growth factor receptor 4 (FGFR4) is vital in early development and tissue repair. FGFR4 expression levels are very restricted in adult tissues, except in several solid tumors including colorectal cancer, which showed overexpression of FGFR4. Here, FGFR4 mutation analysis discarded the presence of activating mutations, other than Arg388, in different colorectal cancer cell lines and tumoral samples. Stable shRNA FGFR4-silencing in SW480 and SW48 cell lines resulted in a significant decrease in cell proliferation, adhesion, cell migration and invasion. This decrease in the tumorigenic and invasive capabilities of colorectal cancer cells was accompanied by a decrease of Snail, Twist and TGFβ gene expression levels and an increase of E-cadherin, causing a reversion to a more epithelial phenotype, in three different cell lines. In addition, FGFR4-signaling activated the oncogenic SRC, ERK1/2 and AKT pathways in colon cancer cells and promoted an increase in cell survival. The relevance of FGFR4 in tumor growth was supported by two different strategies. Kinase inhibitors abrogated FGFR4-related cell growth and signaling pathways at the same extent than FGFR4-silenced cells. Specific FGFR4-targeting using antibodies provoked a similar reduction in cell growth. Moreover, FGFR4 knock-down cells displayed a reduced capacity for in vivo tumor formation and angiogenesis in nude mice. Collectively, our data support a crucial role for FGFR4 in tumorigenesis, invasion and survival in colorectal cancer. In addition, FGFR4 targeting demonstrated its applicability for colorectal cancer therapy.
Numerical Investigation of High-Order Gyrotron Mode Propagation in Launchers at 170 GHz

This paper presents for the first time the transient simulation of the 3-D mode converter with surface deformation. The simulation results were obtained by solving the Maxwell equations directly on a 3-D domain with a discontinuous Galerkin method. The presented full-wave simulation was possible only through the use of an advanced highly scalable numerical method operating on a large-scale high-performance computing system. Moreover, the properties of the Maxwell solver with respect to accuracy and computation time are discussed for the application to a smooth-wall waveguide where an analytical solution is available.
Culture and International Usability Testing: The Effects of Culture in Structured Interviews

The global audience for software products includes members of different countries, religions, and cultures: people who speak different languages, have different life styles, and have different perceptions and expectations of any given product. A major impediment in interface development is that there is inadequate empirical evidence for the effects of culture in the usability engineering methods used for developing user interfaces. This paper presents a controlled study investigating the effects of culture on the effectiveness of structured interviews in usability testing. The experiment consisted of usability testing of a website with two independent groups of Indian participants by two interviewers; one belonging to the Indian culture and the other to the Anglo-American culture. Participants found more usability problems and made more suggestions to an interviewer who was a member of the same (Indian) culture than to the foreign (Anglo-American) interviewer. The results of the study empirically establish that culture significantly affects the efficacy of structured interviews during international user testing. The implications of this work for usability engineering are discussed.
Mottle camouflage patterns in cuttlefish: quantitative characterization and visual background stimuli that evoke them

SUMMARY Cuttlefish and other cephalopods achieve dynamic background matching with two general classes of body patterns: uniform (or uniformly stippled) patterns and mottle patterns. Both pattern types have been described chiefly by the size scale and contrast of their skin components. Mottle body patterns in cephalopods have been characterized previously as small-to-moderate-scale light and dark skin patches (i.e. mottles) distributed somewhat evenly across the body surface. Here we move beyond this commonly accepted qualitative description by quantitatively measuring the scale and contrast of mottled skin components and relating these statistics to specific visual background stimuli (psychophysics approach) that evoke this type of background-matching pattern. Cuttlefish were tested on artificial and natural substrates to experimentally determine some primary visual background cues that evoke mottle patterns. Randomly distributed small-scale light and dark objects (or with some repetition of small-scale shapes/sizes) on a lighter substrate with moderate contrast are essential visual cues to elicit mottle camouflage patterns in cuttlefish. Lowering the mean luminance of the substrate without changing its spatial properties can modulate the mottle pattern toward disruptive patterns, which are of larger scale, different shape and higher contrast. Backgrounds throughout nature consist of a continuous range of spatial scales; backgrounds with medium-sized light/dark patches of moderate contrast are those in which cuttlefish Mottle patterns appear to be the most frequently observed.