Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (5822)
- China Simulation Federation (3924)
- TÜBİTAK (2852)
- Missouri University of Science and Technology (1081)
- University of Nebraska - Lincoln (1079)
-
- Old Dominion University (931)
- Edith Cowan University (824)
- Embry-Riddle Aeronautical University (693)
- Zayed University (683)
- Wright State University (648)
- Purdue University (560)
- University of Texas at El Paso (523)
- Technological University Dublin (457)
- Kennesaw State University (435)
- San Jose State University (371)
- Walden University (368)
- Dartmouth College (316)
- Marquette University (273)
- New Jersey Institute of Technology (264)
- Karbala International Journal of Modern Science (259)
- University of Nebraska at Omaha (257)
- City University of New York (CUNY) (256)
- MMU Press (252)
- Brigham Young University (238)
- Neutrosophic Systems with Applications (232)
- Smith College (208)
- Chulalongkorn University (207)
- Syracuse University (203)
- California Polytechnic State University, San Luis Obispo (198)
- Portland State University (196)
- Keyword
-
- Machine learning (854)
- Artificial intelligence (609)
- Deep learning (592)
- Machine Learning (351)
- Security (323)
-
- Cybersecurity (280)
- Computer Science (266)
- Artificial Intelligence (242)
- Simulation (240)
- Privacy (231)
- Classification (230)
- Deep Learning (212)
- Optimization (204)
- Neural networks (186)
- Data mining (182)
- Natural language processing (174)
- Technical Reports (166)
- UTEP Computer Science Department (166)
- AI (162)
- Blockchain (161)
- Computer science (156)
- Reinforcement learning (156)
- Cloud computing (155)
- Algorithms (154)
- Feature extraction (145)
- Social media (143)
- Clustering (142)
- Genetic algorithm (140)
- Engineering (133)
- Computer vision (131)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (5570)
- Journal of System Simulation (3924)
- Turkish Journal of Electrical Engineering and Computer Sciences (2852)
- The R Journal (708)
- All Works (681)
-
- Computer Science Faculty Research & Creative Works (590)
- Computer Science Faculty Publications (531)
- Journal of Digital Forensics, Security and Law (481)
- Departmental Technical Reports (CS) (469)
- Department of Computer Science Technical Reports (456)
- Theses and Dissertations (420)
- Walden Dissertations and Doctoral Studies (365)
- Faculty Publications (339)
- Master's Projects (288)
- Karbala International Journal of Modern Science (259)
- Computer Science Technical Reports (254)
- Dissertations (253)
- Journal of Informatics and Web Engineering (252)
- Kno.e.sis Publications (232)
- Neutrosophic Systems with Applications (232)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (207)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (201)
- Research outputs 2022 to 2026 (197)
- Computer Science Faculty Publications and Presentations (194)
- Conference papers (190)
- Articles (187)
- Computer Science: Faculty Publications (170)
- Electrical and Computer Engineering Faculty Research & Creative Works (168)
- Computer Science and Engineering Faculty Publications (149)
- Journal of Cybersecurity Education, Research and Practice (149)
- Publication Type
Articles 31711 - 31740 of 31843
Full-Text Articles in Entire DC Network
Interface Issues In A Software Parts Technology, John R. Rice, Herbert D. Schwetman
Interface Issues In A Software Parts Technology, John R. Rice, Herbert D. Schwetman
Department of Computer Science Technical Reports
No abstract provided.
The String-To-String Correction Problem With Block Moves, Walter F. Tichy
The String-To-String Correction Problem With Block Moves, Walter F. Tichy
Department of Computer Science Technical Reports
No abstract provided.
Small Systems, Dirk Siefkes
Small Systems, Dirk Siefkes
Department of Computer Science Technical Reports
No abstract provided.
Parallel Strong Orientation Of An Undirected Graph, Mikhail J. Atallah
Parallel Strong Orientation Of An Undirected Graph, Mikhail J. Atallah
Department of Computer Science Technical Reports
No abstract provided.
A Graph Orientation Problem, Mikhail J. Atallah
A Graph Orientation Problem, Mikhail J. Atallah
Department of Computer Science Technical Reports
No abstract provided.
Computing As A Part Of A P.H.D Students Education: A Position Paper, Andrew D. Bailey, Rayman D. Meservy
Computing As A Part Of A P.H.D Students Education: A Position Paper, Andrew D. Bailey, Rayman D. Meservy
Faculty Publications
The skills and abilities associated with computer literacy are becoming required tools for accounting Ph.D. students. Not only are new doctoral students entering Ph.D. programs with better skills, they are also applying these skills more on a day to day basis. This paper presents a brief discussion of a number of issues associated with computer use and computer literacy in general. The paper also presents several aspects of the Ph.D. program at the University of Minnesota and how computers are affecting the program.
Course Syllabus: Perspectives On Computers And Society, Judith V. Grabiner
Course Syllabus: Perspectives On Computers And Society, Judith V. Grabiner
Pitzer Faculty Publications and Research
Weizenbaum's statement is a compelling exhortation to his fellow professionals; nevertheless, I cannot wholly agree. It should be possible for nonprofessionals to understand, as a result of their own reading and experience, how computers interact with the rest of human life. The problems are not just technical, and their nature is not entirely unprecedented.
Ua66/16/2 Ogden Instructional Computing Newsletter, Vol. 3, No. 1, Wku Mathematics & Computer Science
Ua66/16/2 Ogden Instructional Computing Newsletter, Vol. 3, No. 1, Wku Mathematics & Computer Science
WKU Administration Documents
Newsletter created by the Ogden Computer Laboratory to promote services, courses, hardware, software and student activities.
Comparison Of Steady-State Pipe Network Computer Programs, Michael Bernice Holloway
Comparison Of Steady-State Pipe Network Computer Programs, Michael Bernice Holloway
Civil & Environmental Engineering Theses & Dissertations
Four widely used computer programs for the analysis of steady state flows in pipe networks are compared. These programs are NEWTH, written by Jeppson; KENTUCKY, written by Wood; FLOW, written by Epp and Fowler; and LIQSS, written by Stoner. Differences, similarities, advantages and disadvantages of these programs, and various options available are discussed for the benefit of possible future users. In addition, the efficiency of NEWTH, KENTUCKY, and FLOW was tested by simulating a typical network by each program. The listing of LIQSS was not available, and thus was not included in this comparison. In simulation, KENTUCKY used over twice …
A Hidden-Line Algorithm For Hyperspace, Robert P. Burton, David R. Smith
A Hidden-Line Algorithm For Hyperspace, Robert P. Burton, David R. Smith
Faculty Publications
An object-space hidden-line algorithm for higher-dimensional scenes has been designed and implemented. Scenes consist of convex hulls of any dimension, each of which is compared against the edges of all convex hulls not eliminated by a hyperdimensional clipper, a depth test after sorting and a minimax text. Hidden and visible elements are determined in accordance with the dimensionality of the selected viewing hyperspace. When shape alone is the attribute of interest, hidden-line elimination need be performed only in that hyperspace. The algorithm is of value in the production of shadows of hyperdimensional models, including but not limited to four-dimensional space-time …
A Theory Of Small Program Complexity, Kenneth I. Magel
A Theory Of Small Program Complexity, Kenneth I. Magel
Computer Science Faculty Research & Creative Works
Small programs are those which are written and understood by one. person. Large software systems usually consist of many small programs. The complexity of a small program is a prediction of how difficult it would be for someone to understand the program. This complexity depends of three factors: (1) the size and interelationships of the program itself; (2) the size and interelationships of the internal model of the program's purpose held by the person trying to understand the program; and (3) the complexity of the mapping between the model and the program. A theory of small program complexity based on …
An Approximation Theory For Conjugate Surfaces And Solutions Of Elliptic Multiple Integral Problems: Application To Numerical Solutions Of Generalized Laplace's Equation, John Gregory, Ralph W. Wilkerson
An Approximation Theory For Conjugate Surfaces And Solutions Of Elliptic Multiple Integral Problems: Application To Numerical Solutions Of Generalized Laplace's Equation, John Gregory, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
An Approximation Theory is Given for a Class of Elliptic Quadratic Forms Which Include the Study of Conjugate Surfaces for Elliptic Multiple Integral Problems. These Ideas Follow from the Quadratic Form Theory of Hestenes, Applied to Multiple Integral Problems by Dennemeyer, and Extended with Applications for Approximation Problems by Gregory. the Application of This Theory to a Variety of Approximation Problem Areas in This Setting is Given. These Include Conjugate Surfaces and Conjugate Solutions in the Calculus of Variations, Oscillation Problems for Elliptic Partial Differential Equations, Eigenvalue Problems for Compact Operators, Numerical Approximation Problems, And, Finally, the Intersection of These …
Fault Coverage Requirement In Production Testing Of Lsi Circuits, Vishwani D. Agrawal, Sharad C. Seth, Prathima Agrawal
Fault Coverage Requirement In Production Testing Of Lsi Circuits, Vishwani D. Agrawal, Sharad C. Seth, Prathima Agrawal
School of Computing: Faculty Publications
A technique is described for evaluating the effectiveness of production tests for large scale integrated (LSI) circuit chips. It is based on a model for the distribution of faults on a chip. The model requires two parameters, the average number (n0) of faults on a faulty chip and the yield (y) of good chips. It is assumed that the yield either is known or can be calculated from the available formulas. The other parameter, n0, is determined from an experimental procedure. Once the model is fully characterized, it allows calculation of the field …
Robotics And The Conservation Of Human Resources, Robert U. Ayres, Steven M. Miller
Robotics And The Conservation Of Human Resources, Robert U. Ayres, Steven M. Miller
Research Collection School Of Computing and Information Systems
Due to rapid expansion in the field of robotics, policy issues have arisen in regard to developing human skills to deal with the new technology and to deal with the obsolescent human skills which are the inevitable result of this growth pattern. Industrialists, educators, union leaders, and government officials must work cooperatively to insure that the coming changes are made with minimum disruption. Improved training methods and courses have to be developed for the skills needed to control, manage and supervise the new machines. Some of the ways in which this can be accomplished are through offering financial incentives for …
The Purdue Multimachine Pipeline: A High Bandwidth Machine Network And Programming Environment For Research In Large Scale Computation, Douglas E. Comer, Peter J. Denning, John R. Rice, Lawrence Snyder
The Purdue Multimachine Pipeline: A High Bandwidth Machine Network And Programming Environment For Research In Large Scale Computation, Douglas E. Comer, Peter J. Denning, John R. Rice, Lawrence Snyder
Department of Computer Science Technical Reports
No abstract provided.
The Flat File Database Generator Ffg, Douglas E. Comer
The Flat File Database Generator Ffg, Douglas E. Comer
Department of Computer Science Technical Reports
No abstract provided.
Problems With Cobol--Some Empirical Evidence, D. M. Volpano, Herbert E. Dunsmore
Problems With Cobol--Some Empirical Evidence, D. M. Volpano, Herbert E. Dunsmore
Department of Computer Science Technical Reports
No abstract provided.
The Development Of Algebraic Structures During The Nineteenth Century, Richard Stout
The Development Of Algebraic Structures During The Nineteenth Century, Richard Stout
ACMS Conference Proceedings 1981
I remember entering the faculty lounge one day while I was in graduate school and hearing a logician chiding some of the algebraists in the room. He said, "Don't you fellows ever get tired of just plus and times?" His remark, said in jest, had more to it than he may have realized. The fact that there is structure to algebra, represented by plus and times, was a vital discovery in the nineteenth century. It would lead algebra away from a reliance on numbers to a much more formal approach, one in which many different types of algebraic structures could …
Mathematics As Rhyme, Vern Poythress
Mathematics As Rhyme, Vern Poythress
ACMS Conference Proceedings 1981
Using the analogy between the universe and a choral poem, one may view mathematics as the “rhyme” of the universe. In that perspective new light is thrown on the unique subject matter of mathematics, the a priori character of its truths, and the relation of mathematics to other areas of knowledge. A route is thereby opened for richer use of creativity in mathematics.
Science As Allegory, Vern Poythress
Science As Allegory, Vern Poythress
ACMS Conference Proceedings 1981
The universe is God’s choral poem, and science is a system of allegories within it. That is the thesis that I propose to expound and defend. Yet it is not a “thesis” at all, if the word “thesis” commits me to a certain kind of strict logical defense. I am not putting forward my thesis that science is allegory as the endpoint of a deductive or inductive argument. Rather, it is a springboard for a program of exploration and reflection that turns upside-down some conventional ways of thinking about science.
An Investigation Of The Relationship Between Initial And Final Programming Effort Estimates, Andrew S. Wang
An Investigation Of The Relationship Between Initial And Final Programming Effort Estimates, Andrew S. Wang
Department of Computer Science Technical Reports
No abstract provided.
Pmva - Purdue Mean Value Analysis Program User's Guide, Jeff Brumfield
Pmva - Purdue Mean Value Analysis Program User's Guide, Jeff Brumfield
Department of Computer Science Technical Reports
No abstract provided.
A Topological Analysis Of The Complexity Of Computer Programs With Less Than Three Binary Branches, Warren Harrison, Kenneth I. Magel
A Topological Analysis Of The Complexity Of Computer Programs With Less Than Three Binary Branches, Warren Harrison, Kenneth I. Magel
Computer Science Faculty Research & Creative Works
No abstract provided.
Recommendations For Master's Level Programs In Computer Science: A Report Of The Acm Curriculum Committee On Computer Science, Kenneth I. Magel, Richard H. Austing, Alfs Berztiss, Gerald L. Engel, John Wesley Hamblen, A. A.J. Hoffmann, Robert Mathis
Recommendations For Master's Level Programs In Computer Science: A Report Of The Acm Curriculum Committee On Computer Science, Kenneth I. Magel, Richard H. Austing, Alfs Berztiss, Gerald L. Engel, John Wesley Hamblen, A. A.J. Hoffmann, Robert Mathis
Computer Science Faculty Research & Creative Works
The ACM Committee on Curriculum in Computer Science has spent two years investigating master's degree programs in Computer Science. This report contains the conclusions of that effort. Recommendations are made concerning the form, entrance requirements, possible courses, staffing levels, intent, library resources, and computing resources required for an academic, professional, or specialized master's degree. These recommendations specify minimum requirements which should be met by any master's programs. The Committee believes that the details of a particular master's program should be determined and continually updated by the faculty involved. A single or a small number of model programs are not as …
A Model For Representing Families Of Programmed System, Walter F. Richy
A Model For Representing Families Of Programmed System, Walter F. Richy
Department of Computer Science Technical Reports
No abstract provided.
Regular Expressions In A Program Complexity Metric, Kenneth I. Magel
Regular Expressions In A Program Complexity Metric, Kenneth I. Magel
Computer Science Faculty Research & Creative Works
No abstract provided.
A Complexity Measure Based On Nesting Level, Warren A. Harrison, Kenneth I. Magel
A Complexity Measure Based On Nesting Level, Warren A. Harrison, Kenneth I. Magel
Computer Science Faculty Research & Creative Works
No abstract provided.
A Suggested Course In Introductory Computer Programming, Warren A. Harrison, Kenneth I. Magel
A Suggested Course In Introductory Computer Programming, Warren A. Harrison, Kenneth I. Magel
Computer Science Faculty Research & Creative Works
Introductory programming courses have long been a popular topic of discussion. Often it is either the only computer course a student takes, or it is the foundation upon which all further training in computer science is built. The usual goal of such a course is to introduce the student to the use of a computer to solve simple problems in his or her particular discipline. Generally, the method of presenting the material may be separated into two distinct schools of thought, which we have termed the "Black Box School of Thought" and the "White Box School of Thought". In this …
Lsi Product Quality And Fault Coverage, Vishwani D. Agrawal, Sharad C. Seth, Prathima Agrawal
Lsi Product Quality And Fault Coverage, Vishwani D. Agrawal, Sharad C. Seth, Prathima Agrawal
School of Computing: Conference and Workshop Papers
At present, the relationship between fault coverage of LSl circuit tests and the tested product quality is not satisfactorily understood. Reported work on integrated circuits predicts, for an acceptable field reject rate, a fault coverage that is too high (99 percent or higher). This fault coverage is difficult to achieve for LSl circuits. This paper proposes a model of fault distribution for a chip. The number of faults on a defective chip is assumed to have a Poisson density for which the average value is determined through experiment on actual chips. The procedure, which relates the model to the chip …
The Double Eigenvalue Problem; Including Numerical Solutions, John Gregory, Ralph W. Wilkerson
The Double Eigenvalue Problem; Including Numerical Solutions, John Gregory, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
No abstract provided.