Miracle-dz/UniFAR-FTUs huggingface dataset:
Customer Service Measures for National Forest Recreation

An outdoor recreation customer service strategy designed for the USDA Forest Service (FS) was studied using data from a field test at national forest (NF) settings in southern California. Previously, a consultant firm had determined the essential aspects of a NF recreation experience by conducting two focus groups, one each in California and New Hampshire. They recommended that the FS assess 22 separate recreation experience attributes, grouped into three broad domains, that could be used as the FS's customer service performance measures for outdoor recreation. Subsequently, these 22 attributes were put in a short on-site questionnaire and given to a representative sample of 510 summer visitors to two southern California NFs. Including refusals, the response rate was 84 percent, resulting in a dataset of 426 respondents. The three domains for the 22 performance attributes (experience measures) were: facilities ( ll items), services (five items) and information (six items). Using the on-site questionnaire data, the overall adequacy and stability of these attribute domains was checked. First, the proposed three-domain structure was judged using orthogonal factor analysis to mathematically group the 22 attributes. Four, not three, clear factors (domains) resulted. This finding represents a minor, but noteworthy, deviation from the structure previously identified. Specifically, the facilities dimension split into facilitiessufficiency and facilities-operations domains. This division suggests a need to field test these domains elsewhere in the NF system, and in southern California to manage for four, not three, domains. Next, the attributes that represented each of the four factors were made into simple additive scales of three to six items each and subjected to a reliability analysis. (Four of the original 22 items were dropped at this point.) The measures ofindividual scale reliability, Cronbach's alpha, were very good (.80, .84, .90,and .91 ). Inasmuch as the scales are relatively short and easy to administer, it is suggested that the scales may yield useful customer service feedback at low cost. Equity concerns were also raised. Further data analysis showed that the usefulness of the performance measures across most types of recreation groups was good (although based on limited visit and visitor characteristics). However, caution is suggested because two user groups, Spanish speaking and wilderness site visitors, may have somewhat different customer service ratings. In general, results suggest that the FS recreational customer service performance measures might be useful to managers. Furthermore, the simplified performance-measures-only model seems capable of providing important answers to questions about visitors' desired conditions and the extent to which they are actually experienced. However, cautions and implementation issues are evident.
Proper cerebellar development requires expression of β1‐integrin in Bergmann glia, but not in granule neurons

β1‐class integrins play essential roles both in developmental biology as well as in cancer. Particularly, a Nestin‐driven deletion of β1‐integrin receptors results in severe abnormalities of brain development including a laminar disorganization of cerebellar granule neurons. However, since Nestin is expressed in all kinds of neural precursors, these data do not allow conclusions to be drawn about the role of β1‐integrins in distinct neuronal and glial cell types. By generating conditional knockout mice using granule cell‐specific Math1‐promoter sequences, we show here that the expression of β1‐integrins in granule neurons is dispensable for the development of the cerebellum. Also, deletion of β1‐integrin from tumors that arise in a mouse model of granule cell precursor‐derived medulloblastoma did not result in a significant survival benefit. Last, expression levels of β1‐integrin in human medulloblastoma samples did not predict patient's outcome. However, a β1‐integrin knockout using hGFAP‐promoter sequences led to cerebellar hypoplasia, inappropriate positioning of Bergmann glia cells in the molecular layer, undirected outgrowth of radial glia fibers, and granule cell ectopia. We therefore conclude that β1‐integrin expression in cerebellar granule neurons is not essential during normal development or medulloblastoma formation. In fact, it is the expression of β1‐integrin in glia that is crucial for the proper development of the cerebellar cortex. © 2012 Wiley Periodicals, Inc.
Analytic Performance Evaluation of M${-}$QAM Based Decode-and-Forward Relay Networks Over Nakagami-q (Hoyt) Fading Channels

This work is devoted to the analysis of a regenerative multi-node dual-hop cooperative system over enriched multipath fading channels. Novel analytic expressions are derived for the symbol-error-rate for $M{-}$ary quadrature modulated signals in decode-and-forward relay systems over both independent and identically distributed as well as independent and non-identically distributed Nakagami${-}$q (Hoyt) fading channels. The derived expressions are based on the moment-generating-function approach and are given in closed-form in terms of the generalized Lauricella series. The offered results are validated extensively through comparisons with respective results from computer simulations and are useful in the analytic performance evaluation of regenerative cooperative relay communication systems. To this end, it is shown that the performance of the cooperative system is, as expected, affected by the number of employed relays as well as by the value of the fading parameter $q$, which accounts for \textit{pre-Rayleigh} fading conditions that are often encountered in mobile cellular radio systems.
A Micro-Macro Parareal Algorithm: Application to Singularly Perturbed Ordinary Differential Equations

