On piercing (pseudo)lines and boxes

We say a family of geometric objects C has (l;k)-property if every subfamily C0C of cardinality at most lisk- piercable. In this paper we investigate the existence of g(k;d)such that if any family of objects C in Rd has the (g(k;d);k)-property, then C is k-piercable. Danzer and Gr̈ unbaum showed that g(k;d)is infinite for fami-lies of boxes and translates of centrally symmetric convex hexagons. In this paper we show that any family of pseudo-lines(lines) with (k2+k+ 1;k)-property is k-piercable and extend this result to certain families of objects with discrete intersections. This is the first positive result for arbitrary k for a general family of objects. We also pose a relaxed ver-sion of the above question and show that any family of boxes in Rd with (k2d;k)-property is 2dk- piercable.

Discovering Math APIs by Mining Unit Tests

In today's API-rich world, programmer productivity depends heavily on the programmer's ability to discover the required APIs. In this paper, we present a technique and tool, called MATHFINDER, to discover APIs for mathematical computations by mining unit tests of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code to compute the expression by mapping its subexpressions to API method calls. For each subexpression, MATHFINDER searches for a method such that there is a mapping between method inputs and variables of the subexpression. The subexpression, when evaluated on the test inputs of the method under this mapping, should produce results that match the method output on a large number of tests. We implemented MATHFINDER as an Eclipse plugin for discovery of third-party Java APIs and performed a user study to evaluate its effectiveness. In the study, the use of MATHFINDER resulted in a 2x improvement in programmer productivity. In 96% of the subexpressions queried for in the study, MATHFINDER retrieved the desired API methods as the top-most result. The top-most pseudo-code snippet to implement the entire expression was correct in 93% of the cases. Since the number of methods and unit tests to mine could be large in practice, we also implement MATHFINDER in a MapReduce framework and evaluate its scalability and response time.

Mining Unit Tests for Discovery and Migration of Math APIs

Today's programming languages are supported by powerful third-party APIs. For a given application domain, it is common to have many competing APIs that provide similar functionality. Programmer productivity therefore depends heavily on the programmer's ability to discover suitable APIs both during an initial coding phase, as well as during software maintenance. The aim of this work is to support the discovery and migration of math APIs. Math APIs are at the heart of many application domains ranging from machine learning to scientific computations. Our approach, called MATHFINDER, combines executable specifications of mathematical computations with unit tests (operational specifications) of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code comprised of API methods to compute the expression by mining unit tests of the API methods. We present a sequential version of our unit test mining algorithm and also design a more scalable data-parallel version. We perform extensive evaluation of MATHFINDER (1) for API discovery, where math algorithms are to be implemented from scratch and (2) for API migration, where client programs utilizing a math API are to be migrated to another API. We evaluated the precision and recall of MATHFINDER on a diverse collection of math expressions, culled from algorithms used in a wide range of application areas such as control systems and structural dynamics. In a user study to evaluate the productivity gains obtained by using MATHFINDER for API discovery, the programmers who used MATHFINDER finished their programming tasks twice as fast as their counterparts who used the usual techniques like web and code search, IDE code completion, and manual inspection of library documentation. For the problem of API migration, as a case study, we used MATHFINDER to migrate Weka, a popular machine learning library. Overall, our evaluation shows that MATHFINDER is easy to use, provides highly precise results across several math APIs and application domains even with a small number of unit tests per method, and scales to large collections of unit tests.

Analytical And Experimental Aeroacoustic Studies Of Open-Ended 3-Duct Perforated Elements Used In Mufflers

Perforated element mufflers have been known to have good acousticp erformancew, henu sedo n automotive xhausst ystemsIn. thel astd ecadea nda half, plugm ufflersc, oncentrihc oler esonators, and three-ductc losed-endp erforatede lementsh ave been studied.T he presenti nvestigation concernso pen-endedt,h ree-ducpt erforatede lementsw, hich are knownt o combineh igh acoustic transmissiolno ss with low back pressuresT. he governinge quationsh ave been solved in the frequencyd omain,u singt he recouplinga pproacha longw ith appropriatbe oundaryc onditionst,o derivet he transferm atrixa ndt hent o calculaten oiser eductiona ndt ransmissiolno ss.T he predicted noiser eductionv aluesh aveb eens hownt o corroboratew ell with experimentallyo bservedv alues. Finally,p arametrics tudiesh aveb eend onet o draw designc urvesf or suchm ufflers.

