nils-herrmann/clean_scirepeval huggingface dataset:
The effect of cross-sex hormonal treatment on gender dysphoria individuals’ mental health: a systematic review

Cross-sex hormonal treatment represents a main aspect of gender dysphoria health care pathway. However, it is still debated whether this intervention translates into a better mental well-being for the individual and which mechanisms may underlie this association. Although sex reassignment surgery has been the subject of extensive investigation, few studies have specifically focused on hormonal treatment in recent years. Here, we systematically review all studies examining the effect of cross-sex hormonal treatment on mental health and well-being in gender dysphoria. Research tends to support the evidence that hormone therapy reduces symptoms of anxiety and dissociation, lowering perceived and social distress and improving quality of life and self-esteem in both male-to-female and female-to-male individuals. Instead, compared to female-to-male individuals, hormone-treated male-to-female individuals seem to benefit more in terms of a reduction in their body uneasiness and personality-related psychopathology and an amelioration of their emotional functioning. Less consistent findings support an association between hormonal treatment and other mental health-related dimensions. In particular, depression, global psychopathology, and psychosocial functioning difficulties appear to reduce only in some studies, while others do not suggest any improvement in these domains. Results from longitudinal studies support more consistently the association between hormonal treatment and improved mental health. On the contrary, a number of cross-sectional studies do not support this evidence. This review provides possible biological explanation vs psychological explanation (direct effect vs indirect effect) for the hormonal treatment-induced better mental well-being. In conclusion, this review indicates that gender dysphoria-related mental distress may benefit from hormonal treatment intervention, suggesting a transient reaction to the nonsatisfaction connected to the incongruent body image rather than a stable psychiatric comorbidity. In this perspective, timely hormonal treatment intervention represents a crucial issue in gender dysphoria individuals' mental health-related outcome.
Fundamental Limitations of Small Antennas

A capacitor or inductor operating as a small antenna is theoretically capable of intercepting a certain amount of power, independent of its size, on the assumption of tuning without circuit loss. The practical efficiency relative to this ideal is limited by the "radiation power factor" of the antenna as compared with the power factor and bandwidth of the antenna tuning. The radiation power factor of either kind of antenna is somewhat greater than (1/6π) (Ab/l2) in which Ab is the cylindrical volume occupied by the antenna, and l is the radianlength (defined as 1/2π wavelength) at the operating frequency. The efficiency is further limited by the closeness of coupling of the antenna with its tuner. Other simple formulas are given for the more fundamental properties of small antennas and their behavior in a simple circuit. Examples for 1-Mc. operation in typical circuits indicate a loss of about 35 db for the I.R.E. standard capacitive antenna, 43 db for a large loop occupying a volume of 1 meter square by 0.5 meter axial length, and 64 db for a loop of 1/5 these dimensions.
An Iterative Image Registration Technique with an Application to Stereo Vision

Image registration finds a variety of applications in computer vision. Unfortunately, traditional image registration techniques tend to be costly. We present a new image registration technique that makes use of the spatial intensity gradient of the images to find a good match using a type of Newton-Raphson iteration. Our technique is faster because it examines far fewer potential matches between the images than existing techniques. Furthermore, this registration technique can be generalized to handle rotation, scaling and shearing. We show show our technique can be adapted for use in a stereo vision system.
March Madness and the Office Pool

March brings March Madness, the annual conclusion to the U.S. men’s college basketball season with two single elimination basketball tournaments showcasing the best college teams in the country. Almost as mad is the plethora of office pools across the country where the object is to pick a priori as many game winners as possible in the tournament. More generally, the object in an office pool is to maximize total pool points, where different points are awarded for different correct winning predictions. We consider the structure of single elimination tournaments, and show how to efficiently calculate the mean and the variance of the number of correctly predicted wins (or more generally the total points earned in an office pool) for a given slate of predicted winners. We apply these results to both random and Markov tournaments. We then show how to determine optimal office pool predictions that maximize the expected number of points earned in the pool. Considering various Markov probability models for predicting game winners based on regular season performance, professional sports rankings, and Las Vegas betting odds, we compare our predictions with what actually happened in past NCAA and NIT tournaments. These models perform similarly, achieving overall prediction accuracies of about 58%, but do not surpass the simple strategy of picking the seeds when the goal is to pick as many game winners as possible. For a more sophisticated point structure, however, our models do outperform the strategy of picking the seeds.
Analysis of the weighted Chinese air transportation multilayer network

