Weighted alpha-rate dominating sets in social networks

We are looking into variants of a domination set problem in social networks. While randomised algorithms for solving the minimum weighted domination set problem and the minimum alpha and alpha-rate domination problem on simple graphs are already present in the literature, we propose here a randomised algorithm for the minimum weighted alpha-rate domination set problem which is, to the best of our knowledge, the first such algorithm. A theoretical approximation bound based on a simple randomised rounding technique is given. The algorithm is implemented in Python and applied to a UK Twitter mentions networks using a measure of individuals’ influence (klout) as weights. We argue that the weights of vertices could be interpreted as the costs of getting those individuals on board for a campaign or a behaviour change intervention. The minimum weighted alpha-rate dominating set problem can therefore be seen as finding a set that minimises the total cost and each individual in a network has at least alpha percentage of its neighbours in the chosen set. We also test our algorithm on generated graphs with several thousand vertices and edges. Our results on this real-life Twitter networks and generated graphs show that the implementation is reasonably efficient and thus can be used for real-life applications when creating social network based interventions, designing social media campaigns and potentially improving users’ social media experience.

The full infinite dimensional moment problem on semi-algebraic sets of generalized functions

We consider a generic basic semi-algebraic subset S of the space of generalized functions, that is a set given by (not necessarily countably many) polynomial constraints. We derive necessary and sufficient conditions for an infinite sequence of generalized functions to be realizable on S, namely to be the moment sequence of a finite measure concentrated on S. Our approach combines the classical results about the moment problem on nuclear spaces with the techniques recently developed to treat the moment problem on basic semi-algebraic sets of Rd. In this way, we determine realizability conditions that can be more easily verified than the well-known Haviland type conditions. Our result completely characterizes the support of the realizing measure in terms of its moments. As concrete examples of semi-algebraic sets of generalized functions, we consider the set of all Radon measures and the set of all the measures having bounded Radon–Nikodym density w.r.t. the Lebesgue measure.

Identifying the Open-Closed Field Line Boundary

Of all the various definitions of the polar cap boundary that have been used in the past, the most physically meaningful and significant is the boundary between open and closed field lines. Locating this boundary is very important as it defines which regions and phenomena are on open field lines and which are on closed. This usually has fundamental implications for the mechanisms invoked. Unfortunately, the open-closed boundary is usually very difficult to identify, particularly where it maps to an active reconnection site. This paper looks at the topological reconnection classes that can take place, both at the magnetopause and in the cross-tail current sheet and discusses the implications for identifying the open-closed boundary when reconnection is giving velocity filter dispersion of signatures. On the dayside, it is shown that the dayside boundary plasma sheet and low-latitude boundary layer precipitations are well explained as being on open field lines, energetic ions being present because of reflection of central plasma sheet ions off the two Alfvén waves launched by the reconnection site (the outer one of which is the magnetopause). This also explains otherwise anomalous features of the dayside convection pattern in the cusp region. On the nightside, similar considerations place the open-closed boundary somewhat poleward of the velocity-dispersed ion structures which are a signature of the plasma sheet boundary layer ion flows in the tail.

Relationship of dayside auroral precipitations to the open-closed separatrix and the pattern of convective flow

The implications are discussed of acceleration of magnetospheric ions by reflection off two magnetopause Alfvén waves, launched by the reconnection site into the inflow regions on both sides of the boundary. The effects of these waves on the ion populations, predicted using the model described by Lockwood et al. [1996], offer a physical interpretation of all the various widely used classifications of precipitation into the dayside ionosphere, namely, central plasma sheet, dayside boundary plasma sheet (BPS), void, low-latitude boundary layer (LLBL), cusp, mantle, and polar cap. The location of the open-closed boundary and the form of the convection flow pattern are discussed in relation to the regions in which these various precipitations are typically found. Specifically, the model predicts that both the LLBL and the dayside BPS precipitations are on newly opened field lines and places the convection reversal within the LLBL, as is often observed. It is shown that this offers solutions to a number of paradoxes and problems that arise if the LLBL and BPS precipitations are thought of as being on closed field lines. This model is also used to make quantitive predictions of the longitudinal extent and latitudinal width of the cusp, as a function of solar wind density.

Rapid preconditioning of data for accelerating convex hull algorithms

Given a dataset of two-dimensional points in the plane with integer coordinates, the method proposed reduces a set of n points down to a set of s points s ≤ n, such that the convex hull on the set of s points is the same as the convex hull of the original set of n points. The method is O(n). It helps any convex hull algorithm run faster. The empirical analysis of a practical case shows a percentage reduction in points of over 98%, that is reflected as a faster computation with a speedup factor of at least 4.

Investigating music tempo as a feedback mechanism for closed-loop BCI control

The feedback mechanism used in a brain-computer interface (BCI) forms an integral part of the closed-loop learning process required for successful operation of a BCI. However, ultimate success of the BCI may be dependent upon the modality of the feedback used. This study explores the use of music tempo as a feedback mechanism in BCI and compares it to the more commonly used visual feedback mechanism. Three different feedback modalities are compared for a kinaesthetic motor imagery BCI: visual, auditory via music tempo, and a combined visual and auditory feedback modality. Visual feedback is provided via the position, on the y-axis, of a moving ball. In the music feedback condition, the tempo of a piece of continuously generated music is dynamically adjusted via a novel music-generation method. All the feedback mechanisms allowed users to learn to control the BCI. However, users were not able to maintain as stable control with the music tempo feedback condition as they could in the visual feedback and combined conditions. Additionally, the combined condition exhibited significantly less inter-user variability, suggesting that multi-modal feedback may lead to more robust results. Finally, common spatial patterns are used to identify participant-specific spatial filters for each of the feedback modalities. The mean optimal spatial filter obtained for the music feedback condition is observed to be more diffuse and weaker than the mean spatial filters obtained for the visual and combined feedback conditions.

