The Effect of Silica and Manure Addition into Suppressive and Conducive Soil on the Incidence of Fusarium Wilt Disease of Banana

Fusarium wilt, caused by Fusarium oxysporum f. sp. cubense (Foc), is one of the most destructive diseases of banana. One potential method to manage fusarium wilt of banana is by manipulating the nutrient status in the soil. This study was conducted to determine the quality of Foc suppressive and conducive soil, the influence of soil application of silica and manure on the incidence of fusarium wilt of banana. Surveys were conducted in five banana plantations in three provinces in Indonesia: Lampung-Sumatra, West Java and Central Java. From the five locations, one location (Sala-man-Central Java) was heavily infected by Foc, another location (NTF Lampung-Sumatera) was slightly infected by Foc, while the rest (Sarampad-West Java, Talaga-West Java and GGP Lampung-Sumatra) were healthy banana plantations without Foc infection. Labile carbon analysis showed that the Foc suppressive soil had greater labile carbon content than conducive soil. Also, the analysis of fluorescein diacetate hydrolysis (FDA) and ?-glucosidase showed greater microbial activity in suppressive soil than the conducive soil. Observations of the incidence of necrotic rhizome of Foc susceptible 'Ambon Kuning' (AAA) banana cultivar showed that in the suppressive soil taken from Sarampad West Java, the application of silica and manure helped suppress fusarium wilt disease development. In the conducive soil taken from Salaman-Central Java, silica and manure applications were not able to suppress disease incidence. The result of this study indicated that in suppressive soil, the application of silica can increase plant resistance to Foc infection, while manure application can increase soil microbial activity, and suppress Foc development.

Performance-based contracting for roads – Experiences of Australia and Indonesia

Many countries over the last decade, have used performance-based contracting (PBC) to manage and maintain roads. The implementation of PBC provides additional benefits for the government/public such as cost savings and improved conditions of contracted road assets. In Australia, PBC is already being implemented on all categories of roads: national, state, urban and rural. Australian PBC arrangement is designed to turn over control and responsibility for roadway system maintenance, rehabilitation, and capital improvement projects to private contractors. Contractors’ responsibilities include determination of treatment types, the design, programming and the undertaking of works needed to maintain road networks at predetermined performance levels. Indonesia initiated two PBC pilot projects in 2011, the Pantura Section Demak-Trengguli (7.68 kilometers) in Central Java Province and Section Ciasem-Pamanukan (18.5 kilometers) in West Java Province. Both sections are categorized as national roads. The contract duration for both of these projects is four years. To facilitate a possible way forward, it is proposed to conduct a study to understand Australia's experiences of advancing from pilot projects to nation-wide programs using PBC. The study focuses on the scope of contracts, bidding processes, risk allocation, and key drivers, using relevant PBC case studies from Australia. Recommendations for future PBC deployment nation-wide should be based on more research associated with risk allocation. This will include investigation of standard conditions of contract. Implications of the contract clauses for the risk management strategy to be adopted by contractors. Based on the nature of risks, some are best managed by the project owner. It is very important that all parties involved to be open to the new rules of contract and to convince themselves about the potential increased benefits of the use of PBC. The most recent states of challenging issues were explored and described.

Middleware for Mobile Sensing Applications in Urban Environments