Air transportation system is a crucial infrastructure of modern world. In this paper, we analyze the weighted Chinese air transportation network with the framework of multilayer network, in which each layer is defined by a commercial airline (company) and the weight of links is set respectively by the number of flights, the number of seats and the geographical distance between pairs of airports. It is shown that the size of the airlines can be characterized approximatively by the number of air routes they operated. The numeric results also indicate that the CCA (air China) is of a considerable higher value of maximal degree and betweenness than other top airlines. Our work will be helpful to better understand and model the Chinese air transportation network.
VTrack: accurate, energy-aware road traffic delay estimation using mobile phones

Traffic delays and congestion are a major source of inefficiency, wasted fuel, and commuter frustration. Measuring and localizing these delays, and routing users around them, is an important step towards reducing the time people spend stuck in traffic. As others have noted, the proliferation of commodity smartphones that can provide location estimates using a variety of sensors---GPS, WiFi, and/or cellular triangulation---opens up the attractive possibility of using position samples from drivers' phones to monitor traffic delays at a fine spatiotemporal granularity. This paper presents VTrack, a system for travel time estimation using this sensor data that addresses two key challenges: energy consumption and sensor unreliability. While GPS provides highly accurate location estimates, it has several limitations: some phones don't have GPS at all, the GPS sensor doesn't work in "urban canyons" (tall buildings and tunnels) or when the phone is inside a pocket, and the GPS on many phones is power-hungry and drains the battery quickly. In these cases, VTrack can use alternative, less energy-hungry but noisier sensors like WiFi to estimate both a user's trajectory and travel time along the route. VTrack uses a hidden Markov model (HMM)-based map matching scheme and travel time estimation method that interpolates sparse data to identify the most probable road segments driven by the user and to attribute travel times to those segments. We present experimental results from real drive data and WiFi access point sightings gathered from a deployment on several cars. We show that VTrack can tolerate significant noise and outages in these location estimates, and still successfully identify delay-prone segments, and provide accurate enough delays for delay-aware routing algorithms. We also study the best sampling strategies for WiFi and GPS sensors for different energy cost regimes.
Hashcash - Amortizable Publicly Auditable Cost-Functions

We present a distributed efficiently amortizable CPU cost-function with no trap–door. The absence of a trap–door allows us to avoid needing to trust any party. Applications for such cost-functions are in distributed document popularity estimation, and metering of web advertising. None of the servers involved have any advantage over users in computing the cost function. The amortized token has a small fixed sized representation independent of the amortized value. The valuation function is efficient. Limits can be placed on the resources which can be expended in computing the cost-function to prevent the user inflating the value of his contribution by using more CPU time than the expected token value. The amortized part of the cost result can be blinded so that clients can not obtain service but avoid contributing to the amortization by expending more resources than the expected token value. Interactive and non-interactive variants of the cost-function can be constructed which can be used in situations where the server can issue a challenge (connection oriented interactive protocol), and where it can't (where the communication is store–and–forward, or packet oriented) respectively.
Three-dimensional menus: A survey and taxonomy

Various interaction techniques have been developed in the field of virtual and augmented reality. Whereas techniques for object selection, manipulation, travel, and wayfinding have already been covered in existing taxonomies in some detail, application control techniques have not yet been sufficiently considered. However, they are needed by almost every mixed reality application, e.g. for choosing from alternative objects or options. For this purpose a great variety of distinct three-dimensional (3D) menu selection techniques is available. This paper surveys existing 3D menus from the corpus of literature and classifies them according to various criteria. The taxonomy introduced here assists developers of interactive 3D applications to better evaluate their options when choosing, optimizing, and implementing a 3D menu technique. Since the taxonomy spans the design space for 3D menu solutions, it also aids researchers in identifying opportunities to improve or create novel virtual menu techniques. r 2006
Measuring Universal Intelligence in Agent-Based Systems Using the Anytime Intelligence Test

This paper aims to quantify and analyze the intelligence of artificial agent collectives. A universal metric is proposed and used to empirically measure intelligence for several different agent decision controllers. Accordingly, the effectiveness of various algorithms is evaluated on a per-agent basis over a selection of abstracted, canonical tasks of different algorithmic complexities. Results reflect the different settings over which cooperative multiagent systems can be significantly more intelligent per agent than others. We identify and discuss some of the factors influencing the collective performance of these systems.
Natural feature tracking for extendible robust augmented realities

