Subject: Evaluating R&D; area
From: dmal@iol.it (Davide Malacalza)
Date: Sun, 17 Nov 1996 11:18:44 GMT
Dear colleagues,
I've been discussing for a long time with other people about the
evaluation of the Research & Development area.
As you know, R&D; can't be evaluated using the typical indexes usually
used inside the firm (ROE, ROI, Income and so on) and
I still haven't found a satisfactory answer to this question... if any
answer exist, of course!
Davide Malacalza
Subject: [Revision] Some Symbolic Computation Meetings on 1996
From: TangSimon@cuhk.edu.hk (_SAC_commando_)
Date: Sun, 17 Nov 1996 11:57:26 GMT
I S S A C ' 9 6
International Symposium on Symbolic and Algebraic Computation
July 24-26, 1996 Zurich, Switzerland
Sponsored by ACM SIGSAM and ACM SIGNUM
http://www.inf.ethz.ch/ISSAC96/ISSAC96.html
___________________________________________________________________________
ISSAC'96 will be held in the main building of the Swiss Federal Institute
of Technology (ETH), Raemistr. 101, Zurich, Switzerland. The conference
starts on Wednesday, July 24, and ends on Friday, July 26.
To register for ISSAC'96 fill in the attached registration form and send it
by e-mail, air mail or fax to the address mentioned there.
PRELIMINARY TECHNICAL PROGRAM
Tuesday, July 23:
9:00 - 12:00, 14:00 - 17:00: Tutorials (see below)
17:00 - 20:00: Registration
19:00: ISSAC Reception
Wednesday, July 24:
8:15 - 8:30: Official Symposium Opening (Prof. Erwin Engeler)
8:30 - 10:00: POLYNOMIAL ALGORITHMS
* Arithmetic and Factorization of Polynomials in F_2[x]
J. von zur Gathen & J. Gerhard
* Factoring Modular Polynomials}
J. von zur Gathen & S. Hartlieb
* Parallel Distinct Degree Factorization Algorithm
T. Fujise & H. Murao
* Computing Complexification of a Semialgebraic Set
M.F. Roy & N. Vorobjov
10:45 - 12:15: ALGEBRAIC ALGORITHMS
* Approximate Polynomial Greatest Common Divisors and
Nearest Singular Polynomials
N. Karmakar & Lakshman Y.N.
* Euclidean Algorithm in Dimension n
L. Pottier
* Fast Computations in the Lattice of Polynomial
Intermediate Fields of a Rational Function Field
F. Binder
* Testing Shift-Equivalence of Polynomials Using Quantum Machines
D.Y. Grigoriev
13:30 - 14:30: INVITED LECTURE
Title to be Announced
Prof. Volker Weispfenning, Universitaet Passau, Germany
14:45 - 16:15: GROEBNER BASES
* An Optimal Algorithm for Constructing the Reduced Groebner
Basis of Binomial Ideals
U. Koppenhagen & E. Mayr
* Exponential Space Computation of Groebner Bases
K. Kuehnle & E. Mayr
* Multigraded Hilbert Functions and Buchberger Algorithm
M. Caboara, G. De Dominicis & L. Robbiano
* Groebner Bases under Composition II
H. Hong
16:30 - 17:30: POSTER SESSION I AND SOFTWARE DEMOS
Thursday, July 25:
8:30 - 10:00: SYSTEM ISSUES
* Symbolic Mathematics System Evaluators
R. Fateman
* A Case Study of Multi-Threaded Groebner Basis Completion
B. Amrhein, O. Gloor, & W. Kuechlin
* MPP: A Framework for Distributed Polynomial Computations
O. Bachmann, H. Schoenemann & S. Gray
* Memory Tracing of Algebraic Calculations
A. Norman & J. Fitch
10:45 - 12:15: SOLUTIONS OF EQUATIONS
* Solution of Elementary Systems of Equations in a Box in R^n
D. Richardson
* Analysis of Zero Clusters in Multivariate Polynomial Systems
H.J. Stetter
* A Tangent-Secant Method for Polynomial Complex Root Calculation
G. Collins & W. Krandick
* Fast High-Precision Computations of Complex Square Roots
T. Ahrendt
13:30 - 14:30: INVITED LECTURE
Kronecker, Galois, and Symbolic Computation
Prof. Harold M. Edwards, Courant Institute, New York University, USA
14:45 - 16:15: GROUPS AND ALGEBRAS
* Computing Character Tables of p-Groups
A. Thuemmel
* New Sequential and Parallel Algorithms for Generating
High Dimension Hecke Algebras using the Condensation Technique
G. Cooperman & M. Tselman
* Algorithms for Primitive Elements of Free Lie Algebras and
Lie Superalgebras
A.A. Mikhalev & A.A. Zolotykh
* Efficient Decomposition of Associative Algebras
W. Eberly & M. Giesbrecht
16:30 - 17:30: POSTER SESSION II AND SOFTWARE DEMOS
19:30: Banquet
Friday, July 26:
8:30 - 10:00: DIFFERENTIAL EQUATIONS I
* Janet Bases for Second Order Ordinary Differential Equations
F. Schwarz
* The General Solution of an Ordinary Differential Equation
E. Hubert
* Symbolic Computation of the Index of Quasilinear
Differential-Algebraic Equations
G. Thomas
* MapleTensor: Progress Report on a New System for Performing Indicial
and Component Tensor Calculations Using Symbolic Computation
M. Kavian, R. McLenaghan & K.O. Geddes
10:45 - 12:15: DIFFERENTIAL EQUATIONS II
* Differentially Homogeneous Differential Polynomials
G. Reinhart & W. Sit
* Rational Solutions of the Mixed Differential Equation and
Its Application to Factorization of Differential Operators
M. van Hoeij
* An Algorithm for Complete Enumeration of All Factorizations
of a Linear Ordinary Differential Operator
S.P. Tsarev
* D'Alembertian Solutions of Inhomogeneous Linear Equations
S.A. Abramov & E.V. Zima
13:30 - 14:30: INVITED LECTURE
Interfacing Computer Algebra and Numerical Modeling
Prof. Stanly Steinberg, University of New Mexico, USA
14:30 - 16:10: LINEAR ALGEBRA
* On Rank Properties of Toeplitz Matrices over Finite Fields
E. Kaltofen & A. Lobo
* Computing Popov and Hermite Forms of Polynomial Matrices
G. Villard
* Asymptotically Fast Computation of the Hermite Normal Forms of
Integer Matrices
A. Storjohann & G. Labahn
* Near Optimal Algorithms for Computing Smith Normal Forms of
Integer Matrices
A. Storjohann
* Generic Gram-Schmidt Orthogonalization by Exact Division
U. Erlingsson, E. Kaltofen & D. Musser
16:40 - 18:00: APPLICATIONS
* Automatic Generation of Optimization Code Based on
Symbolic Non-Linear Domain Formulation
R. Bacher
* A Methodology of Parsing Mathematical Notation for
Mathematical Computation
Y. Zhao
* Hypergeometric Function Representations
K. Roach
* Asymptotic Expansions of exp-log Functions
D. Richardson, B. Salvy, J. Shackell & J. van der Hoeven
TUTORIALS
On Tuesday, July 23, seven tutorials will be given by leading experts.
The tutorials are intended for students and researchers to broaden their
knowledge base. The fee is 90 CHF for students and 120 CHF for others.
It includes a morning and an afternoon session. Tutorial registration does
not require conference registration.
Morning sessions:
- Introduction to Symbolic Summation: Peter Paule
- Introduction to Solving Polynomial Systems: Teo Mora
- Algebraic Methods for Proving Theorems in Elementary and Differential
Geometries: Xiaoshan Gao
Afternoon sessions:
- Advanced Algorithms for Symbolic Summation: Peter Paule
- Advanced Algorithms for Solving Polynomial Systems over Complex Numbers:
Teo Mora
- Advanced Algorithms for Solving Polynomial Systems over Real Numbers:
Laureano Gonzales Vega
- Algorithmic Methods for Rational Algebraic Curves: Rafael Sendra
More information on the tutorials is available on the ISSAC'96 WWW page.
For further questions please contact Hoon Hong (Hoon.Hong@risc.uni-linz.ac.at).
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Subject: Re: [Revision] Some Symbolic Computation Meetings on 1996
From: TangSimon@cuhk.edu.hk (_SAC_commando_)
Date: Sun, 17 Nov 1996 12:12:26 GMT
The 2nd IMACS Conference
on
Applications of Computer Algebra
17 - 20 July, 1996
Research Institute for Symbolic Computation
Castle Hagenberg, Austria
http://info.risc.uni-linz.ac.at:70/0/conference/IMACS96/imacs.html
(with . . very . . many details inside)
_________________________________________________________________________
The IMACS ACA conference series is dedicated to reporting serious
applications of computer algebra theories and tools for mathematics,
logic, science, engineering and education. The 2nd IMACS ACA conference
will be held in a medieval castle near Linz, Austria.
Sponsors
U.S. Air Force European Office of Aerospace Reseach and Development
Austrian Ministery for Economical Affairs
Government of Upper Austria
Macsyma Inc.
MathSolutions Inc.
General Chairs
Bruno Buchberger (Austria), Stanly Steinberg (USA)
Program Committee Chair
Hoon Hong (Austria)
Program Committee
Akira Aiba (Japan) Erich Barke (Germany) Alexei Bocharov (USA)
Victor Edneral Victor .G. Ganzha
(Russia) (Germany) Vladimir P. Gerdt (Russia)
Hoon Hong (Austria) Michael Johnson Richard Liska (Czech
(Australia) Republic)
Claudio Maccone Eugenio Roanes-Lozano
(Italy) Rolf Mertig (Netherlands) (Spain)
Shojiro Sakata
(Japan) J. Rafael Sendra (Spain) Ralf Sommer (Germany)
Sabine Stifter
(Austria) Nikolay Vasiliev (Russia) E.V. Vorozhtsov (Russia)
Dongming Wang
(France) Michael Wester (USA)
Scientific Program
July 17th (Wednesday)
08:15-08:30 Conference Opening
Morning Parallel Sessions
08:30-12:00 * Automated Theorem Proving I
* Formal Analysis of PDEs
Afternoon Parallel Sessions
14:00-17:30 * Automated Theorem Proving II
* Coding Theory and Cryptology
July 18th (Thursday)
Morning Parallel Sessions
* Geometric Modelling and CAD
08:30-12:00 * General Relativity and Quantum Physics
(08:30-10:00)
Numerical Problems of Mathematical Physics
(10:30-12:00)
Afternoon Parallel Sessions
14:00-17:30 * Computational Category Theory
* Non-Standard Applications
July 19th (Friday)
Morning Parallel Sessions
08:30-12:00 * Polynomial Elimination I
* Constraint Programming
* Analog Circuit Design
Afternoon Parallel Sessions
14:00-17:30 * Polynomial Elimination II
* Evaluations of Series
* Quantifier Elimination
19:30-22:30 Conference Banquet
July 20th (Saturday)
Morning Parallel Sessions
08:30-12:00 * New Appplications in Mathematica
* Comparative CAS Reviews and Philosophy
12:00 -12:15 Conference Closing
Current List of Attendees
1.Akira Aiba 2.Helmer Aslaksen 3.Stefania Audoly 4.Daniel Augot
5.Henk Barendregt 6.R. Barrere 7.Laurent Bernardin 8.Piergiorgio
Bertoli 9.Alexei Bocharov 10.Carsten Borchers 11.François Boulier
12.Chris Brown 13.Ronald Brown 14.Bruno Buchberger 15.Richard
Buckland 16.Hans-Joachim Bungartz 17.Jacques Calmet 18.Olga
Caprotti 19.Giuseppa Carrà Ferro 20.Bernd, Ingo Dahn 21.Andreas
Dolzmann 22.Winfried Dreckmann 23.Victor Edneral 24.Marc Gaëtano
25.Karin Gatermann 26.Robbie Gates 27.Wolfgang Gehrke 28.Vladimir
P. Gerdt 29.Floyd Gerwig 30.Emma-Neila Gonzalez-Campos 31.Hans-Gert
Gräbe 32.Laurent Granvilliers 33.Markus Grassl 34.Johannes
Grotendorst 35.Guenther Gsaller 36.Jason Harris 37.Lars Hedrich
38.Karsten Homann 39.Hoon Hong 40.Claude Huchet 41.John McIver
42.Ying Jiangqian 43.Mats Jirstrand 44.Michael Johnson 45.Michael
Joswig 46.Wolfram Koepf 47.J. Korelc 48.F. William Lawvere
49.Franck Leprevost 50.Carla Limongelli 51.R. Liska 52.Gerton
Lunter 53.Claudio Maccone 54.W. Mathis 55.Rolf Mertig 56.J. Lyn
Miller 57.Eric Monfroy 58.Antonio Montes 59.J.E. Morais 60.Marianne
Morillon 61.Sally D. Morrison 62.Bernard Mourrain 63.Joern
Mueller-Quade 64.Shigekazu Nakagawa 65.Masayuki Noro 66.Armin
Nueckel 67.Jesus Palacian 68.Frank Postel 69.Pottmann Helmut
70.Stefan Ratschan 71.Mohamed Rayes 72.Gregory J. Reid
73.Christophe Ringeissen 74.Eugenio Roanes-Lozano 75.Bob Rosebrugh
76.Maria Pia Saccomani 77.J.F. San-Juan 78.Yosuke Sato 79.Sauer
Tomas 80.David Saunders 81.K. Schaub 82.Klaus U. Schulz 83.Werner
M. Seiler 84.J. Rafael Sendra 85.Roman Shtokhamer 86.M. Sofroniou
87.Volker Sorge 88.Andreas Stein 89.Stanly Steinberg 90.Hans J.
Stetter 91.Jürgen Stuber 92.Thomas Sturm 93.Ross Taylor 94.Quoc-Nam
95.Michael Trott 96.Edwin Julio Vargas Sanchez 97.Nikolay Vasiliev
98.Sebastian Walcher 99.Robert Walters 100.Volker Weispfenning
101.Michael Wester 102.Franz Winkler 103.Lu Yang 104.Guo Yike
105.Paul Zimmermann
@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@
Subject: Re: Any Electrical Engineers here ?? - - I need Help
From: bill@cygnus.wa.com (Bill Swan)
Date: Sat, 16 Nov 1996 18:36:29 PDT
stanb@sr.hp.com (Stan Bischof) writes:
> : >P.S. I also tried connecting two fruits in series and while the voltage
> : >increased significantly the bulb still did not light up.....
> : Put them in series and you will get the same voltage, but more
> : current will be available. Still not enough for an incandescent
> : bulb, though.
> Put them in SERIES and you get TWICE the voltage but the same current.
> Put them in PARALLEL and you get the SAME voltage, but more current
> will be available.
> Basic gist is correct though, the source in question has very high
> internal resistance.
Which means, to the neophyte, that he's going to have to connect
a considerable amount of fruit in parallel in order to light the
incandescent bulb.
Actually, he'll probably need to serially connect *banks* of
paralleled fruit in order to get an adequate voltage as well.
--
Bill Swan An Comunn Gaidhlig Seattle
bill@cygnus.wa.com The Seattle Gaelic Society
Subject: Re: Are engineers sexist?
From: rongraham1@aol.com
Date: 17 Nov 1996 16:25:32 GMT
Carolyn Dougherty wrote...
>After reading a few of these "drafter" posts, and thinking
>about how these men must think about and thus treat the women
>they work with...is it any wonder that only 6% of us are women?
First of all, the way this statement reads, it's like you're
saying that many more women would be engineers if it weren't for
the way they were treated in the workplace. As if. You and I
both know that what you're describing above isn't the problem --
just a symptom.
Second of all, if the goal were to see more women becoming
engineers and contributing to the profession (a noble and
reasonable goal), you ought not to be worried so much about what
*men* in these newsgroups are saying as what *women* are saying.
One of the chief proponents of the status quo in the "drafter"
discussion was a woman. (Or at least posted under a woman's
name. Now that I think about it, how can I know that you are a
woman, or you that I am a man?) Women cannot reasonably expect
to make revolutionary changes to the engineering profession
without presenting a united front as pertains to those changes --
unless the changes are forced through legal action.
The way corporations view sexual harassment is IMPO an example of
forced change, and as such is sometimes not held in high regard
by non-supervisory staff, just as in the cases of TQM and
workplace diversity.
The united front, however, is slow in coming. I have a friend
working as a statistician for a biomedical research outfit.
She's got a Master's and is a quick study. She and I often argue
about workplace terminology. She used the common expression
"man-hours" in one of our talks, and I told her that I was trying
to find a new term, something more inclusive, more generic. She
was all over me like white on rice: don't I have more important
things to think about? Well, yes I do. But not many more
important things, and none of them much more important. This is
because I believe that (a) our productivity as engineers is more
closely tied to our self-esteem than to our salary; and (b) that
the expressions we use are closely tied to our self-image, and to
what extent we value others. She didn't get it. And I feel that
if women don't get it, men can't be expected to.
I think that any job description that ends in "man" can be
changed to some alternative without changing the essential
meaning of the term. "Drafter" instead of "draftsman." (Or
"designer" for those with more experience, as was suggested
elsewhere in the thread.) But "man-hours" is tough to change,
kind of like "freshman." It's in wide use, and "staff hours" and
"level of effort" are not as easy to say. I'm open to
suggestions on that one. The wider point is, though, that
inclusive workplace language is an ethical issue, and should be
treated as such by our profession.
Dr. Ron Graham
Project Engineer for Robotics, GreyPilgrim LLC, Washington DC
founder of sci.engr and keeper of the sci.engr.* FAQs
EMMA Robotic Manipulator online -- http://www.greypilgrim.com/
