Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (4407)
- TÜBİTAK (1233)
- Purdue University (1089)
- Old Dominion University (945)
- Missouri University of Science and Technology (916)
-
- University of Nebraska - Lincoln (870)
- Air Force Institute of Technology (846)
- Wright State University (817)
- San Jose State University (616)
- Dartmouth College (581)
- Edith Cowan University (567)
- Brigham Young University (506)
- California Polytechnic State University, San Luis Obispo (448)
- City University of New York (CUNY) (444)
- University of Texas at El Paso (387)
- Technological University Dublin (367)
- Portland State University (354)
- New Jersey Institute of Technology (342)
- University of Central Florida (333)
- Washington University in St. Louis (313)
- Embry-Riddle Aeronautical University (311)
- China Simulation Federation (308)
- Nova Southeastern University (295)
- Kennesaw State University (280)
- University of Arkansas, Fayetteville (266)
- Utah State University (259)
- University of South Florida (252)
- University of Texas at Arlington (252)
- Zayed University (252)
- Syracuse University (245)
- Keyword
-
- Machine learning (1031)
- Deep learning (593)
- Artificial intelligence (509)
- Machine Learning (497)
- Security (364)
-
- Computer Science (342)
- Deep Learning (292)
- Artificial Intelligence (261)
- Classification (260)
- Cybersecurity (243)
- Computer vision (229)
- Department of Computer Science and Engineering (211)
- Privacy (211)
- Neural networks (205)
- Algorithms (203)
- Data mining (193)
- Natural language processing (186)
- Computer science (181)
- Applied sciences (171)
- College for Professional Studies (165)
- Software engineering (163)
- School of Computer & Information Science (150)
- Simulation (146)
- AI (142)
- Optimization (138)
- Blockchain (133)
- Image processing (133)
- Natural Language Processing (133)
- Clustering (128)
- Education (123)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (4205)
- Theses and Dissertations (1686)
- Turkish Journal of Electrical Engineering and Computer Sciences (1233)
- Department of Computer Science Technical Reports (906)
- Master's Projects (565)
-
- Computer Science Faculty Publications (435)
- Computer Science Technical Reports (404)
- Computer Science Faculty Research & Creative Works (385)
- Electronic Theses and Dissertations (385)
- Dissertations (362)
- The R Journal (353)
- Faculty Publications (351)
- Journal of System Simulation (308)
- CCAC Theses and Dissertations (277)
- Browse all Theses and Dissertations (262)
- Theses (253)
- All Works (252)
- USF Tampa Graduate Theses and Dissertations (230)
- Computer Science Faculty Publications and Presentations (229)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (217)
- Masters Theses (215)
- Computer Science & Engineering Syllabi (214)
- Departmental Technical Reports (CS) (212)
- Walden Dissertations and Doctoral Studies (210)
- Master's Theses (209)
- All Computer Science and Engineering Research (205)
- Kno.e.sis Publications (196)
- Computer Science and Software Engineering (180)
- Open Access Theses & Dissertations (171)
- Regis University Student Publications (comprehensive collection) (166)
- Publication Type
Articles 27451 - 27480 of 27587
Full-Text Articles in Entire DC Network
Measuring Improvements In Program Clarity, Ronald D. Gordon
Measuring Improvements In Program Clarity, Ronald D. Gordon
Department of Computer Science Technical Reports
No abstract provided.
Map: A Pascal Macro Preprocessor For Large Program Development, Douglas E. Comer
Map: A Pascal Macro Preprocessor For Large Program Development, Douglas E. Comer
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - February 1978, Wofford College Computer Center
Terminal Talk - The Wofford Connection - February 1978, Wofford College Computer Center
Terminal Talk
No abstract provided.
Dialectics And Catastrophe, Martin Zwick
Dialectics And Catastrophe, Martin Zwick
Complex Systems Faculty Publications and Presentations
The three classical principles of Hegelian and Marxist dialectics, (1) the transformation of quantity into quality, (2) the unity and struggle of opposites, and (3) the negation of negation, can be modeled with the Catastrophe Theory of René Thom and E. C. Zeeman, especially with the ‘elementary catastrophes’ known as the cusp and the butterfly.
Quantum Measurement And Gödel's Proof, Martin Zwick
Quantum Measurement And Gödel's Proof, Martin Zwick
Complex Systems Faculty Publications and Presentations
The measurement problem in quantum mechanics has the character of a fundamental incompleteness within that theory similar to the incompleteness of axiomatic systems in mathematics, discovered and elaborated by Gödel and others. The difficulty of describing the measurement process by the time-dependent Schrodinger equation may reflect the limitations of formal language , and quantum theory may thus require a formalism consisting of two levels of description, one for the dynamics and one for measurement, levels whose relationship resembles that of a calculus and meta-calculus.
The Complexity Of Numerical Methods For Elliptic Partial Differential Equations, Elias N. Houstis
The Complexity Of Numerical Methods For Elliptic Partial Differential Equations, Elias N. Houstis
Department of Computer Science Technical Reports
No abstract provided.
Further Validation Of An Error Hypothesis, Linda M. Ottenstein
Further Validation Of An Error Hypothesis, Linda M. Ottenstein
Department of Computer Science Technical Reports
No abstract provided.
Computer Systems Modeling, Measurement And Evaluation: Project Report 1976-1977, Peter J. Denning, Saul Rosen, Herbert D. Schwetman
Computer Systems Modeling, Measurement And Evaluation: Project Report 1976-1977, Peter J. Denning, Saul Rosen, Herbert D. Schwetman
Department of Computer Science Technical Reports
No abstract provided.
A Software Science Analysis Of The Writing Of A Technical Paper, M. H. Halstead
A Software Science Analysis Of The Writing Of A Technical Paper, M. H. Halstead
Department of Computer Science Technical Reports
No abstract provided.
Development And Application Of Computer Assisted Instruction For Mini-Computers, Thomas A. Burne
Development And Application Of Computer Assisted Instruction For Mini-Computers, Thomas A. Burne
Masters Theses
No abstract provided.
Nonlinear Approximation - Final Report For Nsf Grant Gp-3294ox, John R. Rice
Nonlinear Approximation - Final Report For Nsf Grant Gp-3294ox, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
A Consciousness Simulation Model, R. Edward Mitchell Jr.
A Consciousness Simulation Model, R. Edward Mitchell Jr.
Theses
The thesis titled "A Consciousness Simulation Model" by R. Edward Mitchell (1977) explores the theoretical design of a digital model aimed at simulating human consciousness. The model is structured around a collection of independent processing modules that mimic various human cognitive and emotional processes. These modules include components for thought selection, ego/achievement, memory, and emotion processing, which interact with one another in a fashion that simulates aspects of human thought and behavior.
Mitchell's primary goal is to develop a system that could behave more like a human, particularly in communication and decision-making processes, to improve human-machine interaction. The thesis highlights …
Dual-Mode Sequential Logic For Function Independent Fault-Testing, Sumit Dasgupta, Carlos R.P. Hartmann, Luther D. Rudolph
Dual-Mode Sequential Logic For Function Independent Fault-Testing, Sumit Dasgupta, Carlos R.P. Hartmann, Luther D. Rudolph
Electrical Engineering and Computer Science - Technical Reports
This paper presents a method of using hardware redundancy to ease the problem of fault testing in sequential logic networks. Sequential logic networks are constructed using two kinds of dual-mode logic gates, one of which is specifically required to initialize a feedback loop to some logic value. Initially, it is shown that these networks can be tested for all single stuck-at-faults with six function-independent tests. Next, this method is generalized to detect large classes of multiple faults with six function-independent tests. In both cases, the network must have the proper number of extra inputs.
A Time- And Space-Efficient Garbage Compaction Algorithm, F. Lockwood Morris
A Time- And Space-Efficient Garbage Compaction Algorithm, F. Lockwood Morris
Electrical Engineering and Computer Science - Technical Reports
Given an area of storage containing scattered marked nodes, one may wish to rearrange them into a compact mass at one end of the area, meanwhile revising all pointers to marked nodes to show their new locations. An algorithm is here described which accomplishes this task in Iinear time relative to the size of the storage area, and in space of the order of one bit for each pointer. The algorithm operates by reversibly encoding the situation that a collection of locations point to a single location by a linear list, emanating from the pointed-to location, passing through the pointing …
Dual-Mode Combinational Logic For Function-Independent Fault Testing, Sumit Dasgupta
Dual-Mode Combinational Logic For Function-Independent Fault Testing, Sumit Dasgupta
Electrical Engineering and Computer Science - Technical Reports
This paper presents a method of using hardware redundancy to ease the problem of fault testing in combinational logic networks. Combinational logic networks are constructed using dual-mode logic gates. Initially, it is shown that these networks can be tested for all single stuck-at-faults using just two function-independent tests. This method is then extended to detect a large class of multiple faults with the same two function-independent tests.
A Compiler Extension Theorem For Lucid, Christoph M. Hoffmann
A Compiler Extension Theorem For Lucid, Christoph M. Hoffmann
Department of Computer Science Technical Reports
No abstract provided.
Software For Numerical Computation, John R. Rice
Software For Numerical Computation, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Epistemology To Ontology, Charles R. Hampton
Epistemology To Ontology, Charles R. Hampton
ACMS Journal 2004
This paper argues for mathematicians thinking about the philosophy of math, especially Christians. It briefly sketches the limitations of formalism, intuitionism, and logicism and uses Christian concept of creation to argue that one can take the best of each of these philosophies and avoid the pitfalls. It also argues for the real existence of mathematical objects apart from the human mind.
Recent Parallels Between The Philosophy Of Science And Mathematics, Joseph Spradley
Recent Parallels Between The Philosophy Of Science And Mathematics, Joseph Spradley
ACMS Journal 2004
Following World War I European philosophy of science formed an alliance with mathematics culminating in an attitude of certainty and autonomy that rejected all non empirical claims to truth and purported to make all science presupposition less. The rise and fall of logical positivism has been one of the major themes of of twentieth century thought and illustrates the danger of placing too much emphasis on science and mathematics as an ideal for all knowledge. The restriction of rational inquiry to the modes of scientific verification and the processes of mathematical logic was far too confining for the containment of …
Diagnosis Of Faults In Linear Tree Networks, Sharad C. Seth, K. L. Kodandapani
Diagnosis Of Faults In Linear Tree Networks, Sharad C. Seth, K. L. Kodandapani
School of Computing: Faculty Publications
The problem of fault detection and location in tree networks of two input EXCLUSIVE-OR (EOR) gates is considered. The fault model assumes that an EOR gate can change to any other function of its two inputs except the equivalence function. An efficient procedure for single fault location is presented. In the worst case the number of tests necessary to locate single faults is bounded by a linear function of the number of input variables. Constructive upper bounds are obtained for the number of tests to detect multiple faults. Optimality of these bounds is argued and extension of results to other …
A Computer Based Information System For The Study Of Multi-Component Populations In South Carolina, Louise Ramsey Andres
A Computer Based Information System For The Study Of Multi-Component Populations In South Carolina, Louise Ramsey Andres
MUSC Theses and Dissertations
The information system accepts data on multi-component populations in South Carolina, and produces distribution maps, histograms, tables and other summary displays. The initial application illustrated is to the population of insects in the family Tabanid in South Carolina. The system is a series of FORTRAN programs written for an IBM System 360 Model 40 under DOS.
Data Base Concepts For System Analysis, Thomas I. M. Ho
Data Base Concepts For System Analysis, Thomas I. M. Ho
Department of Computer Science Technical Reports
No abstract provided.
Multi-Dimensional Clustering For Data Base Organizations, J. H. Liou, S. B. Yao
Multi-Dimensional Clustering For Data Base Organizations, J. H. Liou, S. B. Yao
Department of Computer Science Technical Reports
No abstract provided.
Efficient Recursive Parsing, Christoph M. Hoffmann
Efficient Recursive Parsing, Christoph M. Hoffmann
Department of Computer Science Technical Reports
No abstract provided.
Real Time Generation Of Min Distance Strings, Peter J. Denning
Real Time Generation Of Min Distance Strings, Peter J. Denning
Department of Computer Science Technical Reports
No abstract provided.
Some Results On Arithmetic Codes Of Composite Length, Tai-Yang Hwang, Carlos R.P. Hartmann
Some Results On Arithmetic Codes Of Composite Length, Tai-Yang Hwang, Carlos R.P. Hartmann
Electrical Engineering and Computer Science - Technical Reports
In this paper we present a new upper bound on the minimum distance of binary cyclic arithmetic codes of composite length. Two new classes of binary cyclic codes of composite length are introduced.
Evaluation Of Numerical Methods For Elliptic Partial Differential Equations, Elias N. Houstis, Robert E. Lynch, T. S. Papatheodorou, J. R. Rice
Evaluation Of Numerical Methods For Elliptic Partial Differential Equations, Elias N. Houstis, Robert E. Lynch, T. S. Papatheodorou, J. R. Rice
Department of Computer Science Technical Reports
No abstract provided.
The Terminal Process, Kevin E. Kolis, John B. Lohse, Peter Radtke, Robert Sedlemeyer, Ronald D. Bedford
The Terminal Process, Kevin E. Kolis, John B. Lohse, Peter Radtke, Robert Sedlemeyer, Ronald D. Bedford
Department of Computer Science Technical Reports
No abstract provided.
Predicting The Number Of Bugs Expected In A Program Module, Linda M. Ottenstein, Victor B. Schneider, Maurice H. Halstead
Predicting The Number Of Bugs Expected In A Program Module, Linda M. Ottenstein, Victor B. Schneider, Maurice H. Halstead
Department of Computer Science Technical Reports
No abstract provided.
A Hierarchical Access Model For Data Base Organizations, S. B. Yao
A Hierarchical Access Model For Data Base Organizations, S. B. Yao
Department of Computer Science Technical Reports
No abstract provided.