Miracle-dz/UniFAR-FTUs huggingface dataset:
The arithmetic translator-compiler of the IBM FORTRAN automatic coding system

1. I n t rod action :. The present paper describes, in formal terms, the :; steps in translation employed by the Fom't~Ax arithmetic translator in eonverting FORTRAN formulas into 704 as-semMy code. The steps are described in about the order in which they are actually taken during translation. All, hough sections 2 and 3 give a formal description of the FOaTaAN source language, insofar as arithmetic type stal~ements are concerned, the reader is expected to be familiar with FORTRAN II, as well as with S. ~vP II and the programming logic of the 704 computer. The first major phase of translation, described in sections 4-7, :is concerned with converting an arithmetic formula, regarded as the statement of an algorithm, into a set of triples (C i, @i, NO which also d~seribe the algorithm thm, but in a manner which lends itsdf more easily to conversion into conventional computer code (not necessarily that of the 704). The three elements of a triple have :! ~essentially the following meanings: ~ : operation to be performed perand time" at which the operation must be performed are as many distinct "times" of operation as there iare subexpressions in the entire expression to be evaluated. Ior example, eonstder the artthmette expressmn (((A + B)-C)/((D • (E + F)/G)-H + J)). (1) i*subexpressions as there are distinct pairs of parentheses _~;shown-namcly six. To evaluate the entire expression :'all six subexpressions must be:~ evaluated. While there is some latitude in the order in which these subexpressions are to be evaluated, not all orders will work (since "higher i r 1" me subexpressions depend on "lower level" ones for their values). A possible order of evaluation for the example shown is as follows: rhe triples representing this coniputation would /)reak tp into six subsets, called segments according to their C-mmber (first member of a triple), in each segment (cor-esponding to a sut)expression) there are as many triples i ~: t In the FORTRAN system * is used for multiplication, ** for xpon(mlsiation. as there are terms in the subexpression. (The number o: triples in a segment may be called the lengthof a seg ment.) Using the numbers written alongside the sub expressions as names for these subexpressions, we gel the following representation of the computation in triple~, notation: If the divide operation is regarded as multiplication by th(inverse, then it is clear that the triples belonging to an) given …
Could a Pile of Slippery Sacks Behave Like an Ocean

Abstract A method for simulating fluid motions that shows promise for application to the oceans is explored. Incompressible inviscid fluids with free surfaces are represented as piles of slippery sacks. A system of ordinary differential equations governs the motions of the sacks, and this system is solved numerically in order to simulate a nonlinear deformation, internal and external gravity waves, and Rossby waves. The simulations are compared to analytic and finite-difference solutions, and the former converge to the latter as the sizes of the sacks are decreased. The slippery-sack method appears to be well suited to ocean modeling for the following reasons: 1) it perfectly conserves a fluid's distributions of density and tracers; 2) unlike existing isopycnic models the slippery-sack method is capable of representing a continuum of fluid densities and vertically resolving neutral regions; 3) the inclusion of continuous topography adds no numerical complexity to the slippery-sack method; 4) the slippery-.
Seeking pleasant touch: neural correlates of behavioral preferences for skin stroking

Affective touch is a dynamic process. In this fMRI study we investigated affective touch by exploring its effects on overt behavior. Arm and palm skin were stroked with a soft brush at five different velocities (0.3, 1, 10, 3, and 30 cm s−1), using a novel feedback-based paradigm. Following stimulation in each trial, participants actively chose whether the caress they would receive in the next trial would be the same speed (“repeat”) or different (“change”). Since preferred stroking speeds should be sought with greater frequency than non-preferred speeds, this paradigm provided a measure of such preferences in the form of active choices. The stimulation velocities were implemented with respect to the differential subjective pleasantness ratings they elicit in healthy subjects, with intermediate velocities (1, 10, and 3 cm s−1) considered more pleasant than very slow or very fast ones. Such pleasantness ratings linearly correlate with changes in mean firing rates of unmyelinated low-threshold C-tactile (CT) afferent nerves in the skin. Here, gentle, dynamic stimulation optimal for activating CT-afferents not only affected behavioral choices, but engaged brain regions involved in reward-related behavior and decision-making. This was the case for both hairy skin of the arm, where CTs are abundant, and glabrous skin of the palm, where CTs are absent. These findings provide insights on central and behavioral mechanisms underlying the perception of affective touch, and indicate that seeking affective touch involves value-based neural processing that is ultimately reflected in behavioral preferences.
When space technologies enable services for the Autonomous and driverless Transportation of persons

