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.

Species and acoustic diversity of bats in a palaeotropical wet evergreen forest in southern India

The Western Ghats of India is among the top 25 biodiversity hotspots in the world. About 43% of the reported 117 bat species in India are found in this region, but few quantitative studies of bat echolocation calls and diversity have been carried out here thus far. A quantitative study of bat diversity was therefore conducted using standard techniques, including mist-netting, acoustical and roost surveys in the wet evergreen forests of Kudremukh National Park in the Western Ghats of Karnataka. A total of 106 bats were caught over 108 sampling nights, representing 17 species, 3 belonging to Megachiroptera and 14 to Microchiroptera. Acoustical and roost surveys added three more species, two from Microchiroptera and one from Megachiroptera. Of these 20 species, 4 belonged to the family Pteropodidae, 10 to Vespertilionidae, 3 to Rhinolophidae, 2 to Megadermatidae and 1 to Hipposideridae. We recorded the echolocation calls of 13 of the 16 microchiropteran species, of which the calls of 4 species (Pipistrellus coromandra, Pipistrellus affinis, Pipistrellus ceylonicus and Harpiocephalus harpia) have been recorded for the first time. Discriminant function analyses of the calls of 11 species provided 91.7% correct classification of individuals to their respective species, indicating that the echolocation calls could be used successfully for non-invasive acoustic surveys and monitoring of bat species in the future.

Silent katydid females are at higher risk of bat predation than acoustically signalling katydid males

Males that produce conspicuous mate attraction signals are often at high risk of predation from eavesdropping predators. Females of such species typically search for signalling males and their higher motility may also place them at risk. The relative predation risk faced by males and females in the context of mate-finding using long-distance signals has rarely been investigated. In this study, we show, using a combination of diet analysis and behavioural experiments, that katydid females, who do not produce acoustic signals, are at higher risk of predation from a major bat predator, Megaderma spasma, than calling males. Female katydids were represented in much higher numbers than males in the culled remains beneath roosts of M. spasma. Playback experiments using katydid calls revealed that male calls were approached in only about one-third of the trials overall, whereas tethered, flying katydids were always approached and attacked. Our results question the idea that necessary costs of mate-finding, including risk of predation, are higher in signalling males than in searching females.

Two techniques to improve the precision of a demand-driven null-dereference verification approach

The problem addressed in this paper is sound, scalable, demand-driven null-dereference verification for Java programs. Our approach consists conceptually of a base analysis, plus two major extensions for enhanced precision. The base analysis is a dataflow analysis wherein we propagate formulas in the backward direction from a given dereference, and compute a necessary condition at the entry of the program for the dereference to be potentially unsafe. The extensions are motivated by the presence of certain ``difficult'' constructs in real programs, e.g., virtual calls with too many candidate targets, and library method calls, which happen to need excessive analysis time to be analyzed fully. The base analysis is hence configured to skip such a difficult construct when it is encountered by dropping all information that has been tracked so far that could potentially be affected by the construct. Our extensions are essentially more precise ways to account for the effect of these constructs on information that is being tracked, without requiring full analysis of these constructs. The first extension is a novel scheme to transmit formulas along certain kinds of def-use edges, while the second extension is based on using manually constructed backward-direction summary functions of library methods. We have implemented our approach, and applied it on a set of real-life benchmarks. The base analysis is on average able to declare about 84% of dereferences in each benchmark as safe, while the two extensions push this number up to 91%. (C) 2014 Elsevier B.V. All rights reserved.

Sulfate Chemistry for High-Voltage Insertion Materials: Synthetic, Structural and Electrochemical Insights

