Miracle-dz/UniFAR-FTUs huggingface dataset:
The sliding DFT

The sliding DFT process for spectrum analysis was presented and shown to be more efficient than the popular Goertzel (1958) algorithm for sample-by-sample DFT bin computations. The sliding DFT provides computational advantages over the traditional DFT or FFT for many applications requiring successive output calculations, especially when only a subset of the DFT output bins are required. Methods for output stabilization as well as time-domain data windowing by means of frequency-domain convolution were also discussed. A modified sliding DFT algorithm, called the sliding Goertzel DFT, was proposed to further reduce the computational workload. We start our sliding DFT discussion by providing a review of the Goertzel algorithm and use its behavior as a yardstick to evaluate the performance of the sliding DFT technique. We examine stability issues regarding the sliding DFT implementation as well as review the process of frequency-domain convolution to accomplish time-domain windowing. Finally, a modified sliding DFT structure is proposed that provides improved computational efficiency.
Inertial primal-dual algorithms for structured convex optimization

The primal-dual algorithm recently proposed by Chambolle & Pock (abbreviated as CPA) for structured convex optimization is very efficient and popular. It was shown by Chambolle & Pock in \cite{CP11} and also by Shefi & Teboulle in \cite{ST14} that CPA and variants are closely related to preconditioned versions of the popular alternating direction method of multipliers (abbreviated as ADM). In this paper, we further clarify this connection and show that CPAs generate exactly the same sequence of points with the so-called linearized ADM (abbreviated as LADM) applied to either the primal problem or its Lagrangian dual, depending on different updating orders of the primal and the dual variables in CPAs, as long as the initial points for the LADM are properly chosen. The dependence on initial points for LADM can be relaxed by focusing on cyclically equivalent forms of the algorithms. Furthermore, by utilizing the fact that CPAs are applications of a general weighted proximal point method to the mixed variational inequality formulation of the KKT system, where the weighting matrix is positive definite under a parameter condition, we are able to propose and analyze inertial variants of CPAs. Under certain conditions, global point-convergence, nonasymptotic $O(1/k)$ and asymptotic $o(1/k)$ convergence rate of the proposed inertial CPAs can be guaranteed, where $k$ denotes the iteration index. Finally, we demonstrate the profits gained by introducing the inertial extrapolation step via experimental results on compressive image reconstruction based on total variation minimization.
Research on Ferroelectric Materials for Millimeter Wave Application

Abstract : A one-year research program has been undertaken to determine whether certain selected ferroelectric materials can be used to obtain effective phase control in millimeter wave radar systems. This investigation is an outgrowth of earlier work at Rockwell which included the first demonstration of microwave phase modulation in strontium barium niobate (SBN) single crystals. 1 The present study combines materials development and millimeter wave characterization to investigate the feasibility of achieving sensitivity of the microwave refractive index to an applied electric field, dn/dE, in excess of 1/ 10,000 meters/volt, while maintaining absorptive loss in the material below a few dB per millimeter. Because measurements early in the program revealed high absorptive losses in the available strontium barium niobate crystals, the first six months have been devoted to expanding the materials base. In addition to the development of growth techniques for other tungsten bronze ferro-electrics, measurements of millimeter wave dielectric properties have been carried out on these ferroelectric and other systems obtained from the Penn State Materials Research Laboratory, including an antiferroelectric ceramic lead-lantanum zirconate-titanate (PLZT). These measurements generally show large decreases in polar axis permittivity from their dc values, suggesting an extrinsic origin for the bulk of the dc permittivity. The material factors controlling this phenomenon should be explored, since they will determine to what extent the observed high losses can be reduced over the frequency range of interest. (Author)
Simulating Cosmic Reionization

