Uma introdução a tecnologia de reflexão Java.

Este documento tem por objetivo apresentar a tecnologia de reflexão existente na linguagem JAVA. Esta exposição será realizada a partir de uma implementação real de uma classe Java que fornece a funcionalidade de mapeamento entre objetos de um programa computacional e de um banco de dados relacional. Este mapeamento é também conhecido como camada de persistência.

Identificando Pockets na superfície protéica usando o Java Protein Dossier - JPD.

2005

Comparativo do Plone com gerenciadores de conteúdo em PHP, Java e Python.

Definição e estrutura de CMS. Plataformas de desenvolvimento: PHP. Java. Python; Gerenciador de Conteúdo-Plone. Comparativo de Plone com outros gerenciadores.

Implementação Java do filtro de Marr e Hildreth para detecção de bordas.

O objetivo desta publicação é apresentar a implementação Java do algoritmo de Marr e Hildreth (Marr & Hildreth, 1980) para a detecção de bordas. O objetivo maior das implementações é a construção de uma biblioteca de processamento de imagens em Java, como software livre, sob a licença GPL (General Public License) conforme publicada pela Free Software Foundation.

Filtro de Canny para detecção de bordas: implementação Java.

O objetivo deste comunicado é apresentar a implementação JavaTM do filtro para detecção de bordas de Canny (Canny, 1986). A implementação é uma necessidade de uso em projetos desenvolvidos na Embrapa Informática Agropecuária na área de processamento de imagens aplicado à agropecuária.

"AgileSim_updated.java" Program.

This document contains the 'hard' code for the Java program "AgileSim_updated.java", complete with comments. This program accompanies the article "Process Control in Agile Supply Chain Network" and was the program used to simulate the data for the illustrative example in the article.

Blocking Java Applets at the Firewall

This paper explores the problem of protecting a site on the Internet against hostile external Java applets while allowing trusted internal applets to run. With careful implementation, a site can be made resistant to current Java security weaknesses as well as those yet to be discovered. In addition, we describe a new attack on certain sophisticated firewalls that is most effectively realized as a Java applet.

Lightweight Modeling of Java Virtual Machine Security Constraints using Alloy

The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly in the component known as the Bytecode Verifier. This paper describes a method for representing Java security constraints using the Alloy modeling language. It further describes a system for performing a security analysis on any block of Java bytecodes by converting the bytes into relation initializers in Alloy. Any counterexamples found by the Alloy analyzer correspond directly to insecure code. Analysis of a real-world malicious applet is given to demonstrate the efficacy of the approach.

Modeling the Java Bytecode Verifier

The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly in the Bytecode Verifier, a critical component used to verify class semantics before loading is complete. This paper describes a method for representing Java security constraints using the Alloy modeling language. It further describes a system for performing a security analysis on any block of Java bytecodes by converting the bytes into relation initializers in Alloy. Any counterexamples found by the Alloy analyzer correspond directly to insecure code. Analysis of the approach in the context of known security exploits is provided. This type of analysis represents a significant departure from standard malware analysis methods based on signatures or anomaly detection.

Towards Formalizing Java's Weak References

Weak references provide the programmer with limited control over the process of memory management. By using them, a programmer can make decisions based on previous actions that are taken by the garbage collector. Although this is often helpful, the outcome of a program using weak references is less predictable due to the nondeterminism they introduce in program evaluation. It is therefore desirable to have a framework of formal tools to reason about weak references and programs that use them. We present several calculi that formalize various aspects of weak references, inspired by their implementation in Java. We provide a calculus to model multiple levels of non-strong references, where a different garbage collection policy is applied to each level. We consider different collection policies such as eager collection and lazy collection. Similar to the way they are implemented in Java, we give the semantics of eager collection to weak references and the semantics of lazy collection to soft references. Moreover, we condition garbage collection on the availability of time and space resources. While time constraints are used in order to restrict garbage collection, space constraints are used in order to trigger it. Finalizers are a problematic feature in Java, especially when they interact with weak references. We provide a calculus to model finalizer evaluation. Since finalizers have little meaning in a language without side-effect, we introduce a limited form of side effect into the calculus. We discuss determinism and the separate notion of uniqueness of (evaluation) outcome. We show that in our calculus, finalizer evaluation does not affect uniqueness of outcome.

Development of a Java-based Unified and Flexible Natural Language Discourse System

This paper outlines the design and development of a Java-based, unified and flexible natural language dialogue system that enables users to interact using natural language, e.g. speech. A number of software development issues are considered with the aim of designing an architecture that enables different discourse components to be readily and flexibly combined in a manner that permits information to be easily shared. Use of XML schemas assists this component interaction. The paper describes how a range of Java language features were employed to support the development of the architecture, providing an illustration of how a modern programming language makes tractable the development of a complex dialogue system.

sscMap: An extensible Java application for connecting small-molecule drugs using gene-expression signatures

Background
Connectivity mapping is a process to recognize novel pharmacological and toxicological properties in small molecules by comparing their gene expression signatures with others in a database. A simple and robust method for connectivity mapping with increased specificity and sensitivity was recently developed, and its utility demonstrated using experimentally derived gene signatures.

Results
This paper introduces sscMap (statistically significant connections' map), a Java application designed to undertake connectivity mapping tasks using the recently published method. The software is bundled with a default collection of reference gene-expression profiles based on the publicly available dataset from the Broad Institute Connectivity Map 02, which includes data from over 7000 Affymetrix microarrays, for over 1000 small-molecule compounds, and 6100 treatment instances in 5 human cell lines. In addition, the application allows users to add their custom collections of reference profiles and is applicable to a wide range of other 'omics technologies.

Conclusion
The utility of sscMap is two fold. First, it serves to make statistically significant connections between a user-supplied gene signature and the 6100 core reference profiles based on the Broad Institute expanded dataset. Second, it allows users to apply the same improved method to custom-built reference profiles which can be added to the database for future referencing. The software can be freely downloaded from http://purl.oclc.org/NET/sscMap