Miracle-dz/UniFAR-FTUs huggingface dataset:
Transfer matrix and Monte Carlo tests of critical exponents in lattice models

The corrections to finite-size scaling in the critical two-point correlation function G(r) of 2D Ising model on a square lattice have been studied numerically by means of exact transfer-matrix algorithms. The systems of square geometry with periodic boundaries oriented either along or along direction have been considered, including up to 800 spins. The calculation of G(r) at a distance r equal to the half of the system size L shows the existence of an amplitude correction proportional to 1/L^2. A nontrivial correction proportional to 1/L^0.25 of a very small magnitude also has been detected in agreement with predictions of our recently developed GFD (grouping of Feynman diagrams) theory. A refined analysis of the recent MC data for 3D Ising, phi^4, and XY lattice models has been performed. It includes an analysis of the partition function zeros of 3D Ising model, an estimation of the correction-to-scaling exponent omega from the Binder cumulant data near criticality, as well as a study of the effective critical exponent eta and the effective amplitudes in the asymptotic expansion of susceptibility at the critical point. In all cases a refined analysis is consistent with our (GFD) asymptotic values of the critical exponents (nu=2/3, omega=1/2, eta=1/8 for 3D Ising model and omega=5/9 for 3D XY model), while the actually accepted "conventional" exponents are, in fact, effective exponents which are valid for approximation of the finite--size scaling behavior of not too large systems.
An anomaly of non-locality

Ever since the work of Bell, it has been known that entangled quantum states can produce non-local correlations between the outcomes of separate measurements. However, for almost forty years, it has been assumed that the most non-local states would be the maximally entangled ones. Surprisingly it is not the case: non-maximally entangled states are generally more non-local than maximally entangled states for all the measures of non-locality proposed to date: Bell inequalities, the Kullback-Leibler distance, entanglement simulation with communication or with non-local boxes, the detection loophole and efficiency of cryptography. In fact, one can even find simple examples in low dimensions, confirming that it is not an artefact of a specifically constructed Hilbert space or topology. This anomaly shows that entanglement and non-locality are not only different concepts, but also truly different resources. We review the present knowledge on this anomaly, point out that Hardy's theorem has the same feature, and discuss the perspectives opened by these discoveries.
Results : Conclusions : THE COMPREHENSION OF SOCIAL SITUATIONS IN A SMALL GROUP OF PATIENTS WITH FRONTOTEMPORAL DEMENTIA AND ALZHEIMER ’ S DISEASE

