Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9025)
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (2694)
- Purdue University (2077)
-
- Old Dominion University (2003)
- Missouri University of Science and Technology (1927)
- 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 (1162)
- Dartmouth College (1105)
- San Jose State University (1053)
- City University of New York (CUNY) (956)
- Embry-Riddle Aeronautical University (950)
- 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 (532)
- University of Nebraska at Omaha (497)
- University of Central Florida (490)
- Keyword
-
- Machine learning (1665)
- Artificial intelligence (1024)
- Deep learning (1004)
- Machine Learning (762)
- Computer Science (713)
-
- Security (648)
- Cybersecurity (558)
- Artificial Intelligence (487)
- Deep Learning (437)
- Computer science (412)
- Privacy (410)
- Simulation (391)
- Technical Reports (390)
- UTEP Computer Science Department (389)
- Classification (375)
- Algorithms (357)
- Optimization (353)
- Computer vision (350)
- Neural networks (346)
- Data mining (337)
- AI (305)
- Natural language processing (293)
- Department of Computer Science and Engineering (291)
- Engineering (269)
- Education (268)
- Reinforcement learning (260)
- Cloud computing (255)
- Blockchain (254)
- College for Professional Studies (253)
- Software engineering (252)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8479)
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Theses and Dissertations (2733)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Computer Science Faculty Publications (930)
- 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 (570)
- 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)
- Browse all Theses and Dissertations (359)
- Computer Science: Faculty Publications (351)
- Publication Type
Articles 59791 - 59820 of 63093
Full-Text Articles in Entire DC Network
Objects To The Rescue! Or Httpd: The Next Generation Operating System, Andrew P. Black, Jonathan Walpole
Objects To The Rescue! Or Httpd: The Next Generation Operating System, Andrew P. Black, Jonathan Walpole
Computer Science Faculty Publications and Presentations
This position paper suggests that object-oriented operating systems may provide the means to meet the ever-growing demands of applications. As an example of a successful OOOS, we cite the http daemon. To support the contention that httpd is in fact an operating system, we observe that it implements uniform naming, persistent objects and an invocation meta-protocol, specifies and implements some useful objects, and provides a framework for extensibility.We also believe that the modularity that is characteristic of OO systems should provide a performance benefit rather than a penalty. Our ongoing work in the Synthetix project at OGI is exploring the …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 7, September 1994, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 7, September 1994, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Eighth-Order Explicit Symplecticrunge-Kutta-Nyström Integrators, Daniel I. Okunbor, Eric J. Lu
Eighth-Order Explicit Symplecticrunge-Kutta-Nyström Integrators, Daniel I. Okunbor, Eric J. Lu
Computer Science Technical Reports
We consider the solution of Hamiltonian dynamical systems by constructing eighth-order explicit symplectic Runge-Kutta-Nyström integrators. The application of highorder integrators may be important in areas such as in astronomy. They require large number of function evaluations, which make them computationally expensive and easily susceptible to errors. The integrators developed in this paper require 17 function evaluations as opposed to the 26-stage (effectively 24) eighth-order explicit symplectic Runge-Kutta-Nyström method derived by Calvo and Sanz-Serna. Numerical tests using the 2-Body and the sine-Gordon problems indicate that our methods are comparable to that of Calvo and Sanz-Serna and Yoshida.
An Analytic Approach For The Asymptotic Distribution Of The Height Of An Incomplete Digital Tree, Hosam Mahmoud, Wojciech Szpankowski
An Analytic Approach For The Asymptotic Distribution Of The Height Of An Incomplete Digital Tree, Hosam Mahmoud, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Interpolation Regions For Convex Low Degree Polynomial Curve Segments, Jörg Peters
Interpolation Regions For Convex Low Degree Polynomial Curve Segments, Jörg Peters
Department of Computer Science Technical Reports
No abstract provided.
Constraint-Based Parametric Conics For Cad, Ioannis Fudos, Christoph M. Hoffmann
Constraint-Based Parametric Conics For Cad, Ioannis Fudos, Christoph M. Hoffmann
Department of Computer Science Technical Reports
No abstract provided.
Science Pad: An Intelligent Electronic Notepad For Ubiquitous Scientific Computing, Anupam Joshi, Sanjiva Weerawarana, Tzvetan T. Drashansky, Elias N. Houstis
Science Pad: An Intelligent Electronic Notepad For Ubiquitous Scientific Computing, Anupam Joshi, Sanjiva Weerawarana, Tzvetan T. Drashansky, Elias N. Houstis
Department of Computer Science Technical Reports
No abstract provided.
Processing Pde Interface Conditions Ii, Tzvetan Drashansky, John R. Rice
Processing Pde Interface Conditions Ii, Tzvetan Drashansky, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Path-Planning For A Mobile Robot Sweeper, Chandrajit Bajaj, Fausto Bernardini, Steve Cutchin, Kokichi Sugihara
Path-Planning For A Mobile Robot Sweeper, Chandrajit Bajaj, Fausto Bernardini, Steve Cutchin, Kokichi Sugihara
Department of Computer Science Technical Reports
No abstract provided.
An Empirical Study On End Users' Update Performance For Different Abstraction Levels, Hock Chuan Chan, Kwok Kee Wei, Keng Siau
An Empirical Study On End Users' Update Performance For Different Abstraction Levels, Hock Chuan Chan, Kwok Kee Wei, Keng Siau
Research Collection School Of Computing and Information Systems
Recent laboratory experiments have shown a strong tendency that database users can perform better at the conceptual level than at the logical level. The experiments measured users’ performance for the tasks of database design and database retrieval. Besides database design and retrieval, the third major database task is update. User performance for updates has not been measured. With the widespread availability of databases, updates will be done frequently by end-users. This task is gaining in importance as a measure of the usability of a database system. An experiment was conducted to measure the effect of different abstraction levels on user …
A New Approach To The Minumum Cut Problem, David R. Karger, Clifford Stein
A New Approach To The Minumum Cut Problem, David R. Karger, Clifford Stein
Computer Science Technical Reports
No abstract provided.
A Macro Extension For The Woody Assembly Language, Lewis Barnett Iii
A Macro Extension For The Woody Assembly Language, Lewis Barnett Iii
Department of Math & Statistics Technical Report Series
We discuss an extension to the Woody Assembly Language [Cha94] which allows new instructions to be defined. The mechanism is similar to the C language's #define macros, allowing a name to be supplied for a piece of code which will be expanded in line. Provisions are made for writing new non-destructive branching instructions as well as instructions which are simply new names for commonly used bits of code.
Dynamic File-Access Characteristics Of A Production Parallel Scientific Workload, David Kotz, Nils Nieuwejaar
Dynamic File-Access Characteristics Of A Production Parallel Scientific Workload, David Kotz, Nils Nieuwejaar
Computer Science Technical Reports
Multiprocessors have permitted astounding increases in computational performance, but many cannot meet the intense I/O requirements of some scientific applications. An important component of any solution to this I/O bottleneck is a parallel file system that can provide high-bandwidth access to tremendous amounts of data in parallel to hundreds or thousands of processors. Most successful systems are based on a solid understanding of the characteristics of the expected workload, but until now there have been no comprehensive workload characterizations of multiprocessor file systems. We began the CHARISMA project in an attempt to fill that gap. We instrumented the common node …
How To Program In Ccsp, Beth Arrowsmith
How To Program In Ccsp, Beth Arrowsmith
Computer Science Technical Reports
No abstract provided.
Exact Sor Convergence Regions For A General Class Of P-Cyclic Matrices, A. Hadjidimos, D. Noutsos, M. Tzoumas
Exact Sor Convergence Regions For A General Class Of P-Cyclic Matrices, A. Hadjidimos, D. Noutsos, M. Tzoumas
Department of Computer Science Technical Reports
No abstract provided.
Some Notes On Multisplitting Methods And M-Step Preconditioners For Linear Systems , A. Hadjidimos, A. K. Yeyios
Some Notes On Multisplitting Methods And M-Step Preconditioners For Linear Systems , A. Hadjidimos, A. K. Yeyios
Department of Computer Science Technical Reports
No abstract provided.
Stability Criteria For Queueing Networks With A Monotonicity Property, Wojciech Szpankowski
Stability Criteria For Queueing Networks With A Monotonicity Property, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Biquartic C1 Spline Surfaces Over Irregular Meshes, Jörg Peters
Biquartic C1 Spline Surfaces Over Irregular Meshes, Jörg Peters
Department of Computer Science Technical Reports
No abstract provided.
Problem Solving Environments For Partial Differential Equation Based Applications (Ph.D. Thesis), Sanjiva Weerawarana
Problem Solving Environments For Partial Differential Equation Based Applications (Ph.D. Thesis), Sanjiva Weerawarana
Department of Computer Science Technical Reports
No abstract provided.
Reconstruction Of Rectangles From Projections: An Application To Surface- Mounted Device Placement, Concettina Guerra, Elias N. Houstis, Anupam Joshi
Reconstruction Of Rectangles From Projections: An Application To Surface- Mounted Device Placement, Concettina Guerra, Elias N. Houstis, Anupam Joshi
Department of Computer Science Technical Reports
No abstract provided.
A Representation Of Approximate Self- Overlapping Word And Its Application, Wojciech Szpankowski
A Representation Of Approximate Self- Overlapping Word And Its Application, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Modeling With Collaborating Pde Solvers - Theory And Practice, Mo Mu, John R. Rice
Modeling With Collaborating Pde Solvers - Theory And Practice, Mo Mu, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Timing Results Of A Parallel Fftsynth, Robert E. Lynch, Zhongyun Zhang
Timing Results Of A Parallel Fftsynth, Robert E. Lynch, Zhongyun Zhang
Department of Computer Science Technical Reports
No abstract provided.
Performance Of Combined Diversity Reception And Convolutional Coding For Qdpsk Land Mobile Radio, Huafei Zhou, Robert H. Deng, T. T. Tjhung
Performance Of Combined Diversity Reception And Convolutional Coding For Qdpsk Land Mobile Radio, Huafei Zhou, Robert H. Deng, T. T. Tjhung
Research Collection School Of Computing and Information Systems
Diversity reception and error correction coding are powerful techniques to combat multipath fading encountered in mobile radio communications. In order to improve the transmission performance of the ?/4-shift QDPSK signal in mobile radio channels, the authors propose a new scheme of combined coding and diversity reception, i.e., combination of diversity reception employing code combining (CC) and convolutional coding employing error-and erasure correction Viterbi decoding. They also consider another combination scheme, i.e., combination of diversity reception employing postdetection maximal ratio combining (MRC) and convolutional coding employing hard decision Viterbi decoding. They theoretically analyze the performance of the schemes taking into account …
Optimum Symbol-By-Symbol Detection Of Uncoded Digital Data Over The Gaussian Channel With Unknown Carrier Phase, Pooi Yuen Kam, Seng Siew Ng, Tock Soon Ng
Optimum Symbol-By-Symbol Detection Of Uncoded Digital Data Over The Gaussian Channel With Unknown Carrier Phase, Pooi Yuen Kam, Seng Siew Ng, Tock Soon Ng
Research Collection School Of Computing and Information Systems
A theory of optimum receiver design for symbol-by-symbol detection of an uncoded digital data sequence received over the Gaussian channel with unknown carrier phase is presented. Linear suppressed-carrier modulation is assumed. The work here aims at laying a conceptual foundation for optimum symbol-by-symbol detection, and rectifies existing approaches to the problem. The optimum receiver structure is obtained explicitly for an arbitrary carrier phase model, but its computational requirements are too heavy in general for any practical implementation. In one important special case, namely, the case in which the carrier phase can be treated as a constant over some K+1 symbol …
Teaching The Practice Of Formal Methods In Distributed Computing Systems - A Module, Beth Arrowsmith, Bruce Mcmillin
Teaching The Practice Of Formal Methods In Distributed Computing Systems - A Module, Beth Arrowsmith, Bruce Mcmillin
Computer Science Technical Reports
No abstract provided.
A Detailed Simulation Model Of The Hp 97560 Disk Drive, David Kotz, Song Bac Toh, Sriram Radhakrishnan
A Detailed Simulation Model Of The Hp 97560 Disk Drive, David Kotz, Song Bac Toh, Sriram Radhakrishnan
Computer Science Technical Reports
We implemented a detailed model of the HP 97560 disk drive, to replicate a model devised by Ruemmler and Wilkes (both of Hewlett-Packard, HP). Our model simulates one or more disk drives attached to one or more SCSI buses. The design is broken into three components: a test driver, the disk model itself, and the discrete-event simulation support. Thus, the disk model can be easily extracted and used in other simulation environments. We validated our model using traces obtained from HP, using the same "demerit" measure as Ruemmler and Wilkes. We obtained a demerit percentage of 3.9%, indicating that our …
A 2-3/4-Approximation Algorithm For The Shortest Superstring Problem, Chris Armen, Clifford Stein
A 2-3/4-Approximation Algorithm For The Shortest Superstring Problem, Chris Armen, Clifford Stein
Computer Science Technical Reports
Given a collection of strings S={s_1,...,s_n} over an alphabet Sigma, a superstring alpha of S is a string containing each s_i as a substring, that is, for each i, 1<=i<=n, alpha contains a block of |s_i| consecutive characters that match s_i exactly. The shortest superstring problem is the problem of finding a superstring alpha of minimum length. The shortest superstring problem has applications in both computational biology and data compression. The problem is NP-hard [GallantMS80]; in fact, it was recently shown to be MAX SNP-hard [BlumJLTY91]. Given the importance of the applications, several heuristics and approximation algorithms have been proposed. Constant factor approximation algorithms have been given in [BlumJLTY91] (factor of 3), [TengY93] (factor of 2-8/9), [CzumajGPR94] (factor of 2-5/6) and [KosarajuPS94] (factor of 2-50/63). Informally, the key to any algorithm for the shortest superstring problem is to identify sets of strings with large amounts of similarity, or overlap. While the previous algorithms and their analyses have grown increasingly sophisticated, they reveal remarkably little about the structure of strings with large amounts of overlap. In this sense, they are solving a more general problem than the one at hand. In this paper, we study the structure of strings with large amounts of overlap and use our understanding to give an algorithm that finds a superstring whose length is no more than 2-3/4 times that of the optimal superstring. We prove several interesting properties about short periodic strings, allowing us to answer questions of the following form: given a string with some periodic structure, characterize all the possible periodic strings that can have a large amount of overlap with the first string.
Efficiency And Stability Issues In The Numerical Computation Of Fourier Transforms And Convolutions On The 2-Sphere, D M. Healy Jr, S S. B. Moore, D Rockmore
Efficiency And Stability Issues In The Numerical Computation Of Fourier Transforms And Convolutions On The 2-Sphere, D M. Healy Jr, S S. B. Moore, D Rockmore
Computer Science Technical Reports
Earlier work by Driscoll and Healy has produced an efficient algorithm for computing the Fourier transform of band-limited functions on the sphere. In this paper we present a greatly improved inverse transform, and consequent improved convolution algorithm for such functions. We also discuss implementational considerations and give heuristics for allowing reliable floating point implementations of a slightly modified algorithm at little cost in either theoretical or actual performance. This discussion is supplemented with numerical experiments from our implementation in C on a DecStation 5000. These results give strong indications that the algorithm is both reliable and efficient for a large …
Bergman Spaces On Disconnected Domains, Alexandru Aleman, Stefan Richter, William T. Ross
Bergman Spaces On Disconnected Domains, Alexandru Aleman, Stefan Richter, William T. Ross
Department of Math & Statistics Technical Report Series
For a bounded region G ⊂ ℂ and a compact set K ⊂G , with area measure zero, we will characterize the invariant subspaces M (under ƒ → z ƒ) of the Bergman space Lpa(G\K), 1 ≤ p < ∞, which contain L<sup>pa(G) and with dim(M/(z-⋋)M) = 1 for all ⋋ ∈ G\K. When G\K is connected, we will see that dim(M/(z-⋋)M) = 1 for all ⋋ ∈ G\K and this in this case we will have a complete …