Results 1  10
of
26
PELLPACK: a problemsolving environment for PDEbased applications on multicomputer platforms
 ACM Transactions on Mathematical Software
, 1998
"... This paper presents the software architecture and implementation of the problem solving ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
This paper presents the software architecture and implementation of the problem solving
On the Future of Problem Solving Environments

, 2000
"... In this paper we review the current state of the problem solving environment (PSE) field and make projections for the future. First we describe the computing context, the definition of a PSE and the goals of a PSE. The stateoftheart is summarized along with sources (books, bibliographics, web sit ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
In this paper we review the current state of the problem solving environment (PSE) field and make projections for the future. First we describe the computing context, the definition of a PSE and the goals of a PSE. The stateoftheart is summarized along with sources (books, bibliographics, web sites) of more detailed information. The principal components and paradigms for building PSEs are presented. The discussion of the future is given in three parts: future trends, scenarios for 2010/2025, and research
Mathematical service matching using Description Logic and OWL
 in Proceedings 3rd Int’l Conference on Mathematical Knowledge Management (MKM’04). Volume 3119 of Lecture Notes in Computer Science., SpringerVerlag
, 2004
"... ..."
Software distribution using XNETLIB
 ACM Transactions on Mathematical Software
, 1995
"... Xnetlib is a new tool for software distribution. Whereas its predecessor nethb uses email as the user interface to its large collection of publicdomain mathematical software, xnetlib uses an X Window interface and socketbased communication. Xnetlib makes it easy to search through a large distribut ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
Xnetlib is a new tool for software distribution. Whereas its predecessor nethb uses email as the user interface to its large collection of publicdomain mathematical software, xnetlib uses an X Window interface and socketbased communication. Xnetlib makes it easy to search through a large distributed collection of software and to retrieve requested software in seconds.
Reuse Library Interoperability and the World Wide Web
 INT. CONFERENCE ON SOFTWARE ENGINEERING
, 1997
"... ..."
An inexact model matching approach and its applications
 THE JOURNAL OF SYSTEMS AND SOFTWARE
, 2003
"... Matching between two model specifications is the key step of the repositorybased moo reuse.Fro theapproQ(6:I specificatio poti o view, this paper presents a quantified inexact matchingtheoi fo flexible moib retrieval fro largescalemorg repoescale6 ThetheoO specifies amoON repoB6:IQ astwo levels: ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Matching between two model specifications is the key step of the repositorybased moo reuse.Fro theapproQ(6:I specificatio poti o view, this paper presents a quantified inexact matchingtheoi fo flexible moib retrieval fro largescalemorg repoescale6 ThetheoO specifies amoON repoB6:IQ astwo levels: amoQI level basedo a multivaluedmolt specializatio relatioizat and a fundamentalfunctio level basedo afunctio specializatio relatiozatio The matching degree betweentwo mooe dependso their matchingfunctioQO The matching degree betweentwo functioU o afunctio specializatio graph dependso the functio:UOOOI6o between them. A seto mo6L specializatio rules enables a new matchingto be derivedfro the existing matchings. Embedded in an SQLlike colike thetheoO has been appliedto a largescale mathematicalsothema moth repoemati system. Users can use theco6Q9L to retrieve the requiredm ouir with an inexact querycoy6ILNQL Applicatio: show that the approach is useful and tractable.
Optimal model predictive control of Timed Continuous Petri nets
, 2007
"... This paper addresses the optimal control problem of timed continuous Petri nets under infinite servers semantics. In particular, our goal is to find a control input optimizing a certain cost function that permits the evolution from an initial marking (state) to a desired steadystate. The solution w ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
This paper addresses the optimal control problem of timed continuous Petri nets under infinite servers semantics. In particular, our goal is to find a control input optimizing a certain cost function that permits the evolution from an initial marking (state) to a desired steadystate. The solution we propose is based on a particular discretetime representation of the controlled continuous Petri net system, as a certain linear constrained system. An upper bound on the sample period is given in order to preserve important information of the timed continuous net, in particular the positiveness of the markings. The reachability space of the sampled system in relation to autonomous continuous Petri nets is also studied. Based on the resulting linear constrained model, the optimal control problem is studied through Model Predictive Control (MPC). Implicit and explicit procedures are presented together with a comparison between the two schemes. Stability of the closedloop system is also studied.
Providing Access to High Performance Computing Technologies
, 1996
"... . This paper describes two projects underway to provide users with access to high performance computing technologies. One effort, the National HPCC Software Exchange, is providing a single point of entry to a distributed collection of domainspecific repositories. These repositories collect, catalog ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
. This paper describes two projects underway to provide users with access to high performance computing technologies. One effort, the National HPCC Software Exchange, is providing a single point of entry to a distributed collection of domainspecific repositories. These repositories collect, catalog, evaluate, and provide access to software in their specialized domains. The NHSE infrastructure allows these repositories to interoperate with each other and with the toplevel NHSE interface. Another effort is the NetSolve project which is a clientserver application designed to solve computational science problems over a network. Users may access NetSolve computational servers through C, Fortran, MATLAB, or World Wide Web interfaces. An interesting intersection between the two projects would be the use of the NetSolve system by a domainspecific repository to provide access to software without the need for users to download and install the software on their own systems. 1 The National HPC...
Fast FloatingPoint Processing in Common Lisp
 ACM Trans. on Math. Software
