Miracle-dz/UniFAR-FTUs huggingface dataset:
Compiler-Assisted Sub-Block Reuse

The fact that instructions in programs often produce repetitive results has motivated researchers to explore various alternatives to exploit this value locality, such as value prediction and value reuse. Value prediction improves the available Instruction-Level Parallelism (ILP) by allowing dependent instructions to be executed speculatively after predicting the values of their operands. Value reuse, on the other hand, tries to remove redundant computations by buffering the previously produced results of instructions and skipping the execution of instructions with repeating inputs. Previous value reuse mechanisms use a single instruction or a naturally formed instruction group, such as a basic block, a trace, or a function, as the reuse unit. These naturally formed instruction groups are readily identifiable by the hardware at run-time without compiler assistance. However, the performance potential of a value reuse mechanism depends on its reuse detection time, the number of reuse opportunities, and the amount of work saved by skipping each reuse unit. Since larger instruction groups typically have fewer reuse opportunities than smaller groups, but also provide greater benefit for each reuse-detection process, it is very important to find the balance point that provides the largest overall performance gain. In this paper, we propose a new mechanism called sub-block reuse to intelligently group instructions into reuse units using compiler-assistance. The goal is to balance the reuse granularity and the number of reuse opportunities. The sub-blocks are produced by slicing the basic blocks at compile-time using appropriate dataflow considerations. Our simulations with the SPECint95 benchmarks show that sub-block reuse with compiler assistance has a substantial and consistent potential to improve the performance of superscalar processors with speedups ranging from 10-22%.
Adaptive resampling in particle filter based on diversity measures

It is very important to find a criterion when to perform a resampling step. Aimed at this problem, an adaptive resampling algorithm in particle filter based on diversity measures is presented. Based on the analysis and comparison of two diversity measures that are effective sample size (ESS) and population diversity factor(PDF), the resampling algorithm based on ESS is introduced. On the basis of that, PDF is used for adaptively tuning the resampling threshold. At last, with the simulation program using matlab 7.0 to track a single target motion from a fixed visual observation points, the performance of the proposed algorithm is evaluated and its validity is verified.
Escherichia coli maltose‐binding protein is uncommonly effective at promoting the solubility of polypeptides to which it is fused

Although it is usually possible to achieve a favorable yield of a recombinant protein in Escherichia coli, obtaining the protein in a soluble, biologically active form continues to be a major challenge. Sometimes this problem can be overcome by fusing an aggregation‐prone polypeptide to a highly soluble partner. To study this phenomenon in greater detail, we compared the ability of three soluble fusion partners—maltose‐binding protein (MBP), glutathione S‐transferase (GST), and thioredoxin (TRX)—to inhibit the aggregation of six diverse proteins that normally accumulate in an insoluble form. Remarkably, we found that MBP is a far more effective solubilizing agent than the other two fusion partners. Moreover, we demonstrated that in some cases fusion to MBP can promote the proper folding of the attached protein into its biologically active conformation. Thus, MBP seems to be capable of functioning as a general molecular chaperone in the context of a fusion protein. A model is proposed to explain how MBP promotes the solubility and influences the folding of its fusion partners.
Foreign exchange: macro puzzles, micro tools

This paper reviews recent progress in applying information-theoretic tools to long-standing exchange rate puzzles. I begin by distinguishing the traditional public information approach (e.g., monetary models, including new open-economy models) from the newer dispersed information approach. (The latter focuses on how information is aggregated in the trading process.) I then review empirical results from the dispersed information approach and relate them to two key puzzles, the determination puzzle and the excess volatility puzzle. The dispersed information approach has made progress on both.
Design for Estimating the Net Outcomes of the State Partnership Initiative. Princeton, NJ: Mathematica Policy Research

Describes the design of an evaluation to study key outcomes for people with disabilities who participate in innovative state projects that promote employment, particularly those who receive Supplemental Security Income or Social Security Disability Insurance. The strategies involve different approaches that 1) help people understand how the Social Security system works, 2) provide waivers that make work more attractive, 3) improve coordination within the overall service system, 4) provide job placement services, and/or 5) persuade employers to hire people with disabilities. The design will produce estimates of how the state projects change the employment, earnings, benefit receipt, and total income of participants.
A Memory-Conscious Code Parallelization Scheme

While there have been considerable work in the last couple of years for architecting embedded chip multiprocessors, programming and compiler support required for them took relatively less attention. Our goal in this paper is to show that conventional compiler-directed code parallelization used in high performance computing is not very suitable for embedded chip multiprocessors where minimizing memory space requirements is an important issue. We propose and evaluate a novel memory-conscious loop parallelization strategy with the objective of minimizing the data memory requirements of processors. The proposed approach, which is formulated as a branch-and-bound problem, accomplishes its objective by being careful in selecting the loops to parallelize in a given loop nest. Miscellaneous. Experimentation, Algorithms, Performance.
How NLP can improve Question Answering