We introduce a micro-macro parareal algorithm for the time-parallel integration of multiscale-in-time systems. The algorithm first computes a cheap, but inaccurate, solution using a coarse propagator (simulating an approximate slow macroscopic model), which is iteratively corrected using a fine-scale propagator (accurately simulating the full microscopic dynamics). This correction is done in parallel over many subintervals, thereby reducing the wall-clock time needed to obtain the solution, compared to the integration of the full microscopic model over the complete time interval. We provide a numerical analysis of the algorithm for a prototypical example of a micro-macro model, namely, singularly perturbed ordinary differential equations. We show that the computed solution converges to the full microscopic solution (when the parareal iterations proceed) only if special care is taken during the coupling of the microscopic and macroscopic levels of description. The error bound depends on the modeling error .
Predicting responses of the Adélie penguin population of Edmonson Point to future sea ice changes in the Ross Sea

Atmosphere-Ocean General Circulation Models (AOGCMs) predict changes in the sea ice environment and in atmospheric precipitations over larger areas of Antarctica. These changes are expected to affect the population dynamics of seabirds and marine mammals, but the extent of this influence is not clear. We investigated the future population trajectories of the colony of Adelie penguins at Edmonson Point, in the Ross Sea, from 2010 to 2100. To do so, we incorporated the relationship between sea ice and demographic parameters of the studied colony into a matrix population model. Specifically, we used sea ice projections from AOGCMs and a proxy for snowfall precipitation. Simulations of population persistence under future climate change scenarios showed that a reduction in sea ice extent and an increase in precipitation events during the breeding season will drive the population to extinction. However, the population growth rate estimated by the model was lower than the population growth rate observed during the last decades, suggesting that recruits from other colonies maintain the observed population dynamics at Edmonson Point. This local ‘rescue’ effect is consistent with a metapopulation dynamic for Adelie penguins in the Ross Sea, in which neighboring colonies might exhibit contrasting population trends and different density-dependent effects. In the hypothesis that connectivity with larger source colonies or that local recruitment would decrease, the sink colony at Edmonson Point is predicted to disappear.
Processor Description in APDL for Design Space Exploration of Embedded Processors

This paper presents modeling of embedded processors in Anahita Processor Description Language (APDL). APDL is a language for generation of retargetable processor design tool sets. The emphasis is on the applicability of the generated tools in the design space exploration (DSE) phase of designing new embedded processors. APDL introduces a new level of abstraction for processor description. This language can be used for generation of tools such as compilers, architecture verification tools, instruction set simulators, and hardware generators. In particular, it provides constructs to explicitly model the interaction of instructions in the processor’s code sequence. The paper first investigates the features required for a language to be useful for DSE and then presents APDL constructs along with code samples and a case study.
Understanding Pull-based Method Efficiency in Peer-to-Peer Live Video Streaming over Mesh Networks

In the recent years, multimedia streaming has been really popular among end users, especially live video streaming over the Internet. However, video streaming applications need efficient and reliable methods for disseminating video frames in the networks. Although Mesh-based Peer-to-Peer (P2P) networks make the system more robustness against link failures, the performance of the system can be degraded considerably if a peer joins or leaves the network. Consequently, the necessity of an efficient exchange method for degrading the side effects of these problems is inevitable. Contrary to the push-based exchange method, which is more suitable for tree-based P2P systems, the pull-based technique is used in many previous mesh-based systems. To best of our knowledge, no previous study evaluated the efficiency of this exchange method in various peer churning rates and network conditions. In this work, the efficiency of the pull-based exchange method in mesh-based P2P live video streaming is analyzed and examined for different peer churning rates, network sizes, initial buffer times, BMS (Buffer Map Status) exchange interval times and heterogeneous bandwidth. Moreover, a trade-off between the BMS message interval time and the network overhead in pull-based method is evaluated in order to clearly show why most of the previous studies used one second BMS interval time. The obtained results are discussed based on five important performance metrics including playback skip, End-to-End delay, dissemination time, initial startup delay and network overhead to provide a comprehensive evaluation of pull-based method
Generalized Capacitance Matrix Theorems for Solving Linear Systems 1

The capacitance matrix method has been widely used as an e cient numerical tool for solving the boundary value problems on irregular regions. Initially, this method was based on the Sherman-Morrison-Woodbury formula, an expression for the inverse of the matrix (A+UVT ) with A 2 <n n and U;V 2 <n p. Extensions to the capacitance matrix method with restrictive assumptions on the matrices A and (A+UVT ) have been reported in the past. In this paper, we present several theorems which are generalizations of the capacitance matrix theorem [2] and are suited for very general matrices A and (A+UVT ). A modi ed capacitance matrix method is developed from these theorems and holds the promise of being applicable to more general boundary value problems; in addition, it gives ample freedom to choose the matrix A for developing very e cient numerical algorithms.
Webgames and Strategy: Recipes for Interactive Learning