Vision-based tracking systems for augmented reality often require that artificial fiducials be placed in the scene. In this paper we utilize our approach for robust detection and tracking of natural features such as textures or corners. The tracked natural features are automatically calibrated to the fiducials that are used to initialize and facilitate normal tracking. Once calibrated, the natural features are used to extend the system’s tracking range and to stabilize the tracked pose against occlusions and noise. The emphasis of this paper is the integration of natural feature tracking with fiducial tracking to increase the range and robustness of vision-based augmented reality tracking.
The substrate integrated circuits - a new concept for high-frequency electronics and optoelectronics

A new generation of high-frequency integrated circuits is presented, which is called substrate integrated circuits (SICs). Current state-of-the-art of circuit design and implementation platforms based on this new concept are reviewed and discussed in detail. Different possibilities and numerous advantages of the SICs are shown for microwave, millimeter-wave and optoelectronics applications. Practical examples are illustrated with theoretical and experimental results for substrate integrated waveguide (SIW), substrate integrated slab waveguide (SISW) and substrate integrated nonradiating dielectric (SINRD) guide circuits. Future research and development trends are also discussed with reference to low-cost innovative design of millimeter-wave and optoelectronic integrated circuits.
Towards a Reusable Infrastructure for Crowdsourcing

In the course of the last few years crowd sourcing has received growing research focus due to its conception of solving complex tasks with the help of a flexible group of contributors of whom each needs to only contribute a simpler task part. Hence, the crowd can contribute by collecting data from distributed locations, completing map information, or voting on product ideas, et cetera. However, even though it is a necessary conceptual feature, the participation of large numbers of users with heterogeneous devices, generic infrastructures for crowd sourcing can hardly be found. For example, the management of users, mobile devices and contributed data has to be repetitively implemented in new projects. To ease the development of crowd sourcing applications, in this paper we propose a generic platform for simplified crowd sourcing deployment while supporting diverse crowd sourcing scenarios, the ability to handle large numbers of users and the involvement of heterogeneous mobile devices. The focus therein is put on the deployment process. Hence, the evaluation is based on an actual deployment, namely the migration of Cyface, an existing crowd sourcing project build from scratch, into using our proposed infrastructure.
Navigation of an omni-directional mobile robot with active caster wheels

This work deals with navigation of an omni-directional mobile robot with active caster wheels. Initially, the posture of the omni-directional mobile robot is calculated by using the odometry information. Next, the position accuracy of the mobile robot is measured through comparison of the odometry information and the external sensor measurement. Finally, for successful navigation of the mobile robot, a motion planning algorithm that employs kinematic redundancy resolution method is proposed. Through experiments for multiple obstacles and multiple moving obstacles, the feasibility of the proposed navigation algorithm was verified.
Discovering outlier filtering rules from unlabeled data: combining a supervised learner with an unsupervised learner

This paper is concerned with the problem of detecting outliers from unlabeled data. In prior work we have developed SmartSifter, which is an on-line outlier detection algorithm based on unsupervised learning from data. On the basis of SmartSifter this paper yields a new framework for outlier filtering using both supervised and unsupervised learning techniques iteratively in order to make the detection process more effective and more understandable. The outline of the framework is as follows: In the first round, for an initial dataset, we run SmartSifter to give each data a score, with a high score indicating a high possibility of being an outlier. Next, giving positive labels to a number of higher scored data and negative labels to a number of lower scored data, we create labeled examples. Then we construct an outlier filtering rule by supervised learning from them. Here the rule is generated based on the principle of minimizing extended stochastic complexity. In the second round, for a new dataset, we filter the data using the constructed rule, then among the filtered data, we run SmartSifter again to evaluate the data in order to update the filtering rule. Applying of our framework to the network intrusion detection, we demonstrate that 1) it can significantly improve the accuracy of SmartSifter, and 2) outlier filtering rules can help the user to discover a general pattern of an outlier group.
An ultra-low-power programmable analog bionic ear processor

We report a programmable analog bionic ear (cochlear implant) processor in a 1.5-/spl mu/m BiCMOS technology with a power consumption of 211 /spl mu/W and 77-dB dynamic range of operation. The 9.58 mm/spl times/9.23 mm processor chip runs on a 2.8 V supply and has a power consumption that is lower than state-of-the-art analog-to-digital (A/D)-then-DSP designs by a factor of 25. It is suitable for use in fully implanted cochlear-implant systems of the future which require decades of operation on a 100-mAh rechargeable battery with a finite number of charge-discharge cycles. It may also be used as an ultra-low-power spectrum-analysis front end in portable speech-recognition systems. The power consumption of the processor includes the 100 /spl mu/W power consumption of a JFET-buffered electret microphone and an associated on-chip microphone front end. An automatic gain control circuit compresses the 77-dB input dynamic range into a narrower internal dynamic range (IDR) of 57 dB at which each of the 16 spectral channels of the processor operate. The output bits of the processor are scanned and reported off chip in a format suitable for continuous-interleaved-sampling stimulation of electrodes. Power-supply-immune biasing circuits ensure robust operation of the processor in the high-RF-noise environment typical of cochlear implant systems.
A study of interactive 3D point location in a computer simulated virtual environment

