Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences

The Cubic Sieve Method for solving the Discrete Logarithm Problem in prime fields requires a nontrivial solution to the Cubic Sieve Congruence (CSC) x(3) equivalent to y(2)z (mod p), where p is a given prime number. A nontrivial solution must also satisfy x(3) not equal y(2)z and 1 <= x, y, z < p(alpha), where alpha is a given real number such that 1/3 < alpha <= 1/2. The CSC problem is to find an efficient algorithm to obtain a nontrivial solution to CSC. CSC can be parametrized as x equivalent to v(2)z (mod p) and y equivalent to v(3)z (mod p). In this paper, we give a deterministic polynomial-time (O(ln(3) p) bit-operations) algorithm to determine, for a given v, a nontrivial solution to CSC, if one exists. Previously it took (O) over tilde (p(alpha)) time in the worst case to determine this. We relate the CSC problem to the gap problem of fractional part sequences, where we need to determine the non-negative integers N satisfying the fractional part inequality {theta N} < phi (theta and phi are given real numbers). The correspondence between the CSC problem and the gap problem is that determining the parameter z in the former problem corresponds to determining N in the latter problem. We also show in the alpha = 1/2 case of CSC that for a certain class of primes the CSC problem can be solved deterministically in <(O)over tilde>(p(1/3)) time compared to the previous best of (O) over tilde (p(1/2)). It is empirically observed that about one out of three primes is covered by the above class. (C) 2013 Elsevier B.V. All rights reserved.

Lovasz theta function, SVMs and Finding Dense Subgraphs

In this paper we establish that the Lovasz theta function on a graph can be restated as a kernel learning problem. We introduce the notion of SVM-theta graphs, on which Lovasz theta function can be approximated well by a Support vector machine (SVM). We show that Erdos-Renyi random G(n, p) graphs are SVM-theta graphs for log(4)n/n <= p < 1. Even if we embed a large clique of size Theta(root np/1-p) in a G(n, p) graph the resultant graph still remains a SVM-theta graph. This immediately suggests an SVM based algorithm for recovering a large planted clique in random graphs. Associated with the theta function is the notion of orthogonal labellings. We introduce common orthogonal labellings which extends the idea of orthogonal labellings to multiple graphs. This allows us to propose a Multiple Kernel learning (MKL) based solution which is capable of identifying a large common dense subgraph in multiple graphs. Both in the planted clique case and common subgraph detection problem the proposed solutions beat the state of the art by an order of magnitude.

Polymorphism and Phase Transformation Behavior of Solid Forms of 4-Amino-3,5-dinitrobenzamide

We report the preparation, analysis, and phase transformation behavior of polymorphs and the hydrate of 4-amino-3,5-dinitrobenzamide. The compound crystallizes in four different polymorphic forms, Form I (monoclinic, P2(1)/n), Form II (orthorhombic, Pbca), Form III (monoclinic, P2(1)/c), and Form IV (monoclinic, P2(1)/c). Interestingly, a hydrate (triclinic, P (1) over bar) of the compound is also discovered during the systematic identification of the polymorphs. Analysis of the polymorphs has been investigated using hot stage microscopy, differential scanning calorimetry, in situ variable-temperature powder X-ray diffraction, and single-crystal X-ray diffraction. On heating, all of the solid forms convert into Form I irreversibly, and on further heating, melting is observed. In situ single-crystal X-ray diffraction studies revealed that Form II transforms to Form I above 175 degrees C via single-crystal-to-single-crystal transformation. The hydrate, on heating, undergoes a double phase transition, first to Form III upon losing water in a single-crystal-to-single-crystal fashion and then to a more stable polymorph Form I on further heating. Thermal analysis leads to the conclusion that Form II appears to be the most stable phase at ambient conditions, whereas Form I is more stable at higher temperature.

Polynomial Decompositions in Polynomial Time

