Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9003)
- 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 (1938)
- 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 (1104)
- 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 (1020)
- Deep learning (1003)
- Machine Learning (761)
- Computer Science (712)
-
- Security (648)
- Cybersecurity (558)
- Artificial Intelligence (484)
- Deep Learning (434)
- Computer science (412)
- Privacy (410)
- Simulation (391)
- Technical Reports (390)
- UTEP Computer Science Department (389)
- Classification (375)
- Algorithms (357)
- Optimization (352)
- Computer vision (349)
- Neural networks (345)
- Data mining (337)
- AI (301)
- Natural language processing (293)
- 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 (8458)
- 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 (928)
- Computer Science Faculty Research & Creative Works (919)
- Departmental Technical Reports (CS) (914)
- 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 61471 - 61500 of 63038
Full-Text Articles in Entire DC Network
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, October 1989, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, October 1989, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
High Rate Concatenated Coding Systems Using Multidimensional Bandwidth Efficient Inner Codes, Robert H. Deng, Daniel J. Jr. Costello
High Rate Concatenated Coding Systems Using Multidimensional Bandwidth Efficient Inner Codes, Robert H. Deng, Daniel J. Jr. Costello
Research Collection School Of Computing and Information Systems
A concatenated coding system using two-dimensional trellis-coded MPSK inner codes and Reed-Solomon outer codes for application in high-speed satellite communication systems was proposed previously by the authors (ibid., vol.37, no.5, p.420-7, May 1989). The authors extend their results to systems using symbol-oriented, multidimensional, trellis-coded MPSK inner codes. The concatenated coding systems are divided into two classes according to their achievable effective information rates. The first class uses multidimensional trellis-coded 8-PSK inner codes and achieves effective information rates around 1 b/dimension (spectral efficiency 2 b/s/Hz). The second class employs multidimensional trellis-coded 16-PSK inner codes and provides effective information rates around 1.5 …
Optical Machine Recognition Of Lower-Case Greek Characters Of Any Size, Ivan X. D. D'Cunha
Optical Machine Recognition Of Lower-Case Greek Characters Of Any Size, Ivan X. D. D'Cunha
Electrical & Computer Engineering Theses & Dissertations
An algorithm utilizing a syntactic approach and a criterion based on normalized moments is defined for the reliable, automatic, machine recognition of handwritten and printed Greek characters of any size and font. In this approach a binary image of the character in question is obtained initially; its skeleton is then produced by utilizing a standard thinning algorithm. The classification process then incorporates the topological features of the characters such as existence of closed curves, number of intersections, number and location of free ends, axial symmetry, and the criteria derived from normalized moments to uniquely identify each pattern. Experiments conducted demonstrated …
Simple Performance Models For Computationally Intense Remote Procedure Calls, Paul E. Buis
Simple Performance Models For Computationally Intense Remote Procedure Calls, Paul E. Buis
Department of Computer Science Technical Reports
No abstract provided.
Design Considerations For Distributed Scientific Software Systems, Paul E. Buis
Design Considerations For Distributed Scientific Software Systems, Paul E. Buis
Department of Computer Science Technical Reports
No abstract provided.
The Set Union Problem With Unlimited Backtracking, Alberto Apostolico, Guiseppe F. Italiano, Giorgio Gambosi, Maurizic Talamo
The Set Union Problem With Unlimited Backtracking, Alberto Apostolico, Guiseppe F. Italiano, Giorgio Gambosi, Maurizic Talamo
Department of Computer Science Technical Reports
No abstract provided.
Virtual Memory For Diskless Desktop Workstations, Douglas E. Comer, James Griffioen
Virtual Memory For Diskless Desktop Workstations, Douglas E. Comer, James Griffioen
Department of Computer Science Technical Reports
No abstract provided.
Curvature Adjusted Parameterization Of Curves, Richard R. Patterson, Chanderjit Bajaj
Curvature Adjusted Parameterization Of Curves, Richard R. Patterson, Chanderjit Bajaj
Department of Computer Science Technical Reports
No abstract provided.
Analysis Of Digital Tries With Markovian Dependency, P. Jacquet, Wojciech Szpankowski
Analysis Of Digital Tries With Markovian Dependency, P. Jacquet, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
A Note On The Height Of Suffix Trees, Luc Devroye, Wojciech Szpankowski, Bonita Rais
A Note On The Height Of Suffix Trees, Luc Devroye, Wojciech Szpankowski, Bonita Rais
Department of Computer Science Technical Reports
No abstract provided.
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, September 1989, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, September 1989, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Axon: Application-Oriented Lightweight Transport Protocol Design, James P.G. Sterbenz, Gurudatta M. Parulkar
Axon: Application-Oriented Lightweight Transport Protocol Design, James P.G. Sterbenz, Gurudatta M. Parulkar
All Computer Science and Engineering Research
This paper describes the application-oriented lightweight transport protocol for object transfer (ALTP-OT) in the Axon host communication architecture for distributed applications. The Axon Project is investigating an integrated design of host architecture, operating systems, and communication protocols to allow the utilization of the high band-width provided by the next generation of communication networks. ALTP-OT provides the end-to-end transport of segment and message objects for interprocess communication across a very high speed internetwork, supporting demanding applications such as scientific visualization and imaging. ALTP-OT uses rate-based flow control specifically oriented to the transfer of objects directly between application memory spaces. This document …
A Mathematical Treatment Of Defeasible Reasoning And Its Implementation, Guillermo R. Simari, R. P. Loui
A Mathematical Treatment Of Defeasible Reasoning And Its Implementation, Guillermo R. Simari, R. P. Loui
All Computer Science and Engineering Research
We present a mathematical approach to defeasible reasoning. This approach is based on the notion of specificity introduced by Poole and the theory of warrant presented by Pollock. We combine the ideas of the two. This main contribution of this paper is a precise well-defined system which exhibits correct behavior when applied to the benchmark examples in the literature. We prove that an order relation can be introduced among equivalence classes under the equi-specificity relation. We also prove a theorem that ensures the termination of the process of finding the justified facts. Two more lemmas define a reduced search space …
Axon: A High Speed Communication Architecture For Distributed Applications, James P.G. Sterbenz, Gurudatta M. Parulkar
Axon: A High Speed Communication Architecture For Distributed Applications, James P.G. Sterbenz, Gurudatta M. Parulkar
All Computer Science and Engineering Research
There are two complementary trends in the computer and communication fields. Increasing processor power and memory availability allow more demanding applications, such as scientific visualization and imaging. Advances in network performance and functionality have the potential for supporting programs requiring high bandwidth and predictable performance. However, the bottleneck in increasingly in the host-network interface, and thus the ability to deliver high performance communication capability to applications has not kept up with the advances in computer and network speed. We have proposed a new architecture that meets these challenges called Axon, whose novel aspects include: an integrated design of hardware, operating …
Pattern Classification In Dynamic Environments: Tagged Feature-Class Representation And The Classifiers, Qiuming Zhu
Pattern Classification In Dynamic Environments: Tagged Feature-Class Representation And The Classifiers, Qiuming Zhu
Computer Science Faculty Publications
he classifiers characterized by a tagged feature-class representation, a univariate discrimination approach, a cooperative classification scheme, and a logic-based learning strategy are discussed. Neither of the classifiers bears the constraints to the fixed sets of features and classes. Concepts of the tagged feature-class representation and the properties of feature matching in the dynamic environment are studied. Experimental tests and results of the classifiers are illustrated.
An Optimal Parallel Algorithm For The Minimum Circle-Cover Problem, Mikhail J. Atallah, Danny Z. Chen
An Optimal Parallel Algorithm For The Minimum Circle-Cover Problem, Mikhail J. Atallah, Danny Z. Chen
Department of Computer Science Technical Reports
No abstract provided.
Ampliative Inference, Computation, And Dialectic, R. P. Loui
Ampliative Inference, Computation, And Dialectic, R. P. Loui
All Computer Science and Engineering Research
There are three theses here: • Non-computationally conceived inference merely expands notation. This includes induction as well as deduction, and thus both deserve the adjective non-ampliative. Deriving entailments merely expands shorthand. All of the familiar formalisms for reasoning do just this. • There now exist examples of formalism for reasoning that do something else. They are deliberative, and to say in what way they are deliberative requires reference to the process through which they compute their entailments. • The original ampliative/non-ampliative terminology best survives as referring to this new distinction. Viewed formally, all other attempted distinctions either presume deduction to …
Efficient Interconnection Schemes For Vlsi And Parallel Computation, Ronald I. Greenberg
Efficient Interconnection Schemes For Vlsi And Parallel Computation, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
This thesis is primarily concerned with two problems of interconnecting components in VLSI technologies. In the first case, the goal is to construct efficient interconnection networks for general-purpose parallel computers. The second problem is a more specialized problem in the design of VLSI chips, namely multilayer channel routing. In addition, a final part of this thesis provides lower bounds on the area required for VLSI implementations of finite-state machines. This thesis shows that networks based on Leiserson's fat-tree architecture are nearly as good as any network built in a comparable amount of physical space. It shows that these "universal" networks …
A Relaxation Algorithm For Segmentation Of The Endocardial Surface From Cine Ct, William A. Barrett, Bryan S. Morse
A Relaxation Algorithm For Segmentation Of The Endocardial Surface From Cine Ct, William A. Barrett, Bryan S. Morse
Faculty Publications
A relaxation algorithm has been developed for automated segmentation of the endocardial surface from contrast Cine CT images. The image is contoured at an initial density threshold and a one-dimensional edge operator is applied orthogonally to each point of the contour. Output from the operator is used to generate a histogram, the mode of which identifies a new threshold. The image is contoured again at the new threshold and the process is repeated. Iteration continues with successive threshold estimates converging to a stable value in the region of the endocardial surface. Computer-determined thresholds compare favorably with manual segmentation while reducing …
Probabilistic Segmentation Of Myocardial Tissue By Deterministic Relaxation, William A. Barrett, Shawn C. Becker, Jerome A. Broekhuijsen
Probabilistic Segmentation Of Myocardial Tissue By Deterministic Relaxation, William A. Barrett, Shawn C. Becker, Jerome A. Broekhuijsen
Faculty Publications
A recently-developed probabilistic model for automatically segmenting regions of interest in abdominal CT scans has been adapted to the challenging task of segmenting myocardial tissue in Cine CT scans. A system has been implemented on relatively low-cost hardware which performs such segmentations. Special techniques have been developed to improve consistency and accuracy. Early results of testing this new modality are encouraging and promising. Based on observations from experimentation, new directions for future work have been identified.
Interactive Measurement Of Three-Dimensional Cardiac Morphology, William A. Barrett, Shawn C. Becker
Interactive Measurement Of Three-Dimensional Cardiac Morphology, William A. Barrett, Shawn C. Becker
Faculty Publications
Techniques have been developed for extracting three-dimensional (3D) measurements directly and interactively from 3D representations of Cine CT images. In order to obtain 3D measurements the anatomical surface is interrogated directly through the use of a 3D graphical "probe" (line). The probe is interactively positioned and stretched between any visible surface points to allow direct capture of 3D (linear) distance. Distance measurements are updated in real time as the probe dynamically "penetrates" any intervening anatomy while providing valuable depth cuing for visual feedback and probe placement. Curvilinear distance is obtained by stretching the probe over multiple surface points. The probe …
Optimal Canonization Of All Substrings Of A String, A. Apostolico, M. Crochemore
Optimal Canonization Of All Substrings Of A String, A. Apostolico, M. Crochemore
Department of Computer Science Technical Reports
No abstract provided.
Two-Dimensional Pattern Matching With K Mismatches, Sanjay Ranka, Todd Heywood
Two-Dimensional Pattern Matching With K Mismatches, Sanjay Ranka, Todd Heywood
Electrical Engineering and Computer Science - Technical Reports
We give an algorithm which finds all occurrences of an m1 x m2 pattern array embedded as subarrays in an n1 x n2 array of text, where at most k mismatches are allowed per occurrence. The algorithm runs in time O((k+a)(blogb+ n1n2)), where a = min(m1m2) and b=max(m1m2). This improves upon the previously best known algorithm, and is asymptotically optimal for k ≈ a.
Convergence Domains Of The Ssor Iterative Method For Generalized Consistently Ordered Matrices, A. Hadjidimos, M. Neumann
Convergence Domains Of The Ssor Iterative Method For Generalized Consistently Ordered Matrices, A. Hadjidimos, M. Neumann
Department of Computer Science Technical Reports
No abstract provided.
Implementing Object Support In The Raid Distributed Database System, Bharat Bhargava, Prasun Dewar, James G. Mullen, Jagannathan Srinivasan
Implementing Object Support In The Raid Distributed Database System, Bharat Bhargava, Prasun Dewar, James G. Mullen, Jagannathan Srinivasan
Department of Computer Science Technical Reports
No abstract provided.
A Model For Adaptable Systems For Transaction Processing, Bharat Bhargava, John Riedl
A Model For Adaptable Systems For Transaction Processing, Bharat Bhargava, John Riedl
Department of Computer Science Technical Reports
No abstract provided.
Nonpreemptive Ensemble Motion Planning On A Tree, Gred N. Frederickson, D. J. Guan
Nonpreemptive Ensemble Motion Planning On A Tree, Gred N. Frederickson, D. J. Guan
Department of Computer Science Technical Reports
No abstract provided.
An Architecture For High-Speed Packet Switched Networks (Thesis), Rajendra Shirvaram Yavatkar
An Architecture For High-Speed Packet Switched Networks (Thesis), Rajendra Shirvaram Yavatkar
Department of Computer Science Technical Reports
No abstract provided.
Naive Asymptotics For Hitting Time Bounds In Markov Chains, Vernon J. Rego
Naive Asymptotics For Hitting Time Bounds In Markov Chains, Vernon J. Rego
Department of Computer Science Technical Reports
No abstract provided.
Host-Network Interface Architecture For Gigabit Communications, James P. G. Sterbenz
Host-Network Interface Architecture For Gigabit Communications, James P. G. Sterbenz
All Computer Science and Engineering Research
There are two complementary trends in the computer and communications fields. Increasing processor power and memory availability allow more demanding applications, such as scientific visualizations and imaging. Advances in network performance and functionality have the potential for supporting applications requiring high bandwidth communications. However, the bottleneck is increasingly in the host-network interface, and thus the ability to deliver high performance communications capability to applications has not kept up with the advance in computer and network speed. We have proposed a new architecture that meets these challenges, called Axon. The Axon thesis is that an essential requirement for the support of …