The aim of the paper is to introduce a versatile and user-friendly computer assisted learning (CAL) system in order to support traditional teaching in the Speech Science domain. This system is based on java as a power...
详细信息
This paper reports on preliminary work on a connection between Haskell and java, with the goal of making software components written in java available to Haskell programmers. We discuss several approaches, but find th...
详细信息
The proper use of integral attachment features in mechanical assemblies has been more of an art than an engineering science. An organized set of design steps for generating conceptual integral attachment designs has r...
详细信息
Notio [1] is a java API for constructing conceptual graph tools and systems. Rather than attempting to provide a comprehensive toolset, Notio attempts to address the widely varying needs of the CG community by providi...
详细信息
This paper introduces JMS (java-based Meeting Space), an object-oriented framework for developing synchronous collaborative applications over the Internet. The JMS framework provides a comprehensive collection of serv...
详细信息
The java Virtual Machine (or JVM) is central to the system's aim of providing a secure program execution environment that operates identically on a wide variety of computing platforms. To be most effective in this...
详细信息
The java Virtual Machine (or JVM) is central to the system's aim of providing a secure program execution environment that operates identically on a wide variety of computing platforms. To be most effective in this role, the JVM needs a rigorous, complete description, to specify precisely the behavior required of implementations. In response, a number of researchers have produced formal accounts of the JVM that seek to define it in an unambiguous and comprehensible manner. Unfortunately, the size and complexity of the JVM means that many of these formal accounts must either restrict their scope substantially, or risk becoming unwieldy and intractable. This paper suggests an alternative approach to the specification of the JVM that seeks to ameliorate such problems by composing together a small set of `microinstructions' to produce the full bytecode set. These microinstructions are encapsulated as functions in the polymorphic functional programminglanguage Haskell, using the familiar mechanisms of Hindley-Milner type inference to characterize the JVM's rather thorny verifier. In this way, its is hoped that a foundation will be laid for formal descriptions of the java Virtual Machine that need not trade tractability for completeness.
A promising technique for protecting privacy and integrity of sensitive data is to statically check information flow within programs that manipulate the data. While previous work has proposed programminglanguage exte...
详细信息
A promising technique for protecting privacy and integrity of sensitive data is to statically check information flow within programs that manipulate the data. While previous work has proposed programminglanguage extensions to allow this static checking, the resulting languages are too restrictive for practical use and have not been implemented. In this paper, we describe the new language JFlow, an extension to the javalanguage that adds statically-checked information flow annotations. JFlow provides several new features that make information flow checking more flexible and convenient than in previous models: a decentralized label model, label polymorphism, run-time label checking, and automatic label inference. JFlow also supports many language features that have never been integrated successfully with static information flow control, including objects, subclassing, dynamic type tests, access control, and exceptions. This paper defines the JFlow language and presents formal rules that are used to check JFlow programs for correctness. Because most checking is static, there is little code space, data space, or run-time overhead in the JFlow implementation.
Protein spot identification in two-dimensional electrophoresis gels can be supported by the comparison of gel images accessible in different World Wide Web two-dimensional electrophoresis (2 DE) gel protein databases....
详细信息
Protein spot identification in two-dimensional electrophoresis gels can be supported by the comparison of gel images accessible in different World Wide Web two-dimensional electrophoresis (2 DE) gel protein databases. The comparison may be performed either by visual cross-matching between gel images or by automatic recognition of similar protein spot patterns. A prerequisite for the automatic point pattern matching approach is the detection of protein spots yielding the x(s),y(s) coordinates and integrated spot intensities i(s). For this purpose an algorithm is developed based on a combination of hierarchical watershed transformation and feature extraction methods. This approach reduces the strong over-segmentation of spot regions normally produced by watershed transformation. Measures for the ellipticity and curvature are determined as features of spot regions. The resulting spot lists containing x(s),y(s),i(s)-triplets are calculated for a source as well as for a target gel image accessible in 2-DE gel protein databases. After spot detection a matching procedure is applied. Both the matching of a local pattern vs. a full 2-DE gel image and the global matching between full images are discussed. Preset slope and length tolerances of pattern edges serve as matching criteria. The local matching algorithm relies on a data structure derived from the incremental Delaunay triangulation of a point set and a two- step hashing technique. For the incremental construction of triangles the spot intensities are considered in decreasing order. The algorithm needs neither landmarks nor an a priori image alignment. A graphical user interface for spot detection and gel matching is written in the java programming language for the Internet. The software package called CAROL (http://gelmatching ***) is realized in a client-server architecture.
A proof of the soundness of the java type system is a first, necessary step towards demonstrating which java programs won't compromise computer security. We consider a subset of java describing primitive types, cl...
详细信息
A proof of the soundness of the java type system is a first, necessary step towards demonstrating which java programs won't compromise computer security. We consider a subset of java describing primitive types, classes, inheritance, instance variables and methods, interfaces, shadowing, dynamic method binding, object creation, null, arrays, and exception throwing and handling. We argue that for this subset the type system is sound, by proving that program execution preserves the types, up to subclasses/subinterfaces. (C) 1999 John Wiley & Sons, Inc.
java proxy technology answers the issues of explicit support of unique database features and centralized schema definition. This technology defines database object schema using the database object definition language....
详细信息
java proxy technology answers the issues of explicit support of unique database features and centralized schema definition. This technology defines database object schema using the database object definition language. Using the java proxy approach to these object databases is straightforward and understandable. Both the object data management's group (ODMG) language binding and the java proxy technology offer a higher level, more natural way of dealing with database objects. For java applications that do not have to fit into an existing infrastructure of applications written in other languages and are designed to treat the database as a passive object repository with all the logic in the client java virtual machine, the ODMG java bindings are used.
暂无评论