A method for merging nadir-sounding climate records, with an application to the global-mean stratospheric temperature data sets from SSU and AMSU

A method is proposed for merging different nadir-sounding climate data records using measurements from high-resolution limb sounders to provide a transfer function between the different nadir measurements. The two nadir-sounding records need not be overlapping so long as the limb-sounding record bridges between them. The method is applied to global-mean stratospheric temperatures from the NOAA Climate Data Records based on the Stratospheric Sounding Unit (SSU) and the Advanced Microwave Sounding Unit-A (AMSU), extending the SSU record forward in time to yield a continuous data set from 1979 to present, and providing a simple framework for extending the SSU record into the future using AMSU. SSU and AMSU are bridged using temperature measurements from the Michelson Interferometer for Passive Atmospheric Sounding (MIPAS), which is of high enough vertical resolution to accurately represent the weighting functions of both SSU and AMSU. For this application, a purely statistical approach is not viable since the different nadir channels are not sufficiently linearly independent, statistically speaking. The near-global-mean linear temperature trends for extended SSU for 1980–2012 are −0.63 ± 0.13, −0.71 ± 0.15 and −0.80 ± 0.17 K decade−1 (95 % confidence) for channels 1, 2 and 3, respectively. The extended SSU temperature changes are in good agreement with those from the Microwave Limb Sounder (MLS) on the Aura satellite, with both exhibiting a cooling trend of ~ 0.6 ± 0.3 K decade−1 in the upper stratosphere from 2004 to 2012. The extended SSU record is found to be in agreement with high-top coupled atmosphere–ocean models over the 1980–2012 period, including the continued cooling over the first decade of the 21st century.

A multifractal zeta function for Gibbs measures supported on cookie-cutter sets

Starting with the work of Lapidus and van Frankenhuysen a number of papers have introduced zeta functions as a way of capturing multifractal information. In this paper we propose a new multifractal zeta function and show that under certain conditions the abscissa of convergence yields the Hausdorff multifractal spectrum for a class of measures.

On the cardinality and complexity of the set of codings for self-similar sets with positive Lebesgue measure

Let λ1,…,λn be real numbers in (0,1) and p1,…,pn be points in Rd. Consider the collection of maps fj:Rd→Rd given by fj(x)=λjx+(1−λj)pj. It is a well known result that there exists a unique nonempty compact set Λ⊂Rd satisfying Λ=∪nj=1fj(Λ). Each x∈Λ has at least one coding, that is a sequence (ϵi)∞i=1 ∈{1,…,n}N that satisfies limN→∞fϵ1…fϵN(0)=x. We study the size and complexity of the set of codings of a generic x∈Λ when Λ has positive Lebesgue measure. In particular, we show that under certain natural conditions almost every x∈Λ has a continuum of codings. We also show that almost every x∈Λ has a universal coding. Our work makes no assumptions on the existence of holes in Λ and improves upon existing results when it is assumed Λ contains no holes.

On univoque points for self-similar sets

Let K⊆R be the unique attractor of an iterated function system. We consider the case where K is an interval and study those elements of K with a unique coding. We prove under mild conditions that the set of points with a unique coding can be identified with a subshift of finite type. As a consequence, we can show that the set of points with a unique coding is a graph-directed self-similar set in the sense of Mauldin and Williams (1988). The theory of Mauldin and Williams then provides a method by which we can explicitly calculate the Hausdorff dimension of this set. Our algorithm can be applied generically, and our result generalises the work of Daróczy, Kátai, Kallós, Komornik and de Vries.

Arnold v. Britton: a ratio and two sets of obiter dicta

Arnold v Britton marks the final stage of the longstanding dispute as to the correct interpretation of a number of 99-year leases of chalets on a leisure park at Oxwich, in the Gower peninsula, near Swansea. The aspect of the case which has attracted most discussion has, understandably, been its main ratio: the proper way to construe a provision of a lease which arguably has an absurd result. This will be considered in this case-note. The judgment of the Supreme Court – particularly the judgment of Lord Neuberger PSC – does, however contain some observations on the possible reform of the law on service charges which are of interest to those engaged in this field. It also contains some obiter comments on ‘letting schemes’ which are – in the view of the present author – highly unorthodox. These three rather disparate issues which are raised by this case will be considered in turn. As they have little in common with each other, they will be considered as separate sections.

Preconditioning 2D integer data for fast convex hull computations

In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.

Closed-loop feedback computation model of dynamical reputation based on the local trust evaluation in business-to-consumer e-commerce

Trust and reputation are important factors that influence the success of both traditional transactions in physical social networks and modern e-commerce in virtual Internet environments. It is difficult to define the concept of trust and quantify it because trust has both subjective and objective characteristics at the same time. A well-reported issue with reputation management system in business-to-consumer (BtoC) e-commerce is the “all good reputation” problem. In order to deal with the confusion, a new computational model of reputation is proposed in this paper. The ratings of each customer are set as basic trust score events. In addition, the time series of massive ratings are aggregated to formulate the sellers’ local temporal trust scores by Beta distribution. A logical model of trust and reputation is established based on the analysis of the dynamical relationship between trust and reputation. As for single goods with repeat transactions, an iterative mathematical model of trust and reputation is established with a closed-loop feedback mechanism. Numerical experiments on repeated transactions recorded over a period of 24 months are performed. The experimental results show that the proposed method plays guiding roles for both theoretical research into trust and reputation and the practical design of reputation systems in BtoC e-commerce.