Answering open-domain factual questions requires Natural Language processing for refining document selection and answer identification. With our system QALC (Question Answering system of the Language and Cognition Group), we have participated in the Question Answering track of the TREC8, TREC9 and TREC10 (Text REtrieval Conferences) evaluations. QALC performs an analysis of documents relying on multi-word term searches and their linguistic variation both to minimize the number of documents selected and to provide additional clues when comparing question and sentence representations. This comparison process also makes use of the results of a syntactic parsing of the questions and Named Entity recognition functionalities. Answer extraction relies on the application of syntactic patterns chosen according to the kind of information that is sought, and categorized depending on the syntactic form of the question. These patterns allow QALC to handle nicely linguistic variations at the answer level.
The Future of News

WAY TO READ THE STORY of the twentieth century is as a bloody competition between information systems to organize the power unleashed by the industrial revolution, a competition between open systems that use information to liberate public energy and imagination to shape social, economic, and political life and closed systems that control information to direct public energy and thought into predetermined systems. This reading took root in my mind toward the end of the century at a conference of journalists from the U.S. and journalists from the crumbling Soviet Empire. For three days in Prague we listened to speaker after speaker talk with deep emotion of his or her intellectual liberation as the Iron Curtain was breached by the new communications technology that allowed independent, uncensored information to pour through. Vaclav Havel drove home the point when he said this open flow of uncontrolled information "allowed us to take back our language. A language which had been stolen by propagandists to convince us that show trials were 'justice' and slavery was 'freedom. '" "Only when the language had been freed," he said, "could people begin to have honest thoughts about political affairs, about the real state of the world and about their place in that world. " It was exhilarating to survey the rubble of an old order based on thought control, and eagerly discuss the role of the press in the dawning of a new age of information. Now, not two decades later, as we drown in information many of us wonder whether information will continue to serve to inform a selfgoverning public or become the path through which the power elites restore centralized authority.
Universal code designs for widely-linear multiuser detection in downlink MC-CDMA

This paper deals with multiuser detection for multicarrier code-division multiple-access (MC-CDMA) systems, employing either zero-padded or cyclic-prefixed transmission techniques. For both systems, we consider widely-linear finite-impulse response (WL-FIR) estimators, which process both the received signal and its complex conjugate version. With regard to downlink configurations, it is shown that, if the number of users does not exceed a given threshold and their codes are appropriately designed, channel-irrespective WL-FIR zero-forcing symbol recovery is possible. In particular, some spreading code examples are provided, which satisfy our design rules.
An image based feature space and mapping for linking regions and words

We propose an image based feature space and define a mapping of both image regions and textual labels into that space. We believe the embedding of both image regions and labels into the same space in this way is novel, and makes object recognition more straightforward. Each dimension of the space corresponds to an image from the database. The coordinates of an image segment(region) are calculated based on its distance to the closest segment within each of the images, while the coordinates of a label are generated based on their association with the images. As a result, similar image segments associated with the same objects are clustered together in this feature space, and should also be close to the labels representing the object. The link between image regions and words can be discovered from their separation in the feature space. The algorithm is applied to an image collection and preliminary results are encouraging.
Robust and Efficient Response to TCG TOCTOU Attacks in TPVM

This paper aims to defeat TCG TOCTOU attacks occurring in trusted para-virtualized machines (TPVM). We propose a robust and efficient response mechanism (RERM). Compared to the existing response mechanisms, RERM is more effective in defeating the TPVM TCG TOCTOU attacks without incurring CPU overhead during the normal system execution. We verify the security ability of RERM via both model checking based formal verification techniques and experiments.
Investment Policy for Time-Inconsistent Discounters

This paper explores how a principal with time-inconsistent preferences invests optimally in technology or capital. If the current principal prefers her future self to save more, she can increase current investments complementary to future savings and decrease investments in the strategic substitutes, for example. To characterize the principal’s choices they are compared to a market equilibrium where the investors are private agents. Each investing agent applies the same discount factors as do the principal and he obtains full property rights to the future returns. With geometric discounting, there would be no need to regulate (subsidize/tax) these agents. With time-inconsistent preferences, however, the current principal benefits from subsidizing investments in “green” capital (complementary to future savings) and tax investments in substitute capital such as “brown” technology and even adaptation technology. The paper can thus compare policies for different types of investments at the same level in the production hierarchy, but investments at different levels are also compared. With quasi-hyperbolic discounting, the optimal subsidy is unrelated to this level. With discount rates that are strictly decreasing in relative time, however, upstream investments (needed for downstream investments) will optimally be subsidized at a higher rate. When applied to environmental policy, the paper provides a new rationale for subsidizing green (and taxing brown) technology unrelated to the traditional motivation emphasizing public good aspects.
On Learning Causal Models from Relational Data