Sensor networks represent an attractive tool to observe the physical world. Networks of tiny sensors can be used to detect a fire in a forest, to monitor the level of pollution in a river, or to check on the structural integrity of a bridge. Application-specific deployments of static-sensor networks have been widely investigated. Commonly, these networks involve a centralized data-collection point and no sharing of data outside the organization that owns it. Although this approach can accommodate many application scenarios, it significantly deviates from the pervasive computing vision of ubiquitous sensing where user applications seamlessly access anytime, anywhere data produced by sensors embedded in the surroundings. With the ubiquity and ever-increasing capabilities of mobile devices, urban environments can help give substance to the ubiquitous sensing vision through Urbanets, spontaneously created urban networks. Urbanets consist of mobile multi-sensor devices, such as smart phones and vehicular systems, public sensor networks deployed by municipalities, and individual sensors incorporated in buildings, roads, or daily artifacts. My thesis is that "multi-sensor mobile devices can be successfully programmed to become the underpinning elements of an open, infrastructure-less, distributed sensing platform that can bring sensor data out of their traditional close-loop networks into everyday urban applications". Urbanets can support a variety of services ranging from emergency and surveillance to tourist guidance and entertainment. For instance, cars can be used to provide traffic information services to alert drivers to upcoming traffic jams, and phones to provide shopping recommender services to inform users of special offers at the mall. Urbanets cannot be programmed using traditional distributed computing models, which assume underlying networks with functionally homogeneous nodes, stable configurations, and known delays. Conversely, Urbanets have functionally heterogeneous nodes, volatile configurations, and unknown delays. Instead, solutions developed for sensor networks and mobile ad hoc networks can be leveraged to provide novel architectures that address Urbanet-specific requirements, while providing useful abstractions that hide the network complexity from the programmer. This dissertation presents two middleware architectures that can support mobile sensing applications in Urbanets. Contory offers a declarative programming model that views Urbanets as a distributed sensor database and exposes an SQL-like interface to developers. Context-aware Migratory Services provides a client-server paradigm, where services are capable of migrating to different nodes in the network in order to maintain a continuous and semantically correct interaction with clients. Compared to previous approaches to supporting mobile sensing urban applications, our architectures are entirely distributed and do not assume constant availability of Internet connectivity. In addition, they allow on-demand collection of sensor data with the accuracy and at the frequency required by every application. These architectures have been implemented in Java and tested on smart phones. They have proved successful in supporting several prototype applications and experimental results obtained in ad hoc networks of phones have demonstrated their feasibility with reasonable performance in terms of latency, memory, and energy consumption.

Oliokielten välikielten optimointi

Javan myötä ohjelmointikielten kääntämisprosessiin on uudelleen esitelty erityisen käsittelyn kohteeksi kelpaava välikieli, tavukoodi. Tavallisesti Java-ohjelmaa suoritettaessa erityinen virtuaalikone lataa tavukoodimuotoisen ohjelman esityksen, jota suoritetaan joko tulkkaamalla tai suoritusaikaisesti suoritusalustan ymmärtämälle kielelle kääntäen. Tässä tutkielmassa tutkitaan välikielen tasolla tapahtuvia optimointimahdollisuuksia. Oliokielten dynaamisen luonteen vuoksi puhtaasti staattinen optimointi on vaikeaa ja siksi usein hedelmätöntä. Tutkielman yhteydessä kuitenkin tunnistettiin mobiiliohjelmointiin soveltuva suljetun maailman oletus, jonka puitteissa tavukoodin tasolla voidaan ohjelmaa parannella turvallisesti. Esimerkkinä tutkielmassa toteutetaan ylimääräisiä rajapintaluokkia poistava optimointi. Koska optimointialgoritmit ovat usein monimutkaisia ja vaikeaselkoisia, tutkitaan työssä myös mahdollisuuksia niiden yksinkertaisempaan esittämiseen. Alunperin Javalla toteutetun luokkahierarkiaa uudelleenjärjestelevän algoritmin esiehtojen tarkastus onnistutaan kuvaamaan ensimmäisen kertaluokan logiikan kaavalla, jolloin esiehtojen tarkastus onnistuu tutkielman puitteissa toteutetulla logiikkakoneella. Logiikkakoneelle kuvataan logiikkakaavojen propositiot Javalla, mutta propositioiden yhdistely tapahtuu ja-konnektiiveja käyttävällä logiikkakielellä. Suorituskyvyltään logiikkakone on joissain tapauksissa Java-toteutusta nopeampi.

Dessy : desktop search and synchronization

