Miracle-dz/UniFAR-FTUs huggingface dataset:
Development and runtime environment for embedded controller supporting ISO 11783 standard

Abstract ISO 11783 is becoming common to realize communication within a tractor implement system in an agricultural work machine. The ISO network minimally contains at least a tractor, a virtual terminal and a working set, which typically represents a single implement. The virtual terminal is a common device for all implements in the cabin and all the implements may upload their user interface to that. The developing process of an embedded controller that is capable of communicating within the network and use virtual terminal has been found to be challenging due to ISO standard complexity. In order to lower development costs, an objective is to provide development and runtime environment with which is quick and easy to design an embedded controller for agricultural machines. In the paper, this issue is discussed and the paper presents a software integration approach to reach the objective. The main parts of tool chain are PoolEdit (an open source ISO 11783 display editor), Matlab Simulink with C-code generation, and Visual Studio with Windows CE embedded target. The paper describes the tool chain and discusses challenges related to software integration. The paper presents also one machine controller implementation that was made with the presented tool chain, an ISO 11783 related test implement.
Stochastic distributions of lens and source properties for observed galactic microlensing events

A comprehensive new approach is presented for deriving probability densities of physical properties characterizing the lens and source that constitute an observed galactic microlensing event. While previously encountered problems are overcome, constraints from event anomalies and model parameter uncertainties can be incorporated into the estimates. Probability densities for given events need to be carefully distinguished from the statistical distribution of the same parameters among the underlying population from which the actual lenses and sources are drawn. Using given model distributions of the mass spectrum, the mass density, and the velocity distribution of Galactic disc and bulge constituents, probability densities of lens mass, distance, and the effective lens–source velocities are derived, where the effect on the distribution that arises from additional observations of annual parallax or finite-source effects, or the absence of significant effects, is shown. The presented formalism can also be used to calculate probabilities for the lens to belong to one or another population and to estimate parameters that characterize anomalies. Finally, it is shown how detection efficiency maps for binary-lens companions in the physical parameters, such as companion mass and orbital semimajor axis, arise from values determined for the mass ratio and dimensionless projected separation parameter, including the deprojection of the orbital motion for elliptical orbits. Compared to the naive estimate based on ‘typical values’, the detection efficiency for low-mass companions is increased by mixing in higher detection efficiencies for smaller mass ratios (i.e. smaller masses of the primary).
Discrete approach to stochastic parametrization and dimension reduction in nonlinear dynamics

Significance Many problems in science are too large and/or too complex to be fully analyzed by standard methods of computation. We present an approach where such problems are treated statistically, and the statistical analysis and the equations actually solved are discrete rather than continuous. We connect our approach to well-known results in statistical physics, and demonstrate its effectiveness in a widely used test problem. Many physical systems are described by nonlinear differential equations that are too complicated to solve in full. A natural way to proceed is to divide the variables into those that are of direct interest and those that are not, formulate solvable approximate equations for the variables of greater interest, and use data and statistical methods to account for the impact of the other variables. In the present paper we consider time-dependent problems and introduce a fully discrete solution method, which simplifies both the analysis of the data and the numerical algorithms. The resulting time series are identified by a NARMAX (nonlinear autoregression moving average with exogenous input) representation familiar from engineering practice. The connections with the Mori–Zwanzig formalism of statistical physics are discussed, as well as an application to the Lorenz 96 system.
Formal characterization and automated analysis of known-pair and chosen-text attacks

Formal methods have been successfully applied to exceedingly abstract system specifications to verify high level security properties such as authentication, key exchange, and fail-safe revocation. Furthermore, considerable research exists on evaluating particular ciphers and secure hash functions used to implement high level security properties. However, verifying that less abstract system specifications satisfy low level security properties has been largely impractical. This is evidenced by innumerable system vulnerabilities where high level properties are not attained due to failed assumptions of low level properties. This paper presents ongoing work on investigating known pairs and chosen text using the NRL Protocol Analyzer. We give a formal characterization of known and chosen pairs, and translate it to necessary and sufficiency conditions in the NRL Protocol Analyzer model. It is the first work the authors are aware of automatically discovering known-pair and chosen-text attacks. We describe the use of the analyzer to rediscover attacks, to find new variants of attacks on an early version of the ESP protocol, and to show how our experience in using it has led us to refine our model. This was the first use of the Analyzer to model protocols at such a low level of abstraction.
Recent Developments in Extracting Information from Options Markets

