Mining frequent generators and closures in data streams with FGC-Stream

Knowledge and Information Systems - Mining frequent itemsets (FIs) from data streams is a challenging task due to the limited resources available w.r.t. the typically large size of the result and...     

A Declarative Approach to Network Device Configuration Correctness

Configuration Logic (CL) is a formal language that allows a network engineer to express constraints in terms of the actual parameters found in the configuration of network devices. We present an efficient algorithm that can automatically check a pool of devices for conformance to a set of CL constraints; moreover, this algorithm can point to the part of the configuration responsible for the error when a constraint is violated. Contrary to other validation approaches that require dumping the configuration of the whole network to a central location in order to be verified, we also present an algorithm that analyzes the correct formulas and greatly helps reduce the amount of data that need to be transferred to that central location, pushing as much of the evaluation of the formula locally on each device. The procedure is also backwards-compatible, in such a way that a device that does not (or only partially) supports a local evaluation may simply return a subset or all of its configuration. These capabilities have been integrated into a network management tool called ValidMaker.     

On security arguments of the second round SHA-3 candidates

In 2007, the US National Institute for Standards and Technology (NIST) announced a call for the design of a new cryptographic hash algorithm in response to vulnerabilities like differential attacks identified in existing hash functions, such as MD5 and SHA-1. NIST received many submissions, 51 of which got accepted to the first round. 14 candidates were left in the second round, out of which five candidates have been recently chosen for the final round. An important criterion in the selection process is the SHA-3 hash function security. We identify two important classes of security arguments for the new designs: (1) the possible reductions of the hash function security to the security of its underlying building blocks and (2) arguments against differential attack on building blocks. In this paper, we compare the state of the art provable security reductions for the second round candidates and review arguments and bounds against classes of differential attacks. We discuss all the SHA-3 candidates at a high functional level, analyze, and summarize the security reduction results and bounds against differential attacks. Additionally, we generalize the well-known proof of collision resistance preservation, such that all SHA-3 candidates with a suffix-free padding are covered.     

Effect of photoaligning azo dye structure on liquid crystal anchoring energy

A method of controlling anchoring energy of surface interaction of liquid crystal photoaligning substances is considered to enhance the liquid crystal display performances. An important parameter of the dye's molecular structure that determines the ratio of polar and azimuthal anchoring energy is the ability to form dimers. The values of dimerization thermodynamic potentials have been found. The probability of the formation of dye molecules dimers is evaluated. The bonds conjugation transfer via intermolecular hydrogen bond is revealed, and anisotropy of polarizability of the hydrogen bond is evaluated. The effect of dimerization on polar and azimuthal anchoring energy of liquid crystal — azo dye system — is shown.     

A fast compound algorithm for mining generators,closed itemsets,and computing links between equivalence classes

In pattern mining and association rule mining, there is a variety of algorithms for mining frequent closed itemsets (FCIs) and frequent generators (FGs), whereas a smaller part further involves the precedence relation between FCIs. The interplay of these three constructs and their joint computation have been studied within the formal concept analysis (FCA) field yet none of the proposed algorithms is scalable. In frequent pattern mining, at least one suite of efficient algorithms has been designed that exploits basically the same ideas and follows the same overall computational schema. Based on an in-depth analysis of the aforementioned interplay that is rooted in a fundamental duality from hypergraph theory, we propose a new schema that should enable for a more parsimonious computation. We exemplify the new schema in the design of Snow-Touch, a concrete FCI/FG/precedence miner that reuses an existing algorithm, Charm, for mining FCIs, and completes it with two original methods for mining FGs and precedence, respectively. The performance of Snow-Touch and of its closest competitor, Charm-L, were experimentally compared using a large variety of datasets. The outcome of the experimental study suggests that our method outperforms Charm-L on dense data while on sparse one the trend is reversed. Furthermore, we demonstrate the usefulness of our method and the new schema through an application to the analysis of a genome dataset. The initial results reported here confirm the capacity of the method to focus on significant associations.     

Bifurcations in the trajectory problem as a cause of internal-time singularities and the onset of quantum (wave)chaos

A new theory is proposed for quantum-mechanical multichannel scattering in a collinear three-body system. This simple problem is used to show that the principle of quantum determinism is generally violated and we are dealing with microirreversible quantum mechanics. Fundamental calculations of quantum (wave) chaos are presented for the first time for the elementary reaction Li+(FH)→(LiFH)*→LiF+H. Pis’ma Zh. Tekh. Fiz. 25, 12–22 (August 26, 1999)