Current smartphones have a storage capacity of several gigabytes. More and more information is stored on mobile devices. To meet the challenge of information organization, we turn to desktop search. Users often possess multiple devices, and synchronize (subsets of) information between them. This makes file synchronization more important. This thesis presents Dessy, a desktop search and synchronization framework for mobile devices. Dessy uses desktop search techniques, such as indexing, query and index term stemming, and search relevance ranking. Dessy finds files by their content, metadata, and context information. For example, PDF files may be found by their author, subject, title, or text. EXIF data of JPEG files may be used in finding them. User–defined tags can be added to files to organize and retrieve them later. Retrieved files are ranked according to their relevance to the search query. The Dessy prototype uses the BM25 ranking function, used widely in information retrieval. Dessy provides an interface for locating files for both users and applications. Dessy is closely integrated with the Syxaw file synchronizer, which provides efficient file and metadata synchronization, optimizing network usage. Dessy supports synchronization of search results, individual files, and directory trees. It allows finding and synchronizing files that reside on remote computers, or the Internet. Dessy is designed to solve the problem of efficient mobile desktop search and synchronization, also supporting remote and Internet search. Remote searches may be carried out offline using a downloaded index, or while connected to the remote machine on a weak network. To secure user data, transmissions between the Dessy client and server are encrypted using symmetric encryption. Symmetric encryption keys are exchanged with RSA key exchange. Dessy emphasizes extensibility. Also the cryptography can be extended. Users may tag their files with context tags and control custom file metadata. Adding new indexed file types, metadata fields, ranking methods, and index types is easy. Finding files is done with virtual directories, which are views into the user’s files, browseable by regular file managers. On mobile devices, the Dessy GUI provides easy access to the search and synchronization system. This thesis includes results of Dessy synchronization and search experiments, including power usage measurements. Finally, Dessy has been designed with mobility and device constraints in mind. It requires only MIDP 2.0 Mobile Java with FileConnection support, and Java 1.5 on desktop machines.

An efficient and light-weight multi-tasking model to achieve Intra-Agent concurrency for SAGE

Multi-agent systems implicate a high degree of concurrency at both the Inter- and Intra-Agent levels. Scalable, fault tolerant, Agent Grooming Environment (SAGE), the second generation, FIPA compliant MAS requires a built in mechanism to achieve both the Inter- and Intra-Agent concurrency. This paper dilates upon an attempt to provide a reliable, efficient and light-weight solution to provide intra-agent concurrency with-in the internal agent architecture of SAGE. It addresses the issues related to using the JAVA threading model to provide this level of concurrency to the agent and provides an alternative approach that is based on an eventdriven, concurrent and user-scalable multi-tasking model for the agent's internal model. The findings of this paper show that our proposed approach is suitable for providing an efficient and lightweight concurrent task model for SA GE and considerably outweighs the performance of multithreaded tasking model based on JAVA in terms of throughput and efficiency. This has been illustrated using the practical implementation and evaluation of both models. © 2004 IEEE.

CancerLectinDB: a database of lectins relevant to cancer

The role of lectins in mediating cancer metastasis, apoptosis as well as various other signaling events has been well established in the past few years. Data on various aspects of the role of lectins in cancer is being accumulated at a rapid pace. The data on lectins available in the literature is so diverse, that it becomes difficult and time-consuming, if not impossible to comprehend the advances in various areas and obtain the maximum benefit. Not only do the lectins vary significantly in their individual functional roles, but they are also diverse in their sequences, structures, binding site architectures, quaternary structures, carbohydrate affinities and specificities as well as their potential applications. An organization of these seemingly independent data into a common framework is essential in order to achieve effective use of all the data towards understanding the roles of different lectins in different aspects of cancer and any resulting applications. An integrated knowledge base (CancerLectinDB) together with appropriate analytical tools has therefore been developed for lectins relevant for any aspect of cancer, by collating and integrating diverse data. This database is unique in terms of providing sequence, structural, and functional annotations for lectins from all known sources in cancer and is expected to be a useful addition to the number of glycan related resources now available to the community. The database has been implemented using MySQL on a Linux platform and web-enabled using Perl-CGI and Java tools. Data for individual lectins pertain to taxonomic, biochemical, domain architecture, molecular sequence and structural details as well as carbohydrate specificities. Extensive links have also been provided for relevant bioinformatics resources and analytical tools. Availability of diverse data integrated into a common framework is expected to be of high value for various studies on lectin cancer biology.

On the roles of the northeast cold surge, the Borneo vortex, the Madden-Julian Oscillation, and the Indian Ocean Dipole during the extreme 2006/2007 flood in southern Peninsular Malaysia