Fix a prime p. Given a positive integer k, a vector of positive integers Delta = (Delta(1), Delta(2), ... , Delta(k)) and a function Gamma : F-p(k) -> F-p, we say that a function P : F-p(n) -> F-p is (k, Delta, Gamma)-structured if there exist polynomials P-1, P-2, ..., P-k : F-p(n) -> F-p with each deg(P-i) <= Delta(i) such that for all x is an element of F-p(n), P(x) = Gamma(P-1(x), P-2(x), ..., P-k(x)). For instance, an n-variate polynomial over the field Fp of total degree d factors nontrivially exactly when it is (2, (d - 1, d - 1), prod)- structured where prod(a, b) = a . b. We show that if p > d, then for any fixed k, Delta, Gamma, we can decide whether a given polynomial P(x(1), x(2), ..., x(n)) of degree d is (k, Delta, Gamma)-structured and if so, find a witnessing decomposition. The algorithm takes poly(n) time. Our approach is based on higher-order Fourier analysis.

LOWER BOUNDS FOR BOXICITY

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a closed interval of the form a(i),b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension b, such that G is representable as the intersection graph of boxes in b-dimensional space. Although boxicity was introduced in 1969 and studied extensively, there are no significant results on lower bounds for boxicity. In this paper, we develop two general methods for deriving lower bounds. Applying these methods we give several results, some of which are listed below: 1. The boxicity of a graph on n vertices with no universal vertices and minimum degree delta is at least n/2(n-delta-1). 2. Consider the g(n,p) model of random graphs. Let p <= 1 - 40logn/n(2.) Then with high `` probability, box(G) = Omega(np(1 - p)). On setting p = 1/2 we immediately infer that almost all graphs have boxicity Omega(n). Another consequence of this result is as follows: For any positive constant c < 1, almost all graphs on n vertices and m <= c((n)(2)) edges have boxicity Omega(m/n). 3. Let G be a connected k-regular graph on n vertices. Let lambda be the second largest eigenvalue in absolute value of the adjacency matrix of G. Then, the boxicity of G is a least (kappa(2)/lambda(2)/log(1+kappa(2)/lambda(2))) (n-kappa-1/2n). 4. For any positive constant c 1, almost all balanced bipartite graphs on 2n vertices and m <= cn(2) edges have boxicity Omega(m/n).

Fragility correlates thermodynamic and kinetic properties of glass forming liquids

In our earlier communication we proposed a simple fragility determining function, (NBO]/(VmTg)-T-3), which we have now used to analyze several glass systems using available thermal data. A comparison with similar fragility determining function, Delta C-p/C-p(1), introduced by Chryssikos et al. in their investigation of lithium borate glasses has also been performed and found to be more convenient quantity for discussing fragilities. We now propose a new function which uses both Delta C-p and Delta T and which gives a numerical fragility parameter, F whose value lies between 0 and 1 for glass forming liquids. F can be calculated through the use of measured thermal parameters Delta C-p, C-p(1), T-g and T-m. Use of the new fragility values in reduced viscosity equation reproduces the whole range of viscosity curves of the Angell plot. The reduced viscosity equation can be directly compared with the Adam-Gibbs viscosity equation and a heat capacity function can be formulated which reproduces satisfactorily the Delta C-p versus In(T-r) curves and hence the configurational entropy. (C) 2014 Elsevier Ltd. All rights reserved.

Fragility correlates thermodynamic and kinetic properties of glass forming liquids

In our earlier communication we proposed a simple fragility determining function, (NBO]/(VmTg)-T-3), which we have now used to analyze several glass systems using available thermal data. A comparison with similar fragility determining function, Delta C-p/C-p(1), introduced by Chryssikos et al. in their investigation of lithium borate glasses has also been performed and found to be more convenient quantity for discussing fragilities. We now propose a new function which uses both Delta C-p and Delta T and which gives a numerical fragility parameter, F whose value lies between 0 and 1 for glass forming liquids. F can be calculated through the use of measured thermal parameters Delta C-p, C-p(1), T-g and T-m. Use of the new fragility values in reduced viscosity equation reproduces the whole range of viscosity curves of the Angell plot. The reduced viscosity equation can be directly compared with the Adam-Gibbs viscosity equation and a heat capacity function can be formulated which reproduces satisfactorily the Delta C-p versus In(T-r) curves and hence the configurational entropy. (C) 2014 Elsevier Ltd. All rights reserved.

Magnetometry using Ramsey interferometry in a Yb atomic beam

