Miracle-dz/UniFAR-FTUs huggingface dataset:
Países industrializados y países en vías de desarrollo como antagonistas en la lucha contra el cambio climático en la prensa argentina

Resumen: La investigación acerca de la cobertura periodística del cambio climático está muy desarrollada en el ámbito anglosajón. Sin embargo, no puede afirmarse lo mismo en relación a los medios latinoamericanos. En algunos informes internacionales, Honduras, México o Perú han sido los países incluidos en las muestras. En esta investigación, la prensa argentina de referencia es el objeto de estudio. Tras el análisis de las informaciones aparecidas durante un año en los diarios Clarín y La Nación, los resultados muestran que el cambio climático es seguido en función de la agenda política internacional. Desde la teoría del framing, el conflicto asociado al enfrentamiento en las negociaciones internacionales es el encuadre que aparece con mayor frecuencia. El conflicto no gira en torno a la existencia del cambio climático antropogénico. Los antagonistas no son científicos a favor y científicos (y otros) en contra, los llamados escépticos, sino los países industrializados y los países en desarrollo. Si en la prensa europea ‘ellos’ son los otros países industrializados que no ratificaron el Protocolo de Kyoto y no están tan implicados como ‘nosotros’, los europeos, en la prensa argentina ‘ellos’ son todos los países desarrollados. Sin embargo, el ‘nosotros’ no aparece tan claramente delimitado como en el caso europeo. La lucha contra el cambio climático no es un tema de interés prioritario en la agenda política argentina. Tampoco se refleja en la prensa argentina una posición latinoamericana común a pesar de que la región será una de las más afectadas por el cambio climático.
Obesity is a sign – over‐eating is a symptom: an aetiological framework for the assessment and management of obesity

Obesity is characterized by the accumulation of excess body fat and can be conceptualized as the physical manifestation of chronic energy excess. Using the analogy of oedema, the consequence of positive fluid balance or fluid retention, obesity can be seen as the consequence of positive energy balance or calorie ‘retention’. Just as the assessment of oedema requires a comprehensive assessment of factors related to fluid balance, the assessment of obesity requires a systematic assessment of factors potentially affecting energy intake, metabolism and expenditure. Rather than just identifying and describing a behaviour (‘this patient eats too much’), clinicians should seek to identify the determinants of this behaviour (‘why, does this patient eat too much? ’). This paper provides an aetiological framework for the systematic assessment of the socio‐cultural, biomedical, psychological and iatrogenic factors that influence energy input, metabolism and expenditure. The paper discusses factors that affect metabolism (age, sex, genetics, neuroendocrine factors, sarcopenia, metabolically active fat, medications, prior weight loss), energy intake (socio‐cultural factors, mindless eating, physical hunger, emotional eating, mental health, medications) and activity (socio‐cultural factors, physical and emotional barriers, medications). It is expected that the clinical application of this framework can help clinicians systematically assess, identify and thereby address the aetiological determinants of positive energy balance resulting in more effective obesity prevention and management.
From constraint programming to heterogeneous parallelism

