Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- China Simulation Federation (3924)
- TÜBİTAK (3106)
- Wright State University (1814)
- University of Nebraska - Lincoln (1069)
- University of Texas at El Paso (859)
-
- Washington University in St. Louis (733)
- Technological University Dublin (732)
- California Polytechnic State University, San Luis Obispo (722)
- Brigham Young University (641)
- Old Dominion University (585)
- Embry-Riddle Aeronautical University (565)
- Singapore Management University (548)
- Universitas Indonesia (445)
- San Jose State University (438)
- Santa Clara University (422)
- Air Force Institute of Technology (414)
- Marquette University (412)
- University of South Carolina (327)
- California State University, San Bernardino (288)
- University of Central Florida (276)
- Portland State University (273)
- Chulalongkorn University (243)
- Al Iraqia University (235)
- University of South Florida (223)
- Purdue University (218)
- University of Arkansas, Fayetteville (210)
- University of Nevada, Las Vegas (192)
- New Jersey Institute of Technology (187)
- Nova Southeastern University (183)
- University of Dayton (166)
- Keyword
-
- Machine learning (445)
- Computer Science (385)
- Deep learning (353)
- Department of Computer Science and Engineering (319)
- Machine Learning (290)
-
- Engineering (274)
- Simulation (237)
- Robotics (233)
- Security (184)
- Artificial intelligence (177)
- Deep Learning (173)
- Optimization (171)
- Computer Engineering (168)
- Classification (164)
- College of Engineering and Computer Science (157)
- Newsletters (157)
- Science news (157)
- Technical writing (157)
- Cybersecurity (154)
- Artificial Intelligence (149)
- Computer vision (142)
- Computer Science and Engineering (137)
- Genetic algorithm (119)
- Blockchain (100)
- Internet (98)
- Virtual reality (98)
- Path planning (94)
- Data mining (93)
- Privacy (92)
- Clustering (91)
- Publication Year
- Publication
-
- Journal of System Simulation (3924)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Computer Science & Engineering Syllabi (1312)
- Departmental Technical Reports (CS) (760)
- Theses and Dissertations (732)
-
- All Computer Science and Engineering Research (683)
- International Congress on Environmental Modelling and Software (629)
- Research Collection School Of Computing and Information Systems (512)
- Department of Electrical and Computer Engineering: Faculty Publications (496)
- Makara Journal of Technology (437)
- Electrical and Computer Engineering Faculty Research and Publications (389)
- Browse all Theses and Dissertations (342)
- Dissertations (342)
- Electronic Theses and Dissertations (328)
- Journal of Digital Forensics, Security and Law (299)
- Computer Science and Engineering Senior Theses (298)
- Faculty Publications (290)
- Master's Theses (289)
- Computer Engineering (282)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (242)
- Iraqi Journal for Computer Science and Mathematics (235)
- Master's Projects (219)
- School of Computing: Dissertations, Theses, and Student Research (206)
- Electrical and Computer Engineering Faculty Publications (204)
- Electrical & Computer Engineering Theses & Dissertations (196)
- Conference papers (179)
- Publications (173)
- USF Tampa Graduate Theses and Dissertations (162)
- BITs and PCs Newsletter (157)
- Journal of International Technology and Information Management (153)
- Publication Type
- File Type
Articles 25171 - 25200 of 25759
Full-Text Articles in Entire DC Network
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 4, April 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 4, April 1994, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 3, March 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 3, March 1994, 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.
Rank Conditioned Rank Selection Filters For Signal Restoration, Russell C. Hardie, Kenneth E. Barner
Rank Conditioned Rank Selection Filters For Signal Restoration, Russell C. Hardie, Kenneth E. Barner
Electrical and Computer Engineering Faculty Publications
A class of nonlinear filters called rank conditioned rank selection (RCRS) filters is developed and analyzed in this paper. The RCRS filters are developed within the general framework of rank selection(RS) filters, which are filters constrained to output an order statistic from the observation set. Many previously proposed rank order based filters can be formulated as RS filters. The only difference between such filters is in the information used in deciding which order statistic to output. The information used by RCRS filters is the ranks of selected input samples, hence the name rank conditioned rank selection filters. The number of …
Rapid And Accurate Timing Simulation Of Radiation-Hardened Digital Microelectronics Using Vhdl, Charles P. Brothers Jr.
Rapid And Accurate Timing Simulation Of Radiation-Hardened Digital Microelectronics Using Vhdl, Charles P. Brothers Jr.
Theses and Dissertations
This dissertation presents the development of a fast, accurate, timing simulation capability based on VHSIC Hardware Description Language VHDL without the use of back annotation of timing delay information. This VHDL-based timing simulator is intended for use with radiation-hardened microelectronics in simulating timing of circuit operation in pre-radiation, post-radiation 1 MradSi total dose, and ionizing dose radiation environments. Development of the timing models are presented. The implementation of the timing models are incorporated into a VHDL library composed of basic logic gates and flip-flops. Simulations of complex circuits were run in SPICE and VHDL to assess the timing accuracy and …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 2, February 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 2, February 1994, 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.
An Exploratory Study Of Hypermedia Support For Problem Decomposition, Robert P. Minch, Gary I. Green
An Exploratory Study Of Hypermedia Support For Problem Decomposition, Robert P. Minch, Gary I. Green
IT and Supply Chain Management Faculty Publications and Presentations
Empirical hypermedia research has concentrated on usability rather than utility, and the research on utility has focused on information access as opposed to problem solving and decision making in organizations. This study, based on problem reduction theory, uses a hypermedia prototype system to support decision processes for solving a financial analysis problem. An exploratory laboratory experiment was conducted to study the feasibility of the prototype for hypermedia support of decision making. The process tracing techniques used suggest that a cognitive map of a decision maker's thought process may be constructed. Results offer a great deal of promise in the use …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 1, January 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 1, January 1994, 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.
Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise, Paul W. Goldberg, Sally A. Goldman
Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise, Paul W. Goldberg, Sally A. Goldman
All Computer Science and Engineering Research
Developing the ability to recognize a landmark from a visual image of a robot's current location is a fundamental problem in robotics. We consider the problem of PAC-learning the concept class of geometric patterns where the target geometric pattern is a configuration of k points on the real line. Each instance is a configuration of n points on the real line, where it is labeled according to whether or not it visually resembles the target pattern. To capture the notion of visual resemblance we use the Hausdorff metric. Informally, two geometric patterns P and Q resemble each othe runder the …
Rationales And Argument Moves, R. P. Loui, Jeff Norman
Rationales And Argument Moves, R. P. Loui, Jeff Norman
All Computer Science and Engineering Research
No abstract provided.
Congestion Control In Atm Networks, Apostolos Dailianas, Andreas Bovopoulos
Congestion Control In Atm Networks, Apostolos Dailianas, Andreas Bovopoulos
All Computer Science and Engineering Research
No abstract provided.
Self-Stabilization By Counter Flushing, George Varghese
Self-Stabilization By Counter Flushing, George Varghese
All Computer Science and Engineering Research
A useful way to design simple and robust protocols is to make them self-stabilitizing. We describe a simple technique for self-stabilization called counter flushign which is applicable to a number of distributed algorithms. A randomized version of counter flushing is shown to have extremely small expected stabilization time. We show how our technique helps to crisply understand and improve some previous distributed algorithms. Then we apply it to a variety of total algorithms for deadlock detection, propagation of information with feedback, resets and snapshots. Our stabilizing snapshot protocol has much better complexity than the previous stabilizing non-blocking snapshot protocol. Hence …
Strategies For The Parallel Training Of Simple Recurrent Neural Networks, Peter J. Mccann, Barry L. Kalman
Strategies For The Parallel Training Of Simple Recurrent Neural Networks, Peter J. Mccann, Barry L. Kalman
All Computer Science and Engineering Research
Two concurrent implementations of the method of conjugate gradients for training Elman networks are discussed. The parallelism is obtained in the computation of the error gradient and the method is therefore applicable to any gradient descent training technique for this form of network. The experimental results were obtained on a Sun Sparc Center 2000 multiprocessor. The Sparc 2000 is a shared memory machine well suited to coarse-grained distributed computations, but the concurrency could be extended to other architectures as well.
Trading Packet Headers For Packet Processing, George Varghese
Trading Packet Headers For Packet Processing, George Varghese
All Computer Science and Engineering Research
In high speed networks, packet processing is relatively expensive while bandwidth is cheap. This begs the question: what fields can be added to packets to make packet processing easier? By exploring this question, we device a number of novel mechanisms to speed up packet processing. With the advent of new standards for hte Data Link, Network, and Transport lyaers, we believe there is an opportunity to apply these techniques to improve the performance of real protocols. First, we suggest adding a data manipulation header to an easily accessible portion of each packet. This header contains pointers to fields (in various …
Efficient Fair Queueing Using Deficit Round Robin, George Varghese, M. Shreedhar
Efficient Fair Queueing Using Deficit Round Robin, George Varghese, M. Shreedhar
All Computer Science and Engineering Research
Fair queuing is a technique that allows each flow passing through a network device to have fair share of network resources. previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes was O(log(n)), where n is the number of active flows. This is expensive at high speeds. On the other hand, cheaper approximations of fair queuing that have been reported in the literature exhibit unfair behavior. In this paper, we describe a new approximation of fair queuing, that we call Deficit Round Robin. Our scheme …
Exact Learning Of Discretized Geometric Concepts, Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias
Exact Learning Of Discretized Geometric Concepts, Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias
All Computer Science and Engineering Research
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the unioin of m axis-parallel boxes in d-dimensional discretized Euclidean space where each coordinate can have n discrete values. This algorithm receives at most md counterexamples and uses time and membership queries polynomial in m and log(n) for any constant d. Furthermore, all equivalence queries can be formulated as the union of O(mdlog(m)) axis-parallel boxes. Next, we show how to extend our algorithm to efficiently learn, from only equivalence queries, any discretized geometric concept generated from any number of halfspaces …
Learning From A Consistently Ignorant Teacher, Michael Frazier, Sally Goldman, Nina Mishra, Leonard Pitt
Learning From A Consistently Ignorant Teacher, Michael Frazier, Sally Goldman, Nina Mishra, Leonard Pitt
All Computer Science and Engineering Research
One view of computational learning theory is that of a learner acquiring the knowledge of a teacher. We introduce a formal model of learning capturing the idea that teachers may have gaps in their knowledge. The goal of the learner is still to acquire the knowledge of the teacher, but now the learner must also identify the gaps. This is the notion of learning from a consistently ignorant teacher. We consider the impact of knowledge gaps on learning, for example, monoton DNF and d-dimensional boxes, and show that leraning is still possible. Negatively, we show that knowledge gaps make learning …
Cmap, Ken Cox, John Dehart
Cmap, Ken Cox, John Dehart
All Computer Science and Engineering Research
This document specifies a Connection Management Access Protocol (CMAP) for call management in high-speed packet switched networks. We target CMAP to networks employing the Asynchronous Transfer Mode (ATM) communication standard. CMAP specifies the access procedues exercised by network clients to manipulate multipoint calls; it is thus a User-Network Interface (UNI) signalling protocol. We define a multipoint call as a group of multipoint connections. A multipoint connection is a communication channel between two or more clients or endpoints of the network, where all data sent by one client is received by all other clients who have elected to receive. A point-to-point …
Cell Tracking Using A Distributed Algorithm For 3d Image Segmentation, Vikas Awasthi, Keith W. Doolittle, Guru Parulkar, James G. Mcnally
Cell Tracking Using A Distributed Algorithm For 3d Image Segmentation, Vikas Awasthi, Keith W. Doolittle, Guru Parulkar, James G. Mcnally
All Computer Science and Engineering Research
We have developed and tested an automated method for simultaneous 3D tracking of numerous, flourescently-tagged cells. The procedure uses multiple thresholding to segment individual cells at a starting timepoint, and then iteratively applies a template-matching algorithm to locate a particular cell's position at subsequent time points. To speed up the method, we have developed a distributed implementation in which template matching is carried out in parallel on several different server machines. The distributed implementation showed a monotonic decrease in response time with increasing number of servers (up to 15 tested), demonstrating that the tracking algorithm is well suited to parallelization, …
Design Of A Large Scale Multimedia Server, Milind M. Buddhikot, Guru Parulkar, Jerome R. Cox Jr.
Design Of A Large Scale Multimedia Server, Milind M. Buddhikot, Guru Parulkar, Jerome R. Cox Jr.
All Computer Science and Engineering Research
Large scale multimedia storage servers will be an integral part of the emerging distributed multimedia computing infrastructure. However, given the modest rate of improvements in storage transfer rates, designing servers that meet the demands of multimedia applications is a challenging task that needs significant architectural innovation. Our research project, called Massively-parallel And Real-time Storage (MARS) architecture, is aimed at the design and prototype implementation of a large scale multimedia storage server. It uses some of the well-known techniques in parallel I/O, such as data striping and Redundant Arrays of Inexpensive Disks (RAID) and an innovative ATM based interconnect inside the …
Visual Specification Of Interprocess And Intraprocess Communication, T. Paul Mccartney, Kenneth J. Goldman
Visual Specification Of Interprocess And Intraprocess Communication, T. Paul Mccartney, Kenneth J. Goldman
All Computer Science and Engineering Research
We present a visual specification language for constructing distributed applications and their direct manipulation graphical user interfaces. Each distributed application consists of a collection of independent modules and a configuration of logical connections that define communication among the data interfaces of the modules. Our specification language uses a single visual mechanism that allows end-users to define interprocess communication among distributed modules and to define intraprocess communication among objects within a module. This seamless specification provides a general encapsulation/abstraction mechanism and is designed to support dynamic change to the communication structure. User interfaces are completely decoupled from the module(s) they control.
Efficient Quality Of Service Support In Multimedia Computer Operating Systems, Raman Gopalakrishna, Guru M. Parulkar
Efficient Quality Of Service Support In Multimedia Computer Operating Systems, Raman Gopalakrishna, Guru M. Parulkar
All Computer Science and Engineering Research
This report describes our approach towards providing quality of service (QoS) guarantees for network communication within the endsystems to support multimedia applications. We first address the problem of QoS specification by identifying a set of application classes and their QoS parameters that cover the communication requirements of most applications. We then describe the QoS mapping problem, and show how requirements for resources (such as the CPU, the network interface adaptor and network connections) can be automatically derived from the application QoS parameters. We then deal with the QoS enforcement issue in which we describe techniques for scheduling protocol processing threads …
Catching Up With The Networks: Host I/O At Gigabit Rates, Zubin D. Dittia, Jerome R. Cox Jr., Guru M. Parulkar
Catching Up With The Networks: Host I/O At Gigabit Rates, Zubin D. Dittia, Jerome R. Cox Jr., Guru M. Parulkar
All Computer Science and Engineering Research
The last few years have seen network data rates skyrocket from a few Mbps to a Gbps or more. However, a lack of integration of the host-netowrk interface, the operating system, and network protocols has resulted in end-applications seeing only a small fraction of this total bandwidth being available for data transfer. The emergence of demanding applications in the realms of multimedia and virtual reality provides further impetus in the drive to overcome this problem. In this paper, we present the design of a high performance ATM host-network interface for workstations and servers that can support a bidirecitonal sustained data …
Pipelined And Superscalar Architectures In Clocked And Asynchronous Environments, Mark A. Franklin, Tienyo Pan
Pipelined And Superscalar Architectures In Clocked And Asynchronous Environments, Mark A. Franklin, Tienyo Pan
All Computer Science and Engineering Research
In this paper, a set of simple, general, yet practical performance models for RISC architectures are developed. These models apply to a wide range of systems that include both pipelined and superscalar systems operating in either clocked or asynchronous environments. The models permit quantitative evaluation of various design choices (e.g., the number of pipelines in the system, the pipeline depth, and the choice between clocked and asynchronous methodologies) as functions of technology parameters, environmental operating parameters, and pipeline function characteristics. Design curves are presented indicating optimal pipeline depth and number of pipelines to employ under various conditions.
Morphing Binary Trees, John Hershberger, Subhash Suri
Morphing Binary Trees, John Hershberger, Subhash Suri
All Computer Science and Engineering Research
We investigate the problem of transforming one binary tree into another by rotatoins, subject to certain weight ocnstraints on the nodes of the trees. These constraints arise in the problem of "morphing" one simple polygon to another simple polygon by continuous deformatinos (translations and scalings) that preserve the turn angles and the simplicity of the polygon; the two polygons must have the same sequence of turn angles. Our main theorem is that two arbitrary n-leaf binary trees satisfying our weight constraint can be morphed into each other with O(n log n) rotations. Furthermore, we also present an O(n log n) …
Distributed Data Layout, Scheduling And Playout Control In A Large Scale Multimedia Storage Server, Milind M. Buddhikot, Guru Parulkar
Distributed Data Layout, Scheduling And Playout Control In A Large Scale Multimedia Storage Server, Milind M. Buddhikot, Guru Parulkar
All Computer Science and Engineering Research
No abstract provided.
High-Performance Training Of Feedforward & Simple Recurrent Networks, Barry L. Kalman, Stan C. Kwasny
High-Performance Training Of Feedforward & Simple Recurrent Networks, Barry L. Kalman, Stan C. Kwasny
All Computer Science and Engineering Research
TRAINREC is a system for training feedforward and recurrent neural networks that incorporates several ideas. It uses the conjugate-gradient method which is demonstrably more efficient than traditional backward error propagation. We assume epoch-based training and derive a new error function having several desirable properties absent from the traditional sum-of-squared-error function. We argue for skip (shortcut) connections where appropriate and the preference for a sigmoidal yielding values over the [-1,1] interval. The input feature space is often over-analyzed, but by using singular value decomposition, input patterns can be conditioned for better learning often with a reduced number of input units. Recurrent …
Universal Continuous Media I/O: Design And Implementation, Charles D. Cranor, Gurudatta M. Parulkar
Universal Continuous Media I/O: Design And Implementation, Charles D. Cranor, Gurudatta M. Parulkar
All Computer Science and Engineering Research
The problem this paper addresses is how to modify an existing operating system's I/O subsystem to support new high-speed networks and high-bandwidth multimedia applications that will play an important role in future computing environments. The proposed I/O subsystem is called universal continuous media I/O (UCM I/O). This paper will cover the preliminary design of UCM I/O, some of the trade-offs and issues that need to be addressed in order to implement UCM I/O, and a summary of work in progress.
Reasoning About Places, Times, And Actions In The Presence Of Mobility, C. Donald Wilcox, Gruia-Catalin Roman
Reasoning About Places, Times, And Actions In The Presence Of Mobility, C. Donald Wilcox, Gruia-Catalin Roman
All Computer Science and Engineering Research
The current trend toward portable computing systems (e.g., cellular phones, laptop computers) brings with it the need for a new paradigm for thinking about designing distributed applications. We introduce the term mobile to refer to distributed systems that include moving, autonomous agents which loosely cooperate to accomplish a tastk. The fluid nature of hte interconnections between components in a mobile system provides new challenges and new opportunities for the research community. While we do not propsoe to have fully grasped the consequences of these systems, we believe that the notions of place, time, and action will be central in any …
Boxgraph: A Two-Dimensional Visual Computation Model, Takayuki Dan Kimura, Timothy B. Brown
Boxgraph: A Two-Dimensional Visual Computation Model, Takayuki Dan Kimura, Timothy B. Brown
All Computer Science and Engineering Research
Traditional computation models such as Turing machines, lambda-calculus, Markov's normal algorithms, are not suitable models for visual programming languages because they are all based on one-dimensional text strings and visual programming uses two-dimensional graphic diagrams. We propose a two-dimensional computation model, called Boxgraph, that requires no text. The syntax of the model consists of nested boxes connected by arrows, and the semantics consists of dataflow and the concept of consistency. The expressive power of the model is demonstrated by constructing representations of a binary full adder, the Fibonacci function, and the GCD function. The model, with a small extension to …
Production Quality Video Over Broadband Networks: A Description Of The System And Two Interactive Applications, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts And Brian L. Gottlieb And Craig Horn
Production Quality Video Over Broadband Networks: A Description Of The System And Two Interactive Applications, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts And Brian L. Gottlieb And Craig Horn
All Computer Science and Engineering Research
The Washington University MultiMedia eXplorer (MMX) is a complete, host-independent multimedia system capable of transmitting and receiving JPEG-compressed video, CD-quality audio, and high-resolution radiographic images over the Washington University broadband ATM network. If the host is equipped with an ATM interface card, normal network traffic can be supported via an ATM extension port on the MMX. The major components of the MMX are an ATMizer and three multimedia channels. The ATMizer implements the host interface, the interface to the ATM network, and hte interface to the three multimdeia channels. This paper describes the architecture of the MMX, the software used …