Miracle-dz/UniFAR-FTUs huggingface dataset:
A Theory About First-Order Terms in ACL2 ?

We describe the development in ACL2 of a library of results about first-order terms. In particular, we present the formalization of some of the main properties of the complete lattice of first-order terms with respect to the subsumption relation. As a byproduct, verified executable implementations are obtained for some basic operations on firstorder terms, including matching, renaming, unification and anti-unification. This work can be seen as a basis for further studies about the formal properties of automated reasoning and symbolic computation systems. In [9, 11] we described a formal ACL2 theory about equational reasoning and term rewriting systems. In that work we used a library of definitions and theorems formalizing the lattice theoretic properties of the set of first-order terms with respect to the subsumption relation. Nevertheless, the results of this library have not been documented yet, except the verification of a unification algorithm [10] (in fact, a preliminary Nqthm version). We think that these results are interesting for themselves, so our intention is to describe them in this paper. Our purpose when developing these results about first-order terms is twofold. From a theoretical point of view, we proved in ACL2 that the set of first-order terms in a given signature is a wellfounded lattice with respect to the subsumption relation. And from a practical point of view, we implemented and formally verified several basic algorithms on terms, including matching, renaming, unification and anti-unification; these algorithms can be executed in any compliant Common Lisp (with the appropriate files loaded). The usefulness of this library has already been demonstrated: as we said above, our formalization of equational reasoning and rewriting relies heavily on the work presented here. For that reason, we think that it can be seen as a basis for further studies about the formal properties of automated reasoning and symbolic computation systems. As far as we know, there is no other complete formalization of the lattice properties of terms, but we can mention some related works done in mechanical verification of properties of terms, especially for unification algorithms. Paulson [6] describes the verification of a unification algorithm using LCF. Rouyer [8] does the same using Coq. For some related work in the Boyer-Moore theorem prover, see [4], where Kaufmann presents a formal proof of a generalization algorithm used in PC-Nqthm. In [5], McCune and Shumsky present the ACL2 verification of a checker for resolution/paramodulation proofs generated by the Otter theorem prover; in this work, the needed theory about first-order terms was also formalized. Due to the lack of space, we do not present details of the proofs here, and some function definitions will be omitted. We urge the interested reader to consult the books provided by the supporting materials (see also [12]), where the proofs are extensively documented. In each section, we will specify the name of the book that contains the definitions and theorems described.
The Complexity of Knapsack in Graph Groups

Myasnikov et al. have introduced the knapsack problem for arbitrary finitely generated groups. In LohreyZ16 the authors proved that for each graph group, the knapsack problem can be solved in NP. Here, we determine the exact complexity of the problem for every graph group. While the problem is TC^0-complete for complete graphs, it is LogCFL-complete for each (non-complete) transitive forest. For every remaining graph, the problem is NP-complete.
Insights from a decade of development cooperation in e-waste management

This paper presents insights from a decade of development cooperation projects in electrical and electronic waste (e-waste) management and associated research activities, conducted by Empa’s Technology and Society Lab together with a number of international partners. The quantification of e-waste volumes is a prerequisite for the development of sustainable solutions in developing countries. Challenges include getting an understanding of the accuracy of data and the dynamic behavior of e-waste flows and their constituents. In addition, the thermodynamic and physical properties of the material mix found in e-waste needs to be understood in order to achieve efficient recovery of the material resources. The past and still on-going application of hazardous substances in electrical and electronic equipment will remain a dominant issue in sustainable e-waste management systems in the future, if environmental, health and safety hazards, as well as cross-contamination into recovered secondary resources, are to be avoided. Furthermore, tailored solutions will have to take into account the informal nature of e-waste recycling in developing countries. Although continuing miniaturization of electronic devices can be observed, overall volumes and mass flows are expected to increase steadily in the future, as appliances are getting cheaper and hence more accessible, especially in the non-saturated markets of developing countries.
EFFECTIVE AND EFFICIENT WAY OF REDUCE DEPENDENCY ON DATASET WITH THE HELP OF MAPREDUCE ON BIG DATA