Highly efficient C-8 oxidation of substituted xanthines with substitution at the 1-, 3-, and 7- positions using biocatalysts

A bacterial consortium consisting of strains belongings to the genus Klebsiella and Rhodococcus quantitatively converts 1-, 3- and 7-substituted xanthines to their respective 8-oxo compounds.

Energy-momentum conserving algorithm for nonlinear transient analysis within the framework of hybrid elements

This work deals with the formulation and implementation of an energy-momentum conserving algorithm for conducting the nonlinear transient analysis of structures, within the framework of stress-based hybrid elements. Hybrid elements, which are based on a two-field variational formulation, are much less susceptible to locking than conventional displacement-based elements within the static framework. We show that this advantage carries over to the transient case, so that not only are the solutions obtained more accurate, but they are obtained in fewer iterations. We demonstrate the efficacy of the algorithm on a wide range of problems such as ones involving dynamic buckling, complicated three-dimensional motions, et cetera.

Bayesian and Decision Tree Approaches for Pattern Recognition Including Feature Measurement Costs

The minimum cost classifier when general cost functionsare associated with the tasks of feature measurement and classification is formulated as a decision graph which does not reject class labels at intermediate stages. Noting its complexities, a heuristic procedure to simplify this scheme to a binary decision tree is presented. The optimizationof the binary tree in this context is carried out using ynamicprogramming. This technique is applied to the voiced-unvoiced-silence classification in speech processing.

An Adaptive Scheme for Learning the Probability Threshold in Pattern Recognition

The statistical minimum risk pattern recognition problem, when the classification costs are random variables of unknown statistics, is considered. Using medical diagnosis as a possible application, the problem of learning the optimal decision scheme is studied for a two-class twoaction case, as a first step. This reduces to the problem of learning the optimum threshold (for taking appropriate action) on the a posteriori probability of one class. A recursive procedure for updating an estimate of the threshold is proposed. The estimation procedure does not require the knowledge of actual class labels of the sample patterns in the design set. The adaptive scheme of using the present threshold estimate for taking action on the next sample is shown to converge, in probability, to the optimum. The results of a computer simulation study of three learning schemes demonstrate the theoretically predictable salient features of the adaptive scheme.

Propagating waves in polar coronal holes as seen by SUMER and EIS

Context. To study the dynamics of coronal holes and the role of waves in the acceleration of the solar wind, spectral observations were performed over polar coronal hole regions with the SUMER spectrometer on SoHO and the EIS spectrometer on Hinode. Aims. Using these observations, we aim to detect the presence of propagating waves in the corona and to study their properties. Methods. The observations analysed here consist of SUMER spectra of the Ne VIII 770 angstrom line (T = 0.6 MK) and EIS slot images in the Fe XII 195 angstrom line (T = 1.3 MK). Using the wavelet technique, we study line radiance oscillations at different heights from the limb in the polar coronal hole regions. Results. We detect the presence of long period oscillations with periods of 10 to 30 min in polar coronal holes. The oscillations have an amplitude of a few percent in radiance and are not detectable in line-of-sight velocity. From the time distance maps we find evidence for propagating velocities from 75 km s(-1) (Ne VIII) to 125 km s(-1)(Fe XII). These velocities are subsonic and roughly in the same ratio as the respective sound speeds. Conclusions. We interpret the observed propagating oscillations in terms of slow magneto-acoustic waves. These waves can be important for the acceleration of the fast solar wind.

Rationale of Length Scale-Down Model Span Testing of Transmission Lines

