Miracle-dz/UniFAR-FTUs huggingface dataset:
Temperature and Entropy Fields of Baryonic Gas in the Universe

The temperature (T) and entropy (S) fields of baryonic gas, or intergalactic medium (IGM), in the ΛCDM cosmology are analyzed using simulation samples produced by a hybrid cosmological hydrodynamic/N-body code, effective capturing shocks and complex structures with high precision. We show that in the nonlinear regime the dynamical similarity between the IGM and dark matter will be broken in the presence of strong shocks in the IGM. The heating and entropy production by the shocks breaks the IGM into multiple phases. There are no single-value relations between T or S and the mass densities of the IGM (ρigm) or dark matter (ρdm). The probability distribution functions of the temperature and entropy fields are long-tailed, with a power law decreasing on the sides of high temperature or high entropy. These fields are therefore intermittent. The mean entropy, or the cosmological entropy floor, is found to be more than 100 h-1/3 keV cm2 in all regions when z ≤ 1. At redshift z ≃ 2-3, high-entropy gas (S > 50 h-1/3 keV cm2) mostly resides in areas on scales larger than 1 h-1 Mpc and with density ρdm > 102 (in units of dm). Therefore, gravitational shocks are an effective preheating mechanism of the IGM and are probably enough to provide the entropy excess of clusters and groups if the epoch of the gas falling in cluster cores is not earlier than z ≃ 2-3. On the other hand, at redshifts z ≤ 4, there is always a more than 90% volume of the low dark matter mass density (ρdm ≤ 2) regions filled by the IGM with temperature less than 104.5 K. Therefore, the multiphased character and non-Gaussianity of the IGM field would explain the high-temperature and high-entropy gas observed in groups and clusters with low-temperature IGM observed by Lyα forest lines and the intermittency observed by the spikes of the quasi-stellar object's absorption spectrum.
Early Adolescent Social Networks and Computer Use.

A research project was conducted to examine the interactions between the social networks of young adolescents and their computer usage. Particular attention was focused upon whether computers tend to isolate youthful users. Adult anxiety regarding the damaging effects of computers on children was assessed. Parental involvement, orientation to computers, and gender were the main variables studied. A case study approach was employed to gather observational data regarding the variety of interactional networks that framed the computer experience of a convenience sample of 32 subjects. The data were analyzed in terms of the reflexive co-construction of computer-oriented behaviors and their social interactions. The findings challenged the notion that heavy youthful computer users experience social isolation. Rather it was found that the interpersonal lives and computer activities of early adolescents reflexively amplified each other. Lower involvement of parents resulted in higher rates of peer socialization. Computer gaming was found to promote sociation under certain conditions. Online communication led to interpersonal communication in the presence of preexisting peer relations. It was also found that boys were more likely to socialize in relation to computers than were girls. The data were explained as consequences of context and gender-based differentiated styles of world-creating activity. Based on the findings, recommendations were made to parents encouraging a less fearful outlook on computers, and suggestions were offered on how teachers and parents could foster the integrative and developmental use of computers. (Author/LPP) ******************************************************************************** Reproductions supplied by EDRS are the best that can be made from the original document. ******************************************************************************** U.S. DEPARTMENT OF EDUCATION Office of Educational Research and Improvement EDUCATIONAL RESOURCES INFORMATION CENTER (ERIC) )krhis document has been reproduced as received from the person or organization originating it. 0 Minor changes have been made to improve reproduction quality. Points of view or opinions stated in this document do not necessarily represent official OERI position or policy. Early Adolescent Social Networks and Computer Use Myron Orleans & Margaret C. Laney
John Benjamins Publishing Company Mimetic Verbs and Meaning

