Miracle-dz/UniFAR-FTUs huggingface dataset:
Early child bilingualism: cross-linguistic influence in the simultaneous acquisition of German and English

VI STATEMENT OF CANDIDATE . VIII ACKNOWLEDGEMENTS . IX LIST OF TABLES . X LIST OF FIGURES . XI CHAPTER 1: INTRODUCTION AND EXPOSITION . 1 1.1 FROM LANGUAGE FUSION AND SEPARATION TO CROSS-­‐LINGUISTIC INFLUENCE . 1 1.2 PROBLEMS OF CURRENT MODELS FOR CROSS-­‐LINGUISTIC INFLUENCE . 2 1.3 THESIS AIMS AND FRAMEWORK . 6 1.4 OVERVIEW . 7 CHAPTER 2: BILINGUAL FIRST LANGUAGE ACQUISITION . 9 2.1 EXTERNAL FACTORS . 10 2.1.1 Approaches to bilingualism . 10 2.1.2 Family language policy . 11 2.1.3 Input quality or contact-­‐variety input . 15 2.1.4 Dominance, frequency and fluency . 17 2.2 INTERNAL FACTORS . 20 2.2.1 Age of onset . 20 2.2.2 Cognitive development, brain structure and function in (early) bilingualism . 22 2.2.3 Typological similarity and differences of the language combination . 25 2.3 GRAMMATICAL FACTORS . 26 2.3.1 Overlap and the Cross-­‐linguistic Influence Hypothesis . 27 2.3.2 Underspecification, the notion of economy and markedness . 30 2.3. 3 The Derivational Complexity Hypothesis . 33 CHAPTER 3: A LONGITUDINAL CASE STUDY . 36 3.1 REFLECTION ON METHODOLOGICAL ASPECTS . 36 3.1.1 ‘Scarcity of data’ and the need for a new corpus . 36 3.1.2 Method of choice: Elicited Production . 37 3.1.3 Eliciting sentential negation . 38 3.1.4 Eliciting negative interrogatives: The snail game . 39 3.2 EQUIPMENT, TRANSCRIPTION AND CODING DETAILS . 42
Inference Controls for Statistical Databases

The goal of statistical databases is to provide frequencies, averages, and other statistics about groups of persons (or organizations), while protecting the privacy of the individuals represented in the database. This objective is difficult to achieve, since seemingly innocuous statistics contain small vestiges of the data used to compute them. By correlating enough statistics, sensitive data about an individual can be inferred. As a simple example, suppose there is only one female professor in an electrical engineering department. If statistics are released for the total salary of all professors in the department and the total salary of all male professors, the female professor's salary is easily obtained by subtraction. The problem of protecting against such indirect disclosures of sensitive data is called the inference problem. Over the last several decades, census agencies have developed many techniques for controlling inferences in population surveys. These techniques are applied before data are released so that the distributed data are free from disclosure problems. The data are typically released either in the form of microstatistics, which are files of "sanitized" records, or in the form of macrostatistics, which are tables of counts, sums, and higher order statistics. Starting with a study by Hoffman and Miller,' computer scientists began to look at the inference problem in on-line, general-purpose database systems allowing both statistical and nonstatistical access. A hospital database, for example, can give doctors direct access to a patient's medical records, while hospital administrators are permitted access only to statistical summaries of the records. Up until the late 1970's, most studies of the inference problem in these systems led to negative results; every conceivable control seemed to be easy to circumvent, to severely restrict the free flow of information, or to be intractable to implement. Recently, the results have become more positive, since we are now discovering controls that can potentially keep security and information loss at acceptable levels for a reasonable cost. This article surveys some of the controls that have been studied, comparing them with respect to their security, information loss, and cost. The controls are divided into two categories: those that place restrictions on the set of allowable queries and those that add "noise" to the data or to the released statistics. The controls are described and further classified within the context of a lattice model.
Succinct Adaptive Garbled RAM