Damien SALLÉ, PhD and Msc in Robotics, Mcs in Mechanical Engineering. He did his PhD research at the Paris Robotics Laboratory (LRP). His research focused on methodologies for the optimal design of redundant robotic manipulators. As an application of this research, he designed a robotic instrument, optimal for minimally invasive heart surgery. He joined Robosoft in 2005 where he was in charge of the management of the European R&D project. He is now the Head of the Software Developments department, which focuses on R&D, and more specifically the development of the robuBOX TM : Robosoft’s software product for robot controllers’ development.
HNP3: A Hierarchical Nonparametric Point Process for Modeling Content Diffusion over Social Media

This paper introduces a novel framework for modeling temporal events with complex longitudinal dependency that are generated by dependent sources. This framework takes advantage of multidimensional point processes for modeling time of events. The intensity function of the proposed process is a mixture of intensities, and its complexity grows with the complexity of temporal patterns of data. Moreover, it utilizes a hierarchical dependent nonparametric approach to model marks of events. These capabilities allow the proposed model to adapt its temporal and topical complexity according to the complexity of data, which makes it a suitable candidate for real world scenarios. An online inference algorithm is also proposed that makes the framework applicable to a vast range of applications. The framework is applied to a real world application, modeling the diffusion of contents over networks. Extensive experiments reveal the effectiveness of the proposed framework in comparison with state-of-the-art methods.
Efficient visual odometry estimation using stereo camera

In this paper we present a visual odometry system that estimate the motion of a stereo camera from consecutive stereo image pairs. No other sensors or prior knowledge of the scene is needed. The point features are extracted and matched between image pairs. Given feature correspondences, the camera motion is estimated by minimizing the reporjection error of successive images. The main contribution of this paper is that we design a customized feature descriptor that can make feature matching process extremely fast while preserving the matching reliability. Hence, we can include as many features as possible into optimization process which leads to improvement of motion estimation accuracy. Real-world experiments are done to demonstrate the ability and efficiency of the system.
Current perspectives in proteomic analysis of abiotic stress in Grapevines

Grapes are an important crop plant which forms the basis of a globally important industry. Grape and wine production is particularly vulnerable to environmental and climatic fluctuations, which makes it essential for us to develop a greater understanding of the molecular level responses of grape plants to various abiotic stresses. The completion of the initial grape genome sequence in 2007 has led to a significant increase in research on grapes using proteomics approaches. In this article, we discuss some of the current research on abiotic stress in grapevines, in the context of abiotic stress research in other plant species. We also highlight some of the current limitations in grapevine proteomics and identify areas with promising scope for potential future research.
Entity-Specific Sentiment Classification of Yahoo News Comments

Sentiment classification is widely used for product reviews and in online social media such as forums, Twitter, and blogs. However, the problem of classifying the sentiment of user comments on news sites has not been addressed yet. News sites cover a wide range of domains including politics, sports, technology, and entertainment, in contrast to other online social sites such as forums and review sites, which are specific to a particular domain. A user associated with a news site is likely to post comments on diverse topics (e.g., politics, smartphones, and sports) or diverse entities (e.g., Obama, iPhone, or Google). Classifying the sentiment of users tied to various entities may help obtain a holistic view of their personality, which could be useful in applications such as online advertising, content personalization, and political campaign planning. In this paper, we formulate the problem of entity-specific sentiment classification of comments posted on news articles in Yahoo News and propose novel features that are specific to news comments. Experimental results show that our models outperform state-of-the-art baselines.
Determination of Somatic and Cancer Stem Cell Self-Renewing Symmetric Division Rate Using Sphere Assays

Representing a renewable source for cell replacement, neural stem cells have received substantial attention in recent years. The neurosphere assay represents a method to detect the presence of neural stem cells, however owing to a deficiency of specific and definitive markers to identify them, their quantification and the rate they expand is still indefinite. Here we propose a mathematical interpretation of the neurosphere assay allowing actual measurement of neural stem cell symmetric division frequency. The algorithm of the modeling demonstrates a direct correlation between the overall cell fold expansion over time measured in the sphere assay and the rate stem cells expand via symmetric division. The model offers a methodology to evaluate specifically the effect of diseases and treatments on neural stem cell activity and function. Not only providing new insights in the evaluation of the kinetic features of neural stem cells, our modeling further contemplates cancer biology as cancer stem-like cells have been suggested to maintain tumor growth as somatic stem cells maintain tissue homeostasis. Indeed, tumor stem cell's resistance to therapy makes these cells a necessary target for effective treatment. The neurosphere assay mathematical model presented here allows the assessment of the rate malignant stem-like cells expand via symmetric division and the evaluation of the effects of therapeutics on the self-renewal and proliferative activity of this clinically relevant population that drive tumor growth and recurrence.
Reasoning About Spatial Patterns of Human Behavior During Group Conversations with Robots

