Miracle-dz/UniFAR-FTUs huggingface dataset:
The Impact of Network Size and Mobility on Information Delivery in Cognitive Radio Networks

There have been extensive works on the design of opportunistic spectrum access and routing schemes to improve spectrum efficiency in cognitive radio networks (CRNs), which becomes an integral component in the future communication regime. Nonetheless, the potentials of CRNs in boosting network performance yet remain to be explored to reach the full benefits of such a phenomenal technique. In this paper, we study the end-to-end latency in CRNs in order to find the sufficient and necessary conditions for real-time applications in finite networks and large-scale deployments. We first provide a general mobility framework which captures most characteristics of the existing mobility models and takes spatial heterogeneity into account. Under this general mobility framework, secondary users are mobile with an mobility radius a, which indicates how far a mobile node can reach in spatial domain. We find that there exists a cutoff point on a, below which the latency has a heavy tail and above which the tail of the latency is bounded by some Gamma distributions. As the network grows large, the latency is asymptotically scalable (linear) with respect to the dissemination distance (e.g., the number of hops or euclidean distance). An interesting observation is that although the density of primary users adversely impacts the expected latency, it makes no influence on the dichotomy of the latency tail in finite networks and the linearity of latency in large networks. Our results encourage CRN deployment for real-time and large applications, when the mobility radius of secondary users is large enough.
The mass function of young star clusters in spiral galaxies

Aims. The initial cluster mass function (ICMF) in spiral discs is constrained and compared with data for old globular clusters and young clusters in starbursts. Methods. For a given absolute magnitude, the cluster age distribution depends on the ICMF. Here, the behaviour of the median age-magnitude relation is analysed in detail for Schechter ICMFs with various cut-off masses, Mc. The calculated relations are com- pared with observations of the brightest clusters in spiral galaxies. Schechter functions are also fitted directly to observed mass functions (MFs). Results. A single Schechter ICMF with an Mc of a few times 10 5 Mcan reproduce the observed ages and luminosities of the brightest (and 5th brightest) clusters in the spirals if disruption of optically visible clusters is dominated by relatively slow secular evolution. A Schechter function fit to the combined cluster MF for all spirals in the sample yields Mc = (2.1 ± 0.4) × 10 5 M� . T he MFs in cluster-poor and cluster-rich spirals are statistically indistinguishable. An Mc = 2.1 × 10 5 MSchechter function also fits the MF of young clusters in the Large Magellanic Cloud. If the same ICMF applies in the Milky Way, a bound cluster with M > 10 5 Mwill form about once every 10 7 years, while an M > 10 6 Mcluster will form only once every 50 Gyr. Luminosity functions (LFs) of model cluster populations drawn from an Mc = 2.1 × 10 5 MSchechter ICMF generally agree with LFs observed in spiral galaxies. Conclusions. The ICMF in present-day spiral discs can be modelled as a Schechter function with Mc ≈ 2 × 10 5 M� . H owever, the presence of significant numbers of M > 10 6 M� (and even M > 10 7 M� ) clusters in some starburst galaxies makes it unlikely that the Mc value derived for spirals is universal. In high-pressure environments, such as those created by complex gas kinematics and feedback in mergers, Mc can shift to higher masses than in quiescent discs.
Novel online profiling for virtual machines

Application profiling is a popular technique to improve program performance based on its behavior. Offline profiling, although beneficial for several applications, fails in cases where prior program runs may not be feasible, or if changes in input cause the profile to not match the behavior of the actual program run. Managed languages, like Java and C\#, provide a unique opportunity to overcome the drawbacks of offline profiling by generating the profile information online during the current program run. Indeed, online profiling is extensively used in current VMs, especially during selective compilation to improve program startup performance, as well as during other feedback-directed optimizations. In this paper we illustrate the drawbacks of the current reactive mechanism of online profiling during selective compilation. Current VM profiling mechanisms are slow -- thereby delaying associated transformations, and estimate future behavior based on the program's immediate past -- leading to potential misspeculation that limit the benefits of compilation. We show that these drawbacks produce an average performance loss of over 14.5% on our set of benchmark programs, over an ideal offline approach that accurately compiles the hot methods early. We then propose and evaluate the potential of a novel strategy to achieve similar performance benefits with an online profiling approach. Our new online profiling strategy uses early determination of loop iteration bounds to predict future method hotness. We explore and present promising results on the potential, feasibility, and other issues involved for the successful implementation of this approach.
Equalising schooling, unequalising private supplementary tutoring: access and tracking through shadow education in China

