Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (1814)
- University of Nebraska - Lincoln (1069)
- University of Texas at El Paso (858)
-
- Washington University in St. Louis (733)
- Technological University Dublin (731)
- California Polytechnic State University, San Luis Obispo (721)
- Brigham Young University (641)
- Old Dominion University (579)
- Embry-Riddle Aeronautical University (563)
- Singapore Management University (546)
- Universitas Indonesia (443)
- San Jose State University (439)
- Santa Clara University (419)
- Air Force Institute of Technology (414)
- Marquette University (412)
- University of South Carolina (320)
- California State University, San Bernardino (288)
- University of Central Florida (271)
- Portland State University (265)
- Chulalongkorn University (243)
- Al Iraqia University (235)
- Purdue University (218)
- University of South Florida (218)
- University of Arkansas, Fayetteville (207)
- University of Nevada, Las Vegas (191)
- New Jersey Institute of Technology (185)
- Nova Southeastern University (183)
- University of Dayton (166)
- Keyword
-
- Machine learning (439)
- Computer Science (385)
- Deep learning (347)
- Department of Computer Science and Engineering (319)
- Machine Learning (287)
-
- Engineering (274)
- Simulation (237)
- Robotics (231)
- Security (183)
- Artificial intelligence (173)
- Deep Learning (170)
- Optimization (170)
- Computer Engineering (168)
- Classification (163)
- College of Engineering and Computer Science (157)
- Newsletters (157)
- Science news (157)
- Technical writing (157)
- Cybersecurity (154)
- Artificial Intelligence (148)
- Computer vision (141)
- Computer Science and Engineering (137)
- Genetic algorithm (119)
- Blockchain (99)
- Internet (97)
- Virtual reality (97)
- Path planning (94)
- Data mining (93)
- Clustering (91)
- Privacy (91)
- Publication Year
- Publication
-
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Computer Science & Engineering Syllabi (1312)
- Departmental Technical Reports (CS) (760)
- Theses and Dissertations (730)
-
- All Computer Science and Engineering Research (683)
- International Congress on Environmental Modelling and Software (629)
- Research Collection School Of Computing and Information Systems (511)
- Department of Electrical and Computer Engineering: Faculty Publications (496)
- Makara Journal of Technology (436)
- Electrical and Computer Engineering Faculty Research and Publications (389)
- Browse all Theses and Dissertations (342)
- Electronic Theses and Dissertations (341)
- Dissertations (340)
- Faculty Publications (321)
- Journal of Digital Forensics, Security and Law (299)
- Computer Science and Engineering Senior Theses (298)
- 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 (220)
- School of Computing: Dissertations, Theses, and Student Research (206)
- Electrical and Computer Engineering Faculty Publications (204)
- Electrical & Computer Engineering Theses & Dissertations (193)
- Conference papers (178)
- Publications (169)
- BITs and PCs Newsletter (157)
- USF Tampa Graduate Theses and Dissertations (157)
- Journal of International Technology and Information Management (153)
- Publication Type
- File Type
Articles 24661 - 24690 of 25629
Full-Text Articles in Engineering
Modeling Mobile Ip In Mobile Unity, Peter J. Mccann, Gruia-Catalin Roman
Modeling Mobile Ip In Mobile Unity, Peter J. Mccann, Gruia-Catalin Roman
All Computer Science and Engineering Research
With recent advances in wireless communication technology, mobile computing is an increasingly important area of research. A mobile system is one where independently executing components may migrate through some space during the course of the computation, and where the pattern of connectivity among the components changes as they move in and out of proximity. Mobile UNITY is a notation and proof logic for specifying and reasoning about mobile systems. In this paper it is argued that Mobile UNITY contributes to the modular development of system specifications because of the declarative fashion in which coordination among components is specified. The packet …
A Simplified Reservation And State Setup Protocol, Hari Adiseshu, Guru Parulkar, Subhash Suri
A Simplified Reservation And State Setup Protocol, Hari Adiseshu, Guru Parulkar, Subhash Suri
All Computer Science and Engineering Research
The last few years have seen the development of a model for Integrated Services Internet, which extends the traditional Internet by adding multiple service classes in addition to the traditional best effort service class, and a signaling protocol called RSVP for applications to reserve resources. While this framework has been standardized in the IETF WGs and the RSVP protocol has been defined, there has been no movement towards a commercial implementation of this framework, principally due to its perceived complexity and lack of scalability. This paper analyzes RSVP, discusses some of the its bottlenecks and shows how they can be …
Tcp/Ip Implementation With Endsystem Qos, Sherlia Y. Shi, Gurudatta M. Parulkar, R. Gopalakrishnan
Tcp/Ip Implementation With Endsystem Qos, Sherlia Y. Shi, Gurudatta M. Parulkar, R. Gopalakrishnan
All Computer Science and Engineering Research
This paper presents a Real-time Upcall (RTU) [1] based TCP/IP implementation that guarantees throughput for continuous media applications and ensures low latency bounds for interactive applications. RTU is an endsystem rate-based scheduling mechanism that provides quality of service (QoS) in terms of CPU cycles, to applications. We restructured the existing NetBSD TCP/IP implementation to exploit the RTU concurrency model and to provide predictable performance. Our experimental results show that on two 200 MHz NetBSD PCs connected by a 155Mbps ATM link, the RTU based kernel TCP/IP implementation provides excellent throughput guarantees for periodic connections regardless the system or network load. …
Application Development And Management In The Programmers' Playground, T. Paul Mccartney, E.F. Berkley Shands, Kenneth J. Goldman, William M. Shapiro
Application Development And Management In The Programmers' Playground, T. Paul Mccartney, E.F. Berkley Shands, Kenneth J. Goldman, William M. Shapiro
All Computer Science and Engineering Research
Application management refers to the process of making software applications available to end-users and providing automated mechanisms for launching and joining such applications. The Programmers' Playground is a computing environment for creating distributed applications from modular, reusable components. This paper discusses a set of tools that enable application developers to: (1) design and debug Playground distributed applications from existing "off-the-shelf" components using a visual configuration tool, (2) make new application components available on the Internet through a "launcher" service, and (3) make complete distributed applications available via a World Wide Web interface, enabling end-users to launch and join the applications …
Terabit Burst Switching Progress Report (6/98-9/98), Jonathan S. Turner
Terabit Burst Switching Progress Report (6/98-9/98), Jonathan S. Turner
All Computer Science and Engineering Research
This report summarizes progress on the Terabit Burst Switching Project at Washington University for the period from June 15, 1998 through September 15, 1998.
Agnostic Learning Of Geometric Patterns, Sally A. Goldman, Stephen S. Kwek, Stephen D. Scott
Agnostic Learning Of Geometric Patterns, Sally A. Goldman, Stephen S. Kwek, Stephen D. Scott
All Computer Science and Engineering Research
Goldberg, Goldman, and Scott demonstrated how the problem of recognizing a landmark from a one-dimensional visual image can be mapped to that of learning a one-dimensional geometric pattern and gave a PAC algorithm to learn that class. In this paper, we present an efficient on-line agnostic learning algorithm for learning the class of constant-dimension geometric patterns. Our algorithm can tolerate both classification and attribute noise. By working in higher dimensional spaces we can represent more features from the visual image in the geometric pattern. Our mapping of the data to a geometric pattern, and hence our learning algorithm, is applicable …
Fault-Tolerant Mobile Ip, Rajib Ghosh, George Varghese
Fault-Tolerant Mobile Ip, Rajib Ghosh, George Varghese
All Computer Science and Engineering Research
We describe mechanisms to enhance the reliability and performance of Mobile IP. In Mobile IP today home agents and foreign agents are single points of failure and potential performance bottlenecks. For example, a home agent crash can lead to communication failure if the mobile is away from home. In this paper we describe new mechanisms to allow redundant home and foreign agents. Redundant agents can take over from each other in case of failure, and also split load amongst themselves. Our mechanisms are simple, transparent to existing mobile nodes, and compatible with the existing Mobile IP specification. We have implemented …
On-Line Scheduling With Hard Deadlines, Sally A. Goldman, Jyoti Parwatikar, Subhash Suri
On-Line Scheduling With Hard Deadlines, Sally A. Goldman, Jyoti Parwatikar, Subhash Suri
All Computer Science and Engineering Research
We study non-preemptive, online admission control in the hard deadline model: each job must be either serviced prior to its deadline, or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be started. The goal is to maximize total resource utilization. The jobs are non-preemptive and exclusive, meaning once a job begins, it runs to completion, and at most one job can use …
Learning From Examples With Unspecified Attribute Values, Sally A. Goldman, Stephen S. Kwek, Stephen D. Scott
Learning From Examples With Unspecified Attribute Values, Sally A. Goldman, Stephen S. Kwek, Stephen D. Scott
All Computer Science and Engineering Research
We introduce the UAV learning model in which some of the attributes in the examples are unspecified. In our model, an example x is classified positive (resp., negative) if all possible assignments for the unspecified attributes result in a positive (resp., negative) classification. Otherwise the classificatoin given to x is "?" (for unknown). Given an example x in which some attributes are unspecified, the oracle UAV-MQ responds with the classification of x. Given a hypothesis h, the oracle UAV-EQ returns an example x (that could have unspecified attributes) for which h(x) is incorrect. We show that any class learnable in …
Diagnostic Screening Of Digital Mammograms Using Wavelets And Neural Networks To Extract Structure, Barry L. Kalman, Stan C. Kwasny, William R. Reinus
Diagnostic Screening Of Digital Mammograms Using Wavelets And Neural Networks To Extract Structure, Barry L. Kalman, Stan C. Kwasny, William R. Reinus
All Computer Science and Engineering Research
As the primary tool for detecting breast carcinoma, mammography provides visual images from which a trained radiologist can identify suspicious areas that suggest the presence of cancer. We describe an approach to image processing that reduces an image to a small number of values based on its structural characteristics using wavelets and neural networks. To illustrate its utility, we apply this methodology to the automatic screening of mammograms for mass lesions. Our results approach performance levels of trained human mammographers.
Routing Table Compression Using Binary Tree Collapse, Jonathan Turner, Qiyong Bian, Marcel Waldvogel
Routing Table Compression Using Binary Tree Collapse, Jonathan Turner, Qiyong Bian, Marcel Waldvogel
All Computer Science and Engineering Research
This paper describes an algorithm which can roughly halve the size of the current Internet routing tables. This algorithm is based on the radix trie representation of routing tables, which was firstly used in the BSD Unix distributions. The binary tree representation, which is a simplified case of radix tree, does well at showing the relationships among all routing table entries and provides us a way to build a collapse algorithm based on its internal structure. The binary tree collapse algorithm consists of three techniques, with the first two quite intuitive while the third is a bit more elaborate. All …
Master Of Science Degree Programs 1998, Nova Southeastern University
Master Of Science Degree Programs 1998, Nova Southeastern University
College of Engineering and Computing Course Catalogs
No abstract provided.
Router Plugins: A Modular And Extensible Software Framework For Modern High Performance Integrated Services Routers, Dan Decasper, Zubin Dittia, Guru Parulkar, Bernhard Plattner
Router Plugins: A Modular And Extensible Software Framework For Modern High Performance Integrated Services Routers, Dan Decasper, Zubin Dittia, Guru Parulkar, Bernhard Plattner
All Computer Science and Engineering Research
Present day routers typically employ monolithic operating systems which are not easily upgraded and extensible. WIth the rapid rate of protocol development it is becoming increasingly important to dynamically upgrade router software in an incremental fashion. We have designed and implemented a high performance, modular, extended integrated services router software architecture in the NetBSD operating system kernel. This architecture allows code modules, called plugins, to be dynamically added and configured at run time. One of the novel features of our design is the ability to bind different plugins to individual flows; this allows for distinct plugin implementations to seamlessly coexist …
Terabit Burst Switching Progress Report (12/97-2/98), Jonathan S. Turner
Terabit Burst Switching Progress Report (12/97-2/98), Jonathan S. Turner
All Computer Science and Engineering Research
This report summarizes progress on the Terabit Burst Switching Project at Washington University for the period from December 15, 1997 through March 15, 1998. Efforts during this period have concentrated on working out details of the burst switch architecture, evaluating a variety of implementation alternatives and developing the physical design of the 160 Gb/s ATM switch to allow demonstration of the burst switch within a realistic network context.
Integrating A Constraint Mechanism With The Javabeans Model, William M. Shapiro
Integrating A Constraint Mechanism With The Javabeans Model, William M. Shapiro
All Computer Science and Engineering Research
The JavaBeans component model allows users to plug together software components to create Java applications by specifying simple relationships between component events and properties. This paper describes work on augmenting the simple JavaBeans model with a multi-way constraint mechanism that allows users to graphically specify more complex multi-way contraints, resolve cyclical constraints between bean properties and graphically layout bean components. We also discuss weaknesses in the JavaBeans model and Java Abstract Windowing Toolkit (AWT) that were discovered while integrating a constraint mechanism with JavaBeans.
Lime: Linda Meets Mobility, Gian Pietro Picco, Amy L. Murphy, Gruia-Catalin Roman
Lime: Linda Meets Mobility, Gian Pietro Picco, Amy L. Murphy, Gruia-Catalin Roman
All Computer Science and Engineering Research
LIME is a system designed to assist in the rapid development of dependable mobile applications over both wired and ad hoc networks. Mobile agents reside on mobile hosts and all communication takes place via transiently shared tuple spaces distributed across the mobile hosts. The decoupled style of computing characterizing the Linda model is extended to the mobile environment. At the application level, both agents and hosts perceive movement as a sudden change of context. The set of tuples accessible by a particular agent residing on a given host is altered transparently in response to changes in the connectivity pattern among …
Tcp Dynamic Acknowledgment Delay: Theory And Practice, Daniel R. Dooly, Sally A. Goldman, Stephen D. Scott
Tcp Dynamic Acknowledgment Delay: Theory And Practice, Daniel R. Dooly, Sally A. Goldman, Stephen D. Scott
All Computer Science and Engineering Research
We study an on-line problem that is motivated by the networking problem of dynamically adjusting delays of acknowledgments in the Transmission Control Protocol (TCP). The theoretical problem we study is the following. There is a sequence of n packet arrival times A = and a look-ahead coefficient L. The goal is to partition A into k subsequences sigma1, sigma2, ...,sigmak (where a subsequence end is defined by an acknowledgment) that minimizes a linear combination of the cost for the number of acknowledgments sent and the cost for the additional latency introduced by delaying acknowledgments. At each arrival, an oracle provides …
The Playground Mediator: Visual Tool For Configuring And Debugging Distributed Applications, T. Paul Mccartney
The Playground Mediator: Visual Tool For Configuring And Debugging Distributed Applications, T. Paul Mccartney
All Computer Science and Engineering Research
The Mediator is a visual configuration tool for use with The Programmers' Playground distributed programming environment. With the Mediator, one can interactively launch distributed application modules, configured communication among the modules, observe communication patterns, interactively control module communication, kill running modules, and receive imported applications from a separate World Wide Web interface. This manual describes how to use the Mediator both as a stand-alone configuration tool and as a visual interface to the Playground Application Management System.
Integrating Security Into The Curriculum, Cynthia E. Irvine, Shiu-Kai Chin, Deborah Frincke
Integrating Security Into The Curriculum, Cynthia E. Irvine, Shiu-Kai Chin, Deborah Frincke
Electrical Engineering and Computer Science - All Scholarship
The number of skilled practitioners of computer security who are able to address the complexities of modern technology and are familiar with successful approaches to system security is very small. People want security but are faced with two difficulties. First, they do not know how to achieve it in the context of their enterprises. They may not even know of a way to translate organizational procedures into policies, much less implement a set of mechanisms to enforce those policies. Second, they have no way of knowing whether their chosen mechanisms are effective. The recent US Presidential Commission on Critical Infrastructure …
Building A Secure Intranet, Fred J. Berryman
Building A Secure Intranet, Fred J. Berryman
Theses
This thesis will explain the vulnerabilities of computers in a networking environment and demonstrate proper procedures for building a secure Intranet.
The Internet is built around the concept of open communication. Data is shared around the globe just as easily as it is from one office or cubical to the next. Corporations are skeptical about putting company data on such a public transport mechanism as the Internet, but the tools used on the Internet are exciting and everyone wants to use them. Out of a desire for the best of both worlds, the Intranet was born.
An intranet that has …
Cognitive Agents, Michael N. Huhns, Munindar P. Singh
Cognitive Agents, Michael N. Huhns, Munindar P. Singh
Faculty Publications
Several researchers have proposed using cognitive concepts as a semantic basis for agent communications (M.N. Huhns and M.P. Singh, 1997). One of the leading candidates for such a semantics is based on Arcol, the communication language used within Artimis. Interestingly, this application (not only of Arcol, but also in general) appears extremely misguided. The intentional concepts are well suited to designing agents, but are not suited to giving a basis to a public, standardizable view of communication. A challenge for using the cognitive concepts is that although they are natural in several respects and can guide implementations, full blown implementations …
Personal Assistants, Michael N. Huhns, Munindar P. Singh
Personal Assistants, Michael N. Huhns, Munindar P. Singh
Faculty Publications
Already there are simple personal agents to help with some of our shopping. There are agents to track stocks in our portfolios, advise us on how to use particular software products, and arrange meetings within corporate workgroups. However, none of these agents takes more than one aspect of our activities into account, nor do they adapt easily to our preferences. Personal assistants, on the other hand, are agents that can represent individuals on the Web. They help users in their day-to-day activities, especially those involving information retrieval, negotiation, or coordination. A personal assistant might schedule a meeting and then, based …
Workflow Agents, Michael N. Huhns, Munindar P. Singh
Workflow Agents, Michael N. Huhns, Munindar P. Singh
Faculty Publications
Software agents as user agents, resource agents, and brokers may be able to enhance usefulness of workflow applications. Workflow technology is important to network computing because workflows exist naturally wherever distributed resources are interrelated. The problem with current workflow technology is that it is often too rigid. The lack of freedom accorded to human participants causes workflow management systems to appear unfriendly. As a result, they are often ignored or circumvented. This rigidity also causes productivity losses by making it harder to accommodate the flexible, ad hoc reasoning of human intelligence. Another challenge is that system requirements are rarely static. …
All Agents Are Not Created Equal, Michael N. Huhns, Munindar P. Singh
All Agents Are Not Created Equal, Michael N. Huhns, Munindar P. Singh
Faculty Publications
As the technology advances, we can expect the development of specialized agents to be used as standardized building blocks for information systems. Two trends lend credence to such a prediction. First, software systems in general are being constructed with larger components, such as ActiveX and JavaBeans, which are becoming closer to being agents themselves. They have more functionality than simple objects, respond to events autonomously, and, most importantly, respond to system builders at development time, as well as to events at runtime. Moreover, there is a move toward more cooperative information systems, in which the architecture itself plays an important …
Anthropoid Agents, Michael N. Huhns, Munindar P. Singh
Anthropoid Agents, Michael N. Huhns, Munindar P. Singh
Faculty Publications
In the study of agents on the Internet, we often ascribe to them human qualities, such as beliefs and intentions. These qualities are best understood as metaphors that give developers a way to talk about and design the capabilities and applications of agents. Despite all the progress in computing, users have been slow to accept the technology. They have often accepted what was thrown at them, but only under economic duress. Bringing the technology closer to their emotional needs might ease this resistance. So how can we put a human face on computing? Maybe by putting an animated face on …
A Corba-Base Integration Of Distributed Electronic Healthcare Records Using The Synapses Approach, Jane Grimson, William Grimson, Damon Berry, Gaye Stephens, Eoghan Felton, Dipak Kalra, Pieter Toussaint, Onno Weir
A Corba-Base Integration Of Distributed Electronic Healthcare Records Using The Synapses Approach, Jane Grimson, William Grimson, Damon Berry, Gaye Stephens, Eoghan Felton, Dipak Kalra, Pieter Toussaint, Onno Weir
Articles
The ability to exchange in a meaningful, secure, and simple fashion relevant healthcare data about patients is seen as vital in the context of efficient and cost-effective shared or team-based care. The electronic healthcare record (EHCR) lies at the heart of this information exchange, and it follows that there is an urgent need to address the ability to share EHCR's or parts of records between carers and across distributed health information systems. This paper presents the Synapses approach to sharing based on a standardized shared record, the Federated Healthcare Record, which is implemented in an open and flexible manner using …
Electromagnetic Beam Directing Means-Sample Analysis System Stage, And Method Of Use, Daniel W. Thomspon, Darin W. Glenn, John A. Woollam
Electromagnetic Beam Directing Means-Sample Analysis System Stage, And Method Of Use, Daniel W. Thomspon, Darin W. Glenn, John A. Woollam
Department of Electrical and Computer Engineering: Faculty Publications
Disclosed is an electromagnetic beam directing means for use with sample analysis systems, such as relfectometers, ellipsometers and polarimeters and the like, use of which facilitates investigation of sample systems which are not mounted to a sample analysis system sample system supporting stage. The present invention eliminates the requirement os extensice sample analysis system component realignment when alternatingly performing analysis of sample systems mounted upon, and mounted other than upon, a sample analysis system sample system supporting stage.
A Multithreaded Scheduler For A High-Speed Simulator, Gene Saghi, Kirk Reinholtz, Paul Savory
A Multithreaded Scheduler For A High-Speed Simulator, Gene Saghi, Kirk Reinholtz, Paul Savory
Department of Industrial and Management Systems Engineering: Faculty Publications
The Cassini spacecraft is on its journey to Saturn to perform a close-up study of the Saturnian system; its rings, moons, magneto-sphere, and the planet itself. Sequences of commands will be sent to the spacecraft by ground personnel to control every aspect of the mission. To validate and verify these command sequences, a bit-level, high-speed simulator (HSS) has been developed. To maximize performance, the HSS is implemented with multiple threads and runs on a multiprocessor system. A key component of the HSS is the scheduler, which controls the execution of the simulator. The general framework of the scheduler can be …
A New Radiosonde System For Profiling The Lower Troposphere, Brian R Corner, Robert D. Palmer
A New Radiosonde System For Profiling The Lower Troposphere, Brian R Corner, Robert D. Palmer
Department of Electrical and Computer Engineering: Faculty Publications
A new, inexpensive radiosonde transmitter and receiver system has been developed for measuring wind field inhomogeneities in the planetary boundary layer using multiple simultaneously launched balloons. The radio- sondes use a narrowband-frequency-modulated carrier signal to transmit atmospheric pressure and temperature information to a surface receiver. The pressure and temperature data transmitted by the radiosondes allow their height above the surface to be ascertained. In addition, the radiosondes can be tracked with a photographic camera system to provide the azimuth and elevation angles of the radiosondes during their ascent, so that their three-dimensional horizontal position can be determined. By tracking the …
Ds Cdma Scheme For Watm Lan With Error Control, Beata J. Wysocki, Tadeusz A. Wysocki, Hans J. Zepernick
Ds Cdma Scheme For Watm Lan With Error Control, Beata J. Wysocki, Tadeusz A. Wysocki, Hans J. Zepernick
Department of Electrical and Computer Engineering: Faculty Publications (to 2015)
In the paper, we present simulation results for the 13 channel DS CDMA WATM LAN utilising optimized complex spreading signatures based on Walsh- Rademacber functions. The method to obtain those optimized spreading signatures, as well as the full set of the coefficients giving the minimum level of crosscorrelation between any pair of the channels is shown. The resultant system BER as well as the distribution of errors within WATM cells is given. The obtained results indicate that with the application of a hybrid ARQ scheme, capable of correcting 10 errors, the number of WATM cells which would require retransmission is …