A thorough and extensive wild germplasm exploration survey was undertaken and 32 high yielding candidate plus trees (CPTs) of Jatropha curcas from different locations from a latitudinal and longitudinal spread between 12°41 0 and 22°0E longitude and 77°and 84°40 0 N latitude covering 11 locations in an area spread of 150,000 km 2 was collected for evaluating genetic association, and variability in seed and growth characters. Significant trait differences were observed in all the seed characters viz., seed morphology and oil content as were observed in growth characters viz., plant height, and female to male flower ratio and seed yield in the progeny trial. Broad sense heritability was high in general and exceeded 80% for all the seed traits studied. Female to male flower ratio showed near to 100% heritability followed by yield (83.61) and plant height (87.73). The path analysis revealed that female to male flower ratio had highest positive direct relationship with seed yield (0.789), followed by number of branches (0.612) and number of days from fruiting to maturity (0.431). Negative indirect effects were seen in number of days from flowering to fruiting which indirectly and negatively influenced yield through plant height and number of branches. Hierarchical clustering by Ward's minimum variance cluster analysis showed phylogeographic patterns of genetic diversity. K-means clustering revealed that trees from different geographic regions were grouped together in a cluster and as were trees from the same geographical area placed in different clusters suggesting that geographical diversity did not go hand in hand with genetic diversity. In addition clustering identified promising accession with favourable traits for future establishment of elite seedling seed orchard and clonal seed orchard for varietal and hybridization programmes.

This chapter discusses the past and present trends and future direction of rainfed agriculture. Topics covered include: the relationship between rainfed agriculture and water stress; crop yields in rainfed areas; constraints in rainfed agriculture areas; the potential of rainfed agriculture; and the new paradigm in rainfed agriculture.

We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular, we present XMC, an XSBbased local model checker for a CCS-like value-passing language and the alternation-free fragment of the modal mu-calculus. XMC is written in under 200 lines of XSB code, which constitute a declarative specification of CCS and the modal mu-calculus at the level of semantic equations. In order to gauge the performance of XMC as an algorithmic model checker, we conducted a series of benchmarking experiments designed to compare the performance of XMC with the local model checkers implemented in C/C++ in the Concurrency Factory and SPIN specification and verification environments. After applying certain newly developed logic-programmingbased optimizations (along with some standard ones), XMC's performance became extremely competitive with that of the Factory and shows promise in its comparison with SPIN.

The 3 9 2 m spacing currently used for eucalyptus plantations in the state of Andhra Pradesh, southern India does not permit intercropping from the second year. This discourages small landholders who need regular income from taking up eucalyptus plantations and benefiting from the expanding market for pulpwood. Therefore, on-farm experiments were conducted near Bhadrachalam, Khammam district (Andhra Pradesh) for over 4 years from August 2001 to November 2005 to examine whether wide-row planting and grouping of certain tree rows will facilitate extended intercropping without sacrificing wood yield. Eucalyptus planted in five-spatial arrangements in agroforestry [3 9 2 m (farmers' practice), 6 9 1 m, 7 9 1.5 m paired rows (7 9 1.5 PR), 11 9 1 m paired rows (11 9 1 PR) and 10 9 1.5 m triple rows (10 9 1.5 TR)] was compared with sole tree stands at a constant density of 1,666 trees ha -1 . Cowpea (Vigna unguiculata) was intercropped during the post-rainy seasons from 2001 to 2004, and fodder grasses (Panicum maximum and Brachiaria ruziziensis) were intercropped during both the seasons of 2005. At 51 months after planting, different spatial arrangements did not significantly affect height and diameter at breast height (dbh). Total dry biomass of eucalyptus in different spatial arrangements ranged between 59.5 and 52.9 Mg ha -1 , the highest being with 6 9 1 m and the lowest with 10 9 1.5 TR, but treatment differences were not significant. The widely spaced paired row (11 9 1 PR) and triple row (10 9 1.5 TR) arrangements produced 62-73% of sole cowpea yield in 2003, 59-66% of sole cowpea yield in 2004, and 79-94% of sole fodder in 2005. In contrast, the 3 9 2 m spacing allowed only 17-45% of sole crop yields in these years. The better performance of intercrops in widely spaced eucalyptus was likely because of limited competition from trees for light and water. Intercropping of eucalyptus in these wider rows gave 14% greater net returns compared with intercropping M. R. Rao-Former staff of ICRAF (World Agroforestry Centre), Nairobi, Kenya. in eucalyptus spaced at 3 9 2 m, 19% greater returns compared with that from sole tree woodlot and 263% greater returns compared with that from sole crops. Therefore, in regions where annual rainfall is around 1,000 mm and soils are fairly good, eucalyptus at a density of 1,666 plants per ha can be planted in uniformly spaced wide-rows (6 m) or paired rows at an inter-pair spacing of 7-11 m for improving intercrop performance without sacrificing wood production.

This article describes a graphical interval logic that is the foundation of a tool set supporting formal specification and verification of concurrent software systems. Experience has shown that most software engineers find standard temporal logics difficult to understand and use. The objective of this article is to enable software engineers to specify and reason about temporal properties of concurrent systems more easily by providing them with a logic that has an intuitive graphical representation and with tools that support its use. To illustrate the use of the graphical logic, the article provides some specifications for an elevator system and proves several properties of the specifications. The article also describes the tool set and the implementation.

No abstract

The i-protocol, an optimized sliding-window protocol for GNU UUCP, came to our attention two years ago when we used the Concurrency Factory's local model checker to detect, locate, and correct a non-trivial livelock in version 1.04 of the protocol. Since then, we have repeated this verification effort with five widely used model checkers, namely, COSPAN, Murϕ, SMV, Spin, and XMC. It is our contention that the i-protocol makes for a particularly compelling case study in protocol verification and for a formidable benchmark of verification-tool performance, for the following reasons: 1) The i-protocol can be used to gauge a tool's ability to detect and diagnose livelock errors. 2) The size of the i-protocol's state space grows exponentially in the window size, and the entirety of this state space must be searched to verify that the protocol, with the livelock error eliminated, is deadlock-or livelock-free. 3) The i-protocol is an asynchronous, low-level software system equipped with a number of optimizations aimed at minimizing control-message and retransmission overhead. It lacks the regular structure that is often present in hardware designs. In this sense, it provides any verification tool with a vigorous test of its analysis capabilities.

Programs written in concurrent object-oriented languages, especially ones that employ thread-safe reusable class libraries, can execute synchronization operations (lock, notify, etc.) at an amazing rate. Unless implemented with utmost care, synchronization can become a performance bottleneck. Furthermore, in languages where every object may have its own monitor, per-object space overhead must be minimized. To address these concerns, we have developed a meta-lock to mediate access to synchronization data. The meta-lock is fast (lock + unlock executes in 11 SPARCTM architecture instructions), compact (uses only two bits of space), robust under contention (no busy-waiting), and flexible (supports a variety of higher-level synchronization operations). We have validated the meta-lock with an implementation of the synchronization operations in a high-performance product-quality JavaTM virtual machine and report performance data for several large programs.