Java Platform Research Articles

A Combined Scheme for Controlling GSM Network Calls Congestion

Network congestion and signal quality degradation are the major problems of the Global System for Mobile communication (GSM) most especially as the number of customers increases. They are issues that constantly and continuously demand for further researches to improve network performance. Congestion in various systems has always been tackled with various attempts, all of which falls in either the congestion avoidance category or congestion management category. Congestion avoidance has however been adjudged the best scheme for controlling network congestion and this is the approach employed in this research work. The conventional GSM network calls congestion control methods such as Token Bank, Auto atic Call Gapping among which Call Admission Control (CAC) is the best, was selected for this work. Dynamic load balancing technique was combined with CAC to re-route calls that would have been dropped to another less busy cell within the Base Station Controller (BSC) area. A naive form of Dijkstra shortest path algorithm was used to find the shortest route to which calls can be transferred among the collocated base station cells. The combined algorithms were implemented on JAVA platform using real life call data record (CDR) collected from Globacom Nigeria Limited New Call Blocking and Handoff Call Dropping Probabilities (NCBP and HCDP) were used to measure the performance results. The two probabilities were computed for both CAC only and the combined scheme. The results obtained showed that there is significant reduction in the values of both NCBP and HCDP by 71.43% and 100% respectively, of cells considered for the new combined scheme when compared with that of the CAC only. This indicates that the new scheme has further reduced the values of the NCBP and HCDP which enabled the cells to accommodate more calls thereby increasing the efficiency of the network performance.

A BIST GENERATOR CAD TOOL FOR NUMERIC INTEGRATED CIRCUITS

This paper describes a training and research tool for learning basic issues related to BIST (Built-In SelfTest) generator. The main didactic aim of the tool is presenting complicated concepts in a comprehensive graphical and analytical way. The paper describes a computer-aided design (CAD) that is used to generate automatically the BIST to any digital circuit. This software technique attempts to reduce the amount of extra hardware and cost of the circuit. In order to make our software being easily available, we used the Java platform, which is supported by most operating systems. The multi-platform JAVA runtime environment allows for easy access and usage of the tool.

The Research on Intelligent Clothing Recommendation System Based on Ontology

Ontology which is a description of knowledge has been applied to many fields. Some intelligent systems based on ontology have been developed. In the paper, a clothing recommendation system based on ontology is developed. The recommendation system mainly includes two parts: knowledge base and inference engine. The structural knowledge of clothing is represented by using ontology and some constraint knowledge is described by SWRL. The clothing recommendation process are carried out using JESS, a rule engine for the Java platform, by mapping OWL-based clothing knowledge and SWRL-based design rules into JESS facts and JESS rules, respectively.

A Comprehensive Approach to Ensure Secure Data Communication in Cloud Environment

computing is an Internet based development, in concept, it is a paradigm shift whereby details are abstracted from the users who no longer need knowledge of, expertise in, or control over the technology infrastructure that supports them. According to a 2008 IEEE paper, ―Cloud Computing is a paradigm in which information is permanently stored in servers on the internet and cached temporarily on clients that include desktops, entertainment centers, table computers and notebooks etc.‖ Some examples of emerging Cloud computing infrastructures are Microsoft Azure, Amazon EC2, Google App Engine, and Aneka. Cloud service providers enable users to access and use the necessary resources via the internet. To provide these resources, providers often fall back upon other providers in the cloud, hence this raises security issues in Cloud Environment as Clouds have no borders and the data can be physically located anywhere in the world. So this phenomenon raises serious issues regarding user authentication and data confidentiality. Hence it is proposed to implement a simple Data Protection framework which performs authentication, verification and encrypted data transfer, thus maintaining data confidentiality. Programming is performed using JAVA platform, Cloud environment is created using wired and wireless LAN networks. And Advanced Encryption Standard security algorithm is implemented for ensuring security framework.

Using Visual Analytics to Develop Situation Awareness in Network Intrusion Detection System