The scaling limitations of multi-core processor development have led to a diversification of the processor cores used within individual computers. Heterogeneous computing has become widespread, involving the cooperation of several structurally different processor cores. Central processor (CPU) cores are most frequently complemented with graphics processors (GPUs), which despite their name are suitable for many highly parallel computations besides computer graphics. Furthermore, deep learning accelerators are rapidly gaining relevance. Many applications could profit from heterogeneous computing but are held back by the surrounding software ecosystems. Heterogeneous systems are a challenge for compilers in particular, which usually target only the increasingly marginalised homogeneous CPU cores. Therefore, heterogeneous acceleration is primarily accessible via libraries and domain-specific languages (DSLs), requiring application rewrites and resulting in vendor lock-in. This thesis presents a compiler method for automatically targeting heterogeneous hardware from existing sequential C/C++ source code. A new constraint programming method enables the declarative specification and automatic detection of computational idioms within compiler intermediate representation code. Examples of computational idioms are stencils, reductions, and linear algebra. Computational idioms denote algorithmic structures that commonly occur in performance-critical loops. Consequently, well-designed accelerator DSLs and libraries support computational idioms with their programming models and function interfaces. The detection of computational idioms in their middle end enables compilers to incorporate DSL and library backends for code generation. These backends leverage domain knowledge for the efficient utilisation of heterogeneous hardware. The constraint programming methodology is first derived on an abstract model and then implemented as an extension to LLVM. Two constraint programming languages are designed to target this implementation: the Compiler Analysis Description Language (CAnDL), and the extended Idiom Detection Language (IDL). These languages are evaluated on a range of different compiler problems, culminating in a complete heterogeneous acceleration pipeline integrated with the Clang C/C++ compiler. This pipeline was evaluated on the established benchmark collections NPB and Parboil. The approach was applicable to 10 of the benchmark programs, resulting in significant speedups from 1.26× on “histo” to 275× on “sgemm” when starting from sequential baseline versions. In summary, this thesis shows that the automatic recognition of computational idioms during compilation enables the heterogeneous acceleration of sequential C/C++ programs. Moreover, the declarative specification of computational idioms is derived in novel declarative programming languages, and it is demonstrated that constraint programming on Single Static Assignment intermediate code is a suitable method for their automatic detection.
Conference on Modern Analysis and Probability

Cross section map for the geodesic flow on the modular surface by R. L. Adler and L. Flatto On identification of superadditive ergodic limits by M. A. Akcoglu and L. Sucheston The equivalence of diffusions on networks to Brownian motion by J. R. Baxter and R. V. Chacon On sequences of density zero in ergodic theory by A. Bellow and V. Losert On the continuity of the percolation probability function by J. van den Berg and M. Keane Coincidence theorems, minimax theorems, and variational inequalities by F. E. Browder Recent developments arising out of Kakutani's work on completion regularity of measure by J. R. Choksi An automorphism of a homogeneous measure algebra which does not factorize into a direct product by J. R. Choksi and S. J. Eigen Another generalization for the Brouwer fixed point theorem by D. I. A. Cohen An ergodic theorem by Y. N. Dowker Higher order partial mixing by N. A. Friedman $IP$-systems in ergodic theory by H. Furstenberg Induced transformations on a section by A. Hajian and Y. Ito Conjugate Fourier series on the character group of the additive rationals by E. Hewitt A stochastic differential equation in infinite dimensions by K. Ito Ergodic theory and combinatorics by K. Jacobs Extensions of Lipschitz mappings into a Hilbert space by W. B. Johnson and J. Lindenstrauss A uniqueness result for a class of compact connected groups by R. R. Kallman Two extremal properties of functions by L. A. Karlovitz On Bernoulli convolutions by R. Kaufman Generic theorems for lifting dynamical properties by continuous affine cocyles by H. B. Keynes and M. G. Nerurkar Linear algebra and subshifts of finite type by B. Kitchens The etymology of the word ergodic by A. Lo Bello A functional approach to nonstandard measure theory by P. A. Loeb On positive operators by D. Maharam Transmission rates and factors of Markov chains by B. Marcus, K. Petersen, and S. Williams Ellis groups and compact right topological groups by I. Namioka Invariants of finitary isomorphisms with finite expected code-lengths by W. Parry and K. Schmidt Ergodic theory in hyperbolic space by M. Ratner Embedding of $L^1$ in $L^1$ by H. P. Rosenthal Inner and barely linear time changes of ergodic $R^-k$-actions by D. J. Rudolph Processes evolving from the indefinite past by M. J. Sharpe An infinitesimal characterization of Gelfand pairs by E. G. F. Thomas Multiple points of Brownian motion by N. Tongring Measurable dynamics by B. Weiss A note on Mikusinski's proof of the Titchmarsh convolution theorem by K. Yosida and S. Matsuura Ergodic actions of arithmetic groups and the Kakutani-Markov fixed point theorem by R. J. Zimmer.
MICROWAVE SCATTERING MODELS FOR CYLINDRICAL VEGETATION COMPONENTS

