03/15/2012 Lecture 16: CS 880: Complexity of Counting Problems Instructor: Jin-Yi Cai Scribe: Chen Zeng For a symmetric, bipartite matrix A ∈ C, we want to prove the following theorem: Theorem 1. If EVAL(A) is not #P-hard, then there exists an m × m purified bipartite matrix A such that EVAL(A) ≡ EVAL(A). Recall the definition of the purified bipartite matrix : Definition 1. Let A ∈ C be a symm...

Memoization, such as that performed by bottom-up evaluation, helps detect loops, avoid repeated computation when subgoals are generated repeatedly, and in conjunction with a fair search strategy, ensures that evaluation is complete. Programs that generate non-ground facts (i.e., facts containing universally quantiied variables) and also need memoization are important in several contexts. Curren...

Take the ethylene-vinyl alcohol (EVAL) copolymer as the infrastructural material, the anion exchange resin D301R as the functional grains, adopt dry-wet method to make resin-filled EVAL hollow fiber membrane, test the pure water flux of the membrane, the rejection rate of the bovine serum albumin (BSA) and the static absorption performance of BSA. Check the influences of coagulation bath temper...

The paper reports on the recent forum RU-EVAL ‒ a new initiative for evaluation of Russian NLP resources, methods and toolkits. It started in 2010 with evaluation of morphological parsers, and the second event RU-EVAL 2012 (2011-2012) focused on syntactic parsing. Eight participating IT companies and academic institutions submitted their results for corpus parsing. We discuss the results of thi...

In this paper we describe the LG-Eval toolkit for creating online language evaluation experiments. LG-Eval is the direct result of our work setting up and carrying out the human evaluation experiments in several of the Generation Challenges shared tasks. It provides tools for creating experiments with different kinds of rating tools, allocating items to evaluators, and collecting the evaluation...

It is often necessary to associate weights or other values with the edges of a graph. Such a “weighted” or “edge-labeled” graph can be defined as a triple G = (E, V, w) where w : E → eVal is a function mapping edges or directed edges to their values, and eVal is the set (type) of possible values. For a weighted graph eVal would typically be the real numbers, but for edge-labeled graphs they cou...

We propose a new class of rigorous methods for derivative-free optimization with the aim delivering efficient and robust numerical performance functions all types, from smooth to non-smooth, under different noise regimes. To this end, we have developed methods, called Full-Low Evaluation organized around two main types iterations. The first iteration type (called Full-Eval) is expensive in func...

Most dynamic languages allow users to turn text into code using various functions, often named <tt>eval</tt>, with language-dependent semantics. The widespread use of these reflective functions hinders static analysis and prevents compilers from performing optimizations. This paper aims provide a better sense why programmers <tt>eval</tt>. Understanding <tt>eval&lt...

In this paper, we describe the system jointly developed by IBM Research and Columbia University for video copy detection and multimedia event detection applied to the TRECVID-2010 video retrieval benchmark. A. Content-Based Copy Detection: The focus of our copy detection system this year was fusing three types of complementary fingerprints: a keyframe-based color correlogram, SIFTogram (bag of ...