This electronic file may not be altered in any way. The author(s) of this article is/are permitted to use this PDF file to generate printed copies to be used by way of offprints, for their personal use only. Permission is granted by the publishers to post this file on a closed server which is accessible to members (students and staff) only of the author’s/s’ institute, it is not permitted to post this PDF on the open internet. For any other use of this material prior written permission should be obtained from the publishers or through the Copyright Clearance Center (for USA: www.copyright.com). Please contact rights@benjamins.nl or consult our website: www.benjamins. com
Suppressing the Oblivious RAM timing channel while making information leakage and program efficiency trade-offs

Oblivious RAM (ORAM) is an established cryptographic technique to hide a program's address pattern to an untrusted storage system. More recently, ORAM schemes have been proposed to replace conventional memory controllers in secure processor settings to protect against information leakage in external memory and the processor I/O bus. A serious problem in current secure processor ORAM proposals is that they don't obfuscate when ORAM accesses are made, or do so in a very conservative manner. Since secure processors make ORAM accesses on last-level cache misses, ORAM access timing strongly correlates to program access pattern (e.g., locality). This brings ORAM's purpose in secure processors into question. This paper makes two contributions. First, we show how a secure processor can bound ORAM timing channel leakage to a user-controllable leakage limit. The secure processor is allowed to dynamically optimize ORAM access rate for power/performance, subject to the constraint that the leakage limit is not violated. Second, we show how changing the leakage limit impacts program efficiency. We present a dynamic scheme that leaks at most 32 bits through the ORAM timing channel and introduces only 20% performance overhead and 12% power overhead relative to a baseline ORAM that has no timing channel protection. By reducing leakage to 16 bits, our scheme degrades in performance by 5% but gains in power efficiency by 3%. We show that a static (zero leakage) scheme imposes a 34% power overhead for equivalent performance (or a 30% performance overhead for equivalent power) relative to our dynamic scheme.
Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

Congestion games constitute an important class of games in which computing an exact or even approximate pure Nash equilibrium is in general {\sf PLS}-complete. We present a surprisingly simple polynomial-time algorithm that computes $O(1)$-approximate Nash equilibria in these games. In particular, for congestion games with linear latency functions, our algorithm computes $(2+\epsilon)$-approximate pure Nash equilibria in time polynomial in the number of players, the number of resources and $1/\epsilon$. It also applies to games with polynomial latency functions with constant maximum degree $d$; there, the approximation guarantee is $d^{O(d)}$. The algorithm essentially identifies a polynomially long sequence of best-response moves that lead to an approximate equilibrium, the existence of such short sequences is interesting in itself. These are the first positive algorithmic results for approximate equilibria in non-symmetric congestion games. We strengthen them further by proving that, for congestion games that deviate from our mild assumptions, computing $\rho$-approximate equilibria is {\sf PLS}-complete for any polynomial-time computable $\rho$.
On isometries for convolutional codes

In this paper we will discuss isometries and strong isometries for convolutional codes. Isometries are weight-preserving module isomorphisms whereas strong isometries are, in addition, degree-preserving. Special cases of these maps are certain types of monomial transformations. We will show a form of MacWilliams Equivalence Theorem, that is, each isometry between convolutional codes is given by a monomial transformation. Examples show that strong isometries cannot be characterized this way, but special attention paid to the weight adjacency matrices allows for further descriptions. Various distance parameters appearing in the literature on convolutional codes will be discussed as well.
Evolutionary Rate in the Protein Interaction Network

High-throughput screens have begun to reveal the protein interaction network that underpins most cellular functions in the yeastSaccharomyces cerevisiae. How the organization of this network affects the evolution of the proteins that compose it is a fundamental question in molecular evolution. We show that the connectivity of well-conserved proteins in the network is negatively correlated with their rate of evolution. Proteins with more interactors evolve more slowly not because they are more important to the organism, but because a greater proportion of the protein is directly involved in its function. At sites important for interaction between proteins, evolutionary changes may occur largely by coevolution, in which substitutions in one protein result in selection pressure for reciprocal changes in interacting partners. We confirm one predicted outcome of this process—namely, that interacting proteins evolve at similar rates.
The Nature of Radio-Intermediate Quasars: What is Radio-Loud and What is Radio-Quiet

