Java Development Environment Research Articles

NETBEANS JAVA-BASED SCHOLARSHIP ADMISSION DECISION SUPPORT SYSTEM ON SMK INSAN TEKNOKRAT BEKASI

This research aims to develop a Java NetBeans-based decision support system (SPK) for scholarship acceptance at Bekasi Insan Teknokrat Vocational School (Jaya Cimuning). This system uses the Simple Additive Weighting (SAW) method in the decision-making process to assess the eligibility of scholarship recipients based on certain criteria. The SAW method is integrated in the NetBeans Java development environment, and the results are evaluated for speed, accuracy, and user satisfaction level. This research resulted in a system that was successfully implemented, achieving an accuracy rate of 90% in assessing the eligibility of scholarship recipients. User evaluation shows a satisfaction rate of 85%, indicating a good user interface and ease of use of the system. This system makes a positive contribution to efficiency and transparency in the scholarship acceptance process at Bekasi Insan Teknocrat Vocational School. The research conclusion shows that this decision support system can be an effective tool in supporting the scholarship acceptance process. Development recommendations include improvements to the user interface, adding additional features, and further integration with the school's administrative systems. The results of this research provide a basis for further development in the field of decision support systems and their application in educational contexts.

A comparative analysis of contemporary integrated java environments

The purpose of this study was to compare three of the most popular Java development environments: IntelliJ IDEA, Netbeans, and Eclipse, in order to identify the best one for specific user archetypes. Using a program specially designed for this task, the execution time was measured, as well as the CPU and RAM usage during the execution of the program on each environment. The obtained data was collected and processed accordingly. Additionally, the environments were compared in a number of ways, including features that distinguish them from each other, ease learnability for a new user or support from the developers. The study concluded with IntelliJ IDEA being the best environment for all of the considered archetypes.

An API in JAVA Which Render Ease at Programming for Developers

Abstract – Based on the concept of Application programming interface (API).This project comprises of a package named "algokit" which contains several algorithms based on the category of searching, sorting, dynamic programming, tree traversals and swapping. Keeping in mind that different algorithms from the same category have its own benefit in time and space complexity, This project covers almost all the algorithms known and available from each category. This would give the user several options to choose the right algorithm for its code.An user just requires to import the package named AlgoKit and call the functions inside it for a smooth programming experience. One of the prime objectives of this project is to build a kit that serves the purpose of reducing the number of lines of code and also reduce the time taken to run the same code elsewhere. It is platform independent and can be used in any open source Java development environment.

9-112 オープンソースエディタ環境を用いた軽量なJava開発環境の構築((14)教育ソフトウェア,口頭発表論文)

9-112 オープンソースエディタ環境を用いた軽量なJava開発環境の構築((14)教育ソフトウェア,口頭発表論文)

A Novel Steganography Technique for SDTV-H.264/AVC Encoded Video

Today, eavesdropping is becoming a common issue in the rapidly growing digital network and has foreseen the need for secret communication channels embedded in digital media. In this paper, a novel steganography technique designed for Standard Definition Digital Television (SDTV) H.264/AVC encoded video sequences is presented. The algorithm introduced here makes use of the compression properties of the Context Adaptive Variable Length Coding (CAVLC) entropy encoder to achieve a low complexity and real-time inserting method. The chosen scheme hides the private message directly in the H.264/AVC bit stream by modifying the AC frequency quantized residual luminance coefficients of intrapredicted I-frames. In order to avoid error propagation in adjacent blocks, an interlaced embedding strategy is applied. Likewise, the steganography technique proposed allows self-detection of the hidden message at the target destination. The code source was implemented by mixing MATLAB 2010 b and Java development environments. Finally, experimental results have been assessed through objective and subjective quality measures and reveal that less visible artifacts are produced with the technique proposed by reaching PSNR values above 40.0 dB and an embedding bit rate average per secret communication channel of 425 bits/sec. This exemplifies that steganography is affordable in digital television.

Computational thinking in Greenfoot: AI game strageties for CS1

We introduce workshop participants to Quoridor, a multiplayer strategy game for which we've developed an engine in Greenfoot [1]. We use Greenfoot, an interactive Java development environment desig...

A QoS-aware optimal selection scheme for web services with a trusted environment

