Miracle-dz/UniFAR-FTUs huggingface dataset:
social brain ’ ? Lessons from eye-gaze following , joint attention , and autism

The aim of this volume is to explore what it means to understand other minds. Drawing on philosophical, developmental, and psychological perspectives, the chapters in this book address a myriad of issues including how an understanding of minds develops, its significance for social interaction, and its relation to other social and cognitive achievements. Our chapter brings yet another perspective to bear on these issues. Taking a neuroscientific approach, our discussion centers on how understanding other minds – a central aspect of social-information processing – is represented in the brain. Currently in the literature there are two very different models of how the brain is organized for processing social information. One model, advocated by evolutionary psychologists, poses the existence of a 'social brain'. On this view, the human mind has evolved a set of domain-specific solutions to particular problems. As a consequence, there exists a set of mental systems for perceiving and reasoning about social stimuli, which act independently from the mental systems involved in perceiving and reasoning about non-social things. It is the content of the information – its social nature – that determines the dichotomy, rather than the structure of the problem (Cosmides & Tooby, 1992). These social modules are thought to be unique in their input (i.e., the information they process) as well as in their mechanism (i.e., the rules that govern their processing). Finally, their content-specificity is ostensibly caused by phylogenetic evolution rather than by familiarity, expertise, or ontogenetic development. In its neuroscientific strand, the
Morita base change in quantum groupoids

Let $L$ be a quantum semigroupoid, more precisely a $\times_R$-bialgebra in the sense of Takeuchi. We describe a procedure replacing the algebra $R$ by any Morita equivalent, or in fact more generally any $\sqrt{\text{Morita}}$ equivalent (in the sense of Takeuchi) algebra $S$ to obtain a $\times_S$-bialgebra $\widetilde H$ with the same monoidal representation category.
Spectral Clustering of Wikipedia Articles Using the Edit History

The spectral clustering algorithm is a powerful clustering algorithm that is known to give better clusterings than other algorithms such as k-means. Most spectral clustering scenarios require the computation of the distance between every pair of points in order to construct the similarity matrix that is the input to the spectral clustering algorithm. In fact, this similarity matrix construction step is one of the most expensive steps of the algorithm, sometimes taking significantly longer than the actual clustering. We study an optimization to this similarity matrix construction step. We apply the locality sensitive hashing algorithm which we use to approximately compute all pairs of near neighbors. We test our algorithm on the Wikipedia edit history dataset on which we define article similarity using the list of editors of each article. We find that using locality sensitive hashing results in a 10to 20fold decrease in the running time of the similarity matrix construction step without a significant decrease in the quality of the final clustering.
Digital life assistant using automated speech recognition

Physical interaction in order to provide commands or gain access to a computer system is now a history. Voice or speech stimulated systems are a part of modern Smartphone culture. Automatic Speech Recognition is an important application of artificial intelligence. This paper provides a brief description of what automatic speech recognition is its various types and a overview of how the process works. After a precise review of Hidden Markov Model (HMM) & Mel Spectrum Cestrum Coefficient (MFCC), this paper discusses about the history of this technology, future aspects and scope. Applications of the technology in various fields are also discussed.
The INT photometric H-alpha survey of the northern galactic plane

