Arithmetizing computation is a crucial component of many fundamental results in complexity theory, including results that gave insight into the power of interactive proofs, multi-prover interactive proofs, and probabilistically-checkable proofs. Informally, an arithmetization is a way to encode a machine’s computation so that its correctness can be easily verified via few probabilistic algebrai...

Morphological segmentation breaks words into morphemes (the basic semantic units). It is a key component for natural language processing systems. Unsupervised morphological segmentation is attractive, because in every language there are virtually unlimited supplies of text, but very few labeled resources. However, most existing model-based systems for unsupervised morphological segmentation use...

We show that the minimum expected length of a 1-1 encoding of a discrete random variable X is at least H(X)− log(H(X)+1)− log e and that this bound is asymptotically achievable.

In this paper,design optimization of Log Periodic Dipole Antenna (LPDA) has been carried out using Genetic Algorithm. The design objectives of this work is maximization of gain and minimization of VSWR.This has been achieved by variations in geometrical parameters of log periodic dipole antenna like maximum length, minimum length,spacing factor (σ). The simulation results have attained gain fro...

A Boolean function is said to have maximal sensitivity s if s is the largest number of Hamming neighbors of a point which differ from it in function value. We construct a pseudorandom generator with seed-length 2O( √ s) · log(n) that fools Boolean functions on n variables with maximal sensitivity at most s. Prior to our work, the best pseudorandom generators for this class of functions required...

We consider the problem of finding a long, simple path in an undirected graph. We present a polynomial-time algorithm that finds a path of length Ω ( (logL/ log logL)2 ) , where L denotes the length of the longest simple path in the graph. This establishes the performance ratio O ( n(log logn/ logn)2 ) for the longest path problem, where n denotes the number of vertices in the graph.

In this correspondence we provide new bounds on the expected length L of a binary one-to-one code for a discrete random variable X with entropy H. We prove that L H ? log(H + 1) ? H log(1 + 1=H). This bound improves on previous results. Furthermore, we provide upper bounds on the expected length of the best code as function of H and the most likely source letter probability.

We present an index that stores a text of length n such that given a pattern of length m, all the substrings of the text that are within Hamming distance (or edit distance) at most k from the pattern are reported in O(m+ log log n + #matches) time (for constant k). The space complexity of the index is O(n1+ǫ) for any constant ǫ > 0.

The terminase motors of bacteriophages have been shown to be among the strongest active machines in the biomolecular world, being able to package several tens of kilobase pairs of viral genome into a capsid within minutes. Yet these motors are hindered at the end of the packaging process by the progressive build-up of a force resisting packaging associated with already packaged DNA. In this exp...

BACKGROUND AND AIMS The difficulty during flexible fiber-optic bronchoscopy (FOB) guided tracheal intubation could be because of inability in visualising glottis, advancing and railroading of endotracheal tube. Several methods are available for visualising glottis, but none is ideal. Hence, this randomised controlled study was designed to evaluate the simple pre-determined length insertion tech...