Network Intrusion Detection System (NIDS) is a security system that monitors the network traffic and analyzes activities for possible hostile attacks. A novel collaborative visual analytics application for cognitive overloaded site security officer (SSO) in the network intrusion detection environment is presented. The system was developed for site security officers who need to analyze heterogeneous, complex intrusion under time pressure, and then make predictions and time-critical decisions rapidly and correctly under a constant influx of intrusion alert/alarm. This purpose was achieved by designing system architecture of a Treemaps Visualization on NIDs. The Treemaps Network Intrusion Detection System was implemented using the Java platform. The results of an informal usability of the network system were evaluated by the security experts in the context of Endley’s three levels of situation awareness. The proposed visualization tool has some economic advantages by aiding NID’s SSO to dynamically discover intrusive zone which will reduce cost of manual analysis and high risks, efficient space utilization, interactivity, comprehension and esthetics.

Software System for Mechanism and Robot Simulation

This paper present under a general manner, a software elaborated by the authors and their research teams, during a research project. So, we have worked out a toolbox (SIMMECH) of an ample program, done by dr. Rusu a few years ago, entitled Pythagoras. Both Pythagoras and Simmech packages was performed using the Java platform. In this stage of research, Simmech toolbox is able to simulate planar linkages and robots only. The simulation of a mechanism or robot of the specified category begins with its building, using specialized buttons on the graphic interface of the program, then we may visualize the movement of the mechanism for a imposed segment of time and we can also visualize the kinematical diagrams of the elements or joints. We hope in future to extend our research to the spatial mechanisms and robots.

An Open-Source Java Platform for Automated Reaction Mapping

This article presents software applications that have been built upon a modular, open-source, reaction mapping library that can be used in both cheminformatics and bioinformatics research. We first describe the theoretical underpinnings and modular architecture of the core software library. We then describe two applications that have been built upon that core. The first is a generic reaction viewer and mapper, and the second classifies reactions according to rules that can be modified by end users with little or no programming skills.

Assimetria na relação escavação/disco óptico em adolescentes

To determine the frequency of asymmetries greater than 0.2 in the cup-to-disc ratio of a population of adolescents. Fundus photographs of both eyes of 123 adolescents were digitized at the resolution of 300 pixels per inch (300 dpi), 8 bits, with a RBG color pattern. The measurements were performed using the Image J software, version 1.42, developed by the National Institutes of Health (NIH), Java platform version 1.6. The values of the differences in the cup-to-disc ratio between the two eyes of the same individual ranged from 0 to 0.30. The mean difference was 0.07, the median 0.06 and the standard deviation 0.05. About 54.4% of the studied population had asymmetries up to 0.06 and 79.7% had asymmetries up to 0.1. Two individuals presented asymmetries of more than 0.2, corresponding to 1.63% of the evaluated subjects. The frequency of asymmetries in the group of adolescents studied was similar to that detected in studies of the normal adult population.

Attribute Extraction System for Agricultural SEM

As a rapidly booming industry in recent years, the key problem for Search Engine Marketing (SEM) is to extract web page attributes contributed to the ranking in search engine such as Google and Baidu. The quantitative analysis of these agricultural page attributes is aimed in this paper and the attribute extractor in Java platform is built. Meantime, in order to gain a sample set, a batch gaining method named AAA independent of Search Engine API is introduced and a downloader in Java platform is also designed. The experiment of batch gaining and attributes extracting from samples about certain keywords indicate that our method is effective and has a good performance.

Iterative learning control of dynamic memory caching to enhance processing performance on java platform

In this study, computing system performance enhancement by dynamic memory scheduling has been presented. CPU processing time of the computing systems has been enhanced by classifying the arriving computing jobs on an “intelligent manner” and dynamically caching them in a limited memory space. In some special computing areas, like insurance risk investigation, calculations of income and premium need heavy and repetitive actuarial calculations. To improve the computation response time, computing schemes may be improved. In this study, a fairly special computing process has been elaborated, the computing jobs are always created by choosing the inputs among a finite set data such as age, income level, education, which describes the profile of the insurance policy holder or applicant who is inquiring the risk of his/her policy. Caching the repetitive jobs’ results and enhancing the CPU benefit has been presented and an intelligent regulation scheme has been introduced to software control. For experimental validation, Aspect Oriented Programming (AOP) methodology on Java platform is used. AOP allows identify computational jobs and their parameters based on the marked annotations, and the repeating jobs and the same results may be accessible for caching.

