Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (7312)
- China Simulation Federation (3382)
- TÜBİTAK (3020)
- Selected Works (2644)
- Wright State University (2602)
-
- Purdue University (2057)
- Old Dominion University (1458)
- Missouri University of Science and Technology (1371)
- Edith Cowan University (1173)
- Air Force Institute of Technology (1108)
- University of Texas at El Paso (1105)
- University of Nebraska - Lincoln (1091)
- Dartmouth College (1022)
- San Jose State University (995)
- Embry-Riddle Aeronautical University (853)
- City University of New York (CUNY) (819)
- Brigham Young University (812)
- Technological University Dublin (791)
- Washington University in St. Louis (785)
- California Polytechnic State University, San Luis Obispo (732)
- Kennesaw State University (714)
- University for Business and Technology in Kosovo (626)
- University of Texas at Arlington (614)
- Nova Southeastern University (535)
- Portland State University (531)
- SelectedWorks (527)
- Western University (525)
- New Jersey Institute of Technology (516)
- Syracuse University (501)
- University of Nebraska at Omaha (485)
- Keyword
-
- Machine learning (1342)
- Deep learning (801)
- Artificial intelligence (663)
- Machine Learning (652)
- Computer Science (637)
-
- Security (619)
- Computer science (434)
- Privacy (409)
- Cybersecurity (407)
- Simulation (379)
- Classification (369)
- Technical Reports (369)
- UTEP Computer Science Department (367)
- Data mining (351)
- Deep Learning (350)
- Algorithms (338)
- Optimization (337)
- Neural networks (308)
- Artificial Intelligence (299)
- Computer vision (290)
- Education (254)
- Software engineering (254)
- College for Professional Studies (253)
- Clustering (251)
- Cloud computing (244)
- Department of Computer Science and Engineering (243)
- Applied sciences (237)
- School of Computer & Information Science (236)
- Visualization (236)
- Natural language processing (233)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (6960)
- Journal of System Simulation (3382)
- Turkish Journal of Electrical Engineering and Computer Sciences (3020)
- Theses and Dissertations (2511)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Departmental Technical Reports (CS) (892)
- Master's Projects (845)
- Electronic Theses and Dissertations (738)
- Computer Science Faculty Publications (725)
- All Computer Science and Engineering Research (683)
- Computer Science Technical Reports (673)
- Computer Science Faculty Research & Creative Works (601)
- Faculty Publications (588)
- Kno.e.sis Publications (543)
- Journal of Digital Forensics, Security and Law (536)
- Computer Science Faculty Publications and Presentations (509)
- Dissertations (505)
- CCE Theses and Dissertations (488)
- All Works (478)
- Walden Dissertations and Doctoral Studies (468)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (462)
- Masters Theses (402)
- Computer Science and Engineering Theses (356)
- Electronic Thesis and Dissertation Repository (334)
- Theses (334)
- Computer Science and Software Engineering (332)
- USF Tampa Graduate Theses and Dissertations (320)
- Computer Science: Faculty Publications (318)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (315)
- Publication Type
Articles 58111 - 58140 of 58260
Full-Text Articles in Physical Sciences and Mathematics
Digital Computer Solution Of Electromagnetic Transients In Large Power Systems, Bijan Navidbakhsh
Digital Computer Solution Of Electromagnetic Transients In Large Power Systems, Bijan Navidbakhsh
Dissertations and Theses
This thesis is an introduction to the solution of electromagnetic transients by a combination of the Bergeran method of characteristics and the application of trapezoidal rule of integration.
Three test examples solved by digital computer illustrate the step by step solution and computer programming.
To compare this method with the Laplace transformation technique, a test problem solved by both methods and also digital computer is illustrated. In conclusion, the advantages and disadvantages of both methods are compared.
The Education Of A Computer: Development Of Computer-Assisted Instruction Of German Grammar, Karen Wintringham
The Education Of A Computer: Development Of Computer-Assisted Instruction Of German Grammar, Karen Wintringham
Senior Scholar Papers
Characteristic of the acquisition of most skills, the learning of a foreign language requires formalized, systematic training. Computer-assisted instruction provides the necessary individualized drill with accompanying reinforcement. The "BASIC" CAI course, MODALS, represents the culmination of nine months of research and programming of the instruction of German modal auxiliaries; the complex of sixty seven interconnected sub -programs provide drill of all six modals in five different tenses. Subsequent to the in-class introduction of new lecture material concerning the modals, any student may then proceed to the computer terminal, there undertaking further study of the subject. MODALS lacks an answer recording …
The Monadic Second-Order Theory Of Ordinals W Sub 2, J. Richard Buchi, Charles Zaiontz
The Monadic Second-Order Theory Of Ordinals W Sub 2, J. Richard Buchi, Charles Zaiontz
Department of Computer Science Technical Reports
No abstract provided.
Modeling A Large Online File System, John Pomeranz
Modeling A Large Online File System, John Pomeranz
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - February 1973, Wofford College Computer Center
Terminal Talk - The Wofford Connection - February 1973, Wofford College Computer Center
Terminal Talk
No abstract provided.
A Novel Method Of Constructing Sorting Networks, Robert M. Keller
A Novel Method Of Constructing Sorting Networks, Robert M. Keller
All HMC Faculty Publications and Research
The construction of sorting networks has been a topic of much recent discussion. In view of the apparent difficulty of verifying whether a reasonably large proposed sorting network actually does sort, the most useful approach for constructing large networks seems to be to devise a recursive scheme which constructs a network which is guaranteed to sort, obviating the verification phase. In this note, another such approach is presented.
Finite Dimensional Group Rings, Ralph W. Wilkerson
Finite Dimensional Group Rings, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
A Ring is Right Finite Dimensional If It Contains No Infinite Direct Sum of Right Ideals. We Prove that If a Group G is Finite, Free Abelian, or Finitely Generated Abelian, then a Ring R is Right Finite Dimensional If and Only If the Group Ring RG is Right Finite Dimensional. a Ring R is a Self-Injective Cogenerator Ring If Rn is Injective and RR is a Cogenerator in the Category of Unital Right /{-Modules; This Means that Each Right Unital A-Module Can Be Embedded in a Direct Product of Copies of R. Let G Be a Finite Group Where …
Monte Carlo Simulation Of Confidence Intervals For Reliability, Kathryn Palisch Berkbigler
Monte Carlo Simulation Of Confidence Intervals For Reliability, Kathryn Palisch Berkbigler
Masters Theses
"A computer program which computes fiducial confidence intervals for reliability by Monte Carlo simulation has been written. The program has the capability of computing these intervals for general systems of series, parallel, and mixed series and parallel subsystems which have failure time distributions which are either exponential, Weibull, gamma, normal, or lognormal.
Comparison of the simulation technique with a Bayesian technique for computing confidence intervals in the case of a series of exponentially distributed components shows that the two methods agree quite well when a fiducial prior distribution for reliability is used in the Bayesian technique. A uniform prior distribution …
Mando : A Computer Program For Symbolic Manipulation Of Differential Operators Generating Continuous Transformations, David Kenneth Davison
Mando : A Computer Program For Symbolic Manipulation Of Differential Operators Generating Continuous Transformations, David Kenneth Davison
University of the Pacific Theses and Dissertations
The program MANDO efficiently performs computations involving pairs of operators, a single operator, and operators applied to functions, saving time and cost over pencil-·and-paper methods.
A versatile but compact data structure, defined under SPIT-BOL's facility for creation of datatypes, contains the operators (and functions) and provides a means for systematically referencing their relevant parts.
On input, functions and operators are written in a restricted but natural string format, for which the program can readily convert them to the internal data structure.
Central to the method of operation of the derivative routine is its ability to differentiate a function written as …
Toward A Generalized Krohn-Rhodes Theory, Robert Yacobellis
Toward A Generalized Krohn-Rhodes Theory, Robert Yacobellis
Robert H Yacobellis
No abstract provided.
On The Decomposition Of Asynchronous Systems, Robert M. Keller
On The Decomposition Of Asynchronous Systems, Robert M. Keller
All HMC Faculty Publications and Research
This paper reports of part of a continuing investigation of parallel computation, in particular, efforts toward understanding the nature of different types of parallel control. The first section defines an asynchronous system to be a simple type of state machine. This was arrived at in an attempt to generalize from the types of control in parallel program schemata and networks of asynchronous modules without bounded delays. Asynchronous systems with output are also defined in a familiar way. The deviation from standard work comes in the definition of a parallel decomposition of asynchronous systems. Some preliminary work on compositions of this …
Terminal Talk - The Wofford Connection - September 1972, Wofford College Computer Center
Terminal Talk - The Wofford Connection - September 1972, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection - August 1972, Wofford College Computer Center
Terminal Talk - The Wofford Connection - August 1972, Wofford College Computer Center
Terminal Talk
No abstract provided.
Moment-Curvature-Thrust Relationships In Hybrid Members, Douglas Wrenn Fiala
Moment-Curvature-Thrust Relationships In Hybrid Members, Douglas Wrenn Fiala
Dissertations and Theses
In order to overcome the difficulties encountered in closed form solutions, moment-curvature-thrust relationships are developed for hybrid and nonhybrid cross sections utilizing an open form method. The use of horizontal sectors permits the inclusion of residual stresses and/or nonbilinear stress-strain relationships, if desired. Theoretical and experimental data are compared. Applications to circular tubes and other cross sections are discussed. Results indicate that open form solutions are feasible for calculating moment-curvature-thrust data. Hybrid cross sections are easily treated by open form solutions.
Terminal Talk - The Wofford Connection - June 1972, Wofford College Computer Center
Terminal Talk - The Wofford Connection - June 1972, Wofford College Computer Center
Terminal Talk
No abstract provided.
A Planning And Cost Allocation Procedure For Computer System Management, J. Nunamaker, A. Whinston
A Planning And Cost Allocation Procedure For Computer System Management, J. Nunamaker, A. Whinston
Department of Computer Science Technical Reports
No abstract provided.
Generalized Finite-Geometry Codes, Carlos R.P. Hartmann, Luther D. Rudolph
Generalized Finite-Geometry Codes, Carlos R.P. Hartmann, Luther D. Rudolph
Electrical Engineering and Computer Science - Technical Reports
A technique is presented for constructing cyclic codes that retain many of the combinatorial properties of finite-geometry codes, but are often superior to geometry codes. It is shown that L-step orthogonalization is applicable to certain subclasses of these codes.
Digital Computer Modeling Of Limestone Groundwater Systems, John Thrailkill, David P. Beiter
Digital Computer Modeling Of Limestone Groundwater Systems, John Thrailkill, David P. Beiter
KWRRI Research Reports
Because limestone groundwater flows mainly In discrete openings, limestone aquifers are fundamentally different from aquifers In granular rocks. A digital computer program which simulates flow in a limestone aquifer as a pipe network was written and compared with the Sinkhole Plain aquifer of west-central Kentucky.
A reasonably good fit between observed parameters of the aquifer and those calculated were obtained under assumed conditions of both laminar and turbulent now In the aquifer. The Indicated gross permeablllty of the aquifer is 5600 melnzers with an assumed aquifer thickness of 100 feet. The location and discharge of springs along the streams bounding …
Decoding By Sequential Code Reduction, Luther D. Rudolph, Carlos R.P. Hartmann
Decoding By Sequential Code Reduction, Luther D. Rudolph, Carlos R.P. Hartmann
Electrical Engineering and Computer Science - Technical Reports
A general decoding method for cyclic codes is presented which gives promise of substantially reducing the complexity of decoders at the cost of a modest increase in decoding time (or delay). Significant reductions in decoder complexity for binary cyclic finite-geometry codes are demonstrated, and two decoding options for the Golay code are presented.
Software Simulation Of The D17b Computer, Bruce Chatterton
Software Simulation Of The D17b Computer, Bruce Chatterton
Theses and Dissertations
A software program has been written which simulates the functions of the Minuteman D17B computer at the register transfer level. The simulation program is written in the FORTRAN Extended language to be used on the Intercom System (teletype) of a CDC 6600 computer system. The simulation program consists of a main program and eight subroutines. A programming language for the D17B simulation was formed which contains numbers and load codes, switches, and miscellaneous commands. Example programs run on the simulated computer have been included to show the types of output available.
Mathematical Foundations For Structured Programming, Harlan D. Mills
Mathematical Foundations For Structured Programming, Harlan D. Mills
The Harlan D. Mills Collection
No abstract provided.
Terminal Talk - The Wofford Connection - February 1972, Wofford College Computer Center
Terminal Talk - The Wofford Connection - February 1972, Wofford College Computer Center
Terminal Talk
No abstract provided.
Some Results On The Best Match Problem, Luther D. Rudolph, Kishan Mehrotra, Ralph J. Longobardi
Some Results On The Best Match Problem, Luther D. Rudolph, Kishan Mehrotra, Ralph J. Longobardi
Electrical Engineering and Computer Science - Technical Reports
The "best-match problem" is concerned with the complexity of finding the best match between a randomly chosen query word and the members of a randomly chosen set of data words. Of principal interest is whether it is possible to significantly reduce the search time required, as compared to exhaustive comparison, by use of memory redundancy (file structure). Minskv and Papert conjecture that "the speed-up values of large memory redundancies is very small, and for large data sets with long word lengths there are no practical alternatives to large searches that inspect large parts of memory". For this report we present …
A Note On Orders Of Enumeration, John Helm, Albert Meyer, Paul Young
A Note On Orders Of Enumeration, John Helm, Albert Meyer, Paul Young
Department of Computer Science Technical Reports
No abstract provided.
A Methodology For The Design And Optimization Of Information Processing Systems, J. F. Nunamaker
A Methodology For The Design And Optimization Of Information Processing Systems, J. F. Nunamaker
Department of Computer Science Technical Reports
No abstract provided.
The Myhill Functor, Input-Reduced Machines, And Generalised Krohn-Rhodes Theory, Robert H. Yacobellis
The Myhill Functor, Input-Reduced Machines, And Generalised Krohn-Rhodes Theory, Robert H. Yacobellis
Computer Science: Faculty Publications and Other Works
No abstract provided.
Computerized Registration For High Schools, Kenneth Lee Fore
Computerized Registration For High Schools, Kenneth Lee Fore
Masters Theses
"The guidance personnel in a high school are often burdened with the duty of hand scheduling the student's courses. Using the computer as a sub-optimizing tool in the registration of students, however, can cut scheduling time dramatically and relieve the guidance department of an onerous chore. The technique described in this investigation uses a conflict matrix that schedules the student's request and keeps the class load level within the course sections. A search of the schedule array for each course request may uncover a conflict. If no conflict occurs the course is scheduled and the remaining courses for this student …
Terminal Talk - The Wofford Connection - December 1971, Wofford College Computer Center
Terminal Talk - The Wofford Connection - December 1971, Wofford College Computer Center
Terminal Talk
No abstract provided.
Symmetric Binary B-Trees: Data Structure And Algorithms For Random And Sequential Information Processing, Rudolf Bayer
Symmetric Binary B-Trees: Data Structure And Algorithms For Random And Sequential Information Processing, Rudolf Bayer
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - October 1971, Wofford College Computer Center
Terminal Talk - The Wofford Connection - October 1971, Wofford College Computer Center
Terminal Talk
No abstract provided.