Miracle-dz/UniFAR-FTUs huggingface dataset:
Degrees of freedom of the MIMO rank-deficient interference channel with feedback

We investigate the total degrees of freedom (DoF) of the K-user rank-deficient interference channel with feedback. We focus on a symmetric case in which each node has the same number of antennas, the rank of each direct link is the same, and the rank of each cross link is the same. In this paper, we develop a new achievable scheme which employs interference alignment to efficiently utilize the dimension of the received signal space. In addition, we derive an upper bound for the general K-user case and show the tightness of the bound when the number of antennas at each node is sufficiently large. As a consequence of this result, we also show that if there are enough number of antennas at each node, the DoF gain increases proportionally with the number of users.
Predicting performance in the presence of software and hardware resource bottlenecks

Scalability of a multi-tier enterprise system is limited by the presence of software and hardware resource bottlenecks. These bottlenecks typically occur at larger number of users. It would help enterprise applications significantly if these bottlenecks are known a-priori during the performance testing itself. This paper deals with predicting the performance of such systems and models an application in terms of a two layer queuing network consisting of software resources and hardware resources. The software modules which require exclusive access by a thread are modeled as a queuing resource and other modules are treated as delay resources in the software queuing network. This network in turn uses a hardware queuing network consisting of resources such as CPU, disk and network. The proposed solution is augmented with additional constraints to ensure that the solution converges at a large number of users. Further, the proposed solution is capable of modeling multi-class requests with critical section and pooling of resources e.g., connection pool or thread pool. We validate the proposed solution with actual experimental results using sample programs and observe that the model is able to predict throughput and resource utilization with close to 90% accuracy.
90 V 6 FRUHUV 5 HSXWDWLRQ $ 9 HQJLQHV % URZVHU ( PXODWLRQ ZHE GDWDEDVH

Malicious web sites that compromise vulnerable computers a re an ever-present threat on the web. The purveyors of these sites are highly motivated and quickly adapt to technologies that try to protect users from their sites. This paper studies the resultin g arms race between detection and evasion from the point of view of Googl e’s Safe Browsing infrastructure, an operational web-malware detection system that serves hundreds of millions of users. We ana lyze data collected over a four year period and study the most popu lar practices that challenge four of the most prevalent web-mal ware detection systems: Virtual Machine client honeypots , Browser Emulator client honeypots , Classification based on domain reputation , andAnti-Virus engines . Our results show that none of these systems are effective in isolation. In addition to describing speci fic methods that malicious web sites employ to evade detection, we st udy trends over time to measure the prevalence of evasion at scal e. Our results indicate that exploit delivery mechanisms are beco ming increasingly complex and evasive.
A Study about Placement Support Using Semantic Similarity

This paper discusses Latent Semantic Analysis (LSA) as a method for the assessment of prior learning. The Accreditation of Prior Learning (APL) is a procedure to offer learners an individualized curriculum based on their prior experiences and knowledge. The placement decisions in this process are based on the analysis of student material by domain experts, making it a time-consuming and expensive process. In order to reduce the workload of these domain experts we are seeking ways in which the preprocessing and selection of student submitted material can be achieved with technological support. This approach can at the same time stimulate research about assessment in open and networked learning environments. The study was conducted in the context of a Psychology Course of the Open University of the Netherlands. The results of the study confirm our earlier findings regarding the identification of the ideal number of dimensions and the use of stopwords for small-scale corpora. Furthermore the study indicates that the application of the vector space model and dimensionality reduction produces a well performing classification model for deciding about relevant documents for APL procedures. Together we discuss methodological issues and limitations of our study whilst also providing an outlook on future research in this area.
Designing an ubiquitous computing environment for monitoring physical activity

The physical inactivity has been indicated by the World Health Organization (WHO) as one of the main risk factors for the incidence of Chronic Non-Communicable Diseases (CNCDs). Millions of deaths in the world are a result of these diseases, and this number has increased each year. In an attempt to change this scenario WHO has stimulated regular practice of physical activities, because they play an important role in preventing CNCDs. In Brazil, these activities are performed by health units which generate a large amount of data that need treatment. To deal with this problem we developed UCEMEPA, an environment that employs ubiquitous computing technologies and wireless communication networks, in order to monitor remotely and evaluate participants of physical activity groups in real-time. This environment automatically collects physiologic data, and provides indicators which will support and direct public policies for promoting physical activity. In this sense, UCEMEPA will contribute for the promotion of health and quality of life, and for the conduction of longitudinal studies aiming to establish correlations between the practice of physical activity and CNCDs prevention.
Radio spectra and polarization properties of radio‐loud broad absorption‐line quasars

We present multi-frequency observations of a sample of 15 radio-emitting Broad Absorption Line Quasars (BAL QSOs), covering a spectral range between 74 MHz and 43 GHz. They display mostly convex radio spectra which typically peak at about 1-5 GHz (in the observer’s rest-frame), flatten at MHz frequencies, probably due to synchrotron self-absorption, and become steeper at high frequencies, i.e., ν &20 GHz. VLA 22-GHz maps (HPBW � 80 mas) show unresolved or very compact sources, with linear projected sizes of 61 kpc. About 2/3 of the sample look unpolarised or weakly polarised at 8.4 GHz, frequency in which reasonable upper limits could be obtained for polarised intensity. Statistical comparisons have been made between the spectral index distributions of samples of BAL and non-BAL QSOs, both in the observed and the rest-frame, finding steeper spectra among non-BAL QSOs. However constraining this comparison to compact sources results in no significant differences between both distributions. This comparison is consistent with BAL QSOs not being oriented along a particular line of sight. In addition, our analysis of the spectral shape, variability and polarisation properties shows that radio BAL QSOs share several properties common to young radio sources like Compact Steep Spectrum (CSS) or Gigahertz-Peaked Spectrum (GPS) sources.
WFPC 2 OBSERVATIONS OF STAR CLUSTERS IN THE MAGELLANIC CLOUDS : I . THE LMC GLOBULAR CLUSTER HODGE 11 1

We present our analysis of Hubble Space Telescope Wide Field Planetary Camera 2 observations in F555W (broadband V) and F450W (broadband B) of the globular cluster Hodge 11 in the Large Magellanic Cloud galaxy. The resulting V vs. B − V color-magnitude diagram reaches 2.4 mag below the main-sequence turnoff (which is at V TO = 22.65 ± 0.10 mag or M TO V = 4.00 ± 0.16 mag). Comparing the fiducial sequence of Hodge 11 with that of the Galactic globular cluster M92, we conclude that, within the accuracy of our photometry, the age of Hodge 11 is identical to that of M92 with a relative age-difference uncertainty ranging from 10% to 21%. Provided that Hodge 11 has always been a part of the Large Magellanic Cloud and was not stripped from the halo of the Milky Way or absorbed from a cannibalized dwarf spheroidal galaxy, then the oldest stars in the Large Magellanic Clouds and the Milky Way appear to have the same age.
Phylogenetic Relationships of the Mangalitsa Swine Breed Inferred from Mitochondrial DNA Variation

The Mangalitsa pig, a swine breed belonging to the protected gene fund of original and primitive animal breeds of the FAO (Food and Agriculture Organization), has been known to inhabit Romanian territories since the 19th century. The aim of this study was to compare the Mangalitsa breed with several European and Asiatic swine breeds in order to emphasize its uniqueness and to elucidate its origin. For this purpose, we analyzed a 613 bp mitochondrial DNA D-loop fragment and 1140 bp of the cytochrome b gene in a population of Mangalitsa pigs and the polymorphic sites were compared with sequences from GenBank originating from other swine breeds. Taking into account the total of 24 breeds and 5 different Wild Boar populations analyzed, 86 polymorphic sites representing 32 haplotypes were observed, with an average percentage of polymorphic sites of 4.9%. Three Neighbor-Joining phylogenetic trees were constructed based on Kimura 2-parameter distances, using D-loop, cytochrome b and mitochondrial reunited sequences. For the analyzed Mangalitsa population, four distinct haplotypes were identified, including one that was common to other breeds. Our study suggests that the Mangalitsa swine originate from primitive breeds which might be directly derived from the Wild Boar.
Mathematical decomposition techniques for distributed cross-layer optimization of data networks

Network performance can be increased if the traditionally separated network layers are jointly optimized. Recently, network utility maximization has emerged as a powerful framework for studying such cross-layer issues. In this paper, we review and explain three distinct techniques that can be used to engineer utility-maximizing protocols: primal, dual, and cross decomposition. The techniques suggest layered, but loosely coupled, network architectures and protocols where different resource allocation updates should be run at different time-scales. The decomposition methods are applied to the design of fully distributed protocols for two wireless network technologies: networks with orthogonal channels and network-wide resource constraints, as well as wireless networks where the physical layer uses spatial-reuse time-division multiple access. Numerical examples are included to demonstrate the power of the approach
Figurines, a multimodal framework for tangible storytelling

This paper presents Figurines, an offline framework for narrative creation with tangible objects, designed to record storytelling sessions with children, teenagers or adults. This framework uses tangible diegetic objects to record a free narrative from up to two storytellers and construct a fully annotated representation of the story. This representation is composed of the 3D position and orientation of the fig-urines, the position of decor elements and interpretation of the storytellers' actions (facial expression, gestures and voice). While maintaining the playful dimension of the storytelling session, the system must tackle the challenge of recovering the free-form motion of the figurines and the storytellers in uncontrolled environments. To do so, we record the storytelling session using a hybrid setup with two RGB-D sensors and figurines augmented with IMU sensors. The first RGB-D sensor completes IMU information in order to identify figurines and tracks them as well as decor elements. It also tracks the storytellers jointly with the second RGB-D sensor. The framework has been used to record preliminary experiments to validate interest of our approach. These experiments evaluate figurine following and combination of motion and storyteller's voice, gesture and facial expressions. In a make-believe game, this story representation was re-targeted on virtual characters to produce an animated version of the story. The final goal of the Figurines framework is to enhance our understanding of the creative processes at work during immersive storytelling.
TDT-2002 Topic Tracking at Maryland: First Experiments with the Lemur Toolkit

Abstract : The University of Maryland submitted six topic tracking runs for the 2002 Topic Detection and Tracking evaluation. Two runs were produced using the Lemur language modeling toolkit, the remaining four were produced using a separate system coded in Perl. The Lemur runs outperformed the Perl runs on the required condition because term frequency information was better handled. Two of the Perl runs used native Arabic orthography with two-best translation based on a statistical lexicon, obtaining similar results to those obtained with the Arabic-to-English translations provided with the collection.
Power-efficient data management for dynamic applications

In recent years, the semiconductor industry has turned its focus towards heterogeneous multi-processor platforms. They are an economically viable solution for coping with the growing setup and manufacturing cost of silicon systems. Furthermore, their inherent flexibility also perfectly supports the emerging market of interactive, mobile data and content services. The platform's performance and energy depend largely on how well the data-dominated services are mapped on the memory subsystem. A crucial aspect thereby is how efficient data is transferred between the different memory layers. Several compilation techniques have been developed to optimally use the available bandwidth. Unfortunately, they do not take the interaction between multiple threads running on the different processors into account, only locally optimize the bandwidth nor deal with the dynamic behavior of these applications. The contributions of this chapter are to outline the main limitations of current techniques and to introduce an approach for dealing with the dynamic multi-threaded of our application domain.
A path combinational method for multiple pattern matching

Multiple pattern matching architecture is critical for content inspection based network security applications, especially for high speed network or large pattern sets. This paper presents a method to optimize the potential memory usage for multiple string or regular expression matching by the idea of combining DFA's paths, named isomorphic path combination (IMPC). To achieve IMPC, a novel multiple pattern matching algorithm is proposed, which is based on Cached DFA (CDFA). Compared to extended AC algorithm based on DFA, our method on CDFA can reduce 78.6% states for Snort pattern set, which results in one of the most memory efficient methods. More important is that our method can be embedded to other algorithms as the optimization.
Coisotropic D8-branes and model-building

Up to now chiral type IIA vacua have been mostly based on intersecting D6-branes wrapping special Lagrangian 3-cycles on a CY3 manifold. We argue that there are additional BPS D-branes which have so far been neglected, and which seem to have interesting model-building features. They are coisotropic D8-branes, in the sense of Kapustin and Orlov. The D8-branes wrap 5-dimensional submanifolds of the CY3 which are trivial in homology, but contain a worldvolume flux that induces D6-brane charge on them. This induced D6-brane charge not only renders the D8-brane BPS, but also creates D = 4 chirality when two D8-branes intersect. We discuss in detail the case of a type IIA T6/(2 ? 2) orientifold, where we provide explicit examples of coisotropic D8-branes. We study the chiral spectrum, SUSY conditions, and effective field theory of different systems of D8-branes in this orientifold, and show how the magnetic fluxes generate a superpotential for untwisted K? hler moduli. Finally, using both D6-branes and coisotropic D8-branes we construct new examples of MSSM-like type IIA vacua.
ematode functional guilds , not trophic groups , reflect shifts in soil ood webs and processes in response to interacting global change actors

Soils store ∼80% of global terrestrial organic carbon and alterations in fluxes into and out of this pool may interact with ongoing climate change. Belowground food webs drive soil C dynamics, but little is known about their responses to co-occurring global change agents. We investigated open-air experimental grassland communities at ambient and elevated atmospheric CO2 concentration, ambient and enriched nitrogen input, and ambient and reduced summer precipitation to evaluate how these agents interactively affect soil nematodes, which are often used as an indicator group for soil food web structure and soil health. The aim of the study was to elucidate the response of the functional diversity of soil nematodes to changing environmental conditions by using nematode functional guilds and indices as
How to cite curated databases and how to make them citable

Curated scientific databases such as the IUPHAR database resemble conventional publications such as reference manuals in that they represent the work of a large number of people who both create and revise their contents. The difference is that curated databases have more internal structure and that they change more frequently. How should we cite all or parts of such a database? We use conventional citations primarily to identify the source material, but this is not their only use. They are distinguished from persistent object identifiers (or other "randomly" assigned digital keys) in their ability to provide some additional information, such as authorship or title that may be useful even before we look at the cited work
Off-policy learning based on weighted importance sampling with linear computational complexity

Importance sampling is an essential component of model-free off-policy learning algorithms. Weighted importance sampling (WIS) is generally considered superior to ordinary importance sampling but, when combined with function approximation, it has hitherto required computational complexity that is O(n2) or more in the number of features. In this paper we introduce new off-policy learning algorithms that obtain the benefits of WIS with O(n) computational complexity. Our algorithms maintain for each component of the parameter vector a measure of the extent to which that component has been used in previous examples. This measure is used to determine component-wise step sizes, merging the ideas of stochastic gradient descent and sample averages. We present our main WIS-based algorithm first in an intuitive acausal form (the forward view) and then derive a causal algorithm using eligibility traces that is equivalent but more efficient (the backward view). In three small experiments, our algorithms performed significantly better than prior O(n) algorithms for off-policy policy evaluation. We also show that our adaptive step-size technique can also improve the performance of on-policy algorithms such as TD(λ) and true online TD(λ).
Comparison of commercially available (125)I-based RIA methods for the determination of circulating 25-hydroxyvitamin D.

BACKGROUND Measurement of circulating 25-hydroxyvitamin D [25(OH)D] is important in the management of metabolic bone disease. The aim of this study was to compare two widely used methods for the quantification of circulating 25(OH)D with attention to their abilities to measure 25-hydroxylated ergocalciferol (vitamin D(2)) [25(OH)D(2)] and cholecalciferol (vitamin D(3)) [25(OH)D(3)]. METHODS We used two commercially available, Food and Drug Administration-approved, radioiodine ((125)I)-based RIA kits for the detection of 25(OH)D (DiaSorin, Stillwater, MN and IDS Ltd, Tyne and Wear, United Kingdom). These methods were tested for general assay performance, including antibody specificity. Results were compared with those of an HPLC-based direct ultraviolet detection method. RESULTS Within- and between-run CVs were </=10%. Both methods quantitatively recovered 25(OH)D(3) added to serum, but only the DiaSorin kit quantitatively recovered 25(OH)D(2). The primary antibody in the IDS kit had unequal reactivities with pure 25(OH)D(2) and 25(OH)D(3), whereas the DiaSorin primary antibody reacted with them equally. In 50 patient samples assayed by HPLC, the IDS method, but not the DiaSorin method, underestimated total circulating 25(OH)D when significant circulating 25(OH)D(2) was present in patient samples. CONCLUSIONS Some immunoassays may underestimate total 25(OH)D when 25(OH)D(2) constitutes an appreciable part of the total.
Managing Evolution of Component Specifications using a Federation of Repositories

When developing software components in a distributed environment, certain issues regarding the component specifications must be handled: 1. specifications need to consistently reference concrete versions of other specifications, while easy transition to refer to the new versions in either a specification or an implementation is demanded; 2. a hierarchy of description languages exists; specifications declared in additional description languages need to reference specifications already declared in preceding languages; 3. specifications are expected to evolve (potentially in multiple lines of development) while being at the same time used on other, potentially disconnected nodes; 4. a successor relation among the versions is desired. In the common solutions available, these issues are usually addressed only by a simple unique version identifier. We address the issue using a concept of a repository holding the specifications, assuming existence of a federation of the repositories. Besides generic reasoning, we propose a concrete realization of the concept, the Type Information Repository (TIR), integrated into the SOFA component model. Meanwhile, we also derive general requirements for a version model to be used in such a repository and we also describe the concrete version model used in TIR; we show its integration with the SOFA Component Definition Language (CDL) and rules to be imposed on combining different versions of related specifications in CDL declarations. The integration also includes rules for automatic selection of the appropriate version (profiles are used for this). The concept of a repository has been proven as realistic by implementing TIR and a CDL compiler storing compiled specifications in the repository. Furthermore, a graphical interactive interface to both the repository and the CDL compiler has been developed as a module for the Forte environment, allowing to browse the repository and interactively compile