Miracle-dz/UniFAR-FTUs huggingface dataset:
The body, religion and sports: through the lenses of postmodern religiosity

In is necessary to look more closely at the newly developed understanding of religion and secularization in in the new fluid role it has for many people today, and that religion is seen is part of a need to build up an individual, identity-based narrative. From this perspective it is interesting to note that both the characteristics of postmodern religiosity and the ideology of the modern sports movement point in the same direction: sport can function as a religious sentiment. Both have a seriousness that can be classified as religious, at least in a functional way, towards health, well-being, self-perfection, strength, vitality and beauty—goals which modern society offers as something attainable by all. In the midst of this secularized, this-worldly, immanent and attainable religion stands the notion of the perfect body, the symbol for both control and beauty, for well-being and power of will. The struggle for bodily perfection is, no doubt, an adventurism in itself. While striving at perfection the awareness of imperfection is constantly at hand.
Synaptic Reorganisation of the Medial Amygdala During Puberty

The medial amygdala (MeA) is an important site for the gonadal hormone control of several socio‐sexual behaviours that emerge during puberty, including aggression, mating and parental behaviour. We have previously shown that rising levels of pubertal androgens increase the regional volume and mean soma size of neurones in the posterodorsal subnucleus of the MeA, the MePD. The present study aimed to determine some of the constituents of pubertal volumetric growth. Using computer‐guided unbiased stereology, we compared the regional volume, mean somal volume and the overall number of neurones and glia in 45‐day‐old male Siberian hamsters (Phodopus sungorus). Half of the hamsters had completed puberty, whereas the remainder were prepubertal as a result of photoinhibition of the hypothalamic‐pituitary‐gonadal axis. Puberty significantly increased MePD regional volume and mean somal volume, as previously observed. We also compared the number of puncta immunoreactive for vesicular glutamate transporter‐2 (vGlut2) and post‐synaptic density 95 (PSD‐95), which are both markers of glutamatergic pre‐ and post‐synaptic specialisations, as well as glutamic acid decarboxylase 65 (GAD‐65), which is a marker of GABAergic terminals. Puberty increased the number of vGlut2 and PSD‐95 immunoreactive puncta by two‐ and three‐fold, respectively, whereas the number of GAD‐65 immunoreactive puncta was unchanged. These results suggest that numerous excitatory synapses are added to the MeA during puberty. More broadly, they show that the pubertal emergence of sexual behaviour is accompanied by synaptic reorganisation of a key network involved in the expression of sexual behaviour.
Numerical operator calculus in higher dimensions

When an algorithm in dimension one is extended to dimension d, in nearly every case its computational cost is taken to the power d. This fundamental difficulty is the single greatest impediment to solving many important problems and has been dubbed the curse of dimensionality. For numerical analysis in dimension d, we propose to use a representation for vectors and matrices that generalizes separation of variables while allowing controlled accuracy. Basic linear algebra operations can be performed in this representation using one-dimensional operations, thus bypassing the exponential scaling with respect to the dimension. Although not all operators and algorithms may be compatible with this representation, we believe that many of the most important ones are. We prove that the multiparticle Schrödinger operator, as well as the inverse Laplacian, can be represented very efficiently in this form. We give numerical evidence to support the conjecture that eigenfunctions inherit this property by computing the ground-state eigenfunction for a simplified Schrödinger operator with 30 particles. We conjecture and provide numerical evidence that functions of operators inherit this property, in which case numerical operator calculus in higher dimensions becomes feasible.
A NOVEL AND ACCURATE METHOD FOR DESIGNING DIELECTRIC RESONATOR FILTER

The Development of numerical techniques enables us to analyze a large number of complex structures such as dielectric resonator (DR) filters and planar passive elements for coplanar monolithic microwave integrated circuits. As for DR filters, numerical analysis of these structure is highly intricate mostly because of their non-homogenous composition (dielectric constant of DR is greater than 80, dielectric constant of the maintainer is less than 2 and dielectric constant of the atmosphere is 1). Hence, numerical analysis of such a structure, either in time domain (TLM, FDTD and . . . ) or frequency domain (FE, moment, mode matching, boundary element, FD and . . . ) is both complex and time-consuming. From one hand, the non-homogenous structure and from the other hand, the high frequency of applications, demand high density meshing in order to achieve accurate response [1–3]. The explained method in this paper enables us to design a Chebyshev band passes filter by coaxially placing high-Q TM01δ dielectric resonators in a cutoff circular waveguide. In the presented work, discussions are made regarding high-Q resonators and interresonator coupling. It can be used for TE and TM modes of dielectric resonators. The advantages of such a method are simplicity and accuracy. Furthermore, this method is very quick in calculating resonant frequencies of a single dielectric resonator and coupling factor between two dielectric resonators. Compared with HFSS software, the total required time in this method is less than 1 percent. 294 Saliminejad and Ghafourifard Based on the presented method, a DR filter is designed, implemented and fabricated and the results are provided. The fabricated filter has an exclusive feature, i.e., it contains no screw for frequency tuning and it gives out the desired result without a need to modification.
Heart rate variability in young patients with diabetes mellitus and healthy subjects explored by Poincaré and sequence plots

