Miracle-dz/UniFAR-FTUs huggingface dataset:
Partner Choice in Nitrogen-Fixation Mutualisms of Legumes and Rhizobia1

Abstract Mutualistic interactions are widespread and obligatory for many organisms, yet their evolutionary persistence in the face of cheating is theoretically puzzling. Nutrient-acquisition symbioses between plants and soil microbes are critically important to plant evolution and ecosystem function, yet we know almost nothing about the evolutionary dynamics and mechanisms of persistence of these ancient mutualisms. Partner-choice and partner-fidelity are mechanisms for dealing with cheaters, and can theoretically allow mutualisms to persist despite cheaters. Many models of cooperative behavior assume pairwise interactions, while most plant-microbe nutrient-acquisition symbioses involve a single plant interacting with numerous microbes. Market models, in contrast, are well suited to mutualisms in which single plants attempt to conduct mutually beneficial resource exchange with multiple individuals. Market models assume that one partner chooses to trade with a subset of individuals selected from a market of potential partners. Hence, determining whether partner-choice occurs in plant-microbe mutualisms is critical to understanding the evolutionary persistence and dynamics of these symbioses. The nitrogen-fixation/carbon-fixation mutualism between leguminous plants and rhizobial bacteria is widespread, ancient, and important for ecosystem function and human nutrition. It also involves single plants interacting simultaneously with several to many bacterial partners, including ineffective (“cheating”) strains. We review the existing literature and find that this mutualism displays several elements of partner-choice, and may match the requirements of the market paradigm. We conclude by identifying profitable questions for future research.
Two Insights about Naming in the Preschool Child

Psychological models often assume that young children learn words and concepts by means of associative learning mechanisms, without the need to posit any innate predispositions. For example, Smith, Jones, and Laudau (1996) propose that children learn concepts by hearing specific linguistic frames while viewing specific object properties. The environment provides all the information that children need; the conjunction of sights and sounds is proposed to be sufficient to enable children to construct word meanings. On their view, children make use of “associative connections and direct stimulus pulls,” which Smith et al. dub “dumb attentional mechanisms. ” In this chapter I suggest that this empiricist learning model is insufficient to account for two early-emerging insights that children possess about the nature of naming. These insights are: (1) Essentialism: certain words map onto non-obvious, underlying causal features (e.g., dogs are alike in internal and subtle respects, even if they look quite different on the surface), and (2) Genericity: certain expressions map onto generic kinds (e.g., DOGS as an abstract category) as opposed to particular instances (e.g., one or more specific dogs). I will discuss empirical studies with preschool children to support the contention that essentialism and genericity emerge early in development, and that neither insight is directly taught. I will also explore the question of whether these insights can be derived wholly from a direct reading of cues that are “out there” in the world, and conclude that they cannot. I then explore the implications of these findings for innateness. Specifically, both essentialism and genericity provide cues regarding plausible candidates for innate conceptual knowledge in children.
Endowing the nonlinear sigma model with a flat connection structure: a way to renormalization

We discuss the quantized theory of a pure-gauge non-abelian vector field (flat connection) as it would appear in a mass term ? la St? ckelberg. However the paper is limited to the case where only the flat connection is present (no field strength term). The perturbative solution is constructed by using only the functional equations and by expanding in the number of loops. In particular we do not use a perturbative approach based on the path integral or on a canonical quantization. It is shown that there is no solution with trivial S-matrix. Then the model is embedded in a nonlinear sigma model. The solution is constructed by exploiting a natural hierarchy in the functional equations given by the number of insertions of the flat connection and of the constraint component of the sigma field. The amplitudes with the sigma field are simply derived from those of the flat connection and of the constraint component. Unitarity is enforced by hand by using Feynman rules. We demonstrate the remarkable fact that in generic dimensions the na? ve Feynman rules yield amplitudes that satisfy the functional equations. This allows a dimensional renormalization of the theory in D = 4 by recursive subtractions of the poles in the Laurent expansion. Thus one gets a finite theory depending only on two parameters. The novelty of the paper is the use of the functional equation associated to the local left multiplication introduced by Faddeev and Slavnov, here improved by adding the external source coupled to the constrained component. It gives a powerful tool to renormalize the nonlinear sigma model.
On the dynamic control of matching queues

