A Trustability Metric for Code Search based on Developer Karma

The promise of search-driven development is that developers will save time and resources by reusing external code in their local projects. To efficiently integrate this code, users must be able to trust it, thus trustability of code search results is just as important as their relevance. In this paper, we introduce a trustability metric to help users assess the quality of code search results and therefore ease the cost-benefit analysis they undertake trying to find suitable integration candidates. The proposed trustability metric incorporates both user votes and cross-project activity of developers to calculate a "karma" value for each developer. Through the karma value of all its developers a project is ranked on a trustability scale. We present JBENDER, a proof-of-concept code search engine which implements our trustability metric and we discuss preliminary results from an evaluation of the prototype.

A Metric to Evaluate and Synthesize Distributed Compliant Mechanisms

Compliant mechanisms with evenly distributed stresses have better load-bearing ability and larger range of motion than mechanisms with compliance and stresses lumped at flexural hinges. In this paper, we present a metric to quantify how uniformly the strain energy of deformation and thus the stresses are distributed throughout the mechanism topology. The resulting metric is used to optimize cross-sections of conceptual compliant topologies leading to designs with maximal stress distribution. This optimization framework is demonstrated for both single-port mechanisms and single-input single-output mechanisms. It is observed that the optimized designs have lower stresses than their nonoptimized counterparts, which implies an ability for single-port mechanisms to store larger strain energy, and single-input single-output mechanisms to perform larger output work before failure.

Analytical form of the Probability Density Function of travel times in rectangular zone with Tchebyshev’s metric

Geometrical dependencies are being researched for analytical representation of the probability density function (pdf) for the travel time between a random, and a known or another random point in Tchebyshev’s metric. In the most popular case - a rectangular area of service - the pdf of this random variable depends directly on the position of the server. Two approaches have been introduced for the exact analytical calculation of the pdf: Ad-hoc approach – useful for a ‘manual’ solving of a specific case; by superposition – an algorithmic approach for the general case. The main concept of each approach is explained, and a short comparison is done to prove the faithfulness.

Dimension Distortion by Sobolev Mappings in Foliated Metric Spaces

We quantify the extent to which a supercritical Sobolev mapping can increase the dimension of subsets of its domain, in the setting of metric measure spaces supporting a Poincaré inequality. We show that the set of mappings that distort the dimensions of sets by the maximum possible amount is a prevalent subset of the relevant function space. For foliations of a metric space X defined by a David–Semmes regular mapping Π : X → W, we quantitatively estimate, in terms of Hausdorff dimension in W, the size of the set of leaves of the foliation that are mapped onto sets of higher dimension. We discuss key examples of such foliations, including foliations of the Heisenberg group by left and right cosets of horizontal subgroups.