Autonomic neuropathy is a common complication of the diabetes mellitus (DM). The significance of its early diagnosis is very high because the mortality of the patients with this complication is elevated. Considering the effort to apply new mathematical methods to cardiac dysregulation diagnosis, the major aim of the study was to ascertain which of the new heart rate variability (HRV) parameters are different in young patients with DM type 1 compared with control group. The next aim was to assess the HRV changes during prolonged (40 min) supine rest. The heart rate was continuously recorded during supine rest in 17 young patients with DM type 1 (10 women, 7 men) aged 22·4 ± 1·0 years (mean ± SEM). The control group consisted of 17 healthy matched probands. The HRV (time/frequency domains, Poincaré and sequence plots, sample entropy) was analysed in two intervals – T1 starting at fifth minute and T2 starting at 30th minute of supine rest. The major results of our study are: the reduced Poincaré plot pattern measures in the young DM group; the lower percentage of points in the third quadrant of sequence plot (this parameter was not correlated with the mean heart rate) and significant changes in HRV during supine rest in DM group (in contrast to control subjects). In conclusion, HRV parameters based on nonlinear dynamics were able to distinguish cardiac dysregulation in young patients with DM from the control group. The percentage of points in the third quadrant of sequence plot provides information that is not dependent on mean heart rate. Poincaré and sequence plots, together with the rate of HRV changes during supine rest, can provide clinically relevant information usable in diagnosis of the cardiac dysregulation.
Affect and Accuracy in Recall. Studies of « flashbulb » memories

Preface List of contributors 1. Introduction Eugene Winograd Part I. Empirical Studies: 2. Phantom flashbulbs: false recollections of hearing the news about Challenger Ulric Neisser and Nicole Harsch 3. Potential flashbulbs: memories of ordinary news as the baseline Steen F. Larsen 4. Flashbulb memories: confidence, consistency, and quantity John Neil Bohannon III and Victoria Louise Symons Part II. Developmental Studies: 5. Developmental issues in flashbulb memory research: children recall the Challenger event Amye Richelle Warren and Jeffery N. Swartwood 6. Preschool children's memories of personal circumstances: the fire alarm study David B. Pillemer Part III. Emotion and Memory: 7. A proposed neurobiological basis for regulating memory storage for significant events Paul E. Gold 8. Remembering the details of emotional events Daniel Reisberg and Friderike Heuer 9. Do flashbulb memories differ from other types of emotional memories? Sven-Ake Christianson 10. Why do traumatic experiences sometimes produce good memory (flashbulbs) and sometimes no memory (repression)? Elizabeth F. Loftus and Leah Kaufman Part IV. Theoretical Issues: 11. Special versus ordinary memory mechanisms in the genesis of flashbulb memories Michael McCloskey 12. Remembering personal circumstances: a functional analysis David B. Pillemer 13. Constraints on memory David C. Rubin 14. The theoretical and empirical status of the flashbulb memory hypothesis William F. Brewer Author index Subject index.
On the triggering of self-excitation in induction generators

Self-excited induction generators produce power off-grid with capacitors placed in parallel with the load to supply the reactive power. The existing theory predicts an exponential growth of the phase voltages from the zero state when the linearized electrical system has unstable poles, a condition that requires a combination of minimum speed and sufficient capacitance. In practice, however, pre-charged capacitors are often used to ensure self-excitation, a precaution that the linear theory does not predict a need for, since any nonzero initial condition, no matter how small, should trigger exponential growth towards self-excitation. Instead, experiments reported in the paper show a clear relationship between successful self-excitation and the voltage initially applied to the capacitors. In some cases, growth of the voltages is also found to be significantly slower than exponential. Further, instances are found where sinusoidal voltages are sustained for many cycles before collapsing. None of these behaviors fit the linear theory. An explanation of the experimental data is proposed in the paper, assuming a nonlinear dependency of the magnetizing inductance on the magnetizing current for low values of the current, in addition to the magnetic saturation at high currents. A model of the induction generator that accounts for these effects is proposed, and simulations show that the characteristics of the experimental responses can be duplicated.
New Rate-1 / 2 Transparent Convolutional Codes over Ring Z 8 for 8-PSK Signals

