Miracle-dz/UniFAR-FTUs huggingface dataset:
Asymptotic Analysis of Uplink Interference Alignment in Ricean Small Cells

In this work, we analyze the uplink capacity of a cellular Ricean channel system where clusters of small cell base stations are coordinated by a central processor. Two different scenarios dealing with intercluster interference are analyzed: global multicell joint decoding, where all base stations are connected to a central processor, and interference alignment that is used to mitigate intercluster interference. We analyze the impact of the Ricean factor on the clustered interference alignment performance. In this setting, we use recent results from random matrix theory, in particular the deterministic equivalent approach, to compute analytical expressions of the per-cell capacity. Simulation results corroborate the asymptotic analysis and show the performance of the interference alignment mitigation scheme in a Ricean channel multicell system. Interference alignment allows the per-cell capacity to achieve the benchmark, represented by the per-cell capacity in global multicell joint decoding. For high values of the Ricean factor, we observe that interference alignment has a better performance on intercluster interference.
Dynamic control of slow light pulses in photonic crystal waveguides

Lattice-shifted photonic crystal waveguide generates low-dispersion slow light for nonlinear enhancement and dispersion-compensated slow light for tunable delay. The low-dispersion slow light at a fiber communication wavelength produces efficient two-photon absorption and carrier plasma dispersion (CPD) when the waveguide is fabricated into Si. This presentation demonstrates the following three functions obtained with such two slow light pulses: 1) adiabatic wavelength conversion, 2) pulse compression, and 3) ultrafast delay tuning. For 1), we show that co-propagating two slow light pulses break the limit of the conventional adiabatic wavelength conversion using a resonator. For 2), a compression factor of 3.3 is demonstrated using the CPD and heater-controlled dispersion compensator. For 3), the delay of the signal pulse is shifted up to 10 ps with a switching time as short as 10 ps, which enables the selective delay tuning of one pulse in a high-speed pulse train.
Conditioned taste aversions modify neural responses in the rat nucleus tractus solitarius

Explorations of the neural substrates of conditioned taste aversions (CTAs) have focused principally on diencephalic and telencephalic structures. The nucleus tractus solitarius (NTS) is the initial gustatory relay in the rat's hindbrain. It is worthy of investigation for its part in mediating CTAs in that it is sensitive to several physiological conditions which affect feeding while also being a site of anatomical convergence for vagal afferents from the viscera and centrifugal projections from areas (hypothalamus, amygdala) implicated in emotions and hedonics. We compared single neuron responses from NTS to several taste stimuli in three groups of rats: (1) those receiving exposure to 0.0025 M sodium saccharin without physiological consequences; (2) those made ill through intraperitoneal injections of LiCl but having no obvious gustatory referent for their malaise (sensitization-pseudoconditioning controls); (3) those in which exposure to 0.0025 M sodium saccharin (the CS) was paired with LiCl- induced poisoning (the US), creating a pronounced aversion to the saccharin. According to response profiles, NTS neurons in all three groups could be divided into subsets of about 30%, which showed a sweet- sensitive profile, and 70%, which were primarily sensitive to nonsweet qualities. The major effect of the conditioning procedure was to increase responsiveness to the saccharin CS only among the sweet- sensitive subset. Moreover, the peak of activity which largely accounted for the increase occurred with a latency of 900 msec, perhaps implicating a secondary input to NTS from diencephalic or telencephalic sites. The significance of the results is that: (1) CTAs affect sensory activity at a lower order level than had heretofore been demonstrated; (2) NTS shows sensitivity to yet another physiological condition, reinforcing the involvement of the hindbrain in hedonics and sophisticated taste-related processes; (3) there is a subset of taste neurons, rather distinct according to its sensitivity profile, which is also functionally unique in its response to conditioning by a sweet CS.
Structural Analysis of the Maize Rp1 Complex Reveals Numerous Sites and Unexpected Mechanisms of Local Rearrangement Article, publication date, and citation information can be found at www.plantcell.org/cgi/doi/10.1105/tpc.006338.

