Miracle-dz/UniFAR-FTUs huggingface dataset:
Scheduling Real-Time Traffic With Deadlines over a Wireless Channel

Recently, there has been widespread interest in the extension of data networks to the wireless domain. However, scheduling results from the wireline domain do not carry over to wireless systems because wireless channels have unique characteristics not found in wireline channels, namely, limited bandwidth, bursty channel errors and location-dependent channel errors.In this paper, we study the problem of scheduling multiple real-time streams with deadlines, over a shared channel. We show that, in general, unlike the wireline case, the earliest due date (EDD) or shortest time to extinction (STE) policy is not always the optimal policy, even if the channel state is perfectly known and EDD is implemented only over channels in a “Good” state. Here, optimality is measured with respect to the number of packets lost due to deadline expiry. However, for most values of the channel parameters that are of practical interest, we show through analytical and numerical results that the EDD policy over “Good” channels is nearly optimal. Finally, through simulations, we also show that by combining this policy with fair scheduling mechanisms would result in scheduling algorithms that provide some degree of isolation between the sources as well as provide a natural way of compensating channels that see prolonged error bursts.
Minimal Spanning Tree [H] (Algorithm 422)

V. K e v i n M . W h i t n e y ( R e c d . 4 M a y 1970, 13 Oc t . 1970, a n d 3 A u g . 1971) D e p a r t m e n t o f E l e c t r i c a l E n g i n e e r i n g , U n i v e r s i t y o f M i c h i g a n , A n n A r b o r , M I 48104 list of N K items is searched and updated, the total execution time is proportional to A n . If the graph represented by the inter-node edge length array D M is not connected, the procedure will generate a minimal spanning forest containing the minimal spanning trees of the disjoint components joined together by edges of length 10 l°. A disconnected graph is indicated by a value of 10 l° for variable UK at step 500 during execution of the algorithm. The algorithm may be simply modified to find a spanning tree of maximal total length by changing the loop between statements 300 and 400 to search for the most distant rather than for the nearest remaining node to be adjoined to the partially completed tree. The data storage required for the algorithm may be reduced from N(N -b 5) locations to 5N locations by replacing array D M with an edge length function which calculates the required inter-node edge lengths as they are needed. Such a function will be called N(N 1)/2 times and may extend considerably the size of problem which can be solved by this algorithm on a machine with limited core storage. Acknowledgment is due E.L. Lawler for bringing reference [1] to my attention. This work was supported in part by Rome Air Development Center Contract F30602-69-C-0214 with the Systems Engineering Laboratory of the University of Michigan.
Advanced background elimination in digital holographic microscopy

Background estimation and elimination is an indispensable step of hologram processing. Its application ensures that the fix pattern noise caused by the deposits, dirt and other impurities of the measuring chamber and the optical system do not contaminate the reconstructed holograms and improves the efficiency of the object segmentation. It is conventionally solved by averaging large number of holograms with altering objects within the flow-through cell. Due to the possible illumination changes the background should be updated incessantly during the hologram measuring process. Here we introduce an improved background estimation method where the holographic contributions of the segmented and reconstructed objects are excluded from the running average. The applied segmentation is based on the 3D positions of the objects within the flow-through measuring chamber. Therefore the objects can be distinguished from the impurities and deposits, which customary located at the walls of the measuring chamber. This way, an elevated speed, more adaptive background estimation becomes achievable with reduced noise. The applied object segmentation and hologram subtraction methods are presented also. To accelerate the processing of the measured holograms the application of some parallel computing implementation seems essential. Using stream processors (GPU) we were able to increase the algorithm speed considerably, without perceptible reconstruction accuracy loss.
Sentence Similarity based on Dependency Tree Kernels for Multi-document Summarization

We introduce an approach based on using the dependency grammar representations of sentences to compute sentence similarity for extractive multi-document summarization. We adapt and investigate the effects of two untyped dependency tree kernels, which have originally been proposed for relation extraction, to the multi-document summarization problem. In addition, we propose a series of novel dependency grammar based kernels to better represent the syntactic and semantic similarities among the sentences. The proposed methods incorporate the type information of the dependency relations for sentence similarity calculation. To our knowledge, this is the first study that investigates using dependency tree based sentence similarity for multi-document summarization.
Principled Constructive Induction

A framework for the construction of new features for hard classification tasks is discussed. The approach brings together ideas from the fields of machine learning, computational geometry, and pattern recognition. Two heuristics for evaluation of newly-constructed features are proposed, and their statistical significance verified. Finally, it is shown how the proposed framework can be used to combine techniques for selection of representative examples with techniques for construction of new features, in order to solve difficult problems in learning from examples.
Increased intracellular Ca2+: a critical link in the pathophysiology of sepsis?