We show how to garble a large persistent database and then garble, one by one, a sequence of adaptively and adversarially chosen RAM programs that query and modify the database in arbitrary ways. Still, it is guaranteed that the garbled database and programs reveal only the outputs of the programs when run in sequence on the database. The runtime, space requirements and description size of the garbled programs are proportional only to those of the plaintext programs and the security parameter. We assume indistinguishability obfuscation for circuits and poly-to-one collision-resistant hash functions. The latter can be constructed based on standard algebraic assumptions such as the hardness of discrete log or factoring. In contrast, all previous garbling schemes with persistent data were shown secure only in the static setting where all the programs are known in advance. As an immediate application, our scheme is the first to provide a way to outsource large databases to untrusted servers, and later query and update the database over time in a private and verifiable way, with complexity and description size proportional to those of the unprotected queries. Our scheme extends the non-adaptive RAM garbling scheme of Canetti and Holmgren [ITCS 2016]. We also define and use a new primitive, called adaptive accumulators, which is an adaptive alternative to the positional accumulators of Koppula et al [STOC 2015] and somewhere statistical binding hashing of Hubacek and Wichs [ITCS 2015]. This primitive might well be useful elsewhere. ∗Tel-Aviv University and Boston University, canetti@bu.edu. Supported by the Check Point Institute for Information Security, ISF grant 1523/14, and NSF Frontier CNS1413920 and 1218461 grants. †Boston University, chenyl@bu.edu. Supported by NSF grants CNS-1012798, CNS-1012910, CNS1413920 and AF-1218461. Research conducted while at SRI International funded by NSF grant CNS-1421102. ‡MIT, holmgren@mit.edu. Supported by NSF Frontier CNS1413920. §Yale University, SRI, mariana@columbia.edu. Supported by NSF grant CNS-1421102 and DARPA SafeWare.
Equity Management: Quantitative Analysis for Stock Selection

Introduction. Part One: Selecting Securities. Chapter 1. The Complexity of the Stock Market. Chapter 2. Disentagling Equity Return Regularities: New Insights and Investment Opportunities. Chapter 3. On the Value of 'Value'. Chapter 4. Calendar Anomalies: Abnormal Returns at Calendar Turning Points. Chapter 5. Forecasting the Size Effect. Chapter 6. Earnings Estimates, Predictor Specifications, and Measurement Error. Part Two: Managing Portfolios. Chapter 7. Engineering Portfolios: A Unified Approach. Chapter 8. The Law of One Alpha. Chapter 9. Residual Risk: How Much Is Too Much? Chapter 10. High-Definition Style Rotation. Part Three: Expanding Opportunities. Chapter 11. Long-Short Equity Investing. Chapter 12. Myths about Long-Short. Chapter 13. The Long and Short on Long-Short. Chapter 14. Long-Short Portfolio Management: an Integrated Approach. Chapter 15. Alpha Transport with Derivatives. Index.
On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs

Let? 1? 2>? >? dbe points on the real line. For everyk=1, 2, ? , d, thek-alternatingpolynomialPkis the polynomial of degreekand norm ? Pk? ∞=max1? l? d{|Pk(? l)|}? 1 that attains maximum absolute value at any point? d, ? 1]. Because of this optimality property, these polynomials may be thought of as the discrete version of the Chebychev polynomialsTkand, for particular values of the given points,Pkcoincides in fact with the “shifted”Tk. In general, however, those polynomials seem to bear a much more involved structure than Chebychev ones. Some basic properties of thePkare studied, and it is shown how to compute them in general. The results are then applied to the study of the relationship between the (standard or Laplacian) spectrum of a (not necessarily regular) graph or bipartite graph and its diameter, improving previous results.
Demand Versus Supply of Foodgrains in India: Implications to Food Security

