A5036565179- Mathematics, Computing, and Information Processing
- Digital Humanities and Scholarship
- Advanced Database Systems and Queries
- Distributed and Parallel Computing Systems
- Logic, programming, and type systems
- Library Science and Information Systems
- Numerical Methods and Algorithms
- Advanced Algebra and Geometry
- Mobile Agent-Based Network Management
- Homotopy and Cohomology in Algebraic Topology
- advanced mathematical theories
- Advanced Topics in Algebra
- Algebraic structures and combinatorial models
- Logic, Reasoning, and Knowledge
- Mathematics and Applications
- Data Management and Algorithms
- Classical Antiquity Studies
- Modeling and Simulation Systems
- Embedded Systems Design Techniques
- Rangeland and Wildlife Management
- Finite Group Theory Research
- Meromorphic and Entire Functions
- Parallel Computing and Optimization Techniques
- Cryptography and Residue Arithmetic
- Climate change impacts on agriculture
University of Denver
2020-2021
Numerical Algorithms Group (United Kingdom)
2000-2003
Ruhr University Bochum
1998
University of Manchester
1985-1998
Laboratoire d'Informatique de Paris-Nord
1989-1991
Unambiguous representation of mathematics is crucial for communications among humans or computer systems. OpenMath a standard aimed at supporting semantically rich interchange varied computational software tools such as algebra systems, theorem provers, and visualizing editing mathematical text. MathML W3C Recommendation the encoding 'on web' which also includes mechanisms semantics. We introduce each these two languages describe their relationships.
Study teams, including industry representatives, themselves experienced in the use of microcomputers logistics, report on a survey such use.
Synopsis The number of occurrences the Steinberg representation St GL ( n, p ) as a composition factor in symmetric algebra F [ x 1 , … n ] has been determined by several authors. We extend this result to representations which are closest neighbours SL weight diagram. method is play off duality for )-modules against connectivity M )-modules. equivalent determining cohomology groups corresponding indecomposable stable summands localisation an -fold product complex projective spaces at prime .
article Free Access Share on OpenMath, MathML, and XSL Author: David Carlisle The Numerical Algorithms Group, Wilkinson House, Jordan Hill Rd, Oxford OxfordView Profile Authors Info & Claims ACM SIGSAM BulletinVolume 34Issue 2June, 2000 pp 6–11https://doi.org/10.1145/362001.362011Online:01 June 2000Publication History 6citation378DownloadsMetricsTotal Citations6Total Downloads378Last 12 Months21Last 6 weeks4 Get Citation AlertsNew Alert added!This alert has been successfully added will be...
While commodity technologies are now available for deploying and accessing web (and grid) services, the issue of how a potential user discovers service which matches his or her requirements is still open. This paper looks at specific case mathematical services proposes two complementary solutions to this problem.
We describe a microcomputer-based decision support system for logistics planning. The uses efficient network algorithms to optimize the flow of freight from vendors, through processing centers, retail store locations. It comprises three different models determining inbound sourcing, outbound transshipment points, and location set market service centers. Despite large size some networks (over 20,000 links) package offered surprisingly fast execution times even when solving facility problems....