994 resultados para Java RMI


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Stable isotopic analyses of bulk carbonates recovered from Ontong Java Plateau during Ocean Drilling Program (ODP) Leg 192 (Holes 1183A and 1186A) show an ~0.5 per mil increase in d18O values from the upper Campanian/lower Maastrichtian to the upper Maastrichtian. This shift is consistent with widespread evidence for cooling at this time. Similar shifts were found at other localities on Ontong Java Plateau (Deep Sea Drilling Project [DSDP] Sites 288 and 289 and ODP Site 807) and at DSDP Site 317 on Manihiki Plateau. These data extend evidence for Maastrichtian cooling into the southwestern tropical and subtropical Pacific. The record of apparent cooling survives despite a significant diagenetic overprint at all sites. Comparing average Maastrichtian d18O values among sites suggests that diagenesis caused d18O to first be shifted toward higher values and then back toward lower values as burial depth increased. Carbon isotopes at the six sites show no apparent primary shifts, but at four sites, the Cretaceous/Tertiary boundary interval coincides with a negative excursion attributed to alteration of sediments near the boundary.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper focuses on the impact of Indonesia's economic crisis on small and medium-sized enterprises (SMEs). It shows how the performance of SMEs during the crisis varied widely even in the same industrial subsector, and found that the factors most affecting performance have been market orientation and the linkages that the SMEs have formed with the buyers of their products. Well-performing SMEs were found to have utilized putting-out linkages with wholesalers which enabled them to switch to products having better markets. On the other hand, the SMEs which had subcontracting linkages with assemblers or contracting linkages with user-factories (with the exception of SMEs having export-oriented linkages) suffered badly in the crisis because of specificity of products with little room for switching. The paper also found that exposure to debt due to borrowing for investment has been another factor affecting performance, but that enterprise size has had no linear correlation with performance.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Este artículo presenta una solución al problema de autenticación segura, portable y expandible realizando una combinación de la tecnología Java y el almacenamiento del certificado digital X.509 en las tarjetas Java para acceder a los servicios ofrecidos por una institución, en este caso concreto la Universidad Tecnológica de Panamá, garantizando la autenticidad, confidencialidad, integridad y no repudio.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Este paper presenta la tecnología Java Card y los certificados X.509 como método de autenticación en aplicaciones web en ambientes universitarios, en el caso concreto la Universidad Tecnológica de Panamá (UTP). La solución consiste en mejorar el escenario de acceso a los servicios de la UTP tratando de extender el uso de la Infraestructura de Clave Pública, llevando a cabo la integración de estas tecnologías que aporten mayor seguridad a todos los usuarios y que gocen de un acceso a los servicios ofrecidos de manera flexible, segura, garantizando la autenticidad, confidencialidad, integridad y no repudio.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Automatic cost analysis of programs has been traditionally concentrated on a reduced number of resources such as execution steps, time, or memory. However, the increasing relevance of analysis applications such as static debugging and/or certiflcation of user-level properties (including for mobile code) makes it interesting to develop analyses for resource notions that are actually application-dependent. This may include, for example, bytes sent or received by an application, number of files left open, number of SMSs sent or received, number of accesses to a datábase, money spent, energy consumption, etc. We present a fully automated analysis for inferring upper bounds on the usage that a Java bytecode program makes of a set of application programmer-deflnable resources. In our context, a resource is defined by programmer-provided annotations which state the basic consumption that certain program elements make of that resource. From these deflnitions our analysis derives functions which return an upper bound on the usage that the whole program (and individual blocks) make of that resource for any given set of input data sizes. The analysis proposed is independent of the particular resource. We also present some experimental results from a prototype implementation of the approach covering a signiflcant set of interesting resources.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Abstract is not available.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Abstract interpretation has been widely used for the analysis of object-oriented languages and, in particular, Java source and bytecode. However, while most existing work deals with the problem of flnding expressive abstract domains that track accurately the characteristics of a particular concrete property, the underlying flxpoint algorithms have received comparatively less attention. In fact, many existing (abstract interpretation based—) flxpoint algorithms rely on relatively inefHcient techniques for solving inter-procedural caligraphs or are speciflc and tied to particular analyses. We also argüe that the design of an efficient fixpoint algorithm is pivotal to supporting the analysis of large programs. In this paper we introduce a novel algorithm for analysis of Java bytecode which includes a number of optimizations in order to reduce the number of iterations. The algorithm is parametric -in the sense that it is independent of the abstract domain used and it can be applied to different domains as "plug-ins"-, multivariant, and flow-sensitive. Also, is based on a program transformation, prior to the analysis, that results in a highly uniform representation of all the features in the language and therefore simplifies analysis. Detailed descriptions of decompilation solutions are given and discussed with an example. We also provide some performance data from a preliminary implementation of the analysis.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Automatic cost analysis of programs has been traditionally studied in terms of a number of concrete, predefined resources such as execution steps, time, or memory. However, the increasing relevance of analysis applications such as static debugging and/or certification of user-level properties (including for mobile code) makes it interesting to develop analyses for resource notions that are actually applicationdependent. This may include, for example, bytes sent or received by an application, number of files left open, number of SMSs sent or received, number of accesses to a database, money spent, energy consumption, etc. We present a fully automated analysis for inferring upper bounds on the usage that a Java bytecode program makes of a set of application programmer-definable resources. In our context, a resource is defined by programmer-provided annotations which state the basic consumption that certain program elements make of that resource. From these definitions our analysis derives functions which return an upper bound on the usage that the whole program (and individual blocks) make of that resource for any given set of input data sizes. The analysis proposed is independent of the particular resource. We also present some experimental results from a prototype implementation of the approach covering an ample set of interesting resources.