Severe bloodstream-borne infection--i.e., sepsis--and the resulting multiorgan failure are now the most common cause of death in many intensive care units. One of the most fundamentally important and controversial issues concerning the pathophysiology of sepsis is the role of intracellular free calcium concentration ([Ca2+]i) in this disorder. Because of the critical role of calcium as an intracellular second messenger and as a potential cellular toxin, resolution of this issue is crucial. Using 19F NMR spectroscopy and the calcium indicator 5,5'-difluoro-bis(2-aminophenoxy)ethane-N,N,N',N'-tetraacetate we demonstrate in the intact perfused organ, the rat thoracic aorta, that [Ca2+]i in aortic smooth muscle is increased > 2-fold during sepsis. Furthermore, we determined that sodium dantrolene, a drug that decreases release of calcium from the sarcoplasmic reticulum and that is lifesaving in malignant hyperthermia (a disorder due to increased [Ca2+]i), is able to reduce the elevated [Ca2+]i in sepsis to control values when added in vitro or when given in vivo to the animal. These results suggest that an increase in [Ca2+]i is an early event in sepsis and that increased [Ca2+]i may be responsible for, or contribute to, cellular injury. Dantrolene may offer a therapeutic strategy in the treatment of sepsis.
Centrality-Aware Link Recommendations

Link recommendations are critical for both improving the utility and expediting the growth of social networks. Most previous approaches focus on suggesting links that are highly likely to be adopted. In this paper, we add a different perspective to the problem by aiming at recommending links that also improve specific properties of the network. In particular, our goal is to recommend to users links that if adopted would improve their centrality in the network. Specifically, we introduce the centrality-aware link recommendation problem as the problem of recommending to a user u, k links from a pool of recommended links so as to maximize the expected decrease of the sum of the shortest path distances of $u$ to all other nodes in the network. We show that the problem is NP-hard, but our optimization function is monotone and sub-modular which guarantees a constant approximation ratio for the greedy algorithm. We present a fast algorithm for computing the expected decrease caused by a set of recommendations which we use as a building block in our algorithms. We provide experimental results that evaluate the performance of our algorithms with respect to both the accuracy of the prediction and the improvement in the centrality of the nodes, and we study the tradeoff between the two.
Pulse-Vanishing Test for Interposers Wires in 2.5-D IC

In this paper, we present a general at-speed test method for die-to-die interconnects and demonstrate its particular application to the interposer wires in a 2.5-D IC. At the heart of this method is a pulse-vanishing test technique (called PV-test), in which a short-duration pulse signal is applied to an interposer wire under test at the driver end. If this pulse vanishes at the receiver's output, then it indicates the presence of a delay fault. This PV-test technique is effective for detecting not only resistive open faults, but also resistive bridging faults between interposer wires. This method has several other advantages. For example, the implementation is especially easy as it incorporates only logic cells and can be merged with boundary scan cells. Also, it can support on-the-spot diagnosis which is desirable in applications where subsequent built-in self-repair is needed.
Characterization of drug resistance mutations in naïve and ART‐treated patients infected with HIV‐1 in Yaounde, Cameroon

Currently the prevalence of HIV‐1 infection in Cameroon is 5.1%, CRF02_AG subtype is responsible for about 50% of infections. Since an HIV‐1 drug resistance test is not yet available widely, accurate data on the prevalence of resistant viral strains are missing. The objective of this study was to determine HIV‐1 genetic diversity and to characterize HIV‐1 mutations conferring drug resistance among antiretroviral therapy (ART)‐naïve and ART‐treated patients. A cohort of 239 patients infected with HIV were followed‐up between January 2007 and July 2010 in Cameroon. Two hundred and sixteen plasma samples were sequenced for phylogenetic analysis and identification of drug resistance mutations in the HIV‐1 pol region. A significant genetic diversity was found: Seven pure subtypes (A1, A3, D, F1, F2, G, H), nine circulating recombinant forms (CRFs: 01_AE, 02_AG, 06cpx, 09cpx, 11cpx, 13cpx, 16cpx, 18cpx, 37cpx) and one new unique recombinant form (URF) (G/F2). The rate of transmitted drug resistance (TDR) in naïve patients was 8.2% (4/49). Around 80% of patients failing a first‐line ART harbored a virus with at least one resistance mutation to two antiretroviral (ARV) classes, and 36% of those failing a second‐line regimen carried a virus with at least one resistant mutation to three ARV classes. The high level of drug resistance observed in the cohort is alarming because this occurred as a result of only few years of treatment. Adherence to therapy, adequate education of physicians, and the appropriate use of genotypic resistance assay are critical points of intervention for the improvement of patient care. J. Med. Virol. 84:721–727, 2012. © 2012 Wiley Periodicals, Inc.
Conformational heterogeneity of the Pfr chromophore in plant and cyanobacterial phytochromes