With the fast development of networks these days organizations has overflowing with the collection of millions of data with big number of combination. This big data challenges over trade troubles. It requires more analysis for the high-performance procedure. The new method of hadoop and MapReduce methods are discussed starting the data mining standpoint. In the proposed research work we have to progress performance through parallelization of different operations such as loading the information, index building and evaluating the queries. Thus the performance analysis is completed with the minimum of three nodes with in the Amazon cloud environment. Hbase is a open source, non-relational and distributed database model. It executes on the pinnacle of Hadoop. It consists of a single key with multiple values. Looping is avoid in retrieving a meticulous data from huge datasets and it consume less amount of time for execute the data. HDFS file system is used to store the data after performing arts the map reduces operations and the execution time is decreased when the amount of nodes gets increased. The performance analysis is tuned with the parameters such as the carrying out complexity.
A human capital perspective of skill acquisition and interface loyalty

It has long been recognized that humans are able to improve task performance as a result of repeated experience with a particular task, and that this type of learning consistently adheres to the Power Law of Practice. However, less attention has been given to the impact that practice, and the acquisition of skill, have on a user’s loyalty to a particular software interface. Here, we review the notion of human capital, and discuss specific examples from research into online shopping, in an effort to better understand the role of learning in the development of interface loyalty. Learning by doing is an essential aspect of human knowledge acquisition. Over time and through experience we acquire the skills we need to survive and thrive in the world. While novel tasks often require a concerted effort, over time, and with practice, many behaviors that were initially very demanding become routine. As a result, the demands of the task are diminished and cognitive resources can be allocated elsewhere. Learning to drive is a good example of this phenomenon. While initially operating an automobile can be quite demanding, with practice many of the required skills become automatic. Similarly, using a computer to type a letter or to shop for a new CD can be intimating to a novice user. Yet, experienced users find the operation of a word processor or the navigation of an online store to be a relatively simple task. The ability to learn from experience is a fundamental aspect of human existence.
A simulation fidelity assessment framework

A proposition for the correct by design of abstraction with respect to the simulation objectives based on the concepts of approximate bisimulation, Galois connections and ontology is presented. It addresses the fundamental problem of fidelity in simulation, namely, given a class of models and a class of properties that must be preserved, how to extract modeling abstractions that preserves the properties of interest which allows to conclude about the system being simulated. Fidelity and validity are explained in the framework of the experimental frame and discussed in the context of modeling abstractions. A formal method for the fidelity quantification is explained by abstraction inclusion relations for syntactic and semantic compatibility. Abstraction inclusion in dynamic systems for semantic compatibility by approximate bisimulation and the problem of finding surjection maps compatible with simulation objectives are discussed. Syntactic compatibility is explained by ontologies followed by a brief discussion on the Galois connections and building Galois surjections compatible with the simulation objectives at the end.
Near-Real-Time Control of Human Figure Models