We consider the optimal control of matching queues with random arrivals. In this model, items arrive to dedicated queues, and wait to be matched with items from other (possibly multiple) queues. A match type corresponds to the set of item classes required for a match. Once a decision has been made to perform a match, the matching itself is instantaneous and the matched items depart from the system. We consider the problem of minimizing finite-horizon cumulative holding costs. The controller must decide which matchings to execute given multiple options. In principle, the controller may choose to wait until some “inventory” of items builds up to facilitate more profitable matches in the future. We introduce a multi-dimensional imbalance process, that at each time t , is given by a linear function of the cumulative arrivals to each of the item classes. A non-zero value of the imbalance at time t means that no control could have matched all the items that arrived by time t . A lower bound based on the imbalance process can be specified, at each time point, by a solution to an optimization problem with linear constraints.While not achievable in general, this lower bound can be asymptotically approached under a dedicated item condition (an analogue of the local traffic condition in bandwidth sharing networks). We devise a myopic discrete-review matching control that asymptotically–as the arrival rates become large–achieves the imbalance-based lower bound.
InPoTra : Indoor Positioning and Tracking

Many research based on indoor positioning and tracking systems have been developed due to growing interest in location-aware services. Nevertheless, satisfying solutions have not been found with the considerations of both accuracy and system complexity. In fact, an indoor localization system highly accurate, low energy, widely available, and easily deployed has not yet been developed. Hence, there are still open issues on indoor environments. InPoTra session involves four papers using new methodologies and parameters estimation for indoor positioning. Keywords-Indoor Positioning; Tracking; Wireless Localization Techniques; Radio Frequency; Visible Light
A hybrid large neighborhood search for the pickup and delivery problem with time windows

In this paper, we investigate the use of the large neighborhood search for solving the pickup and delivery problem with time windows. Such a problem may be viewed as a variant of the capacitated vehicle routing problem with time windows, where both precedence and coupling constraints are considered. The proposed method is based on the framework of the large neighborhood search combined with local search procedures. In order to evaluate the performance of the proposed method, it has been tested on Li et al. 's benchmark instances. The obtained results are compared to those reached by the best method available in the literature. Encouraging results have been obtained.
Recent advances and challenges in human-centric multimedia mobile cloud computing

The increasing usage of cloud computing, along with the proliferation of mobile devices and the demand for multimedia services, are changing the life style of users and creating new opportunities to providers and clients. Multimedia data will account for up to 90% of all Internet traffic in a few years, where most of the content will be created, shared, and accessed by mobile smartphones/tablets (carried by humans or placed in vehicles). However, this novel mobile multimedia era imposes new challenges for the networks, content, terminals, and humans, and must overcome problems associated, for instance, with high congestion, low scalability, fast battery consumption, and poor user experience. This paper discusses recent advances and challenges in human-centric mobile multimedia cloud computing approaches. On the one hand, Internet cloud will ubiquitously enrich multimedia mobile environments with more advanced and powerful features, including high processing and memory, scalability, availability, and adaptability. On the other hand, mobile devices will efficiently cooperate with each other to form mobile clouds that offload the Internet clouds from tasks that the latter cannot perform in a timely or efficient manner, including video and resource sharing. Both Internet and mobile clouds will be efficiently used to adapt/optimize multimedia flows to a single user or a group of users according to the current network conditions, context-awareness, content characteristics, device capabilities, and human experience.
Risk for Nevus Transformation and Melanoma Proliferation and Invasion During Natalizumab Treatment: Four Years of Dermoscopic Follow-up With Immunohistological Studies and Proliferation and Invasion Assays

Author Affiliations: Rutgers Cancer Institute of New Jersey, Rutgers, The State University of New Jersey University, New Brunswick (Coups, Stapleton, MedinaForrester); Department of Medicine, Rutgers Robert Wood Johnson Medical School, New Brunswick, New Jersey (Coups, Stapleton); Department of Health Education and Behavioral Science, Rutgers School of Public Health, Piscataway, New Jersey (Coups, Stapleton); Department of Medicine, Rutgers New Jersey Medical School, Newark (Natale-Pereira); University of Puerto Rico Comprehensive Cancer Center, San Juan (Tortolero-Luna).
An Action-tuned Neural Network Architecture for Hand Pose Estimation

There is a growing interest in developing computational models of grasping action recognition. This interest is increasingly motivated by a wide range of applications in robotics, neuroscience, HCI, motion capture and other research areas. In many cases, a vision-based approach to grasping action recognition appears to be more promising. For example, in HCI and robotic applications, such an approach often allows for simpler and more natural interaction. However, a vision-based approach to grasping action recognition is a challenging problem due to the large number of hand self-occlusions which make the mapping from hand visual appearance to the hand pose an inverse ill-posed problem. The approach proposed here builds on the work of Santello and co-workers which demonstrate a reduction in hand variability within a given class of grasping actions. The proposed neural network architecture introduces specialized modules for each class of grasping actions and viewpoints, allowing for a more robust hand pose estimation. A quantitative analysis of the proposed architecture obtained by working on a synthetic data set is presented and discussed as a basis for further work.
Multifunction Phased-Array Radar: Time Balance Scheduler for Adaptive Weather Sensing