Optimal web service selection among number of services for diversified user’s functional requirements brings a challenging issue. Currently available service selection schemes consider the quality of service (QoS) parameters of web services. These schemes produce less significant results when there are multiple service providers with their multiple functionally identical services. Present paper describes a QoS-aware optimal selection scheme. The paper considers an additional QoS parameter called trust rate for each service provider. A trust rate depends on the reliability of the service provider. The paper describes a binary search algorithm, which selects the trustworthy services. This study discusses results of computational time complexity for searching optimal services. The QoS-aware selection is optimized based on trust rates. Advanced Java development environment Eclipse is used for the implementation. Axis2 server is used to create the web services. A comparative study of results with the complexity computed for the earlier adopted schemes shows that complexity decreases exponentially. The proposed scheme is experimented on e-supply chain management system. Along with trust rate, some extended parameters can be evaluated to achieve optimization.

Controllability for discrete event systems modelled in VeriJ

Existing tools for controllability checking mostly apply to abstract formalisms like finite automata or Petri nets. To avoid costly building of low-level formal models for large complex systems, we propose a programming language called VeriJ, a subset of Java with additional constructs dedicated to supervisory control, to model these systems in a familiar and friendly development environment. We provide a prototype tool chain, based on model transformation and pushdown automata, to automatically transform a system described in VeriJ into a labelled transition system (LTS). A controllability engine for this LTS is then integrated to the tool. To limit the state space explosion problem, we also add several mechanisms including garbage collection, abstraction, state compression, and partial exploration. Our approach, illustrated with a VeriJ model of the Nim game, shows that it is possible to combine: 1) the benefits resulting from using mature Java development environments; 2) performances comparable to those of existing tools.

Multipurpose Controller with EPICS integration and data logging: BPM application for ESS Bilbao

This work presents a multipurpose configurable control system which can be integrated in an EPICS control network, this functionality being configured through a XML configuration file. The core of the system is the so-called Hardware Controller which is in charge of the control hardware management, the set up and communication with the EPICS network and the data storage. The reconfigurable nature of the controller is based on a single XML file, allowing any final user to easily modify and adjust the control system to any specific requirement. The selected Java development environment ensures a multiplatform operation and large versatility, even regarding the control hardware to be controlled. Specifically, this paper, focused on fast control based on a high performance FPGA, describes also an application approach for the ESS Bilbao's Beam Position Monitoring system. The implementation of the XML configuration file and the satisfactory performance outcome achieved are presented, as well as a general description of the Multipurpose Controller itself.

Unrestricted and safe dynamic code evolution for Java

Dynamic code evolution is a technique to update a program while it is running. In an object-oriented language such as Java, this can be seen as replacing a set of classes by new versions. We modified an existing high-performance virtual machine to allow arbitrary changes to the definition of loaded classes. Besides adding and deleting fields and methods, we also allow any kind of changes to the class and interface hierarchy. Our approach focuses on increasing developer productivity during debugging, but can also be applied for updating of long-running applications. Changes can be applied at any point at which a Java program can be suspended.Our virtual machine is able to continue execution of old changed or deleted methods and also to access deleted static fields. A dynamic verification of the current state of the program ensures type safety of complex class hierarchy changes. However, the programmer still has to ensure that the semantics of the modified program are correct and that the new program version can start running from the state left behind by the old program version.The evaluation section shows that our modifications to the virtual machine have no negative performance impact on normal program execution. The in-place instance update algorithm is in many cases faster than a full garbage collection. Standard Java development environments automatically use the code evolution features of our modified virtual machine, so no additional tools are required.

A Load Balancing Policy for Distributed Web Service

The proliferation of web services; and users appeal for high scalability, availability and reliability of web servers to provide rapid response and high throughput for the Clients’ requests occurring at anytime. Distributed Web Servers (DWSs) provide an effective solution for improving the quality of web services. This paper addresses un-regulated jobs/tasks migration among the servers. Considering distributed web services with several servers running, a lot of bandwidth is wasted due to unnecessary job migration. Having considered bandwidth optimization, it is important to develop a policy that will address the bandwidth consumption while loads/tasks are being transferred among the servers. The goal of this work is to regulate this movement to minimize bandwidth consumption. From literatures, little or no attention was given to this problem, making it difficult to implement some of these policies/schemes in bandwidth scarce environment. Our policy “Cooperative Adaptive Symmetrical Initiated Dynamic/Diffusion (CASID)” was developed using Java Development Environment (JADE) a middle ware service oriented environment which is agent-based. The software was used to simulate events (jobs distribution) on the servers. With no job transfer allowed when all servers are busy, any over loaded server process jobs internally to completion. We achieved this by having two different agents; static cognitive agents and dynamic cognitive agents. The results were compared with the existing schemes. CASID policy outperforms PLB scheme in terms of response time and system throughput.