Rp1 is a complex disease resistance locus in maize that is exceptional in both allelic variability and meiotic instability. Genomic sequence analysis of three maize BACs from the Rp1 region of the B73 inbred line revealed 4 Rp1 homologs and 18 other gene-homologous sequences, of which at least 16 are truncated. Thirteen of the truncated genes are found in three clusters, suggesting that they arose from multiple illegitimate break repairs at the same sites or from complex repairs of each of these sites with multiple unlinked DNA templates. A 43-kb region that contains an Rp1 homolog, six truncated genes, and three Opie retrotransposons was found to be duplicated in this region. This duplication is relatively recent, occurring after the insertion of the three Opie elements. The breakpoints of the duplication are outside of any genes or identified repeat sequence, suggesting a duplication mechanism that did not involve unequal recombination. A physical map and partial sequencing of the Rp1 complex indicate the presence of 15 Rp1 homologs in regions of ∼250 and 300 kb in the B73 inbred line. Comparison of fully sequenced Rp1-homologous sequences in the region demonstrates a history of unequal recombination and diversifying selection within the Leu-rich repeat 2 region, resulting in chimeric gene structures.
A business cycle model for Nigeria

The current global financial meltdown draws, once again, attention to the existence of business cycle fluctuations. Experts are of the view that the ongoing crisis is far deeper than the great depression of the 1930s. It should be recalled that the Keynes and Keynesianism was a response to that depression. Therefore, the objective of this paper is to develop a small business cycle model in the spirit of Dynamic Stochastic General Equilibrium (DSGE) model for Nigeria designed to examine the sources of business cycles, and use the model for policy analysis. This paper considers the implications of three policy shocks namely: monetary supply, technology and export supply on some macroeconomic aggregates. While the paper adopts the Nason and Cogley (1994) and Schorfheide (2000) models, it, however, introduces export sector into the model with a view to capturing the transmission channel of terms of trade. The method of estimation is the Bayesian and the paper uses DYNARE codes (dyn_mat_v4). The results obtained in this study show that the Nigerian business cycle is driven by both real and nominal shocks.
Graph-based interference coordination scheme in orthogonal frequency-division multiplexing access femtocell networks

Femtocell technology has gained widespread attention recently due to its advantages, such as infrastructure cost reduction, improved service coverage and high data throughput in indoor environments. As femtocell networks are customer-deployed without proper network planning, their interference environment tends to be much more complicated than traditional cellular networks. The authors present the framework of channel allocation in orthogonal frequency-division multiplexing access (OFDMA) femtocell network with the graphical approaches. A novel graph-based interference coordination scheme is proposed to maximise the system throughput while ensuring proportional rate fairness among femtocells. The scheme explicitly uses the received signal-to-interference-plus-noise-ratio to generate the interference graph of OFDMA femtocell networks, so as to guarantee the acceptable inter-cell interference for all the links. First, all the femtocells are partitioned into different groups by applying a greedy graph colouring algorithm to maximise the sum throughput of each group. The femtocells in the same group share the assigned subchannels while those in different groups are allocated to orthogonal subchannels. Then, an optimisation problem is formulated to determine the number of subchannels assigned to each group. Further, an approximation method is proposed to solve the optimisation problem. Simulation results are conducted to demonstrate the effectiveness of the proposed scheme in terms of throughput and fairness index.
A Ranking Approach to Pronoun Resolution

We propose a supervised maximum entropy ranking approach to pronoun resolution as an alternative to commonly used classification-based approaches. Classification approaches consider only one or two candidate antecedents for a pronoun at a time, whereas ranking allows all candidates to be evaluated together. We argue that this provides a more natural fit for the task than classification and show that it delivers significant performance improvements on the ACE datasets. In particular, our ranker obtains an error reduction of 9.7% over the best classification approach, the twin-candidate model. Furthermore, we show that the ranker offers some computational advantage over the twin-candidate classifier, since it easily allows the inclusion of more candidate antecedents during training. This approach leads to a further error reduction of 5.4% (a total reduction of 14.6% over the twin-candidate model).
Recreational Sport Participation as a Moderator of College Stress

