the proceedings contain 36 papers. the special focus in this conference is on Methods and Applications. the topics include: Language-free mathematical methods for software design;a formal approach to software design;r...
ISBN:
(纸本)3540602712
the proceedings contain 36 papers. the special focus in this conference is on Methods and Applications. the topics include: Language-free mathematical methods for software design;a formal approach to software design;refining database systems;structuring a Z specification to provide a formal framework for autonomous agent systems;on the use of formal specifications in the design and simulation of artificial neural networks;structuring specification in Z to build a unifying framework for hypertext systems;mechanizing formal methods;an algebraic proof in VDM;testing as abstraction;improving software tests using Z specifications;compilation of Z specifications into C for automatic test result evaluation;equal rights for schemas in Z;structuring Z specifications;experiments withthe Z interchange format and SGML;the future of formal methods in industry;specifications and their use in defining subtypes;extending W for object-Z;a formal semantics for a language with type extension;from Z to code;the french population census for 1990;implementing Z in isabelle;the Z-into-haskell tool-kit;types and sets in godel and Z;exploring specifications with mathematica;using Z to rigorously review a specification of a network management system;a two-dimensional view of integrated formal and informal specification techniques;viewpoints and objects;teaching programming as engineering;a course on formal methods in software engineering;hints for writing specifications and a great pedagogical tool for teaching a skill in logic.
An optimization process can be viewed as a closed-loop control system. Traditional "controllers", the numerical optimization algorithms, are usually "crisply" designed for well defined mathematical...
详细信息
the proceedings contain 49 papers. the topics discussed include: efficient resolution of sparse indirection in data-parallel compilers;extending high performance Fortran for the support of unstructured computations;a ...
ISBN:
(纸本)0897917286
the proceedings contain 49 papers. the topics discussed include: efficient resolution of sparse indirection in data-parallel compilers;extending high performance Fortran for the support of unstructured computations;a compiler-directed distributed shared memory system;the DMBC: architecture and fundamental operations;optimum modulo schedules for minimum register requirements;multiprocessor scalability predictions through detailed program execution analysis;upper time bounds for executing pram-programs on the LogP-machine;on the utility of threads for data parallel programming;reducing communication by honoring multiple alignments;compiler cache optimization for banded matrix problems;Petri net modeling of intemonnection networks for massively parallel architectures;decoupling synchronization and data transfer in message passing systems of parallel computers;techniques for reducing overheads of shared-memory multiprocessing;unified compilation techniques for shared and distributed address space machines;run-time methods for parallelizing partially parallel loops;a near-optimal broadcasting algorithm in all-port wormhole-routed hypercubes;and a comparative study of single hop WDM interconnections for multiprocessors.
We have developed a programming template to implement divide and conquer algorithms on MIMD computers. the template is based on the parallel divide and conquer function of Z.G. Mou and P. Hudak (1988). We explore the ...
详细信息
We have developed a programming template to implement divide and conquer algorithms on MIMD computers. the template is based on the parallel divide and conquer function of Z.G. Mou and P. Hudak (1988). We explore the programmability and performance of this approach by solving some well known numerical problems on a shared memory multiprocessor and a multicomputer. A byproduct of this work is a new parallel algorithm for solving tridiagonal systems of equations.< >
the pghpf High Performance Fortran (HPF) [1] compiler from the Portland Group, Inc. (PGI) has been ported to a variety of shared- and distributed-memory platforms. To track compiler improvements and assist in tuning o...
详细信息
the pghpf High Performance Fortran (HPF) [1] compiler from the Portland Group, Inc. (PGI) has been ported to a variety of shared- and distributed-memory platforms. To track compiler improvements and assist in tuning of the pghpf runtime system, 3 types of benchmarks are used. Low level runtime benchmarks measure the efficiency of the runtime system relative to hardware specifications. Kernel benchmarks, usually only a few hundred lines long, measure effectiveness on sequences of code that dominate the execution time of many common applications. Full application benchmarks measure effectiveness on production-class codes from a variety of disciplines. Application benchmarks are typically long-running, include I/O of varying amounts, and are significantly more complicated than the kernel benchmarks. We describe these benchmarks below in further detail. At the conference we will present current results on a variety of platforms. these include the Intel Paragon, Meiko CS-2, SGI Power Challenge, IBM SP-2, and CRAY T3D.
We discuss a translation methodology for transforming a high level algorithmic specification written in ALPHA to an imperative data parallel language. We informally introduce the ALPHA language withthe aid of an exam...
详细信息
We discuss a translation methodology for transforming a high level algorithmic specification written in ALPHA to an imperative data parallel language. We informally introduce the ALPHA language withthe aid of an example and explain how it is adapted for doing static analysis and transformation. An ALPHA program can be naively compiled (P. Quinton et al., 1985) using applicative caching. Our compilation method makes incremental transformations on the abstract syntax tree of can ALPHA program in order to make efficiency and performance improvements over the naive code and optimize it for a given architecture. the compilation steps described include scheduling, alignment, partitioning, allocation, loop nest generation, and code generation and they are illustrated with an example.< >
In recent years, the interest of investors has shifted to computerized asset allocation (portfolio management) to exploit the growing dynamics of the capital markets. In this paper, asset allocation is formalized as a...
In recent years, the interest of investors has shifted to computerized asset allocation (portfolio management) to exploit the growing dynamics of the capital markets. In this paper, asset allocation is formalized as a Markovian Decision Problem which can be optimized by applying dynamic programming or reinforcement learning based algorithms. Using an artificial exchange rate, the asset allocation strategy optimized with reinforcement learning (Q-Learning) is shown to be equivalent to a policy computed by dynamic programming. the approach is then tested on the task to invest liquid capital in the German stock market. Here, neural networks are used as value function approximators. the resulting asset allocation strategy is superior to a heuristic benchmark policy. this is a further example which demonstrates the applicability of neural network based reinforcement learning to a problem setting with a high dimensional state space.
We consider the solution to large stochastic control problems by means of methods that rely on compact representations and a variant of the value iteration algorithm to compute approximate cost-togo functions. While s...
We consider the solution to large stochastic control problems by means of methods that rely on compact representations and a variant of the value iteration algorithm to compute approximate cost-togo functions. While such methods are known to be unstable in general, we identify a new class of problems for which convergence, as well as graceful error bounds, are guaranteed. this class involves linear parameterizations of the cost-to-go function together with an assumption that the dynamic programming operator is a contraction with respect to the Euclidean norm when applied to functions in the parameterized class. We provide a special case where this assumption is satisfied, which relies on the locality of transitions in a state space. Other cases will be discussed in a full length version of this paper.
the proceedings contain 31 papers. the special focus in this conference is on Mathematical Foundations of programming Semantics. the topics include: Final universes of processes;on the symmetry of sequentiality;a stru...
ISBN:
(纸本)9783540580270
the proceedings contain 31 papers. the special focus in this conference is on Mathematical Foundations of programming Semantics. the topics include: Final universes of processes;on the symmetry of sequentiality;a structural co-induction theorem;three metric domains of processes for bisimulation;topological models for higher order control flow;an investigation into functions as processes;timewise refinement for communicating processes;axiomatising real-timed processes;a predicative semantics for the refinement of real-time systems;compositional process semantics of Petri boxes;on the specification of elementary reactive behaviour;a chemical abstract machine for graph reduction extended abstract;lifting theorems for kleisli categories;sequential functions on indexed domains and full abstraction for a sub-language of PCF;mechanizing logical relations;some quasi-varieties of iteration theories;probabilistic power domains, information systems, and locales;linear domains and linear maps;universal quasi-prime algebraic domains;holomorphic models of exponential types in linear logic;a syntax for linear logic;a complete axiomatisation for trace congruence of finite state behaviours;the asymmetric topology of computer science;a categorical interpretation of landin's correspondence principle;on the transformation between direct and continuation semantics.
Using the structure of a modern programming environment to organize the complex world of materials degradation and lifetime prediction offers two obvious advantages to a knowledge engineer: the first being the advance...
详细信息
Using the structure of a modern programming environment to organize the complex world of materials degradation and lifetime prediction offers two obvious advantages to a knowledge engineer: the first being the advanced level of development most programming environments can provide as various resources and programming facilities. the second advantage of using a functional environment at the conceptual level of a knowledge base system (KBS) project is the fast prototyping permitted by being close to the tools themselves. But the particular advantage of using an object-oriented programming (OOP) environment to effectuate the knowledge transformation is the compatibility of OOP with natural cognitive operations. Knowledge representation goes much beyond conventional data representation and must rely on facts that often possess a halo of fuzziness. the organization of stress corrosion cracking (SCC) failure information in an OOP architecture can be a revealing exercise. this paper will demonstrate that by combining procedures and data into objects using OOP techniques the level of abstraction of programming corrosion expertise can be greatly improved.
暂无评论