Abstract Phased-array radars (PARs) have the capability of instantaneously and dynamically controlling beam position on a pulse-by-pulse basis, which allows a single radar to perform multiple functions, such as tracking multiple storms or weather and aviation surveillance. Moreover, these tasks can be carried out with different update times to achieve the goal of better characterizing and forecasting the storms of interest. However, these tasks usually compete for finite radar resources, and scheduling algorithms are often needed to address resource contention. To capitalize on the PAR capabilities, an algorithm based on the concept of time balance (TB) is developed for adaptive weather sensing. Two quality measures are introduced to quantify the gain of adaptive sensing relative to standard scanning patterns used by the Weather Surveillance Radar-1988 Doppler (WSR-88D). A simulation experiment is performed to demonstrate the advantages of adaptive sensing and to test and verify the performance of the TB .
The virtual GULLIVER project

In this paper we discuss our virtual reality project Gulliver. This project is part of a more comprehensive project conceived by two artists, Matjaž Stuk and Alena Hudcovicova, called “Gulliver’s Museum of Living Art”. Our part of the project involves a virtual reality version of Swift’s Gulliver figure that can be entered and explored by visitors and that contains several (virtual) facilities: a museum shop, rooms for expositions and installations, a Cabinet of Geographic Maps, etc. This virtual Gulliver is assumed to have an equivalent counterpart in reality. Visitors of the real Gulliver are assumed to be able to interact with their environment and make changes that can be observed by visitors to the virtual environment. We discuss our (as yet modest) attempts to contribute to this project by exploring and showing possibilities and problems.
Automatic identification of signal quality for heart beat detection in cardiac MEMS signals

Rapidly growing number of heart monitoring systems based on microelectromechanical sensor (MEMS) devices demands highly accurate processing algorithms for indicating heartbeat location. In clinical applications based on the analysis of cardiovascular mechanical motion, the signal may vary due to a variety of reasons including motion artifacts, location of the sensor and posture of the person being tested. Also reasons related to the internal device characteristics affect to the signal formation. The purpose of this paper is to address the problem of selecting the best axis when using 3-axis MEMS accelerometer and gyroscope sensors. The formation of noise and artifacts in the observed data depends, for example, on the posture of the monitored person. In this paper, the application for the axis selection is heartbeat detection, and we show that by selecting the optimal axis benefits can be obtained in terms of detection accuracy. With 10-fold cross-validation and with KSVM classifier we obtained the sensitivity and specificity of 83.9% and 86.1%, respectively, in using seismocardiogram waveform for the sepatation between good quality and low quality data. With using gyrocardiogram waveforms we obtained the sensitivity and specificity of 95.9% and 80.0%, respectively.
THE POTENTIAL OF AUGMENTED REALITY IN DYNAMIC GEOMETRY EDUCATION

This paper summarizes work done within the previous 6 years to integrate and implement Virtual and Augmented Reality (VR/AR) technologies in geometry education. A VR/AR application supporting dynamic 3D geometry is presented, intended for real use in high school and university geometry education. Related areas such as dynamic three-dimensional geometry, usability and user interface design, spatial abilities, pedagogy and low-cost VR systems influenced our work and the development of the educational geometry application Construct3D. After describing the design of Construct3D, the strengths of this learning environment for geometry education are investigated. Dynamic three-dimensional geometric content is depicted that fully benefits from the advantages provided by the application. In order to adapt software and hardware to users' needs, user interfaces were redesigned and in depth research was done on usability design. Very positive and useful feedback from teachers and students, who are excited by the possibilities, was collected in three evaluations with more than 100 students in over 500 teaching lessons. Results from these evaluations show that Construct3D is easy to use, requires little time to learn, encourages learners to explore geometry and can be used in a consistent way. Various hardware setups have been studied that are suitable for educational purposes. An immersive setup that uses head mounted displays is most favored by teachers and students. It allows users to actually "walk around" geometric objects which are fixed in space. Regarding spatial ability research, a currently running project for training spatial abilities with more than 300 participants is outlined. A review of shortcomings of existing spatial ability tests concludes with ideas to conduct future testings directly in VR/AR. Finally the recent development of a low cost optical tracking system, that allows to build affordable, immersive VR systems is described. Our work enables teaching of three-dimensional dynamic geometry in an interactive, immersive learning environment, therefore offers new possibilities to modern geometry education. Despite the findings mentioned in this paper, many more research questions have emerged during the development of Construct3D. According to each of the related areas we indicate interesting topics that might require future work. By summarizing our work, which aims to establish Augmented Reality in geometry education, and by providing insight into the problems and future challenges in each of the related areas, we want to highlight and advert the full potential of Augmented Reality in geometry education.
Delay-bandwidth normalized service sharing with service rate guarantees