Bipolar cells are designed to permit the introduction of full wave, half wave, or time proportioned, rectified and unfiltered current into a special electrolysis zone which contains coated titanium anodes and steel cathodes with nonconducting baffles which protrude beyond each bipolar electrode in water containing dilute salt solutions. Thereby voltage transformers are eliminated and amperages are very much decreased and easily controlled. For the chlorination of swimming pools, all of the filtered pool water is passed directly through the bipolar electrodes at velocities between 3 and 6 feet per second. This direct liquid flow combined with time proportioned electric current and with iron or stainless steel cathodes prevents the accumulation of precipitates in the cell and permits the control of a wide range of chlorine concentrations while prolonging the life of the coated anodes. Because there is substantially no voltage or current control, shielding strips are required to protect the edges of electrodes from electrochemical corrosion without impeding the flow of water. Also, grounded screens must be placed sufficiently far from the bipolar electrodes at both entrance and exit ends so that voltage gradients between facing positive and negative electrodes in each bipolar cell are substantially greater than voltage gradients between any electrode and the grounding screens. For normal operations and up to 50 percent of the emergency requirements of local health authorities, a half wave rectification is preferred. For emergency superchlorination, full wave rectification is employed. A novel structure for bipolar electrodes is described and used in large and small devices for making hypochlorite solutions.
Permanent and Transitory Demand Shocks and the Term Structure of Oil Futures Prices

Based on the existent possible explanations of oil futures term structure, this study provides a more fundamental view, which has a theoretical support from the theory of storage and well-suited intuitions in correspondence with reality. By using structural econometrical models, it divides oil net demand into two components: one is contributed by permanent shocks and the other is contributed by transitory shocks, and finds that only transitory component in oil net demand has a significant and robust impact on the term structure of oil futures prices. Positive transitory shocks push oil futures curve from contango to backwardation and negative transitory shocks pull oil futures curve back to contango from backwardation. This study also applies the analysis framework to OECD and Non OECD countries, respectively, to address the rising importance of emerging markets in the dynamics of world oil prices and futures term structure. Finally, this study also tests rich implications for investing, hedging and arbitraging on oil futures from several practical perspectives.
Sparsity in a Sum of Squares of Polynomials

Representation of a given nonnegative multivariate polynomial in terms of a sum of squares of polynomials has become an essential subject in recent developments of a sum of squares optimization and SDP (semidefinite programming) relaxation of polynomial optimization problems. We disscuss effective methods to get a simpler representation of a “sparse” polynomial as a sum of squares of sparse polynomials by eliminating redundancy.
Adenovirus-mediated tissue-targeted expression of a caspase-9-based artificial death switch for the treatment of prostate cancer.

Clinical experience with suicide gene therapy for prostate cancer using first-generation approaches has provided a basis for developing improved strategies. Given the low proliferation rate exhibited by prostate cancer, one improvement would be to develop suicide genes that effectively kill both dividing and nondividing cells. A second improvement would be to restrict cytotoxicity to prostate cancer cells, limiting injury of nondiseased tissue. Here we describe a novel approach to achieving both goals based on: (a) the use of a small, but potent, prostate-specific composite promoter, ARR(2)PB, based on the rat probasin gene; and (b) the use of a powerful artificial death switch, called inducible caspase-9 (iCaspase-9). ARR(2)PB includes two copies of the androgen response region (ARR), each containing two androgen receptor (AR)-binding sites, placed upstream of the probasin promoter elements necessary for basal transcription. Because iCaspase-9 contains two binding sites for the dimeric ligand, AP20187, administration of chemical inducers of dimerization leads to aggregation and caspase activation, followed by rapid apoptosis in both dividing and nondividing cells. Using both reagents, we constructed two novel adenoviruses (ADVs), ADV.ARR(2)PB-iCasp9 expressing iCaspase-9 and control ADV.ARR(2)PB-EGFP expressing enhanced green fluorescent protein (EGFP). We demonstrate that tissue specificity is not sacrificed in an ADV backbone because the marker protein, EGFP, is expressed in R1881-stimulated ADV.ARR(2)PB-EGFP-transduced LNCaP cells but not in AR(-) PC-3, 293, HuH-7, U-87, and MCF-7 cells. Similarly, Pro-iCaspase-9 is expressed in ADV.ARR(2)PB-iCasp9-infected LNCaP cells after R1881 administration and is activated after AP20187 administration. In vitro experiments revealed rapid and efficient iCaspase-9-induced apoptosis of LNCaP cells in both an R1881- and AP20187-dependent manner. Only 28, 8, and 0.5% survival of LNCaP cells was seen at multiplicities of infection of 2, 10, and 25, respectively. Furthermore, at a multiplicity of infection of 10, extraordinary sensitivity to AP20187 was seen (IC(50), approximately 3 pM). In vivo experiments showed that ADV.ARR(2)PB-iCasp9 induced apoptosis in LNCaP but not in HuH-7 xenograft tumors in an AP20187-dependent manner. Furthermore, a simple i.p. injection of AP20187 dramatically suppressed LNCaP tumor growth in nude mice and led to a significantly increased host survival. This study demonstrates the feasibility of using tissue-specific expression of cell cycle-independent iCaspases as a nonmutagenic alternative modality for prostate cancer suicide gene therapy.
On the differences between correct student solutions