The Cosmic Dark Ages and the Epoch of Reionization constitute a crucial missing link in our understanding of the evolution of the intergalactic medium and the formation and evolution of galaxies. Due to the complex nature of this global process it is best studied through large-scale numerical simulations. This presents considerable computational challenges. The dominant contributors of ionizing radiation were dwarf galaxies. These tiny galaxies must be resolved in very large cosmological volumes in order to derive their clustering properties and the corresponding observational signatures correctly, which makes this one of the most challenging problems of numerical cosmology. We have recently performed the largest and most detailed simulations of the formation of early cosmological large-scale structures and their radiative feedback leading to cosmic reionization. This was achieved by running extremely large (up to 29 billion-particle) N-body simulations of the formation of the Cosmic Web, with enough particles and sufficient force resolution to resolve all the galactic halos with total masses larger than 10^8 Solar masses in computational volumes of up to (163 Mpc)^3. These results were then post-processed by propagating the ionizing radiation from all sources by using fast and accurate ray-tracing radiative transfer method. Both of our codes are parallelized using a combination of MPI and OpenMP and to this date have been run efficiently on up to 2048 cores (N-body) and up to 10000 cores (radiative transfer) on the newly-deployed Sun Constellation Linux Cluster at the Texas Advanced Computing Center. In this paper we describe our codes, parallelization strategies, scaling and some preliminary scientific results. (abridged)
Identifying Social Interactions Through Conditional Variance Restrictions

This paper proposes a new method for identifying social interactions using conditional variance restrictions. The method provides a consistent estimate of the social multiplier when social interactions take the "linear-in-means" form (Manski (1993)). When social interactions are not of the linear-in-means form, the estimator, under certain conditions, continues to form the basis of a consistent test of the no social interactions null with correct large sample size. The methods are illustrated using data from the Tennessee class size reduction experiment Project STAR. The application suggests that differences in peer group quality were an important source of individual-level variation in the academic achievement of Project STAR kindergarten students. Copyright Copyright 2008 by The Econometric Society.
Ev Temelli Fen Öğrenme Etkinliklerine Aile Katılımının Bazı Değişkenler Açısından İncelenmesi

Bu arastirmada ortaokulda ogrenim goren cocuklarin ailelerinin, cocuklarinin fen derslerinde ev temelli ogrenme etkinliklerine katiliminin cesitli degiskenler acisindan incelenmesi amaclanmistir. Arastirmanin orneklemini 580 ogrenci velisi olusturmustur. Arastirmanin verileri arastirmacilar tarafindan olusturulan velilere yonelik “Ogrencilerin Ev Temelli Ogrenme Etkinliklerine Aile Katilimi Olcegi (OETOE-AKO)” kullanilarak toplanmistir. Elde edilen bulgulardan velilerin katilim duzeylerinin cinsiyete gore anlamli duzeyde farklilasmadigi gorulmustur. Velilerin aktif katilim duzeyleri, katilim konusunda kendini gelistirme cabalari ve yetersizlik algilarinin velinin ogrenim duzeyine gore farklilastigi bulunmustur. Velilerin aktif katilim duzeylerinin ve yetersizlik algilarinin velilerin gelir duzeylerine gore istatistiksel olarak anlamli duzeyde farklilastigi tespit edilmistir. Arastirmaya katilan ebeveynlerin cocuklarinin ev temelli ogrenme etkinliklerine aktif katilimlarinin, yetersizlik algilarinin, sorumluluk algilarinin ve katilim konusunda kendilerini gelistirme cabalarinin cocuklarinin okudugu sinif duzeyi degiskenine gore anlamli farklilik gosterdigi tespit edilmistir. Arastirmaya katilan ebeveynlerin meslek gruplarina gore cocuklarinin ev temelli ogrenme etkinliklerine aktif katilimlarinin, yetersizlik algilarinin ve katilim konusunda kendilerini gelistirme cabalarinin anlamli farklilik gosterdigi tespit edilmistir.
COMMISSION A: ELECTROMAGNETIC METROLOGY

Communications Research Laboratory (CRL) has developed an optically pumped primary frequency standard CRL-O1 collaborating with NIST (Lee, et al., 1999), and achieved the accuracy of 1.5x10-14(Hasegawa, A., et al. 2000). CRL is now developing an atomic fountain type frequency standard (Fukuda et al., 2000b) and related technologies such as atom trapping, laser cooling, and laser stabilization (Fukuda et al., 1999, Kajita et al., 1998, 1999, Fukuda et al., 2000a, Tachikawa et al., 1999).
Graph algebras and orbit equivalence

