NICTA (National ICT Australia) participated in the Medical Records track of TREC 2011 with seven automatic runs. The main techniques used in our submissions involved using Boolean retrieval for filtering, query transformation, and query expansion. Evaluation of our best run ranks our submissions higher than the median of all systems for this track, and stands at rank seven among 109 automatic r...

Leading text extracts created to support some online Boolean retrieval goals are evaluated for their acceptability as news document summaries. Results are presented and discussed from the perspective of commercial summarization technology needs.

It has been shown that bounded model checking using a SAT solver can solve many verification problems that would cause BDD based symbolic model checking engines to explode. However, no single algorithmic solution has proven to be totally superior in resolving all types of model checking problems. We present an optimized bounded model checker based on BDDs and describe the advantages and drawbac...

We investigate an extended model of spiking neural P systems incorporating astrocytes and their excitatory or inhibitory influence on axons between neurons. Using very restricted variants of extended spiking neural P systems with excitatory and inhibitory astrocytes we can easily model Boolean gates like NAND-gates as well as discrete amplifiers. Key–Words: Astrocytes, Boolean functions, spikin...

This report surveys some key results on the learning of Boolean functions in a probabilistic model that is a generalization of the well-known ‘PAC’ model. A version of this is to appear as a chapter in a book on Boolean functions, but the report itself is relatively self-contained.

When using Bayesian networks for modelling the behavior of man-made machinery, it usu­ ally happens that a large part of the model is deterministic. For such Bayesian networks the deterministic part of the model can be represented as a Boolean function, and a cen­ tral part of belief updating reduces to the task of calculating the number of satisfying configurations in a Boolean function. In th...

An approximate representation for the state space of a context-sensitive probabilistic Boolean network has previously been proposed and utilized to devise therapeutic intervention strategies. Whereas the full state of a context-sensitive probabilistic Boolean network is specified by an ordered pair composed of a network context and a gene-activity profile, this approximate representation collap...

In this note we show that model checking Coalition Logic over Concurrent Game Structures in which the transition function is given implicitly by a set of Boolean formulae is ∆3 -complete.

A method for structure discovery is described. We assume that an unknown composite structure is sampled and observed as a set of small relational structure fractions. Each fraction is described by a set of atoms and their relations. We propose a technique that allows fusing these fractions into large components or the structure itself. The method is demonstrated using an example taken from the ...

2 Probabilistic modelling of learning 4 2.1 A probabilistic model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 A learnability result for Boolean classes . . . . . . . . . . . . . . . . . . . . 6 2.4 Learning monomials . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.5 Di...