The present paper addresses the issues namely (i) the present food supply and the trend for future, (ii) shift in food consumption pattern over years and (iii) food demand projection for the next three decades in the context of food security. The analysis reveals that increase in cereal production (mainly rice and wheat) but decline in the percentage share of coarse grains and pulses in total foodgrains production is witnessed since 1960s. India’s total foodgrain production has increased at an annual growth rate of 2.68 per cent since 1960-61. The increase in foodgrain production is mainly due to increase in yield (growth rate being 2.44 per cent as against growth rate of area being 0.17 per cent per annum during 1960-61 to 1998-99). To project the future foodgrains supply, past growth trend has been extrapolated. Based on this assumption, the foodgrain supply is expected to be about 245, 291 and 342 million tonnes by 2010, 2020 and 2030 AD, respectively. Shift in consumption pattern and future demand for food is analyzed for both rural and urban India. Per capita cereal consumption exhibited a declining trend over years in both rural and urban India. This decline is larger in rural India (12.19 %) than in urban India (5.43%) during the period under study. Increase in per capita income and urbanization has led to changes in the composition of the food basket, with consumers moving from coarse cereals to superior cereals (rice and wheat). The allocation of monthly per capita expenditure on food items showed structural shift in dietary pattern in favour of non-cereal food items such as fruits, vegetables, milk, meat, eggs and fish in both the areas. Future food demand is also projected which is based on factors such as growth in population, growth in per capita income, urbanization and consumption behaviour. For projecting population, it is assumed that the growth in population will decline by 0.05 per cent per year in future and urbanization will increase by 0.3 per cent per annum. However, production at the assumed growth rate may not increase in future because the past production growth factors in future may not work well in future also. Hence, in the absence of favorable past growth factors, the food supply to match the demand in future may be a matter of great concern for food security. To meet the demand, the increased production will have to be brought about mainly through increases in productivity as the possibility of area expansion is very minimal.
A response to Koku’s comments on Alpert, Wilson and Elliott’s article on price signaling

In a comment in a 1995 issue of the Journal of Consumer Marketing, Paul Koku criticizes an article in a 1993 issue of the Journal of Consumer Marketing, “Price signaling: does it ever work? ”, by Alpert, Wilson and Elliott. In this response to Koku’s comment, it is argued that, although Koku views price signaling strictly as a borrowed concept, marketing is a mature discipline and is entitled to develop its own uses of such concepts. Furthermore, it is argued that the specifics of the case that was studied support the argument that price signaling (as defined in the 1993 article to mean using prices as a signal of quality when objective quality is not demonstrably superior) is only effective when combined with “premium quality positioning” throughout the marketing mix. Contrary to Koku’s argument, such premium quality positioning does succeed for the case that was studied, and prices above that which objective quality would support are sustained.
Septic arthritis or juvenile idiopathic arthritis ‐ the case of a 2 year old boy

Peanut epitopes for IgE and IgG4 in peanutsensitized children in relation to severity of peanut allergy. J Allergy Clin Immunol 2008: 121 : 737.e10–43.e10. 3. Hong X, Caruso D, Kumar R, et al. IgE, but not IgG4, antibodies to Ara h 2 distinguish peanut allergy from asymptomatic peanut sensitization. Allergy 2012: 67: 1538–46. 4. Stapel SO, Asero R, Ballmer-Weber BK, et al. Testing for IgG4 against foods is not recommended as a diagnostic tool: EAACI Task Force Report. Allergy 2008: 63: 793–6. 5. Sverremark-Ekstrom E, Hultgren EH, Borres MP, Nilsson C. Peanut sensitization during the first 5 yr of life is associated with elevated levels of peanut-specific IgG. Pediatr Allergy Immunol 2012: 23: 224–9. 6. Caubet JC, Bencharitiwong R,Moshier E, Godbold JH, Sampson HA, Nowak-Wegrzyn A. Significance of ovomucoidand ovalbuminspecific IgE/IgG(4) ratios in egg allergy. J Allergy Clin Immunol 2012: 129: 739–47. 7. Astier C, Morisset M, Roitel O, et al. Predictive value of skin prick tests using recombinant allergens for diagnosis of peanut allergy. J Allergy Clin Immunol 2006: 118: 250–6. 8. Tay SS, Clark AT, Deighton J, King Y, Ewan PW. Patterns of immunoglobulin G responses to egg and peanut allergens are distinct: ovalbumin-specific immunoglobulin responses are ubiquitous, but peanut-specific immunoglobulin responses are up-regulated in peanut allergy. Clin Exp Allergy 2007: 37: 1512–8. 9. Uermosi C, Beerli RR, Bauer M, et al. Mechanisms of allergen-specific desensitization. J Allergy Clin Immunol 2010: 126: 375–83. 10. Aalberse RC, Stapel SO, Schuurman J, Rispens T. Immunoglobulin G4: an odd antibody. Clin Exp Allergy 2009: 39: 469–77.
Two MHC Surface Amino Acid Differences Distinguish Foreign Peptide Recognition from Autoantigen Specificity1