We introduce the notion of orbit equivalence of directed graphs, following Matsumoto’s notion of continuous orbit equivalence for topological Markov shifts. We show that two graphs in which every cycle has an exit are orbit equivalent if and only if there is a diagonal-preserving isomorphism between their $C^{\ast }$ -algebras. We show that it is necessary to assume that every cycle has an exit for the forward implication, but that the reverse implication holds for arbitrary graphs. As part of our analysis of arbitrary graphs $E$ we construct a groupoid ${\mathcal{G}}_{(C^{\ast }(E),{\mathcal{D}}(E))}$ from the graph algebra $C^{\ast }(E)$ and its diagonal subalgebra ${\mathcal{D}}(E)$ which generalises Renault’s Weyl groupoid construction applied to $(C^{\ast }(E),{\mathcal{D}}(E))$ . We show that ${\mathcal{G}}_{(C^{\ast }(E),{\mathcal{D}}(E))}$ recovers the graph groupoid ${\mathcal{G}}_{E}$ without the assumption that every cycle in $E$ has an exit, which is required to apply Renault’s results to $(C^{\ast }(E),{\mathcal{D}}(E))$ . We finish with applications of our results to out-splittings of graphs and to amplified graphs.
Analysis of Gene Expression Data 3.1 Spectrum Alignment 3.1.1 Motivation

This work by Pe'er et al. [5] presents an algorithm for reconstructing a target sequence using the SBH technology integrated with known similar reference sequence. The goal is to get the best reconstruction, given these two sources of information. Some motivation for using the method: tests are performed separately for each mutation with different technologies. Since we know the sequence of the gene (and sometimes even where the mutation might appears) we would like to use this information for finding the correct path of the SBH output. • Identifying unknown microorganism can be done by the sequence of a conserved known gene. • Identifying a specific strain by more divergent sequences. • Finding the gene's sequence in one species, given this gene's sequence in another species. • HLA-typing (graft recognition). • Detecting somatic mutations (cancer). All those challenges present one common problem: we need to reconstruct a target sequence given a known similar reference sequence. Current technologies are either target-specific, or ignore existing information on target (redo sequencing the target).
Dynamics of the Genome

This work gives a mathematical foundation for bifurcation from a stable equilibrium in the genome. We construct idealized dynamics associated with the genome. For this dynamics we investigate the two main bifurcations from a stable equilibrium. Finally, we give a mathematical framework for the Repressilator and the Toggle gene circuits.
Extremes of Moving Averages of Stable Processes

Abstract : In this paper extremes of non-normal stable moving average processes are studied. The extremes are described as a marked point process, consisting of the point process of (separated) exceedances of a level together with marks associated with the points, a mark being the normalized sample path of X(t) around an exceedance. It is proved that this marked point process converges in distribution as the level increases to infinity. The limiting distribution is that of a Poisson process with independent marks which have random heights but otherwise are deterministic. As a byproduct of the proof for the continuous-time case, a result on sample path continuity of stable processes is obtained.
AESTETICS, USEFULNESS AND PERFORMANCE IN USER-SEARCH – ENGINE INTERACTION 1

