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.

Influence of process parameters on fluidised hot-melt granulation and tablet pressing of pharmaceutical powders

This study investigates the influence of process parameters on the fluidised hot melt granulation of lactose and PEG 6000, and the subsequent tablet pressing of the granules. Granulation experiments were performed to assess the effect of granulation time and binder content of the feed on the resulting granule properties such as mass mean granule size, size distribution, granule fracture stress, and granule porosity. These data were correlated using the granule growth regime model. It was found that the dominant granule growth mechanisms in this melt granulation system were nucleation followed by steady growth (PEG 10–20% w/w). However, with binder contents greater than 20% w/w, the granulation mechanism moved to the “over-wet massing” regime in which discrete granule formation could not be obtained. The granules produced in the melt fluidised bed process were subsequently pressed into tablets using an industrial tablet press. The physical properties of the tablets: fracture stress, disintegration time and friability were assessed using industry standards. These analyses indicated that particle size and binder content of the initial granules influenced the mechanical properties of the tablets. It was noted that a decrease in initial granule size resulted in an increase in the fracture stress of the tablets formed.