Phytochromes are biological photoreceptors that can be reversibly photoconverted between a dark and photoactivated state. The underlying reaction sequences are initiated by the photoisomerization of the tetrapyrrole cofactor, which in plant and cyanobacterial phytochromes are a phytochromobilin (PΦB) and a phycocyanobilin (PCB), respectively. The transition between the two states represents an on/off-switch of the output module activating or deactivating downstream physiological processes. In addition, the photoactivated state, i.e., Pfr in canonical phytochromes, can be thermally reverted to the dark state (Pr). The present study aimed to improve our understanding of the specific reactivity of various PΦB- and PCB-binding phytochromes in the Pfr state by analysing the cofactor structure by vibrational spectroscopic techniques. Resonance Raman (RR) spectroscopy revealed two Pfr conformers (Pfr-I and Pfr-II) forming a temperature-dependent conformational equilibrium. The two sub-states—found in all phytochromes studied, albeit with different relative contributions—differ in structural details of the C-D and A-B methine bridges. In the Pfr-I sub-state the torsion between the rings C and D is larger by ca. 10° compared to Pfr-II. This structural difference is presumably related to different hydrogen bonding interactions of ring D as revealed by time-resolved IR spectroscopic studies of the cyanobacterial phytochrome Cph1. The transitions between the two sub-states are evidently too fast (i.e., nanosecond time scale) to be resolved by NMR spectroscopy which could not detect a structural heterogeneity of the chromophore in Pfr. The implications of the present findings for the dark reversion of the Pfr state are discussed.
IS/IT Investment And Organisational Performance In The Financial Services Sector: A Credit Union Case Study

This article presents preliminary results of research into the relationship between IS/ITinvestment and organisational performance in the Financial Services Sector (FSS). Thisresults presented in this paper are from the first case in a series of six separate cases withinthe Australian FSS. Case study methodology was used to collect data (from interviews,documents and other sources) in a small sized Credit Union. Preliminary results obtainedthus far indicate support for components of the IS/IT investment model. In addition, resultssuggest the presence of a set of intermediary variables, namely operations, product deliveryand customer service, but more research is needed to further develop and refine the model. Itis hoped that this model will lead to a better understanding of the business value of IS/IT andthe effects of both management practice and Strategic Information Systems Planning on therelationship between IS/IT investment and organisational performance.
GRAAD: Group Anonymous and Accountable D2D Communication in Mobile Networks

Device-to-device (D2D) communication is mainly launched by the transmission requirements between devices for specific applications such as proximity services in long-term evolution advanced networks, and each application will form a group of registered devices for the network-covered and network-absent D2D communications. During the applications of D2D communication, each device needs to identify the other devices of the same group in proximity by their group identity. This leads to the exposure of group information, by which the usage of applications can be analyzed by eavesdroppers. Hence, this paper introduces network-covered and network-absent authenticated key exchange protocols for D2D communications to guarantee accountable group anonymity, end-to-end security to network operators, as well as traceability and revocability for accounting and management requirements. We formally prove the security of those protocols, and also develop an analytic model to evaluate the quality of authentication protocols by authentication success rate in D2D communications. Besides, we implement the proposed protocols on android mobile devices to evaluate the computation costs of the protocols. We also evaluate the authentication success rate by the proposed analytic model and prove the correctness of the analytic model via simulation. Those evaluations show that the proposed protocols are feasible to the performance requirements of D2D communications.
Guarded Variable Automata over Infinite Alphabets

We define guarded variable automata (GVAs), a simple extension of finite automata over infinite alphabets. In this model the transitions are labelled by letters or variables ranging over an infinite alphabet and guarded by conjunction of equalities and disequalities. GVAs are well-suited for modeling component-based applications such as web services. They are closed under intersection, union, concatenation and Kleene operator, and their nonemptiness problem is PSPACE-complete. We show that the simulation preorder of GVAs is decidable. Our proof relies on the characterization of the simulation by means of games and strategies. This result can be applied to service composition synthesis.
Asymptotic normal form theory for nonautonomous equations and its connections with a renormalization group method

For singular perturbation problems, the renormalization group (RG) method of Chen, Goldenfeld, and Oono has been shown to be an effective general approach. It has been applied to a variety of problems traditionally analyzed using disparate methods, including the method of multiple scales, boundary layer theory, the WKBJ method, the PoincareLindstedt method, the method of averaging, and others. In this work, we examine the mathematical basis of this RG method. In particular, we develop asymptotic normal form theory for a large class of nonlinear, nonautonomous ordinary differential equations, and we show that this normal form theory is equivalent to the the RG method. Both approaches are carried out explicitly up to and including second order, and it is shown how the higher order theory may be carried out. A number of perturbation problems with secularities and with slowly-varying terms are used as illustrative examples of both methods.
Factored Latent Analysis for far-field Tracking Data