Many applications call for learning causal models from relational data. We investigate Relational Causal Models (RCM) under relational counterparts of adjacency-faithfulness and orientation-faithfulness, yielding a simple approach to identifying a subset of relational d-separation queries needed for determining the structure of an RCM using d-separation against an unrolled DAG representation of the RCM. We provide original theoretical analysis that offers the basis of a sound and efficient algorithm for learning the structure of an RCM from relational data. We describe RCD-Light, a sound and efficient constraint-based algorithm that is guaranteed to yield a correct partially-directed RCM structure with at least as many edges oriented as in that produced by RCD, the only other existing algorithm for learning RCM. We show that unlike RCD, which requires exponential time and space, RCD-Light requires only polynomial time and space to orient the dependencies of a sparse RCM.
Preoperative Quality of Life in Patients with Gastric Cancer

Purpose We evaluated the socio-personal and clinical factors that can affect preoperative quality of life to determine how to improve preoperative quality of life in patients with gastric cancer. Materials and Methods The preoperative quality of life data of 200 patients (68 females and 132 males; mean age 58.9±12.6 years) with gastric cancer were analyzed according to socio-personal and clinical factors. The Korean versions of the European Organization for Research and Treatment of Cancer (EORTC) Quality of Life Questionnaire Core (QLQ) 30 and the EORTC QLQ-STO22, a gastric cancer-specific module, were used to assess quality of life. Patients were asked to complete the questionnaire preoperatively by themselves. Results Patients with a higher academic background and stage I disease tended to have higher global health status scores. Highly educated younger men had better physical functioning scores. Highly educated and well-nourished patients with stage I cancer had higher role functioning scores. Married patients had better emotional scores. The symptom scales were affected by sex, age, education level, nutrition, and cancer stage. Conclusions Preoperative quality of life in patients with gastric cancer can be improved by nutritional support and treatment of symptoms caused by disease progression. Psychological support may be helpful for patients with a poor quality of life.
Connectionist language models for speech understanding: the problem of word order variation

This paper emphasizes the importance of the question of word-order variation in connectionist language modeling. More precisely, it investigates whether recurrent networks can integrate various linguistic constraints to process variable word-order languages. This paper reports three experiments on the understanding of spoken French that suggest that recurrent architectures could apply to the understanding of variable spoken languages.
Modeling and Analysis of Multichannel P2P Live Video Systems

In recent years, there have been several large-scale deployments of P2P live video systems. Existing and future P2P live video systems will offer a large number of channels, with users switching frequently among the channels. In this paper, we develop infinite-server queueing network models to analytically study the performance of multichannel P2P live video systems. Our models capture essential aspects of multichannel video systems, including peer channel switching, peer churn, peer bandwidth heterogeneity, and Zipf-like channel popularity. We apply the queueing network models to two P2P streaming designs: the isolated channel design (ISO) and the View-Upload Decoupling (VUD) design. For both of these designs, we develop efficient algorithms to calculate critical performance measures, develop an asymptotic theory to provide closed-form results when the number of peers approaches infinity, and derive near-optimal provisioning rules for assigning peers to groups in VUD. We use the analytical results to compare VUD with ISO. We show that VUD design generally performs significantly better, particularly for systems with heterogeneous channel popularities and streaming rates.
Regulated Cationic Channel Function in XenopusOocytes Expressing Drosophila Big Brain

Big brain (bib) is a neurogenic gene that when mutated causes defects in cell fate determination duringDrosophila neurogenesis through an unknown mechanism. The protein Big Brain (BIB) has sequence identity with the major intrinsic protein family that includes the water- and ion-conducting aquaporin channels. We show here that BIB expressed heterologously inXenopus oocytes provides a voltage-insensitive, nonselective cation channel function with permeability to K+ > Na+ ≫ tetraethylammonium. The conductance, activated in response to endogenous signaling pathways in BIB-expressing oocytes, is decreased after treatment with 20 μm insulin and is enhanced with 10 μm lavendustin A, a tyrosine kinase inhibitor. Western blot analysis confirms that BIB is tyrosine-phosphorylated. Both tyrosine phosphorylation and the potentiating effect of lavendustin A are removed by partial deletion of the C terminus (amino acids 317–700). Current activation is not observed in control oocytes or in oocytes expressing a nonfunctional mutant (BIB E71N) that appears to be expressed on the plasma membrane by confocal microscopy and Western blotting. These results indicate that BIB can participate in tyrosine kinase-regulated transmembrane signaling and may suggest a role for membrane depolarization in the neurogenic function of BIB in early development.
A Pseudolikelihood Method For Analysing Interval Censored Data

