Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9042)
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (2694)
- Purdue University (2077)
-
- Old Dominion University (2018)
- Missouri University of Science and Technology (1926)
- University of Nebraska - Lincoln (1739)
- Edith Cowan University (1291)
- Air Force Institute of Technology (1278)
- University of Texas at El Paso (1198)
- Kennesaw State University (1163)
- Dartmouth College (1105)
- San Jose State University (1053)
- City University of New York (CUNY) (958)
- Embry-Riddle Aeronautical University (950)
- Washington University in St. Louis (830)
- Brigham Young University (823)
- Technological University Dublin (817)
- California Polytechnic State University, San Luis Obispo (788)
- Zayed University (677)
- University of Texas at Arlington (666)
- University for Business and Technology in Kosovo (637)
- Portland State University (625)
- Chulalongkorn University (618)
- Nova Southeastern University (577)
- New Jersey Institute of Technology (573)
- Syracuse University (532)
- University of Nebraska at Omaha (497)
- University of Central Florida (494)
- Keyword
-
- Machine learning (1675)
- Artificial intelligence (1031)
- Deep learning (1013)
- Machine Learning (778)
- Computer Science (719)
-
- Security (650)
- Cybersecurity (562)
- Artificial Intelligence (496)
- Deep Learning (453)
- Computer science (412)
- Privacy (410)
- Simulation (391)
- Technical Reports (390)
- UTEP Computer Science Department (389)
- Classification (378)
- Algorithms (358)
- Optimization (353)
- Computer vision (352)
- Neural networks (347)
- Data mining (337)
- AI (305)
- Natural language processing (294)
- Department of Computer Science and Engineering (291)
- Engineering (269)
- Education (267)
- Reinforcement learning (261)
- Blockchain (255)
- Cloud computing (255)
- College for Professional Studies (253)
- Software engineering (252)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8495)
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Theses and Dissertations (2734)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Computer Science Faculty Publications (938)
- Departmental Technical Reports (CS) (914)
- Computer Science Faculty Research & Creative Works (907)
- Master's Projects (859)
- Computer Science Technical Reports (772)
- The R Journal (708)
- All Computer Science and Engineering Research (683)
- All Works (675)
- Faculty Publications (663)
- C-Day Computing Showcase (653)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (618)
- Dissertations (573)
- Electronic Theses and Dissertations (567)
- Kno.e.sis Publications (542)
- Journal of Digital Forensics, Security and Law (536)
- CCAC Theses and Dissertations (512)
- Walden Dissertations and Doctoral Studies (469)
- Computer Science Faculty Publications and Presentations (404)
- Theses (404)
- USF Tampa Graduate Theses and Dissertations (398)
- Neutrosophic Systems with Applications (380)
- Computer Science and Engineering Theses - Archive (365)
- Browse all Theses and Dissertations (359)
- Computer Science: Faculty Publications (351)
- Publication Type
Articles 63031 - 63060 of 63327
Full-Text Articles in Entire DC Network
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.
Operational Analysis Of Queueing Networks, Peter J. Denning, Jeffrey P. Buzen
Operational Analysis Of Queueing Networks, Peter J. Denning, Jeffrey P. Buzen
Department of Computer Science Technical Reports
No abstract provided.
High Accuracy Finite Difference Approximation To Solutions Of Elliptic Partial Differential Equations, Robert E. Lynch, John R. Rice
High Accuracy Finite Difference Approximation To Solutions Of Elliptic Partial Differential Equations, Robert E. Lynch, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
O(H^6) Accurate Finite Difference Approximation To Solutions Of The Poisson Equation In Three Variables, Robert E. Lynch
O(H^6) Accurate Finite Difference Approximation To Solutions Of The Poisson Equation In Three Variables, Robert E. Lynch
Department of Computer Science Technical Reports
No abstract provided.
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.
Software For Linear Elliptic Problems On General Two Dimensional Domains, Elias N. Houstis, John R. Rice
Software For Linear Elliptic Problems On General Two Dimensional Domains, Elias N. Houstis, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
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.
Heuristics For Trie Index Minimization, Douglas E. Comer
Heuristics For Trie Index Minimization, Douglas E. Comer
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 Problems In The Foundations Of Mathematics, Terence H. Perciante
Recent Problems In The Foundations Of Mathematics, Terence H. Perciante
ACMS Journal 2004
This paper examines the foundational crises that have haunted twentieth-century mathematics, beginning with a brief review of the effects generated by Gauss, Lobachevsky, and Bolyai who each developed non-Euclidean parallel axiom. Though of mathematical interest in their own right, the significance of the new geometries was greatly magnified when it was discerned that they could be used to adequately model physical space, even to the extent that Einstein’s theory of relativity later employed as its model a non-Euclidean geometry developed by Riemann. The question that obviously presented itself was how could any given geometry be called true when it and …
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 …
Superconcentrators, Nicholas Pippenger
Superconcentrators, Nicholas Pippenger
All HMC Faculty Publications and Research
An $n$-superconcentrator is an acyclic directed graph with $n$ inputs and $n$ outputs for which, for every $r \leqq n$, every set of $r$ inputs, and every set of $r$ outputs, there exists an $r$-flow (a set of $r$ vertex-disjoint directed paths) from the given inputs to the given outputs. We show that there exist $n$-superconcentrators with $39n + O(\log n)$ (in fact, at most $40n$) edges, depth $O(\log n)$, and maximum degree (in-degree plus out-degree) 16.
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.
Comparison Of Fast Direct Methods For Elliptic Problems, Elias N. Houstis, T. S. Papatheordorou
Comparison Of Fast Direct Methods For Elliptic Problems, Elias N. Houstis, T. S. Papatheordorou
Department of Computer Science Technical Reports
No abstract provided.
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.
Reliability Growth Apportionment, James K. Byers
Reliability Growth Apportionment, James K. Byers
Computer Science Faculty Research & Creative Works
A method is presented for apportioning reliability growth to the subsystems that make up a system in order to achieve the required reliability at least cost. Reliability growth apportionment is handled as an s-expected cost minimization problem subject to the constraint of meeting a system reliability requirement. The problem is formulated in terms of Duane's reliability growth model and is solved using geometric programming. The method can be useful in the early stages of system design to determine subsystem reliability growth that will allow a system reliability requirement to be met, and in the latter stages of system design when …
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.
Analysis Of A Heuristic For Full Trie Minimization, Douglas E. Comer
Analysis Of A Heuristic For Full Trie Minimization, Douglas E. Comer
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.
New Perspectives For Information Systems Education, Thomas I. M. Ho
New Perspectives For Information Systems Education, Thomas I. M. Ho
Department of Computer Science Technical Reports
No abstract provided.
Proving Protection Systems Safe, D. E. Denning, P. J. Denning, S. J. Garland, M. A. Harrison, W.L. Ruzzo
Proving Protection Systems Safe, D. E. Denning, P. J. Denning, S. J. Garland, M. A. Harrison, W.L. Ruzzo
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.
Linear Queries In Statistical Data Bases, M. D. Swartz, D. E. Denning, P. J. Denning
Linear Queries In Statistical Data Bases, M. D. Swartz, D. E. Denning, P. J. Denning
Department of Computer Science Technical Reports
No abstract provided.
Ellpack--A Cooperative Effort For The Study Of Numerical Methods For Elliptic Partial Differential Equations, John R. Rice
Ellpack--A Cooperative Effort For The Study Of Numerical Methods For Elliptic Partial Differential Equations, John R. Rice
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.
Data Types As Lattices: Retractions, Closures, And Projections, Luis E. Sanchis
Data Types As Lattices: Retractions, Closures, And Projections, Luis E. Sanchis
Electrical Engineering and Computer Science - Technical Reports
This paper considers the mathematical principals of lattice theory oriented toward the theory of computation.
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.