Matlab与Fortran混合编程之DLL实现方法

简要介绍Matlab和Fortran各自的优缺点,详细阐述Matlab调用Fortran生成的动态链接库实现混合编程的两种方法。以高斯约当列主元素法求逆为例,从计算时间、精度等方面详细比较了同一算法在多种实现方式下的执行情况。计算结果表明：基于动态链接库的混合编程方法能充分利用现有软件包,结合Fortran计算效率高、Matlab矩阵计算及图形处理功能强的优点,符合当前科学工程计算程序设计的发展方向。     

Euromicro: past and future

Derek Wilson, vice-chairman of the Euromicro Council, discusses the highlights of recent Euromicro conferences     

Coping with complexity: past, present and future

In 1981, a technical report was published with the somewhat enigmatic title ‘Coping with complexity.’ Its purpose was to discuss how computers could be used to assist process plant operators in coping with complex situations during plant disturbances. Today, coping with complexity is a problem not only for process plant operators but for everyone. And while computers in 1981 were looked upon as the solution, they are now seen as the source of the problem. This paper discusses why and how the meaning of ‘coping with complexity’ has changed over the years and speculate on what may lie ahead.     

An experiment with Fortran and Pascal

This paper reports on a programming experiment involving the languages Fortran and Pascal. The subject of the experiment was the simulation of the X-ray department of a local hospital. The programming was carried out by two different programmers at different periods of time. A static analysis was performed on both models to determine how the languages were used by both programmers. The compilation and execution speeds of both models were then determined when executed on an ICL 1906S computer. The results indicate that the Pascal program is substantially faster in both compilation and execution speed than an equivalent Fortran program.     

The programming language standards scene, ten years on Paper 5: Fortran

This paper, one of a simultaneously published set on ten years of activity in programming language standards describes the developments in standardization of the programming language Fortran which have taken place in the period 1983–1993.     

Emerging language technologies and the rediscovery of the past: a research agenda

During 2001 and 2002, our Delos/NSF working group explored the possibilities that emerging language technologies open up for teaching, learning, and research in the broad area of cultural heritage. On the one hand, emerging language technologies will profoundly redefine the research and teaching of all those working with cultural heritage languages. At the same time, developers of language technology would also benefit from exploring the needs of new audiences and new collections. While multilingual technologies may ultimately prove the most revolutionary, this report focuses on monolingual technologies such as information extraction, summarization, and other aspects of document understanding. In this paper, we describe some of the audiences affected and technologies to be evaluated and argue for the creation of venues where the application of these technologies to cultural heritage materials can be rigorously evaluated. The potential impact of language technologies for our understanding of the past will emerge over a long period of time and will doubtless include many techniques not covered here. We make no claim to a comprehensive survey. Our goal is to provide enough information to suggest the potential importance of these new technologies.     

WWW: past, present, and future

The World Wide Web is simply defined as the universe of global network-accessible information. It is an abstract space within which people can interact, and it is chiefly populated by interlinked pages of text, images, and animations, with occasional sounds, videos, and three-dimensional worlds. The Web marks the end of an era of frustrating and debilitating incompatibility between computer systems. It has created an explosion of accessibility, with many potential social and economical impacts. The Web was designed to be a space within which people could work on a project. This was a powerful concept, in that: people who build a hypertext document of their shared understanding can refer to it at all times; people who join a project team can have access to a history of the team's activities, decisions, and so on; the work of people who leave a team can be captured for future reference; and a team's operations, if placed on the Web, can be machine-analyzed in a way that could not be done otherwise. The Web was originally supposed to be a personal information system and a tool for groups of all sizes, from a team of two to the entire world. People have rapidly developed new features for the Web, because of its tremendous commercial potential. This has made the maintenance of globalWeb interoperability a continuous task. This has also created a number of areas into which research must continue     

Connectionism: past,present, and future

Research efforts to study computation and cognitive modeling on neurally-inspired mechanisms have come to be called Connectionism. Rather than being brand new, it is actually the rebirth of a research programme which thrived from the 40s through the 60s and then was severely retrenched in the 70s. Connectionism is often posed as a paradigmatic competitor to the Symbolic Processing tradition of Artificial Intelligence (Dreyfus & Dreyfus, 1988), and, indeed, the counterpoint in the timing of their intellectual and commercial fortunes may lead one to believe that research in cognition is merely a zero-sum game. This paper surveys the history of the field, often in relation to AI, discusses its current successes and failures, and makes some predictions for where it might lead in the future.     

A Comparison of Co-Array Fortran and OpenMP Fortran for SPMD Programming

Co-Array Fortran, formally called F^––, is a small set of extensions to Fortran 90/95 for Single-Program-Multiple-Data (SPMD) parallel processing. OpenMP Fortran is a set of compiler directives that provide a high level interface to threads in Fortran, with both thread-local and thread-shared memory. OpenMP is primarily designed for loop-level directive-based parallelization, but it can also be used for SPMD programs by spawning multiple threads as soon as the program starts and having each thread then execute the same code independently for the duration of the run. The similarities and differences between these two SPMD programming models are described.Co-Array Fortran can be implemented using either threads or processes, and is therefore applicable to a wider range of machine types than OpenMP Fortran. It has also been designed from the ground up to support the SPMD programming style. To simplify the implementation of Co-Array Fortran, a formal Subset is introduced that allows the mapping of co-arrays onto standard Fortran arrays of higher rank. An OpenMP Fortran compiler can be extended to support Subset Co-Array Fortran with relatively little effort.