Abstract The global expansion of mass schooling has greatly increased opportunities for low-income families, and governments have devoted much effort to equalising access and quality in education systems. Alongside regular schooling, the so-called shadow education system of private supplementary tutoring has grown rapidly across the world. The fact that rich families can purchase more and better quality shadow education undermines the achievements of increased equality of opportunities in formal schooling. Drawing on a mixed-methods study in Shanghai, China, the article shows how shadow education has offset school equalisation policies through differentiation of access and through sorting mechanisms. Shadow education occupies a space beyond strict government control in which privileged families and elite schools ignore and mediate the equalisation policies, seeking competitive advantages. Uneven access to shadow education and tracking within it shape, maintain, and exacerbate inequitable schooling experiences at individual and institutional levels.
Similarity measures for clustering SNP and epidemiological data

The issue of suitable similarity measures for a joint consideration of so called SNP data and epidemiological variables arises from the GENICA (Interdisciplinary Study Group on Gene Environment Interaction and Breast Cancer in Germany) casecontrol study of sporadic breast cancer. The GENICA study aims to investigate the influence and interaction of single nucleotide polymorphic (SNP) loci and exogenous risk factors. A single nucleotide polymorphism is a point mutation that is present in at least 1 % of a population. SNPs are the most common form of human genetic variations. In particular, we consider 43 SNP loci in genes involved in the metabolism of hormones, xenobiotics and drugs as well as in the repair of DNA. Assuming that these single nucleotide changes may lead, for instance, to altered enzymes or to a reduced or enhanced amount of the original enzymes – with each alteration alone having minor effects – the aim is to detect combinations of SNPs that under certain environmental conditions increase the risk of sporadic breast cancer. The search for patterns in the present data set may be performed by a variety of clustering and classification approaches. I consider here the problem of suitable measures of proximity of two variables or subjects as an indispensable basis for a further cluster analysis. In the present data situation these measures have to be able to handle different numbers and meaning of categories of nominal scaled data as well as data of different scales. Generally, clustering approaches are a useful tool to detect structures and to generate hypothesis about potential relationships in complex data situations. Searching for patterns in the data there are two possible objectives: the identification of groups of similar objects or subjects or the identification of groups of similar variables within the whole or within subpopulations. The different objectives imply different requirements on the measures of similarity. Comparing the individual genetic profiles as well as comparing the genetic information across subpopulations I discuss possible choices of similarity measures suitable for genetic and epidemiological data, in particular, measures based on the ÷2-statistic, Flexible Matching Coefficients and combinations of similarity measures.
Coarse-Grained Prediction of RNA Loop Structures

One of the key issues in the theoretical prediction of RNA folding is the prediction of loop structure from the sequence. RNA loop free energies are dependent on the loop sequence content. However, most current models account only for the loop length-dependence. The previously developed “Vfold” model (a coarse-grained RNA folding model) provides an effective method to generate the complete ensemble of coarse-grained RNA loop and junction conformations. However, due to the lack of sequence-dependent scoring parameters, the method is unable to identify the native and near-native structures from the sequence. In this study, using a previously developed iterative method for extracting the knowledge-based potential parameters from the known structures, we derive a set of dinucleotide-based statistical potentials for RNA loops and junctions. A unique advantage of the approach is its ability to go beyond the the (known) native structures by accounting for the full free energy landscape, including all the nonnative folds. The benchmark tests indicate that for given loop/junction sequences, the statistical potentials enable successful predictions for the coarse-grained 3D structures from the complete conformational ensemble generated by the Vfold model. The predicted coarse-grained structures can provide useful initial folds for further detailed structural refinement.
Two-stage skew correction of handwritten Bangla document images

Skewness in the handwritten document images is a common scenario. Therefore, it is very much required to detect and correct the skewness before the document is presented to the document image analysis system. In this regard, the present work develops a two-stage Hough transform based approach to remove the skewness in the document images written in Bangla script. Firstly, page-level skewness is removed by rotating the skewed text lines appropriately and then skewed words in each text line, if any, are also rotated along a reference line.
Rhythmic variability in Swiss German dialects

Speech rhythm can be measured acoustically in terms of durational characteristics of consonantal and vocalic intervals. The present paper investigated how acoustically measurable rhythm varies across dialects of Swiss German. Rhythmic measurements (%V, ∆C, ∆V, varcoC, varcoV, rPVI-C, nPVI- C, nPVI-V) were carried out on four sentences of six speakers from eight Swiss dialects. Results indicate that there are significant differences across the dialects in some rhythm measures but not in others and that dialects can be grouped according to rhythmic characteristics.
Evaluation of Ecosystem Dynamics, Plant Geography and Terrestrial Carbon Cycling in the Lpj Dynamic Global Vegetation Model