New rate-1/2 transparent systematic linear convolutional codes over ring Z8 for 8-PSK signals having 1.5 bit/sec/Hz of bandwidth efficiency for bandlimited additive white Gaussian noise channels are reported. These codes give good coding gains, low decoding complexity, and they are suitable for use in many practical bandlimited channels with phase offset.
NoSQL как подход к построению рекомендательных сервисов реального времени (Building Real-Time Recommender Services with NoSQL)

Основным отличием приложений Веб 2.0 от их более старых аналогов является анализ взаимодействия пользователя с приложением и использование результатов этого анализа для модификации контента и его представления. Темпы развития сети Интернет диктуют создателям современных вебприложений необходимость очень быстро адаптировать контент под предпочтения пользователей. Наиболее востребованным решением этой задачи являются рекомендательные системы, способные анализировать поведение пользователя, его склонности, и предлагать наиболее интересное наполнение. Проблема с подобными системами заключается в том, что они недостаточно быстро реагируют на постоянно изменяющийся поток входных данных. Особенно подвержены этому новостные ресурсы. Такое поведение связано не столько с алгоритмами, применяемыми для выявления пользовательских предпочтений, сколько с архитектурными особенностями той инфраструктуры и библиотек, которые широко используются для подобного анализа. В данной статье представляется подход к организации новостного рекомендательного сервиса, призванного максимально устранить задержки в пересчете рекомендаций и обеспечить работу в режиме, близком к режиму реального времени.
Interconnect Lifetime Prediction with Temporal and Spatial Temperature Gradients for Reliability-Aware Design and Runtime Management: Modeling and Applications

Thermal effects are becoming a limiting factor in high performance circuit design due to the strong temperature dependence of leakage power, circuit performance, IC package cost and reliability. While many interconnect reliability models assume a constant temperature, this paper analyzes the effects of temporal and spatial thermal gradients on interconnect lifetime in terms of electromigration. For temporal thermal variations, we present a physics-based dynamic model for estimating interconnect lifetime for any time-varying temperature/current profile, and this model returns reliability equivalent temperature and current de nsity that can be used in traditional reliability analysis t ools. For spatial temperature gradients, we give close bounds in terms of uniformly distributed temperatures to estimate the lifetime of interconnects subject to non-uniform temperature distribution. Our results are verified with numerica l simulations and reveal that blindly using the maximum temperature leads to very inaccurate or too pessimistic lifetime estimation. In fact, our dynamic model reveals that when the temporal temperature variation is small, average temperature (instead of worst-case temperature) can be used to accurately predict interconnect lifetime. Therefore, our results not only increase the accuracy of rel iability estimates, but they also enable designers to reclaim design margin in reliability-aware design. In addition, our dynamic reliability model is useful for improving the performance of temperature-aware dynamic runtime management by modeling reliability as a resource to be consumed at a stress-dependent rate. This report supersedes TR CS-2005-10.
The Loners Will Benefit from the Games

In an economic organization, there exist three strategies for all members: cooperators, defectors and loners and we aim to consider them. By game theory approaches, we compare a loner and a cooperator in an organization. We find that a player will benefit more from the game if he/she is a loner than he/she is a cooperator under the same conditions. In essence, Nash game is further considered in this paper.
Student Writing: Access, Regulation, Desire

Student Writing presents an accessible and thought-provoking study of academic writing practices. Informed by 'composition' research from the US and 'academic literacies studies'from the UK, the book challenges current official discourse on writing as a 'skill'. Lillis argues for an approach which sees student writing as social practice. The book draws extensively on a three-year study with ten non-traditional students in higher education and their experience of academic writing. Using case-study material - including literacy history interviews, extended discussions with students about their writing of discipline specific essays, and extracts from essays - Lillis identifies the following as three significant dimensions to academic writing: Access to higher education and to its language and literacy representational resources Regulation of meaning making in academic writing rrent Desire for participation in higher education and for choices over ways of meaning in academic writing. Student Writing: access, regulation, desire raises questions about why academics write as they do, who benefits from such writing, which meanings are valued and how, on what terms 'outsiders' get to be 'insiders' and at what costs. Theresa M. Lillis is Lecturer in language and education at the Centre for Language and Communications at the Open University.
Māori and Educational Leadership: Tū Rangatira

Aotearoa/New Zealand is experiencing major changes in its demographic profile, indicating that the proportion of Māori (the indigenous people) will progressively increase (Statistics New Zealand, 2004). Projected changes are likely to impact particularly on the school-aged population and this has implications for the nation's educational leadership, including the need for greater Māori representation (Durie, 2005). This raises questions around what Māori educational leadership may need to look like in order to impact positively on Māori achievement in English and Māori-medium schooling. A Best Evidence Synthesis Iteration (BES) has identified dimensions of educational leadership that are linked to raising student achievement. In this article we examine the extent to which the dimensions resonate with traditional and contemporary conceptualisations of Māori leadership.
Ecological Orbits: How Planets Move and Populations Grow

