Java Support Research Articles

Software application for uniform quantitative evaluation of social economy projects

The qualitative impact calculation for the implementation of a social economy project can be done using dedicated computing software. In this paper we have defined PQS which is an application on JAVA support that allows use irrespective of the existing support platform on the computer. The created application has the advantage that it can run both on computers and on other devices (tablets, phones, etc.). The input data are represented by the values assumed and realized in the project and are stored in a MySQL database.

Espresso

Fast, byte-addressable non-volatile memory (NVM) embraces both near-DRAM latency and disk-like persistence, which has generated considerable interests to revolutionize system software stack and programming models. However, it is less understood how NVM can be combined with managed runtime like Java virtual machine (JVM) to ease persistence management. This paper proposes Espresso, a holistic extension to Java and its runtime, to enable Java programmers to exploit NVM for persistence management with high performance. Espresso first provides a general persistent heap design called Persistent Java Heap (PJH) to manage persistent data as normal Java objects. The heap is then strengthened with a recoverable mechanism to provide crash consistency for heap metadata. Espresso further provides a new abstraction called Persistent Java Object (PJO) to provide an easy-to-use but safe persistence programming model for programmers to persist application data. Evaluation confirms that Espresso significantly outperforms state-of-art NVM support for Java (i.e., JPA and PCJ) while being compatible to data structures in existing Java programs.

Degree of community participation in mangrove resources management as livelihood support in West Java, Indonesia

Mangrove forests in the northern coastal region of Pantai Bahagia Village, Muara Gembong, Bekasi Regency, West Java, form a crucial component of the livelihoods of coastal communities. However, mangrove systems are being degraded and lost at an alarming rate due to their conversion to aquaculture and abrasion since 1992. To overcome this problem, community of fishermen, naming themselves as Kelompok Sadar Wisata and Kelompok Bahagia Berkarya voluntarily started mangrove cultivation and began to implement Community-Based Mangrove Management (CBMM) with various approaches and outcomes. This study will examine and the participatory level of the CBMM practice within the community, analyze the achieved rehabilitation and its strategies to accomplish sustainable management of mangrove resources in the village through qualitative and descriptive statistic methods. The local data on institutions, socio-economic conditions, and mangrove resources utilization will be collected through in depth interviews with 40 key actors from 15 households. The study resulted that the degree of participatory in Pantai Bahagia Village is in the Delegated Power level, which means that citizen is given the permit to utilize the area to independently cultivate the mangrove area as long as it complies with government’s regulation.

Design and implementation of Java bindings in Open MPI

This paper describes the Java MPI bindings that have been included in the Open MPI distribution. Open MPI is one of the most popular implementations of MPI, the Message-Passing Interface, which is the predominant programming paradigm for parallel applications on distributed memory computers. We have added Java support to Open MPI, exposing MPI functionality to Java programmers. Our approach is based on the Java Native Interface, and has similarities with previous efforts, as well as important differences. This paper serves as a reference for the application program interface, and in addition we provide details of the internal implementation to justify some of the design decisions. We also show some results to assess the performance of the bindings.

RTOS BASED ENERGY EFFICIENT SMARTHOME

The features of Android like its Connectivity , Java support has been widely used in many applications . This paper presents the design and implementation of a low cost yet compact and wide range Android smart phone based home automation system. This project is based on the popular Arduino prototyping board where the electrical appliances are interfaced with ports of the board . In order to make the system energy efficient , we've used some sensors to analyse the current environmental conditions so as to provide energy efficiency . To handle these various operations we have integrated a popular RTOS, the scmRTOS, which has a very small footprint on the microcontroller. An Andro id application which has been developed for Android devices is used for interation between user and system .A typical wireless home automation system allows one to control house hold appliances from a centralized control unit which is wireless. The project demonstrates a system that can be integrated as a single portable unit and allows one to wirelessly control lights, fans, water sprinkler etc. and t urn on or off any appliance , get the status of different sensors and take decision accordingly.The project also deals with contolling the fan speed, light intensity by limitting the amount of current supplied to appliances. The medium used f or sending a nd receiving of commands is Wi Fi w hich is a ga in of t he feat ure of Android system a nd a t the control uni t XBee transceiver is used for same purpose. The remote system receives the commands through XBee transceiver and performs the request function. The sensors unit is capable of detecting chnages in environmental conditions like temperature , soil moisture and can accordingly turn on or off appliances such as lights and fans and in the meantime send its status back to base station.

