Aximo: automated axiomatic reasoning for information update

Aximo is a software written in C++ that verifies epistemic properties of dynamic scenarios in multi-agent systems. The underlying logic of our tool is based on the algebraic axiomatics of Dynamic Epistemic Logic. We also present a new theoretical result: the worst case complexity of the verification problem of Aximo

Financial distress prediction using the hybrid associative memory with translation

This paper presents an alternative technique for financial distress prediction systems. The method is based on a type of neural network, which is called hybrid associative memory with translation. While many different neural network architectures have successfully been used to predict credit risk and corporate failure, the power of associative memories for financial decision-making has not been explored in any depth as yet. The performance of the hybrid associative memory with translation is compared to four traditional neural networks, a support vector machine and a logistic regression model in terms of their prediction capabilities. The experimental results over nine real-life data sets show that the associative memory here proposed constitutes an appropriate solution for bankruptcy and credit risk prediction, performing significantly better than the rest of models under class imbalance and data overlapping conditions in terms of the true positive rate and the geometric mean of true positive and true negative rates.This work has partially been supported by the Mexican CONACYT through the Postdoctoral Fellowship Program [232167], the Spanish Ministry of Economy [TIN2013-46522-P], the Generalitat Valenciana [PROMETEOII/2014/062] and the Mexican PRODEP [DSA/103.5/15/7004]. We would like to thank the Reviewers for their valuable comments and suggestions, which have helped to improve the quality of this paper substantially

Star operations for affine Hecke algebras

In this paper, we consider the star operations for (graded) affine Hecke algebras which preserve certain natural filtrations. We show that, up to inner conjugation, there are only two such star operations for the graded Hecke algebra: the first, denoted $\star$, corresponds to the usual star operation from reductive $p$-adic groups, and the second, denoted $\bullet$ can be regarded as the analogue of the compact star operation of a real group considered by \cite{ALTV}. We explain how the star operation $\bullet$ appears naturally in the Iwahori-spherical setting of $p$-adic groups via the endomorphism algebras of Bernstein projectives. We also prove certain results about the signature of $\bullet$-invariant forms and, in particular, about $\bullet$-unitary simple modules.Comment: 27 pages; section 3 and parts of sections 2 and 5 were previously contained in the first version of the preprint arXiv:1312.331

New Directions in Cloud Programming

Nearly twenty years after the launch of AWS, it remains difficult for most developers to harness the enormous potential of the cloud. In this paper we lay out an agenda for a new generation of cloud programming research aimed at bringing research ideas to programmers in an evolutionary fashion. Key to our approach is a separation of distributed programs into a PACT of four facets: Program semantics, Availablity, Consistency and Targets of optimization. We propose to migrate developers gradually to PACT programming by lifting familiar code into our more declarative level of abstraction. We then propose a multi-stage compiler that emits human-readable code at each stage that can be hand-tuned by developers seeking more control. Our agenda raises numerous research challenges across multiple areas including language design, query optimization, transactions, distributed consistency, compilers and program synthesis