We use the Ramsey separated oscillatory fields technique in a 400 degrees C thermal beam of ytterbium (Yb) atoms to measure the Larmor precession frequency (and hence the magnetic field) with high precision. For the experiment, we use the strongly allowed S-1(0) P-1(1) transition at 399 nm, and choose the odd isotope Yb-171 with nuclear spin I = 1/2, so that the ground state has only two magnetic sublevels m(F) = +/- 1/2. With a magnetic field of 22.2 G and a separation of about 400 mm between the oscillatory fields, the central Ramsey fringe is at 16.64 kHz and has a width of 350 Hz. The technique can be readily adapted to a cold atomic beam, which is expected to give more than an order-of-magnitude improvement in precision. The signal-to-noise ratio is comparable to other techniques of magnetometry; therefore it should be useful for all kinds of precision measurements such as searching for a permanent electric dipole moment in atoms.

Genome-wide analysis correlates Ayurveda Prakriti

The practice of Ayurveda, the traditional medicine of India, is based on the concept of three major constitutional types (Vata, Pitta and Kapha) defined as ``Prakriti''. To the best of our knowledge, no study has convincingly correlated genomic variations with the classification of Prakriti. In the present study, we performed genome-wide SNP (single nucleotide polymorphism) analysis (Affymetrix, 6.0) of 262 well-classified male individuals (after screening 3416 subjects) belonging to three Prakritis. We found 52 SNPs (p <= 1 x 10(-5)) were significantly different between Prakritis, without any confounding effect of stratification, after 10(6) permutations. Principal component analysis (PCA) of these SNPs classified 262 individuals into their respective groups (Vata, Pitta and Kapha) irrespective of their ancestry, which represent its power in categorization. We further validated our finding with 297 Indian population samples with known ancestry. Subsequently, we found that PGM1 correlates with phenotype of Pitta as described in the ancient text of Caraka Samhita, suggesting that the phenotypic classification of India's traditional medicine has a genetic basis; and its Prakriti-based practice in vogue for many centuries resonates with personalized medicine.

Crystal chemistry and photomechanical behavior of 3,4-dimethoxycinnamic acid: correlation between maximum yield in the solid-state topochemical reaction and cooperative molecular motion

A new monoclinic polymorph, form II (P2(1)/c, Z = 4), has been isolated for 3,4-dimethoxycinnamic acid (DMCA). Its solid-state 2 + 2 photoreaction to the corresponding alpha-truxillic acid is different from that of the first polymorph, the triclinic form I (P (1) over bar, Z = 4) that was reported in 1984. The crystal structures of the two forms are rather different. The two polymorphs also exhibit different photomechanical properties. Form I exhibits photosalient behavior but this effect is absent in form II. These properties can be explained on the basis of the crystal packing in the two forms. The nanoindentation technique is used to shed further insights into these structure-property relationships. A faster photoreaction in form I and a higher yield in form II are rationalized on the basis of the mechanical properties of the individual crystal forms. It is suggested that both Schmidt-type and Kaupp-type topochemistry are applicable for the solid-state trans-cinnamic acid photodimerization reaction. Form I of DMCA is more plastic and seems to react under Kaupp-type conditions with maximum molecular movements. Form II is more brittle, and its interlocked structure seems to favor Schmidt-type topochemistry with minimum molecular movement.

The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint

The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1, infinity)-RLL constraint. We derive the capacity for this setting, which can be expressed as C-is an element of = max(0 <= p <= 0.5) (1-is an element of) H-b (p)/1+(1-is an element of) p, where is an element of is the erasure probability and Hb(.) is the binary entropy function. Moreover, we prove that a priori knowledge of the erasure at the encoder does not increase the feedback capacity. The feedback capacity was calculated using an equivalent dynamic programming (DP) formulation with an optimal average-reward that is equal to the capacity. Furthermore, we obtained an optimal encoding procedure from the solution of the DP, leading to a capacity-achieving, zero-error coding scheme for our setting. DP is, thus, shown to be a tool not only for solving optimization problems, such as capacity calculation, but also for constructing optimal coding schemes. The derived capacity expression also serves as the only non-trivial upper bound known on the capacity of the input-constrained erasure channel without feedback, a problem that is still open.