Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- China Simulation Federation (3363)
- TÜBİTAK (3020)
- Wright State University (1729)
- Washington University in St. Louis (697)
- Embry-Riddle Aeronautical University (427)
-
- Singapore Management University (410)
- Old Dominion University (355)
- Selected Works (342)
- University of Nebraska - Lincoln (234)
- University of Dayton (163)
- Chulalongkorn University (150)
- Air Force Institute of Technology (120)
- Portland State University (117)
- Purdue University (83)
- University of Nevada, Las Vegas (77)
- Chapman University (74)
- University for Business and Technology in Kosovo (70)
- Technological University Dublin (68)
- University of New Haven (68)
- University of Arkansas, Fayetteville (62)
- University of South Florida (59)
- SelectedWorks (53)
- California Polytechnic State University, San Luis Obispo (50)
- University of South Carolina (48)
- Western University (48)
- University of New Mexico (36)
- Edith Cowan University (35)
- San Jose State University (33)
- Loyola University Chicago (30)
- University of Kentucky (28)
- Keyword
-
- Computer Science (290)
- Department of Computer Science and Engineering (237)
- Engineering (191)
- Simulation (175)
- Machine learning (169)
-
- Deep learning (162)
- College of Engineering and Computer Science (157)
- Newsletters (157)
- Science news (157)
- Technical writing (157)
- Optimization (102)
- Classification (101)
- Genetic algorithm (98)
- Particle swarm optimization (83)
- Security (78)
- Machine Learning (74)
- Artificial intelligence (59)
- Robotics (58)
- Clustering (57)
- Virtual reality (57)
- Modeling (56)
- Wireless sensor networks (56)
- Digital forensics (55)
- Support vector machine (54)
- Computer Engineering (53)
- Neural network (51)
- Feature extraction (49)
- Cybersecurity (48)
- Image processing (48)
- Visualization (47)
- Publication Year
- Publication
-
- Journal of System Simulation (3363)
- Turkish Journal of Electrical Engineering and Computer Sciences (3020)
- Computer Science & Engineering Syllabi (1312)
- All Computer Science and Engineering Research (683)
- Research Collection School Of Computing and Information Systems (394)
-
- Journal of Digital Forensics, Security and Law (298)
- Browse all Theses and Dissertations (260)
- Electrical and Computer Engineering Faculty Publications (164)
- BITs and PCs Newsletter (157)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (150)
- Department of Computer Science and Engineering: Dissertations, Theses, and Student Research (138)
- Theses and Dissertations (133)
- Electrical & Computer Engineering Theses & Dissertations (127)
- Annual ADFSL Conference on Digital Forensics, Security and Law (104)
- Faculty Publications (91)
- Computer Science Faculty Publications and Presentations (81)
- Dissertations (77)
- Electrical & Computer Engineering and Computer Science Faculty Publications (67)
- Engineering Faculty Articles and Research (66)
- Electronic Theses and Dissertations (58)
- Computer Science Faculty Publications (54)
- USF Tampa Graduate Theses and Dissertations (54)
- UBT International Conference (51)
- Monish R. Chatterjee (47)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (47)
- CSE Conference and Workshop Papers (45)
- Christopher N. Roman (45)
- Computer Science Theses & Dissertations (38)
- Partha Banerjee (35)
- Graduate Theses and Dissertations (32)
- Publication Type
Articles 12511 - 12540 of 12790
Full-Text Articles in Physical Sciences and Mathematics
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.
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.
An Application-Oriented Error Control Scheme For High Speed Networks, Fengmin Gong, Gurudatta Parulkar
An Application-Oriented Error Control Scheme For High Speed Networks, Fengmin Gong, Gurudatta Parulkar
All Computer Science and Engineering Research
Many new network applications demand interprocess communication (IPC) services that are not supported by existing transport protocol mechanisms. Large bandwidth-delay products of high-speed networks also render the existing control mechanisms such as flow and error control less efficient. In particular, new error control schemes that can provide variable degrees of error recovery according to the applications requirements are needed. This paper presents the design, evaluation, and implementation of an application-oriented error control scheme that is aimed at supporting efficient IPC in high-speed networking environments. Our results show that the proposed error control scheme allows effective control of trade-off between the …
Visual Presentation Of Software Specifications And Designs, Gruia-Catalin Roman, Delbert Hart, Charles Calkins
Visual Presentation Of Software Specifications And Designs, Gruia-Catalin Roman, Delbert Hart, Charles Calkins
All Computer Science and Engineering Research
Formal methods hold the promise for high dependability in the design of critical software. However, software engineers who employ formal methods need to communicate their design decisions to users, customers, managers, and collegues who may not be in a position to acquire a full understanding of the formal notation being used. Visualizations derived from formal specifications and designs must be able to convey the required information precisely and reliably without the use of formal notation. This paper discusses a design methodology which attempts to integrate a design methodology based upon specification and program refinement with a state-of-the-art approach to rapid …
Connection Management In Reconfigurable Distributed Systems, Bala Swaminathan
Connection Management In Reconfigurable Distributed Systems, Bala Swaminathan
All Computer Science and Engineering Research
The Programmer's Playground takes a new approach to simplifying and supporting the construction of distributed applications. The approach, called I/O abstraction, separates the description of a system's communication structure from the descriptions of its computational components so that software modules written in existing programming languages cna be integrated flexibly and dynamically by both programmers and end-users. This separation is achieved by estabishing logical connectinos among the data interfaces of independent software modules. The logical connections provide a uniform high-level view of communication for both discrete and continuous data. The I/O abstraction approach inherits ideas from the I/O automaton model, a …
Learning And Teaching Of Boolean And Geometric Classes, H. David Mathias
Learning And Teaching Of Boolean And Geometric Classes, H. David Mathias
All Computer Science and Engineering Research
We consider the concept classes of DNF formulas and unions of discretized, axis-parallel d-dimensional boxes in discretized d-dimensional space with respect to several different learning models. In the model of learning with queries we present an algorithm to learn unions of boxes. We introduce a model of teaching that prevents illicit communication between the teacher and the leaner but that captures the intuitive aspect of teaching: a learner should perform at least as well with a cooperative teacher as with an adversarial teacher. We propose the study of teaching of DNF formulas and unions of boxes in this model. We …
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 …
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 …
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.
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 …
Practical Methods For Approximating Shortest Paths On A Convex Polytope In R3, John Hershberger, Subhash Suri
Practical Methods For Approximating Shortest Paths On A Convex Polytope In R3, John Hershberger, Subhash Suri
All Computer Science and Engineering Research
We propose a n extremely simple approximation scheme for computing shortest paths on the surface of a convex polytope in three dimensions. Given a convex polytope P with n vertices and two points p,q on its surface, let dp (p,q) denote the shortest path distance between p and q on the surface of P. Our algorithm produces a path of length at most 2 × dp(p,q) in time O(n). Extending this results, we can also compute ana pproximation of the shortest path tree rooted at an arbitrary point χ Є P in time O(n log n). In the approximate tree, …
Speculative Computation: Overcoming Communication Delays In Parallel Algorithms, Vasudha Govindan, Mark A. Franklin
Speculative Computation: Overcoming Communication Delays In Parallel Algorithms, Vasudha Govindan, Mark A. Franklin
All Computer Science and Engineering Research
Communication latencies and delays are a major source of performance degradation in parallel computing systems. It is importnat to "mask" these communication delays by overlapping them with useful computation in order to obtain good parallel performance. This paper proposes speculative computation as a technique to mask communication latencies. Speculative computation is discussed in the context of synchronous iterative algorithms. Processors speculate the contents of messages that are not hyet received and perform computation based on the speculated values. When the messages are received, they are compared with the speculated values and, if the error is unacceptable, the resulitng computation is …
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.
An Incremental Distributed Algorithm For Computing Biconnected Components, Bala Swaminathan, Kenneth J. Goldman
An Incremental Distributed Algorithm For Computing Biconnected Components, Bala Swaminathan, Kenneth J. Goldman
All Computer Science and Engineering Research
This paper describes a distributed algorithm for computing the biconnected components of a dynamically changing graph. Our algorithm has a worst case communication complexity of O(b + c) messages for an edge insertion and O(b' + c) messages for an edge removal, and a worst case time complexity of O(c) for both operations, where c is the maximum number of biconnected components in any of the connected components during the operation, b is the number of nodes in the biconnected component containing the new edge, and bprime is the number of nodes in the biconnected component in which the update …
Near-Distance Software Engineering Education, F. O'Brien
Near-Distance Software Engineering Education, F. O'Brien
Faculty of Informatics - Papers (Archive)
The University of Wollongong has been seeking ways by which it can attract capable students from the southern side of the States capital city, Sydney, Australia. The paper describes the concept of limiting the required daily travel to the University through an amalgam of technologies, and changes to the core teaching syllabus. Progress through 1994, and plans for full introduction in 1995, is described.
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.
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.
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.
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 …
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 …
Performance Comparison Of Asynchronous Adders, Mark A. Franklin, Tienyo Pan
Performance Comparison Of Asynchronous Adders, Mark A. Franklin, Tienyo Pan
All Computer Science and Engineering Research
In asynchronous systems, average function delays principally govern overall throughput. This paper compares the performance of six adder designs with respect to their average delays. Our results show that asynchronous addres (32 or 64-bits) with a hybrid structure (e.g., carry-select addres) run 20-40% faster than simple ripple-carry addres. Hybrid adders also outperform high-cost, strictly synchronous conditional-sum adders.
An Evaluation Of The Pavane Visualization System, Kenneth C. Cox, Gruia-Catalin Roman
An Evaluation Of The Pavane Visualization System, Kenneth C. Cox, Gruia-Catalin Roman
All Computer Science and Engineering Research
The Pavane program visualization system is an implementation of the declarative paradigm of visualization. After a brief report on the status of the Pavane implementation, we present the results of an evaluation of the usability of Pavane. This evaluation is based on the use of Pavane by its developers to construct program visualizations, on its use in a classroom setting as a tool for examining executing programs, and on its application to some simple scientific visualizations.
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 …
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.
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 …
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 …
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, …
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 …
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) …