Vision transformers have recently gained great success on various computer vision tasks; nevertheless, their high model complexity makes it challenging to deploy resource-constrained devices. Quantization is an effective approach reduce complexity, and data-free quantization, which can address data privacy security concerns during deployment, has received widespread interest. Unfortunately, all...

We introduce a robust statistical approach to realization from Minimal Recursion Semantics representations. The approach treats realization as a translation problem, transforming the Dependency MRS graph representation to a surface string. Translation is based on a Synchronous Context-Free Grammar that is automatically extracted from a large corpus of parsed sentences. We have evaluated the new...

A searchable data structure for the edit-sensitive parsing (ESP) is proposed. Given a string S, its ESP tree is equivalent to a context-free grammar G generating just S, which is represented by a DAG. Using the succinct data structures for trees and permutations, G is decomposed to two LOUDS bit strings and single array in (1+ε)n log n+ 4n+o(n) bits for any 0 < ε < 1 and the number n of variabl...

Learners that have better metacognition acquire knowledge faster than others who do not. If we had better models of such learning, we would be able to build a better metacognitive educational system. In this paper, we propose a computational model that uses a probabilistic context free grammar induction algorithm yielding metacognitive learning by acquiring deep features to assist future learni...

MOTIVATION Favorable interaction between the regulatory subunit of the cAMP-dependent protein kinase (PKA) and a peptide in A-kinase anchoring proteins (AKAPs) is critical for translocating PKA to the subcellular sites where the enzyme phosphorylates its substrates. It is very hard to identify AKAPs peptides binding to PKA due to the high sequence diversity of AKAPs. RESULTS We propose a hier...

We propose a lattice framework for analyzing context-free grammars and contextfree languages. This framework is motivated by a technique for simplifying parsers with information derived from the associated scanners. We define the lattice framework and demonstrate it using additional applications, including data-flow analysis. Soundness and other properties of the lattice framework are also disc...

We study critical points of a Ginzburg-Landau type functional with an attractive-repulsive-attractive nonlocal interaction. Using an appropriate scaling and the Γ-convergence method we reduce the problem to a finite dimensional one. In contrast to a similar problem with just an attractive-repulsive interaction, we obtain a richer set of solutions. The soliton-stripe patterns appear as skewed lo...

We investigate a type of lossless source code called a grammar-based code, which, in response to any input data string over a fixed finite alphabet, selects a context-free grammar representing in the sense that is the unique string belonging to the language generated by . Lossless compression of takes place indirectly via compression of the production rules of the grammar . It is shown that, su...

The recursive method formalized by Nijenhuis and Wilf [15] and systematized by Flajolet, Van Cutsem and Zimmermann [8], is extended here to oating-point arithmetic. The resulting ADZ method enables one to generate decomposable data structures | both labelled or unlabelled | uniformly at random, in expected O(n ) time and space, after a preprocessing phase of O(n ) time, which reduces to O(n ) f...