Miracle-dz/UniFAR-FTUs huggingface dataset:
A Longitudinal EEG study of visual motion perception in full-term and preterm infants and children

1.0 Introduction . 1 2.0 Method . 11 2.1 Participants . 11 2.2 Experimental stimuli and paradigm . 12 2.3 Data acquisition . 13 2.4 Procedure . 14 2.5 Analyses . 15 2.5. 1 Data analyses. 15 2.5. 2 Peak analyses at the electrode level. 15 2.5. 3 Time-frequency analyses in brain space . 16 2.5. 4 Movement ABC. 17 3.0 Results . 19 3.1 VEP responses . 19 3.2 Latency analyses of VEPs . 21 3.3 Individual analyses of VEPs and M-ABC . 24 3.4 TSE analyses . 27 4.0 Discussion . 39 References . 51 Appendices . 71 Appendix A . 71 Appendix B . 72 Appendix C . 73 Appendix D . 76
Generating Toffoli networks from ESOP expressions

In this paper a new heuristic ESOP-based synthesis method for Toffoli networks is proposed. This synthesis method takes advantage of the shared-ESOP cubes among the outputs to generate a cascade of Toffoli gates. The method is suitable to generate circuits for functions with large number of input variables. A greedy approach is utilized to select pairs among the different outputs with common ESOP-cubes. The shared terms need only to be realized once and the result can then be transferred to the second output, and thus reducing the number of Toffoli gates. The synthesis algorithm has been applied to a set of benchmark functions. Experimental results show that the algorithm can generate circuits with reduced quantum cost for virtually all functions. Template applications can further improve the results.
Secure implementations of typed channel abstractions

The challenges hidden in the implementation of high-level process calculi into low-level environments are well understood [3]. This paper develops a secure implementation of a typed pi calculus, in which capability types are employed to realize the policies for the access to communication channels. Our implementation compiles high-level processes of the pi-calculus into low-level principals of a cryptographic process calculus based on the applied-pi calculus [1]. In this translation, the high-level type capabilities are implemented as term capabilities protected by encryption keys only known to the intended receivers. As such, the implementation is effective even when the compiled, low-level principals are deployed in open contexts for which no assumption on trust and behavior may be made. Our technique and results draw on, and extend, previous work on secure implementation of channel abstractions in a dialect of the join calculus [2]. In particular, our translation preserves the forward secrecy of communications in a calculus that includes matching and supports the dynamic exchange of write and read access-rights among processes. We establish the adequacy and full abstraction of the implementation by contrasting the untyped equivalences of the low-level cryptographic calculus, with the typed equivalences of the high-level source calculus.
In support of city exploration

The novel experience Anywhere allowed participants to explore an urban area, tying together information not normally available, new points of views and interaction embedded into physical places. Guided by 'unseen', on-the-street performers in an ongoing conversation maintained over mobile phones, they gained access to locative media and staged performances. Our analysis demonstrates how Anywhere produced engaging and uniquely personalised paths through a complex landscape of content, negotiated by the performer-participant pair around various conflicting constraints. We reflect our analysis through the lens of the key characteristics exhibited by mechanisms that support city exploration, before focussing on possible extensions to the technological support of teams of professional and amateur guides.
Animating Quadrupeds: Methods and Applications

Films like Shrek, Madagascar, The Chronicles of Narnia and Charlotte's web all have something in common: realistic quadruped animations. While the animation of animals has been popular for a long time, the technical challenges associated with creating highly realistic, computer generated creatures have been receiving increasing attention recently. The entertainment, education and medical industries have increased the demand for simulation of realistic animals in the computer graphics area. In order to achieve this, several challenges need to be overcome: gathering and processing data that embodies the natural motion of an animal – which is made more difficult by the fact that most animals cannot be easily motion‐captured; building accurate kinematic models for animals, with adapted animation skeletons in particular; and developing either kinematic or physically‐based animation methods, either by embedding some a priori knowledge about the way that quadrupeds locomote and/or adopting examples of real motion. In this paper, we present an overview of the common techniques used to date for realistic quadruped animation. This includes an outline of the various ways that realistic quadruped motion can be achieved, through video‐based acquisition, physics based models, inverse kinematics or some combination of the above.
Sensor source location privacy based on random perturbations

Sensor source location privacy, which means to protect source sensors' locations of network traffic, is an emerging topic in wireless sensor networks, because it cannot be fully addressed by traditional cryptographic mechanisms, such as encryption and authentication. Current source location privacy schemes, assuming either a local attack model or a global attack model, have limitations. For example, schemes under a global attack model are subject to a so called `01' attack. Targeting on solving this attack under a global attack model, we propose two perturbation schemes, one based on Uniform distribution and the other based on Gaussian distribution. We analyze the security properties of these two schemes. We also simulate them and compare them with previous schemes, with the results showing that the proposed perturbation schemes can improve the source location privacy significantly.
Kinect-based facial animation

