Curriculum Vitae April 2019
Total Page:16
File Type:pdf, Size:1020Kb
Clifford H. Bergman Curriculum Vitae April 2019 Current Address Department of Mathematics phone: 515–294–8137 Iowa State University fax: 515–294–5454 Ames, Iowa 50011, USA email: [email protected] Home Address 3320 Kingman Road Ames, Iowa 50014, USA cell: 515–451–7947 Education B.S. Brown University 1975 M.S., Ph.D. University of California, Berkeley 1982 Professional Experience 2013–17 Chair, Department of Mathematics 2012–17 Barbara J. Janson Professor of Mathematics 2002– Professor, Iowa State University 1987–2002 Associate Professor, Iowa State University 1993–94 Faculty Improvement Leave at University of Illinois, Chicago 1982–1987 Assistant Professor, Iowa State University 1981–1982 PostDoc, Univ. of Hawaii at Manoa Research Interests Universal Algebra, Logic, Algorithm Analysis, Cryptography, Steganography Orcid ID: 0000-0002-1221-8459 1 Clifford Bergman April 2019 Publications BOOKS 1. Universal algebra: Fundamentals and selected topics, Taylor & Francis, ix+308pp., August 2011. 2. C. Bergman, R. Maddux, and D. Pigozzi (eds.), Algebraic logic and universal algebra in computer science, Lecture Notes in Computer Science, vol. 425, New York, Springer-Verlag, 1990. IN PRINT/ACCEPTED 1. Universal algebraic methods for constraint satisfaction problems, with W. DeMeo, Logical Methods in Computer Science, to appear. 2. Introducing Boolean semilattices, Don Pigozzi on Abstract Algebraic Logic and Universal Algebra, Springer-Verlag, (2018), 103–130. 3. Automorphism-primal algebras generate verbose varieties, Algebra Universalis 74 (2015), no. 1, 117– 122. 4. Measuring bias in cyclic random walks, with S. Sethuraman, Missouri J. Math. 25, (2013), 195–212. 5. C. Bergman and D. Failing, Commutative, idempotent groupoids and the constraint satisfaction prob- lem, Algebra Universalis 73 (2015), no. 3-4, 391–417. 6. Fully invariant and verbal congruence relations, with J. Berman, Algebra Universalis, 70, (2013), 71–94. 7. Computational complexity of generators and nongenerators in algebra, with G. Slutzki, Int. Jour. Algebra and Computation 12 (2002), no. 5, 719–735. 8. Computational complexity of some problems involving congruences on algebras, with G. Slutzki, Theoret. Comp. Sci., 270 (2002), 591–608. 9. Complexity of some problems concerning varieties and quasivarieties of algebras, with G. Slutzki, SIAM Jour. of Comput. 30 (2000), no. 2, 359–382. 10. Computational complexity of term-equivalence, with D. Juedes and G. Slutzki, Int. Jour. Algebra and Computation 9 (1999), no. 1, 113–128. 11. Categorical equivalence of modes, with J. Berman, Discussiones Mathematicae 19 (1999), 41–62. 12. Algorithms for categorical equivalence, with J. Berman, Math. Struc. Comp. Sci. 8 (1998), 1–15. 13. Categorical equvalence of algebras with a majority term, Algebra Universalis 40 (1998), 149–175. 14. Morita equivalence of almost-primal clones, with J. Berman, J. Pure Appl. Algebra 108 (1996), 175– 201. 15. Subquasivarieties of regualarized varieties, with A. Romanowska, Algebra Universalis 36 (1996), 536–563. 16. Structural completeness in algebra and logic, Algebraic Logic (H. Andreka,´ D. Monk, and I. Nemeti,´ eds.), Colloquia Mathematica Societatis Janos´ Bolyai, vol. 54, North-Holland, Amsterdam, 1991, pp. 59–73. 2 Clifford Bergman April 2019 17. Minimal varieties and quasivarieties, with R. McKenzie, Journal of the Australian Math. Soc., Series A 48 (1990), 133–147. 18. Non-axiomatizability of the amalgamation class of modular lattice varieties, Order 6 (1989), 49–58. 19. Residually small modular varieties with AP, Houston J. Math. 14 (1988), 451–464. 20. On the relationship of AP, RS, and CEP in congruence modular varieties, II, with R. McKenzie, Proc. Amer. Math. Soc. 103 (1988), 335–343. 21. Saturated algebras in filtral varieties, Algebra Universalis 24 (1987), 101–110. 22. On the relationship of AP, RS and CEP in modular varieties, Algebra Universalis 22 (1986), 164–171. 23. Amalgamation classes of some distributive varieties, Algebra Universalis 20 (1985), 143–166. 24. Deductive varieties of modules and related objects, with L. Hogben, Trans. Amer. Math. Soc. 289 (1985), 303–320. 25. The amalgamation class of a discriminator variety is finitely axiomatizable, Universal Algebra and Lattice Theory (R. Freese and O. Garcia, eds.), Springer-Verlag, New York, 1983, Lecture notes in Mathematics, vol. 1004, pp. 1–9. 26. How to cancel a linearly ordered exponent, with R. McKenzie and Zs. Nagy, Colloquia Mathematica Societatis Janos´ Bolyai, 29. Universal Algebra. Esztergom [Hungary], North-Holland Publishing Co., Amsterdam, 1977, pp. 87–93. SUBMITTED 1. Random models of linear idempotent Maltsev conditions, I, idemprimal algebras, with A. Szendrei. IN PREPARATION 1. Random models off linear idempotent Maltsev conditions, II, simple, paraprimal, and pure majority algebras, with A. Szendrei. 2. Semilattice sums of strongly irregular varieties, with A. Romanowska. 3. Boolean fans 4. Congruence k-permutability of Maltsev products, with J. Li. 5. Categorical equivalence and central relations, preprint, 1997. 6. Boolean Krasner algebras, preprint, 1996. CONFERENCE PROCEEDINGS/EXTENDED ABSTRACTS (REFEREED) 1. Joins and Maltsev Products of Congruence-Permutable Varieties, Algebras and Lattices in Hawaii, 2018. 2. An automatic, time-based, secure pairing protocol for passive RFID, with George T. Amariucai and Yong Guan, RFID. Security and Privacy, Lecture Notes in Computer Science, vol. 7055, Springer- Verlag, 2012, pp. 108–126. 3 Clifford Bergman April 2019 3. An artificial neural network for wavelet steganalysis, with J. Davidson and E. Bartlett, Optics and Photonics, Mathematical Methods in Pattern and Image Analysis, vol. 5916, SPIE, 2005, pp. 1–10. 4. Unitary embedding for data hiding with the SVD, with J. Davidson, Security, Steganography and Watermarking of Multimedia Contents VII, SPIE, 2005. 5. Computational complexity of some problems involving congruences on algebras, With G. Slutzki, Fifteenth Annual IEEE Symposium on Logic in Computer Science (Los Alamitos, CA), IEEE, IEEE Computer Society, 2000, pp. 168–174. 6. Complexity of some problems in universal algebra, with G. Slutzki, 16th Symposium on Theoretical Aspects of Computer Science (STACS ’99) (Berlin) (C. Meinel and S. Tison, eds.), Lecture Notes in Computer Science, vol. 1563, Springer-Verlag, 1999, pp. 163–172. OTHER PUBLICATIONS 1. ANNTS: artifical neural network technology for steganalysis, with E. Bartlett et al. 2. An artificial neural network for wavelet steganalysis, Tech. report, Midwest Forensics Resource Cen- ter, 2007, with J. Davidson. 3. MFRC stego database, 2 DVD discs, 2006, Available from Ames Laboratory, Iowa State University, Ames, Iowa 50011. 4. Proposed construction of a card verification number, Tech. report, Von Maur Department Stores, March 2005. 5. A survey of available cryptosystems, Tech. report, Science Applications International Corporation, 2004, Originally written for International Simulation and Training Systems, Ltd., 2002. 6. Revitalizing engineering calculus at Iowa State University, with E. Johnston, J. Mathews and A. Heckenbach, in “The Laboratory Approach to Teaching Calculus” (L. Leinbach et al., eds.), MAA Notes, vol. 20, Mathematical Association of America, 1991, pp. 169–186. 7. Algebraic logic and universal algebra in computer science, edited with R. Maddux and D. Pigozzi, Lecture Notes in Computer Science, vol. 425, New York, Springer-Verlag, 1990. 8. Concerning the amalgamation bases of congruence distributive equational classes, University of Cal- ifornia, Berkeley, 1981, Ph.D. Thesis. 4 Clifford Bergman April 2019 External Funding 1. Collaborative research: algebra and algorithms, structure and complexity theory, NSF, Sept. 2015– Aug. 2018, $99,881. REU Supplement, June 2016, $7,000. 2. REU Site: Iowa State University Mathematics REU, with L. Hogben, National Science Foundation, Feb. 2015–Jan. 2020, $348,115. 3. Information Assurance Scholarship for Service, with D. Jacobson, B. Licklider, J. Wiersma and J. Wong, National Science Foundation, Aug. 2013–July 2018, $2,182,241. 4. SFS Scholarships for Information Assurance Students, with D. Jacobson, B. Licklider, J. Wiersma and J. Wong, National Science Foundation, Aug. 2009–July 2012, $1,956,130. 5. SFS Scholarships for Information Assurance Students, with D. Jacobson, B. Licklider, J. Wiersma and J. Wong, National Science Foundation, Aug. 2005–July 2009, $888,008. 6. An Artifical Neural Network for Wavelet Steganalysis, Midwest Forensics Resource Center, $79,000 with J. Davidson, 7. Cyber Protection Lab, Industry/University Cooperative Research Center planning grant, National Sci- ence Foundation, August 2002, $10,000, with D. Jacobson, et al. 8. SFS Fellowships for Information Assurance Students, NSF-0113552, July 2001–June 2005, $2,626,026, PI (with J. Davis, D. Jacobson, C. Miller and J. Wong). 9. Information Assurance Educational Support Program, NSF-0113549, July 2001–June 2003, $199,998, PI (with J. Davis, D. Jacobson, S. Schmidt and J. Wong). 10. Integrated Security Curricula Modules, NSF EIA-9979985, Sept. 1999–Aug. 2002, $387,136, PI (with J. Davis, D. Jacobson, S. Russell and J. Wong). 11. Conference on Applications of Universal Algebra and Algebraic Logic to Computer Science, Institute for Mathematics and its Applications, Jan–June 1988, $1000, PI. 12. Conference on Applications of Universal Algebra and Algebraic Logic to Computer Science, Office of Naval Research, N00014–88–J–1182, Jan–June 1988, $2392, PI (with R. Maddux and D. Pigozzi). 13. Conference on Applications of Universal