Miracle-dz/UniFAR-FTUs huggingface dataset:
Beyond the Book: Linking Books to Wikipedia

The book translation market is a topic of interest in literary studies, but the reasons why a book is selected for translation are not well understood. The "Beyond the Book" project investigates whether web resources like Wikipedia can be used to establish the level of cultural bias. This work describes the eScience tools used to estimate the cultural appeal of a book: semantic linking is used to identify key words in the text of the book, and afterwards the revision information from corresponding Wikipedia articles is examined to identify countries that generated a more than average amount of contributions to those articles. Comparison between the number of contributions from two countries on the same set of articles may show with which knowledge the contributors are familiar. We assume a lack of contributions from a country may indicate a gap in the knowledge of readers from that country. We assume that a book dealing with that concept could be more exotic and therefore more appealing for certain readers, while others are therefore less interested in the book. An indication of the 'level of exoticness' thus could help a reader/publisher to decide to read/translate the book or not. Experimental results are presented for four selected books from a set of 564 books written in Dutch or translated into Dutch, assessing their potential appeal for a Canadian audience. A qualitative assessment of quantitative results provides insight into named entities that may indicate a high/low cultural bias towards a book.
Towards Sustainable Curation and Preservation: The SEAD Project's Data Services Approach

When the effort to curate and preserve data is made at the end of a project, there is little opportunity to leverage ongoing research work to reduce curation costs or conversely, to leverage curation efforts to improve research productivity. In the Sustainable Environment Actionable Data (SEAD) project, we have envisioned a more active approach to data curation and preservation in which these processes occur in parallel with research and generate sufficient short and long-term return on researcher investments for self-interest to drive their adoption. In this paper, we describe the conceptual framework motivating the SEAD project and the suite of data services we have developed and deployed as an initial implementation of this approach. Use cases in which these services can reduce curation effort and aid ongoing research are highlighted and, based on our experience to date, we identify some key architectural features of our approach as well as open challenges to fully realizing the value of this approach in the broad ecosystem of cyberinfrastructure.
Achieving full diversity and fast ML decoding via simple analog network coding for asynchronous two-way relay networks

In this paper, we propose a simple analog network coding (ANC) scheme for asynchronous two-way relay networks where two sources exchange information through the relay nodes. In our proposed scheme, we consider a wireless scenario with frequency selective fading channels. Orthogonal frequency-division multiplexing (OFDM) is implemented at the two sources and then the OFDM blocks are transmitted to the relay nodes in the first time slot. In the second time slot, at the relay nodes, the ANC that has a few simple operations are implemented on the received mixed signals and then the processed signals are broadcasted to the two sources to finish the information exchange. In this scheme, at each source, when recovering the designed information transmitted from another source, the received signals have the orthogonal space time block code (OSTBC) structure or the quasi-orthogonal space time block code (QOSTBC) structure on each subcarrier. By a proper power allocation, the two sources can achieve full spatial diversity and fast ML decoding without the requirement of symbol level synchronization. By the repetition across the subcarriers, multi-path diversity available in frequency selective fading channels can be also exploited. Moreover, the proposed ANC scheme is also valid for multi-way relay networks where multiple sources exchange information.
Local and global hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks

Since current optical network is actually divided into multiple domains each of which has its own network provider for independent management, the development of multi-domain networks has become the trend of next-generation intelligent optical networks, and then the survivability has also become an important and challenging issue in fault-tolerant multi-domain optical networks. In this paper, we study protection algorithms in multi-domain optical networks and propose a new heuristic algorithm called multi-domain Hamiltonian cycle protection (MHCP) to tolerate the single-fiber link failure. In MHCP, we present the local Hamiltonian cycle (LHC) method based on the physical topology of each single-domain and the global Hamiltonian cycle (GHC) method based on the abstracted virtual topology of multi-domains to protect the intra-fiber link and inter-fiber link failures, respectively. We also present the link-cost formulas to encourage the load balancing and proper links selection for computing the working path of each connection request. Simulation results show that, compared with previous multi-domain protection algorithm, MHCP can obtain better performances in resource utilization ratio, blocking probability, and computation complexity.
A Current Assessment of Software Development Effort Estimation