In this demo we present our system for performance-based character animation that enables any user to control the facial expressions of a digital avatar in realtime. Compared to existing technologies, our system is easy to deploy and does not require any face markers, intrusive lighting, or complex scanning hardware. Instead, the user is recorded in a natural environment using the non-intrusive, commercially available Microsoft Kinect 3D sensor. Since high noise levels in the acquired data prevent conventional tracking methods to work well, we developed a method to combine a database of existing animations with facial tracking to generate compelling animations. Realistic facial tracking facilitates a range of new applications, e.g. in digital gameplay, telepresence or social interactions.
The effect of decision timing on the willingness to costly reward cooperation and punish noncooperation: Sanctioning the past, the present, or the future

Numerous studies have demonstrated that sanctions can promote cooperation. However, it is important to know not only that sanctions can work but also under what conditions people are actually willing to sanction cooperation positively (i.e., reward) or noncooperation negatively (i.e., punish). In this article, we demonstrate that people use sanctions less often and sanction more mildly when they decide about sanctioning before (instead of after) the occurrence of others' (non)cooperation (Experiments 1 and 2), regardless of whether they decide directly afterwards or after a time delay (Experiment 2). Moreover, we reveal that beforehand (as compared with afterwards) people have not yet formed clear sanctioning preferences (Experiment 3). These findings corroborate our reasoning that the decision environment beforehand induces nonconsequential reasoning and thereby hampers people's willingness to sanction. We discuss the theoretical, methodological, and practical implications of our work.
Efficient Estimation for the Accelerated Failure Time Model

The accelerated failure time model provides a natural formulation of the effects of covariates on potentially censored response variable. The existing semiparametric estimators are computationally intractable and statistically inefficient. In this article we propose an approximate nonparametric maximum likelihood method for the accelerated failure time model with possibly time-dependent covariates. We estimate the regression parameters by maximizing a kernel-smoothed profile likelihood function. The maximization can be achieved through conventional gradient-based search algorithms. The resulting estimators are consistent and asymptotically normal. The limiting covariance matrix attains the semiparametric efficiency bound and can be consistently estimated. We also provide a consistent estimator for the error distribution. Extensive simulation studies demonstrate that the asymptotic approximations are accurate in practical situations and the new estimators are considerably more efficient than the existing ones. Illustrations with clinical and epidemiologic studies are provided.
Automatic 3-D model synthesis from measured range data

We propose an algorithm to construct a 3-D surface model from a set of range data, based on non-uniform rational B-splines (NURBS) surface-fitting technique. It is assumed that the range data is initially unorganized and scattered 3-D points, while their connectivity is also unknown. The proposed algorithm consists of three stages: initial model approximation employing K-means clustering, hierarchical decomposition of the initial model, and construction of the NURBS surface patch network. The initial model is approximated by both a polyhedral and triangular model. Then, the initial model is represented by a hierarchical graph, which is efficiently used to construct the G/sup 1/ continuous NURBS patch network of the whole object. Experiments are carried out on synthetic and real range data to evaluate the performance of the proposed algorithm. It is shown that the initial model as well as the NURBS patch network are constructed automatically with tolerable computation. The modeling error of the NURBS model is reduced to 10%, compared with the initial mesh model.
Can network coding bridge the digital divide in the pacific?

The present study has its genesis in a longitudinal project aimed at determining long-term trends in jitter, packet loss and other observables on long-distance Internet paths [1]. The project also documents the challenges faced by users in remote locations with numerous nodes in various Pacific Island nations. This naturally poses the question how one might improve their connectivity. Bandwidth upgrades can address the bandwidth bottleneck to an extent, but do not address latency issues unless an island simultaneously upgrades to a lower latency connection, i.e., from a geostationary (GEO) to a medium earth orbit (MEO) satellite [2] or to a fibre-optic submarine cable.
The efficacy of problem-solving treatments after deliberate self-harm: meta-analysis of randomized controlled trials with respect to depression, hopelessness and improvement in problems