: Issues of visual appeal have become an integral part of designing interactive systems. Interface aesthetics may form users' attitudes towards computer applications and information technology. Aesthetics can affect user satisfaction, and influence their willingness to buy or adopt a system. This study follows previous studies that found that users associate aesthetics with other system attributes, e.g. usability. In this study, we asked whether the well-known phenomenon that beautiful things are perceived as good applies to the perception of the system’s usefulness. A controlled laboratory experiment tested the relationships between users’ perception of aesthetics, usefulness and user performance in tasks performed by participant using an interactive application that surrogated a search engine. We measured users’ perceptions of the search engine before and after they used the system to solve information-seeking tasks, and measured user task performance. As expected, significant correlations were found between perceived aesthetics and perceptions of usability and usefulness prior to actual use of the system. We did not find a relation between perceived aesthetics and usefulness after use; and we did not find an expected effect for aesthetic perceptions neither on perceived usefulness nor on performance. We conclude that there is need for a deeper understanding of aesthetic perceptions; a finer grain perspective of perceived aesthetics that differentiates between aesthetic dimensions may reveal that some aesthetic aspects have greater influence on the relations between aesthetics and usefulness.
@bullet on Kilimanjaro Specifically, There Was a Trend towards In- Creased Summit Success in Those Spending an Extra Night Acclimatising

SUZY STOKES, NICK S. KALSON, MARK EARL, ADAM G. WHITEHEAD, IAN TYRRELL-MARSH, HANNAH FROST, ANDREW DAVIES Clinical Education Centre, University Hospital of North Staffordshire, Stoke-on-Trent ST4 6QG, UK Manchester University Medical School and MARS—Manchester Altitude Research Society, The Medical School, University of Manchester, Stopford Building, Oxford Road, Manchester M13 9PL, UK Hope Hospital, Salford, Salford Royal NHS Foundation Trust, Stott Lane, Salford M6 8HD, UK Tel: 07814263092. Email: suzystokes@doctors.org. uk To whom correspondence should be addressed
Mood States and Consumer Behavior: A Critical Review

A conceptual framework is presented that depicts both the mediating role of mood states and their potential importance in consumer behavior. Reviewing findings from the psychological literature indicates that mood states have direct and indirect effects on behavior, evaluation, and recall. The scope and limitations of these effects are addressed, and the implications for consumer behavior in three areas—service encounters, point-of-purchase stimuli, and communications (context and content)—are examined. Finally, the potential feasibility and viability of mood-related approaches to marketing research and practice are discussed.
Improving Network Security Via Cyber-Insurance A Market Analysis

Recent work in security has illustrated that solutions aimed at detection and elimination of security threats alone are unlikely to result in a robust cyberspace. As an orthogonal approach to mitigating security problems, some have pursued the use of cyber-insurance as a suitable risk management technique. Such an approach has the potential to jointly align the incentives of security vendors (e.g., Symantec, Microsoft), cyber-insurers (e.g., ISPs, cloud providers, security vendors), regulatory agencies (e.g., government), and network users (individuals and organizations), in turn paving the way for comprehensive and robust cyber-security mechanisms. To this end, in this work, we are motivated by the following important question: can cyber-insurance really improve the security in a network? To address this question, we adopt a market-based approach. Specifically, we analyze regulated monopolistic and competitive cyber-insurance markets, where the market elements consist of risk-averse cyber-insurers, risk-averse network users, a regulatory agency, and security vendors. Our results show that (i) without contract discrimination amongst users, there always exists a unique market equilibrium for both market types, but the equilibrium is inefficient and does not improve network security, and (ii) in monopoly markets, contract discrimination amongst users results in a unique market equilibrium that is efficient, which in turn results in network security improvement however, the cyber-insurer can make zero expected profit. The latter fact is often sufficient to de-incentivize the insurer to be a part of a market, and will eventually lead to its collapse. This fact also emphasizes the need for designing mechanisms that incentivize the insurer to permanently be part of the market. In this regard, we propose a non-regulatory mechanism to allow monopoly cyber-insurers to make strictly positive profit.
N-channel Inactivation - Resubmit 10 May 2006 1 Ca2+ Enhances U-type inactivation of N-type (CaV2.2) calcium current in rat sympathetic neurons

