Miracle-dz/UniFAR-FTUs huggingface dataset:
The role of metacognitive skills in learning to solve problems

denken, vooral voor meisjes 2004-08 Joop Verbeek(UM) Politie en de Nieuwe Internationale Informatiemarkt, Grensregionale politiële gegevensuitwisseling en digitale expertise 2004-09 Martin Caminada (VU) For the Sake of the Argument; explorations into argument-based reasoning 2004-10 Suzanne Kabel (UvA) Knowledge-rich indexing of learning-objects 2004-11 Michel Klein (VU) Change Management for Distributed Ontologies 2004-12 The Duy Bui (UT) Creating emotions and facial expressions for embodied agents 2004-13 Wojciech Jamroga (UT) Using Multiple Models of Reality: On Agents who Know how to Play 2004-14 Paul Harrenstein (UU) Logic in Conflict. Logical Explorations in Strategic Equilibrium 2004-15 Arno Knobbe (UU) Multi-Relational Data Mining 2004-16 Federico Divina (VU) Hybrid Genetic Relational Search for Inductive Learning 2004-17 Mark Winands (UM) Informed Search in Complex Games 2004-18 Vania Bessa Machado (UvA) Supporting the Construction of Qualitative Knowledge Models 2004-19 Thijs Westerveld (UT) Using generative probabilistic models for multimedia retrieval 2004-20 Madelon Evers (Nyenrode) Learning from Design: facilitating multidisciplinary design teams 2005-01 Floor Verdenius (UvA) Methodological Aspects of Designing Induction-Based Applications 2005-02 Erik van der Werf (UM) AI techniques for the game of Go 2005-03 Franc Grootjen (RUN) A Pragmatic Approach to the Conceptualisation of Language 2005-04 Nirvana Meratnia (UT) Towards Database Support for Moving Object data 2005-05 Gabriel Infante-Lopez (UvA) Two-Level Probabilistic Grammars for Natural Language Parsing 2005-06 Pieter Spronck (UM) Adaptive Game AI 2005-07 Flavius Frasincar (TUE) Hypermedia Presentation Generation for Semantic Web Information
Resource-Minimized Channel Assignment for Multi-Transceiver Wireless Networks

In this paper, we examine the problem of channel assignment in multi-hop wireless networks in which each node is equipped with multiple transceivers. We summarize various approaches to transceiver channel assignment. Most approaches in the literature seek to assign a channel to each available transceiver. In contrast, we seek to achieve a baseline connected topology that conserves resources, keeping some fraction of the transceivers inactive so as to dynamically react to changing traffic stimuli. We call our scheme resource-minimized channel assignment (RMCA). We show that RMCA achieves basic network connectivity and low interference, while using fewer resources compared to other protocols, and performs well under varied node density and number of transceivers per node. Finally, we evaluate several channel assignment schemes through simulation using a set of widely-accepted networking and graph- theoretic metrics.
Tree Stumps, Manhole Covers and Rubbish Tins

The physical features of a primary school playground – dimensions, textures, furnishings, etc. – are incorporated and adapted for their own purposes by children in their free play. Youngsters create an intricate network of usage, play-lines invisible but known to every child at the school. Unfortunately, the general adult indifference to children’s playlore often results in a lack of consultation with the playground’s users when well-meaning but ignorant ‘landscaping’ of a school playground is undertaken.
Steady-State and Transient Performance Analysis for Universal Motors With Appropriate Turns Ratio of Lead Coils to Lag Coils

This paper presents a novel steady-state and transient performance analysis of the universal motors with appropriate turns ratio of lead coils to lag coils in an armature. Time-stepping finite-element analysis has been used to successfully predict the brush-to-bar voltage drop of the universal motor. The computed armature current and speed have been validated by tests in a 500-W universal motor. The turns ratio of lead coils to lag coils minimizing the brush-to-bar voltage drop has been determined from the simulation results.
Common problems in delay-based congestion control algorithms: a gallery of solutions