In most cases, software projects exceed their estimated effort. It is often assumed that inaccurate estimates are the main reason for these overruns. Contrarily, our results show that this assumption is not reasonable in many cases. We conducted a survey to gather data on the current situation of software development effort estimation. Apart from objective criteria, we also asked the participants for their subjective perceptions of the estimates. The participants' perceptions indicate that they do not agree with the objective assessments as 82% perceive their estimate as 'good' despite large overruns and provide reasonable arguments for their perceptions. Furthermore, many projects do not re-estimate the effort due to change requests leading to meaningless comparisons of estimated and actual effort. As a consequence, research needs to find new measures to assess the actual estimation accuracy. Besides the actual estimation process, professionals need to intensify their effort to manage the estimation processes' surroundings.
Glomerular Filtration Rate Equations Do Not Accurately Predict Vancomycin Trough Concentrations in Pediatric Patients

Background: The Bedside Chronic Kidney Disease in Children (CKiD) equation was developed using data from children with chronic kidney disease. Some institutions are using this equation in all pediatric patients, regardless of renal function, to adjust medications. No data have shown that the Bedside CKiD equation is equivalent or better than the Schwartz equation in estimating glomerular filtration rate (GFR) in pediatric patients with normal renal function. Objective: To compare GFR estimates using the Bedside CKiD and Schwartz equations and determine if either offers sufficient vancomycin dosing guidance in hospitalized pediatric patients. Methods: This retrospective review at a single-center, academic, pediatric hospital included patients 2 to 12 years old with a steady-state vancomycin trough collected between January 1, 2010 and December 31, 2011. Patients with acute kidney injury or lacking essential data (e.g., height and serum creatinine), were excluded. An estimated GFR (eGFR) was calculated using the Schwartz and Bedside CKiD equations. Pearson correlations and linear regressions compared the eGFR values and vancomycin troughs. Results: A total of 50 vancomycin troughs were analyzed. There was a weak relationship between the eGFR and troughs for the Schwartz equation (r2 = 0.028) and Bedside CKiD equation (r2 = 0.028). A weak relationship between serum creatinine and troughs was observed (r2 = 0.132). Limitations include small sample size and retrospective design. Conclusions: Neither equation correlates well with vancomycin troughs, suggesting that therapeutic monitoring remains important. Better GFR estimation methods are needed in pediatrics to aid appropriate dosing of renally eliminated medications.
Large-scale magnetic fields at high Reynolds numbers in magnetohydrodynamic simulations

The 11-year solar magnetic cycle shows a high degree of coherence in spite of the turbulent nature of the solar convection zone. It has been found in recent high-resolution magnetohydrodynamics simulations that the maintenance of a large-scale coherent magnetic field is difficult with small viscosity and magnetic diffusivity (≲1012square centimenters per second). We reproduced previous findings that indicate a reduction of the energy in the large-scale magnetic field for lower diffusivities and demonstrate the recovery of the global-scale magnetic field using unprecedentedly high resolution. We found an efficient small-scale dynamo that suppresses small-scale flows, which mimics the properties of large diffusivity. As a result, the global-scale magnetic field is maintained even in the regime of small diffusivities—that is, large Reynolds numbers.
Criteria for Prescribing Dabigatran Etexilate and Rivaroxaban Really Appropriate? Authors’ Reply

• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.
Spectrum Sensing Algorithms via Finite Random Matrices

We address the Primary User (PU) detection (spectrum sensing) problem, relevant to cognitive radio, from a finite random matrix theoretical (RMT) perspective. Specifically, we employ recently-derived closed-form and exact expressions for the distribution of the standard condition number (SCN) of uncorrelated and semi-correlated random dual central Wishart matrices of finite sizes in the design Hypothesis-Testing algorithms to detect the presence of PU signals. In particular, two algorithms are designed, with basis on the SCN distribution in the absence (H0) and in the presence (H1) of PU signals, respectively. Due to an inherent property of the SCN's, the H0 test requires no estimation of SNR or any other information on the PU signal, while the H1 test requires SNR only. Further attractive advantages of the new techniques are: a) due to the accuracy of the finite SCN distributions, superior performance is achieved under a finite number of samples, compared to asymptotic RMT-based alternatives; b) since expressions to model the SCN statistics both in the absence and presence of PU signal are used, the statistics of the spectrum sensing problem in question is completely characterized; and c) as a consequence of a) and b), accurate and simple analytical expressions for the receiver operating characteristic (ROC) - both in terms of the probability of detection as a function of the probability of false alarm (PD versus PF) and in terms of the probability of acquisition as a function of the probability of miss detection (PA versus PM) - are yielded. It is also shown that the proposed finite RMT-based algorithms outperform all similar alternatives currently known in the literature, at a substantially lower complexity. In the process, several new results on the distributions of eigenvalues and SCNs of random Wishart Matrices are offered, including a closed-form of the Marchenko-Pastur's Cumulative Density Function (CDF) and extensions of the latter, as well as variations of asymptotic the distributions of extreme eigenvalues (Tracy-Widom) and their ratio (Tracy-Widom-Curtiss), which are simpler than those obtained with the "spiked population model".
Low-Complexity Multi-Stream Space-Time Codes—Part II: Unitary-Transform Codes

