Miracle-dz/UniFAR-FTUs huggingface dataset:
What have we learned about primary liver transplantation under tacrolimus immunosuppression? Long-term follow-up of the first 1000 patients.

OBJECTIVE To summarize the long-term efficacy and safety of tacrolimus in orthotopic liver transplant (OLT) recipients, as well as to examine the factors that influence long-term morbidity and mortality rates. BACKGROUND Tacrolimus (FK506, Prograf) was introduced as primary immunosuppression for primary liver transplantation in 1989; many subsequent trials have verified the association of tacrolimus with decreased rates of acute rejection and steroid-resistant rejection after OLT. Cumulative experience with tacrolimus has also defined its short- and intermediate-term toxicity. METHODS One thousand consecutive patients undergoing primary OLT at a single center from August 1989 to December 1992, under tacrolimus immunosuppression, were followed until January 1999. Patients were categorized by age. Mean follow-up was 93.4+/-11 months after OLT. Patient survival, graft survival (with corresponding causes of death and retransplantation), and rejection rates (and corresponding doses of immunosuppression) were examined as efficacy parameters. Hypertension, renal function, incidence of malignancies, incidence of diabetes, and other toxicities were examined as safety parameters. RESULTS Actual 6-year overall patient survival rate was 68.1% and graft survival rate was 62.5%, with significant differences in the patterns of survival among the different age groups. After the first post-OLT year, infection, recurrence of disease, de novo malignancies, and cardiovascular events were the main causes of graft loss and death during the long-term follow-up. Graft loss related to either acute or chronic rejection was rare. The rate of acute rejection beyond 2 years was approximately 3% per year, and most were steroid-responsive. Approximately 70% of the patients were receiving tacrolimus monotherapy beyond year 1; at the latest follow-up, 74.2% were maintained on tacrolimus alone. In 6.1% of the survivors, end-stage renal disease developed during the follow-up period, requiring either dialysis or kidney transplantation. Hyperkalemia and hypertension was observed in approximately one third of the patients. Insulin-dependent diabetes mellitus (including patients who had diabetes before the transplant) was observed in 14% in year 1, dropping to 11% in year 7. In 82 patients, de novo malignancies developed; in 41 patients, lymphoproliferative disorders developed during the entire follow-up period. CONCLUSIONS Long-term patient and graft survival rates are excellent under tacrolimus immunosuppression. Pediatric patients have a better long-term outcome than adults, in part because of the limited recurrence of the original disease, which was the most common cause of late graft loss (other than patient death, most commonly the result of late de novo malignancies and cardiovascular events). Graft loss from late rejection was rare.
Semi-supervised Laplacianfaces from Pairwise Constraints for Face Recognition

Subspace methods have been successfully applied to face recognition tasks. It is well-studied in both unsupervised learning and supervised learning, such as Eigenface and Fisherface. In practice, besides abundant unlabeled examples, domain knowledge in the form of pairwise constraints is commonly available, which specifies whether a pair of instances belong to the same class or different classes. In this study, we propose a face recognition method based on semi-supervised locality preserving learning together with pairwise constraints and unlabeled data, called Semi-supervised Laplacianface (S-Laplacianface). It tries to preserve the local geometric structure of the face manifold as Laplacianface, also requires the subspace to satisfy the pairwise constraints defined by the user. Experimental results on two face databases demonstrate the effectiveness of proposed algorithm.
Cosmological Constant Seesaw in Quantum Cosmology

Recently a phenomenological relationship for the observed cosmological constant has been discussed by Motl and Carroll in the context of treating the cosmological constant as a $2\times 2$ matrix but no specific realization of the idea was provided. We realize a cosmological constant seesaw mechanism in the context of quantum cosmology. The main observation used is that a positive cosmological constant plays the role of a $Mass^2$ term in the Wheeler DeWitt (WDW) equation. Modifying the WDW equation to include a coupling between two universes, one of which has planck scale vacuum energy and another which has vacuum energy at the supersymmetry breaking scale before mixing, we obtain the relation $λ= (10TeV)^8/M_{Pl}^4$ in a similar manner to the usual seesaw mechanism. We discuss how the picture fits in with our current understanding of string/M-theory cosmologies. In particular we discuss how these results might be extended in the context of exact wave functions of the universe derived from certain string models.
Extraction of Attribute Dependency Graph from Database Applications

Database applications constitute a large portion of the software systems. This paper proposes a novel graph called attribute dependency graph to show the dependencies between attributes in a database application and also the programs involved. We propose an approach to automatically extract the attribute dependency graph through analyzing the source code of database applications. The extracted information can be used in the maintenance process particularly in the impact analysis upon modification of a database application. A tool has been developed to implement the proposed approach for PHP-based database applications. Case studies have also been conducted to demonstrate the use of our proposed approach.
Rendering Wave Effects with Augmented Light Field

