Novel Computational Approach to Obtain Contact Angles: Application to Carbon Capture and Storage

Imperial Users onl

Communication strategy tool user guide

The application of Cradle to Cradle (C2C) principles in business sites is likely to be hampered by several barriers, some of which are socio-cultural in nature. To promote change and new thinking in the way business sites are designed, built and operated, there is the need to properly understand socio-cultural issues that create ‘lock-in’ to existing practices (Peterson and Anderson, 2009) so that these can be taken into account in the way C2C is presented to different business site stakeholders to secure their commitment to C2C inspired projects. These socio-cultural barriers are deeply rooted in the basic assumptions and value priorities of stakeholders. Strategies for communicating and promoting the C2C vision must therefore be aligned with such stakeholder value priorities and assumptions

Cause Clue Clauses: Error Localization using Maximum Satisfiability

Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization based on a reduction to the maximal satisfiability problem (MAX-SAT), which asks what is the maximum number of clauses of a Boolean formula that can be simultaneously satisfied by an assignment. At an intuitive level, our algorithm takes as input a program and a failing test, and comprises the following three steps. First, using symbolic execution, we encode a trace of a program as a Boolean trace formula which is satisfiable iff the trace is feasible. Second, for a failing program execution (e.g., one that violates an assertion or a post-condition), we construct an unsatisfiable formula by taking the trace formula and additionally asserting that the input is the failing test and that the assertion condition does hold at the end. Third, using MAX-SAT, we find a maximal set of clauses in this formula that can be satisfied together, and output the complement set as a potential cause of the error. We have implemented our algorithm in a tool called bug-assist for C programs. We demonstrate the surprising effectiveness of the tool on a set of benchmark examples with injected faults, and show that in most cases, bug-assist can quickly and precisely isolate the exact few lines of code whose change eliminates the error. We also demonstrate how our algorithm can be modified to automatically suggest fixes for common classes of errors such as off-by-one.Comment: The pre-alpha version of the tool can be downloaded from http://bugassist.mpi-sws.or

Cross-Correlation in cricket data and RMT

We analyze cross-correlation between runs scored over a time interval in cricket matches of different teams using methods of random matrix theory (RMT). We obtain an ensemble of cross-correlation matrices $C$ from runs scored by eight cricket playing nations for (i) test cricket from 1877 -2014 (ii)one-day internationals from 1971 -2014 and (iii) seven teams participating in the Indian Premier league T20 format (2008-2014) respectively. We find that a majority of the eigenvalues of C fall within the bounds of random matrices having joint probability distribution $P(x_1...,x_n)=C_{N \beta} \, \prod_{j<k}w(x_j)| x_j-x_k |^\beta$ where $w(x)=x^{N\beta a}\exp(-N\beta b x)$ and $\beta$ is the Dyson parameter. The corresponding level density gives Marchenko-Pastur (MP) distribution while fluctuations of every participating team agrees with the universal behavior of Gaussian Unitary Ensemble (GUE). We analyze the components of the deviating eigenvalues and find that the largest eigenvalue corresponds to an influence common to all matches played during these periods.Comment: 12 pages, 6 figure

Non-Destructive Discrimination of arbitrary set of orthogonal quantum states by NMR using Quantum Phase Estimation

An algorithm based on quantum phase estimation, which discriminates quantum states nondestructively within a set of arbitrary orthogonal states, is described and experimentally verified by a NMR quantum information processor. The procedure is scalable and can be applied to any set of orthogonal states. Scalability is demonstrated through Matlab simulation