The present study investigated the ability to inter actively locate points in a three dimensional computer environment using a six degree of freedom input device. Four different visu al feedback modes were tested: fixed viewpoint monoscopic persp ective, fixed viewpoint stereoscopic perspective, head-tracked mo noscopic perspective and head-tracked stereoscopic perspecti ve. Targets were located at plus and minus 10cm along the X, Y or Z axes, from a fixed starting location. Data about the time to complete the task and positioning accuracy (error) are gathered for each trial. In addition, subjective feedback regarding the apparat us, visual mode and task difficulty was solicited from subject s. The results indicate that stereoscopic performance is superior to monoscopic performance and that asymmetries exist both across and within axes. Head tracking had no appreciable effect upon performance. Subjective feedback regarding performance is usuall y consistent with objective measures, but some inconsistencies a re present.
Evaluating geo-social influence in location-based social networks

The emerging location-based social network (LBSN) services not only allow people to maintain cyber links with their friends, but also enable them to share the events happening on them at different locations. The geo-social correlations among event participants make it possible to quantify mutual user influence for various events. Such a quantification of influence could benefit a wide spectrum of real-life applications such as targeted advertising and viral marketing.
 In this paper, we perform an in-depth analysis of the geo-social correlations among LBSN users at event level, based on which we address two problems: user influence evaluation and influential events discovery. To capture the geo-social closeness between LBSN users, we propose a unified influence metric. This metric combines a novel social proximity measure named penalized hitting time, with a geographical weight function modeled by power law distribution. We propose two approximate algorithms, namely global iteration (GI) and dynamic neighborhood expansion (DNE), to efficiently evaluate user influence with tight theoretical error bounds. We then adopt the sampling technique and the threshold algorithm to support efficient retrieval of top-K influential events. Extensive experiments on both real-life and synthetic LBSN data sets confirm that the proposed algorithms are effective, efficient, and scalable.
Mapping the U.S. Political Blogosphere: Are Conservative Bloggers More Prominent?

Weblogs are now a key part of online culture, and social scientists are interested in characterising the networks formed by bloggers and measuring their extent and impact in areas such as politics. However, researchers wishing to conduct quantitative social science analysis of the blogging phenomenon are faced with the challenge of using new methods of data collection and analysis largely derived from fields outside of the social sciences, such as the information sciences. This paper presents an overview of one new approach for collecting and analysing weblog data, and illustrates this approach in the context of a preliminary quantitative analysis of online networks formed by a sample of North-American “A-list” political bloggers. There are two aims to this paper. First is to assess (using different data and methods) the conclusion of Adamic and Glance (2005) that there are significant differences in the behaviour of liberal and conservative bloggers, with the latter forming more dense patterns of linkages. We find broad support for this conclusion, and empirically assess the implications of differences in conservative/liberal linking behaviour for the online visibility of different political messages or ideologies. The second aim is to highlight the role of web mining and data visualisation in the analysis of weblogs, and the opportunities and challenges inherent in this new field of research.
Learning recursion: Multiple nested and crossed dependencies

Language acquisition in both natural and artificial language learning settings crucially depends on extracting information from ordered sequences. A shared sequence learning mechanism is thus assumed to underlie both natural and artificial language learning. A growing body of empirical evidence is consistent with this hypothesis. By means of artificial language learning experiments, we may therefore gain more insight in this shared mechanism. In this paper, we review empirical evidence from artificial language learning and computational modeling studies, as well as natural language data, and suggest that there are two key factors that help determine processing complexity in sequence learning, and thus in natural language processing. We propose that the specific ordering of non-adjacent dependencies (i.e. nested or crossed), as well as the number of non-adjacent dependencies to be resolved simultaneously (i.e. two or three) are important factors in gaining more insight into the boundaries of human sequence learning; and thus, also in natural language processing. The implications for theories of linguistic competence are discussed.