Low-level detection of language-level data races with LARD

Researchers have proposed always-on data-race exceptions as a way to avoid the ill effects of data races, but slow performance of accurate dynamic data-race detection remains a barrier to the adoption of always-on data-race exceptions. Proposals for accurate low-level (e.g., hardware) data-race detection have the potential to reduce this performance barrier. This paper explains why low-level data-race detectors are wrong for programs written in high-level languages (e.g., Java): they miss true data races and report false data races in these programs. To bring the benefits of low-level data-race detection to high-level languages, we design low-level abstractable race detection (LARD), an extension of the interface between low-level data-race detectors and run-time systems that enables accurate language-level data-race detection using low-level detection mechanisms. We implement accurate LARD data-race exception support for Java, coupling a modified Jikes RVM Java virtual machine and a simulated hardware race detector. We evaluate our detector's accuracy against an accurate dynamic Java data-race detector and other low-level race detectors without LARD, showing that naive accurate nlow-level data-race detectors suffer from many missed and false language-level races in practice, and that LARD prevents this inaccuracy.

Low-level detection of language-level data races with LARD

Researchers have proposed always-on data-race exceptions as a way to avoid the ill effects of data races, but slow performance of accurate dynamic data-race detection remains a barrier to the adoption of always-on data-race exceptions. Proposals for accurate low-level (e.g., hardware) data-race detection have the potential to reduce this performance barrier. This paper explains why low-level data-race detectors are wrong for programs written in high-level languages (e.g., Java): they miss true data races and report false data races in these programs. To bring the benefits of low-level data-race detection to high-level languages, we design low-level abstractable race detection (LARD), an extension of the interface between low-level data-race detectors and run-time systems that enables accurate language-level data-race detection using low-level detection mechanisms. We implement accurate LARD data-race exception support for Java, coupling a modified Jikes RVM Java virtual machine and a simulated hardware race detector. We evaluate our detector's accuracy against an accurate dynamic Java data-race detector and other low-level race detectors without LARD, showing that naive accurate nlow-level data-race detectors suffer from many missed and false language-level races in practice, and that LARD prevents this inaccuracy.

Enhancing OSGi with real‐time Java support

SUMMARYOSGi was designed with embedded systems in mind, its current support is insufficient for coping with one main characteristic of many embedded systems: real‐time performance. This article analyzes different key issues in providing OSGi with real‐time Java performance covering motivational issues, and different integration ways and challenges stemming from the integration. It also contributes a general framework for introducing real‐time performance in OSGi, which is called the real‐time for OSGi framework. The framework uses real‐time Java virtual machines and the real‐time specification for Java. The adoption of this framework allows cyber‐physical systems to experience real‐time Java performance in their applications. The framework introduces several integration levels for OSGi and real‐time specification for Java, and specific real‐time OSGi services. An empirical implementation was carried out using standard software, which was extended with the new defined services. Copyright © 2012 John Wiley & Sons, Ltd.

Java support for SED-ML

Java support for SED-ML

Java support for SED-ML

AbstractThis presentation describes Java support for the SED-ML simulation experiment description language. Firstly, a Java API library for low-level manipulations of the SED-ML object model, and secondly a SED-ML editor, SED-ED, for visualizing and editing SED-ML workflows

Reasoning about conditional constraint specification problems and feature models