The Monetary Policy Committee is provided with information from options markets to quantify market uncertainty about the future course of financial asset prices. For short-term interest rates, this is shown in the Inflation Report's blue fan chart. Similar information can be obtained from a wide range of other assets. This article compares the performance of alternative techniques for extracting information from options prices. Using a technique for estimating uncertainty about interest rates at a constant horizon a short way into the future, we consider how this uncertainty has evolved since the Bank was granted operational independence in May 1997.
Suffix trees for universal source modeling with applications

Suffix trees are shown to reveal significant information about the internal structure of an individual sequence S. Specifically it is shown how the number of occurrences of any subsequence of S, the recurrence period for any subsequence that occurs at least twice in S, and the longest subsequence that occurs at least twice in S are determined from the sequences suffix tree. Since suffix trees can be constructed with low, O(N) computational complexity, they provide a powerful tool for information-theoretic sequence analysis. We further demonstrate the utility of suffix trees by using the collected statistics for two common problems in information theory: variable order source modeling and entropy estimation.
GPU Accelerated Array Queries: The Good, the Bad, and the Promising

 GPU Accelerated Array Queries: The Good, the Bad, and the Promising Feng Liu, Kyungyong Lee, Indrajit Roy, Vanish Talwar, Shimin Chen, Jichuan Chang, Parthasarthy Ranganathan HP Laboratories HPL-2014-50 GPU; SciDB; Database Array databases are well suited for complex multidimensional analysis. However, array queries are often performance constrained by the high computational demands of the underlying algorithms. We explore the use of GPU to accelerate these algorithms and study its end-to-end effects on performance, power, and energy efficiency. We have extended SciDB, a popular array database, to use GPUs and improved its query performance by 1.5X to 11X. While GPUs improve both performance and energy efficiency, multiple design issues limit us from reaching the touted 100X performance benefits of GPUs. We provide detailed experimental analysis to understand these bottlenecks related to array partitioning, load imbalance, and CPU-GPU hybrid execution. External Posting Date: October 6, 2014 [Fulltext] Approved for External Publication Internal Posting Date: October 6, 2014 [Fulltext] Copyright 2014 Hewlett-Packard Development Company, L.P. GPU Accelerated Array Queries: The Good, the Bad, and the Promising Feng Liu Kyungyong Lee Indrajit Roy Vanish Talwar Shimin Chen Jichuan Chang Parthasarthy Ranganathan HP Labs Abstract Array databases are well suited for complex multidimensional analysis. However, array queries are often performance constrained by the high computational demands of the underlying algorithms. We explore the use of GPU to accelerate these algorithms and study its endto-end effects on performance, power, and energy efficiency. We have extended SciDB, a popular array database, to use GPUs and improved its query performance by 1.5× to 11×. While GPUs improve both performance and energy efficiency, multiple design issues limit us from reaching the touted 100× performance benefits of GPUs. We provide detailed experimental analysis to understand these bottlenecks related to array partitioning, load imbalance, and CPU-GPU hybrid execution.Array databases are well suited for complex multidimensional analysis. However, array queries are often performance constrained by the high computational demands of the underlying algorithms. We explore the use of GPU to accelerate these algorithms and study its endto-end effects on performance, power, and energy efficiency. We have extended SciDB, a popular array database, to use GPUs and improved its query performance by 1.5× to 11×. While GPUs improve both performance and energy efficiency, multiple design issues limit us from reaching the touted 100× performance benefits of GPUs. We provide detailed experimental analysis to understand these bottlenecks related to array partitioning, load imbalance, and CPU-GPU hybrid execution.
Probing scalar tensor theories for gravity in redshift space

We present measurements of the spatial clustering statistics in redshift space of various scalar field modified gravity simulations. We utilise the two-point and the three-point correlation functions to quantify the spatial distribution of dark matter halos within these simulations and thus discern between the models. We compare $\Lambda$CDM simulations to various modified gravity scenarios and find consistency with previous work in terms of 2-point statistics in real and redshift-space. However using higher order statistics such as the three-point correlation function in redshift space we find significant deviations from $\Lambda$CDM hinting that higher order statistics may prove to be a useful tool in the hunt for deviations from General Relativity.
Load balanced routing with constant stretch for wireless sensor network with holes