We know that students solve problems in different ways, but we know little about the kinds of variation, or the degree of variation between these student generated solutions. In this paper, we propose a taxonomy that classifies the variation between correct student solutions in objective terms, and we show how the application of the taxonomy provides instructors with additional insight about the differences between student solutions. This taxonomy may be used to inform instructors in selecting examples of code for teaching purposes, and provides the possibility of automatically applying the taxonomy to existing solution sets.
Differentially-Encoded Di-Symbol Time-Division Multiuser Impulse Radio in UWB Channel

Ultra-wideband (UWB) communication systems are expected to operate in a highly frequency-selective multipath fading environment. To exploit multipath diversity gains in a multiuser scenario, we developed a differentially-encoded, di-symbol time-division multiuser impulse radio (d2TD-IR) system with delay-sum autocorrelation receivers. In traditional time-division multiple access systems, each user transmits a single pulse during a symbol duration in a pre-assigned chip which is longer than maximum excess delay of the channel. However, due to the exponential decay property of UWB channel, we proposed the use of much shorter chip duration, which significantly increases the transmission rate. Because dense pulse transmission will induce multiuser interference, two time-hopping access sequences, which alternately encode the odd- and even-index symbols, are employed with delay-sum autocorrelation receivers to maximally suppress the interference. It was shown that when the chip duration is properly chosen, the proposed system outperforms the conventional time-hopping impulse radio system at high signal-to-noise ratio. This paper also proposed a method to estimate the optimal chip duration when only the average power decay profile of the UWB channel is known.
A mine's dynamic rail track scale with automatic motion direction judge

A mine's dynamic rail track scale is studied and some methods of both simple and effective are proposed in this paper. The way of wheel weight for tramcar weighing is put forward. The automatic motion direction judge of the tramcar could be achieved by the staggered installation of the weight sensors without additional infrared detectors or direction sensors. The wheel weight signal is collected and processed combined with empirical mode decomposition (EMD) method.
̈ ucken Alexander Belyaev MPI Saarbr ̈

We present a shape representation, the multi-level partition of unity implicit surface, that allows us to construct surface models from very large sets of points. There are three key ingredients to our approach: 1) piecewise quadratic functions that capture the local shape of the surface, 2) weighting functions (the partitions of unity) that blend together these local shape functions, and 3) an octree subdivision method that adapts to variations in the complexity of the local shape. Our approach gives us considerable flexibility in the choice of local shape functions, and in particular we can accurately represent sharp features such as edges and corners by selecting appropriate shape functions. An error-controlled subdivision leads to an adaptive approximation whose time and memory consumption depends on the required accuracy. Due to the separation of local approximation and local blending, the representation is not global and can be created and evaluated rapidly. Because our surfaces are described using implicit functions, operations such as shape blending, offsets, deformations and CSG are simple to perform.
Appendix II : Construction of Set Constraints

Set based analysis is an approach to compile-time program analysis that is based on a simple approximation: all dependencies between variables are ignored. In effect, program variables are treated as sets of values. Thus far, set based analysis techniques have focussed on dataconstructor languages. The main reason for this is algorithmic: the equality for data-constructor values is structural (that is, two values f (v1; . . . ; vn) and f 0(v0 1; . . . ; v0 n) are equal if and only if f and f 0 are identical constructors and vi = v0 i, i = 1::n). This has important implications for how sets of such values can be represented during the computation of a set based analysis. In contrast, the equality theory of arithmetic is much richer. Two terms with very different structure can be equal. Correspondingly, the manipulation and representation of sets of arithmetic values is significantly more complex. In this paper we extend the ideas of set based analysis to arithmetic expression in such a way that the analysis yields descriptions of how arithmetic values are computed. Importantly, this extended analysis yields useful information about the arithmetic components of a program while maintaining the efficiency of the basic set constraint approach. We show how this information can be exploited during compilation with two examples involving array bounds elimination. While this work is carried out in the context of the ML, the techniques developed appear to be applicable to other languages.