AbstractProduct configuration is a major industrial application domain for constraint satisfaction techniques. Conditional constraint satisfaction problems (CCSPs) and feature models (FMs) have been developed to represent configuration problems in a natural way. CCSPs are like constraint satisfaction problems (CSPs), but they also include potential variables, which might or might not exist in any given solution, as well as classical variables, which are required to take a value in every solution. CCSPs model, for example, options on a car, for which the style of sunroof (a variable) only makes sense if the car has a sunroof at all. FMs are directed acyclic graphs of features with constraints on edges. FMs model, for example, cell phone features, where utility functions are required, but the particular utility function “games” is optional, but requires Java support. We show that existing techniques from formal methods and answer set programming can be used to naturally model CCSPs and FMs. We demonstrate configurators in both approaches. An advantage of these approaches is that the model builder does not have to reformulate the CCSP or FM into a classic CSP, converting potential variables into classical variables by adding a “does not exist” value and modifying the problem constraints. Our configurators automatically reason about the model itself, enumerating all solutions and discovering several kinds of model flaws.

No-Heap remote objects for distributed real-time Java

This article presents an approach to providing real-time support for Java's Remote Method Invocation (RMI) and its integration with the RTSJ memory model in order to leave out garbage collection. A new construct for remote objects, called No-heap Remote object ( NhRo ), is introduced. The use of a NhRo guarantees that memory required to perform a remote invocation (at the server side) does not use heap memory. Thus, the aim is to avoid garbage collection in the remote invocation process, improving predictability and memory isolation of distributed Java-based real-time applications. The article presents the bare model and the main programming patterns that are associated with the NhRo model. Sun RMI implementation has been modified to integrate the NhRo model in both static and dynamic environments.

ACCUSA—accurate SNP calling on draft genomes

Next generation sequencing technologies facilitate genome-wide analysis of several biological processes. We are interested in whole-genome genotyping. To our knowledge, none of the existing single nucleotide polymorphism (SNP) callers consider the quality of the reference genome, which is not necessary for high-quality assemblies of well-studied model organisms. However, most genome projects will remain in draft status with little to no genome assembly improvement due to time and financial constraints. Here, we present a simple yet elegant solution ('ACCUSA') that considers both the read qualities as well as the reference genome's quality using a Bayesian framework. We demonstrate that ACCUSA is as good as the current SNP calling software in detecting true SNPs. More importantly, ACCUSA does not call spurious SNPs, which originate from a poor reference sequence. ACCUSA is available free of charge to academic users and may be obtained from ftp://bbc.mdc-berlin.de/software. ACCUSA is programmed in JAVA 6 and runs on any platform with JAVA support. christoph.dieterich@mdc-berlin.de Supplementary data are available at Bioinformatics online.

On simulation of optimal strategies and Nash equilibrium in the financial market context