Length scale-down (LS) model tests have been traditionally employed for laboratory studies on aeolian vibration of transmission line conductors. The span adopted is normally 30 m and is recommended by the relevant Indian, as well as other, standards. The traditionally adopted length of the LS model is reexamined herein to establish the rationale behind the choice. Based on the theoretical studies discussed, certain guidelines for the choice of model span of conductor are emphasized. In addition, the adequacy of the LS span as a tool for predicting the performance of the full span is reestablished.

Generalized Burgers equations and Euler-Painleve transcendents. II

It was proposed earlier [P. L. Sachdev, K. R. C. Nair, and V. G. Tikekar, J. Math. Phys. 27, 1506 (1986)] that the Euler Painlevé equation yy[script `]+ay[script ']2+ f(x)yy[script ']+g(x) y2+by[script ']+c=0 represents the generalized Burgers equations (GBE's) in the same manner as Painlevé equations do the KdV type. The GBE was treated with a damping term in some detail. In this paper another GBE ut+uaux+Ju/2t =(gd/2)uxx (the nonplanar Burgers equation) is considered. It is found that its self-similar form is again governed by the Euler Painlevé equation. The ranges of the parameter alpha for which solutions of the connection problem to the self-similar equation exist are obtained numerically and confirmed via some integral relations derived from the ODE's. Special exact analytic solutions for the nonplanar Burgers equation are also obtained. These generalize the well-known single hump solutions for the Burgers equation to other geometries J=1,2; the nonlinear convection term, however, is not quadratic in these cases. This study fortifies the conjecture regarding the importance of the Euler Painlevé equation with respect to GBE's. Journal of Mathematical Physics is copyrighted by The American Institute of Physics.

N-[2-naphthyl]-glycine hydrazide, a potent inhibitor of dna-dependent rna-polymerase of mycobacterium-tuberculosis h37rv

N-[2-Naphthyl]-glycine hydrazide has been shown for the first time as a potent inhibitor of the DNA-dependent RNA polymerase (EC 2.7.7.6) of Mycobacterium tuberculosis H37Rv. At a concentration of 10 to the power -9 M, the compound shows maximum inhibition of the enzyme, the inhibition being less at higher concentrations. It is suggested that the novel type of inhibition pattern may be due to hydrophobic interactions occurring between the molecules of the compound at higher concentrations. The finding that there is a shift in the max of the compound could also account for this phenomenon. The effect of this compound was also tested on DNA-dependent RNA polymerases from an eukaryotic fungus, Microsporum canis. At a concentration of 10 to the power-9 M it inhibits RNA polymerase II (32 percent) but not RNA polymerases I and III.

Tubulin synthesis and auxin-induced root initiation in phaseolus

The auxin-induced formation of roots in the hypocotyls of Phaseolus vulgaris can be prevented by treatment with actinomycin D, colchicine or cytochalasin B if applied within 40 hr of initiation. Shortly after auxin pretreatment, there is an increase in translatable messenger RNA activity. Analysis of the labelled cell-free products indicate, among other changes, a striking increase in a protein co-migrating with tubulin, in the case of RNA isolated from indolebutyric acid (IBA) pretreated hypocotyls. An increase in tubulin content in vivo can also be demonstrated on the basis of SDS-polyacrylamide gel analysis of membrane proteins and functional assays for tubulin polymerization. An increase in the synthesis of tubulin in vivo can also be demonstrated after IBA pretreatment. In addition, the auxin is also able to promote tubulin polymerization when added in vitro. It is suggested that tubulin synthesis and microtubule assembly are early events in auxin-mediated root differentiation.

Water-wave scattering by two submerged plane vertical barriers-Abel integral-equation approach

The classical problem of surface water-wave scattering by two identical thin vertical barriers submerged in deep water and extending infinitely downwards from the same depth below the mean free surface, is reinvestigated here by an approach leading to the problem of solving a system of Abel integral equations. The reflection and transmission coefficients are obtained in terms of computable integrals. Known results for a single barrier are recovered as a limiting case as the separation distance between the two barriers tends to zero. The coefficients are depicted graphically in a number of figures which are identical with the corresponding figures given by Jarvis (J Inst Math Appl 7:207-215, 1971) who employed a completely different approach involving a Schwarz-Christoffel transformation of complex-variable theory to solve the problem.