A Novel Cost Model of XML Serialization

Using XML as a data representation format is a common choice when integrating software systems on different platforms. The serialization of in-memory object instances of a class into corresponding XML documents heavily influences the performance of the XML-based communication, even if we send the XML over HTTP as in the case of SOAP-based XML Web Services, or with asynchronous messaging such as Java Message Service (JMS), or simply saving it into a file. Several studies have been published analyzing the performance impact of XML serialization on different platforms. No models or measurement methodologies have been proposed however, to establish a relationship between the serialization cost of primitive types (e.g. int, double, string), and the serialization cost of composite types. Such a model can be very useful when the type of the XML messages exchanged during the communication are known a priori, recorded in an interface definition, similarly to the Web Services Description Language (WSDL) in case of XML Web Services. This paper introduces a model that is validated with measurements on .NET and Java platform. The opposite direction, deserialization is covered as well. The main mathematical tool used is linear regression, but cases are also shown and explained where linearity is compromised.

Efficient off-board deployment and customization of virtual machine-based embedded systems

This article presents a new way to deploy and customize embedded virtual machine based operating systems for very restrained devices. Due to the specificity of restrained embedded devices (large usage of read-only memory, very few writable memory available, …), these systems are typically deployed off-board, in a process called romization . However, current romization solutions do not allow a complete deployment to take place outside of the execution device: they are capable of converting system components and applications into their executable form, but are unable to perform any operation that would require the system to be running. This results in a good part of the deployment being performed by the target device, at the cost of longer startup times, bloat with code and data that are only executed once at startup, and suboptimal memory placement of data structures. In this article, we propose a new romization scheme that allows the system to be started within a virtual execution environment, and thus to be fully deployed off-board before being transferred to its real execution support. We then take advantage of all the information provided by the deployed state in order to analyze and customize it, resulting in a very low-footprint, custom-tailored embedded system. The Java platform is used as a support to implement our romization architecture and perform our experiments. For the evaluated set of embedded applications, we were able to obtain embedded systems which memory footprint was lower than their J2ME counterpart, while being based on a full-fledged J2SE environment.

Isolating untrusted software extensions by custom scoping rules

In a modern programming language, scoping rules determine the visibility of names in various regions of a program. In this work, we examine the idea of allowing an application developer to customize the scoping rules of its underlying language. We demonstrate that such an ability can serve as the cornerstone of a security architecture for dynamically extensible systems. A run-time module system, IsoMod, is proposed for the Java platform to facilitate software isolation. A core application may create namespaces dynamically and impose arbitrary name visibility policies (i.e., scoping rules) to control whether a name is visible, to whom it is visible, and in what way it can be accessed. Because IsoMod exercises name visibility control at load time, loaded code runs at full speed. Furthermore, because IsoMod access control policies are maintained separately, they evolve independently from core application code. In addition, the IsoMod policy language provides a declarative means for expressing a very general form of visibility constraints. Not only can the IsoMod policy language simulate a sizable subset of permissions in the Java 2 security architecture, it does so with policies that are robust to changes in software configurations. The IsoMod policy language is also expressive enough to completely encode a capability type system known as Discretionary Capability Confinement. In spite of its expressiveness, the IsoMod policy language admits an efficient implementation strategy. Name visibility control in the style of IsoMod is therefore a lightweight access control mechanism for Java-style language environments.

Real-time Facial Emotion Detection using Support Vector Machines

There have been continuous researches in the field of emotion detection through faces of biological species in the last few decades. This was further fuelled by the rise of artificial intelligence which has added a new paradigm to its ongoing research. This paper discusses the role of one of the artificial intelligence techniques, Support vector machines for efficient emotion detection. This study comprised of experiments conducted on Java platform by using libsvm. The coordinates of vital points of a face have been used for training the SVM network which finally led to proper identification of various emotions appearing on a human face.