Although delay-based congestion control protocols such as FAST Transmission Control Protocol (TCP) promise to deliver better performance than traditional TCP Reno, they have not yet been widely incorporated to the Internet. Several factors have contributed to their lack of deployment. Probably, the main contributing factor is that they are not able to compete fairly against loss-based congestion control protocols. In fact, the transmission rate in equilibrium of delay-based approaches is always less than their fair share when they share the network with traditional TCP Reno derivatives that employ packet losses as their congestion signal. There are also other performance impairments caused by the sensitivity to errors in the measurement of the congestion signal (queuing delay) that reduce the efficiency and the intra-protocol fairness of the algorithms. In this paper, we report, analyse and discuss some recent proposals in the literature to improve the dynamic behaviour of delay-based congestion control algorithms, FAST in particular. The coexistence of sources reacting differently to congestion, the identification of congestion appearance in the reverse path and the persistent congestion problem are the issues specifically addressed. Copyright © 2011 John Wiley & Sons, Ltd.
A Flexible and Scalable Structure to Compensate Frequency Response Mismatches in Time-Interleaved ADCs

In this paper, we present a flexible and scalable structure to compensate frequency response mismatches in time-interleaved analog-to-digital converters (TI-ADCs). The flexibility of the structure allows for designing compensation filters independent of the number of channels that can achieve any desired signal-to-noise ratio due to the scalability of the structure. Therefore, the compensation structure may be used to compensate time-varying frequency response mismatches in TI-ADCs, as well as to reconstruct uniform samples from nonuniformly sampled signals. We analyze the compensation structure, investigate its performance, and demonstrate application areas of the structure through numerous examples.
The Tangent Analogues of the Chebyshev Polynomials

We study the tangent analogues tan(n arctanx) of the Chebyshev polynomials from an algebraic viewpoint. They are rational functions of a pleasant form and enjoy several noteworthy properties: a useful composition law, their numerators pn(x) split into the minimal polynomials of the numbers tan kπ/n, they define the elements of the Galois groups of these minimal polynomials, and their algebraic and number theoretic properties strongly parallel those of the roots of unity. We give a complete factorization of the polynomials pn(x) in Z[x], give several applications, and list some open problems.
Audio declipping with social sparsity

We consider the audio declipping problem by using iterative thresholding algorithms and the principle of social sparsity. This recently introduced approach features thresholding/shrinkage operators which allow to model dependencies between neighboring coefficients in expansions with time-frequency dictionaries. A new unconstrained convex formulation of the audio declipping problem is introduced. The chosen structured thresholding operators are the so called windowed group-Lasso and the persistent empirical Wiener. The usage of these operators significantly improves the quality of the reconstruction, compared to simple soft-thresholding. The resulting algorithm is fast, simple to implement, and it outperforms the state of the art in terms of signal to noise ratio.
On interference alignment for symmetrically connected interference networks with line of sight channels at finite powers

In this work, interference alignment for a class of Gaussian interference networks with general message demands, having line of sight (LOS) channels, at finite powers is considered. We assume that each transmitter has one independent message to be transmitted and the propagation delays are uniformly distributed between 0 and (L - 1) (L >; 0). If receiver-j, j ∈{1,2,. , J}, requires the message of transmitter-i, i ∈ {1, 2, . , K}, we say (i, j) belongs to a connection. A class of interference networks called the symmetrically connected interference network is defined as a network where, the number of connections required at each transmitter-i is equal to c<sub>t</sub> for all i and the number of connections required at each receiver-j is equal to c<sub>r</sub> for all j, for some fixed positive integers c<sub>t</sub> and c<sub>r</sub>. For such networks with a LOS channel between every transmitter and every receiver, we show that an expected sum-spectral efficiency (in bits/sec/Hz) of at least K/(e+c<sub>1</sub>-1)(c<sub>t</sub>+1) (c<sub>t</sub>/c<sub>t</sub>+1)<sup>ct</sup> log2 (1+min<sub>(i, j)∈c</sub>|h<sub>i, j</sub>|<sup>2</sup> P/WN<sub>0</sub>) can be achieved as the number of transmitters and receivers tend to infinity, i.e., K, J →∞ where, C denotes the set of all connections, h<sub>ij</sub> is the channel gain between transmitter-i and receiver-j, P is the average power constraint at each transmitter, W is the bandwidth and N<sub>0</sub> W is the variance of Gaussian noise at each receiver. This means that, for an LOS symmetrically connected interference network, at any finite power, the total spectral efficiency can grow linearly with K as K, J →∞. This is achieved by extending the time domain interference alignment scheme proposed by Grokop et al. for the k-user Gaussian interference channel to interference networks.
A Low-Cost Low-Power All-Digital Spread-Spectrum Clock Generator