Fair queueing algorithms based on Generalized Processor Sharing (GPS) provide sessions with instantaneous fair sharing of server capacity, as well as guaranteed service rate and delay. The instantaneous fair sharing distributes server capacity to currently back-logged sessions in proportion to their weights regardless of the amount of service that the sessions received in the past. From a long-term perspective, however, this type of sharing leads to a different quality of service to sessions even if they have the same weight, since it provides only the instantaneous capacity sharing without considering the accumulated service delay and bandwidth. To minimize such long-term unfairness, we propose a delay and bandwidth normalized scheduling model in which the concept of Value of Service (VoS) is defined from the aspects of both delay and bandwidth. Performance comparisons between the proposed algorithm and traditional fair queueing algorithms show that the proposed algorithm provides better long-term fairness among sessions and is more adaptive to sessions with dynamic traffic patterns without compromising the guarantees of service rate and delay.
The Archival Acid Test: Evaluating archive performance on advanced HTML and JavaScript

When preserving web pages, archival crawlers sometimes produce a result that varies from what an end-user expects. To quantitatively evaluate the degree to which an archival crawler is capable of comprehensively reproducing a web page from the live web into the archives, the crawlers' capabilities must be evaluated. In this paper, we propose a set of metrics to evaluate the capability of archival crawlers and other preservation tools using the Acid Test concept. For a variety of web preservation tools, we examine previous captures within web archives and note the features that produce incomplete or unexpected results. From there, we design the test to produce a quantitative measure of how well each tool performs its task.
On the geometry of string duals with backreacting flavors

Making use of generalized calibrated geometry and G-struc\-tures we put the problem of finding string-duals with smeared backreacting flavor branes in a more mathematical setting. This more formal treatment of the problem allows us to easily smear branes without good coordinate representations, establish constraints on the smearing form and identify a topological central charge in the SUSY algebra. After exhibiting our methods for a series of well known examples, we apply them to the problem of flavoring a supergravity-dual to a d = 2+1 dimensional = 2 super Yang-Mills-like theory. We find new solutions to both the flavored and unflavored systems. Interpretating these turns out to be difficult.
Authentication and Access Control in Multi-agent Systems

In a multi-agent system dedicated to personal task management, information and resources within the system are usually sensitive and should be accessible by a limited set of people. Some unique properties of such systems raise new engineering challenges for the design and implementation of security and access control mechanisms: interpretations of information by different agents may have different levels of granularity and information can flow through nodes belonging to different entities. We propose two design principles for determining when and how access control is enforced: (1) perform access control as early as possible; and (2) define policies controlling access at the information level. In this research, we focus on the RADAR Project as an example of such multi-agent systems. RADAR (Reflective Agents with Distributed Adaptive Reasoning) is a software-based cognitive personal assistant that helps people manage their routine tasks such as answering emails, scheduling meetings, and updating websites. In order to complete the tasks, agents in RADAR communicate with each other to obtain task-related information. In this paper, we describe how we apply the proposed design principles by implementing two levels of information access control policies in RADAR. The policies are configurable and can be applied efficiently in any multi-agent systems.
Anti-HIV-1 activity of weekly or biweekly treatment with subcutaneous PRO 140, a CCR5 monoclonal antibody.

BACKGROUND PRO 140 is a humanized CCR5 monoclonal antibody that has demonstrated potent antiviral activity when it is administered intravenously to adults infected with CCR5-tropic (R5) human immunodeficiency virus type 1 (HIV-1). This study is the first to evaluate subcutaneous administration. METHODS A randomized, double-blind, placebo-controlled study was conducted among 44 subjects with HIV-1 RNA levels of >5000 copies/mL, CD4(+) cell counts of >300 cells/microL, no receipt of antiretroviral therapy for >or=12 weeks, and only R5 HIV-1 detectable. Subjects received placebo, 162 mg of PRO 140, or 324 mg of PRO 140 weekly for 3 weeks or 324 mg of PRO 140 every other week for 2 doses by means of subcutaneous infusion. Subjects were monitored for 58 days for safety, antiviral effects, and PRO 140 serum concentrations. RESULTS Subcutaneous PRO 140 demonstrated potent and prolonged antiretroviral activity. Mean log(10) reductions in HIV-1 RNA level were 0.23, 0.99 (P=.009), 1.37 (P<.001), and 1.65 (P<.001) for the placebo, 162 mg weekly, 324 mg biweekly, and 324 mg weekly dose groups, respectively. Viral loads remained suppressed between successive doses. Treatment was generally well tolerated. CONCLUSIONS This trial demonstrates proof of concept for a monoclonal antibody administered subcutaneously in HIV-1 infected individuals. Subcutaneous PRO 140 offers the potential for significant dose-dependent HIV-1 RNA suppression and infrequent patient self-administration. TRIAL REGISTRATION ClinicalTrials.gov identifier: NCT00642707 .