Ray–based representations can model complex light transport but are limited in modeling diffraction effects that require the simulation of wavefront propagation. This paper provides a new paradigm that has the simplicity of light path tracing and yet provides an accurate characterization of both Fresnel and Fraunhofer diffraction. We introduce the concept of a light field transformer at the interface of transmissive occluders. This generates mathematically sound, virtual, and possibly negative‐valued light sources after the occluder. From a rendering perspective the only simple change is that radiance can be temporarily negative. We demonstrate the correctness of our approach both analytically, as well by comparing values with standard experiments in physics such as the Young's double slit. Our implementation is a shader program in OpenGL that can generate wave effects on arbitrary surfaces.
Video-to-Video Dynamic Super-Resolution for Grayscale and Color Sequences

We address the dynamic super-resolution (SR) problem of reconstructing a high-quality set of monochromatic or color super-resolved images from low-quality monochromatic, color, or mosaiced frames. Our approach includes a joint method for simultaneous SR, deblurring, and demosaicing, this way taking into account practical color measurements encountered in video sequences. For the case of translational motion and common space-invariant blur, the proposed method is based on a very fast and memory efficient approximation of the Kalman filter (KF). Experimental results on both simulated and real data are supplied, demonstrating the presented algorithms, and their strength.
The Functional Properties of Barrel Cortex Neurons Projecting to the Primary Motor Cortex

Nearby neurons, sharing the same locations within the mouse whisker map, can have dramatically distinct response properties. To understand the significance of this diversity, we studied the relationship between the responses of individual neurons and their projection targets in the mouse barrel cortex. Neurons projecting to primary motor cortex (MI) or secondary somatosensory area (SII) were labeled with red fluorescent protein (RFP) using retrograde viral infection. We used in vivo two-photon Ca2+ imaging to map the responses of RFP-positive and neighboring L2/3 neurons to whisker deflections. Neurons projecting to MI displayed larger receptive fields compared with other neurons, including those projecting to SII. Our findings support the view that intermingled neurons in primary sensory areas send specific stimulus features to different parts of the brain.
A Reading Oriented Overlapping Text based CAPTCHA

CAPTCHA is a security technique used widely over the Internet to verify whether the end user is a human. Text-based CAPTCHAs are the most commonly used. The security of text-based CAPTCHA depends on the ability to resist the segmentation and recognition attacks. The Reading Oriented Overlapping Text (ROOT) based CAPTCHA, introduced in this article, consists of overlapping alphanumeric letters both hand written and computer generated along with a reading pattern scheme that helps to use the same CAPTCHA multiple number of times. The proposed ROOT based CAPTCHA generation algorithm is discussed along with its resistivity to known attacks.
SURVEY ON SURVIVAL APPROACHES IN WIRELESS NETWORK AGAINST JAMMING ATTACK

Wireless networks are more depicted to intentional or unintentional threats than their wired based equ ivalent networks. Major reason being the wireless medium which can be listened and interfered by non-participa nts, in an on-going valid communication. In the absence of a c ollision detection mechanism and relying mainly on cooperation of each other for packet routing, the standard defi ned for wireless network is unable to identify any malicious activity, by default [1]. Among attacks the ones wh ich create isolation of the nodes on the network ar e considered more severe. If they last long enough, can result i n denial-of-service and hence network collapses completely. The simplest form of such attacks is jamming attack whi ch can block any current legitimate communication. It is easy to launch as no especial hardware is required and the area in range can be jammed for any legal communication. Jamming is a specialized Denial of Service attack i n which purpose is not to overflow buffers, instead to choke the physical communication channel, hence handling jammer is much harder than other attacks. Unlike other attacks, especially routing attacks, no network parameter an d topology etc need to be known in advance before l aunching jamming attack. However, if the network parameters are known and the attack is intelligently placed, a jammer can last longer on the network resulting in more surviv al time and thus increased damage. This paper surve ys on different types of jamming attack and the mitigatio n techniques generally used. Besides this, we inves tigate about the approaches proposed that are considered efficie nt to survive in a jammed region, actively. Finally , we conclude by highlighting the potential areas which can be ta rgeted to optimize in minimizing the effects of a j amming attack, as future directions.
Schedulability Analysis of Hierarchical Real-Time Systems under Shared Resources

Sharing resources in hierarchical real-time systems implemented with reservation servers requires the adoption of special budget management protocols that preserve the bandwidth allocated to a specific component. In addition, blocking times must be accurately estimated to guarantee both the global feasibility of all the servers and the local schedulability of applications running on each component. This paper presents two new local schedulability tests to verify the schedulability of real-time applications running on reservation servers under fixed priority and EDF local schedulers. Reservation servers are implemented with the BROE algorithm. A simple extension to the SRP protocol is also proposed to reduce the blocking time of the server when accessing global resources shared among components. The performance of the new schedulability tests are compared with other solutions proposed in the literature, showing the effectiveness of the proposed improvements. Finally, an implementation of the main protocols on a lightweight RTOS is described, highlighting the main practical issues that have been encountered.
Co-design of nonlinear control systems with bounded control inputs