In this brief, a low-cost low-power all-digital spread-spectrum clock generator (ADSSCG) is presented. The proposed ADSSCG can provide an accurate programmable spreading ratio with process, voltage, and temperature variations. To maintain the frequency stability while performing triangular modulation, the fast-relocked mechanism is proposed. The proposed fast-relocked ADSSCG is implemented in a standard performance 90-nm CMOS process, and the active area is 200 μm × 200 μm. The experimental results show that the electromagnetic interference reduction is 14.61 dB with a 0.5% spreading ratio and 19.69 dB with a 2% spreading ratio at 270 MHz. The power consumption is 443 μW at 270 MHz with a 1.0 V power supply.
Recommendation System with ReaderBench : The Graphical Visualization of Semantically Related Papers and Concepts Ionut

The task of tagging papers with semantic metadata in order to analyze their relatedness represents a good foundation for a paper recommender system. The analysis from this paper extends from previous research in order to create a graph of papers from a specific domain with the purpose of determining each article's importance within the considered corpus of papers. Moreover, as non-latent representations are powerful when used in conjunction with latent ones, our system retrieves semantically close words, not present in the paper, in order to improve the retrieval of papers. Our previous analyses used the semantic representation of papers in different semantic models with the purpose of creating visual graphs based on the semantic relatedness links between the abstracts. The current analysis takes a step forward by proposing a model that can suggest which papers are of the highest relevance, share similar concepts, and are semantically related with the initial query. Our study is performed using paper abstracts in the field of information technology extracted from the Web of Science citation index. The research includes a use case and its corresponding results by using interactive and exploratory network graph representations.
Non-baroreflex mediated heart rate variability causes overestimation of baroreflex sensitivity

Spectral assessment of baroreflex sensitivity (BRS) is hampered by non-baroreflex mediated heart rate variability (HRV), which adds to the baroreflex mediated HRV. Relating HRV (baroreflex output) to blood pressure variability (BPV, baroreflex input) may therefore yield BRS values that are too large. The authors propose to overcome this problem by computing BRS in the Mayer waves (0.05-0.15 Hz), while keeping the non-baroreflex mediated HRV in the high frequency band by 15/min (0.25 Hz) metronome breathing.
A new approach for designing a smart glove for Arabic Sign Language Recognition system based on the statistical analysis of the Sign Language

In Arab countries, the hearing impaired people exceeds 10 million. In Egypt, the number of hearing-impaired people is around 4 million. So Sign language is important for facilitating communication between hearing impaired and the rest of society, but not all the rest of society know this language so, a new approach is suggested for designing a smart glove that can be used as a part of an electronic system to translate the sign language into a spoken or written language. This design covers all Arabic sign language signs (words level) by using a little number of sensors as possible. The design is driven by statistical analysis for all words of Arabic sign language in terms of single hand, double hands movement, single stage, multi-stage movement signs, fingers angle, and orientation. This paper covers the statistical analysis results and explains the proposed design using simulation model.
Learning hill-climbing functions as a strategy for generating behaviors in a mobile robot