Rechargeable batteries based on Li and Na ions have been growing leaps and bounds since their inception in the 1970s. They enjoy significant attention from both the fundamental science point of view and practical applications ranging from portable electronics to hybrid vehicles and grid storage. The steady demand for building better batteries calls for discovery, optimisation and implementation of novel positive insertion (cathode) materials. In this quest, chemists have tried to unravel many future cathode materials by taking into consideration their eco-friendly synthesis, material/process economy, high energy density, safety, easy handling and sustainability. Interestingly, sulfate-based cathodes offer a good combination of sustainable syntheses and high energy density owing to their high-voltage operation, stemming from electronegative SO42- units. This review delivers a sneak peak at the recent advances in the discovery and development of sulfate-containing cathode materials by focusing on their synthesis, crystal structure and electrochemical performance. Several family of cathodes are independently discussed. They are 1) fluorosulfates AMSO(4)F], 2) bihydrated fluorosulfates AMSO(4)F2H(2)O], 3) hydroxysulfate AMSO(4)OH], 4) bisulfates A(2)M(SO4)(2)], 5) hydrated bisulfates A(2)M(SO4)(2)nH(2)O], 6) oxysulfates Fe-2(SO4)(2)O] and 7) polysulfates A(2)M(2)(SO4)(3)]. A comparative study of these sulfate-based cathodes has been provided to offer an outlook on the future development of high-voltage polyanionic cathode materials for next-generation batteries.

Current trends in modeling hostpathogen interactions

The rapid emergence of infectious diseases calls for immediate attention to determine practical solutions for intervention strategies. To this end, it becomes necessary to obtain a holistic view of the complex hostpathogen interactome. Advances in omics and related technology have resulted in massive generation of data for the interacting systems at unprecedented levels of detail. Systems-level studies with the aid of mathematical tools contribute to a deeper understanding of biological systems, where intuitive reasoning alone does not suffice. In this review, we discuss different aspects of hostpathogen interactions (HPIs) and the available data resources and tools used to study them. We discuss in detail models of HPIs at various levels of abstraction, along with their applications and limitations. We also enlist a few case studies, which incorporate different modeling approaches, providing significant insights into disease. (c) 2013 Wiley Periodicals, Inc.

Origin of nonlinearity and plausible turbulence by hydromagnetic transient growth in accretion disks: Faster growth rate than magnetorotational instability

We investigate the evolution of hydromagnetic perturbations in a small section of accretion disks. It is known that molecular viscosity is negligible in accretion disks. Hence, it has been argued that a mechanism, known as magnetorotational instability (MRI), is responsible for transporting matter in the presence of a weak magnetic field. However, there are some shortcomings, which question the effectiveness of MRI. Now the question arises, whether other hydromagnetic effects, e.g., transient growth (TG), can play an important role in bringing nonlinearity into the system, even at weak magnetic fields. In addition, it should be determined whether MRI or TG is primarily responsible for revealing nonlinearity in order to make the flow turbulent. Our results prove explicitly that the flows with a high Reynolds number (Re), which is the case for realistic astrophysical accretion disks, exhibit nonlinearity via TG of perturbation modes faster than that by modes producing MRI. For a fixed wave vector, MRI dominates over transient effects only at low Re, lower than the value expected to be in astrophysical accretion disks, and low magnetic fields. This calls into serious question the (overall) persuasiveness of MRI in astrophysical accretion disks.

Synthesizing Racy Tests

Subtle concurrency errors in multithreaded libraries that arise because of incorrect or inadequate synchronization are often difficult to pinpoint precisely using only static techniques. On the other hand, the effectiveness of dynamic race detectors is critically dependent on multithreaded test suites whose execution can be used to identify and trigger races. Usually, such multithreaded tests need to invoke a specific combination of methods with objects involved in the invocations being shared appropriately to expose a race. Without a priori knowledge of the race, construction of such tests can be challenging. In this paper, we present a lightweight and scalable technique for synthesizing precisely these kinds of tests. Given a multithreaded library and a sequential test suite, we describe a fully automated analysis that examines sequential execution traces, and produces as its output a concurrent client program that drives shared objects via library method calls to states conducive for triggering a race. Experimental results on a variety of well-tested Java libraries yield 101 synthesized multithreaded tests in less than four minutes. Analyzing the execution of these tests using an off-the-shelf race detector reveals 187 harmful races, including several previously unreported ones.

A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound

Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of , where denotes the upper bound on the underlying random oracle calls and , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of `dependence' and `independence' conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of . By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent.