Publications
Dr. David W. Matula
Publications
129. “A
New Linear Programming Formulation for the Maximum Concurrent Flow Problem”,
with T.J. Kratz and E. V. Olinick, Networks #10-15, (submitted for
publication).
128. “A
Prescaled LUT Procedure for Obtaining High Precision Reciprocals, with M. T.
Panu, IEEE Trans. on Computers, (submitted for publication).
127. “Prescaled
4-Factor Multiplicative Division” with J. Y. Zhang and M. T. Panu, IEEE Trans.
on Computers, (submitted for publication).
126. “Constructing
Efficient Rotating Backbones in Wireless Sensor Networks using Graph Coloring”
with D. Mahjoub, Computer Communications Journal (Elsevier), Special Issue on
Wireless Sensor and Robot Networks: Algorithms and Experiments, 2012, pp.
1086-1907.
125. “A
Prescale-Lookup-Postscale Additive Procedure for Obtaining a Single Precision
Ulp Accurate Reciprocal”, with M. T. Panu, IEEE 20th Symposium on Computer
Arithmetic, 2011.
124. “Approximating
the Independent Domatic Partition Problem in Random Geometric Graphs - An
Experimental Study”, with D. Mahjoub, A. Leskovskaya, Canadian Conference on
Computational Geometry (CCCG), 2010, pp. 195-198.
123. “Building
(1-epsilon) Dominating Set Partitions as Backbones in Wireless Sensor Networks
using Distributed Graph Coloring”, with D. Mahjoub, 6th IEEE International
Conference on Distributed Computing in Sensor Systems (DCOSS), 2010, pp. 144-157.
122. “Employing
(1-epsilon) Dominating Set Partitions as Backbones in Wireless Sensor
Networks”, with D. Mahjoub, 11th Workshop on Algorithm Engineering and
Experiments (ALENEX), 2010, pp. 98-112.
121. “A
Low Power High Performance Radix-4 Approximate Squaring Circuit”, with S. R.
Datla, M. A. Thornton, ASAP, 2009, pp. 91-97.
120. “Higher
Radix Squaring Operations Employing Left-to-Right Dual Recoding”, IEEE 19th
Symposium on Computer Arithmetic, 2009, pp. 39-47.
119. “Experimental
Study of Independent and Dominating Sets in Wireless Sensor Networks Using
Graph Coloring Algorithms”, with D. Mahjoub, International Conference on
Wireless Algorithms, Systems and Applications WASA, 2009, pp. 32-42.
118. “A
Discrete Logarithm Number System for Integer Arithmetic Modulo 2k: Algorithms
and Lookup Structures”, with A. Fit-Florea, L. Li, M.A. Thornton, IEEE
Transactions on Computers, (conditionally accepted; revision submitted
02/14/08, first submission 07/22/07).
117. “The
Use of Sparsest Cuts to Reveal the Hierarchical Community Structure of Social
Networks”, with C. F. Mann, E. V. Olinick; Social Networks (to appear.).
116. “Quantum
Logic Implementation of Unary Arithmetic Operators”, with L. Spenner; M. A.
Thornton; D. M. Miller, IEEE International Symposium on Multiple-Valued Logic
(ISMVL), May 22-24, 2008, (to appear).
115. “Multilevel
Variable Length Shifter Design for an Iterated Shift-and-Add Product
Operation”, with J. Moore, M.A. Thornton, D. W. Matula, Proceedings of the IEEE
Region 5 Technical Conference, April 20-22, 2007, pp. 234-238
114. “Performance
Evaluation of a Novel Table Lookup Method and Architecture for Integer
Functions”, with L. Li, A. Fit-Florea, and M. A. Thornton, IEEE International
Conference on Application-Specific Systems, Architectures, and Processors
(ASAP), September 11-13, 2006, pp. 99-104.
113. “A
Digit Serial Algorithm for the Integer Power Operations”, with L. Li and M.A.
Thornton, ACM/IEEE Great Lakes Symposium on VLSI (GLSVLSI), April 20-May 2,
2006, pp. 302-307.(preprint)
112.
"A Formal Method and Efficient Traversal
Algorithm for Generating Testbenches for Verification of IEEE Standard Floating
Point Division"", with L.D.
McFearin, Proc. DATE 06, March 6-10, 2006
111. "Single Precision Reciprocal by
Multipartite Table Lookup", with P. Kornerup, Proc.17th Symp.
Comp.Arith., IEEE , June 2005, pp. 240-248.
110. "Table Lookup Compression for Multiplicative
Inverses Modulo 2k ", with A. Fit-Florea and M. Thornton,
Proc.17th Symp. Comp.Arith., IEEE, June 2005, pp. 156-163.
109. "Hardware Implementation of an Additive
Bit-Serial Algorithm for the Discrete Logarithm
Modulo 2k ", with L. Li, A. Fit-Florea, M. A. Thornton, Proc. Ann. Sym. on VLSI 2005, IEEE,
May 2005, pp.130-135.
108. "Secondary Radix Recodings for Higher Radix
Multipliers", with P. M. Seidel, and L. D. Mc Fearin, IEEE Trans. on Comp., vol 54, 2005, pp. 111-123.
107. "Additive Bit-serial Algorithm for the Discrete
Logarithm Modulo 2k ", with A. Fit-Florea and M. Thornton, IEE Electronics Letters, January, 2005, pp. 57-59.
106. "Addition-based Exponentiation Modulo 2k ",
with A. Fit-Florea and M. Thornton, IEE Electronics Letters, January,
2005, pp. 56, 57.
105. "Determining All Pairs Edge connectivity of a
4-regular Graph in O(|V|)", with A. Fit-Florea, Proc. 3rd ACS/IEEE
Conf. Comp. Sys. and Appli., IEEE, Jan
2005.
104. "A Digit-Serial Algorithm for the Discrete
Logarithm Modulo 2k ", with A. Fit-Florea, Proc. ASAP, IEEE,
2004, pp. 236-246.
103. "Prescaled Integer Division", with
A. Fit-Floria, Proc. 16th Symp. Comp.Arith., IEEE, June 2003, pp. 63-68.
102. "A pxp Bit Fraction
Model of Binary Floating Point Division and Extremal Rounding Cases", with
L. D. McFearin, J.Th. Comp. Sci., 291,2003, pp. 159-182.
101. "Further Reducing
the Redundancy of a Notation Over a Minimally Redundant Digit Set", with
M. Daumas, JVLSI vol 33, 2003, pp. 7-18.
100. "A 6-Regular
Torus Graph Family with Applications in Cellular and Interconnection
Networks", with M. Iridon, JGAA vol 6, 2002, pp. 373-404.
99. "Evaluating Products
of Non Linear Functions by Indirect Bipartite Table Lookup", with A.
Fit-Floria, and L.D. McFearin, Proc. ASAP, IEEE, 2002, pp.
120-129.
98. "Selecting Test
Suites for IEEE Standard Floating Point Division", with L.D. McFearin, Proc.IEEE
International Conf. on Computer Design, Sept. 2001, pp. 89-96.
97. "Binary Multiplication
Radix-32 and Radix-256", with P.-M. Seidel, and L.D. McFearin, Proc.15th
Symp. Comp. Arith., IEEE June 2001, pp.23-32.
96. "Generation and
Analysis of Hard to Round Test Cases for Binary Floating Point Division",
with L.D. McFearin, Proc. 15th Symp. Comp. Arith., IEEE
June 2001, pp. 119-126.
95. "Improved Table
Lookup Algorithms for Postscaled Division", Proc.15th Symp.
Comp. Arith, IEEE June 2001, pp. 101-108.
94. "A Graph Theoretic
Approach for Channel Assignment in Cellular Networks", with M. Iridon, and
C. Yang, Wireless Networks Journal,
vol 7, 2001, pp. 567-574.
93. "A Booth Multiplier
Accepting Both a Redundant or a Non Redundant Input with No Additional
Delay", with M. Daumas, Proc.ASAP, 2000, pp. 205-214.
92. "Improving
Goldschmidt Division, Square Root, and Square Root Reciprocal", with M.D.
Ercegovac, L. Imbert, J-M. Muller, and G. Wei IEEE Trans. on Comp, vol
49, 2000 pp. 759-763.
91. "Number Theoretic
Foundations of Binary Floating Point Division with Rounding", with L.D.
McFearin, Proc. RNC4; April 2000, pp. 39-60.
90. "An IEEE Compliant
Floating – Point Adder that Conforms with the Pipelined Packet-Forwarding
Paradigm", with A. M. Neilsen, C.N. Lyu, and G. Even, IEEE Trans. on Comp., vol 49, 2000,
pp. 33-47.
89. "Analysis of
Reciprocal and Square Root Reciprocal Instructions in the AMD
K6-2 Implementation of 3D Now! ", with C. Ioradache, ENTCS, vol.
24, Aug.1999.
88. "On Infinitely
Precise Rounding for Division, Square Root, Reciprocal, and Square Root
Reciprocal", with C. Iordache Proc. 14th Symp. on
Comp. Arith., IEEE Car. #99CB36336, 1999,pp. 233-240.
87. "Performance
Analysis of A Graph Model for Channel Assignment in a Cellular Network",
with H. Cankaya, and M. Iridon, Proc. of
IEEE COMPSAC’99, 1999, pp.239-240.
86. "Symmetric Cellular Network Embeddings
on a Torus", with M. Iridon, IEEE, Proc. of ICCCN, 1998, pp. 732-736.
85. "Faithful
Interpolation over Reciprocal Tables", with D. DasSarma, Proc. 13th
IEEE Symp. on Comp. Arith., IEEE Cat# 97CB36091, 1997, pp. 82-91.
84. "Pipelined
Packet-Forwarding Floating Point: I. Foundations and a
Rounder", with A. M. Nielsen, Proc. 13th IEEE Symp. on Comp.
Arith., IEEE Cat# 97CB36091, 1997, pp. 140-147.
83. "Pipelined
Packet-Forwarding Floating Point: II. An Adder", with A.M.Nielsen, C.N.Lyu
and G.E.Even, Proc.13th Symp. on Comp. Arith., IEEE Cat#
97CB36091, 1997, pp. 148-155.
82. "Validating Roundings of Dot Products”,
with M. Daumas, IEEE Trans. on Computers, 46, 1997.
81. “Hardware Reciprocal
Table Compression/Decompression Techniques", with D. Das Sarma, in Scientific
Computing and Validated Numerics, Akademic Verlag, 1995, pp. 11-17.
80. "LCF: A Lexicographic Binary
Representation of the Rationals", with P. Kornerup, J. U. C. S. 1, 1995, 480-499.
79. "Faithful Bipartite
ROM Reciprocal Tables", with D. DasSarma, Proc. 12th Sym. on Comp. Arith., IEEE Cat. #95CB35822,
1995, 17-28.
78. "Redundant Binary
Booth Recoding", with C. N. Lyu, Proc.
12th Sym. on Comp. Arith., IEEE Cat# 95CB35822, 1995, 50-57.
77. "Partitioning by
Maximum Adjacency Search of Graphs", with W. Cai, in Partitioning Data Sets, Cox, I.J., Hansen, P., Julesz, B., ed.,
DIMAS 19, AMS, Providence, 1995, 55-63.
76. "Rounding of Floating Point
Intervals", with M. Daumas, Interval
Computations, No.4, 1994, 28-45.
75. "Measuring the Accuracy of ROM
Reciprocal Tables", with D. DasSarma, IEEE
Trans. on Comp., 43, 1994, 932-940.
74. "Measuring the
Accuracy of ROM Reciprocal Tables", with D. DasSarma, Proc. 11th Sym. on Comp. Arith., IEEE Cat# 93CH3324-1,
1993, 95-102.
73. "Design of a Fast
Validated Dot Product Operation", with M. Daumas, Proc. 11th Sym. on Comp. Arith., IEEE Cat# 93CH3324-1,
1993, 62-69.
72. "A 17 x 69 Bit
Multiply and Add Unit with Redundant Binary Feedback and Single Cycle
Latency", with W. S. Briggs, Proc.
11th Sym. on Comp. Arith., IEEE Cat# 93CH3324-1, 1993,
163-170.
71. "A Linear Time (2+e)
Approximation Algorithm for Edge Connectivity". Proc. 4th ACM-SIAM Sym. on Dis. Algorithms, 1993, pp.
500-504.
70. "Semantics for Exact
Floating Point Operations", with G. Bohlender, P. Kornerup, and W. Walter,
Proc. 10th Sym. On Comp.Arith., IEEE Cat# 91CH3015-5, 1991, 22-26.
69. "A Redundant Binary
Euclidean GCD Algorithm", with S. N. Parikh, Proc. 10th Sym. On Comp. Arith., IEEE Cat# 91CH3015-5, 1991, 220-225.
68. "An Algorithm for
Redundant Binary Bit-Pipelined Rational Arithmetic", with P. Kornerup, IEEE Trans. on Comp., C-39, 1990,
1106-1115.
67. "The Maximum Concurrent Flow
Problem", with F. Shahrokhi, J.A.C.M.,
37, 1990, 318-334.
66. "Sparsest Cuts and Bottlenecks in
Graphs", with F. Shahrokhi, Discrete
Applied Mathematics, 1990, 113-123.
65. "An Expose and Merge
Algorithm and the Chromatic Number of a Random Graph", with L. Kucera, in Random Graphs ’87, Karonski, M.,
Jaworski, J. and Rucinski, A., ed., Wiley, New York,
1990, 175-187.
64. "Exploiting
Redundancy in Bit-Pipelined Rational Arithmetic", with P. Kornerup, Proc. 9th IEEE Sym. on Comp.
Arith., IEEE Cat# 89CH2757-3, 1989, 119-126.
63. "An On-Line
Arithmetic Unit for Bit-Pipelined Rational Arithmetic", with P. Kornerup, J.
Parallel
and Distributed Comp., 1988,
310-330.
62. "Expose-and-Merge Exploration and the
Chromatic Number of a Random Graph", Combinatorica,
7, 1987, 275-284.
61. "Determining Edge Connectivity in O (nm)
", Proc. 28th IEEE FOCS,
1987, 249-251.
60. "A Bit-Serial
Arithmetic Unit for Rational Arithmetic", with P. Kornerup, Proc. 8th IEEE Sym. on Comp.
Arith., 1987, 204-211.
59. "On Solving Large
Maximum Concurrent Flow Problems", with F. Shahrokhi, Proc. Computer Science Conf.,
1987, 205-209.
58. "Two Flow Routing
Algorithms for the Maximum Concurrent Flow Problem", with J. Biswas, Proc. FJCC, Computer Society Press,
Washington, D.C., 1986, 629-636.
57. "Arithmetic for
Microprocessors-Some Recent Trends", in Impacts of Microcomputers on Operations Research, Gass, S.I., et
al., eds., Elsevier, New York, 1986, 194-200.
56. "Divisive vs.
Agglomerative Average Linkage Hierarchical Clustering", in Classification as a Tool of Research, Gaul,
W. and Schader, M., eds., Elsevier (North Holland), Amsterdam,
1986, 289-301.
55. "Random Graphs"
with M. Karonski, in Encyclopedia of
Statistical Sciences, Vol. 7, Johnson, N.L., Kotz, S and Read, C.S., eds.
Wiley, New York, 1986, 512-516.
54. "Finite Precision
Rational Arithmetic: Slash Number Systems", with P. Kornerup, IEEE Trans. on Comp., C-34, 1985, 3-18.
53. "Finite Precision
Lexicographic Continued Fraction Number Systems", with P. Kornerup, Proc. 7th Sym. on Comp. Arith.,
IEEE Cat# 85CH2146-9, 1985, 207-214.
52. "Rationally Biased
Arithmetic", with W, Ferguson,
Proc. 7th Sym. On Comp.
Arith., IEEE Cat# 85CH2146-9, 1985, 194-202.
51. "Concurrent Flow and
Concurrent Connectivity in Graphs", in Graph
Theory and Its Applications to Algorithms and Computer Science, Y. Alavi et
al., John Wiley, New York, 1985, 543-559.
50. "An Order Preserving
Finite Binary Encoding of the
Rationals", with P. Kornerup, Proc.
6th Sym. on Comp. Arith., IEEE Cat# 83CH1892-9, 1983,
201-209.
49. "Cluster Validity by
Concurrent Chaining", in Numerical
Taxonomy: Proc. of The NATO Adv. Study
Inst., J. Felsenstein, ed., Proc. Of NATO ASI Series G, vol.1,
Springer-Verlag, New York, 1983, 156-166.
48. "Smallest Last Ordering and Clustering
and Graph Coloring Algorithms" with L. Beck, J.A.C.M., 30, 983, 417-427.
47. "Finite Precision
Rational Arithmetic: An Arithmetic Unit", with P. Kornerup, IEEE Trans. on Comp., C-32, 1983,
378-388.
46. "Ramsey Theory for Graph
Connectivity", J. Gr. Th. 7,
1983, 95-103.
45. "Graph Theoretic
Cluster Analysis" in Encyclopedia of
Statistical Sciences, vol. 3, S. Kotz and N.L.
Johnson, eds., Wiley, New York,
1983, 511-517.
44. "Basic Digit Sets for Radix
Representation", J.A.C.M., 29,
1982, 1131-1143.
43. "An Integrated
Rational Arithmetic Unit", with P. Kornerup, Proc. 5th Sym. On Comp. Arith., IEEE Cat# 81CH1630-3,
1981, 233-240.
42. "Properties of Gabriel Graphs Relevant to Geographic
Variation Research and the Clusting of Points in the Plane", with R. R. Sokal, Geographical Analysis, 12, 1980,
205-222.
41. "Foundations of Finite Precision Rational
Arithmetic", with P. Kornerup, Computing
Suppl 2, 1980,85-111.
40. "Approximate
Rational Arithmetic Systems: Analysis of Recovery of Simple Fractions During
Expression Evaluation" with P. Kornerup, Symbolic and Algebraic Computation, E. W. Ng. ed., Lecture Notes in Computer Science, 72,
Springer-Verlag, Berlin, 1979, 383-397.
39. "Introduction to
Data Processing for Managers" with K. Arora, and T. Perkins (Text
Manual to Accompany a Multi-Media Short Course), Control Data Education
Company, Minneapolis, 1979.
38. "A Feasibility
Analysis of Fixed-Slash Rational Arithmetic", with P. Kornerup, Proc. 4th Sym. on Comp. Arith.,
IEEE Cat# 78CH1412-6C, 1978, 39-47.
37. "A Feasibility
Analysis of Binary Fixed-Slash and Floating-Slash Number Systems" with P.
Kornerup, Proc. 4th Sym. on
Comp. Arith., IEEE Cat# 78CH1412-6C, 1978, 29-38.
36. "Basic Digit Sets
for Radix Representation of the Integers", Proc. 4th Sym. on Comp. Arith., IEEE Cat# 78CH1412-6C, 1978, 1-9.
35. "Subtree Isomorphism in O (n 5/2)
", Ann. Dis. Math. 2, 1978,
91-106.
34. "k-Blocks and Ultrablocks in
Graphs", J. Comb. Th., Ser. B
24, 1978, 1-13.
33. "Subgraph
Connectivity Numbers of a Graph" in Theory
and Applications of Graphs, Y. Alavi and D. Lick, eds., Lec. Notes in Math.
Vol. 642, Springer-Verlag, 1978, 371-383.
32. "Computer Arithmetic: Foreword and
Survey", with T.R. Rao, IEEE Trans.
on Comp., C-26, 1977, 609.
31. "Base Conversion in Residue Number
Systems", with R. T. Gregory, BIT 17,
1977, 286-302.
30. "Graph Theoretic
Techniques for Cluster Analysis Algorithms", in Classification and Clustering, J. Van Ryzin, ed., Academic Press, New
York, 1977, 95-129.
29. "Significance
Arithmetic" "Significant Digit" "Precision", in Encyclopedia of Computer Sciences, A.
Ralston and C.L.Meek, eds., Petrocelli/Charter, New York,
1976, 1087-88, 1254-56.
28. "Radix Arithmetic:
Digital Algorithms for Computer Architecture", Ch.
9 of Applied Computation Theory:
Analysis, Design, and Modeling, R. Yeh, ed., Prentice Hall, Englewood
Cliffs, 1976, 374-448.
27. "Fixed-Slash and Floating-Slash Rational
Arithmetic", Proc. 3rd
Sym. on Comp. Arith., IEEE, 1975, 90-91.
26. "A Uniform Set Covering Lemma", Proc. Am. Math. Soc., 48, 1975, 255-261.
25.
"Radix/Residue/Rational: The Three R’s of Computer Arithmetic and
Associated Computer Architecture", Proc.
Second Texas Conference on Computing Systems, 1973, 36.1-36.4.
24. "A Simulative Study
of Correlated Error Propagation in Various Finite-Precision Arithmetics"
with J.D. Marasa, IEEE Trans. on Comp.,
C-22, 1973, 587-597.
23. "Number Theoretic
Foundations of Finite Precision Arithmetic", Applications of Number Theory to Numerical Analysis, with W.
Zaremba, ed., Academic Press, New York,
1972, 479-489.
22. "Graph Coloring
Algorithms" with G. Marble and J.D. Isaacson, in Graph Theory and Computing,R. Read, ed., Academic Press, New
York, 1972, 109-122.
21. "Significant Digits:
Numerical Analysis or Numerology", in Proc.
IFIPS Congress 71, North Holland, Amerstdam, 1972,
1278-1283.
20. "K-Components, Clusters, and Slicings in
Graphs" SIAM Jour. of Appl. Math., 22, 1972,
459-480.
19. "Bounded Color Functions on Graph",
Networks, 2, 1972, 29-44.
18. "The Emergence of
Computational Arithmetic as a Component of the Computer Science
Curriculum", Proc.of the First Tech.
Sym. on Academic Education in Computer Science, Assoc. for Comp. Mach., New
York, 1970, 41.
17. "On the Complete
Subgraphs of a Random Graph", Proc.
of the Second Chapel Hill Conference on Combinatorial Mathematics and Its
Applications, University of North Carolina, Chapel Hill, 1970, 356-369.
16. "Cluster Analysis
via Graph Theoretic Techniques", Proc.
of the Louisiana Conference on Combinatorics, Graph Theory,
and Computing, R.C. Mullin, K.B.Reid, and D.P. Roselle, eds., University
of Manitoba, Winnipeg,
1970, 199-212.
15. "A Formalization of Floating-Point
Numeric Base Conversion" IEEE Trans.
on Comp., C-19, 1970,681-692.
14. “On The Number of Subtrees of a Symmetric
n-ary Tree”, SIAM Jour. of Ap. Math.,
18, 1970, 680-703.
13. "New Instruction
Types for Implementing Combinatorial Algorithms on a Computer" in Combinatorial Structures and Their Applications, R.
Guy, N. Saur, M. Manani, and H. Schonheim, eds., Gordon and Breach, New York,
1970, 261-265.
12. "The Cohesive
Strength of Graphs" in The Many
Facets of Graph Theory, G. Chartrand and S.F. Kapoor, eds.,
Springer-Verlag, Berlin, 1969, 215-221.
11. "Theory of Mixed
Backbone Scrambling as Exemplified by Exchange of Chlorine and Bridging Sulfur
Atoms Between Dimethylgermanium and Dimethylsilicon" with K. Moedritzer
and J.R. Van Wazer, Inorganica Chimica
Acta, 3, 1969, 559-567.
10. "Stochastic Graph
Theory and Equilibrium Constants for Families of Molecules", Ann. N.Y. Acad. Sci., Art. 1, 1969, 314-334.
9. "Towards an Abstract Mathematical Theory
of Floating Point Arithmetic", Proc.
AFIPS, 34, 1969, 765-772.
8. "The Base Conversion Theorem" Proc. Am. Math. Soc., 19, 1968, 716-723.
7. "In-and-Out Conversions", Comm. ACM, 11, 1968, 47-50.
6. "Molecular
Distributions at Equilibrium. VI. Relationships Latent in Stochastic Graph
Theory Suitable for Simplified Data Treatment of Polymer Systems", with
J.R. Van Wazer, J. Chem. Phys., 46,
1967, 3123-3131.
5. "Base Conversion Mappings", Proc. AFIPS, 30, 1967, 311-318.
4. "Circles in a Square
World, A Problem in Pattern Analysis", with R. M. Baer, Comp. Bio-med. Res., 1, 1967, 18-40
(inaugural issue of journal).
3. "Molecular
Distributions at Equilibrium, I. Theory of Equilibria in
Scrambling Reactions and Interpretation of NMR Spectra", with L.C.D.
Groenweghe and J.R. Van Wazer, J.Chem.Phys.,
41,1964, 3104-3121.
2. "Exchange of Parts
Between Molecules at Equilibrium. II. Polyarsenous Oxyhalides" with
J.R.Van Wazer and K. Moedrizer, J. Am.
Chem. Soc., 86, 1964, 807-811.
1. "A Periodic Optimal Search" Am. Math. Mon., 71, 1964, 15-21.
Copyright Notice
The
contributing authors have provided the following documents as a means to ensure
timely dissemination of scholarly and technical work on a noncommercial basis. Copyright
and all rights therein are maintained by the authors or by other copyright
holders, notwithstanding that they have offered their works here
electronically. It is understood that all persons copying this information will
adhere to the terms and constraints invoked by each author's copyright. These
works may not be reposted without the explicit permission of the copyright
holder.
The
contents of these Web pages are the sole responsibility of Dr. David Matula, (matula@engr.smu.edu)
and do not necessarily represent the opinions or policies of Southern Methodist
University.