The Isaac Newton Telescope (INT) Photometric Halpha Survey of the Northern Galactic Plane (IPHAS) is a 1800-deg 2 CCD survey of the northern Milky Way spanning the latitude range -5° < b < + 5° and reaching down to r'~= 20 (10sigma). Representative observations and an assessment of point-source data from IPHAS, now underway, are presented. The data obtained are Wide Field Camera images in the Halpha narrow-band, and Sloan r' and i' broad-band filters. We simulate IPHAS (r'-Halpha,r'-i') point-source colours using a spectrophotometric library of stellar spectra and available filter transmission profiles: this defines the expected colour properties of (i) solar metallicity stars, without Halpha emission, and (ii) emission-line stars. Comparisons with observations of fields in Aquila show that the simulations of normal star colours reproduce the observations well for all spectral types earlier than M. A further comparison between colours synthesized from long-slit flux-calibrated spectra and IPHAS photometry for six objects in a Taurus field confirms the reliability of the pipeline calibration. Spectroscopic follow-up of a field in Cepheus shows that sources lying above the main stellar locus in the (r'- Halpha,r'-i') plane are confirmed to be emission-line objects with very few failures. In this same field, examples of Halpha deficit objects (a white dwarf and a carbon star) are shown to be readily distinguished by their IPHAS colours. The role IPHAS can play in studies of spatially resolved northern Galactic nebulae is discussed briefly and illustrated by a continuum-subtracted mosaic image of Shajn 147 (a supernova remnant, 3° in diameter). The final catalogue of IPHAS point sources will contain photometry on about 80 million objects. Used on its own, or in combination with near-infrared photometric catalogues, IPHAS is a major resource for the study of stellar populations making up the disc of the Milky Way. The eventual yield of new northern emission-line objects from IPHAS is likely to be an order of magnitude increase on the number already known.
Risk Aware Resource Allocation for Clouds

Cloud computing offers on-demand access to large-scale computing resources in a pay-as-you go manner. Market-based resource allocation mechanisms are gaining popularity among commercial cloud providers to deal with dynamically fluctuating resource demands. For example, the recently introduced Amazon EC2 spot instances allow users to bid for computing resources and thus control the cost vs. reliability trade-offs of their workloads. Although this promises significant cost reduction, it comes at an additional risk of price fluctuation. This will get worse as cloud computing gradually moves towards a free market system. We propose a novel approach that utilizes financial option theory to simultaneously mitigate risk and minimize cost for cloud users. We formulate the cloud user optimization problem and mathematically characterize the cost of using European style options for clouds. We also propose a novel on-line policy using American options that outperforms base-line spot policies in terms of price variance reduction against high risk factors. We present trace-driven simulation experiments to support our results.
Energy efficient distributed interacting multiple model filter in UWSNs

This paper deals with the problem of tracking a target, which has a sinusoidal trajectory, moving through the environment of underwater wireless sensor networks (UWSNs). This paper addresses the issues of estimating the states of the target, improving energy efficiency by using a distributed architecture. Each underwater wireless sensor node composing the UWSNs is battery-powered, so the energy conservation problem is a critical issue. This paper provides algorithms increasing the energy efficiency of each sensor node by using the proposed Wake-up/Sleep (WuS) and Valid Measurement Selecting (VMS) schemes. An interacting multiple model (IMM) filter is applied to the proposed distributed architecture in order to cope with a target maneuver. Simulation results illustrate the performance of the proposed tracking filter.
Nest predation increases with parental activity: separating nest site and parental activity effects

Alexander Skutch hypothesized that increased parental activity can increase the risk of nest predation. We tested this hypothesis using ten open-nesting bird species in Arizona, USA. Parental activity was greater during the nestling than incubation stage because parents visited the nest frequently to feed their young during the nestling stage. However, nest predation did not generally increase with parental activity between nesting stages across the ten study species. Previous investigators have found similar results. We tested whether nest site effects might yield higher predation during incubation because the most obvious sites are depredated most rapidly. We conducted experiments using nest sites from the previous year to remove parental activity. Our results showed that nest sites have highly repeatable effects on nest predation risk; poor nest sites incurred rapid predation and caused predation rates to be greater during the incubation than nestling stage. This pattern also was exhibited in a bird species with similar (i.e. controlled) parental activity between nesting stages. Once nest site effects are taken into account, nest predation shows a strong proximate increase with parental activity during the nestling stage within and across species. Parental activity and nest sites exert antagonistic influences on current estimates of nest predation between nesting stages and both must be considered in order to understand current patterns of nest predation, which is an important source of natural selection.
Sweep Strategies for a Vacuum Cleaning Sensory-driven, Behavior-based Agent

In the Machine Intelligence Laboratory, University of Florida, we have built a small autonomous robot and programmed it to exhibit various reactive behaviors. The robot, named Gator, performs area coverage in an interior room by combining distinct behaviors. Gator has 26 sensors of which only 7 are used in the coverage algorithms examined here. Gator's behaviors allow it to avoid obstacles, follow walls, seek open areas and break out of confined areas. In the limited number of experiments performed here it appears that the best coverage algorithm among those tried consisted of a random walk with a probability of 0.05 for following a wall after each encounter with an obstacle. After 20 minutes about 85% of the floor space was covered with an efficiency close to 85%.
Simple, Accurate, Analytical Time Modeling and Optimal Tile Size Selection for GPGPU Stencils

Stencil computations are an important class of compute and data intensive programs that occur widely in scientific and engineeringapplications. A number of tools use sophisticated tiling, parallelization, and memory mapping strategies, and generate code that relies on vendor-supplied compilers. This code has a number of parameters, such as tile sizes, that are then tuned via empirical exploration. We develop a model that guides such a choice. Our model is a simple set of analytical functions that predict the execution time of the generated code. It is deliberately optimistic, since tile sizes and, moreover, the optimistic assumptions are intended to enable we are targeting modeling and parameter selections yielding highly tuned codes. We experimentally validate the model on a number of 2D and 3D stencil codes, and show that the root mean square error in the execution time is less than 10% for the subset of the codes that achieve performance within 20% of the best. Furthermore, based on using our model, we are able to predict tile sizes that achieve a further improvement of 9% on average.
2 Potentials of a Hertzian Dipole in the Lorenz Gauge

1 Problem Give expressions for the potentials of a Hertzian (point) oscillating dipole in various gauges. As deduced in eq. (16) of [3], a formal expression for the vector potential in the any other gauge is given in terms of the Lorenz-gauge potentials, and the scalar potential in the other gauge, as A(r, t) = A (L) + ∇χ = A (L) (r, t) + c∇ t −∞ [V (L) (r, t) − V (r, t)] dt = A (L) (r, −∞) − c t −∞ [E(r, t) + ∇V (r, t)] dt. (1) We first review the potentials in the Lorenz gauge [1] (see, for example, Chap. 9 of [2]), and then transform these into other gauges following the prescription (1). This section follows [4]. We consider a time-dependent point electric dipole pp 0 e −iωt , centered at the origin, as defined by p(t) = lim q→∞, d→0, qd=p q(t)d, (2) for which the associated electric charge density ρ can be written (r, t) = lim q→∞, d→0, qd=p q(t)[δ 3 (r − d/2) − δ 3 (r − d/2) = p(t) · ∇δ 3 (r). (3) The current density J is related by the equation of continuity, ∇ · J(r, t) = − ∂∂(r, t) ∂t = ˙ p(t) · ∇δ 3 (r) = ∇ · [ ˙ p(t)δ 3 (r)], (4) so that J(r, t) = ˙ p(t)δ 3 (r).
Issues in the assessment of personality disorders

Four issues relevant to personality disorder assessment are reviewed and recommendations for future direction of assessment procedures are made. First, it is argued that procedures should be theory based; interpersonal and cognitive conceptions of the pathological processes in personality disorders are sufficiently developed for assessment; dynamic and biobehavioral theories, while promising, need further conceptual and methodological work. Second, the nature of Axis I-axis II relationships should be characterized in assessments, using several time points. Third, personality disorder assessments should incorporate measures of the «Big Five» personality dimensions. Finally, dimensional approaches are more useful than categorical methods for research and conceptual development at this time
Problems Encountered in Measuring Single- and Multifactor Productivity

The slowdown in productivity growth since the early 1970's in many countries has stimulated and renewed interest in the causes of productivity change . The observation that there has been a slowdown has generally centered on the traditional indicator of productivity-output per unit of labor input, or labor productivity . Labor productivity-the relationship between output and labor input-has been the most prevalent measure of productivity for a variety of reasons . First, labor is involved in all aspects of production and generally has been the most important factor in the production process . Second, labor input is the most readily measurable of the various production factors .
e-Motion: A System for the Development of Creative Animatics

This paper introduces e-Motion, a software system for the creation of animatics 1 , which are important tools within the process of creation of animated graphics for TV. This type of animation, generated by the system from plots in plain text, allows production teams to envision how a final motion graphics piece can be developed. We argue that our system plays a creative role within the generative process. Specifically, our work is linked to a real production team, involved in the creation of animated shorts, called Imaginantes, for Mexican television.
Architectures for Web Based Applications

The web is being used for applications that contain significant business logic complexity and have considerable user interface requirements. The ad hoc enhancements that have made web application software possible (such as CGI and JavaScript) have created an application support infrastructure that makes application software upgrades and maintenance very complicated. Furthermore, the web has particularly poor support for complex user interfaces. The fundamental request-reply nature of HTTP means that it is difficult to avoid artificial segmentation of an application’s execution and user interface. Event-driven user interfaces are commonly used in traditional non-distributed applications. Unfortunately, the limitations of the existing web infrastructure mean that purely event-based user interaction is unsuitable within web applications. Nevertheless, we believe that integrating event-based user interaction in certain parts of a large web application will have positive effects if a suitable architecture is used. In this paper, we explore an architecture that accommodates a partial integration of an event-driven user interface and hides some of the ad hoc web infrastructure. We also suggest ways in which eventbased interaction can be incorporated within a web application framework such as J2EE.
Obstacle Avoidance System for Autonomous Transportation Vehicle Based on Image Processing

The labor shortage and the aging problem of farmers are serious problem for Japanese agriculture. In order to solve those problems, this research suggested that the smart mechanization system should play an important role for food production. The Autonomous Transportation Vehicles (ATVs) has a possibility to achieve this task. ATVs was applied with a CCD camera for vehicle control (i.e. for straight running, turning and emergency stop). We reported here how to recognize an obstacle for safe running by image processing. Hue, Saturation and Intensity were applied for obstacle recognition parameters and a binary image was produced by image processing. Finally, distance information (i.e. between vehicle and obstacle) was estimated using coordinate transformation between camera coordinate and vehicle coordinate. Experiments, indicated the obstacle recognition method could detect obstacles under the both sunny and cloudy condition. The error of distance estimation was within 0.3m and its processing speed was 5.9 frame/s.
High-speed multioperand decimal adders

There is increasing interest in hardware support for decimal arithmetic as a result of recent growth in commercial, financial, and Internet-based applications. Consequently, new specifications for decimal floating-point arithmetic have been added to the draft revision of the IEEE-754 Standard for floating-point arithmetic. This paper introduces and analyzes three techniques for performing fast decimal addition on multiple binary coded decimal (BCD) operands. Two of the techniques speculate BCD correction values and correct intermediate results while adding the input operands. The first speculates over one addition. The second speculates over two additions. The third technique uses a binary carry-save adder tree and produces a binary sum. Combinational logic is then used to correct the sum and determine the carry into the next more significant digit. Multioperand adder designs are constructed and synthesized for four to 16 input operands. Analyses are performed on the synthesis results and the merits of each technique are discussed. Finally, these techniques are compared to several previous techniques for high-speed decimal addition.
Are Socioeconomically Integrated Schools Equally Effective for Advantaged and Disadvantaged Students?

Socioeconomic integration in schools has been shown to bring positive academic and nonacademic outcomes to disadvantaged students attending them. The academic benefits of integration on advantaged students are, by contrast, less evident. Effective integrated schools are those that promote disadvantaged students’ outcomes yet advantaged students do not experience a loss in their outcomes. This article draws on data from more than 70 countries to find organizational and national contexts where integrated schools promote the achievement of disadvantaged students while also promoting the achievement of advantaged students. Using propensity score matching techniques and PISA 2009 data, results show that effective integrated schools are elusive, although they can be found in the context of large schools, large class sizes, and some degree of within-school tracking. Effective integrated schools exist in a handful of countries.
Multi-robot Box-pushing: Single-Agent Q-Learning vs. Team Q-Learning

In this paper, two types of multi-agent reinforcement learning algorithms are employed in a task of multi-robot box-pushing. The first one is a direct extension of the single-agent Q-learning, which does not have a solid theoretical foundation because it violates the static environment assumption of the Q-learning algorithm. The second one is the Team Qlearning algorithm, which is a multi-agent reinforcement learning algorithm, and is proved to converge to the optimal policy. The states, actions, and reward function of the algorithms are presented in the paper. Based on the two Q-learning algorithms, a fully distributed multi-robot system is developed. Computer simulations are carried out using the developed system. The simulation results show that the two algorithms are effective in a simple environment. It is shown, however, that the single-agent Q-learning algorithm does a better job than the team Q-learning algorithm in a complicated and unknown environment with many obstacles
A predictive model for Si-based circular spiral inductors

The electromagnetic behaviour of Si-based circular spiral inductors is analysed by using a mapping onto a system of concentric rings. The corresponding field equations are solved exactly within the quasi-one-dimensional approximation. The solution is then presented as an equivalent lumped-element model where substrate RF losses are accounted for by nonlocal mutual resistances. The results are in good agreement with experimental data.
Transfer Function based Flexible Graph Layout

Most graph layout algorithms strive to present an uncluttered view of the graph that reflects the structural relationship between nodes and edges comprising the graph. Very few focus on providing a layout that integrates graph structure with attribute values associated with a node or edge. To fill this gap, we propose an interactive force-directed graph layout strategy that adaptively draws graphs taking into account the attributes of the nodes and edges. The main contribution of this paper is the flexible design of transfer functions based on node attributes to alter the effects of different forces on the graph layout. By editing the transfer functions according to some guidelines, we can get different layouts in a flexible manner. The flexibility of the transfer functions allows one to create clustering based on node attributes as well as other layouts that show influence from both graph structure and node attributes. As graphs get larger and more complex, the flexibility for exploring different relational properties of graph elements will allow us to understand them better. Our experimental results demonstrate the effectiveness of exploring different datasets using transfer functions.
WEON: towards a software ecosystem ONtology

The natural distributed character of software ecosystems calls for a shared conceptualization and language to describe their architecture and their evolution. In this regards, ontologies play a central role. In this paper: we argue in favor of such an approach by showing that there is succesful experience applying ontologies to the fields of software engineering and software architecture; show the issues arising in ecosystem evolution and the needs for higher levels of formalization of the description of such processes; finally, we present a roadmap to develop an ontology for this area.
The ‘diaspora’ diaspora

As the use of ‘diaspora’ has proliferated in the last decade, its meaning has been stretched in various directions. This article traces the dispersion of the term in semantic, conceptual and disciplinary space; analyses three core elements that continue to be understood as constitutive of diaspora; assesses claims made by theorists of diaspora about a radical shift in perspective and a fundamental change in the social world; and proposes to treat diaspora not as a bounded entity but as an idiom, stance and claim.