Modeling a Classification Scheme of Epileptic Seizures Using Ontology Web Language

Ontology-based disease classification offers a way to rigorously assign disease types and to reuse diagnostic knowledge. However, ontology itself is not sufficient for fully representing the complex knowledge needed in classification schemes which are continuously evolving. This article describes the application of SWRL/OWL-DL to the representation of knowledge intended for proper classification of a complex neurological condition, namely epilepsy. The authors present a rigorous and expandable approach to the ontological classification of epileptic seizures based on the 1981ILAE classification. It provides a classification knowledge base that can be extended with rules that describe constraints in SWRL. Moreover, by transforming an OWL classification scheme into JESS (rule engine in Java platform) facts and by transforming SWRL constraints into JESS, logical inferences and reasoning provide a mechanism to discover new knowledge and facts. The logic representation of epileptic classification amounts to greater community understanding among practitioners, knowledge reuse and interoperability.

Development and validation of a comprehensive new hepatobiliary software. Part II: segmental liver function

This study was undertaken to develop comprehensive new hepatobiliary software to quantify segmental and lobar liver function and to obtain FDA approval. Hepatobiliary software written on JAVA platform and loaded on to a PC accepts 99mTc-HIDA dicom image data transferred from a gamma camera. Liver boundary was determined by threshold-based auto edge detection and liver height at right midclavicular (RMCL) line. Geometric mean area of the physiologic right lobe, physiologic left lobe and total liver area were measured. Segmental liver function was determined using the 5th minute frame as the default (100%). In 24 control participants, mean (+/-SD) liver height at RMCL was 14.7+/-0.12 cm. Geometric mean area of the physiologic right lobe was 116+/-3 cm2, left lobe 96+/-4 cm2, and total liver area 212+/-3 cm. Right upper lobe (segments 7 and 8) contributed 31+/-0.7%, right lower lobe (segments 5 and 6) 34+/-0.6%, left medial (segments 4A and 4B) 24+/-1%, left lateral (segments 2 and 3) 10+/-2%, and caudate lobe (segment 1) 1+/-0.02% of total liver function. In 23 patients, contrast three-dimensional computerized tomographic volume of the right lobe was 1194+/-419 ml, left lobe 434+/-221 ml, and total liver volume 1628+/-490 ml. Right lobe area was 120+/-30 cm2, left lobe (plus caudate) 88+/-29 cm2 with total liver area of 208+/-51 cm. Right upper lobe (segments 7 and 8) contributed 33+/-10%, right lower lobe (segments 5 and 6) 34+/-7%, left medial (segments 4A and 4B) 23+/-6%, left lateral (segments 2 and 3) 9+/-3%, and caudate lobe (segment 1) 1+/-0.4% of total liver function. There was good correlation of RMCL height, and area of right lobe and total liver with computerized tomographic liver volume. Correlation of percentage volume with percentage function was excellent. New FDA approved software provides quantitative assessment of segmental, lobar, and total liver size and function from a planar 99mTc-HIDA cholescintigraphy and may enable universal standardization in nuclear hepatology. Quantification may aid surgeons in the determination of the amount of tissue resection during liver surgery.

Instant Machine Health Assessment Through the Use of Mobile Phones/PDAS

Most of the existing remote machine health monitoring systems, which use computers as their platform, must have wired broadband or WiFi connected to the Internet. If such connection is not available, then the remote monitoring cannot be performed. With the ever increasing popularity of mobile phones/PDAs, users hope to be able to perform remote monitoring via their mobile phones/PDAs so that they can analyze their machines at anytime and anywhere as long as mobile network is available. In this paper, two architectures using mobiles phones/PDAs to perform remote monitoring are presented. The first architecture uses an on-site server to perform the user’s required analysis. All the diagnostic algorithms are installed in the on-site server. A remote user is allowed to select the desired algorithm and control the sampling parameters through the use of JSP (JavaServer Pages). The user can obtain the analyzing results through a browser running in a remotely located computer or via a mobile phone/PDA installed with our J2ME (Java Platform, Micro Edition) based programs. The second architecture allows the user not only obtain the sensory data collected from on-site machines, but also perform fault diagnosis on his mobile phone/PDA. Here, the diagnostic algorithms are installed and executed in the mobile phone/PDA. A demonstration is presented in this paper regarding the development of the popular fast Fourier transform (FFT) on a mobile phone for vibration-based machine fault diagnosis. The FFT has been successfully tested using real machine data. The difficulty in the implementation of FFT on a mobile phone due to its limited computational resources and its solution are mentioned. The advantages and limitations of these two architectures, as well as the future research direction on wireless remote monitoring systems are discussed.