The goal of this dissertation is to develop computational models for robots to detect and sustain the spatial patterns of behavior that naturally emerge during free-standing group conversations with people. These capabilities have often been overlooked by the Human-Robot Interaction (HRI) community, but they are essential for robots to appropriately interact with and around people in many human environments. In this work, we first develop a robotic platform for studying human-robot interactions, and contribute new experimental protocols to investigate group conversations with robots. The studies that we conducted with these protocols examine various aspects of these interactions, and experimentally validate the idea that people tend to establish spatial formations typical of human conversations with robots. These formations emerge as the members of the interaction cooperate to sustain a single focus of attention. They maximize their opportunities for monitoring one another’s mutual perceptions during conversations. Second, we introduce a general framework to track the lower-body orientation of freestanding people in human environments and to detect their conversational groups based on their spatial behavior. This framework takes advantage of the mutual dependency between the two problems. Lower-body orientation is a key descriptor of spatial behavior and, thus, can help detect group conversations. Meanwhile, knowing the location of group conversations can help estimate people’s lower-body orientation, because these interactions often bias human spatial behavior. We evaluate this framework in a public computer vision benchmark for group detection, and show how it can be used to estimate the members of a robot’s group conversation in real-time. Third, we study how robots should orient with respect to a group conversation to cooperate to sustain the spatial arrangements typical of these interactions. To this end, we conduct an experiment to study the effects of varied orientation and gaze behaviors for robots during social conversations. Our results reinforce the importance of communicative motion behavior for robots, and suggest that their body and gaze behaviors should be designed and controlled jointly, rather than independently of each other. We then show in simulation that it is possible to use reinforcement learning techniques to generate socially appropriate orientation behavior for robots during group conversations. These techniques reduce the amount of engineering required to enable robots to sustain spatial formations typical of conversations while communicating attentiveness to the focus of attention of the interaction. Overall, our efforts show that reasoning about spatial patterns of behavior is useful for robots. This reasoning can help with perception tasks as well as generating appropriate robot behavior during social group conversations.
Towards a customizable PVS

PVS is a state-of-the-art theorem-proving tool developed by SRI International. It is used in a variety of academic and real-world applications by NASA and ICASE researchers, for whom tool customization and extensibility are becoming increasingly important issues. This paper shows, by referring to past experiences with several projects and case studies, that the customization features currently offered by PVS are often insufficient. It also suggests several improvements regarding PVS''s customization in the short run and regarding its extensibility in the long run.
Assessing Simple Policy Rules: A View from a Complete Macro Model

We explore two popular approaches to empirical analysis of monetary policy: the New Keynesian and the identified vector autoregression approaches. Stylized models of private behavior coupled with simple rules describing policy behavior characterize New Keynesian work. Vector autoregressions consist of minimally identified dynamic descriptions of private behavior coupled with a detailed rule for policy behavior. The simplicity of New Keynesian models aids in communication but leaves the models' implications vulnerable. By relating the New Keynesian models to identified vector autoregressions, we explore the differences and similarities in the two approaches and assess some of the key conclusions to emerge from New Keynesian research.
Biases in Particle Swarm Optimization

The most common versions of particle swarm optimization PSO algorithms are rotationally variant. It has also been pointed out that PSO algorithms can concentrate particles along paths parallel to the coordinate axes. In this paper, the authors explicitly connect these two observations by showing that the rotational variance is related to the concentration along lines parallel to the coordinate axes. Based on this explicit connection, the authors create fitness functions that are easy or hard for PSO to solve, depending on the rotation of the function.
Cross-Temporal and Cross-National Poverty and Mortality Rates among Developed Countries

A prime objective of welfare state activities is to take action to enhance population health and to decrease mortality risks. For several centuries, poverty has been seen as a key social risk factor in these respects. Consequently, the fight against poverty has historically been at the forefront of public health and social policy. The relationship between relative poverty rates and population health indicators is less self-evident, notwithstanding the obvious similarity to the debated topic of the relationship between population health and income inequality. In this study we undertake a comparative analysis of the relationship between relative poverty and mortality across 26 countries over time, with pooled cross-sectional time series analysis. We utilize data from the Luxembourg Income Study to construct age-specific poverty rates across countries and time covering the period from around 1980 to 2005, merged with data on age- and gender-specific mortality data from the Human Mortality Database. Our results suggest not only an impact of relative poverty but also clear differences by welfare regime that partly goes beyond the well-known differences in poverty rates between welfare regimes.
Does Guessing Incorrectly Impair Fact Learning ?