We have performed quasi-simultaneous radio flux density measurements at 2.7 and 10 GHz for all Palomar-Green (PG) quasars with radio flux densities between 4 and 200 mJy. We find that a large fraction of these sources are variable, flat-spectrum quasars. This brings to 40% the total fraction of flat-spectrum quasars with a radio-to-optical flux ratio R > 10 in the PG quasar sample. We also find that the median R-parameter of these flat-spectrum quasars is lower than those of steep-spectrum radio-loud quasars. This contradicts the predictions of the unified scheme and the idea that all flat-spectrum, core-dominated quasars are relativistically boosted lobe-dominated quasars. We show that this discrepancy is due to a population of flat-spectrum radio-intermediate quasars with 25 < R < 250 that can be explained neither as relativistically boosted radio-loud quasars nor as normal radio-weak quasars. We point out that a natural explanation for the flat-spectrum radio-intermediate quasars is relativistic boosting in radio-weak quasars. If the flat-spectrum radio-intermediate quasars are considered the boosted counterparts to usual radio-weak quasars, their fraction among radio-weak quasars is roughly 10%, similar to the fraction of boosted radio-loud quasars. This would point toward average Lorentz factors of γjet = 2–4 for radio-loud and radio-weak quasars. The presence of the flat-spectrum radio-intermediate quasars changes the definition of “radio-loud” and can bias some conclusions drawn from optically selected quasar samples, where R ≃ 1–10 is used as the dividing line for both flat- and steep-spectrum quasars. Instead, one should use separate R-parameters for the dividing line in steep-spectrum (R ≃ 25) and flat-spectrum (R ~ 250) quasars.
Quantitative predictions of tokamak energy confinement from first‐principles simulations with kinetic effects

A first‐principles model of anomalous thermal transport based on numerical simulations is presented, with stringent comparisons to experimental data from the Tokamak Fusion Test Reactor (TFTR) [Fusion Technol. 21, 1324 (1992)]. This model is based on nonlinear gyrofluid simulations, which predict the fluctuation and thermal transport characteristics of toroidal ion‐temperature‐gradient‐driven (ITG) turbulence, and on comprehensive linear gyrokinetic ballooning calculations, which provide very accurate growth rates, critical temperature gradients, and a quasilinear estimate of χe/χi. The model is derived solely from the simulation results. More than 70 TFTR low confinement (L‐mode) discharges have been simulated with quantitative success. Typically, the ion and electron temperature profiles are predicted within the error bars, and the global energy confinement time within ±10%. The measured temperatures at r/a≂0.8 are used as a boundary condition to predict the temperature profiles in the main confinement .
Why does the world need another rotavirus vaccine?

A “Meeting on Upstream Rotavirus Vaccines and Emerging Vaccine Producers” was held at the World Health Organization in Geneva, Switzerland on March 28–30, 2006. The purpose was to discuss, evaluate, and weigh the importance of additional rotavirus vaccine candidates following the successful international licensure of rotavirus vaccines by two major pharmaceutical companies (GlaxoSmithKline and Merck) that had been in development for many years. Both licensed vaccines are composed of live rotaviruses that are delivered orally as have been all candidate rotavirus vaccines evaluated in humans. Each is built on the experience gained with previous candidates whose development had either been discontinued or, in the case of the previously licensed rhesus rotavirus reassortant vaccine (Rotashield), was withdrawn by its manufacturer after the discovery of a rare association with intussusception. Although which alternative candidate vaccines should be supported for development and where this should be done are controversial topics, there was general agreement expressed at the Geneva meeting that further development of alternative candidates is a high priority. This development will help insure that the most safe, effective and economic vaccines are available to children in Third World nations where the vast majority of the >600,000 deaths due to rotavirus occur each year. This review is intended to provide the history and present status of rotavirus vaccines as well as a perspective on the future development of candidate vaccines as a means of promulgating plans suggested at the Geneva meeting.
A Note on the Performance of Sparse Matrix-vector Multiplication with Column Reordering