A famous ecologist and a philosopher of science team up to offer a fresh new approach to population biology and ecology. Challenging the traditionally accepted Lotka-Volterra model, which is based on predator-prey interactions, this new model emphasizes maternal effects, specifically the significance of a mother's interest in the success of her female offspring.
Worm Propagation Models

ABOUT THE AUTHOR. Zesheng Chen is currently a Ph.D. Candidate in the Communication Networks and Machine Learning Group at the School of Electrical and Computer Engineering, Georgia Institute of Technology, advised by Professor Chuanyi Ji. Chen’s research interests focus on network security, especially modeling the spread of malware on networks, the performance of distributed detection systems, the effectiveness of defense systems, and the performance evaluation of communication networks.
Space-bounded communication complexity

In the past thirty years, Communication Complexity has emerged as a foundational tool to proving lower bounds in many areas of computer science. Its power comes from its generality, but this generality comes at a price---no superlinear communication lower bound is possible, since a player may communicate his entire input. However, what if the players are limited in their ability to recall parts of their interaction? We introduce memory models for 2-party communication complexity. Our general model is as follows: two computationally unrestricted players, Alice and Bob, each have s(n) bits of memory. When a player receives a bit of communication, he "compresses" his state. This compression may be an arbitrary function of his current memory contents, his input, and the bit of communication just received; the only restriction is that the compression must return at most s(n) bits. We obtain memory hierarchy theorems (also comparing this general model with its restricted variants), and show super-linear lower bounds for some explicit (non-boolean) functions. Our main conceptual and technical contribution concerns the following variant. The communication is one-way, from Alice to Bob, where Bob controls two types of memory: (i) a large, oblivious memory, where updates are only a function of the received bit and the current memory content, and (ii) a smaller, non-oblivious/general memory, where updates can be a function of the input given to Bob. We exhibit natural protocols where this semi-obliviousness shows up. For this model we also introduce new techniques through which certain limitations of space-bounded computation are revealed. One of the main motivations of this work is in understanding the difference in the use of space when computing the following functions: Equality (EQ), Inner Product (IP), and connectivity in a directed graph (REACH). When viewed as communication problems, EQ can be decided using 0 non-oblivious bits (and log2 n oblivious bits), IP requires exactly 1 non-oblivious bit, whereas for REACH we obtain the same lower bound as for IP and conjecture that the actual bound is Omega(log2 n). In fact, proving that 1 non-oblivious bit is required becomes technically sophisticated, and the question even for 2 non-oblivious bits for any explicit boolean function remains open.
Effort-based incentives for resource sharing in collaborative volunteer applications

Collaborative and volunteer applications need to implement incentive mechanisms to regulate resource sharing and encourage network nodes to contribute for reaching a certain goal. Typically, these incentive mechanisms assign resources to network node requests, based on the total amount of resources contributed by the requesting participant. This approach assumes that participants contributing more should also get back more resources from the collaborative environment. This assumption turns the system unfair to those participants with scarce resources, because they have just few resources to share. This paper proposes the use of an incentive strategy based on the contribution percentage of each node; i.e. an effort-based approach. This proposal is evaluated and compared to contribution-based strategies. The obtained results show that the proposed effort-based approach not only benefits participants that have scarce resources, but also it is able to satisfy the requests of the powerful nodes.
Completeness of automatically generated instruction selectors

The use of tree pattern matching for instruction selection has proven very successful in modern compilers. This can be attributed to the declarative nature of tree grammar specifications, which greatly simplifies the development of fast high-quality code generators. The approach has also been adopted widely by generator tools that aim to automatically extract the instruction selector, as well as other compiler components, for application-specific instruction processors from generic processor models. A major advantage of tree pattern matching is that it is suitable for static analysis and allows to verify properties of a given specification. Completeness is an important example of such a property, in particular for automatically generated compilers. Tree automata can be used to prove that a given instruction selector specification is complete, i.e., can actually generate machine code for all possible input programs. Traditional approaches for completeness tests cannot represent dynamic checks that may disable certain matching rules during code generation. However, these dynamic checks occur very frequently in compilers targeting application-specific processors. The dynamic checks arise from hidden properties that are not captured by the terminal symbols of the tree grammar notation. We apply terminal splitting to the instruction selector specifications that are automatically derived from structural processor models to make these properties explicit. The transformed specification is then verified using a traditional completeness test. If the test fails, counter examples are presented that allow to adopt the compiler or extend the processor model accordingly.