We study the constraint satisfaction problem over the point algebra. In this problem, an instance consists of a set of variables and a set of binary constraints of forms (x < y), (x ≤ y), (x 6= y) or (x = y). Then, the objective is to assign integers to variables so as to satisfy as many constraints as possible. This problem contains many important problems such as Correlation Clustering, Maxim...

In the present study fecundity of Terapon puta was estimated for 47 matured females from the Bay of Bengal, Pondicherry. The fecundity (F) was found to range from 20,002 to 1,23,042 in fishes between 134-219mm Total length(TL) and 30-78 gm weight respectively. The co-efficient of correlation for F/TL (log F = 0.790+1.731 log TL), F/SL (log F = 0.799+1.773 log SL), F/TW (log F = 2.590+0.450 log ...

This paper compares the torque characteristics of single stator permanent magnet synchronous motor(PMSM) and double-stator PMSM under different split-ratios, air-gap lengths shaft diameters by finite element method. Firstly, effects split-ratio towards two motor structures are researched, results show that optimal split-ratios do not change lengths, is greater than single-stator, single-stator ...

We construct non-malleable extractors with seed length d = O(log n+log(1/ε)) for n-bit sources with min-entropy k = Ω(d), where ε is the error guarantee. In particular, the seed length is logarithmic in n for ε > 2−(logn) 1/3 . This improves upon existing constructions that either require super-logarithmic seed length even for constant error guarantee, or otherwise only support min-entropy n/po...

The problem of constructing pseudorandom generators that fool halfspaces has been studied intensively in recent times. For fooling halfspaces over {±1}n with polynomially small error, the best construction known requires seed-length O(log(n)) [MZ13]. Getting the seed-length down to O(log(n)) is a natural challenge in its own right, which needs to be overcome in order to derandomize RL. In this ...

We consider the streaming complexity of a fundamental task in approximate pattern matching: the k-mismatch problem. It asks to compute Hamming distances between a pattern of length n and all length-n substrings of a text for which the Hamming distance does not exceed a given threshold k. In our problem formulation, we report not only the Hamming distance but also, on demand, the full mismatch i...

We introduce some Π1–expressible combinatorial principles which may be treated as axioms for some bounded arithmetic theories. The principles, denoted Sk(Σn, length log k) and Sk(Σn, depth log k) (where ‘Sk’ stands for ‘Skolem’), are related to the consistency of Σn–induction: for instance, they provide models for Σn–induction. However, the consistency is expressed indirectly, via the existence...

The green weight of southern pine tree-length roundwood delivered to the pulp mill is generally known. However, for optimum mill efficiency it is desirable to know dry weight. The moisture content of tree-length pine logs is quite variable. The moisture content of pine tree-length logs increases significantly with increasing stem height. Moisture content also varies with tree age and geographic...

The Binary Jumbled String Matching problem is defined as: Given a string s over {a, b} of length n and a query (x, y), with x, y non-negative integers, decide whether s has a substring t with exactly x a’s and y b’s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this i...

A closed string is a string with a proper substring that occurs in the string as a prefix and a suffix, but not elsewhere. Closed strings were introduced by Fici (Proc. WORDS, 2011) as objects of combinatorial interest in the study of Trapezoidal and Sturmian words. In this paper we present algorithms for computing closed factors (substrings) in strings. First, we consider the problem of greedi...