Development of NETCONF-Based Network Management Systems in Web Services Framework

To develop a network management system (NMS) more easily, the authors developed an application programming interface (API) for configuring network devices. Because this API is used in a Java development environment, an NMS can be developed by utilizing the API and other commonly available Java libraries. It is thus possible to easily develop an NMS that is highly compatible with other IT systems. And operations that are generated from the API and that are exchanged between the NMS and network devices are based on NETCONF, which is standardized by the Internet Engineering Task Force (IETF) as a next-generation network-configuration protocol. Adopting a standardized technology ensures that the NMS developed by using the API can manage network devices provided from multi-vendors in a unified manner. Furthermore, the configuration items exchanged over NETCONF are specified in an object-oriented design. They are therefore easier to manage than such items in the Management Information Base (MIB), which is defined as data to be managed by the Simple Network Management Protocol (SNMP). We actually developed several NMSs by using the API. Evaluation of these NMSs showed that, in terms of configuration time and development time, the NMS developed by using the API performed as well as NMSs developed by using a command line interface (CLI) and SNMP. The NMS developed by using the API showed feasibility to achieve “autonomic network management” and “high interoperability with IT systems.”

Slicing concurrent Java programs using Indus and Kaveri

Program slicing is a program analysis and transformation technique that has been successfully used in a wide range of applications including program comprehension, debugging, maintenance, testing, and verification. However, there are only few fully featured implementations of program slicing that are available for industrial applications or academic research. In particular, very little tool support exists for slicing programs written in modern object-oriented languages such as Java, C#, or C++. In this paper, we present Indus—a robust framework for analyzing and slicing concurrent Java programs, and Kaveri—a feature-rich Eclipse-based GUI front end for Indus slicing. For Indus, we describe the underlying tool architecture, analysis components, and program dependence capabilities required for slicing. In addition, we present a collection of advanced features useful for effective slicing of Java programs including calling-context sensitive slicing, scoped slicing, control slicing, and chopping. For Kaveri, we discuss the design goals and basic capabilities of the graphical facilities integrated into a Java development environment to present the slicing information. This paper is an extended version of a tool demonstration paper presented at the International Conference on Fundamental Aspects of Software Engineering (FASE 2005). Thus, the paper highlights tool capabilities and engineering issues and refers the reader to other papers for technical details.

SECURITY OPTIMIZATION FOR AGENT PLATFORMS AND REDUCING TURNAROUND TIME FOR MOBILE AGENTS

In this paper experiments are described that result in optimization of the computation cost for an agent platform that appear due to complex security operations and causes reduction in the turnaround time of the mobile agents. A detached security manager provides comprehensive security services for the mobile agents on behalf of a set of agent platforms. In this paper, a comparison of detached verses integrated security manager from the agent platform has been performed. The simulation results show a significant improvement in the turnaround time of the mobile agent. For these simulations OMNeT++, a discrete simulation tool and Java development environment jdk 1.5 are used. Copyright © 2007 IFAC.

Correlating temporal communication patterns of the Eclipse open source community with performance and creativity

This paper studies the temporal communication patterns of online communities of developers and users of the open source Eclipse Java development environment. It measures the productivity of each community and seeks to identify correlations that exist between group communication characteristics and productivity attributes. The study uses the TeCFlow (Temporal Communication Flow) visualizer to create movie maps of the knowledge flow by analyzing the publicly accessible Eclipse developer mailing lists as an approximation of the social networks of developers and users. Thirty-three different Eclipse communities discussing development and use of components of Eclipse such as the Java Development Tools, the different platform components, the C/C++ Development Tools and the AspectJ extension have been analyzed over a period of six months. The temporal evolution of social network variables such as betweenness centrality, density, contribution index, and degree have been computed and plotted. Productivity of each development group is measured in terms of two indices, namely performance and creativity. Performance of a group is defined as the ratio of new bugs submitted compared with bugs fixed within the same period of time. Creativity is calculated as a function of new features proposed and implemented. Preliminary results indicate that there is a correlation between attributes of social networks such as density and betweenness centrality and group productivity measures in an open source development community. We also find a positive correlation between changes over time in betweenness centrality and creativity, and a negative correlation between changes in betweenness centrality and performance.