The Lund±Potsdam±Jena Dynamic Global Vegetation Model (LPJ) combines process-based, large-scale representations of terrestrial vegetation dynamics and land-atmosphere carbon and water exchanges in a modular framework. Features include feedback through canopy conductance between photosynthesis and transpiration and interactive coupling between thesèfast' processes and other ecosystem processes including resource competition , tissue turnover, population dynamics, soil organic matter and litter dynamics and fire disturbance. Ten plants functional types (PFTs) are differentiated by physiological, morphological, phenological, bioclimatic and fire-response attributes. Resource competition and differential responses to fire between PFTs influence their relative fractional cover from year to year. Photosynthesis, evapotranspiration and soil water dynamics are modelled on a daily time step, while vegetation structure and PFT population densities are updated annually. Simulations have been made over the industrial period both for specific sites where field measurements were available for model evaluation, and globally on a 0.58 8 3 0.58 8 grid. Modelled vegetation patterns are consistent with observations, including remotely sensed vegetation structure and phenology. Seasonal cycles of net ecosystem exchange and soil moisture compare well with local measurements. Global carbon exchange fields used as input to an atmospheric tracer transport model (TM2) provided a good fit to observed seasonal cycles of CO 2 concentration at all latitudes. Simulated inter-annual variability of the global terrestrial carbon balance is in phase with and comparable in amplitude to observed variability in the growth rate of atmospheric CO 2. Global terrestrial carbon and water cycle parameters (pool sizes and fluxes) lie within their accepted ranges. The model is being used to study past, present and future terrestrial ecosystem dynamics, biochemical and biophysical interactions between ecosystems and the atmosphere , and as a component of coupled Earth system models.
A wideband circularly polarized stacked slotted microstrip patch antenna

A wideband, single-feed, circularly polarized, stacked, square, slotted microstrip patch antenna is proposed for radio-frequency-identification-reader applications. The proposed antenna consists of an upper square asymmetric slotted patch, stacked over a lower square asymmetric slotted radiating patch and a microstrip stub, along with a coaxial feed. The wideband circularly polarized radiation of the antenna is achieved using a microstrip stub in the lower patch and a stacked slotted square patch. The proposed antenna is designed using a combination of low-cost FR4 substrate and foam. The measured 10 dB return-loss bandwidth of the antenna was around 21% (833 MHz to 1033 MHz), and the 3 dB axial-ratio bandwidth of the antenna was around 13.4% (835 MHz to 955 MHz). The gain was around 7.0 dBic over the 3 dB axial-ratio bandwidth. The overall antenna volume was 0. 601λ0 × 0. 601λ0 × 0. 895λ0 (where λ0 is the free-space wavelength at 900 MHz).
Stable Expression of the Alkaline Phosphatase Marker Gene by Neural Cells in Culture and after Transplantation into the CNS Using Cells Derived from a Transgenic Rat

Multipotent stem cells and more developmentally restricted precursors have previously been isolated from the developing nervous system and their properties analyzed by culture assays in vitro and by transplantation in vivo. However, the variety of labeling techniques that have been used to identify grafted cells in vivo have been unsatisfactory. In this article we describe the characteristics of cells isolated from a transgenic rat in which the marker gene human placental alkaline phosphatase (hPAP) is linked to the ubiquitously active R26 gene promoter. We show that hPAP is readily detected in embryonic neuroepithelial stem cells, neuronal-restricted precursor cells, and glial-restricted precursor cells. Transgene expression is robust and can be detected by both immunocytochemistry and histochemistry. Furthermore, the levels of hPAP on the cell surface are sufficient for live cell labeling and fluorescence-activated cell sorting. Expression of hPAP is stable in isolated cells in culture and in cells transplanted into the spinal cord for at least 1 month. We submit that cells isolated from this transgenic rat will be valuable for studies of neural development and regeneration.
A variation of Knoop, Rüthing, and Steffen's Lazy Code Motion

Morel and Renvoise discussed in 1979 a universal method for global code optimization in a compiler. By suppressing partial redundancies their method achieves several optimization techniques - such as moving loop invariant computations out of a loop or deleting redundant computations - at once. Their algorithm moves computations to earlier places in execution paths to eliminate partial redundancies. The movement is controlled by some heuristics.The heuristics and algorithms used by Morel and Renvoise sometimes cause difficulties for practical use. Subsequent papers partly circumvented these difficulties by slightly modifying the heuristics and the algorithms. Knoop, R&uuml;thing, and Steffen published in their paper Lazy Code Motion an optimal algorithm for the elimination of partial redundancies which entirely prevents these difficulties. This paper presents a variant of their algorithm which is better prepared for practical use.
Designing a semantic sketchbook to create opportunities for serendipity