, 1995
"... this paper we explore an approach which enables all of the problems listed above to be solved at a single stroke: use Lisp as the source language for the numeric and graphical code! This is not a new idea  it was tried at MIT and UCB in the 1970's. While these experiments were modestly successful ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
this paper we explore an approach which enables all of the problems listed above to be solved at a single stroke: use Lisp as the source language for the numeric and graphical code! This is not a new idea  it was tried at MIT and UCB in the 1970's. While these experiments were modestly successful, the particular systems are obsolete. Fortunately, some of those ideas used in Maclisp [37], NIL [38] and Franz Lisp [20] were incorporated in the subsequent standardization of Common Lisp (CL) [35]. In this new setting it is appropriate to reexamine the theoretical and practical implications of writing numeric code in Lisp. The popular conceptions of Lisp's inefficiency for numerics have been based on rumor, supposition, and experience with early and (in fact) inefficient implementations. It is certainly possible to continue to write inefficient programs: As one example of the results of deemphasizing numerics in the design, consider the situation of the basic arithmetic operators. The definitions of these functions require that they are generic, (e.g. "+" must be able to add any combination of several precisions of floats, arbitraryprecision integers, rational numbers, and complexes), The very simple way of implementing this arithmetic  by subroutine calls  is also very inefficient. Even with appropriate declarations to enable more specific treatment of numeric types, compilers are free to ignore declarations and such implementations naturally do not accommodate the needs of intensive numbercrunching. (See the appendix for further discussion of declarations). Be this as it may, the situation with respect to Lisp has changed for the better in recent years. With the advent of ANSI standard Common Lisp, several active vendors of implementations and one active universi...
A Web Registry for Publishing and Discovering Mathematical Services
 In Proceedings of IEEE Conference on eTechnology, eCommerce, and eService, Hong Kong, March 29 – April 1, 2005. IEEE Computer Society
, 2005
"... This paper describes an extension of the ebXML registry for publishing and discovering mathematical service descriptions. The MathBroker registry is able to handle descriptions given in the Mathematical Service Description Language, a language designed adhoc for capturing the semantics of web servi ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper describes an extension of the ebXML registry for publishing and discovering mathematical service descriptions. The MathBroker registry is able to handle descriptions given in the Mathematical Service Description Language, a language designed adhoc for capturing the semantics of web services dealing with mathematical problems. The registry is distributed with a Java API implementing a MathBroker specific JAXR provider. 1.