KRN T cells can recognize two self MHC alleles with differing biological consequences. They respond to the foreign peptide RN(42–56) bound to I-Ak or alternatively initiate autoimmune arthritis by interacting with a self Ag, GPI(282–294), on I-Ag7. Five surface amino acid differences between the two MHC molecules collectively alter which peptide side chains are recognized by the KRN TCR. In this study, it is shown that mutation of only two of these residues, α65 and β78, in I-Ak to their I-Ag7 counterparts is sufficient to allow recognition of the TCR contacts from GPI(282–294). To provide a detailed mechanism for the specificity change, the distinct contributions of each of these two mutations to the global effect on peptide specificity were analyzed. The α65 mutation is shown to broaden the spectrum of amino acids permissible at P8 of the peptide. In contrast, the β78 mutation alone blocks KRN TCR interaction with I-Ak and requires the simultaneous presence of the α65 mutation to preserve recognition. In the presence of the α65 mutation, the β78 residue broadens peptide recognition at P3 and prevents recognition of the P8 L in RN(42–56), thus producing the observed specificity shift. These results localize the functionally relevant differences between the surfaces of two self-restricted MHC molecules to two residues that have counterbalanced positive and negative contributions to interaction with a single TCR. They highlight how subtle structural distinctions attributable to single amino acids can stand at the interface between foreign Ag responsiveness and pathogenic autoreactivity.
Introduction: Reshaping the World

T rounds of the International Comparison Program (ICP) are like successive Olympic Games. Similar to the Olympics, they do not happen every year, and in the fi rst modern games only a few countries sent competitors, there were only a few events, and the standards of competition were relatively low. Th e participants were amateurs with day jobs, and, although they were great natural athletes, they did not take their training very seriously. Yet the fi rst modern Olympics was a watershed, which eventually grew into the record-breaking professional event it is today in which almost all nations of the world come together in a truly global competition. Th e ICP began in the late 1960s and early 1970s, led by Irving Kravis, Alan Heston, and Robert Summers from the University of Pennsylvania and Zoltan Kennessy from the United Nations. Like the Olympics, only a few countries (six) took part in the fi rst round in 1967—four more were added in 1970—and prices were collected for only a small range of goods and services. Since then, each round has become bigger and better (and more expensive), with more countries represented, with more and more professional statisticians and economists involved, and with lots of preparatory training in the form of expert workshops, theoretical papers, and fi guring out how to deal with problems that could not be solved in the previous round. Th e 2005 round of the ICP was by far the most professional, the biggest, the most thoroughly researched, and the most international—with 146 countries. It was the fi rst round to be organized by a Global Offi ce housed in the World Bank. Its fi ndings changed the economic map of the world. Th e 2005 ICP revealed a world that was much more unequal than we economists and others had thought. It was not quite like discovering water on the moon perhaps, but it was like discovering that the craters were deeper or that the planets were farther from the sun than we had always thought. And when the World Bank reworked the global poverty counts using the new data, it also found a world that was much poorer than it had previously thought. Th e gaps between rich countries and poor countries—which we long knew were enormous— were even larger than previously measured. Th e average gap in the per capita gross domestic product ANGUS S. DEATON
The Banking Union: An Overview and Open Issues

This chapter documents cross-border banking trends in the European Union (EU). Importantly, it finds that cross-border banking is not only pervasive in the Eurozone, but also in the non-Eurozone member states of the EU. The latter may wish to join the Banking Union at a later stage. The section “The Rationale for Banking Union” is followed by “Cross-border Banking”. The next section, “An Integrated Framework”, analyses what the new governance framework of the Banking Union is about. We stress that the Banking Union should be seen as an integrated framework. The section “How Does the Banking Union Work? ” explains the completed building blocks of Banking Union, in particular single supervision and single resolution. Next, “Completing the Banking Union” discusses which building blocks are not yet completed, notably European Deposit Insurance. The final section concludes.
Iterative Forward-Backward Kalman Filtering for Data Recovery in (Multiuser) OFDM Communications 1