The purpose of this study was to demonstrate that campus recreation could play an important role in student development by providing opportunities for students to cope with the increasing pressures and stress of college life. Forty-four university students completed pre-tests and daily diaries for five weeks surrounding their final exams. Hierarchical multiple regression procedures were used to control the confounding effect of personality, initial anxiety, and physical health on the predictive relationship between recreational sport participation and perceived social support with stress-related anxiety. The results confirmed the hypothesis that after controlling for personality variations, initial anxiety and physical health, both perceived social support and participation in recreational sports could buffer stress-related anxiety.
SocioNet: A Social-Based Multimedia Access System for Unstructured P2P Networks

Increasingly, peer-to-peer (P2P) network users expect to be able to search objects by semantic attributes based on their preferences for multimedia content. Partial match search (i.e., search through the use of multimedia content semantic information) has become an essential service in P2P systems. In this paper, we propose SocioNet, a social-based overlay that clusters peers based on their preference relationships as a small-world network. In SocioNet, peers mimic how people form a social network and how they query, by preference, their friends or acquaintances. Hence, SocioNet benefits from two desirable features of a social network: interest-based clustering and small-world properties (i.e., high cluster coefficient among all peers yet short path lengths between any two peers). To realize an interest-based small-world SocioNet, we also investigate the following practical design issues: 1) similarity estimation: we define a quantifiable similarity measure that enables clustering of similar peers in SocioNet; 2) distributed small-world overlay adaptation: peers maintain a small-world overlay under network dynamics; and 3) query strategy under the small-world overlay: we analyze appropriate settings for the Time-to-Live (TTL) value, for TTL-limited flooding, that provides a satisfactory success ratio and avoids redundant message overhead. We use simulations and a real database called AudioScrobbler [CHECK END OF SENTENCE], which tracks users' listening habits, to evaluate the performance of SocioNet. The results show that SocioNet assists peers in locating content at peers with similar interests through short path lengths, and hence, achieves a higher success ratio (than nonsmall-world interest-based overlays and noninterest-based small-world overlays) while reducing message overhead significantly.
Universität Augsburg Learning Task Patterns to Improve Efficiency and Coordination in Decentralized Autonomic Computing Systems

We present the concept of an efficiency and coordination advisor for autonomic computing approaches for dynamic optimization problems. The problem scenarios targeted contain recurring tasks that our advisor identifies over several runs of the autonomous system thus giving it some limited way to “look into the future”. If the solutions created by the autonomous agents are much worse than the optimally possible solution, the advisor creates exception rules for the agents that make the wrong decisions for the recurring tasks. This allows them to do better decisions in the future in very specific situations while still retaining all advantages of the autonomic computing approach. Our experiments with dynamic instances of the pickup and delivery problem that have recurring tasks in it show that with our advisor approach we can improve substantially instances that result in suboptimal behavior of the autonomous agents without advisor. Our advisor approach is also successful if the recurring tasks change over time.
Two-stage Incremental Working Set Selection for Support Vector Training

We introduce iSVM - an incremental algorithm that achieves high speed in training support vector machines (SVMs) on large datasets. In the common decomposition framework, iSVM starts with a minimum working set (WS), and then iteratively selects one training example to update the WS in each optimization loop. iSVM employs a two-stage strategy in processing the training data. In the first stage, the most prominent vector among randomly selected data is added to the WS. This stage results in an approximate SVM solution. The second stage uses temporal solutions to scan through the whole training data once again to find the remaining support vectors (SVs). We show that iSVM is especially efficient for training SVMs on applications where data size is much larger than number of SVs. On the KDD-CUP 1999 dataset with nearly five millions training examples, iSVM takes less than one hour to train an SVM with 94% testing accuracy, compared to seven hours with LibSVM - one of the state-of-the-art SVM implementations. We also provide analysis and experimental comparisons between iSVM and the related algorithms. Keyword Support Vector Machine, Optimization, Decomposition Method, Sequential Minimal Optimization
Solidaridad comunicativa y reconocimiento: contribuciones de la filosofía para la paz al proyecto unesco de un nuevo humanismo

