Accuracy estimate and optimization techniques for SimRank computation

The measure of similarity between objects is a very useful tool in many areas of computer science, including information retrieval. SimRank is a simple and intuitive measure of this kind, based on a graph-theoretic model. SimRank is typically computed iteratively, in the spirit of PageRank. However, existing work on SimRank lacks accuracy estimation of iterative computation and has discouraging time complexity. In this paper, we present a technique to estimate the accuracy of computing SimRank iteratively. This technique provides a way to find out the number of iterations required to achieve a desired accuracy when computing SimRank. We also present optimization techniques that improve the computational complexity of the iterative algorithm from O(n ⁴) in the worst case to min(O(nl), O(n ³/ log₂ n)), with n denoting the number of objects, and l denoting the number object-to-object relationships. We also introduce a threshold sieving heuristic and its accuracy estimation that further improves the efficiency of the method. As a practical illustration of our techniques, we computed SimRank scores on a subset of English Wikipedia corpus, consisting of the complete set of articles and category links.     

Optimal allocation–consumption problem for a portfolio with an illiquid asset

During financial crises investors manage portfolios with low liquidity, where the paper-value of an asset differs from the price proposed by the buyer. We consider an optimization problem for a portfolio with an illiquid, a risky and a risk-free asset. We work in the Merton's optimal consumption framework with continuous time. The liquid part of the investment is described by a standard Black–Scholes market. The illiquid asset is sold at a random moment with prescribed distribution and generates additional liquid wealth dependent on its paper-value. The investor has a hyperbolic absolute risk aversion also denoted as HARA-type utility function, in particular, the logarithmic utility function as a limit case. We study two different distributions of the liquidation time of the illiquid asset – a classical exponential distribution and a more practically relevant Weibull distribution. Under certain conditions we show the smoothness of the viscosity solution and obtain closed formulae relevant for numerics.     

Towards a set of agrosystem-specific cropland mapping methods to address the global cropland diversity

Accurate cropland information is of paramount importance for crop monitoring. This study compares five existing cropland mapping methodologies over five contrasting Joint Experiment for Crop Assessment and Monitoring (JECAM) sites of medium to large average field size using the time series of 7-day 250 m Moderate Resolution Imaging Spectroradiometer (MODIS) mean composites (red and near-infrared channels). Different strategies were devised to assess the accuracy of the classification methods: confusion matrices and derived accuracy indicators with and without equalizing class proportions, assessing the pairwise difference error rates and accounting for the spatial resolution bias. The robustness of the accuracy with respect to a reduction of the quantity of calibration data available was also assessed by a bootstrap approach in which the amount of training data was systematically reduced. Methods reached overall accuracies ranging from 85% to 95%, which demonstrates the ability of 250 m imagery to resolve fields down to 20 ha. Despite significantly different error rates, the site effect was found to persistently dominate the method effect. This was confirmed even after removing the share of the classification due to the spatial resolution of the satellite data (from 10% to 30%). This underlines the effect of other agrosystems characteristics such as cloudiness, crop diversity, and calendar on the ability to perform accurately. All methods have potential for large area cropland mapping as they provided accurate results with 20% of the calibration data, e.g. 2% of the study area in Ukraine. To better address the global cropland diversity, results advocate movement towards a set of cropland classification methods that could be applied regionally according to their respective performance in specific landscapes.     

From Autonomy to Cooperative Traded Control of Humanoid Manipulation Tasks with Unreliable Communication

In this paper, we present our system design, operational procedure, testing process, field results, and lessons learned for the valve-turning task of the DARPA Robotics Challenge (DRC). We present a software framework for cooperative traded control that enables a team of operators to control a remote humanoid robot over an unreliable communication link. Our system, composed of software modules running on-board the robot and on a remote workstation, allows the operators to specify the manipulation task in a straightforward manner. In addition, we have defined an operational procedure for the operators to manage the teleoperation task, designed to improve situation awareness and expedite task completion. Our testing process, consisting of hands-on intensive testing, remote testing, and remote practice runs , demonstrates that our framework is able to perform reliably and is resilient to unreliable network conditions. We analyze our approach, field tests, and experience at the DRC Trials and discuss lessons learned which may be useful for others when designing similar systems.     