Using Heuristics to Automate Parameter Generation for Benchmarking of Java Methods

Automated generation of method parameters is needed in benchmarking scenarios where manual or random generation of parameters are not suitable, do not scale or are too costly. However, for a method to execute correctly, the generated input parameters must not violate implicit semantical constraints, such as ranges of numeric parameters or the maximum length of a collection. For most methods, such constraints have no formal documentation, and human-readable documentation of them is usually incomplete and ambiguous. Random search of appropriate parameter values is possible but extremely ineffective and does not pay respect to such implicit constraints. Also, the role of polymorphism and of the method invocation targets is often not taken into account. Most existing approaches that claim automation focus on a single method and ignore the structure of the surrounding APIs where those exist. In this paper, we present HeuriGenJ, a novel heuristics-based approach for automatically finding legal and appropriate method input parameters and invocation targets, by approximating the implicit constraints imposed on them. Our approach is designed to support systematic benchmarking of API methods written in the Java language. We evaluate the presented approach by applying it to two frequently-used packages of the Java platform API, and demonstrating its coverage and effectiveness.

Automated contrast painting for position verification in radiotherapy

The influence of information technology in medicine has been constantly rising and represents a central part in many medical disciplines, especially radio-oncology. For the proper delivery of radiation treatment, the correct position of the patient is essential. To verify the correct position of the patient radiological images are made. In order to compare positions, contours of structures (often bones) may be used, these need to be identified and painted. The software that was provided with the linear accelerator contains a bitmap paint program, where these structures are painted manually. This manual painting of structures could be replaced by automated algorithms. However, amendments, innovations or customization of the original software are costly and difficult to achieve due to copyright, license and certification issues. The concept described here aims to get around these issues by creating an automated algorithm on the user level, with no interference of the underlying original software. This system uses the Java platform ; with the help of the Java Robot class user input can be simulated. The developed tool proved to be time-saving, functional and the development could easily be accomplished and individually tailored to users’ needs.

Message Based Random Variable Length Key Encryption Algorithm

Problem statement: A block ciphers provides confidentiality in cryptography but cryptanalysis of the classical block ciphers demonstrated some old weaknesses grabbing a partial key in any stage of encryption procedure leads to reconstructing the whole key. Exhaustive key search shows that key generation should be indeterminist and random for each round. Matching cipher-text attack shows that larger size of block is more secure. In order to overcome analysis mentioned above a new algorithm is designed that is based on random numbers and also can defeat time and memory constraints. Approach: Dynamic and message dependent key generator was created by producing a random number and it was selected as the size of first chunk. Residual value of second chunk divided by first chunk concatenating with first chunk forms the first cipher as an input for SP-boxes. These processes repeated until whole mesaage get involved into the last cipher. Encrypted messages are not equal under different run. Value of random number should be greater than 35 bits and plaintext must be at least 7 bits. A padding algorithm was used for small size messages or big random numbers. Results: Attack on the key generation process was prevented because of random key generation and its dependency to input message. Encryption and decryption times measured between 5 and 27 m sec in 2 GHz Pentium and java platform so time variant and fast enough key generation had been kept collision and timing attacks away due to small seized storage. Long and variable key length made key exhaustive search and differential attack impossible. None fixed size key caused avoidance of replaying and other attacks that can happen on fixed sized key algorithms. Conclusion: Random process employed in this block cipher increased confidentiality of the message and dynamic length substitution in proposed algorithm may lead to maximum cryptographic confusion and consequently makes it difficult for cryptanalysis.