The mid-December 2006 to late January 2007 flood in southern Peninsular Malaysia was the worst flood in a century and was caused by three extreme precipitation episodes. These extreme precipitation events were mainly associated with strong northeasterly winds over the South China Sea. In all cases, the northeasterlies penetrated anomalously far south and followed almost a straight trajectory. The elevated terrain over Sumatra and southern Peninsular Malaysia caused low-level convergence. The strong easterly winds near Java associated with the Rossby wave-type response to Madden-Julian Oscillation (MJO) inhibited the counter-clockwise turning of the northeasterlies and the formation of the Borneo vortex, which, in turn, enhanced the low-level convergence over the region. The abrupt termination of the Indian Ocean Dipole (IOD) in December 2006 played a secondary role as warmer equatorial Indian Ocean helped in the MJO formation.

Contesting Forests and Power : Dispute, Violence and Negotiations

"Contesting Forests and Power; Dispute, Violence and Negotiations in Central Java" is an ethnographic analysis of an ongoing forest land dispute and its negotiations in an upland forest village in the district of Wonosobo, Central Java. Rather than focusing only on the village site, this ethnography of global connections explores the inequalities of power in different negotiation arenas and how these power relations have had an effect on the dispute and efforts made to settle it. Today, national and transnational connections have an effect on how land disputes develop. This study argues that different cosmological and cultural orientations influence how the dispute and its negotiations have evolved. It draws its theoretical framework from legal and political anthropology by looking at the position of law in society, exploring state formation processes and issues of power. The dispute over state forest land is about a struggle over sovereignty which involves violence on the parts of different parties who maintain that they have a legitimate right to the state forest land. This anthropological study argues that this dispute and its negotiations reflect the plurality of laws in Java and Indonesia in a complex way. It shows that this dispute over forests and land in Java has deep historical roots that were revealed as the conflict emerged. Understanding land disputes in Java is important because of the enormous potential for conflicts over land and other natural resources throughout Indonesia. After the fall of President Suharto in 1998, disputes over access to state forest land emerged as a problem all over upland Java. As the New Order came to an end, forest cover on state forest lands in the Wonosobo district was largely destroyed. Disputes over access to land and forests took another turn after the decentralization effort in 1999, suggesting that decentralization does not necessarily contribute to the protection of forests. The dispute examined here is not unique, but, rather, this study attempts to shed light on forest-related conflicts all around upland Indonesia and on the ways in which differential power relations are reflected in these conflicts and the negotiation processes meant to resolve them.

Stand growth and management scenarios for Paraserianthes falcataria smallholder plantations in Indonesia

Paraserianthes falcataria is a very fast growing, light wood tree species, that has recently gained wide interest in Indonesia for industrial wood processing. At the moment the P. falcataria plantations managed by smallholders are lacking predefined management programmes for commercial wood production. The general objective of this study was to model the growth and yield of Paraserianthes falcataria stands managed by smallholders in Ciamis, West Java, Indonesia and to develop management scenarios for different production objectives. In total 106 circular sample plots with over 2300 P. falcataria trees were assessed on smallholder plantation inventory. In addition, information on market prices of P. falcataria wood was collected through rapid appraisals among industries. A tree growth model based on Chapman-Richards function was developed on three different site qualities and the stand management scenarios were developed under three management objectives: (1) low initial stand density with low intensity stand management, (2) high initial stand density with medium intensity of intervention, (3) high initial stand density and strong intensity of silvicultural interventions, repeated more than once. In general, the 9 recommended scenarios have rotation ages varying from 4 to 12 years, planting densities from 4x4 meters (625 trees ha-1) to 3x2 meters (1666 trees ha-1) and thinnings at intensities of removing 30 to 60 % of the standing trees. The highest annual income would be generated on high-quality with a scenario with initial planting density 3x2 m (1666 trees ha-1) one thinning at intensity of removing 55 % of the standing trees at the age of 2 years and clear cut at the age of 4 years.

RPS: Repeats in Protein Sequences

Repeats are two or more contiguous segments of amino acid residues that are believed to have arisen as a result of intragenic duplication, recombination and mutation events. These repeats can be utilized for protein structure prediction and can provide insights into the protein evolution and phylogenetic relationship. Therefore, to aid structural biologists and phylogeneticists in their research, a computing resource (a web server and a database), Repeats in Protein Sequences (RPS), has been created. Using RPS, users can obtain useful information regarding identical, similar and distant repeats (of varying lengths) in protein sequences. In addition, users can check the frequency of occurrence of the repeats in sequence databases such as the Genome Database, PIR and SWISS-PROT and among the protein sequences available in the Protein Data Bank archive. Furthermore, users can view the three-dimensional structure of the repeats using the Java visualization plug-in Jmol. The proposed computing resource can be accessed over the World Wide Web at http://bioserver1.physics.iisc.ernet.in/rps/.