International Conference on Simulation of Adaptive Behavior Cambridge, MA: MIT Press/Bradford Books, 1991. Learning Hill-Climbing Functions as a Strategy for Generating Behaviors in a Mobile Robot David Pierce Department of Computer Sciences University of Texas at Austin Austin, TX 78712 (dmpierce@cs.utexas.edu) Benjamin Kuipers Department of Computer Sciences University of Texas at Austin Austin, TX 78712 (kuipers@cs.utexas.edu) Abstract We consider the problem of a robot with uninterpreted sensors and e ectors which must learn, in an unknown environment, behaviors (i.e., sequences of actions) which can be taken to achieve a given goal. This general problem involves a learning agent interacting with a reactive environment: the agent produces actions that a ect the environment and in turn receives sensory feedback from the environment. The agent must learn, through experimentation, behaviors that consistently achieve the goal. The di culty lies in the fact that the robot does not know a priori what its sensors mean, nor what e ects its motor apparatus has on the world. We propose a method by which the robot may analyze its sensory information in order to derive (when possible) a function de ned in terms of the sensory data which is maximized at the goal and which is suitable for hillclimbing. Given this function, the robot solves its problem by learning a behavior that maximizes the function thereby resulting in motion to the goal. 1 The credit assignment problem The learning problem addressed in this paper is illustrated in Figure 1. The learning agent, which we are calling a \critter," receives sensory input (vector s) from the world and acts on the world via motor outputs (represented by a, the action vector). In addition, the critter has access to a reward signal, r, by which it knows when it has achieved its goal. (In the experiments discussed later, the reward signal is incorporated into the sense vector for simplicity.) The critter's task is to learn a behavior which reliably achieves the goal. This behavior is a sequence of actions (most likely dependent on the concomitant sequence of sense vectors) which takes the r s a CRITTER
Measuring Relationship Quality in an International Study

Objective: This study reports on the operationalization and testing of the newly developed Relationship Quality (RQ) scale, designed to assess an individual’s perception of his or her RQ in their current partnership. Methods: Data were generated through extended sampling from an original U.K.-based research project, Enduring Love? Couple relationships in the 21st century. This mixed methods study was designed to investigate how couples experience, understand, and sustain their long-term relationships. This article utilizes the cross-sectional, community sample (N = 8,132) from this combined data set, drawn primarily from the United Kingdom, United States, and Australia. A two-part approach to scale development was employed. An initial 15-item pool was subjected to exploratory factor analysis leading into confirmatory factor analysis using structural equation modeling. Results: The final 9-item scale evidenced convergent construct validity and known-groups validity along with strong reliability. Conclusion: Implications for future research and professional practice are discussed.
Visual Case-Based Reasoning II: Transfer and Adaptation

Case-based problem solving refers to reasoning about new problems by reusing past cases. Visual case-based problem solving pertains to reuse of past cases that contain only visual knowledge. In this paper, we explore the problem of automated adaptation of diagrammatic cases, i.e., automatic transfer of diagrammatic knowledge from a source case to a target problem. We describe Galatea, a computer program that adapts diagrammatic cases. Galatea explicitly represents knowledge states in the source case in the form of propositions, and transfers visual transformations from the source case to the target problem. A companion paper in the same conference [15] addresses the task of retrieving diagrammatic cases.
Optical Topography with Near-Infrared Spectroscopy During a Verbal-Fluency Task

Abstract: In this study we investigated the changes in brain oxygenation in 22 subjects during a verbal fluency task (VFT) using multichannel near-infrared spectroscopy (NIRS). To assess topographical effects in more detail we measured over bilateral prefrontal and over the left frontolateral cortex in 11 subjects. We found significantly higher increases in O2HB, as a sign of cerebral activation, during the VFT compared to a verbal repetition control task over the left prefrontal and the inferior left lateral brain areas. These results underscore the value of NIRS to assess functional brain activation during cognitive tasks. Furthermore, it shows the advantage of multichannel compared to previously used single channel NIRS measurements.
What is the Best Feature Learning Procedure in Hierarchical Recognition Architectures?

