Department of Mathematics and Computer Science

The Department of Mathematics and Computer Science offers programs of study leading to the Associate of Science in Core Curriculum degrees with a pathway in computer science or mathematics (http:// catalog.asurams.edu/undergraduate/degree-programs), along with bachelor of science degrees and minors in computer science and mathematics listed on the Programs tab above. The department also provides courses in support of the curriculums of other departments with the university. The minor programs are designed for those students interested in pursuing graduate study or the wide variety of careers in the fields of mathematics and computer science. Students in computer science may choose to concentrate in business, mathematics, information assurance, or add a minor in another discipline. To be admitted to the department as a major, the student must have a cumulative grade point average of 2.25 or higher. The department office is located in Billy C. Black Building room 130 (https://www.asurams.edu/ docs/duplicate/ASU-Campus-Map.pdf).

[1]  Ajay Joneja,et al.  Automated configuration of parametric feeding tools for mass customization , 1998 .

[2]  A. Federgruen,et al.  Denumerable state semi-markov decision processes with unbounded costs, average cost criterion : (preprint) , 1979 .

[3]  A. Federgruen,et al.  The optimality equation in average cost denumerable state semi-Markov decision problems, recurrency conditions and algorithms , 1978 .

[4]  P. Yip,et al.  Discrete Cosine Transform: Algorithms, Advantages, Applications , 1990 .

[5]  S. Winograd.  On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[6]  A. F. Veinott.  Discrete Dynamic Programming with Sensitive Discount Optimality Criteria , 1969 .

[7]  Karel Sladký,et al.  Sensitive Optimality Criteria in Countable State Dynamic Programming , 1977, Math. Oper. Res..

[8]  Joan L. Mitchell,et al.  JPEG: Still Image Data Compression Standard , 1992 .

[9]  Anne-Marie Kermarrec,et al.  The many faces of publish/subscribe , 2003, CSUR.

[10]  Ephraim Feig,et al.  Fast algorithms for the discrete cosine transform , 1992, IEEE Trans. Signal Process..

[11]  R. Sternberg,et al.  People's conceptions of intelligence. , 1981 .

[12]  D. Blackwell.  Discrete Dynamic Programming , 1962 .

[13]  Martin L. Puterman,et al.  Contracting Markov Decision Processes. (Mathematical Centre Tract 71.) , 1978 .

[14]  J. B. Lasserre,et al.  Conditions for Existence of Average and Blackwell Optimal Stationary Policies in Denumerable Markov Decision Processes , 1988 .

[15]  Arie Hordijk,et al.  Average, Sensitive and Blackwell Optimal Policies in Denumerable Markov Decision Chains with Unbounded Rewards , 1988, Math. Oper. Res..

[16]  Gerald Knezek,et al.  at University of North Texas , 2002 .

[17]  Flos Spieksma,et al.  The existence of sensitive optimal policies in two multi-dimensional queueing models , 1991 .

[18]  G.S. Moschytz,et al.  Practical fast 1-D DCT algorithms with 11 multiplications , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[19]  Gerti Kappel,et al.  A framework for workflow management systems based on objects, rules and roles , 2000, CSUR.

[20]  Stephen Hawley,et al.  Ordered dithering , 1990 .

[21]  James F. Blinn,et al.  What's that deal with the DCT? , 1993, IEEE Computer Graphics and Applications.

[22]  P. Schweitzer.  Perturbation theory and Markovian decision processes. , 1965 .

[23]  Ephraim Feig,et al.  Fast scaled-DCT algorithm , 1990, Other Conferences.

[24]  Martin Vetterli,et al.  A Discrete Fourier-Cosine Transform Chip , 1986, IEEE J. Sel. Areas Commun..

[25]  Margaret A. Eastwood,et al.  Implementing mass customization , 1996 .

[26]  B. L. Miller.  Finite state continuous time Markov decision processes with an infinite planning horizon , 1968 .

[27]  M. Vetterli,et al.  Simple FFT and DCT algorithms with reduced number of operations , 1984 .

[28]  Peter Johannes Neugebauer,et al.  Geometrical cloning of 3D objects via simultaneous registration of multiple range images , 1997, Proceedings of 1997 International Conference on Shape Modeling and Applications.

[29]  Wil M. P. van der Aalst,et al.  Design and Implementation of the YAWL System , 2004, CAiSE.

[30]  Y. Arai,et al.  A Fast DCT-SQ Scheme for Images , 1988 .

[31]  Elke Mann,et al.  Optimality equations and sensitive optimality in bounded Markov decision processes 1 , 1985 .

[32]  Katsuhiko Sakaue,et al.  Registration and integration of multiple range images for 3-D model construction , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[33]  G. Klimov.  Time-Sharing Service Systems. I , 1975 .

[34]  Ramaswamy Chandramouli,et al.  The Queen's Guard: A Secure Enforcement of Fine-grained Access Control In Distributed Data Analytics Platforms , 2001, ACM Trans. Inf. Syst. Secur..

[35]  Manfred Schäl,et al.  On the Second Optimality Equation for Semi-Markov Decision Models , 1992, Math. Oper. Res..

[36]  J Jaap Wessels,et al.  Markov decision processes with unbounded rewards , 1977 .

[37]  Mark J. Pavicic,et al.  Convenient anti-aliasing filters that minimize “bumpy” sampling , 1990 .

[38]  K. Mardia,et al.  A review of image-warping methods , 1998 .

[39]  C. Hart.  Mass customization: conceptual underpinnings, opportunities and limits , 1995 .

[40]  C. Derman.  DENUMERABLE STATE MARKOVIAN DECISION PROCESSES: AVERAGE COST CRITERION. , 1966 .

[41]  Linn I. Sennott,et al.  Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs , 1989, Oper. Res..

[42]  Soren W. Henriksen,et al.  Manual of photogrammetry , 1980 .

[43]  M Salive,et al.  Misadministration of topical bovine thrombin. , 1999, JAMA.

[44]  Rommert Dekker,et al.  Recurrence Conditions for Average and Blackwell Optimality in Denumerable State Markov Decision Chains , 1992, Math. Oper. Res..

[45]  W. Campbell,et al.  THE UNIVERSITY OF TEXAS AT DALLAS , 2004 .

[46]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[47]  Manfred SchÄl,et al.  Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal , 1975 .

[48]  Pavel Krsek,et al.  The Trimmed Iterative Closest Point algorithm , 2002, Object recognition supported by user interaction for service robots.

[49]  Gérard G. Medioni,et al.  Object modelling by registration of multiple range images , 1992, Image Vis. Comput..

[50]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[51]  William C. Miller,et al.  On Computing the Discrete Cosine Transform , 1978, IEEE Transactions on Computers.

[52]  E. Brigham,et al.  The fast Fourier transform and its applications , 1988 .

[53]  C. Spearman,et al.  "THE ABILITIES OF MAN". , 1928, Science.

[54]  E. Denardo.  Markov Renewal Programs with Small Interest Rates , 1971 .

[55]  Ken Turkowski,et al.  Filters for common resampling tasks , 1990 .

[56]  Michael J. Kay.  Making mass customization happen: Lessons for implementation , 1993 .

[57]  Paul J. Schweitzer,et al.  Denumerable Undiscounted Semi-Markov Decision Processes with Unbounded Rewards , 1983, Math. Oper. Res..

[58]  Hans Deppe,et al.  On the Existence of Average Optimal Policies in Semiregenerative Decision Models , 1984, Math. Oper. Res..

[59]  Gerard Zwaan,et al.  A Taxonomy of Sublinear Multiple Keyword Pattern Matching Algorithms , 1996, Sci. Comput. Program..

[60]  S. Ross.  NON-DISCOUNTED DENUMERABLE MARKOVIAN DECISION MODELS , 1968 .

[61]  Stanley M. Davis,et al.  From “future perfect”: Mass customizing , 1989 .

[62]  Connie U. Smith,et al.  Software Performance Engineering: A Case Study Including Performance Comparison with Design Alternatives , 1993, IEEE Trans. Software Eng..

[63]  Mike Morton,et al.  A digital “dissolve” effect , 1990 .

[64]  Sing Bing Kang,et al.  Registration and integration of textured 3-D data , 1997, Proceedings. International Conference on Recent Advances in 3-D Digital Imaging and Modeling (Cat. No.97TB100134).

[65]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

[66]  S. Kotha.  Mass Customization: The New Frontier in Business Competition , 1992 .

[67]  B. L. Miller,et al.  Discrete Dynamic Programming with a Small Interest Rate , 1969 .

[68]  Takeo Kanade,et al.  Real-time 3-D pose estimation using a high-speed range sensor , 1993, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[69]  J. Bather.  Optimal decision procedures for finite markov chains. Part I: Examples , 1973, Advances in Applied Probability.

[70]  Gregory K. Wallace,et al.  The JPEG still picture compression standard , 1992 .

[71]  T. Kientzle,et al.  IMPLEMENTING FAST DCTS , 1999 .

[72]  J. Harrison.  Discrete Dynamic Programming with Unbounded Rewards , 1972 .

[73]  Donald E. Knuth,et al.  Digital halftones by dot diffusion , 1987, TOGS.

[74]  Michael zur Muehlen,et al.  Organizational Management in Workflow Applications - Issues and Perspectives , 2004, Inf. Technol. Manag..

[75]  B. L. Miller,et al.  An Optimality Condition for Discrete Dynamic Programming with no Discounting , 1968 .

[76]  R. Weber,et al.  Optimal control of service rates in networks of queues , 1987, Advances in Applied Probability.

[77]  Harvey F. Silverman,et al.  An introduction to programming the Winograd Fourier transform algorithm (WFTA) , 1977 .

[78]  S. Kotha.  Mass customization: Implementing the emerging paradigm for competitive advantage , 1995 .

[79]  Shaler Stidham,et al.  Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs , 1989, Oper. Res..

[80]  Dale A. Schumacher.  FAST ANAMORPHIC IMAGE SCALING , 1991 .

[81]  Martin D. Levine,et al.  Registering Multiview Range Data to Create 3D Computer Objects , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[82]  Berthold K. P. Horn,et al.  Closed-form solution of absolute orientation using unit quaternions , 1987 .

[83]  R. Tolimieri,et al.  The tensor product: a mathematical programming language for FFTs and other fast DSP operations , 1992, IEEE Signal Processing Magazine.

[84]  D. Blackwell.  Discounted Dynamic Programming , 1965 .

[85]  Linn I. Sennott,et al.  Average Cost Semi-Markov Decision Processes and the Control of Queueing Systems , 1989, Probability in the Engineering and Informational Sciences.

[86]  Dale A. Schumacher.  A COMPARISON OF DIGITAL HALFTONING TECHNIQUES , 1991 .

[87]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[88]  Elisa Bertino,et al.  The specification and enforcement of authorization constraints in workflow management systems , 1999, TSEC.

[89]  R. R. Krausz.  Living in Groups , 2013 .