Bandwidth management in a hybrid wireless network: For superstore applications

The integration of different wireless networks, such as GSM and WiFi, as a two-tier hybrid wireless network is more popular and economical. Efficient bandwidth management, call admission control strategies and mobility management are important issues in supporting multiple types of services with different bandwidth requirements in hybrid networks. In particular, bandwidth is a critical commodity because of the type of transactions supported by these hybrid networks, which may have varying bandwidth and time requirements. In this paper, we consider such a problem in a hybrid wireless network installed in a superstore environment and design a bandwidth management algorithm based on the priority level, classification of the incoming transactions. Our scheme uses a downlink transaction scheduling algorithm, which decides how to schedule the outgoing transactions based on their priority level with efficient use of available bandwidth. The transaction scheduling algorithm is used to maximize the number of transaction-executions. The proposed scheme is simulated in a superstore environment with multi Rooms. The performance results describe that the proposed scheme can considerably improve the bandwidth utilization by reducing transaction blocking and accommodating more essential transactions at the peak time of the business.

Null Dereference Verification via Over-approximated Weakest Pre-conditions Analysis

Null dereferences are a bane of programming in languages such as Java. In this paper we propose a sound, demand-driven, inter-procedurally context-sensitive dataflow analysis technique to verify a given dereference as safe or potentially unsafe. Our analysis uses an abstract lattice of formulas to find a pre-condition at the entry of the program such that a null-dereference can occur only if the initial state of the program satisfies this pre-condition. We use a simplified domain of formulas, abstracting out integer arithmetic, as well as unbounded access paths due to recursive data structures. For the sake of precision we model aliasing relationships explicitly in our abstract lattice, enable strong updates, and use a limited notion of path sensitivity. For the sake of scalability we prune formulas continually as they get propagated, reducing to true conjuncts that are less likely to be useful in validating or invalidating the formula. We have implemented our approach, and present an evaluation of it on a set of ten real Java programs. Our results show that the set of design features we have incorporated enable the analysis to (a) explore long, inter-procedural paths to verify each dereference, with (b) reasonable accuracy, and (c) very quick response time per dereference, making it suitable for use in desktop development environments.

Fragment Finder 2.0: a computing server to identify structurally similar fragments

Fragment Finder 2.0 is a web-based interactive computing server which can be used to retrieve structurally similar protein fragments from 25 and 90% nonredundant data sets. The computing server identifies structurally similar fragments using the protein backbone C alpha angles. In addition, the identified fragments can be superimposed using either of the two structural superposition programs, STAMP and PROFIT, provided in the server. The freely available Java plug-in Jmol has been interfaced with the server for the visualization of the query and superposed fragments. The server is the updated version of a previously developed search engine and employs an in-house-developed fast pattern matching algorithm. This server can be accessed freely over the World Wide Web through the URL http://cluster.physics.iisc.ernet.in/ff/.

Reuse, recycle to de-bloat software

Most Java programmers would agree that Java is a language that promotes a philosophy of “create and go forth”. By design, temporary objects are meant to be created on the heap, possibly used and then abandoned to be collected by the garbage collector. Excessive generation of temporary objects is termed “object churn” and is a form of software bloat that often leads to performance and memory problems. To mitigate this problem, many compiler optimizations aim at identifying objects that may be allocated on the stack. However, most such optimizations miss large opportunities for memory reuse when dealing with objects inside loops or when dealing with container objects. In this paper, we describe a novel algorithm that detects bloat caused by the creation of temporary container and String objects within a loop. Our analysis determines which objects created within a loop can be reused. Then we describe a source-to-source transformation that efficiently reuses such objects. Empirical evaluation indicates that our solution can reduce upto 40% of temporary object allocations in large programs, resulting in a performance improvement that can be as high as a 20% reduction in the run time, specifically when a program has a high churn rate or when the program is memory intensive and needs to run the GC often.