Serendipity is where unexpected circumstances and an insightful 'aha' moment result in a valuable outcome. We discuss how interactive systems can support the process of serendipity: from making new connections, to projecting and exploiting their potential value. We focus in particular on how technology can support reflection -- which is an important part of the serendipity process. By considering findings from a set of empirical studies and a set of design principles aimed at encouraging reflection, we present an early stage digital 'Semantic Sketchbook' which was designed with the aim of supporting reflection (as well as other aspects of the process of serendipity). We discuss how our 'Semantic Sketchbook' has the potential to create opportunities for serendipity and the next steps we intend to take in developing it and evaluating its success.
B cell activation and the establishment of Epstein-Barr virus latency

Linear EBV genomes undergo a transition to the circular form characteristic of latency by 16-20 h post-infection. This transition requires that the infected cells be activated to the G1 stage of the cell cycle. Cellular proliferation and expression of the activation marker CD23 were not required. Nevertheless, 36 h post-infection, only cells expressing CD23 contained covalently closed, circular episomes (CCC), at an average of one copy per cell. Since the presence of CD23 at this time is predictive that a cell will immortalize, we suggest that the presence of CCC is required for CD23 expression and subsequent immortalization. The one CCC present in each CD23+ cell did not undergo amplification until well after the cells had acquired all of the characteristic phenotypic markers of immortalization. Therefore, while amplification is not necessary for proliferation and immortalization, circularization of a single genome is crucial to the establishment and maintenance of latency by EBV.
Application of Network Intrusion Detection Based on Fuzzy C-Means Clustering Algorithm

Aiming at the problem of higher false positive and missing report rate in network intrusion detection, an intrusion detection method based on clustering algorithm is proposed in this paper. This method applies Fuzzy C-means clustering Algorithm to the detection of network intrusion. Through the building of intrusion detection model, carries out fuzzy partition and the clustering of data, and this will detach normal data and attack data effectively. The experiment shows the feasibility and validity of Fuzzy C-means clustering algorithm.
A Secure Routing Scheme for DSR

In this paper, we propose an approach based on one time passwords to secure the DSR protocol. The main concern of this work is to provide an efficient level of security for DSR keeping in mind as a main objective the minimization of the calculation cost. Some experimental results are presented to show the effectiveness of the proposed solution.
The realization and design of the position system with high accuracy based on the loop-cable

The position detection technology for the low speed maglev train test line in Tangshan is studied based on the inductive looped-cable. It could provide accurate position information as the maglev train's inlet parking. The paper introduces the functionality of the system, and uses the two on-board coils to receive signal. By doing the signal division operation, the measurement error caused by the shaking or vibration is inhibited to a certain extent. The impedance characteristics of the loop-cable on track and the on-board coil are analyzed and two different impedance matching methods are adopted. Finally, the system implementation and experiment results are given, which shows that the system could meet the requirement for the maglev train's inlet parking.
On the Conservation Law and the Performance Space of Single Server Systems

We consider a multiclass GI/G/1 queueing system, operating under an arbitrary work-conserving scheduling policy π. We derive an invariance relation for the Cesaro sums of waiting times under π, which does not require the existence of limits of the Cesaro sums. This allows us to include important classes in the set of admissible policies such as time-dependent and adaptive policies. For these classes of policies, ergodicity is not known a priori and may not even exist. Therefore, the classical invariance relations that involve statistical averages do not hold. For an M/G/1 system, we derive inequalities involving the Cesaro sums of waiting times that further characterize the achievable performance region of the system.
Computing cores for data exchange: new algorithms and practical solutions

Data Exchange is the problem of inserting data structured under a source schema into a target schema of different structure (possibly with integrity constraints), while reflecting the source data as accurately as possible. We study computational issues related to data exchange in the setting of Fagin, Kolaitis, and Popa(PODS'03). We use the technique of hypertree decompositions to derive improved algorithms for computing the core of a relational instance with labeled nulls, a problem we show to be fixed-parameter intractable with respect to the block size of the input instances. We show that computing the core of a data exchange problem is tractable for two large and useful classes of target constraints. The first class includes functional dependencies and weakly acyclic inclusion dependencies. The second class consists of full tuple generating dependencies and arbitrary equation generating dependencies. Finally, we show that computing cores is NP-hard in presence of a system-predicate NULL(x), which is true iff x is a null value.