Gathering identical autonomous systems on a circle using stigmergy

In this paper we provide a protocol solving the problem of gathering of identical autonomous systems (aka ants) on a circle. In our biologically inspired model the autonomous systems are unable to communicate directly, instead they employ the mechanism of pheromone marking. The gathering on a circle is not always solvable, however our protocol will terminate in finite time if ants are in a general initial position. Since the gathering problem on a line is unsolvable for obvious reasons for any non-degenerate initial position, this implies that if the ants are in generic initial position they will be able to decide in finite time whether they are on a line or on a circle. We give asymptotic bounds for the time our protocol needs to terminate, and show that for fixed number of ants, the termination time of any protocol can be arbitrarily long. Finally, our protocol may be adopted to the case of asynchronous drop-downs and starting times of the autonomous systems.     

Linear color segmentation and its implementation

A framework for color image segmentation is presented, which combines color histogram analysis and region merging approach. Its main goal is to segment an image at material boundaries (i.e., discontinuities of reflectance properties) while ignoring spatial color inhomogeneities of uniformly pigmented (colored) objects, caused by accidents of illumination and viewing geometry. Theoretical examination of light spectrum transformations upon light reflection from material surfaces and upon interaction with a sensor system shows that in a wide variety of viewed scenes (even containing interreflections and highlight areas) uniformly pigmented objects are projected to the color space of the sensor as planar, linear, or point-like clusters, depending on lighting and viewing conditions and object geometry. To detect such clusters in the color space, three methods are suggested: Generalized Hough Transform method, gradient descent method, and eigenvectors method. A framework algorithm of color segmentation based on region merging approach is developed, which can use any of these methods. Testing this algorithm with both artificially generated and real images shows quite reliable results.     

Carbon nanotube field emitters for planar emission vacuum micro-and nanoelectronics

The design and manufacturing technology of carbon nanotube field emitters for novel devices of planar emission vacuum micro-and nanoelectronics are described. Prototypes of diode structures with such emitters are obtained in which the threshold field strength amounts to ～2 V/μm and the direct to reverse current ratio exceeds 10⁵. The obtained small scatter of characteristics points to the possibility of creating integrated circuits possessing high operation speed and a working temperature range expanded from ?60 to +30°C.     

Multi-Agent Dynamic Logics with Informational Test

This paper investigates a family of logics for reasoning about the dynamic activities and informational attitudes of agents, namely the agents' beliefs and knowledge. The logics are based on a new formalisation and semantics of the test operator of propositional dynamic logic and a representation of actions which distinguishes abstract actions from concrete actions. The new test operator, called informational test, can be used to formalise the beliefs and knowledge of particular agents as dynamic modalities. This approach is consistent with the formalisation of the agents' beliefs and knowledge as K(D)45 and S5 modalities. Properties concerning informativeness, truthfulness and preservation of beliefs are proved for a derivative of the informational test operator. It is shown that common belief and common knowledge can be expressed in the considered logics. This means, the logics are more expressive than propositional dynamic logic with an extra modality for belief or knowledge. The logics remain decidable and belong to 2EXPTIME. Versions of the considered logics express natural additional properties of beliefs or knowledge and interaction of beliefs or knowledge with actions. It is shown that a simulation of PDL can be constructed in one of these extensions.     

Geometry control of the junction between two fractal curves

The general objective of our work is to create a geometric modeller based on iterative processes. With this objective in mind, we have to provide tools that work with fractal objects in the same manner as with objects of classical topology. In this article we focus on the constructing of an intermediate curve between two other curves defined by different iterative construction processes. A similar problem often arises with subdivision surfaces, when the goal is to connect two surfaces with different subdivision masks. We start by dealing with curves, willing to later generalise our approach to surfaces. We formalise the problem with the Boundary Controlled Iterated Function System model. Then we deduct the conditions that guarantees continuity of the intermediate curve. These conditions determine the structure of subdivision matrices. By studying the eigenvalues of the subdivision operators, we characterise the differential behaviour at the connection points between the curves and the intermediate one. This behaviour depends on the nature of the initial curves and coefficients of the subdivision matrices. We also suggest a method to control the differential behaviour by adding intermediate control points.