Animating human figures is one of the major problems in computer animation. A recent approach is the use of dynamic analysis to compute the movement of a human figure, given the forces and torques operating within and upon the body. One of the problems with this technique is computing the forces and torques required for particular motions; this has been called the control problem of dynamic analysis. To develop a better understanding of this problem, an interactive interface to a dynamics package has been produced. This interface, along with a collection of low-level motion processes, can be used to control the motion of a human figure model. This article describes both the user interface and the motion processes, along with our experiences with this approach.
40 45 50 A lti tu de ( k m ) Intensity 0123456 Ozone number density ( × 1012 molecules

The standard Dobson Umkehr methodology to retrieve coarse-resolution ozone profiles used by the National Oceanographic and Atmospheric Administration uses designated solar zenith angles (SZAs). However, some information may be lost if measurements lie outside the designated SZA range (between 60 and 90), or do not conform to the fitting technique. Also, while Umkehr measurements can be taken using multiple wavelength pairs (A, C and D), past retrieval methods have focused on a single pair (C). Here we present an Umkehr inversion method that uses measurements at all SZAs (termed operational) and all wavelength pairs. (Although, we caution direct comparison to other algorithms.) Information content for a Melbourne, Australia (38 S, 145 E) Umkehr measurement case study from 28 January 1994, with SZA range similar to that designated in previous algorithms is shown. When comparing the typical single wavelength pair with designated SZAs to the operational measurements, the total degrees of freedom (independent pieces of information) increases from 3.1 to 3.4, with the majority of the information gain originating from Umkehr layers 2+ 3 and 4 (10–20 km and 25–30 km respectively). In addition to this, using all available wavelength pairs increases the total degrees of freedom to 5.2, with the most significant increases in Umkehr layers 2+ 3 to 7 and 9+ (10– 40 and 45–80 km). Investigating a case from 13 April 1970 where the measurements extend beyond the 90 SZA range gives further information gain, with total degrees of freedom extending to 6.5. Similar increases are seen in the information content. Comparing the retrieved Melbourne Umkehr time series with ozonesondes shows excellent agreement in layers 2+ 3 and 4 (10–20 and 25–30 km) for both C and A+C+D-pairs. Retrievals in layers 5 and 6 (25–30 and 30– 35 km) consistently show lower ozone partial column compared to ozonesondes. This is likely due to stray light effects that are not accounted for in the forward model, and under represented stratospheric aerosol.
A robust noise and echo canceller

The performance of an echo canceller systems deployed in a practical communication environment (i.e. the presence of background noise and the possible double talk scenario) depends on an accurate Voice Activity Detector (VAD) and an effective ﬁlter coefﬁcient adaptation strategies. Accuracy of the VAD, which affects the coefﬁcient adaptation strategy, is itself affected by the presence of background noise. In this paper, a novel soft weighting approach is proposed to replace the VAD and ﬁlter coefﬁcient adaptation strategy. The robustness of the echo canceller system is further improved through integrating it with a noise suppression algorithm. The integrated echo can-celler and noise suppressor systems has shown excellent performances under double talk scenarios with SNR as low as 5 dB.
Routing Planning As An Application Of Graph Theory

This paper presents a routing algorithm that uses fuzzy logic technique to find the shortest routing path. The basic idea behind path finding is searching a graph, starting at one point, and exploring adjacent nodes from there until the destination node is reached. Generally, the goal is of course to obtain the shortest route to the destination. The proposed Fuzzy Routing Algorithm (FRA) modifies the well-known Dijkstra's Single-source shortest path algorithm by using fuzzy-logic membership functions in the path-cost update process. The main objective of FRA is to reduce path-request blocking and increase overall utilization. The fuzzy weighted graphs, along with generalizations of algorithms for finding optimal paths within them, have emerged as an adequate modeling tool for prohibitively complex and/or inherently imprecise systems. These algorithms are reviewed and formulized with uncertainty which comes from weights on edges according to actual situation on the road such as weather conditions, and road capacity at the specified time. The two key issues need to be addressed in SPP(Shortest Path Algorithm) with fuzzy parameters are to determine the addition of two edges and to compare the distance between two different paths with their edge lengths represented by fuzzy numbers.
Adaptive acetylcholinesterase splicing patterns attenuate 1‐methyl‐4‐phenyl‐1,2,3,6‐tetrahydropyridine‐induced Parkinsonism in mice

Balanced dopaminergic cholinergic interactions are crucial for proper basal ganglia function. This is dramatically demonstrated by the worsening of Parkinson's disease symptoms following acetylcholinesterase (AChE) inhibition. Typically, in the brain, the synapse‐anchored synaptic AChE (AChE‐S) variant is prevalent whereas the soluble readthrough AChE (AChE‐R) variant is induced in response to cholinesterase inhibition or stress. Because of the known functional differences between these variants and the fact that AChE‐R expression is triggered by various stimuli that themselves are often associated with Parkinson's disease risk, we hypothesized that the splice shift to AChE‐R plays a functional role in Parkinsonian progression. After establishing that Paraoxon‐induced AChE inhibition indeed aggravates experimental Parkinsonism triggered by the neurotoxin 1‐methyl‐4‐phenyl‐1,2,3,6‐tetrahydropyridine (MPTP) in mice, we tested the roles of individual AChE variants by exposing transgenic mice overexpressing either the AChE‐S or AChE‐R variant to MPTP. Differential reductions of tyrosine hydroxylase levels in the striatum and substantia nigra indicated that transgenic AChE‐R expression confers resistance as compared with the parent FVB/N strain. In contrast, AChE‐S overexpression accelerated the MPTP‐induced damage. Survival, behavioral measures and plasma corticosterone levels were also compatible with the extent of the dopaminergic damage. Our findings highlight the functional differences between individual AChE variants and indicate that a naturally occurring stress or AChE inhibitor‐induced splicing shift can act to minimize dopaminergic cholinergic imbalances. We propose that inherited or acquired alternative splicing deficits could accelerate Parkinsonism and that, correspondingly, adaptive alternative splicing events may attenuate disease progression.
Co‐expression and interaction of cubilin and megalin in the adult male rat reproductive system

Cubilin is a peripheral membrane protein that cooperates with the endocytic receptor megalin to mediate endocytosis of ligands in various polarized epithelia. Megalin is expressed in the male reproductive tract where it has been implicated in the process of sperm membrane remodeling. A potential role for cubilin in the male reproductive tract has not been explored. Using RT‐PCR, we found that cubilin and megalin mRNAs are expressed in the efferent ducts, corpus and cauda epididymis, and proximal and distal vas deferens. Immunohistological analysis revealed that cubilin was expressed in nonciliated cells of the efferent ducts, principal cells of the corpus and cauda epididymis and vas deferens. Immunogold EM showed cubilin in endocytic pits, endocytic vesicles, and endosomes of these cells. The expression profile of cubilin in the male reproductive tract was coincident with that of megalin except in principal cells of the caput epididymis. Double immunogold labeling showed that cubilin and megalin co‐localized within the endocytic apparatus and recycling vesicles of efferent duct cells. Neither protein was found in lysosomes. Injection of RAP, an antagonist of megalin interaction with cubilin, reduced the level of intracellular cubilin in cells of the efferent ducts and vas deferens. In conclusion, cubilin and megalin are co‐expressed in cells of the epididymis and vas deferens and the endocytosis of cubilin in these tissues is dependent on megalin. Together, these findings highlight the potential for a joint endocytic role for cubilin and megalin in the male reproductive tract. Mol. Reprod. Dev. 64: 129–135, 2003. © 2003 Wiley‐Liss, Inc.
ailor-made biofunctionalized nanoparticles using layer-by-layer technology agar

Layer-by-layer (LBL) technique is a well-established method for the formation of nanofilms on planar surfaces, as well as on micro-sized colloidal particles. For surface functionalization of nanoparticles, it is a very recent area of research receiving great interest due to the advantage of obtaining fine control over the ccepted 12 May 2010
Immunization with PspA Incorporated into a Poly(Ethylene Oxide) Matrix Elicits Protective Immunity against Streptococcus pneumoniae

ABSTRACT CBA/N mice were immunized with PspA in a poly(ethylene oxide) matrix to examine its ability to deliver the antigen and modulate the immune response. All mice receiving PspA in the matrix survived a lethal pneumococcal challenge and had serum anti-PspA antibody levels statistically higher than mice receiving PspA alone (P < 0.009).
Serum B-cell maturation antigen: a novel biomarker to predict outcomes for multiple myeloma patients

B-cell maturation antigen is expressed on plasma cells. In this study, we have identified serum B-cell maturation antigen as a novel biomarker that can monitor and predict outcomes for multiple myeloma patients. Compared to healthy donors, patients with multiple myeloma showed elevated serum B-cell maturation antigen levels (P<0.0001). Serum B-cell maturation antigen levels correlated with the proportion of plasma cells in bone marrow biopsies (Spearman’s rho = 0.710; P<0.001), clinical status (complete response vs. partial response, P=0.0374; complete response vs. progressive disease, P<0.0001), and tracked with changes in M-protein levels. Among patients with non-secretory disease, serum B-cell maturation antigen levels correlated with bone marrow plasma cell levels and findings from positron emission tomography scans. Kaplan-Meier analysis demonstrated that serum B-cell maturation antigen levels above the median levels were predictive of a shorter progression-free survival (P=0.0006) and overall survival (P=0.0108) among multiple myeloma patients (n=243). Specifically, patients with serum B-cell maturation antigen levels above the median level at the time of starting front-line (P=0.0043) or a new salvage therapy (P=0.0044) were found to have shorter progression-free survival. Importantly, serum B-cell maturation antigen levels did not show any dependence on renal function and maintained independent significance when tested against other known prognostic markers for multiple myeloma such as age, serum β2 microglobulin, hemoglobin, and bone disease. These data identify serum B-cell maturation antigen as a new biomarker to manage multiple myeloma patients.
Basalt Genesis Across the Solar System: Observational and Experimental Studies of Shergottite and Eucrite Meteorites

ii Preface . v Dedication . vi Acknowledgements . vii Table of Tables . x Table of Figures . xi Chapter 1: Introduction to the Thesis . 1 1.1: Introduction to Mars . 2 1.2: Introduction to the HED parent body and Vesta . 6 Chapter 2: Experimental Petrology of the Tissint Meteorite . 26 2.
An Adaptive Cross-Correlation Derivative Algorithm for Ultra-Low Power Time Delay Measurement

In this paper, we report a low power integrated circuit that implements an adaptive version of the cross-correlation derivative algorithm for the estimation of inter-aural time difference. The architecture and logic structure as well as measured results reporting the performance of the IC -fabricated in a standard CMOS 0.5 mum process - are shown.
Modeling SystemC design in UML and automatic code generation

The combination of Unified Modeling Language (UML) and SystemC has led to an object-oriented high-level design automation methodology. In this paper, a novel bi-directional UML-SystemC translation tool UMLSC is proposed. Specifically, a set of principles for modeling SystemC design in UML and an algorithm for UML-SystemC bi-directional translation are addressed. The principles and the algorithm are integrated into UMLSC* which provides a smooth link between visual specification, implementation and verification. An implementation example is given to verify the effectiveness of the proposed principles and the algorithm.
Proceedings of the 5th Symposium on Operating Systems Design and Implementation Ivy: a Read/write Peer-to-peer File System

Ivy is a multiuser read/write peer-to-peer file system. Ivy has no centralized or dedicated components, and it provides useful integrity properties without requiring users to fully trust either the underlying peer-to-peer storage system or the other users of the file system. An Ivy file system consists solely of a set of logs, one log per participant. Ivy stores its logs in the DHash distributed hash table. Each participant finds data by consulting all logs, but performs modifications by appending only to its own log. This arrangement allows Ivy to maintain meta-data consistency without locking. Ivy users can choose which other logs to trust, an appropriate arrangement in a semi-open peer-to-peer system. Ivy presents applications with a conventional file system interface. When the underlying network is fully connected, Ivy provides NFS-like semantics, such as close-to-open consistency. Ivy detects conflicting modifications made during a partition, and provides relevant version information to application-specific conflict re-solvers. Performance measurements on a wide-area network show that Ivy is two to three times slower than NFS.