Background. Brief problem-solving therapy is regarded as a pragmatic treatment for deliberate self-harm (DSH) patients. A recent meta-analysis of randomized controlled trials (RCTs) evaluating this approach indicated a trend towards reduced repetition of DSH but the pooled odds ratio was not statistically significant. We have now examined other important outcomes using this procedure, namely depression, hopelessness and improvement in problems. Method. Six trials in which problem-solving therapy was compared with control treatment were identified from an extensive literature review of RCTs of treatments for DSH patients. Data concerning depression, hopelessness and improvement in problems were extracted. Where relevant statistical data (e.g. standard deviations) were missing these were imputed using various statistical methods. Results were pooled using meta-analytical procedures. Results. At follow-up, patients who were offered problem-solving therapy had significantly greater improvement in scores for depression (standardized mean difference =−0·36; 95% CI −0·61 to −0·11) and hopelessness (weighted mean difference =−3·2; 95% CI −4·0 to −2·41), and significantly more reported improvement in their problems (odds ratio = 2·31; 95% CI 1·29 to 4·13), than patients who were in the control treatment groups. Conclusions. Problem-solving therapy for DSH patients appears to produce better results than control treatment with regard to improvement in depression, hopelessness and problems. It is desirable that this finding is confirmed in a large trial, which will also allow adequate testing of the impact of this treatment on repetition of DSH.
On Power Allocation for Dual-Hop Amplify-and-Forward OFDM Relay Systems

The solutions to an optimal power allocation problem in dual-hop amplify-and-forward (non-regenerative) OFDM relay systems over given channel gains are provided with a joint transmit power constraint. We analytically derive the allocated power to each hop/subcarrier that satisfies the Karush-Kuhn-Tucker (KKT) conditions by solving simultaneous equations. The solutions imply that at most 3N - 1 possible power allocation candidates could exist on both source and relay nodes satisfying KKT conditions when N is the number of subcarriers. Based on the solution, a sub-optimal power allocation method that selects only significant allocated power in strong subcarriers is proposed and achieves higher capacity (achievable rate) than conventional sub-optimal methods. As for the feasibility, the number of candidates to be evaluated is N in the proposed method.
Resource allocation algorithm based on social relation for video streaming services over P2P network

In this paper, we propose an effective resource allocation algorithm based on social relation for video streaming services over Peer-to-Peer network. Our algorithm assigns limited peer resources to other participating peers. Efficient control of the limited resources is necessary because video streaming services need significantly more network bandwidths than traditional non-real-time data services. In addition to video quality, our algorithm is designed to take into account the user's social relation. We define novel sociability and trust models based on social relations obtained by analyzing Social Networking Services. Our proposed resource allocation algorithm allocates peer resources based on these models. Experimental results are presented to demonstrate the performance of our proposed algorithm.
Exchanges of Services Based on Piaget's theory of Social Exchanges Using a BDI-Fuzzy Agent Model

Piaget's theory of social exchanges has been used as the basis for the analysis of interactions in Multiagent Systems, allowing the modeling of interactions as services exchange processes between pairs of agents, followed by the evaluation of those services by the agents involved, producing the so-called social exchange values. The purpose of this work is to develop a BDI-Fuzzy agent model for the Jason platform, with abilities to assess qualitatively, subjectively the social exchanges values originated in the provision and in the receipt of non-economic services, based on Piaget's theory of social exchanges. An application to the simulation of exchange processes in a social organization, namely, the urban vegetable garden San Jerónimo (Seville, Spain) is presented.
Current State on Representation of Reference Architectures

Software architectures play a major role in determining system quality, since they form the backbone to any successful software-intensive system. In this context, reference architecture is a generic architecture for a class of software systems used as a foundation for the design of concrete architectures from this class. Because of their fundamental role, reference architectures need to be properly represented in order to be effectively used, and understood by all stakeholders. In this perspective, we have found initiatives proposing different approaches to represent them. However, there is a lack of detailed overview about all these approaches. In this work, we identify possibly all approaches used or proposed to represent reference architectures. For this, we have used a technique proposed by Evidence-Based Software Engineering (EBSE): the Systematic Review. As achieved results, we can observe different approaches adopted to represent reference architectures; however, there is no consensus about which are more adequate or their effectiveness. Based on this overview, interesting and important perspectives for future research can also be found.
Gradient estimates and the smooth convergence of approximate travelling waves for reaction-diffusion equations

The space derivatives of Freidlin's travelling wave like solutions of generalized KPP equations are considered in this paper. We give estimates of the first two space derivatives on the wave front and show that the travelling wave is nearly flat on the trough and on the crest. Differentiation of heat semigroups, logarithmic transformation and semi-classical analysis based on stochastic analysis are the main tools used here.
Adenosine generation catalyzed by CD39 and CD73 expressed on regulatory T cells mediates immune suppression

The study of T regulatory cells (T reg cells) has been limited by the lack of specific surface markers and an inability to define mechanisms of suppression. We show that the expression of CD39/ENTPD1 in concert with CD73/ecto-5′-nucleotidase distinguishes CD4+/CD25+/Foxp3+ T reg cells from other T cells. These ectoenzymes generate pericellular adenosine from extracellular nucleotides. The coordinated expression of CD39/CD73 on T reg cells and the adenosine A2A receptor on activated T effector cells generates immunosuppressive loops, indicating roles in the inhibitory function of T reg cells. Consequently, T reg cells from Cd39-null mice show impaired suppressive properties in vitro and fail to block allograft rejection in vivo. We conclude that CD39 and CD73 are surface markers of T reg cells that impart a specific biochemical signature characterized by adenosine generation that has functional relevance for cellular immunoregulation.
Design of Wind-solar Complementary Power System Based on Progressive Fuzzy Control