Because of its simplicity and scalability, geographic routing is a popular approach in wireless sensor networks, which can achieve a near-optimal routing path in the networks without of holes. With the occurrence of holes, however, geographic routing faces the problems of hole diffusion and routing path enlargement. Several recent proposals attempt to fix these issues by deploying a special, forbidding area around the hole, which helps to improve the congestion on the hole boundary but still causes significant load imbalancing due to static detour routes bypassing this fixed forbidding area. Also, a significant enlargement on routing path is still possible due to the possibly significant difference between this forbidding area and the hole. Another recent approach can achieve a low route stretch (constant bounded) but still, the load imbalancing due to the holes is a concern. In this paper, we introduce a novel approach which is the first to target and solve both these two problems of hole diffusion and path enlargement. Our theoretical analysis proves the constant stretch property and our simulation experiments show that our scheme strongly outperforms the existing schemes in several performance factors, including route stretch, efficient use of energy and load balancing.
Interconnect power and delay optimization by dynamic programming in gridded design rules

The lithography used for 32 nanometers and smaller VLSI process technologies restricts the admissible interconnect widths and spaces to a small set of discrete values with some interdependencies, so that traditional interconnect sizing by continuous-variable optimization techniques becomes impossible. We present a dynamic programming (DP) algorithm for simultaneous sizing and spacing of all wires in interconnect bundles (or bus structures), yielding the optimal power-delay tradeoff curve. It sets the width and spacing of all interconnects simultaneously, thus finding the global optimum. The DP algorithm is generic and can handle a variety of power-delay objectives, such as total power or delay, or weighted sum of both, power-delay product, max delay and alike. The algorithm consistently yields more than 10% dynamic power and 5% delay reduction for interconnect channels in industrial microprocessor blocks designed in 32 nanometer process technology, when applied as a post-layout optimization step to redistribute wires within interconnect channels of fixed width, without changing the area of the original layout.
Multiobjective Evolutionary Algorithm for Lifetime Extension and Loading Balancing of Wireless Sensor Networks

Lifetime extension is a key issue of WSNs. The WSN lifetime can be extended K times if the number K of disjoint covers are found. Under the energy condition, another consideration is load balancing for covers to sense targets and transmit data to base station since sensors need to consume the energy to do these tasks. The energy consumption of sensors depends on the number of covered targets. Therefore, this work addresses a 2-objective optimization problem that to find the maximum number of covers for lifetime extension and to minimize the variance in the covered targets of sensors for every cover for load balancing. To resolve this problem, this work proposes three algorithms based on NSGA-II since it has better performance on two or three objectives of multi-objective optimization problems. Experimental results revealed conflicts among the objectives, to extend the lifetime lowered the load balancing of covers.
Omnidirectional stereo vision using fisheye lenses

This work presents an omnidirectional stereo system with a direct application to autonomous logistics. The omnidirectional system uses fisheye lenses to inspect the surroundings of the automated forklift. The lenses are mounted on the top of the vehicle to allow a 360° scene reconstruction with a single stereo pair. The system provides the list of obstacles detected around the vehicle. The reconstruction of the scene is possible via a division of the fisheye images into several rectified images. A stereo matching algorithm is applied to each pair of rectified images. The computed 3D points corresponding to the rectified pairs are unified into a single cloud. The obstacle detection module operates on the unified cloud of 3D points.
An Ontology Based Architecture for Translation

In this paper we present some features of an architecture for the translation (Italian - Italian Sign Language) that performs syntactic analysis, semantic interpretation and generation. Such architecture relies on an ontology that has been used to encode the domain of weather forecasts as well as information on language as part of the world knowledge. We present some general issues of the ontological semantic interpretation and discuss the analysis of ordinal numbers.
Functional thinking and generalisation in third year of primary school