This work is intended to investigate the accuracy of modelling simple cylindrical vegetation structures for microwave remote sensing applications. Plane wave scattering by dielectric cylinders of finite length and circular cross section is examined. Cylinders with a radius that varies linearly along the cylinder length — hereafter referred to as tapered cylinders — are also considered. Exact expressions for the scattering cross section do not exist for those objects. Numerical methods can provide accurate results, but they are computationally intensive and therefore less suitable when calculations on a large number of scatterers of different sizes and orientations are necessary. In this paper the scattering cross section of finite cylinders is computed by physical optics methods, which are faster and often employed in microwave vegetation models. Tapered cylinders are modelled by a number of coaxial finite cylinders stacked on top of each other. To check the validity of the results, the problems are also solved numerically by the moment method. For cases often encountered in vegetation studies, the results of the application of the approximate analytical methods are then compared with the corresponding numerical solution. For both constantradius and tapered cylindrical structures, a good agreement with the numerical solution is found in the region of the main scattering lobe, which is the one of interest when considering complex media such as vegetation canopies. However, the accuracy of the approximate solutions decreases as the angle of the incident wave approaches the end-on angle. 308 De Matthaeis and Lang
Preparation and properties of mesoporous silica/bismaleimide/diallylbisphenol composites with improved thermal stability, mechanical and dielectric properties

New composites with improved thermal stability, mechanical and dielectric properties were developed, which consist of 2,2! -diallylbisphenol A (DBA)/4,4! -bismaleimidodiphenylmethane (BDM) resin and a new kind of organic/inor- ganic mesoporous silica (MPSA). Typical properties (curing behavior and mechanism, thermal stability, mechanical and dielectric properties) of the composites were systematically investigated, and their origins were discussed. Results show that MPSA/DBA/BDM composites have similar curing temperature as DBA/BDM resin does; however, they have different curing mechanisms, and thus different crosslinked networks. The content of MPSA has close relation with the integrated performance of cured composites. Compared with cured DBA/BDM resin, composites with suitable content of MPSA show obviously improved flexural strength and modulus as well as impact strength; in addition, all composites not only have lower dielectric constant and similar frequency dependence, more interestingly, they also exhibit better stability of fre- quency on dielectric loss. For thermal stability, the addition of MPSA to DBA/BDM resin significantly decreases the coef- ficient of thermal expansion, and improves the char yield at high temperature with a slightly reduced glass transition temperature. All these differences in macro-properties are attributed to the different crosslinked networks between MPSA/DBA/BDM composites and DBA/BDM resin.
Chapter 27 On-Line caching tis Cache