1 Ca 2+ Enhances U-type inactivation of N-type (CaV2.2) calcium current in rat sympathetic neurons. ABSTRACT Ca 2+-dependent inactivation (CDI) has recently been demonstrated in heterologously expressed N-type calcium channels (CaV2.2), but CDI has been inconsistently observed in native N-current. We examined the effect of Ca 2+ on N-channel inactivation in rat sympathetic neurons to determine the role of CDI on mammalian N-channels. N-current inactivated with fast (~ 150 ms) and slow (~ 3 s) components in Ba 2+. Ca 2+ differentially affected these components by accelerating the slow component (slow inactivation) and enhancing the amplitude of the fast component (fast inactivation). Lowering intracellular BAPTA concentration from 20 mM to 0.1 mM accelerated slow inactivation, but only in Ca 2+ as expected from CDI. However, low BAPTA accelerated the fast inactivation in either Ca 2+ or Ba 2+ , which was unexpected. Fast inactivation was abolished with monovalent cations as the charge carrier, but slow inactivation was similar to that in Ba 2+. Increased Ca 2+ , but not Ba 2+ , concentration (5-30 mM) enhanced the amplitude of fast inactivation and accelerated slow inactivation. However, the enhancement of fast inactivation was independent of Ca 2+ influx, which indicates the relevant site is exposed to the extracellular solution and is inconsistent with CDI. Fast inactivation showed U– shaped voltage-dependence in both Ba 2+ and Ca 2+ , which appears to result from preferential inactivation from intermediate closed states (U-type inactivation). Taken together, the data support a role for extracellular divalent cations in modulating U-type inactivation. CDI appears to play a role in N-channel inactivation, but on a slower (sec) time scale.
Selecting, adapting and creating CLIL materials

Objectives Each CLIL teacher needs to create CLIL materials because of the lack of these materials on the market. The objective of this chapter is to clarify which objectives need to be met in CLIL materials, and which principles should be incorporated in them. We will also focus on the role of language in CLIL lessons, and particularly on the stages which help learners formulate their preconcepts, construct their new knowledge, and develop not only their subject-specific knowledge but also their cognitive, meta-cognitive and communication skills.
Universality in mean curvature flow neckpinches

We study noncompact surfaces evolving by mean curvature flow. Without any symmetry assumptions, we prove that any solution that is C^3-close at some time to a standard neck will develop a neckpinch singularity in finite time, will become asymptotically rotationally symmetric in a space-time neighborhood of its singular set, and will have a unique tangent flow.
Active Learning of Halfspaces

We study pool-based active learning of half-spaces. In this setting a learner receives a pool of unlabeled examples, and can iteratively query a teacher for the labels of examples from the pool. The goal of the learner is to return a low-error prediction rule for the labels of the examples, using a small number of queries. Most active learning approaches can be loosely described as more ‘aggressive’ or more ‘mellow’. In recent years a significant advancement has been made for active learning in the PAC model using the mellow approach. It has been shown that when the data is realizable under the assumed hypothesis class, the mellow approach can guarantee an exponential improvement in label complexity in comparison with passive learning. An advantage of the mellow approach is its ability to obtain label complexity improvements in the agnostic setting. Nonetheless, in the realizable case the mellow approach is not always optimal. In this work we revisit the aggressive approach for the realizable case, and in particular for active learning of half-spaces in Euclidean spaces. We show that the aggressive approach can be made efficient and practical, while also having theoretical guarantees under reasonable assumptions. We further show, both theoretically and experimentally, that it can sometimes be preferable to mellow approaches. We construct an efficient aggressive active learner of half-spaces in Euclidean spaces, with formal approximation guarantees that hold when the pool is separable with a margin. While our analysis is focused on the realizable setting, we show that a simple heuristic allows using the same algorithm successfully for pools with low error as well. Our algorithm for halfspaces is based on a greedy query selection approach as proposed in Tong and Koller (2002); Dasgupta (2005). We obtain improved target-dependent approximation guarantees for greedy selection in a general active learning setting. These guarantees allow us to prove meaningful approximation guarantees for halfspaces based on a margin assumption. In the second part of this work we compare the greedy approach to the mellow approach. We prove that there exist cases in which this highly aggressive greedy approach indeed results in significantly better label complexity compared to the mellow approach. We further demonstrate experimentally that substantial improvements in label complexity are achieved compared to mellow approaches, for both realizable and low-error settings.