We examine the design of space-time codes that allow simple encoding and decoding of high and low-priority streams of data. This paper comprises two parts. In the first part we introduce the system model, establish performance and complexity criteria, and introduce "direct-sum" codes that combine existing space-time codes with hierarchical modulation. In this second part, we show that the direct-sum codes of the first part can be greatly improved upon by non-direct-sum designs. We demonstrate unitary-transform\/ codes for two and four antennas. In particular, one such code performs 4 dB better than the direct-sum Alamouti code, with per-bit decoding complexity on one stream that is a bounded function of the rate of the other stream.
Cooperate-and-Access Spectrum Sharing with ARQ-Based Primary Systems

We consider spectrum sharing in a cognitive radio network where a secondary system co-exists with an automatic repeat-request (ARQ)-based primary system. A cooperate-and-access spectrum sharing protocol is proposed where the secondary system alternates between cooperation and access modes. In the cooperation mode, the secondary system serves as a relay to assist the primary transmission, and in return accumulates credits. The credits allow the secondary system to gain spectrum access by exploiting the ARQ retransmissions of the primary system. We show analytically that through the proposed credit system, as long as the credits accumulated in cooperation mode compensate for the degradation in primary performance during access mode, an equal or higher average throughput is achieved for the primary system than in the case without spectrum sharing, while providing spectrum access opportunities for the secondary system.
Stochastic Decoding of LDPC Codes over GF(q)

Despite the outstanding performance of non-binary low-density parity-check (LDPC) codes over many communication channels, they are not in widespread use yet. This is due to the high implementation complexity of their decoding algorithms, even those that compromise performance for the sake of simplicity. In this paper, we present three algorithms based on stochastic computation to reduce the decoding complexity. The first is a purely stochastic algorithm with error-correcting performance matching that of the sum-product algorithm (SPA) for LDPC codes over Galois fields with low order and a small variable node degree. We also present a modified version which reduces the number of decoding iterations required while remaining purely stochastic and having a low per-iteration complexity. The second algorithm, relaxed half-stochastic (RHS) decoding, combines elements of the SPA and the stochastic decoder and uses successive relaxation to match the error-correcting performance of the SPA. Furthermore, it uses fewer iterations than the purely stochastic algorithm and does not have limitations on the field order and variable node degree of the codes it can decode. The third algorithm, NoX, is a fully stochastic specialization of RHS for codes with a variable node degree 2 that offers similar performance, but at a significantly lower computational complexity. We study the performance and complexity of the algorithms; noting that all have lower per-iteration complexity than SPA and that RHS can have comparable average per-codeword computational complexity, and NoX a lower one.
Partially Coherent Constellation Design and Bit-Mapping with Coding for Correlated Fading Channels

The space-time (ST) constellation design problem and the related bit mapping schemes for multiple-input multipleoutput (MIMO) systems in spatially correlated Rayleigh fading channels with imperfect channel estimation at the receiver are considered. We assume that the channel estimation error covariance matrix, as well as transmit and receive correlation matrices are perfectly known both at the transmitter and at the receiver. We derive the cutoff rate (CR) and an upper bound (UB) on the average bit error probability (ABEP) expression for spatially correlated channels and propose them as the constellation design criteria subject to a given average transmit power constraint. Additionally, to use the resulting constellations together with forward error correction (FEC) codes requires efficient bit mapping schemes. Because these constellations lack geometrical symmetry in general, the Gray mapping is not always possible in the majority of the constellations obtained. Moreover, different mapping schemes may lead to highly different bit error rate (BER) performances. Thus, an efficient bit mapping scheme called the modified binary switching algorithm (MBSA) is proposed. It minimizes an upper bound on the ABEP (UB-ABEP) and is used to find the bit mapping schemes. Numerical examples show that the designed constellation and its optimized bit mapping together with turbo codes outperform the conventional constellations with respect to the frame error rate (FER).
Strategies for the Management of Postoperative Anemia in Elective Orthopedic Surgery