Profundizando en el significado actual del Humanismo como filosofia practica, y destacando su potencial para orientar procesos democraticos de transformacion social no-violenta, el objetivo de este articulo es explicar la contribucion que hace la Catedra Unesco de Filosofia para la Paz al proyecto Unesco de un Nuevo Humanismo. El articulo presenta dos categorias centrales en torno a las cuales la Filosofia para la Paz contribuye al desarrollo de la renovacion del Humanismo, a saber: la ‘solidaridad comunicativa’ y el ‘reconocimiento’. En este dominio de investigacion, el articulo expone los principios eticos que ponen en juego estas dos categorias analiticas.
Automatic lossy compression of noisy images by spiht or jpeg2000 in optimal operation point neighborhood

It is often needed to compress images with providing certain properties or quality. Wavelet based coders SPIHT and JPEG2000 easily produce a desired compression ratio but not quality especially if one deals with compressing images corrupted by noise for which specific behavior of quality metrics on compression ratio (CR) or bpp might be observed. In particular, optimal operation point (OOP) where a metric determined for compressed and noise free images might have optimum can take place. Lossy compression in OOP or its neighborhood has several advantages, However, for its attaining for such wavelet based coders as SPIHT or JPEG2000, only iterative procedures that can be rather time consuming have been proposed so far. Here, we propose a single-step procedure for determining bpp to be set for providing compression in OOP neighborhood. This procedure exploits two features. First, rate/distortion curves for SPIHT and JPEG2000 are shown to be very similar to those ones for DCT-based coder AGU. Second, a fast and simple procedure for predicting compression ratio in OOP neighborhood (without image compressing) has been proposed for the coder AGU recently. Examples demonstrating that the proposed procedure performs accurately enough are given.
A SURVEY FOR DENSE CORES AND YOUNG STELLAR CLUSTERS IN THE W 3 GIANT MOLECULAR CLOUD

We simultaneously mapped the metastable (J,K) = (1,1) and (2,2) inversion lines of NH3 toward W 3 Main, W 3(OH), and the region between these two star-forming clouds with a 40′′ angular resolution using the 100-m Effelsberg telescope. We observed a 120 square-arcminute region with 20 ′′ spacing and a significantly higher sensitivity than previous maps. We also measured the (J,K) = (3,3) line of NH3 in 28 positions towar d W 3 Main. For comparison with our NH3 survey, we present aK ′-band (2.1μm) survey conducted by J. T. Rayner. TheK ′-band survey detects five distinct stellar clusters within the mapped region. In addition, we compare the NH3 survey to the CO (1-0) maps of the FCRAO 2nd quadrant survey (Heyer et al. 1998) and to the distribution of H ii regions. The goals of this new survey are to a) map the extent of dense gas in th e W 3 Main and W 3(OH) molecular clouds, b) search for previously undetected molecular cores in the intervening molecular cloud, c) measure column densities and T kin for regions of strongNH3 emission, d) compare the distribution of theNH3 emission to that of the CO emission and e) study the relationship between the ammonia gas and sites of star formation as traced by stellar clusters and H ii regions. In the W 3 Main cloud, we find strong and extended NH3 emission toward the relatively quiescent western core, but only weak and non-extended emission toward the highly active, starforming, eastern core. We argue that the NH3 relative abundance in the eastern core is an order of magnitude lower than that in the western core. Southeast o f W 3 Main we detect a newNH3 core, which we denot e W 3 SE. From our NIR images we detect a jet toward this core. Toward the W 3(OH) cloud, we find an extended ( 2 × 1.3 pc), cold ammonia gas component. We show that the narrow plume of NH3(1,1), detected toward W 3(OH) in VLA maps, is part of a larger NH3 structure extending toward a chain of stellar clusters and nebulosities found in our NIR images. We find that the strong NH3 emission detected in the three cores covers 9% of the surveyed region. We estimate virial masses for each NH3 core and find that the total sum of the virial masses is 3300 M . The total mass measured from the CO emission surveyed in this region is 1.6×104 M , thus 20% of the molecular gas in the surveyed region is found in the dense cores. This indicates that the dense cores fill only a small fraction of the total GMC and are concentrated in regions of active star formation. We also find extensive weak NH3 emission which covers one fourth of the surveyed region. This weak emission may trace gas with densities just sufficient to excite the NH3 emission ( 104 cm−3) as well as strongly beam-diluted knots and filaments. We compare in detail the distribution of NH3 cores, young stellar clusters, and H ii regions, and discuss the effects of star formation on the NH3 cores. We also compare the results of our survey to those discussed by Lada (1992) from the CS (2-1) and 2.2 μm surveys obtained for the Orion B giant molecular cloud by Lada et al. (1991a,1991b).
QASE: AN INTEGRATED API FOR IMITATION AND GENERAL AI RESEARCH IN COMMERCIAL COMPUTER GAMES