Marco Cavallo, Ivan Enrici3(A,D,E,F, Mauro Adenzato 1 Department of Medical Sciences, Amedeo Avogadro University of Eastern Piedmont, Novara, Italy 2 Department of Mental Health, San Luigi Gonzaga Hospital Medical School, University of Turin, Italy 3 Department of Psychology, Center for Cognitive Science, University of Turin, 4 Neuroscience Institute of Turin, Italy ORIGINAL ARTICLE ACTA Vol. 9, No. 2, 2011, 167-176
Some Recent Advances in Answer Set Programming (from the Perspective of NLP)

Answer Set Programming (ASP) [12, 13, 15, 8] is a logical language for knowledge representation and reasoning that combines a non-monotonic nature, strong theoretical foundations, an intuitive semantics, and substantial expressive power. The language has been successfully used for modeling a number of very diverse domains (e.g. [7, 14]) and for capturing key reasoning tasks such as planning, diagnostics, learning and scheduling (e.g. [10, 5, 1]). All of this makes ASP a prime candidate for use in the sophisticated knowledge representation and reasoning tasks involved in Natural Language Processing (NLP). In this note I will give an overview of some of my recent work on ASP that I believe may be useful in the context of NLP.
Siblings’ Perceptions of Their ADHD-Diagnosed Sibling’s Impact on the Family System

This qualitative study explored siblings’ perceptions of the impact a sibling diagnosed with ADHD has within the family system. Specific focus was placed on the different ways these different sibling cohorts were parented. Participants constituted eight adult females with a mean age of 20 years from different cultural and socio-economic backgrounds in the province of Gauteng, South Africa. Data was collected using semi-structured interviews and was analysed thematically. The four themes that emerged from the interviews include differential parental treatment, rejection, discrepancy with discipline, and the parentified child. Specifically, the results of this study revealed feelings of differential parental treatment and discipline that took place in the home and rejection experienced by the non-ADHD sibling. There was also a common theme of a parentified child, who had to carry a burden of caring for their sibling with ADHD. The non-diagnosed siblings perceive themselves to be particularly negatively impacted. The results are discussed in light of the previous empirical studies, and recommendations are made.
Evolutionary design of process controllers

The Genetic Programming (GP) architecture offers a potentially powerful framework for 'intelligent' controller design due to its inherent matching of structure to utility. This article describes the use of GP to design discrete time single loop controllers for two different processes: a linear Auto-Regressive eXogeneous (ARX) type system and a non-linear simulated Continuous Stirred Tank Reactor (CSTR), both with constraints on the actuator outputs. It is demonstrated that the GP methodology is capable of designing recursive controllers that, for a specific class of control objectives, offer similar performance to PID controllers on the nominal systems. The advantages and disadvantages of controllers designed in this way are also discussed.
Clustering on Uncertain Data Stream over Sliding Windows

This paper proposes a density grid-based algorithm (C_UStream) for clustering on uncertain data stream in sliding window which can find clusters of arbitrary shapes. The statistical summary information of each grid is stored in linked queue structure by using sampling window mechanism. In order to guarantee the validity of clustering, the expired grids in the current window are removed regularly. Furthermore, a dynamic sporadic grids deletion mechanism is developed to delete most of outliers periodically which greatly improve the space and time efficiency. The experimental results on the synthetic and real data sets show that C_UStream has superior clustering quality and efficiency than other similar algorithms.
Linear Loop Transformations in Optimizing Compilers for Parallel Machines

We present the linear loop transformation framework which is the formal basis for state of the art optimization techniques in restructuring compilers for parallel machines. The framework uni(cid:12)es most existing transformations and provides a systematic set of code generation techniques for arbitrary compound loop transformations. The algebraic representation of the loop structure and its transformation give way to quantitative techniques for optimizing performance on parallel machines. We discuss in detail the techniques for generating the transformed loop and deriving the desired linear transformation.
4 Embodied Neural Dynamics

O ver the first three chapters we have seen how neural dynamics goes well beyond the feed-forward processing of sensory input toward motor output. In particular, the neural dynamics of activation variables and fields creates stable states. We have shown that these stable states may instantiate decisions, which are stabilized even as sensory inputs change. Instabilities are the critical points at which states change qualitatively, such as when a decision is first made. Memory traces keep track of past states. Even though stability was a central postulate in our approach exactly because behavior and cogni-tion may be continuously linked to changing sensory inputs, the organisms we have modeled thus far have been entirely passive and static; they were sitting and waiting for inputs to arrive. Inputs were perhaps structured in space and time, but we did not account for how the spatial and temporal structure of inputs emerges from the behavior of the organism as it moves its body or actuator in a struc-tured environment. In this chapter we will address how closing the sensory-motor loop affects the neural dynamics and, conversely, how neural dynamics may be embodied in an organism that behaves in a closed sensory-motor loop. This entails recognizing that closing the loop through the outer world creates another level of dynamics, a level we refer to as behavioral dynamics. To formalize these dynamics, we will need to introduce new variables that characterize the state of the embodied system within the structured environment in which the organism is situated. Behavioral dynamics is more than control, because it achieves more than keeping the organism aligned with a given goal state. Behavioral dynamics may induce decisions that emerge from the structure of the environment. Behavioral variables are not the same as activation variables. We will need to understand how neural dynamics with their activation states are linked to behavioral dynamics. That will be a major issue in this chapter. Finally, we will show how the combined neural and behavioral dynamics of an organism brings about autonomy. We will use the A-not-B paradigm of perseverative action to illustrate these ideas. Recall the Braitenberg vehicle evoked in the Introduction to Part I of the book. This is a conceptual organism defined by four things: It has sensors, effectors, a body linking the sensors to effectors mechanically, and a nervous system linking the sensor to effectors through activation variables. The organism is also …
Personalized Museum Experience: The Rijksmuseum Use Case

This paper describes ongoing work exploring aspects of personalized access to and presentation of virtual museum collections. The project demonstrator illustrates an interactive approach to collecting data about museum visitors in terms of their interests in and preferences about artefacts from the Rijksmuseum collection. This data is stored in user profiles used further to recommend routes through the museum and to guide the users towards artefacts related to their interests and preferences. The overall goal of the project is to explore different users' characteristics and personalize users' museum experiences within the Rijksmuseum virtual and physical collections.
Changes In Japanese Foreign Aid Policy

The main part of Japanese aid is directed to Asia and there has been a strong emphasis on economic infrastructure, that is building railways, roads and ports etc. Recently however there is a refocusing towards environmental aid and “softer” types of aid such as poverty alleviation and social infrastructure. ODA that used to be based on the request from the recipient countries has become much more politicised, with Japan itself making country assistance plans indicating what fields they are willing to provide aid in. This is not always popular with the recipient government as in the case of China. In this case it has actually made Japan’s already complex relation with China even more complicated. The paper will start with a short historic review of Japanese ODA policy and the characteristics of Japanese aid. This will be followed by an explanation of the changes going on in Japanese foreign aid policy and finally we will see how this how this effect aid to China and the role of aid in the future Japan-China relationship.
Life in Low Income Families in Scotland: Research Report

7. The combination of our research experience, the range of issues covered and our work across sectors makes CRFR well qualified to contribute to the Scottish Parlaiment’s Local Government and Communities Committee’s inquiry into child poverty in Scotland. This submission will discuss the importance of evidence-based policy development and will highlight CRFR research relevant to the debate about child poverty in Scotland.
Generalizing the AUGMENT combinator

The usual initial algebra semantics of inductive types provides a clear and uniform explanation for the FOLD combinator. In an APLAS 2004 paper [1], we described an alternative equivalent semantics of inductive types as limits of algebra structure forgetting functors. This gave us an elegant universal property based account of the BUILD and AUGMENT combinators, which form the core of the shortcut deforestation program transformation method by Gill et al. [2, 3]. Here we present further evidence for the flexibility of our approach by showing that a usefulAUGMENT-like combinator is definable for a far wider class of parameterized inductive types than free monads, namely for all monads arising from a parameterized monad via an initial algebra construction.
Robust H ∞ filtering for uncertain differential linear repetitive processes via LMIs and polynomial matrices

This paper is concerned with the full-order H∞ filtering problem for uncertain differential linear repetitive processes (LRPs). uncertain differential linear repetitive process (LRP) assumed to be stable along the pass, our attention is focused on the design of a full-order filter, which guarantees the filtering error process to be stable along the pass, and minimizes an upper bound for the H∞ norm of its transfer function. approach are proposed to solve the full-order H∞ filtering problem. Key–Words: Differential repetitive processes, H∞ filtering, Convex polytopic uncertainty.
MINIMAL PERFECT HASHING AND BLOOM FILTERS MADE PRACTICAL

The Bloom filter is a space-efficient data structure for storing an approximation S′ to a set S such that S ⊆ S′ and any element not in S belongs to S′ with probability at most ǫ. This problem happens in many areas and a Bloom filter has widespread use. In this paper we present a practical implementation of a theoretical result that provides the same functionality of a Bloom filter for static sets and uses a near-optimal space data structure based on recent results on perfect hashing by Botelho et al. (2007). The implementation outperforms the standard Bloom filter in space usage and construction time for false positive rates lower than or equal to ǫ ≤ 2 (≈ 1.56 out of one hundred). It also presents a better lookup time for ǫ ≤ 2 (≈ 6.25 out of one hundred) and presents a constant lookup time that does not depend on ǫ. However, we note that there are other variants of Bloom filters that are as compact as the one we consider here for static key sets. In this work our objective is to show an implementation of a theoretical result that can be used in practice and the original Bloom filter is a standard baseline for comparison.
Combinatorial Auctions: Complexity and Algorithms

In the following, we provide an overview of complexity inherent in the design of combinatorial auctions, and discuss how these challenges are addressed in various combinatorial auction formats. A combinatorial auction allows bidders to submit bids on bundles of objects and can be considered the pivotal example of a multiple object auctions. They also constitute a paradigmatic problem in algorithmic mechanism design. We provide an overview of both the computational complexity and strategic complexity inherent in the design of such auctions, and discuss how these challenges are addressed in various combinatorial auction formats. Keywords: combinatorial auction; computational complexity; strategic complexity; VCG mechanism
Aboriginal Public Servants: Leadership in the British Columbia Public Service

This thesis provides preliminary, qualitative research that explores whether there is a common understanding of Aboriginal public servant leadership within the British Columbia (BC) Public Service. An interpretive, grounded theory approach underpinned by attention to Indigenous methodologies was used in this thesis. Research was conducted using semi-structured interviews with 22 self-identified Aboriginal peoples within the BC Public Service. The results identify properties of three analytical perspectives of leadership that interact in the context of Aboriginal public servants in British Columbia: (1) individual; (2) Indigenous, traditional or family setting; and (3) bureaucracy/public service. A linking theme across these analytical perspectives, “it’s personal not individual”, is proposed that influences an approach that interviewed Aboriginal public servants use in their professional positions and in their daily life. This study concludes that although there is not one specific understanding of leadership among Aboriginal public servants, their personal commitment to improving the wellbeing of their peoples may be the basis for their leadership work to facilitate and build bridges of understanding between communities and government. In addition, there is a call to non-indigenous public servants to consider their own leadership and share responsibility for bridge building alongside their Aboriginal colleagues.
HEAT AND DUST IN ACTIVE LAYERS OF PROTOSTELLAR DISKS

Requirements for magnetic coupling and accretion in the active layer of a protostellar disk are re-examined, and some implications for thermal emission from the layer are discussed. The ionization and electrical conductivity are calculated following the general scheme of Ilgner and Nelson but with an updated UMIST database of chemical reactions and some improvements in the grain physics, and for the minimum-mass solar nebula rather than an alpha disk. The new limits on grain abundance are slightly more severe than theirs. Even for optimally sized grains, the layer should be at least marginally optically thin to its own thermal radiation, so that narrow, highly saturated emission lines of water and other molecular species would be expected if accretion is driven by turbulence and standard rates of ionization prevail. If the grain size distribution extends broadly from well below a micron to a millimeter or more, as suggested by observations, then the layer may be so optically thin that its cooling is dominated by molecular emission. Even under such conditions, it is difficult to have active layers of more than 10 g cm-2 near 1 AU unless dust is entirely eliminated or greatly enhanced ionization rates are assumed. Equipartition-strength magnetic fields are then required in these regions of the disk if observed accretion rates are driven by magnetorotational turbulence. Wind-driven accretion might allow weaker fields and less massive active layers but would not heat the layer as much as turbulence and therefore might not produce emission lines.
Neural context embeddings for automatic discovery of word senses

Word sense induction (WSI) is the problem of automatically building an inventory of senses for a set of target words using only a text corpus. We introduce a new method for embedding word instances and their context, for use in WSI. The method, Instance-context embedding (ICE), leverages neural word embeddings, and the correlation statistics they capture, to compute high quality embeddings of word contexts. In WSI, these context embeddings are clustered to find the word senses present in the text. ICE is based on a novel method for combining word embeddings using continuous Skip-gram, based on both se- mantic and a temporal aspects of context words. ICE is evaluated both in a new system, and in an extension to a previous system for WSI. In both cases, we surpass previous state-of-the-art, on the WSI task of SemEval-2013, which highlights the generality of ICE. Our proposed system achieves a 33% relative improvement.
The evolution of spoken language: a comparative approach

We are entering a new era in the study of the evolution of spoken language, where poorly-grounded speculation based mainly on fossil evidence is being superseded by comparative, empirical study of living animals. This is particularly true for the evolution of speech, where a variety of methodologies and theoretical constructs developed by speech scientists have been applied to animal vocalization, greatly deepening our understanding of the evolutionary precursors to speech. Animals both produce and perceive formants, and the descent of the larynx has both homologous and analogous equivalents in the animal world. Vocal imitation, which is key to spoken language, does not exist in other primates but is found in a far-flung group including birds, seals and dolphins. Despite some illuminating results, a vast menagerie of fascinating vocal adaptations exist in vertebrates that are just beginning to be explored. These provide a fertile field for research by speech scientists, who have the skills and theoretical background to lead bioacoustic research into the next millennium.
Output response compaction in RAS-based schemes

Scan design has been the backbone of design for testability schemes in industry because it provides for controllability and observability of the internal flip flops of the circuit. However, the serial scan causes high switching activity during testing which results in high power dissipation. Another problem that may appear in scan designs is unknown values, which can invalidate the final signature captured in the response verifier.
TREC 2013 Temporal Summarization

Unexpected news events such as earthquakes or natural disasters represent a unique information access problem where traditional approaches fail. For example, immediately after an event, the corpus may be sparsely populated with relevant content. Even when, after a few hours, relevant content is available, it is often inaccurate or highly redundant. At the same time, crisis events demonstrate a scenario where users urgently need information, especially if they are directly affected by the event. The goal of this track is to develop systems for efficiently monitoring the information associated with an event over time. Specifically, we are interested in developing systems which (1) can broadcast short, relevant, and reliable sentence-length updates about a developing event and (2) can track the value of important event-related attributes (e.g. number of fatalities). The track has the following goals,
Improved Graph Laplacian via Geometric Self-Consistency

We address the problem of setting the kernel bandwidth used by Manifold Learning algorithms to construct the graph Laplacian. Exploiting the connection between manifold geometry, represented by the Riemannian metric, and the Laplace-Beltrami operator, we set the bandwidth by optimizing the Laplacian's ability to preserve the geometry of the data. Experiments show that this principled approach is effective and robust.