Research in the parallel and scientific computing area has begun to focus on the development of Java-based programming environments. this paper describes the design of an original object-oriented database-style reposi...
详细信息
ISBN:
(纸本)3540658211
Research in the parallel and scientific computing area has begun to focus on the development of Java-based programming environments. this paper describes the design of an original object-oriented database-style repository interface for high performance storage and retrieval of scientific data. the design is based on the standard interface to object databases that has been defined by tho Object Database Management Group. In the paper, we present the mapping of the repository interface into Java constructs.
the proceedings contain 187 papers. the topics discussed include: specularities on surfaces with tangential hairs or grooves;motion based decompositing of video;stereo reconstruction from multiperspective panoramas;ne...
the proceedings contain 187 papers. the topics discussed include: specularities on surfaces with tangential hairs or grooves;motion based decompositing of video;stereo reconstruction from multiperspective panoramas;new calibration-free approach for augmented reality based on parameterized cuboid structure;appearance compression and synthesis based on 3D model for mixed reality;using model-driven bundle-adjustment to model heads from raw video sequences;view synthesis and 3D reconstruction of piecewise planar scenes using intersection lines between the planes;robust sequence proximity estimation by radial distance hashing;accurate motion flow estimation with discontinuities;real-time motion analysis with linear-programming;multi-view subspace constraints on homographies;new algorithms for two-frame structure from motion;removal of translation bias when using subspace methods;densities and maximum likelihood estimation of matching constraints;and recovery and tracking of continuous 3D surfaces from stereo data using a deformable dual-mesh.
the proceedings contain 187 papers. the topics discussed include: specularities on surfaces with tangential hairs or grooves;motion based decompositing of video;stereo reconstruction from multiperspective panoramas;ne...
the proceedings contain 187 papers. the topics discussed include: specularities on surfaces with tangential hairs or grooves;motion based decompositing of video;stereo reconstruction from multiperspective panoramas;new calibration-free approach for augmented reality based on parameterized cuboid structure;appearance compression and synthesis based on 3D model for mixed reality;using model-driven bundle-adjustment to model heads from raw video sequences;view synthesis and 3D reconstruction of piecewise planar scenes using intersection lines between the planes;robust sequence proximity estimation by radial distance hashing;accurate motion flow estimation with discontinuities;real-time motion analysis with linear-programming;multi-view subspace constraints on homographies;new algorithms for two-frame structure from motion;removal of translation bias when using subspace methods;densities and maximum likelihood estimation of matching constraints;and recovery and tracking of continuous 3D surfaces from stereo data using a deformable dual-mesh.
In this paper we propose an abstract version of the denotational semantics defined in [8]. this leads to a precise goal-independent abstract interpretation of Prolog programs. We deal withthe control rules of Prolog ...
详细信息
ISBN:
(纸本)3540654623
In this paper we propose an abstract version of the denotational semantics defined in [8]. this leads to a precise goal-independent abstract interpretation of Prolog programs. We deal withthe control rules of Prolog and the cut operator. Moreover, we get a simple denotation for negation as finite failure. the abstract analysis is proposed both for computed answers analysis and for call patterns analysis. In both cases the abstract semantics is finitely computable.
the programmable logic controllers (PLC) programming is designed to the possibilities of a medium user of this equipment. In ALS 4.0 programming language a hierarchy of classes is set in three big trees which include ...
详细信息
the programmable logic controllers (PLC) programming is designed to the possibilities of a medium user of this equipment. In ALS 4.0 programming language a hierarchy of classes is set in three big trees which include the areas of application of this equipment. Its data and functions are encapsulated withthree degrees of visibility. the dynamic pass of types in execution time is allowed. Persistence is guaranteed outside the creation place and separated from ancestors using the macronets library. the whole normalized syntax of the structured languages of the IEC-61131-3 is almost kept.
Recent advances in hardware and networking have fueled the interest in distributed computing in general and in metacomputing frameworks in particular, Harness is an experimental metacomputing system based upon the pri...
详细信息
ISBN:
(纸本)3540658211
Recent advances in hardware and networking have fueled the interest in distributed computing in general and in metacomputing frameworks in particular, Harness is an experimental metacomputing system based upon the principle of dynamic reconfigurability both in terms of the computers and networks that comprise the virtual machine, and in the services offered by the virtual machine itself. In this paper we describe how the capability to reconfigure the virtual machine plugging services on demand can be exploited to design dynamically reconfigurable applications based on behavioral objects and cooperating layered services.
the Chvatal rank of an inequality ax less than or equal to b with integral components and valid for the integral hull of a polyhedron P, is the minimum number of rounds of Gomory-Chvatal cutting planes needed to obtai...
详细信息
ISBN:
(数字)9783540487777
ISBN:
(纸本)3540660194
the Chvatal rank of an inequality ax less than or equal to b with integral components and valid for the integral hull of a polyhedron P, is the minimum number of rounds of Gomory-Chvatal cutting planes needed to obtain the given inequality. the Chvatal rank is st most one if b is the integral part of the optimum value z(a) of the linear program max{ax : x is an element of P}. We show that, contrary to what was stated or implied by other authors, the converse to the latter statement, namely, the Chvatal rank is at least two if b is less than the integral part of z(a), is not true in general. We establish simple conditions for which this implication is valid, and apply these conditions to several classes of facet-inducing inequalities for travelling salesman polytopes.
Parallel programming can be made easier by means of a skeleton based methodology, such as P-3 L, which helps programmers to compose their applications by using a set of fixed parallel patterns. Such kind of approach i...
详细信息
ISBN:
(纸本)3540658211
Parallel programming can be made easier by means of a skeleton based methodology, such as P-3 L, which helps programmers to compose their applications by using a set of fixed parallel patterns. Such kind of approach is also useful to obtain portability because the "structured" nature of the language can be used to devise a composable support for each parallel pattern so that the complexity of finding an "optimal" implementation on different parallel architectures can be reduced. In this work, we show how we can conjugate the BSP abstract model and its related cost analysis to provide an implementation strategy "abstract enough" for being also machine independent. We hope this can be a first step towards the idea of a portable set of optimization rules. the first results show how an implementation template for the Map constructor, able of to be tuned automatically, can be designed. A validation of the technique is given for a Gray T3E and a cluster of PC-Linux.
Two problems in the design and deployment of multimedia applications are the lack of design-time and run-time flexibility. In this paper we discuss a general methodology for tackling these issues. the work presented h...
详细信息
ISBN:
(纸本)0201485621
Two problems in the design and deployment of multimedia applications are the lack of design-time and run-time flexibility. In this paper we discuss a general methodology for tackling these issues. the work presented here is an extension of the AlphaOmega framework of [4]. In that framework we showed how the intuitive notion of an object representing its properties and capabilities to other objects differentially could be exploited to provide a powerful but easy way to change the behavior and interfaces of an application, dynamically if desired. In this paper, we develop a formal approach to the basic principles of the AlphaOmega framework. this leads to the definition of a formal system called the alpha omega-calculus. the alpha omega-calculus identifies a set of programming language abstractions that can be consistently added to any object-oriented language. While the calculus captures the intuitive notions underlying the AlphaOmega framework, it also goes beyond the original framework in power and flexibility We demonstrate the generality of our approach by working with an example that shows how it provides unifying abstractions for such seemingly diverse domains as interactive distance learning and various issues in the area of multimedia documents.
We study the problem of optimizing over the set of all combinatorial embeddings of a given planar graph. Our objective function prefers certain cycles of G as face cycles in the embedding. the motivation for studying ...
详细信息
ISBN:
(纸本)3540660194
We study the problem of optimizing over the set of all combinatorial embeddings of a given planar graph. Our objective function prefers certain cycles of G as face cycles in the embedding. the motivation for studying this problem arises in graph drawing, where the chosen embedding has an important influence on the aesthetics of the drawing. We characterize the set of all possible embeddings of a given biconnected planar graph G by means of a system of linear inequalities with {0, 1}-variables corresponding to the set of those cycles in G which can appear in a combinatorial embedding. this system of linear inequalities can be constructed recursively using SPQR-trees and a new splitting operation. Our computational results on two benchmark sets of graphs are surprising: the number of variables and constraints seems to grow only linearly withthe size of the graphs although the number of embeddings grows exponentially. For all tested graphs (up to 500 vertices) and linear objective functions, the resulting integer linear programs could be generated within 10 minutes and solved within two seconds on a Sun Enterprise 10000 using CPLEX.
暂无评论