Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (1776)
- Washington University in St. Louis (697)
- Singapore Management University (449)
-
- Embry-Riddle Aeronautical University (436)
- Old Dominion University (380)
- University of Nebraska - Lincoln (243)
- Chulalongkorn University (234)
- Portland State University (115)
- Air Force Institute of Technology (114)
- Chapman University (94)
- University of Arkansas, Fayetteville (83)
- University of Nevada, Las Vegas (74)
- University of New Haven (71)
- University of South Florida (71)
- University for Business and Technology in Kosovo (70)
- Technological University Dublin (64)
- Purdue University (60)
- California Polytechnic State University, San Luis Obispo (46)
- University of South Carolina (41)
- Edith Cowan University (33)
- Journal of Soft Computing and Computer Applications (32)
- New Jersey Institute of Technology (31)
- University of Malaya (31)
- Loyola University Chicago (29)
- San Jose State University (29)
- City University of New York (CUNY) (28)
- Western University (27)
- University of Kentucky (25)
- Keyword
-
- Computer Science (311)
- Department of Computer Science and Engineering (284)
- Engineering (228)
- Machine learning (189)
- Deep learning (187)
-
- Simulation (179)
- College of Engineering and Computer Science (157)
- Newsletters (157)
- Science news (157)
- Technical writing (157)
- Genetic algorithm (107)
- Classification (101)
- Computer Engineering (100)
- Optimization (97)
- Particle swarm optimization (85)
- Path planning (85)
- Machine Learning (82)
- Security (75)
- Artificial intelligence (70)
- Computer Sciences (68)
- Physical Sciences and Mathematics (64)
- Cybersecurity (61)
- Virtual reality (58)
- Reinforcement learning (57)
- Robotics (57)
- Digital forensics (56)
- Modeling (56)
- Clustering (55)
- Support vector machine (55)
- Neural network (52)
- Publication Year
- Publication
-
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Computer Science & Engineering Syllabi (1312)
- All Computer Science and Engineering Research (683)
- Research Collection School Of Computing and Information Systems (431)
-
- Browse all Theses and Dissertations (307)
- Journal of Digital Forensics, Security and Law (298)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (234)
- BITs and PCs Newsletter (157)
- School of Computing: Dissertations, Theses, and Student Research (152)
- Theses and Dissertations (147)
- Electrical & Computer Engineering Theses & Dissertations (137)
- Annual ADFSL Conference on Digital Forensics, Security and Law (104)
- Dissertations (82)
- Computer Science Faculty Publications and Presentations (80)
- Electrical & Computer Engineering and Computer Science Faculty Publications (70)
- Engineering Faculty Articles and Research (67)
- USF Tampa Graduate Theses and Dissertations (62)
- Faculty Publications (61)
- Computer Science Faculty Publications (55)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (54)
- Electronic Theses and Dissertations (53)
- UBT International Conference (51)
- School of Computing: Conference and Workshop Papers (45)
- Computer Science Theses & Dissertations (40)
- Graduate Theses and Dissertations (33)
- Journal of Soft Computing and Computer Applications (32)
- Dissertations and Theses (31)
- Computer Science: Faculty Publications and Other Works (29)
- Computational Modeling & Simulation Engineering Theses & Dissertations (28)
- Publication Type
- File Type
Articles 12631 - 12660 of 13035
Full-Text Articles in Computer Engineering
An Error Control Scheme For Large-Scale Multicast Applications, Christos Papadopoulos, Guru Parulkar, George Varghese
An Error Control Scheme For Large-Scale Multicast Applications, Christos Papadopoulos, Guru Parulkar, George Varghese
All Computer Science and Engineering Research
Retransmission based error control for large scale multicast applications is difficult because of two main problems: request implosion and lack of local recovery. Existing schemes (SRM, RMTP, TMTP, LBRRM) have good solutions to request implosion, but only approximate solutions (e.g., based on scoped multicast) for the local recovery problem. Our scheme achieves finer grain fault recovery by exploiting new forwarding services that allow us to create a dynamic hierarchy of receivers. We use a new paradigm, where routers provide a more refined form of multicasting (that may be useful to other applications), that enables local recovery. The new services, however, …
The Programmers' Playground Application Management System User Guide, William M. Shapiro, T. Paul Mccartney, E.F. Berkley Shands
The Programmers' Playground Application Management System User Guide, William M. Shapiro, T. Paul Mccartney, E.F. Berkley Shands
All Computer Science and Engineering Research
Application Management permits the advertising, launching, and configuring of distributed applications created using the Programmers' Playground. Applications can be documented and made available to end-users through the use of application pages on the World Wide Web. The launching and configuring of applications is performed by a brokerage system consisting of an applicatoin broker and one or more hierarchies of module launchers. This document describes how to setup and use the components of the Application Management system.
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 …
Dynamic Flow Switching: A New Communication Service For Atm Networks, Qiyong Bian, Kohei Shimoto, Jonathan Turner
Dynamic Flow Switching: A New Communication Service For Atm Networks, Qiyong Bian, Kohei Shimoto, Jonathan Turner
All Computer Science and Engineering Research
This paper presents a new communication service for ATM networks that provides one-way, adjustable rate, on-demand communication channels. The proposed dynamic flow service is designed to operate within a multi-service cell switched network that supports both conventional switched virtual circuits and IP packet routing and is designed to complement those services. It is particularly well suited to applications that transmit substantial amounts of data (a few tens of kilobytes or more) in fairly short time periods (up to a few seconds). Much of the current world-wide web traffic falls within this domain. Like IP packet networks, the new service permits …
Sequence Assembly Validation By Restriction Digest Fingerprint Comparison, Eric C. Rouchka, David J. States
Sequence Assembly Validation By Restriction Digest Fingerprint Comparison, Eric C. Rouchka, David J. States
All Computer Science and Engineering Research
DNA sequence analysis depends on the accurate assembly of fragment reads for the determination of a consensus sequence. Genomic sequences frequently contain repeat elements that may confound the fragment assembly process, and errors in fragment assembly, and errors in fragment assembly may seriously impact the biological interpretation of the sequence data. Validating the fidelity of sequence assembly by experimental means is desirable. This report examines the use of restriction digest analysis as a method for testing the fidelity of sequence assembly. Restriction digest fingerprint matching is an established technology for high resolution physical map construction, but the requirements for assembly …
Reducing Web Latencies Using Precomputed Hints, Girish P. Chandranmenon, George Varghese
Reducing Web Latencies Using Precomputed Hints, Girish P. Chandranmenon, George Varghese
All Computer Science and Engineering Research
Current network technology is bandwidth-rich but latency-poor; thus round-trip delays will dominate access latency for web traffic. We describe four new techniques that reduce the round-trips needed for web accesses. The techniques are based on the paradigm of preprocessing a web page to collect information about links and inline data in the page. Stored Address Binding almost always eliminates the DNS lookup (which can cost seconds) at the start of a transaction. In Informed Server Proxying, a server tells its client that it has cached pages referenced in a page the client just retrieved; this allows the client to retrieve …
Lyceum: A Multi-Protocol Digital Library Gateway, Ming-Hokng Maa, Michael L. Nelson, Sandra L. Esler
Lyceum: A Multi-Protocol Digital Library Gateway, Ming-Hokng Maa, Michael L. Nelson, Sandra L. Esler
Computer Science Faculty Publications
Lyceum is a prototype scalable query gateway that provides a logically central interface to multi-protocol and physically distributed, digital libraries of scientific and technical information. Lyceum processes queries to multiple syntactically distinct search engines used by various distributed information servers from a single logically central interface without modification of the remote search engines. A working prototype (http://www.larc.nasa.gov/lyceum/) demonstrates the capabilities, potentials, and advantages of this type of meta-search engine by providing access to over 50 servers covering over 20 disciplines.
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 10, December 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 10, December 1996, 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.
A Specialization Toolkit To Increase The Diversity Of Operating Systems, Calton Pu, Andrew P. Black, Crispin Cowan, Jonathan Walpole, Charles Consel
A Specialization Toolkit To Increase The Diversity Of Operating Systems, Calton Pu, Andrew P. Black, Crispin Cowan, Jonathan Walpole, Charles Consel
Computer Science Faculty Publications and Presentations
Virus and worm attacks that exploit system implementation details can be countered with a diversified set of implementations. Furthermore, immune systems show that attacks from previously unknown organisms require effective dynamic response. In the Synthetix project, we have been developing a specialization toolkit to improve the performance of operating system kernels. The toolkit helps programmers generate and manage diverse specialized implementations of software modules. The Tempo-C specializer tool generates different versions for both compile-time and run-time specialization. We are now adapting the toolkit to improve operating system survivability against implementations attacks.
Multimedia Applications Require Adaptive Cpu Scheduling, Veronica Baiceanu, Crispin Cowan, Dylan Mcnamee, Calton Pu, Jonathan Walpole
Multimedia Applications Require Adaptive Cpu Scheduling, Veronica Baiceanu, Crispin Cowan, Dylan Mcnamee, Calton Pu, Jonathan Walpole
Computer Science Faculty Publications and Presentations
CPU scheduling and admission testing for multimedia applications have been extensively studied, and various solutions have been proposed using assorted simplifying assumptions. However, we believe that the complexity and dynamic behavior of multimedia applications and systems make static solutions hard to apply in real-world situations. We are analyzing the difficulties that arise when applying the rate-monotonic (RM) scheduling algorithm and the corresponding admission tests for CPU management, in the context of real multimedia applications running on real systems. RM requires statically predictable, periodic workloads, and while multimedia applications appear to be periodic, in practice they exhibit numerous variabilities in workload. …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 9, November 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 9, November 1996, 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 12, Number 8, October 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 8, October 1996, 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.
An Empirical Comparison Of Networks And Routing Strategies For Parallel Computation, Ronald I. Greenberg, Lee Guan
An Empirical Comparison Of Networks And Routing Strategies For Parallel Computation, Ronald I. Greenberg, Lee Guan
Computer Science: Faculty Publications and Other Works
This paper compares message routing capabilities of important networks proposed for general-purpose parallel computing. All the networks have been proven to have some type of universality property, i.e., an ability to simulate other networks of comparable cost with modest slowdown, using appropriate cost and communication models. But in this paper we seek an empirical comparison of communication capability under typical direct use rather than an analysis of worst-case results for simulating message traffic of another network.
Resource/Dataflow Graph Operating System Development, Sriram J. Coimbatore
Resource/Dataflow Graph Operating System Development, Sriram J. Coimbatore
Electrical & Computer Engineering Theses & Dissertations
Implementation of a new dataflow schedule model is the objective of this thesis. The dataflow model algorithm called the resource/dataflow graph model is implemented on a peer-to-peer communication network comprising of six personal computers. This dataflow model is implemented making use of an earlier dataflow model called ATAMM (Algorithm to Architecture Mapping Model) developed by ODU and National Aeronautics and Space Administration (NASA). Development issues include modification of the RDFG testbed operating system and a scheme to transfer data buffers using the ethernet channel from one processor to another processor. This, in turn, equips each sub-module of an application with …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 7, September 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 7, September 1996, 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.
Search For Cp Violation In The Decay Z → B B̄ G, Buskulic, D.; Et Al., M. Thulasidas
Search For Cp Violation In The Decay Z → B B̄ G, Buskulic, D.; Et Al., M. Thulasidas
Research Collection School Of Computing and Information Systems
About three million hadronic decays of the Z collected by ALEPH in the years 1991 to 1994 are used to search for anomalous CP violation beyond the Standard Model in the decay Z → bb̄g. The study is performed by analyzing angular correlations between the two quarks and the gluon in three-jet events and by measuring the differential two-jet rate. No signal of CP violation is found. For the combinations of anomalous CP violating couplings, ĥb = ĥAbgVh - ĥVbgAb and hb* = √ĥVb2 + ĥAb2, limits of | ĥb | b*
An Empirical Comparison Of Area-Universal And Other Parallel Computing Networks, Ronald I. Greenberg, Lee Guan
An Empirical Comparison Of Area-Universal And Other Parallel Computing Networks, Ronald I. Greenberg, Lee Guan
Computer Science: Faculty Publications and Other Works
This paper provides empirical comparison of the communication capabilities of two area-universal networks, the fat-tree and the fat-pyramid, to the popular mesh and hypercube networks for parallel computation. While area-universal networks have been proven capable of simulating, with modest slowdown, any computation of any other network of comparable area, prior work has generally left open the question of how area-universal networks compare to other networks in practice. Comparisons are performed using techniques of throughput and latency analysis that have previously been applied to k-ary n-cube networks and using various existing models to equate the hardware cost of the networks being …
Search For Charginos And Neutralinos With R-Parity Violation At √S = 130 And 136 Gev, Buskulic, D.; Et Al., M. Thulasidas
Search For Charginos And Neutralinos With R-Parity Violation At √S = 130 And 136 Gev, Buskulic, D.; Et Al., M. Thulasidas
Research Collection School Of Computing and Information Systems
Searches for charginos and neutralinos produced in e +e - collisions at centre-of-mass energies of 130 and 136 GeV have been performed under the assumptions that R-parity is not conserved, that the dominant R-parity violating coupling involves only leptonic fields, and that the lifetime of the lightest supersymmetric particle can be neglected. In the 5.7 pb -1 data sample collected by ALEPH, no candidate events were found. As a result, chargino and neutralino masses and couplings are constrained and the domains previously excluded at LEP1 are extended.
Mass Limit For The Standard Model Higgs Boson With The Full Lep I Aleph Data Sample, Buskulic, D.; Et Al., M. Thulasidas
Mass Limit For The Standard Model Higgs Boson With The Full Lep I Aleph Data Sample, Buskulic, D.; Et Al., M. Thulasidas
Research Collection School Of Computing and Information Systems
The reaction e+e− → HZ∗ is used to search for the standard model Higgs boson in the Hνν and the Hℓ+ℓ− channels. The data sample corresponds to about 4.5 million hadronic Z decays collected by the ALEPH experiment at LEP from 1989 to 1995 at centre-of-mass energies at and around the Z peak. Three candidate events are found in the Hμ+μ− channel, in agreement with the expected background from the electroweak process e+e− ℓ+ℓ−qq. This search results in a 95% C.L. lower limit on the Higgs boson mass of 63.9 GeV/c2.
Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon
Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon
Research Collection School Of Computing and Information Systems
This article introduces a neural network based cognitive architecture termed Concept Hierarchy Memory Model (CHMM) for conceptual knowledge representation and commonsense reasoning. CHMM is composed of two subnetworks: a Concept Formation Network (CFN), that acquires concepts based on their sensory representations; and a Concept Hierarchy Network (CHN), that encodes hierarchical relationships between concepts. Based on Adaptive Resonance Associative Map (ARAM), a supervised Adaptive Resonance Theory (ART) model, CHMM provides a systematic treatment for concept formation and organization of a concept hierarchy. Specifically, a concept can be learned by sampling activities across multiple sensory fields. By chunking relations between concepts as …
Visual Speech Recognition Using Multiple Deformable Lip Models, Devi Chandramohan
Visual Speech Recognition Using Multiple Deformable Lip Models, Devi Chandramohan
Electrical & Computer Engineering Theses & Dissertations
Motivated by the fact that human speech perception is a bimodal process (auditory and visual), several researchers have designed and implemented automatic speech recognition (ASR) systems consisting of both audio and visual subsystems, and shown improved performance relative to traditional purely auditory systems. Several visual speech reading approaches have used deformable templates to model the shape of a speaker's lips. Deformable templates are models of image objects, which can be deformed by adjusting a set of parameters to match the object in some optimal way, as defined by a cost function. Using a single deformable lip model has disadvantages such …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 6, June 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 6, June 1996, 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 12, Number 5, May 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 5, May 1996, 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.
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 4, April 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 4, April 1996, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A six page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Scheduling Processors For Distributed, Critical, Real-Time Systems, Hari K. Narasimhamurthy
Scheduling Processors For Distributed, Critical, Real-Time Systems, Hari K. Narasimhamurthy
Electrical & Computer Engineering Theses & Dissertations
The development of a procedure to obtain cyclo-static schedules for distributed, critical real-time applications is presented in this thesis. The applications considered in this thesis are characterized by hard deadlines and periodic inputs. The applica tions are described by a data flow graph model which guarantees performance. Given the data flow graph representation, processors are scheduled to complete tasks as specified in the representation. The scheduling technique separates the scheduling of tasks in time and the assignment of processors to tasks. While different criteria exist for task scheduling, a schedule which minimizes latency and maximizes throughput is used in this …
Speech Feature Computation For Visual Speech Articulation Training, Stefan Auberg
Speech Feature Computation For Visual Speech Articulation Training, Stefan Auberg
Electrical & Computer Engineering Theses & Dissertations
A new version of the Visual Speech Articulation Training Aid was implemented which provides real-time visual feedback for speech articulation training. This version was migrated to a Windows Multimedia PC from a previous version which used a Personal Computer (PC) system and additional specialized and expensive custom hardware. This new version will make the system more available to schools and private users. A new method was developed for computing spectral/temporal features which characterize the speech sounds. In addition to the typical frame-based spectral analysis parameters, the new method represents temporal changes of the spectrum with a small number of features. …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 3, March 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 3, March 1996, 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 12, Number 2, February 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 2, February 1996, 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.
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 1, January 1996, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 1, January 1996, 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.
Compile-Time Performance Prediction Of Hpf/Fortran 90d, Manish Parashar, Salim Hariri
Compile-Time Performance Prediction Of Hpf/Fortran 90d, Manish Parashar, Salim Hariri
Electrical Engineering and Computer Science - All Scholarship
In this paper we present an interpretive approach for accurate and cost-effective performance prediction in a high performance computing environment, and describe the design of a compile-time HPF/Fortran 90D performance prediction framework based on this approach. The performance prediction framework has been implemented as a part of the HPF/Fortran 90D application development environment that integrates it with a HPF/Fortran 90D compiler and a functional interpreter. The current implementation of the environment framework is targeted to the iPSC/860 hypercube multicomputer system. A set of benchmarking kernels and application codes have been used to validate the accuracy, utility, and usability of the …