Computer games have belatedly come to the fore as a serious platform for AI research. Through our own experiments in the fields of imitation learning and intelligent agents, it became clear that the lack of a unified, powerful yet intuitive API was a serious impediment to the adoption of commercial games in both research and education. Parallel to our own specialised work, we therefore decided to develop a generalpurpose library for the creation of game agents, in the hope that the availability of such software would help stimulate further interest in the field. Though geared towards machinelearning, the API would be flexible enough to facilitate multiple forms of artificial intelligence, making it suitable for application in research and in undergraduate courses centring upon traditional AI and agent-based systems. In this paper, we present the result of our efforts; the Quake 2 Agent Simulation Environment (QASE) API. We first describe the theme of our work, the reasons for choosing Quake 2 as our testbed, and the necessity for an API of this nature. We then outline its most important features, before presenting an experiment from our own research to demonstrate QASE’s practical capabilities.
Design and analysis of low powered DNA sequence alignment accelerator using ASIC design flow

This paper presents the design and analysis of Low Powered DNA sequence alignment accelerator using ASIC design flow. The objective of this paper is to design and analyze DNA sequence alignment accelerator using clock cycle reduction and frequency scaling technique, which the power consumption can be optimize. The scope of this paper focuses on the minimization of power consumption for an ASIC DNA sequence alignment accelerator on the matrix filling module of the Smith-Waterman algorithm. Smith-Waterman algorithm is a sensitive algorithm used for procedure of DNA sequence alignment in computational molecular biology. As the number of DNA sequence database increases exponentially, it affects the performance of Smith-Waterman algorithm in general purpose computer. Therefore several techniques have been developed to optimize the performance of the algorithm by exploiting parallelism in the design. The low-powered part of the design focuses on the frequency scaling where it produces the minimal value of dynamic power. The design are described using Verilog HDL coding and compiled using Synopsys Tools. From the data obtained using Synopsys tools, the data is then manipulated to get the optimum combination of parameters to produce the most energy efficient IC. The design produces an ASIC that can work at 25ns-50ns clock period where it is in the high energy efficiency region. This range of frequencies produce dynamic power ranging from 224µW-89µW.
Spatial computation with gamma oscillations

Gamma oscillations in cortex have been extensively studied with relation to behavior in both humans and animal models; however, their computational role in the processing of behaviorally relevant signals is still not clear. One oft-overlooked characteristic of gamma oscillations is their spatial distribution over the cortical space and the computational consequences of such an organization. Here, we advance the proposal that the spatial organization of gamma oscillations is of major importance for their function. The interaction of specific spatial distributions of oscillations with the functional topography of cortex enables select amplification of neuronal signals, which supports perceptual and cognitive processing.