(This paper was written in November 2011 and never published. It is posted on arXiv.org in its original form in June 2016). Many recent object recognition systems have proposed using a two phase training procedure to learn sparse convolutional feature hierarchies: unsupervised pre-training followed by supervised fine-tuning. Recent results suggest that these methods provide little improvement over purely supervised systems when the appropriate nonlinearities are included. This paper presents an empirical exploration of the space of learning procedures for sparse convolutional networks to assess which method produces the best performance. In our study, we introduce an augmentation of the Predictive Sparse Decomposition method that includes a discriminative term (DPSD). We also introduce a new single phase supervised learning procedure that places an L1 penalty on the output state of each layer of the network. This forces the network to produce sparse codes without the expensive pre-training phase. Using DPSD with a new, complex predictor that incorporates lateral inhibition, combined with multi-scale feature pooling, and supervised refinement, the system achieves a 70.6\% recognition rate on Caltech-101. With the addition of convolutional training, a 77\% recognition was obtained on the CIfAR-10 dataset.
Conflict management styles of Turkish managers

Purpose – The aim of this study is to determine Turkish managers' conflict styles in different sectors, namely durable consumer goods, aviation, automotive and banking.Design/methodology/approach – A total of 130 managers' conflict management styles were assessed by applying the Rahim's 1983 Organizational Conflict Inventory‐II.Findings – First, integrating and, second, compromising are found to be the most preferred conflict styles of Turkish managers. The other important finding is that preferring obliging styles of conflict management changes according to the status of managers. Obliging is mostly used when the conflict partner has an upper level status.Research limitations/implications – Additional data from cross‐cultural studies are needed to form a comprehensive understanding of conflict management styles. Also, the number of respondents in the study is not enough to generalize the findings; additional data from different sectors could make the findings more valid.Practical implications – There see.
Social defaults : Observed choices become choice defaults

Defaults effects can be created by social contexts. The observed choices of others can become social defaults, increasing their choice share. Social default effects are a novel form of social influence not due to normative or informational influence: participants were more likely to mimic observed choices when choosing in private than in public (experiment 1) and when stakes were low rather than high (experiment 2). Like other default effects, social default effects were greater for uncertain rather than certain choices (experiment 3) and were weaker when choices required justification (experiment 4). Social default effects appear to occur automatically as they become stronger when cognitive resources are constrained by time pressure or load, and they can be sufficiently strong to induce preference reversals (experiments 5 and 6).
Opposing microtubule motors drive robust nuclear dynamics in developing muscle cells

Summary Dynamic interactions with the cytoskeleton drive the movement and positioning of nuclei in many cell types. During muscle cell development, myoblasts fuse to form syncytial myofibers with nuclei positioned regularly along the length of the cell. Nuclear translocation in developing myotubes requires microtubules, but the mechanisms involved have not been elucidated. We find that as nuclei actively translocate through the cell, they rotate in three dimensions. The nuclear envelope, nucleoli and chromocenters within the nucleus rotate together as a unit. Both translocation and rotation require an intact microtubule cytoskeleton, which forms a dynamic bipolar network around nuclei. The plus- and minus-end-directed microtubule motor proteins, kinesin-1 and dynein, localize to the nuclear envelope in myotubes. Kinesin-1 localization is mediated at least in part by interaction with klarsicht/ANC-1/Syne homology (KASH) proteins. Depletion of kinesin-1 abolishes nuclear rotation and significantly inhibits nuclear translocation, resulting in the abnormal aggregation of nuclei at the midline of the myotube. Dynein depletion also inhibits nuclear dynamics, but to a lesser extent, leading to altered spacing between adjacent nuclei. Thus, oppositely directed motors acting from the surface of the nucleus drive nuclear motility in myotubes. The variable dynamics observed for individual nuclei within a single myotube are likely to result from the stochastic activity of competing motors interacting with a complex bipolar microtubule cytoskeleton that is also continuously remodeled as the nuclei move. The three-dimensional rotation of myotube nuclei may facilitate their motility through the complex and crowded cellular environment of the developing muscle cell, allowing for proper myonuclear positioning.