Online annotation tool for digital mammography 1

Rationale and objectives To develop a software tool for radiologists to annotate mammograms online. Materials and methods The tool is web-based with a Java development environment and composed of a Digital Image and Communication in Medicine (DICOM) image viewer, a clinical information collector, and a database. The use of the tool with a sample case is demonstrated in this article. Results An online tool for the annotation of digital mammograms for teaching and research purposes has been developed. Conclusion This annotation tool can be used to provide an annotated-case library on mammography education for residents and fellows.

Enhancing apprentice-based learning of Java

Various methods have been proposed in the past to improve student learning by introducing new styles of working with assignments. These include problem-based learning, use of case studies and apprenticeship. In most courses, however, these proposals have not resulted in a widespread significant change of teaching methods. Most institutions still use a traditional lecture/lab class approach with a strong separation of tasks between them. In part, this lack of change is a consequence of the lack of easily available and appropriate tools to support the introduction of new approaches into mainstream courses.In this paper, we consider and extend these ideas and propose an approach to teaching introductory programming in Java that integrates assignments and lectures, using elements of all three approaches mentioned above. In addition, we show how the BlueJ interactive programming environment [7] (a Java development environment aimed at education) can be used to provide the type of support that has hitherto hindered the widespread take-up of these approaches. We arrive at a teaching method that is motivating, effective and relatively easy to put into practice. Our discussion includes a concrete example of such an assignment, followed by a description of guidelines for the design of this style of teaching unit.

Orienting the Teaching of an Introductory Object-Oriented Programming to Meet the Learning Objective

This paper describes our experiences in teaching a first year object-oriented programming course. We used Java as a vehicle to teach programming principles and BlueJ as a Java development environment. The course was heavily supported by web-based resources delivered throughWebCT. So far we consider the overall students’ learning experience as being considerably enriched and a positive one.

Towards an integrated learning laboratory environment for first-year computer science students

This paper describes an evolving attempt to provide an integrated learning laboratory environment (ILLE) to enhance the learning goals and strategies for first-year computer science students using Java as a first language. The proposed ILLE models a real computer-learning laboratory in which instructors walk around watching and helping students on request. In essence, the system consists of a Java development environment centered round a live communicator with a facility for an instructor to focus and work on the desk top of a particular student. The system is written in 4000 lines of Java and runs in exactly the same way on Windows, UNIX and MacOS. The ILLE gathers usage information that is being used to improve the learning for first year students. It has been used twice with large first year classes. Examples show how extracts from dialogue files enhanced the ILLE.

The COIL data mediator definition language

AbstractModern persistent applications typically run on top of numerous (often hundreds) of distributed, heterogeneous databases. Integrating data from various data sources in order to provide uniform, homogeneous, and consistent access to the data from the underlying data sources while preserving the integrity and autonomy of preexisting data sources is a huge problem, especially in evolving environments. The main issue that a global information sharing system has to address is heterogeneity on all levels of the participating data sources: the data might be stored in heterogeneous data sources, using different data models and access/middleware technologies. Another major type of heterogeneity that has to be addressed by a global information sharing system is due to differences in the semantics of the data from the data source participating in the integration process. In particular, the resolution of potential conflicts due to structural and semantic heterogeneity of the integrated data is an essential part of the integration process performed by a data integration environment.The COIL data mediator definition language supports the definition of the integration process and its semantics on a high level of abstraction. The language provides powerful language components which can be used to resolve potential conflicts due to structural and semantic heterogeneity, and to define the integration process in general. The semantics of a specific integration process are defined in a COIL data mediator definition (COIL program). The COIL compiler uses those specifications expressed in the COIL language to generate a standard Java object which captures the semantics of the integration process defined in the COIL mediator definition. The generated Java object is called a COIL data mediator. In general, a COIL data mediator is a user‐defined, customized object/component which can be used like any other normal object in the Java development environment. A COIL data mediator presents a well‐defined interface which may be used to access and configure the mediator at runtime. Therefore it is possible to change the data mediator's behavior and the semantics of the integration process in general at runtime. We present a detailed description of the COIL data mediator definition language and its language components, along with a detailed discussion of how COIL data mediators are used to overcome different heterogeneity problems. Copyright © 2001 John Wiley & Sons, Ltd.