We introduce a method based on a pseudolikelihood ratio for estimating the distribution function of the survival time in a mixed–case interval censoring model. In a mixed case model, an individual is observed a random number of times, and at each time it is recorded whether an event has happened or not. One seeks to estimate the distribution of time to event. We use a Poisson process as the basis of a likelihood function to construct a pseudolikelihood ratio statistic for testing the value of the distribution function at a fixed point, and show that this converges under the null hypothesis to a known limit distribution, that can be expressed as a functional of different convex minorants of a two-sided Brownian motion process with parabolic drift. Construction of confidence sets then proceeds by standard inversion. The computation of the confidence sets is simple, requiring the use of the pool adjacent violators algorithm, or a standard isotonic regression algorithm. We also illustrate the superiority of the proposed method over competitors based on resampling techniques or on the limit distribution of the maximum pseudolikelihood estimator, through simulation studies, and illustrate the different methods on a dataset involving time to HIV seroconversion in a group of haemophiliacs.
Risk Preferences and the Welfare Cost of Business Cycles

This paper reexamines the "cost of business cycle" calculations made by Lucas ("Models of Business Cycles," Basil Blackwell, New York, 1987) and Imrohoroglu (J. Polit. Econ. 97 (1989), 1364-1383) under alternative specifications of individuals' risk preferences and using alternative specifications of the stochastic process for per capita consumption. I find that for a class of preferences used by Epstein and Zin (J. Monetary Econom. 26 (1990), 387-407), in an analysis of the equity premium puzzle, which display "first-order" risk aversion, the welfare cost of business cycles is potentially much larger than previous estimates. (Copyright: Elsevier)
Inorganic carbon in the Indian Ocean: Distribution and dissolution processes

This study uses nearly 25,000 carbon measurements from the WOCE/JGOFS global CO2 survey to examine the distribution of dissolved inorganic carbon (DIC) and total alkalinity (TA) in the Indian Ocean. Shallow and intermediate distributions of inorganic carbon do not strictly follow temperature and salinity because of differing surface gradients and vertical biological processes that work to modify the circulation derived features. Anthropogenic CO2 has increased the shallow DIC by as much as 3%, decreasing the vertical DIC gradient. Deep ocean DIC and TA increase toward the north because of the decomposition and dissolution of organic and inorganic particles. Calcite saturation depths range from 2900–3900 m with the deepest saturation depth in the central Indian Ocean. Variations of aragonite saturation depth (200–1400 m) are similar to calcite, but the deepest saturations are in the southwestern Indian Ocean. The shallowest aragonite saturation depths are found in the Bay of Bengal. In the northern Arabian Sea and Bay of Bengal, the current aragonite saturations are 100 and 200 m shallower, respectively, than in preindustrial times. Estimates of carbonate dissolution rates on isopycnal surfaces range from 0.017 to 0.083 μmol kg−1 yr−1 in deep waters. Upper water column dissolution rates range from 0 to 0.73 μmol kg−1 yr−1, with a local maximum occurring in intermediate waters just below the aragonite saturation horizon. Dissolution is also generally higher north of the Chemical Front at 10–20°S. There is some evidence for significant sedimentary sources in the northern Indian Ocean.
Crystallographic studies on damaged DNAs IV. N( 4)-methoxycytosine shows a second face for Watson-Crick base-pairing, leading to purine transition mutagenesis.

To investigate the mutation mechanism of purine transitions in DNA damaged with methoxyamine, a DNA dodecamer with the sequence d(CGCAAATTmo(4)CGCG), where mo(4)C is 2'-deoxy-N(4)-methoxycytidine, has been synthesized and the crystal structure determined by X-ray analysis. The duplex structure is similar to that of the original undamaged B-form dodecamer, indicating that the methoxylation does not affect the overall DNA conformation. Electron density maps clearly show that the two mo(4)C residues form Watson-Crick-type base pairs with the adenine residues of the opposite strand and that the methoxy groups of mo(4)C adopt the anti conformation to N(3) around the C(4)-N(4) bond. For the pair formation through hydrogen bonds the mo(4)C residues are in the imino tautomeric state. Together with previous work, the present work establishes that the methoxylated cytosine residue can present two alternate faces for Watson-Crick base-pairing, thanks to the amino<-->imino tautomerism allowed by methoxylation. Based on this property, two gene transition routes are proposed.
Avoiding transient loops during IGP convergence in IP networks

When the topology of an IP network changes due to a link failure or a link metric modification, the routing tables of all the routers must be updated. Each of those updates may cause transient loops. In this paper, we prove that by ordering the updates of the routing tables on the routers, it is possible to avoid all transient loops during the convergence of ISIS or OSPF after a planned link failure, an unplanned failure of a protected link and after a link metric modification. We then propose a protocol that allows the routers to order the update of their routing tables to avoid transient loops without requiring any complex computation.