Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9004)
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (2694)
- Purdue University (2077)
-
- Old Dominion University (1996)
- Missouri University of Science and Technology (1926)
- University of Nebraska - Lincoln (1739)
- Edith Cowan University (1285)
- Air Force Institute of Technology (1277)
- University of Texas at El Paso (1174)
- Kennesaw State University (1161)
- Dartmouth College (1102)
- San Jose State University (1053)
- City University of New York (CUNY) (956)
- Embry-Riddle Aeronautical University (949)
- Washington University in St. Louis (830)
- Brigham Young University (823)
- Technological University Dublin (816)
- 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 (571)
- Syracuse University (531)
- University of Nebraska at Omaha (497)
- University of Central Florida (490)
- Keyword
-
- Machine learning (1664)
- Artificial intelligence (1018)
- Deep learning (1003)
- Machine Learning (755)
- Computer Science (702)
-
- Security (648)
- Cybersecurity (556)
- Artificial Intelligence (483)
- Deep Learning (432)
- Computer science (412)
- Privacy (410)
- Simulation (391)
- Technical Reports (390)
- UTEP Computer Science Department (389)
- Classification (374)
- Algorithms (356)
- Optimization (352)
- Computer vision (349)
- Neural networks (345)
- Data mining (337)
- AI (298)
- Natural language processing (292)
- Department of Computer Science and Engineering (291)
- Engineering (269)
- Education (268)
- Reinforcement learning (259)
- Blockchain (255)
- Cloud computing (255)
- College for Professional Studies (253)
- Software engineering (252)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8459)
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Theses and Dissertations (2731)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Computer Science Faculty Publications (928)
- 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 (568)
- 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 (403)
- USF Tampa Graduate Theses and Dissertations (378)
- Neutrosophic Systems with Applications (375)
- Computer Science and Engineering Theses - Archive (365)
- Computer Science: Faculty Publications (364)
- Browse all Theses and Dissertations (359)
- Publication Type
Articles 62731 - 62760 of 62979
Full-Text Articles in Entire DC Network
Approximating The Number Of Blocks Accessed In Data Base Organizations, S. B. Yao
Approximating The Number Of Blocks Accessed In Data Base Organizations, S. B. Yao
Department of Computer Science Technical Reports
No abstract provided.
Statistical Computing - The Vanguard Of The Future Of Education, John R. Rice
Statistical Computing - The Vanguard Of The Future Of Education, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
An Efficient Dft Algorithm Using The Walsh Transform, Albert P. Gerheim
An Efficient Dft Algorithm Using The Walsh Transform, Albert P. Gerheim
Electrical & Computer Engineering Theses & Dissertations
The matrix transformation relating the sequency and frequency domains is derived. It is shown that these frequency-to-frequency conversion can be performed via a computationally efficient sparse matrix algorithm. The sequency-to-frequency algorithm can be used with a fast Hadamard transform to implement a discrete Fourier trans form. The efficiencies of this combined algorithm and a radix-two fast Fourier transform are compared.
The algorithm is applied to the sequency domain de sign of a Wiener digital filter. Improved computational efficiencies are achieved relative to the procedure developed by Kahveci and Hall (9).
On The Derivation Of Lattice Structured Information Flow Policies, Dorothy E. Denning, Peter J. Denning, G. Scott Graham
On The Derivation Of Lattice Structured Information Flow Policies, Dorothy E. Denning, Peter J. Denning, G. Scott Graham
Department of Computer Science Technical Reports
No abstract provided.
Certification Of Programs For Secure Information Flow, Dorothy E. Denning, Peter J. Denning
Certification Of Programs For Secure Information Flow, Dorothy E. Denning, Peter J. Denning
Department of Computer Science Technical Reports
No abstract provided.
System Analysis Perspectives, Thomas I. M. Ho
System Analysis Perspectives, Thomas I. M. Ho
Department of Computer Science Technical Reports
No abstract provided.
Generalized Working Sets For Segment Reference Strings, Peter J. Denning, Donald R. Slutz
Generalized Working Sets For Segment Reference Strings, Peter J. Denning, Donald R. Slutz
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - January 1976, Wofford College Computer Center
Terminal Talk - The Wofford Connection - January 1976, Wofford College Computer Center
Terminal Talk
No abstract provided.
The Definition Of Programming Languages, J. A. Robinson
The Definition Of Programming Languages, J. A. Robinson
Electrical Engineering and Computer Science - Technical Reports
There is no need to argue in favor of concise, clear, complete, consistent, descriptions of programming languages, nor to recite the cost in time, energy, money, and effectiveness which is incurred when a description falls short of these standards. Reliable, high-quality computer programming is impossible without a clear and precise understanding of the language in which the programs are written—this being true quite independently of the merits of a language as a language. In this study we tried to discover the current state of the methodology of definition of programming languages. We sought to separate the question (as far as …
Computer Layout And Design Of Grain Storage Facilities, Otto J. Loewer Jr., Thomas C. Bridges, Douglas G. Overhults
Computer Layout And Design Of Grain Storage Facilities, Otto J. Loewer Jr., Thomas C. Bridges, Douglas G. Overhults
Biosystems and Agricultural Engineering Faculty Publications
No abstract provided.
Qsim2: A Low-Budget Heuristic Approach To Modeling And Forecasting, Wayne Wakeland
Qsim2: A Low-Budget Heuristic Approach To Modeling And Forecasting, Wayne Wakeland
Complex Systems Faculty Publications and Presentations
This paper contains a description of a simple mathematical framework and modeling process which can be used to study a large class of socio-techno-natural systems. Models may be designed using intuitive notions or data to help specify the variables, parameters and interrelationships, which, with the aid of a computer program, can be used to forecast system behavior under various assumptions. Two example models are described.
Facility Costs Of Centralized Grain Storage Systems Utilizing Computer Design, Otto J. Loewer Jr., Thomas C. Bridges, Douglas G. Overhults
Facility Costs Of Centralized Grain Storage Systems Utilizing Computer Design, Otto J. Loewer Jr., Thomas C. Bridges, Douglas G. Overhults
Biosystems and Agricultural Engineering Faculty Publications
The item considered most often when estimating the cost of a grain storage facility is capacity. Of equal or greater importance is daily harvest rate. Other important considerations include drying method, materials handling equipment, energy cost, facility arrangement, labor requirements, grain quality and management ability. Only through a comparison of facilities which offer similar capacity, capability and convenience can the purchaser obtain his best system.
Algorithmic Progress In Solving Partial Differential Equations, John R. Rice
Algorithmic Progress In Solving Partial Differential Equations, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Computer Manpower In The United States - Supply And Demand, John Wesley Hamblen
Computer Manpower In The United States - Supply And Demand, John Wesley Hamblen
Computer Science Faculty Research & Creative Works
At a time when new departments of computer science, data processing, information science, information systems, etc. are being created and existing departments are trying to grow and compete with more established disciplines for scarce resources, it seems imperative that we attempt to keep abreast of the needs of industry and government for the graduates of these programs. This need must be monitored and matched against the production of graduates at all appropriate levels. The author has assembled extensive data on the latter over the past eight years while at the Southern Regional Education Board in Atlanta, GA (USA) during the …
Use Of Optical Character Recognition In The Invoice Processing System Of The Michigan Medicaid Program, Richard F. Burns
Use Of Optical Character Recognition In The Invoice Processing System Of The Michigan Medicaid Program, Richard F. Burns
Masters Theses
No abstract provided.
Using A Programmable Calculator To Introduce Fundamental Concepts Of Assembly Language Programming, H. D. Schwetman
Using A Programmable Calculator To Introduce Fundamental Concepts Of Assembly Language Programming, H. D. Schwetman
Department of Computer Science Technical Reports
No abstract provided.
The Dependence Of Operating System Size Upon Allocatable Resources, Atilla Elci
The Dependence Of Operating System Size Upon Allocatable Resources, Atilla Elci
Department of Computer Science Technical Reports
No abstract provided.
The Hodie Method: A Brief Introduction With Summary Of Computational Properties, Robert E. Lynch, John R. Rice
The Hodie Method: A Brief Introduction With Summary Of Computational Properties, Robert E. Lynch, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
An Experiment Comparing Fortran Programming Times With The Software Physics Hypothesis, R. D. Gordon, M. H. Halstead
An Experiment Comparing Fortran Programming Times With The Software Physics Hypothesis, R. D. Gordon, M. H. Halstead
Department of Computer Science Technical Reports
No abstract provided.
Algorithm - Adapt, Adaptive Smooth Curve Fitting, John R. Rice
Algorithm - Adapt, Adaptive Smooth Curve Fitting, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Remarks On Piecewise Polynomial Approximation, John R. Rice
Remarks On Piecewise Polynomial Approximation, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Selection Of File Organization Using An Analytic Model, S. B. Yao, A. G. Merten
Selection Of File Organization Using An Analytic Model, S. B. Yao, A. G. Merten
Department of Computer Science Technical Reports
No abstract provided.
Reorganization Points For File Designs With Nonlinear Processing Costs, K. Sundar Das, T. J. Teorey, S. B. Yao
Reorganization Points For File Designs With Nonlinear Processing Costs, K. Sundar Das, T. J. Teorey, S. B. Yao
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - September 1975, Wofford College Computer Center
Terminal Talk - The Wofford Connection - September 1975, Wofford College Computer Center
Terminal Talk
No abstract provided.
An Optimum Symbol-By Symbol Decoding Rule For Linear Codes, Carlos R.P. Hartmann, Luther D. Rudolph
An Optimum Symbol-By Symbol Decoding Rule For Linear Codes, Carlos R.P. Hartmann, Luther D. Rudolph
Electrical Engineering and Computer Science - Technical Reports
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive to high rate codes. Examples are given for both block and convolutional codes.
Two Models For Combinatory Logic, Luis E. Sanchis
Two Models For Combinatory Logic, Luis E. Sanchis
Electrical Engineering and Computer Science - Technical Reports
We consider in this paper two models of combinatoric logic in which the domain is the same : P(N) the power set of N = the set of non negative integers.
Some Insights Into Deterministic Scheduling Problems Involving Multiple Resources And Preemption, K. Omahen
Some Insights Into Deterministic Scheduling Problems Involving Multiple Resources And Preemption, K. Omahen
Department of Computer Science Technical Reports
No abstract provided.
An Endogenous Priority Model For Load Control In Combined Batch—Interactive Computer Systems, Carl E. Landwehr
An Endogenous Priority Model For Load Control In Combined Batch—Interactive Computer Systems, Carl E. Landwehr
Department of Computer Science Technical Reports
No abstract provided.
The Computation And Use Of Optimal Paging Curves, Peter J. Denning
The Computation And Use Of Optimal Paging Curves, Peter J. Denning
Department of Computer Science Technical Reports
No abstract provided.
Some Results On The Weight Structure Of Cyclic Codes Of Composite Length, Carlos R.P. Hartmann, T. Y. Hwang
Some Results On The Weight Structure Of Cyclic Codes Of Composite Length, Carlos R.P. Hartmann, T. Y. Hwang
Electrical Engineering and Computer Science - Technical Reports
In this work we investigate the weight structure of cyclic codes of composite length n = n1n2, where n1 and n2 are relatively prime. The actual minimum distances of some classes of binary cyclic codes of composite length are derived. For other classes new lower bounds on the minimum distance are obtained. These new lower bounds improve on the BCH bound for a considerable number of binary cyclic codes.