In learning new information through testing with feedback, is it best for the learner to guess when unsure, or does that cause errors to become engrained? On day 1, subjects learned 80 facts, and were then tested on each. When a subject reported being unable to give an informed response, on a randomly chosen half of all trials the computer insisted upon a guess and provided corrective feedback (either immediately, in Experiment 1, or at a delay, in Experiment 2). Subjects returned for a test on day 2. Forced guessing neither impaired nor facilitated day 2 recall. However, items that spontaneously elicited erroneous guesses on day 1 were more likely to be correctly recalled on day 2 than were items on which the subject refused to guess. Why would spontaneous guessing bode well, while forced guessing had no effect? An explanation in terms of error-correction learning algorithms is suggested, and simulations are presented to show the potential viability of this account. Practical implications are also discussed. 3 More than a century of research on learning and memory has provided students, instructors, and designers of computer-aided instruction systems with rather little concrete guidance on how to promote learning and retard forgetting. This conclusion is true even for the acquisition of facts, foreign language vocabulary, and other learning tasks with simple and clear criteria of success. One reason for the lack of practical translation from memory research may be that contemporary researchers have not focused on the sorts of concrete procedural choices that arise in real learning situations (Pashler, Rohrer, Cepeda, & Carpenter, 2007). Instead, investigators have tended to focus more on the nature of the materials to be learned, or the type of test used to assess learning—both of which are likely, in real-world contexts, to be dictated by the task at hand. The present article examines one particularly obvious and concrete question that confronts learners frequently, but which has been the focus of little study: when individuals have studied some information but have not yet fully mastered it, should they guess when presented with a quiz item on which they cannot answer with any confidence? Or should individuals avoid producing low-confidence guesses? The importance of the question is amplified by the fact that quizzing is normally far more useful in potentiating learning than re-studying or re-reading (for a review, see Roediger & Karpicke, 2006). The question also arises commonly in …
Query Terms Extraction from Patent Document for Invalidity Search

This paper describes our patent retrieval system participated in the NTCIR-5 Patent Retrieval Task, Document Retrieval Subtask. The main scope of our method is the appropriate query expansion to improve recall. We extracted query terms from the topic claim, and expanded query terms extracted from sentences explained in the patent document including the topic claim. The explanation sentences were extracted by the method based on pattern matching and by the method based on the longest common subsequence length.
Channel Allocation in Wireless Networks with Directional Antennas

In this paper, we study the channel allocation in multi-channel wireless ad hoc networks with directional antennas. In particular, we investigate the problem: given a set of wireless nodes equipped with directional antennas, how many channels are needed to ensure collision-free communications? We derive the upper bounds on the number of channels, which heavily depend on the node density and the interference ratio (i.e., the ratio of the interference range to the transmission range). We construct several scenarios to examine the tightness of the derived bounds. We also take the side-lobes and back-lobes as well as the signal path loss into our analysis. Our results can be used to estimate the number of channels required for a practical wireless network (e.g., wireless sensor network) with directional antennas.
Duality and equivalencies in closed tandem queueing networks

Equivalence relations between closed tandem queueing networks are established. Four types of models are under consideration: single-server infinite-capacity buffer queues, infinite-server queues with resequencing, single-server unit-capacity buffer queues with blocking before service, and single-server unit-capacity buffer queues with blocking after service. Using a customer/server duality we show that in a network consisting of single-server infinite-capacity-buffer queues, customer-dependent service times and server-dependent service times yield equivalent performance characteristics. We further show that for closed tandem queueing networks, a system consisting of single-server infinite-capacity-buffer queues (resp. infinite-server queues with resequencing) and a system consisting of single-serverunit-capacitybuffer queues with blocking before service (resp. blocking after service) have equivalent performance behaviors. As applications of these equivalence properties, we obtain new results on the analysis of symmetric closed tandem networks, where all the service times are independent and identically distributed random variables. In particular, we obtain a closed-form expression for the throughput of networks with unit-capacity-buffer queues and blocking before service when the service times are exponentially distributed. We also prove the monotonicity of throughput (of queues) with respect to the number of queues and number of customers in these models. This last property in turn implies the existence of nonzero asymptotic throughput when the number of queues and number of customers go to infinity.