We revisit ordering techniques as a preprocessing step for improving the performance of sparse matrix-vector multiplication (SpM$\times$V) on modern hierarchical memory computers. In computing SpM$\times$V the main purpose of ordering of columns (or rows) is to improve the performance by enhancing data reuse. We present a new ordering technique based on the binary reflected gray codes and experimentally evaluate and compare it with other column ordering techniques from the literature. The results from numerical experiments with very large test matrices clearly demonstrates the performance gains rendered by our proposed technique.
Calculations of the A 1 Phonon Frequency in Photoexcited Tellurium

Calculations of the ${A}_{1}$ phonon frequency in photoexcited tellurium are presented. The phonon frequency as a function of photoexcited carrier density and phonon amplitude is determined. Recent pump-probe experiments are interpreted in light of these calculations. It is proposed that, in conjunction with measurements of the phonon period in ultrafast pump-probe reflectivity experiments, the calculated frequency shifts can be used to infer the evolution of the density of photoexcited carriers on a subpicosecond time scale.
Document Relevance Evaluation via Term Distribution Analysis Using Fourier Series Expansion

In addition to the frequency of terms in a document collection, the distribution of terms plays an important role in determining the relevance of documents for a given search query. In this paper, term distribution analysis using Fourier series expansion as a novel approach for calculating an abstract representation of term positions in a document corpus is introduced. Based on this approach, two methods for improving the evaluation of document relevance are proposed: (a) a function-based ranking optimization representing a user defined document region, and (b) a query expansion technique based on overlapping the term distributions in the top-ranked documents. Experimental results demonstrate the effectiveness of the proposed approach in providing new possibilities for optimizing the retrieval process.
Susceptibility to URL-based Internet attacks: Facebook vs. email

The usage of social networking sites has been steadily increasing in the last decade. Communication via social networks has replaced email as the traditional means of electronic communication in many contexts. Accordingly, many types of Internet fraud also spread to social networks. In this work, we make the first to our knowledge direct comparison of users' susceptibility to attacks that involve clicking on dangerous links in Facebook messages versus in emails. We conducted a between-subjects quasi-experiment with 398 users where the users received links from strangers in a Facebook message or via email. We observed the respective clicking behavior and investigated users' attitudes to URL-based attacks by means of a post-experimental survey. Our results show that the communication medium (Facebook vs. email) leads to significant differences in attack susceptibility. Quite surprisingly, the success rate of email-based attacks is significantly higher.
Hypervisors for Consumer Electronics

Virtualization, well established in enterprise computing, is finding its way into embedded systems. However, the use cases differ dramatically between the domains, and this results in significant differences in the requirements on the virtual-machine technology. This paper examines a number of typical virtualization use cases from the CE domain, and the resulting requirements imposed on the hypervisor. We find that enterprise-style hypervisors are ill-matched to the requirements of the embedded domain, which are characterised by low-overhead communication, real-time capability, small memory footprint, small trusted computing base, and fine-grained control over security. We present the OKL4 hypervisor, a member of the L4 microkernel family, designed for embedded-systems use. We outline OKL4's relevant properties with an emphasis on its security mechanisms, and compare its performance to a version of Xen that has recently been promoted for CE use. We conclude that OKL4 is superior to enterprise-style hypervisors for use in CE devices.
Genome-Wide Analysis of the General Stress Response Network in Escherichia coli: σS-Dependent Genes, Promoters, and Sigma Factor Selectivity