This paper considers co-design of nonlinear constrained control systems: simultaneous design of the nonlinear plant and control policy where the control is bounded. Similar to prior art, the co-design is attacked as a non-convex optimization problem, which is solved by using an improved policy iteration scheme. We have proved rigorously that the system performance can be improved after each step of the proposed policy iteration scheme until convergence to a sub-optimal solution is attained. Effectiveness of the proposed methodology is illustrated through the co-design of a load-positioning system.
J. Evaluation on an assessment system based on Bayesian student modeling

Schools need assessments of students in order to make informed decisions. The most common assessments are tests consisting of questions or problems that can be answered in under a minute each. When schools change their instruction to maximize performance on short-item tests, the students' learning can suffer. To prevent this, assessments are being developed such that "teaching to the test" will actually improve instruction. Such performance assessments, as they are called, have students work on complex, intrinsically valuable, authentic tasks. Olae is a performance assessment for Newtonian physics. It is based on student modeling, a technology developed for intelligent tutoring systems. Students solve traditional problems as well as tasks developed by cognitive psychologists for measuring expertise. Students work on a computer, which records all their work as well as their answers. This record is analyzed to form a model of the student's physics knowledge that accounts for the students' actions. The model is fine-grained, in that it can report the probability of mastery of each of 290 pieces of physics knowledge. These features make Olae a rather unusual assessment instrument, so it is not immediately obvious how to evaluate it, because standard evaluations methods assume the assessment is a short-item test. This paper describes Olae (focusing on parts of it that have not been described previously), several methods for evaluating complex assessments based on student modeling such as Olae, and some preliminary results of applying these methods to Olae with a small sample of physics students. In many cases, more data would be required in order to adequately access Olae, so this
Using Proximity Operators for Document Representation in Web Search

Abstract It is presented a different way for representing documents in information retrieval systems. The relation degree between the index term pairs which describe the document is proposed as the main factor to represent a document. This document representation approach is based on two kinds of different relations between index terms: the physical relation and the semantic relation. Keywords: proximity operators, search engine, semantic relations, document representation. 1. Introduction Classic models (Boolean, probabilistic and vector space) in information retrieval are based on the document representation by means of a set of index terms. Usually, to calculate the similarity degree between a document and a query, the main factor to keep in mind is the frequency of the index terms of the document. This fact causes the lack of conceptual relevance of the query results. The user query is also limited because the user can only use terms to express it, the query is a “lexical focused” query and not a “conceptually focused” query . The classic systems only use the terms appeared on the documents as index terms, but there are some different works that use ontologies in the indexing process. For example, the semantic indexing technique [6] proposed by Mihalcea uses WordNet [9] to disambiguate the polisemic words. This method improves the results introducing new related terms in the document representation and in the query expansion stage. Other strategy is to use electronic dictionaries to index the documents [3].
Versatile refresh: low complexity refresh scheduling for high-throughput multi-banked eDRAM

Multi-banked embedded DRAM (eDRAM) has become increasingly popular in high-performance systems. However, the data retention problem of eDRAM is exacerbated by the larger number of banks and the high-performance environment in which it is deployed: The data retention time of each memory cell decreases while the number of cells to be refreshed increases. For this, multi-bank designs offer a concurrent refresh mode, where idle banks can be refreshed concurrently during read and write operations. However, conventional techniques such as periodically scheduling refreshes---with priority given to refreshes in case of conflicts with reads or writes---have variable performance, increase read latency, and can perform poorly in worst case memory access patterns. We propose a novel refresh scheduling algorithm that is low-complexity, produces near-optimal throughput with universal guarantees, and is tolerant to bursty memory access patterns. The central idea is to decouple the scheduler into two simple-to-implement modules: one determines which cell to refresh next and the other determines when to force an idle cycle in all banks. We derive necessary and sufficient conditions to guarantee data integrity for all access patterns, with any given number of banks, rows per bank, read/write ports and data retention time. Our analysis shows that there is a tradeoff between refresh overhead and burst tolerance and characterizes this tradeoff precisely. The algorithm is shown to be near-optimal and achieves, for instance, 76.6% reduction in worst-case refresh overhead from the periodic refresh algorithm for a 250MHz eDRAM with 10us retention time and 16 banks each with 128 rows. Simulations with Apex-Map synthetic benchmarks and switch lookup table traffic show that VR can almost completely hide the refresh overhead for memory accesses with moderate-to-high multiplexing across memory banks.
Nuclear trapping by GL 3 controls intercellular transport and redistribution of TTG 1 protein in Arabidopsis