The current era of connectivity and information transfer demands high data rates from broadband wireless systems. The main problem faced by such high data rate systems is multipath fading as it causes inter symbol interference (ISI). Thus, there is a need for a technique that avoids ISI while still providing high speed data. Orthogonal Frequency Division Multiplexing (OFDM) emerged as a technique that combines the advantages of high achievable data rates, relatively easy implementation, high spectral efficiency and robustness to multipath fading. This is reflected by many standards that considered and adopted OFDM including digital audio and video broadcasting (DAB and DVB), WIMAX (Worldwide Inter-operability for Microwave Access), high speed modems over digital subscriber lines, and local area wireless broadband standards such as the HIPERLAN/2 and IEEE 802.11a (Stuber et al., 2004). In a wireless communication system, data is sent over a channel. This channel is time variant and undergoes fading. The exact state of the channel is unknown at the receiver. The transmitted signal is received at the receiver convolved with the channel and corrupted with noise. The main interest at the receiver is to recover the transmitted data. If we consider that the channel state information is known at the receiver, we can faithfully extract the transmitted data from the received signal with this knowledge (through equalization). In practice however, we do not have prior knowledge of the channel state information and hence we have to employ some estimation technique to obtain an estimate of the channel. Channel estimation is thus an important step in receiver design. We will start this chapter by reviewing the various approaches to channel estimation available in literature. We will then present an iterative channel estimation technique based on the Forward-Backward Kalman filter for simple OFDM systems and later extend the concept for multi-access OFDM and Multi Input Multi Output (MIMO) OFDM systems.
Line managers in industrial relations: Where are we now and where to next?

Interactions between line managers and subordinate employees are fundamental to the employment relationship and, therefore, to industrial relations as a field of both study and practice. Human resource management literature has focused on the responsibilities line managers have as implementers of employment policy and practice, for example in dealing with grievance and disciplinary matters, communication and involvement, the application of discrimination policies, and the management of pay. Thus, it is surprising that this body of managers has been neglected in recent industrial relations research. This article fits the theme of the special issue by providing an overview of ‘where we are’ and sets out a research agenda of ‘Where to next? ’, for the study of line managers in industrial relations research.
Toward A Paradigm Shift in Cancer Research & Innovation for Patients in France

Medical cancer research is at a new crossroads of science, technical progress, therapeutic advances, and new models of care, ethical issues and economic factors. In order to tackle these new approaches to cancer research and innovation, a series of discussions has led to our position paper which articulates a series of recommendations around three main The and used expression bedside to bench to bedside”, reflects an approach to this requires a revision of the point of view the among the clinicians, also of the This has up to now in a relay race mode and a linear process of team The its We that this At the risk of to a role of walk-on actor on the stage, to re itself in By down the walls”, a new model would researchers, clinicians take research project very specific actions are in order to down the walls”.
Successive Interference Cancellation via Rank-Reduced Maximum A Posteriori Detection

This paper proposes a codeword-based iterative detection and decoding (IDD) algorithm for multiple-input multiple-output (MIMO) systems. In the proposed algorithm, multiple streams in a codeword are jointly detected at the rank-reduced (RR) maximum a posteriori (MAP) receiver and inter-stream interference is mitigated with successive interference cancelation (SIC). Thus, the algorithm is abbreviated to RR-MAP-SIC. Recent wireless standards such as Long-Term Evolution require the system to encode data bits per codeword, not per stream. As a result, conventional SIC algorithms could lose joint information among streams in a codeword because different streams of the same codeword are treated as interference. Instead, the proposed RR-MAP-SIC minimizes the loss of joint information by using the rank-reduced MAP detector. In addition, this paper compares the detector complexity of RR-MAP-SIC and investigates how the probability of symbol error is changed in terms of the covariance of the residual interference. As the number of iterations increases, the covariance is reduced so that the error events also decrease. Lastly, the extrinsic information transfer (EXIT) chart is used to analyze the performance of RR-MAP-SIC. Simulation results demonstrate the superiority of RR-MAP-SIC over the conventional algorithm and numerically verify the EXIT chart analysis.