In order to make a wind-solar complementary power system be a self-intervention controller, a new fuzzy control approach to hybrid power generation in wind and solar co-generation system is developed in this paper. Firstly, a new kind of structure of wind-solar complementary power system is designed. The method of double-fed brushless wind turbine sets is adopted, based on the principle of nonlinear control theory, according to the external excitation caused by the nonlinear changes of wind forces and wind speeds, for the purpose of capturing the wind power in the greatest degree. Meanwhile, the idea of extensional adaptive control on solar cells is adopted, also in order to transform the renewable energy to electrical power to the most degree. Secondly, according to the analysis on the characteristics of the multi-input and multi-output of the distributed wind-solar complementary power system, a progressive fuzzy control algorithm based on fuzzy control method and adaptive control theory is put forward to control the loading and unloading process congruously among the wind turbines, the solar cells and the grid. Finally, the simulation study is carried out. It is shown that the new kind of wind-solar complementary power system can achieve the balance quite well between the supply and the demand of the electrical energy automatically according to the load of system, under the premise of improving the utilization rate of renewable resources as much as possible.
Peer coaching in a school in Cairo, Egypt

Purpose The purpose of this paper is to examine how peer coaching was introduced in one school in Egypt and to identify barriers and opportunities for successful implementation. Design/methodology/approach The methodology included semi-structured interviews with eight teachers, participant observation of their classes and meetings, and three focus group meetings with teachers and school administrators. Findings Ladyshewsky’s (2017) five key aspects of peer coaching are considered in the findings: establishing peer partners, building trust between the partners, identifying specific areas to target for learning, training on non-evaluative questions and feedback, and supporting each other as new ideas are attempted. Each aspect of these is reviewed in light of the implementation process in the school. Practical implications The study provides practical suggestions for teachers and school administrators that include considerations for implementation. Numerous connections are made to research on peer coaching that is relevant to the implementation of peer coaching in schools in Egypt and other countries in the Global South. Originality/value The study provides an examination of the implementation of peer coaching in a school in Egypt. Thus, it contributes to the limited literature on peer coaching in the Global South. The discussion and conclusion sections consider further questions and research opportunities for effective practices in peer coaching in international contexts.
Modification of UCT with Patterns in Monte-Carlo Go

Algorithm UCB1 for multi-armed bandit problem has already been extended to Algorithm UCT (Upper bound Confidence for Tree) which works for minimax tree search. We have developed a Monte-Carlo Go program, MoGo, which is the first computer Go program using UCT. We explain our modification of UCT for Go application and also the intelligent random simulation with patterns which has improved significantly the performance of MoGo. UCT combined with pruning techniques for large Go board is discussed, as well as parallelization of UCT. MoGo is now a top level Go program on 9× 9 and 13× 13 Go boards. Key-words: Computer Go, Exploration-exploitation, UCT, Monte-Carlo, Patterns ∗ projet TAO, INRIA-Futurs, LRI, Batiment 490, Université Paris-Sud 91405 ORSAY CEDEX, France † Centre de Mathématiques Appliquées, École Polytechnique, 91128 PALAISEAU CEDEX, France ‡ Centre de Mathématiques Appliquées, École Polytechnique, 91128 PALAISEAU CEDEX, France § projet TAO, INRIA-Futurs, LRI, Batiment 490, Université Paris-Sud 91405 ORSAY CEDEX, France Modification d’UCT avec motifs dans le Monte-Carlo Go Résumé : L’algorithme UCB1 pour le problème du bandit-manchot a récemment été étendu en l’algorithme UCT (Upper bound Confidence for Tree) pour la recherche arborescente min-max. Nous avons développé un joueur artificiel de Go, MoGo, basé sur des simulations Monte-Carlo, qui est le premier programme de Go utilisant UCT. Nous exposons notre modification de l’algorithme UCT pour l’application au jeu de Go, ainsi que l’utilisation de motifs dans les simulations aléatoires qui ont permis d’augmenter significativement le niveau de MoGo. Nous introduisons d’autre part des techniques d’élagage dans l’algorithme UCT pour les grands Goban, ainsi que de la parallélisation d’UCT. MoGo est maintenant un joueur artificiel de premier plan sur les Gobans de taille 9× 9 et 13× 13. Mots-clés : Joueurs artificiels de Go, Exploration-exploitation, UCT, Monte-Carlo, Motifs Modification of UCT with Patterns in Monte-Carlo Go 3