This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent class analysis in which the observation space is subdivided and each aspect of the original space is represented by a separate latent class model. One could simply treat these factors as completely independent and ignore their interdependencies or one could concatenate them together and attempt to learn latent class structure for the complete observation space. Alternatively, FLA allows the interdependencies to be exploited in estimating an effective model, which is also capable of representing a factored latent state. In this paper, FLA is used to learn a set of factored latent classes to represent different modalities of observations of tracked objects. Different characteristics of the state of tracked objects are each represented by separate latent class models, including normalized size, normalized speed, normalized direction, and position. This model also enables effective temporal segmentation of these sequences. This method is data-driven, unsupervised using only pairwise observation statistics. This data-driven and unsupervised activity classification technique exhibits good performance in multiple challenging environments.
Efficient Coordinated Recovery of Sparse Channels in Massive MIMO

This paper addresses the problem of estimating sparse channels in massive MIMO-OFDM systems. Most wireless channels are sparse in nature with large delay spread. In addition, these channels as observed by multiple antennas in a neighborhood have approximately common support. The sparsity and common support properties are attractive when it comes to the efficient estimation of large number of channels in massive MIMO systems. Moreover, to avoid pilot contamination and to achieve better spectral efficiency, it is important to use a small number of pilots. We present a novel channel estimation approach which utilizes the sparsity and common support properties to estimate sparse channels and requires a small number of pilots. Two algorithms based on this approach have been developed that perform Bayesian estimates of sparse channels even when the prior is non-Gaussian or unknown. Neighboring antennas share among each other their beliefs about the locations of active channel taps to perform estimation. The coordinated approach improves channel estimates and also reduces the required number of pilots. Further improvement is achieved by the data-aided version of the algorithm. Extensive simulation results are provided to demonstrate the performance of the proposed algorithms.
Comparison of microarray designs for class comparison and class discovery

MOTIVATION Two-color microarray experiments in which an aliquot derived from a common RNA sample is placed on each array are called reference designs. Traditionally, microarray experiments have used reference designs, but designs without a reference have recently been proposed as alternatives. RESULTS We develop a statistical model that distinguishes the different levels of variation typically present in cancer data, including biological variation among RNA samples, experimental error and variation attributable to phenotype. Within the context of this model, we examine the reference design and two designs which do not use a reference, the balanced block design and the loop design, focusing particularly on efficiency of estimates and the performance of cluster analysis. We calculate the relative efficiency of designs when there are a fixed number of arrays available, and when there are a fixed number of samples available. Monte Carlo simulation is used to compare the designs when the objective is class discovery based on cluster analysis of the samples. The number of discrepancies between the estimated clusters and the true clusters were significantly smaller for the reference design than for the loop design. The efficiency of the reference design relative to the loop and block designs depends on the relation between inter- and intra-sample variance. These results suggest that if cluster analysis is a major goal of the experiment, then a reference design is preferable. If identification of differentially expressed genes is the main concern, then design selection may involve a consideration of several factors.
Mitochondrial genomes of domestic animals need scrutiny

More than 1000 complete or near‐complete mitochondrial DNA (mtDNA) sequences have been deposited in GenBank for eight common domestic animals (cattle, dog, goat, horse, pig, sheep, yak and chicken) and their close wild ancestors or relatives, as well. Nevertheless, few efforts have been performed to evaluate the sequence data quality. Herein, we conducted a phylogenetic survey of these complete or near‐complete mtDNA sequences based on mtDNA haplogroup trees for the eight animals. We show that errors due to artificial recombination, surplus of mutations and phantom mutations do exist in 14.5% (194/1342) of mtDNA sequences and all of them should be treated with wide caution. We propose some caveats for future mtDNA studies of domestic animals.
Cooperative localization using efficient Kalman filtering for mobile wireless sensor networks

We consider the problem of cooperative localization in mobile wireless sensor networks (WSNs). To be able to continuously localize the mobile network, we propose to exploit the knowledge of the location of the anchor nodes to linearize the nonlinear distance measurements with respect to the location of the unknown nodes. Based on this linearized measurement model, we estimate the location of the unknown nodes using a Kalman filter (KF) instead of a suboptimal extended KF (EKF) and try to estimate the corresponding unknown measurement noise covariance matrix using an iterative process. The simulation results illustrate that the proposed algorithm (only with a few iterations) attains the posterior Cramer-Rao bound (PCRB) of mobile location estimation and clearly outperforms related anchorless and anchored mobile localization algorithms.