INTRODUCTION The regular distribution of trichomes on the leaf surface of Arabidopsis is particularly suited to study two-dimensional de novo At the basal part of young leaves, trichome cells are singled out from apparently equivalent protodermal cells. Clonal analysis rendered it unlikely that a cell lineage mechanism is responsible for trichome spacing but rather relies on cellular interactions of initially equivalent cells (Larkin et al., 1996; Schnittger et al., 1999). The genetic and molecular analysis of trichome patterning has suggested two distinct patterning processes that are likely to operate in parallel as the key regulators are involved in both of them (Pesch and Hulskamp, 2009). The first mechanism is similar to an activator-inhibitor-based model (for a general introduction, see Meinhardt and Gierer, 2000). According to this model, trichome-promoting factors turn on their own inhibitors that can move into neighbouring cells to mediate lateral inhibition. act together by forming a trimeric transcriptional activator complex (Payne et al., 2000). They trigger the expression of the R3 single-repeat MYB inhibitor TRIPTYCHON (TRY) and probably also five redundantly acting homologs (Wada et al.
Fault-tolerant quantum computation with constant error

In the past year many developments have taken place in the area of quantum error corrections. Recently Shor showed how to perform fault tolerant quantum computation when, ~, the probability for a fault in one time step per qubit or per gate, is polylogarithmically small. This paper closes the gap and shows how to perform fault tolerant quantum computation when the error probability, q, is smaller than some constant threshold, q. The cost is polylogarithmic in time and space, and no measurements are used during the quantum computation. The same result is shown also for quantum circuits which operate on nearest neighbors only. To achieve this noise resistance, we use concatenated quantum error correcting codes. The scheme presented is general, and works with any quantum code, that satisfies certain restm”ctions, namely that it is a “proper quantum code”. The constant threshold r10 is a function of the parameters of the specifc proper code used. We present two explicit classes of proper quantum codes. The first class generalizes classical secret sharing with polynomials. The codes are defined over a field with p elements, which means that the elementary quantum particle is not a qubit but a “qupit”. The second class uses a known class of quantum codes and converts it to a proper code. We estimate the threshold qO to be = 10-6. Hopefully, this paper motivates a search for proper quantum codes with higher thresholds, at which point quantum computation becomes practical.
Evolution under fertility and viability selection.

Evolution at a single multiallelic locus under arbitrary weak selection on both fertility and viability is investigated. Discrete, nonoverlapping generations are posited for autosomal and X-linked loci in dioecious populations, but monoecious populations are studied in both discrete and continuous time. Mating is random. The results hold after several generations have elapsed. With an error of order s [i.e., O(s)], where s represents the selection intensity, the population evolves in Hardy-Weinberg proportions. Provided the change per generation of the fertilities and viabilities due to their explicit time dependence (if any) is O(s2), the rate of change of the deviation from Hardy-Weinberg proportions is O(s2). If the change per generation of the viabilities and genotypic fertilities is smaller than second order [i.e., o(s2)], then to O(s2) the rate of change of the mean fitness is equal to the genic variance. The mean fitness is the product of the mean fertility and the mean viability; in dioecious populations, the latter is the unweighted geometric mean of the mean viabilities of the two sexes. Hence, as long as there is significant gene frequency change, the mean fitness increases. If it is the fertilities of matings that change slowly [at rate o(s2)], the above conclusions apply to a modified mean fitness, defined as the product of the mean viability and the square root of the mean fertility.
What Is Half a Neutrino? Reviewing Cosmological Constraints on Neutrinos and Dark Radiation

Abstract Neutrinos are one of the major puzzles in modern physics. Despite measurements of mass differences, the Standard Model of particle physics describes them as exactly massless. Additionally, recent measurements from both particle physics experiments and cosmology indicate the existence of more than the three Standard Model species. Here, we review the cosmological evidence and its possible interpretations.
PlaylistPlayer: An Interface Using Multiple Criteria to Change the Playback Order of a Music Playlist

We propose a novel interface that allows the user to interactively change the playback order of multiple songs by choosing one or more criteria. The criteria include not only the song's title and artist name but also its content automatically estimated by music/singing signal processing and artist-level social analysis. The artist-level social information is discovered from Wikipedia and DBpedia. With regard to manipulating playback order, existing interfaces typically allow the user to change it manually or automatically by choosing one of a few types of criteria. The proposed interface, on the other hand, deals with nine properties and multiple integrations of them (e.g., vocal gender and beats per minute). To realize the ordering by multiple criteria, a distance matrix is computed from the criteria vectors and is then used to estimate paths for ascending, descending, and random orders by applying principle component analysis or to estimate a path for a smooth order by solving the travelling salesman problem.