Objective: To assess the use of oral iron, intravenous (IV) iron, and erythropoiesis-stimulating agents (ESAs) for the prevention and management of perioperative anemia in elective orthopedic surgery patients, and to provide a clinical algorithm for use. Data Sources: A PubMed and MEDLINE search was conducted from 1964 through March 2016 using the following search terms alone or in combination: orthopedic, surgery, elective, anemia, blood transfusion, iron, erythropoiesis-stimulating agents, and erythropoietin. Study Selection and Data Extraction: All English-language prospective and retrospective human studies and meta-analyses evaluating oral iron, IV iron, or ESA alone or in combination in elective orthopedic surgery patients were evaluated, provided they reported blood transfusion outcomes. Data Synthesis: A total of 9 prospective and retrospective studies and 1 meta-analysis were identified and included. In the preoperative setting, administration of oral iron, IV iron, or ESA alone or in combination to correct underlying anemia led to significantly reduced transfusion rates. Transfusion requirements were generally less with combination therapy (ESA + oral or IV iron). In the short-term perioperative or postoperative period, use of oral or IV iron led to conflicting results, with some reporting a statistically significant reduction in blood transfusions, whereas others reported none. Conclusions: In elective orthopedic surgery, IV or oral iron with or without an ESA may provide benefit in prevention of postoperative anemia and results in blood transfusion reduction without significantly increasing the risk of adverse events. These agents should be considered at the lowest effective dose with emphasis on administration prior to planned surgery.
Long-Term Effects of Expiration of Derivatives on Indian Spot Volatility

This paper examines the impact of expiration of derivatives on spot volatility of Indian capital market. The review of the literature shows that the previous Indian studies have covered a period of only 4–6 years after the introduction of derivative trading in India in 2000. They are unanimous about volume effect but not about return and volatility effect. This paper uses regression techniques and one symmetric and three asymmetric GARCH models, namely, TGARCH, EGARCH, and PGARCH, to evaluate the impact. It uses daily data on popular index S&P CNX Nifty of National Stock Exchange of India, during a period of more than a decade from June 12, 2000 to January 10, 2012. Findings of the study show that spot returns, volume, and volatility are high on expiration day and they build up further on the day after expiry which shows that the Indian market is weakly efficient. The expiration effect is mainly due to concentration of volumes in near-month contracts and absence of physical settlement.
Implementing the Han–Kobayashi Scheme Using Low Density Parity Check Codes Over Gaussian Interference Channels

We focus on Gaussian interference channels (GICs) and study the Han-Kobayashi coding strategy for the two-user case with the objective of designing implementable (explicit) channel codes. Specifically, low-density parity-check codes are adopted for use over the channel, their benefits are studied, and suitable codes are designed. Iterative joint decoding is used at the receivers, where independent and identically distributed channel adapters are used to prove that log-likelihood-ratios exchanged among the nodes of the Tanner graph enjoy symmetry when BPSK or QPSK with Gray coding is employed. This property is exploited in the proposed code optimization algorithm adopting a random perturbation technique. Code optimization and convergence threshold computations are carried out for different GICs employing finite constellations by tracking the average mutual information. Furthermore, stability conditions for the admissible degree distributions under strong and weak interference levels are determined. Via examples, it is observed that the optimized codes using BPSK or QPSK with Gray coding operate close to the capacity boundary for strong interference. For the case of weak interference, it is shown that nontrivial rate pairs are achievable via the newly designed codes, which are not possible by single user codes with time sharing. Performance of the designed codes is also studied for finite block lengths through simulations of specific codes picked with the optimized degree distributions with random constructions, where, for one instance, the results are compared with those of some structured designs.
Interference Alignment for Partially Connected Downlink MIMO Heterogeneous Networks

In this paper, we propose interference alignment (IA) schemes for downlink multiple-input-multiple-output heterogeneous networks (HetNets) with partial connectivity, which is induced by the path loss and the low transmission power of small cells. Specifically, we consider two partially connected scenarios of HetNets. In the first scenario, we focus on the partial connectivity among small cells, whereas in the second scenario, we further consider the partial connectivity between the macrocell and small cells. For the first scenario, we first propose a two-stage IA scheme by exploiting the heterogeneity and partial connectivity of HetNets. Then, the influence of the number of served macro users on system degrees of freedom (DoFs) is investigated. In particular, we derive the condition under which serving one macro user achieves more DoFs than serving multiple macro users and design an algorithm to find the optimal number of served macro users to maximize the system DoFs. Afterward, we study the second scenario and extend the two-stage IA to this scenario. The simulation results show that the proposed IA schemes can significantly improve the system sum rate. Moreover, by considering the partial connectivity between the macro cell and small cells, the system performance can be further improved.