Probabilism,entropies and strictly proper scoring rules

Accuracy arguments are the en vogue route in epistemic justifications of probabilism and further norms governing rational belief. These arguments often depend on the fact that the employed inaccuracy measure is strictly proper. I argue controversially that it is ill-advised to assume that the employed inaccuracy measures are strictly proper and that strictly proper statistical scoring rules are a more natural class of measures of inaccuracy. Building on work in belief elicitation I show how strictly proper statistical scoring rules can be used to give an epistemic justification of probabilism.An agent's evidence does not play any role in these justifications of probabilism. Principles demanding the maximisation of a generalised entropy depend on the agent's evidence. In the second part of the paper I show how to simultaneously justify probabilism and such a principle. I also investigate scoring rules which have traditionally been linked with entropies.     

Differential Entropy and Dynamics of Uncertainty

We analyze the functioning of Gibbs-type entropy functionals in the time domain, with emphasis on Shannon and Kullback-Leibler entropies of time-dependent continuous probability distributions. The Shannon entropy validity is extended to probability distributions inferred from L ²(R ⁿ ) quantum wave packets. In contrast to the von Neumann entropy which simply vanishes on pure states, the differential entropy quantifies the degree of probability (de)localization and its time development. The associated dynamics of the Fisher information functional quantifies nontrivial power transfer processes in the mean, both in dissipative and quantum mechanical cases. PACS NUMBERS: 05.45.+b, 02.50.-r, 03.65.Ta, 03.67.-a     

TOF-SIMS imaging of chlorhexidine-digluconate transport in frozen hydrated biofilms of the fungus Candida albicans

The diffusion of the anti-microbial chlorhexidine digluconate (CHG) has been studied in C. albicans biofilms by time-of-flight secondary-ion mass spectrometry (TOF-SIMS). C. albicans has been shown to become resistant to common anti-microbial agents, including CHG, when growing as a biofilm. Mass transport resistance within biofilms has commonly been suggested as a resistance mechanism, but measurement of transport for most anti-microbial agents in biofilms has proven extremely difficult because of the heterogeneity of the biofilms and the difficulty in detecting these agents within an intact biofilm. In this study, TOF-SIMS has been used to study the transport of CHG and glucose in a frozen hydrated biofilm. The TOF-SIMS images reveal a progression of CHG from the top of the biofilm to its base with time. Images suggest that there are channels within the biofilm and show preferential binding of CHG to cellular components of the biofilm. Additionally, both living and dead cells can be identified in the TOF-SIMS images by the sequestration of K⁺ and the presence of cell markers. This study demonstrates that TOF-SIMS has the unique potential to simultaneously observe the presence of an antimicrobial agent, concentration of nutrients, and the viability of the cell population.     

Dynamic surface tension measurements of surfactant solutions using the maximum bubble pressure method – limits of applicability

One of the essential differences in the design of bubble pressure tensiometers consists in the geometry of the measuring capillaries. To reach extremely short adsorption times of milliseconds and below, the so-called deadtime of the capillaries must be of the order of some 10 ms. In particular, for concentrated surfactant solutions, such as micellar solutions, short deadtimes are needed to minimize the initial surfactant load of the generated bubbles. A theoretical model is derived and confirmed by experiments performed for a wide range of experimental conditions, mainly in respect to variations in deadtime and bubble volume.     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

A greedy algorithm for multicut and integral multiflow in rooted trees

We present an O(min(Kn,n²)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality.     

A Note on Topological Entropy of Maps

For a given collection of subsets of a compact metric space X which cover X,the entropies,hm(f)and hi(f),are introduced for a continuous map f of X to itseif. Also the concept of shadowing property with same end point (SPSEP for short) is introduced. The main results are,(1)H(f)≤hi(f)+hm(f)and,(2)h(f)=hm(f)whenever f has SPSEP,where h(f) is the topological entropy of f. Moreover,several corollaries are obtained.