ABSTRACT The σS (or RpoS) subunit of RNA polymerase is the master regulator of the general stress response in Escherichia coli. While nearly absent in rapidly growing cells, σS is strongly induced during entry into stationary phase and/or many other stress conditions and is essential for the expression of multiple stress resistances. Genome-wide expression profiling data presented here indicate that up to 10% of the E. coli genes are under direct or indirect control of σS and that σS should be considered a second vegetative sigma factor with a major impact not only on stress tolerance but on the entire cell physiology under nonoptimal growth conditions. This large data set allowed us to unequivocally identify a σS consensus promoter in silico. Moreover, our results suggest that σS-dependent genes represent a regulatory network with complex internal control (as exemplified by the acid resistance genes). This network also exhibits extensive regulatory overlaps with other global regulons (e.g., the cyclic AMP receptor protein regulon). In addition, the global regulatory protein Lrp was found to affect σS and/or σ70 selectivity of many promoters. These observations indicate that certain modules of the σS-dependent general stress response can be temporarily recruited by stress-specific regulons, which are controlled by other stress-responsive regulators that act together with σ70 RNA polymerase. Thus, not only the expression of genes within a regulatory network but also the architecture of the network itself can be subject to regulation.
Quantitative Association Rules Mining Algorithm Based on Matrix

How to improve the efficiency of discovering the frequent item sets is a major problem in mining association rules. This paper analysised the idea and performance of the general quantitative association rules algorithm ,and put forward a quantitative association rules mining algorithm based on matrix, the new algorithm firstly transformed quantitative database into boolean matrix ,then used boolean "and" operation to generate frequent item sets on matrix vector . It effectively solved the bottleneck of Apriori algorithm which iteratively produced frequent item sets in the general quantitative association rules algorithm . The results of experiments and analysis showed that the new algorithm effectively improved the efficiency of mining quantitative association rules Keywords-Data mining; Quantitative association rules; frequent item set; Apriori algorithm; Boolean Matrix
A high power density converter system for the Gamesa G10x 4,5 MW wind turbine

One of the main points in the design of a Multi-MW-class turbine is the size and weight of the total turbine. Gamesa has developed a converter system with a very high power density and low weight. The system is designed and tested to withstand very high short circuit currents, high vibrations and other wind turbine typical environmental aspects.
Individuals with presumably hereditary uveal melanoma do not harbour germline mutations in the coding regions of either the P16INK4A, P14ARF or cdk4 genes

In familial cutaneous malignant melanoma (CMM), disruption of the retinoblastoma (pRB) pathway frequently occurs through inactivating mutations in the p16 (p16INK4A/CDKN2A/MTS1) gene or activating mutations in the G1-specific cyclin dependent kinase 4 gene (CDK4). Uveal malignant melanoma (UMM) also occurs in a familial setting, or sometimes in association with familial or sporadic CMM. Molecular studies of sporadic UMM have revealed somatic deletions covering the INK4A-ARF locus (encoding P16INK4Aand P14ARF) in a large proportion of tumours. We hypothesized that germline mutations in the p16INK4A, p14ARFor CDK4 genes might contribute to some cases of familial UMM, or to some cases of UMM associated with another melanoma. Out of 155 patients treated at the Institut Curie for UMM between 1994 and 1997, and interviewed about their personal and familial history of melanoma, we identified seven patients with a relative affected with UMM (n = 6) or CMM (n = 1), and two patients who have had, in addition to UMM, a personal history of second melanoma, UMM (n = 1), or CMM (n = 1). We screened by polymerase chain reaction single-strand conformation polymorphism the entire coding sequence of the INK4A-ARF locus (exon 1α from p16INK4A, exon 1β from p14ARF, and exons 2 and 3, common to both genes), as well as the exons 2, 5 and 8 of the CDK4 gene, coding for the functional domains involved in p16 and/or cyclin D1 binding. A previously reported polymorphism in exon 3 of the INK4A-ARF locus was found in one patient affected with bilateral UMM, but no germline mutations were detected, either in the p16INK4A, p14ARFor CDK4 genes. Our data support the involvement of other genes in predisposition to uveal melanoma. © 2000 Cancer Research Campaign