Unlike physical time series, stock market prices may be affected by the predictions made by market participants with conflicting interests. This is the domain of game theory. Therefore, we propose a Stock Exchange Game Model (SEGM) to model this phenomenon. In SEGM, player strategies are to set their buying and selling levels for the next iteration via the autoregressive model AR(p) of order p selected by minimizing deviations from Nash Equilibrium (NE). NE represents the assumption of optimal behavior by market participants. The objective of SEGM is to simulate financial and other time series that are affected by predictions of the participants and to test the assumption of optimal player behavior, using a `virtual' stock exchange. The simulation of SEGM suggests that NE is close to the Wiener model. This is a new explanation of the Random Walk (RW) model of the efficient market theory. To compare the simulation results with real data, the efficient market hypothesis was also tested, using financial time series of eight assets. The SEGM software is implemented in Java applets and can be run using a browser with Java support. The main web site is in http://soften.ktu.lt/~mockus .

Integrating Mixed-Reality Remote Experiments Into Virtual Learning Environments Using Interchangeable Components

This paper presents a proposal to integrate mixed-reality remote experiments into virtual learning environments (VLEs) using the concept of interchangeable components, which can represent either real or virtual devices or software in industrial automation systems. Combinations of real and virtual technical plants and automation systems are used in different learning scenarios for teaching control and automation concepts. Configurations of interchangeable components can be dynamically created via a VLE by configuring database parameters. The proposed system includes a remote Web interface that follows a thin client strategy and is designed to be compatible with Web browsers, including basic Java support. As the architecture that supports the integration of virtual and real components is located on the server side, remote students/users are only concerned with the experiment and do not need to be aware of the system that provides this integration and flexibility. In the current version, interchangeable components are integrated via an Object Linking and Embedding for Process Control interface, which is a widely adopted standard in the control and automation area. The proposed approach also provides practical and theoretical support for experiments within a collaborative virtual environment. This paper includes a description of four experiments developed using the proposed environment and concepts.

Sound and extensible renaming for java

Descriptive names are crucial to understand code. However, good names are notoriously hard to choose and manually changing a globally visible name can be a maintenance nightmare. Hence, tool support for automated renaming is an essential aid for developers and widely supported by popular development environments. This work improves on two limitations in current refactoring tools: too weak preconditions that lead to unsoundness where names do not bind to the correct declarations after renaming, and too strong preconditions that prevent renaming of certain programs. We identify two main reasons for unsoundness: complex name lookup rules make it hard to define sufficient preconditions, and new language features require additional preconditions. We alleviate both problems by presenting a novel extensible technique for creating symbolic names that are guaranteed to bind to a desired entity in a particular context by inverting lookup functions. The inverted lookup functions can then be tailored to create qualified names where otherwise a conflict would occur, allowing the refactoring to proceed and improve on the problem with too strong preconditions. We have implemented renaming for Java as an extension to the JastAdd Extensible Java Compiler and integrated it in Eclipse. We show examples for which other refactoring engines have too weak preconditions, as well as examples where our approach succeeds in renaming entities by inserting qualifications. To validate the extensibility of the approach we have implemented renaming support for Java 5 and AspectJ like inter-type declarations as modular extensions to the initial Java 1.4 refactoring engine. The renaming engine is only a few thousand lines of code including extensions and performance is on par with industrial strength refactoring tools.

Teaching students to develop thread-safe java classes

Concurrent programming was once the preserve of experts writing systems internals; but recently the growing importance of application servers, and the excellent support in Java and C# for thread handling, has brought threads and locking as topics that every software developer might experience, and therefore every computer science graduate ought to know. In this paper we report on several years of experience teaching this material in the early years of the curriculum. We focus on one aspect of multi-threaded code, namely how to write sensible thread-safe classes. We identify the learning outcomes we aim to deliver, and we discuss the main pedagogic difficulties students find. We present some examples that can help students avoid common erroneous views.

Python puts a squeeze on java for CS0 and beyond

This paper compares Python with Java for teaching CS0, the first introductory course for computer science majors. Python has a simpler and more elegant syntax than Java. Python has an open, community-based development model managed by the non-profit Python Software Foundation; while Java is proprietary. Both Python and Java provide support for Graphical User Interfaces and object-oriented programming but Java seems to be more complex. These features make Python more suitable than Java for CS0 and more advanced courses.

Neuroinformatics support tools: XooNIps, Concierge, Samurai Graph and 3D-SE Viewer

Event Abstract Back to Event Neuroinformatics support tools: XooNIps, Concierge, Samurai Graph and 3D-SE Viewer Shiro Usui1*, Yoshihiro Okumura1, Takayuki Kannon1 and Liuji N. Kamiji1 1 RIKEN Brain Science Institute, Tokyo, Japan The Laboratory for Neuroinformatics at RIKEN Brain Science Institute was established in 2002 with the aim of developing essential technologies for further promotion and support to understand the brain in the IT era. We have developed several neuroinformatics tools to contribute to the advancement of this field in Japan. XooNIps is a Neuroinformatics base-platform system which can be utilized from personal use, to small groups such as laboratories, up to a large community like public platforms. The flexibility of XooNIps is further demonstrated by its user for the development of organizational repositories of libraries and research institutions. XooNIps has also gained popularity among private companies due to its easy to use interface compared to similar tools such as D-Space. RIKEN is also considering the XooNIps as the base platform for laboratory databases, institutional repository, and integrated databases. We are also expecting a global dissemination of XooNIps (http://xoonips.sourceforge.jp/). Concierge is a personal database solution of the researcher, by the researcher, for the researches, which is available as freeware (http://concierge.sourceforge.jp/). It includes features such as laboratory notebook, paper management where PDF files are managed together with information such as bibliographic metadata retrieved with the help of its PubMed ID, manage experimental files with information on experimental conditions, and using its feature to link with XooNIps, files can be easily uploaded to an open database. Samurai Graph: Graphical representation of experiment data is a work that no researcher can avoid. Commercially available graph-plotting tools are not compatible to each other. In order to deal with this issue we have developed the Samurai Graph, also available as a freeware (http://samurai-graph.sourceforge.jp/index.html.en). Researchers can easily create and edit graphs on-screen. The Samurai Graph site has been accessed hundreds of thousands of times, and has received much praise from many users. As Samurai Graph is Java-based it is available on all platforms providing Java support. 3D-SE Viewer is a visualization tool based on a spherical embedding method. We have published the BSI-Team Map as an example of its application on the BSI webpage (http://www.brain.riken.jp/). Here, laboratory heads are positioned in the outer sphere, and keywords on the inner sphere, where the nodes are optimally positioned according to the similarity between each other. It can be rotated or zoomed in or out using the mouse, and laboratories can be searched by clicking the nodes. In the future, application of the 3D-SE Viewer for the visualization of the contents of Neuroinformatics platforms in J-Node, as well as of databases of papers published by BSI researchers is expected. In addition, the PubMed Plus committee of the Society for Neuroscience (SfN) is considering the development of a new tool for the visualization of the abstracts presented at the SfN annual meeting. Conference: Neuroinformatics 2008, Stockholm, Sweden, 7 Sep - 9 Sep, 2008. Presentation Type: Poster Presentation Topic: General Neuroinformatics Citation: Usui S, Okumura Y, Kannon T and Kamiji LN (2008). Neuroinformatics support tools: XooNIps, Concierge, Samurai Graph and 3D-SE Viewer. Front. Neuroinform. Conference Abstract: Neuroinformatics 2008. doi: 10.3389/conf.neuro.11.2008.01.005 Copyright: The abstracts in this collection have not been subject to any Frontiers peer review or checks, and are not endorsed by Frontiers. They are made available through the Frontiers publishing platform as a service to conference organizers and presenters. The copyright in the individual abstracts is owned by the author of each abstract or his/her employer unless otherwise stated. Each abstract, as well as the collection of abstracts, are published under a Creative Commons CC-BY 4.0 (attribution) licence (https://creativecommons.org/licenses/by/4.0/) and may thus be reproduced, translated, adapted and be the subject of derivative works provided the authors and Frontiers are attributed. For Frontiers’ terms and conditions please see https://www.frontiersin.org/legal/terms-and-conditions. Received: 25 Jul 2008; Published Online: 25 Jul 2008. * Correspondence: Shiro Usui, RIKEN Brain Science Institute, Tokyo, Tokyo, Japan, usuishiro@riken.jp Login Required This action requires you to be registered with Frontiers and logged in. To register or login click here. Abstract Info Abstract Supplemental Data The Authors in Frontiers Shiro Usui Yoshihiro Okumura Takayuki Kannon Liuji N Kamiji Google Shiro Usui Yoshihiro Okumura Takayuki Kannon Liuji N Kamiji Google Scholar Shiro Usui Yoshihiro Okumura Takayuki Kannon Liuji N Kamiji PubMed Shiro Usui Yoshihiro Okumura Takayuki Kannon Liuji N Kamiji Related Article in Frontiers Google Scholar PubMed Abstract Close Back to top Javascript is disabled. Please enable Javascript in your browser settings in order to see all the content on this page.

Real-time Linux in real time

The increasing market demand for systems characterized by low-latency, deterministic behavior and the emphasis on the use of commodity hardware and software have led to a new breed of real-time operating systems (OSs), known as enterprise real-time OSs. In response to the demand for accelerated access to such features in a Linux™ kernel, the IBM Linux and Java™ Technology Centers collaborated to provide the first commercially available enterprise real-time Linux kernel with real-time Java support. Extending the PREEMPT RT patch from Ingo Molnar of Red Hat, Inc., the kernel contains additional features that were required to meet the demands of enterprise real-time OS customers. This paper describes how IBM developers helped to direct, implement, and test the real-time Linux kernel, bringing it from software patches to a finished product in nine months.