This paper focuses on functional thinking as an approximation to algebraic thinking in third-year primary-school students. It describes a study with a class group of 24 Spanish pupils displaying functional thinking to solve a contextualised problem, identifying the type of functional relationships distinguished by these students and the ability to generalise observed in some of them. It contains an analysis of the information collected in one questionnaire, which is part of a teaching experiment. The students distinguished two types of functional relationships, correspondence and covariation, predominantly the former. Three students generalised as well
GIRK2 and neuronal pattern of generation and settling in homozygous weaver mice

Correspondence: Joaquin Marti Unidad de Citologia e Histologia, Facultad de Biociencias, Universitat Autonoma de Barcelona, 08193 Barcelona, Spain Tel +34 9 3581 1666 Fax +34 9 3581 3357 email joaquim.marti. clua@uab.es Abstract: G-protein-activated inwardly rectifying potassium (GIRK) channels play an important role in regulating neuronal excitability. Several GIRK channel subunits have been found in the central nervous system. The weaver mutation has been identified as a single base-pair substitution in the gene encoding for a GIRK channel subunit, GIRK2. The cerebellum and the mesencephalon are predominately affected in the homozygous weaver mouse (wv/wv). In this article, we review our main findings about the patterns of cell generation, survival, and settling of two neuronal types in the wv/wv: Purkinje cells in the cerebellar cortex and dopaminergic neurons in the ventral midbrain. Moreover, we examine if the time of neuron origin determines the degree of cell vulnerability to the lethal action of mutated GIRK2. The possible involvement of other GIRK channel subunits is also considered within the context of earlier and more recent studies in the field.
From modelling to inversion: designing a well‐adapted simulator

This paper describes a few mild design constraints that permit rapid adaptation of the modelling code for linear wave propagation to imaging/inversion or design optimization applications, retaining parallelism and other performance enhancements of the underlying simulator. It also describes an abstract software framework preserving the modularity of both optimization and modelling software in building inversion applications and illustrates this possibility via an example framework implemented in C++. Wave inverse problems tend to be afflicted by a variety of features, including extreme ill‐conditioning and nonlinearity, which degrade the performance of optimization formulations. Extended modelling variants of least‐squares inversion, motivated by migration velocity analysis, may relieve some of these difficulties. The framework described also accommodates these extensions to standard inversion.
The Dilution Effect and Information Integration in Perceptual Decision Making

In cognitive science there is a seeming paradox: On the one hand, studies of human judgment and decision making have repeatedly shown that people systematically violate optimal behavior when integrating information from multiple sources. On the other hand, optimal models, often Bayesian, have been successful at accounting for information integration in fields such as categorization, memory, and perception. This apparent conflict could be due, in part, to different materials and designs that lead to differences in the nature of processing. Stimuli that require controlled integration of information, such as the quantitative or linguistic information (commonly found in judgment studies), may lead to suboptimal performance. In contrast, perceptual stimuli may lend themselves to automatic processing, resulting in integration that is closer to optimal. We tested this hypothesis with an experiment in which participants categorized faces based on resemblance to a family patriarch. The amount of evidence contained in the top and bottom halves of each test face was independently manipulated. These data allow us to investigate a canonical example of sub-optimal information integration from the judgment and decision making literature, the dilution effect. Splitting the top and bottom halves of a face, a manipulation meant to encourage controlled integration of information, produced farther from optimal behavior and larger dilution effects. The Multi-component Information Accumulation model, a hybrid optimal/averaging model of information integration, successfully accounts for key accuracy, response time, and dilution effects.
The Utility of CSF for the Diagnosis of Primary and Secondary Monoamine Neurotransmitter Deficiencies

Biogenic amine defects constitute a complex and expanding group of neurotransmitter disorders affecting cognitive, motor and autonomic system development, mostly in the pediatric age. In recent years different enzymatic defects have been identified impairing the tetrahydrobiopterin cofactor pathway and/or biogenic amine synthesis, catabolism and transport, with subsequent new disease entities described. The lumbar puncture, with subsequent withdrawal of cerebrospinal fluid (CSF), remains a key step in the diagnostic procedure. Due to the specific nature of CSF, timing of analysis, sample collection and storage, technical issues of the analytic process are still crucial for the diagnosis and follow-up of patients. A progressive approach to the diagnosis of biogenic amine defects is presented, pointing out criticalities and difficulties concerning sample collection and results interpretation, especially due to the increasing reports of secondary neurotransmitter alterations that, at present, constitute a challenge.