Reconsider the competitiveness ofon-line strategies using k servers versus the optimal off-line strategy using h S k servers for the paging, weighted cache, and k-server problems. We show that when h < k the competitiveness of the marking algorithm, arandomized paging strategy, is no more than 2(ln ~ –lnln ~+~) when & > e, and at most 2 otherwise. We show this is roughly within a factor of two of optimal. Intuitively, we say a paging strategy is loosely Competitive if, for any sequence, at most cache sizes the fault rate of the pa ing strategy is at most an insignificant 7 amount above C(k times the fault rate of the optimal strategy. We show that LRU, FWF, and FIFO are loosely C'(k)-competitive provided C(k)/ in k ~ co and that the marking algorithm is loosely C(k)-competitive provided C(k) –21nlnk~ co. We formulate the off-line version of the k-server problem as a linear program and examine the dual to derive a lower bound on the performance of the optimal algorithm. We use this bound to show that for the weighted cache prc~blem the balance algorithm is-competitive. 1 Introduction In the most general version of the k-server lproblem, one is given a directed graph with edge lengths and k servers. Initially, the servers are positioned on nodes of the graph. A sequence rl, rz,. r~ of requests for service at nodes is given and after each request al server must be moved to the node if a server is not already present. The goal is to minimize the total length travelled by the servers. In the standard version of the problem, the edge weights d(i, j) satisfy d(i, j) = d(j, i), d(i, i) = O, and d(i, j) < d(i, k) + d(k, j). A special case of the k-server problem is the weighted cache problem. In this case the nodes of the graph have non-negative weights, and the cost to service a request to a node with no server is taken to be the weight of the node. A special case of the weighted cache problem is the paging problem. In this case, all of the nodes have weight one. For this problem, we adopt traditional terminology: nodes are referred to as pages, servecl nodes are Size Varies said to be in the cache, and a request to an unserved node is a fault. If all of the …
Programmed teaching of autistic children. Scholastic progress over one year.

THERE can be no doubt that remedial teaching forms a vital part in the treatment of autistic children. 1-3 Wing and Wing 1 survey the teaching methods applied to date and point out that there is a noteable lack of detailed reports regarding their usefulness. In addition, Rutter et al 3 state that the amount of schooling that the autistic child receives is positively related to the level of social adjustment which the child attains in adolescence. Mittler 4 has advocated the psychological assessment of autistic children in an educational setting with the teacher playing a central role in the assessment process and he pleads for an experimental approach in regard to the investigation of different educational methods. Present Study The data presented in this study were gathered over a period of one year in a hospital school which forms part of a unit catering to psychotic children. Although the school
Pre-college computing math

MUCH OF PRE-COLLEGE MATHEMATICS seems to be based upon traditional numbers, values, calculation and equation/formula oriented continuous math education. This approach used to be sufficient for solving many problems in science, engineering, business, etc. However, the world is slowly changing from a continuous one to a discrete one in many important fields. But in my opinion the education world has lagged behind. When I thought about precollege computing mathematics as a topic for this column a few ideas came to mind. As I began to research this area, take notes, and write, a flood of ideas came forth. I am hoping to express the relevant ones in this short space. If not, then I will continue them in my next Math CountS insight article. There has been a concerted effort in many countries, some successful and some struggling, to introduce computing principles1 into pre-college education. For many years I have advocated introducing the foundational computing mathematics principles, such as basic logic, discrete math, graphs, etc. as conceptual problem solving and thinking tools early in childhood education. One reason is because the world is changing, but the other is because many problems in discrete, or finite, mathematics are more tractable, engaging, and fun for young people. It has been said that mathematics is “The Study of Patterns. ” Many young students struggle with identifying and applying patterns found in the continuous world— equations, algebra, trigonometry, etc. One of my favorite courses was geometry because the visual patterns were more intuitive and I was introduced to rigorous reasoning—the kind of reasoning often required in college level mathematics courses.2 However, calculation/equationoriented mathematics is poor preparation for this kind of reasoning. In my opinion, the logical, inductive and deductive reasoning techniques acquired through the study of discrete mathematics would be significantly better. The basic proposition logic concept of true/false (yes/no) is easily introduced in pre-kindergarten—“Is the grass green? ”, “Is Sue taller than Sam? ”, etc. The fundamental logical operators—‘not’, ‘and’, ‘or’, ‘exclusive or’, —can be covered in the primary grades, along with simple graphs, solving some simple logical word problems, and relations (e.g., “Is 3 < 4? ). More advanced logic, such as logical variables, truth tables and logical expressions, advanced graphs and logical word problems, and translating logical word problems to logical expression in middle school and early high school. In the United States, pre-college educators have thought carefully about integrating discrete math into the K-12 curriculum [3,5]. Many years ago I recall a colleague showing me a mathematics book, written in French and used in the Belgium middle school, which covered a significant amount of the discrete math material in our Foundations of Computer Science course at SUNY Stony Brook. Many educational television shows for children attempt to introduce logical reasoning and problem-solving. Here is an example from one show, Thomas and Friends, Thomas the Tank Engine, which my grandsons watch.
Getting aligned on representational alignment

Biological and artificial information processing systems form representations that they can use to categorize, reason, plan, navigate, and make decisions. How can we measure the extent to which the representations formed by these diverse systems agree? Do similarities in representations then translate into similar behavior? How can a system's representations be modified to better match those of another system? These questions pertaining to the study of representational alignment are at the heart of some of the most active research areas in cognitive science, neuroscience, and machine learning. For example, cognitive scientists measure the representational alignment of multiple individuals to identify shared cognitive priors, neuroscientists align fMRI responses from multiple individuals into a shared representational space for group-level analyses, and ML researchers distill knowledge from teacher models into student models by increasing their alignment. Unfortunately, there is limited knowledge transfer between research communities interested in representational alignment, so progress in one field often ends up being rediscovered independently in another. Thus, greater cross-field communication would be advantageous. To improve communication between these fields, we propose a unifying framework that can serve as a common language between researchers studying representational alignment. We survey the literature from all three fields and demonstrate how prior work fits into this framework. Finally, we lay out open problems in representational alignment where progress can benefit all three of these fields. We hope that our work can catalyze cross-disciplinary collaboration and accelerate progress for all communities studying and developing information processing systems. We note that this is a working paper and encourage readers to reach out with their suggestions for future revisions.
The Relationships Between Sleep Patterns and Reactive and Endogenous Depressions

In the British Journal of Psychiatry for July, 1963, Costello and Smith described an investigation based on the prediction that “… reactive depressions would sleep more at the end than at the beginning of a set period of sleep and that endogenous depressions would sleep more at the beginning than at the end of a set period for sleep …”. Hourly observation by nurses of the sleep of 18 patients with endogenous and 41 with reactive depression failed to confirm the prediction.
Salmonella enterica Serovar Typhimurium Exploits Inflammation to Compete with the Intestinal Microbiota

Most mucosal surfaces of the mammalian body are colonized by microbial communities (“microbiota”). A high density of commensal microbiota inhabits the intestine and shields from infection (“colonization resistance”). The virulence strategies allowing enteropathogenic bacteria to successfully compete with the microbiota and overcome colonization resistance are poorly understood. Here, we investigated manipulation of the intestinal microbiota by the enteropathogenic bacterium Salmonella enterica subspecies 1 serovar Typhimurium (S. Tm) in a mouse colitis model: we found that inflammatory host responses induced by S. Tm changed microbiota composition and suppressed its growth. In contrast to wild-type S. Tm, an avirulent invGsseD mutant failing to trigger colitis was outcompeted by the microbiota. This competitive defect was reverted if inflammation was provided concomitantly by mixed infection with wild-type S. Tm or in mice (IL10−/−, VILLIN-HACL4-CD8) with inflammatory bowel disease. Thus, inflammation is necessary and sufficient for overcoming colonization resistance. This reveals a new concept in infectious disease: in contrast to current thinking, inflammation is not always detrimental for the pathogen. Triggering the host's immune defence can shift the balance between the protective microbiota and the pathogen in favour of the pathogen.
The Relationship Between Social Support and Adherence to a Peer-Based Physical Activity Program Among Adolescent Girls: A Pilot Study

Purpose: To explore the relationship between social support and adherence to a peerbased program among adolescent girls using the Theory of Planned Behaviour (TPB), and to explore barriers and facilitators related to physical activity. Methods: Participants (N=13) completed self-reported measures of social support, TPB constructs, adherence to the program, and physical activity behaviour. A one-month follow-up was conducted on all baseline measures. Open-ended questions were used to determine facilitators and barriers to physical activity. Results: At baseline, social support was a significant correlate of subjective norm (r=0.58, p<.05). At post-program, frequency of attending the program with friends (r=0.97, p<.01) was a significant correlate of attendance in the program. Also, social support was a significant correlate of PBC at post-program (r=-0.82, p<.01). Conclusions: A physical activity program targeting peer social support may serve as a viable mechanism for increasing physical activity levels in adolescent girls.