Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (1960)
- Old Dominion University (937)
- Singapore Management University (884)
-
- Washington University in St. Louis (730)
- Embry-Riddle Aeronautical University (590)
- Air Force Institute of Technology (443)
- Missouri University of Science and Technology (440)
- Neutrosophic Systems with Applications (375)
- University of Nebraska - Lincoln (274)
- Chulalongkorn University (235)
- University of Central Florida (188)
- Portland State University (158)
- University of Nevada, Las Vegas (152)
- University of Arkansas, Fayetteville (149)
- University of South Carolina (125)
- Purdue University (118)
- Chapman University (114)
- University for Business and Technology in Kosovo (114)
- University of Kentucky (111)
- University of South Florida (104)
- Technological University Dublin (100)
- California Polytechnic State University, San Luis Obispo (79)
- University of New Haven (77)
- University of Dar es Salaam (74)
- New Jersey Institute of Technology (63)
- Michigan Technological University (61)
- University of Texas at El Paso (59)
- University of Malaya (56)
- Keyword
-
- Machine learning (392)
- Computer Science (351)
- Deep learning (301)
- Department of Computer Science and Engineering (285)
- Engineering (253)
-
- Simulation (216)
- Machine Learning (186)
- Artificial intelligence (169)
- Optimization (164)
- Technical writing (158)
- College of Engineering and Computer Science (157)
- Newsletters (157)
- Science news (157)
- Classification (130)
- Genetic algorithm (120)
- Cybersecurity (115)
- Security (108)
- Deep Learning (102)
- Reinforcement learning (102)
- Computer Engineering (101)
- Computer vision (101)
- Neural networks (99)
- Artificial Intelligence (92)
- Path planning (91)
- Particle swarm optimization (88)
- Algorithms (85)
- Clustering (79)
- Image processing (78)
- Robotics (78)
- Virtual reality (77)
- Publication Year
- Publication
-
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Computer Science & Engineering Syllabi (1312)
- Research Collection School Of Computing and Information Systems (857)
- All Computer Science and Engineering Research (683)
-
- Theses and Dissertations (503)
- Neutrosophic Systems with Applications (375)
- Browse all Theses and Dissertations (308)
- Journal of Digital Forensics, Security and Law (300)
- Electrical and Computer Engineering Faculty Research & Creative Works (282)
- Electronic Theses and Dissertations (249)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (235)
- Electrical & Computer Engineering Theses & Dissertations (217)
- Computer Science and Engineering Faculty Publications (184)
- Annual ADFSL Conference on Digital Forensics, Security and Law (174)
- BITs and PCs Newsletter (157)
- School of Computing: Dissertations, Theses, and Student Research (154)
- Faculty Publications (150)
- Electrical & Computer Engineering Faculty Publications (137)
- Dissertations (121)
- Computer Science Faculty Publications (107)
- USF Tampa Graduate Theses and Dissertations (94)
- Computer Science Faculty Publications and Presentations (83)
- Engineering Faculty Articles and Research (81)
- UBT International Conference (73)
- Electrical & Computer Engineering and Computer Science Faculty Publications (71)
- Graduate Theses and Dissertations (69)
- Tanzania Journal of Engineering and Technology (TJET) (69)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (64)
- Doctoral Dissertations (59)
- Publication Type
Articles 15031 - 15060 of 17312
Full-Text Articles in Computer Sciences
Hexa: Compact Data Structures For Faster Packet Processing, Sailesh Kumar, Jonathan Turner, Patrick Crowley, Michael Mitzenmacher
Hexa: Compact Data Structures For Faster Packet Processing, Sailesh Kumar, Jonathan Turner, Patrick Crowley, Michael Mitzenmacher
All Computer Science and Engineering Research
Directed graphs with edge labels are used in packet processing algorithms for a variety of network applications. In this paper we present a novel representation for such graph that significantly reduces the memory required for such graphs. This approach called History-based Encoding, eXecution and Addressing (HEXA) challenges the conventional assumption that graph data structures must store pointers of log2n bits to identify successor nodes. HEXA takes advantage of implict information to reduce the information that must be stored explicitly. We demonstrate that the binary tries used for IP route lookup can be implemented using just two bytes per stored prefix …
Improving Individual Flow Performance With Multiple Queue Fair Queuing, Manfred Georg, Christopher Jechlitschek, Sergey Gorinsky
Improving Individual Flow Performance With Multiple Queue Fair Queuing, Manfred Georg, Christopher Jechlitschek, Sergey Gorinsky
All Computer Science and Engineering Research
Fair Queuing (FQ) algorithms provide isolation between packet flows, allowing max-min fair sharing of a link even when flows misbehave. However, fairness comes at the expense of per-flow state. To keep the memory requirement independent of the flow count, the router can isolate aggregates of flows, rather than individual flows. We investigate the feasibility of protecting individual flows under such aggregate isolation in the context of Multiple Queue Fair Queuing (MQFQ), where the router maintains a fixed number of queues and associates multiple queues with each flow. MQFQ places packets in the shortest queue associated with their flow. The redundancy …
Single Cell Expression Profiling Reveals Major Disruption Of Dna Repair Capacity In Incipient Alzheimer's Disease, Monika Ray, Weixiong Zhang
Single Cell Expression Profiling Reveals Major Disruption Of Dna Repair Capacity In Incipient Alzheimer's Disease, Monika Ray, Weixiong Zhang
All Computer Science and Engineering Research
Understanding the pathogenesis in the early stages of late-onset Alzheimer's disease (LOAD) can help in gaining important mechanistic insights into this devastating neurodegenerative disorder. Alzheimer's disease (AD) is characterised by extensive cell death with disease progression. In this paper laser capture microdissection (LCM) based gene expression profiling, which is able to profile gene expression in a single cell type, is employed to analyse the gene expression regulation of incipient AD. Our analysis shows that LCM based gene expression profiling of neurons has a critical advantage over the conventional gene expression profiling method which uses samples of mixed cell types and …
Implementing Legba: Fine-Grained Memory Protection, Sheffield, Sowell, Wilson
Implementing Legba: Fine-Grained Memory Protection, Sheffield, Sowell, Wilson
All Computer Science and Engineering Research
Fine-grained hardware protection could provide a powerful and effective means for isolating untrusted code. However, previous techniques for providing fine-grained protection in hardware have lead to poor performance. Legba has been proposed as a new caching architecture, designed to reduce the granularity of protection, without slowing down the processor. Unfortunately, the designers of Legba have not attempted an implementation. Instead, all of their analysis is based purely on simulations. We present an implementation of the Legba design on a MIPS Core Processor, along with an analysis of our observations and results.
Configuring Low Cost Metanetworks On A Shared Substrate, Jing Lu, Jonathan Turner
Configuring Low Cost Metanetworks On A Shared Substrate, Jing Lu, Jonathan Turner
All Computer Science and Engineering Research
In a diversified internet, meta-networks (“metanets?for short) share a common substrate and offer value-added services to millions of users around the globe. Therefore, configuring low-cost metanets with links having enough bandwidth to accommodate all anticipated user traffic is critical to the success of the metanets. In this paper, we propose a novel pruning algorithm that configures metanets on any given substrate in a cost-efficient way. In contrast to other testbed configuration systems, we solve the metanet configuration problem from a higher level specification and produces a network that is dimensioned to handle the specified traffic. To the best of our …
Mobile Wireless Sensor Network Connectivity Repair With K-Redundanc, Nuzhet Atay, Burchan Bayazit
Mobile Wireless Sensor Network Connectivity Repair With K-Redundanc, Nuzhet Atay, Burchan Bayazit
All Computer Science and Engineering Research
Connectivity is an important requirement for wireless sensor networks especially in real-time monitoring and data transfer applications. However, node movements and failures change the topology of the initial deployed network, which can result in partitioning of the communication graph. In this paper, we present a method for maintaining and repairing the communication network of a dynamic mobile wireless sensor network. We assume that we cannot control the motion of wireless sensor nodes, but there are robots whose motion can be controlled by the wireless sensor nodes to maintain and repair the connectivity of the network. At the heart of our …
Leveraging Est Evidence To Automatically Predict Alternatively Spliced Genes, Master's Thesis, December 2006, Robert Zimmermann
Leveraging Est Evidence To Automatically Predict Alternatively Spliced Genes, Master's Thesis, December 2006, Robert Zimmermann
All Computer Science and Engineering Research
Current methods for high-throughput automatic annotation of newly sequenced genomes are largely limited to tools which predict only one transcript per gene locus. Evidence suggests that 20-50% of genes in higher eukariotic organisms are alternatively spliced. This leaves the remainder of the transcripts to be annotated by hand, an expensive time-consuming process. Genomes are being sequenced at a much higher rate than they can be annotated. We present three methods for using the alignments of inexpensive Expressed Sequence Tags in combination with HMM-based gene prediction with N-SCAN EST to recreate the vast majority of hand annotations in the D.melanogaster genome. …
Strong Performance Guarantees For Asynchronous Buffered Crossbar Schedulers, Jonathon Turner
Strong Performance Guarantees For Asynchronous Buffered Crossbar Schedulers, Jonathon Turner
All Computer Science and Engineering Research
Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of crossbar scheduling algorithms that provide strong performance guarantees now makes it possible to engineer systems that perform well, even under extreme traffic conditions. Until recently, such performance guarantees have only been developed for crossbars that switch cells rather than variable length packets. Cell-based crossbars incur a worst-case bandwidth penalty of up to a factor of two, since they must fragment variable length packets into fixed length cells. In addition, schedulers for cell-based crossbars may fail to deliver the expected performance guarantees when …
Gigabit Concept Mining: A Sensitivity Analysis, Masters Thesis, December 2006, Andrew Levine
Gigabit Concept Mining: A Sensitivity Analysis, Masters Thesis, December 2006, Andrew Levine
All Computer Science and Engineering Research
Massive amounts of data are passed over public networks. There is a need for network administrators to analyze this traffic, but it was not previously possible to analyze live network data at high speed. It has been shown that streaming computation and deep packet analysis are possible at very high rates through the use of hardware acceleration. This work provides analysis for a larger project that involves digesting large amounts of network traffic. In this system, we process the traffic using hardware that has constraints. The workings of the system are first discussed. Tradeoffs in the design of hardware and …
Ceg 477/677-01: Computer Graphics Ii, John A. Reisner
Ceg 477/677-01: Computer Graphics Ii, John A. Reisner
Computer Science & Engineering Syllabi
No abstract provided.
Ceg 210-01: Pc Networking I, Karen Meyer
Ceg 210-01: Pc Networking I, Karen Meyer
Computer Science & Engineering Syllabi
Introduction to PC networking hardware, concepts, and technologies. Focus is on LAN administration, hardware and software configuration.
Ceg 434/634-01: Concurrent Software Design, Natsuhiko Futamura
Ceg 434/634-01: Concurrent Software Design, Natsuhiko Futamura
Computer Science & Engineering Syllabi
No abstract provided.
Ceg 260-01: Digital Computer Hardware, Sridhar Ramachandran
Ceg 260-01: Digital Computer Hardware, Sridhar Ramachandran
Computer Science & Engineering Syllabi
Digital Computer Hardware. Topics include switching algebra and switching functions, logic design of combinational and sequential circuits using TTL, combinational logic design with MSI and LSI, busing, storage elements, and instrumentation. 3 hours lecture, 2 hours lab. Prerequisite: CS 241.
Medium Access Control Protocols And Routing Algorithms For Wireless Sensor Networks, Anirban Bag
Medium Access Control Protocols And Routing Algorithms For Wireless Sensor Networks, Anirban Bag
Electronic Theses and Dissertations
In recent years, the development of a large variety of mobile computing devices has led to wide scale deployment and use of wireless ad hoc and sensor networks. Wireless Sensor Networks consist of battery powered, tiny and cheap "motes", having sensing and wireless communication capabilities. Although wireless motes have limited battery power, communication and computation capabilities, the range of their application is vast. In the first part of the dissertation, we have addressed the specific application of Biomedical Sensor Networks. To solve the problem of data routing in these networks, we have proposed the Adaptive Least Temperature Routing (ALTR) algorithm …
Spatial Diversity In Signal Strength Based Wlan Location Determination Systems, Anil Ramachandran, Jagannathan Sarangapani
Spatial Diversity In Signal Strength Based Wlan Location Determination Systems, Anil Ramachandran, Jagannathan Sarangapani
Electrical and Computer Engineering Faculty Research & Creative Works
Literature indicates that spatial diversity can be utilized to compensate channel uncertainties such as multipath fading. Therefore, in this paper, spatial diversity is exploited for locating stationary and mobile objects in the indoor environment. First, space diversity technique is introduced for small scale motion and temporal variation compensation of received signal strength and it is demonstrated analytically that it enhances location accuracy. Small scale motion refers to movements of the transmitter and/or the receiver of the order of sub-wavelengths while temporal effects refer to environmental variations with time. A novel metric is introduced for selection combining in order to improve …
An Online Approximator-Based Fault Detection Framework For Nonlinear Discrete-Time Systems, Balaje T. Thumati, Jagannathan Sarangapani
An Online Approximator-Based Fault Detection Framework For Nonlinear Discrete-Time Systems, Balaje T. Thumati, Jagannathan Sarangapani
Electrical and Computer Engineering Faculty Research & Creative Works
In this paper, a fault detection scheme is developed for nonlinear discrete time systems. The changes in the system dynamics due to incipient failures are modeled as a nonlinear function of state and input variables while the time profile of the failures is assumed to be exponentially developing. The fault is detected by monitoring the system and is approximated by using online approximators. A stable adaptation law in discrete-time is developed in order to characterize the faults. The robustness of the diagnosis scheme is shown by extensive mathematical analysis and simulation results.
Route Aware Predictive Congestion Control Protocol For Wireless Sensor Networks, Carl Larsen, Maciej Jan Zawodniok, Jagannathan Sarangapani
Route Aware Predictive Congestion Control Protocol For Wireless Sensor Networks, Carl Larsen, Maciej Jan Zawodniok, Jagannathan Sarangapani
Electrical and Computer Engineering Faculty Research & Creative Works
Congestion in wireless sensor networks (WSN) may lead to packet losses or delayed delivery of important information rendering the WSN-based monitoring or control system useless. In this paper a routing-aware predictive congestion control (RPCC) yet decentralized scheme for WSN is presented that uses a combination of a hop by hop congestion control mechanism to maintain desired level of buffer occupancy, and a dynamic routing scheme that works in concert with the congestion control mechanism to forward the packets through less congested nodes. The proposed adaptive approach restricts the incoming traffic thus preventing buffer overflow while maintaining the rate through an …
Control Of Nonholonomic Mobile Robot Formations: Backstepping Kinematics Into Dynamics, Jagannathan Sarangapani, Travis Alan Dierks
Control Of Nonholonomic Mobile Robot Formations: Backstepping Kinematics Into Dynamics, Jagannathan Sarangapani, Travis Alan Dierks
Electrical and Computer Engineering Faculty Research & Creative Works
In this paper, we seek to expand framework developed to control a single nonholonomic mobile robot to include the control of formations of multiple nonholonomic mobile robots. A combined kinematic/torque control law is developed for leader-follower based formation control using backstepping in order to accommodate the dynamics of the robots and the formation in contrast with kinematic-based formation controllers. The asymptotic stability of the entire formation is guaranteed using Lyapunov theory, and numerical results are provided The kinematic controller is developed around control strategies for single mobile robots and the idea of virtual leaders. The virtual leader is replaced with …
Neural Network Control Of Robot Formations Using Rise Feedback, Jagannathan Sarangapani, Travis Alan Dierks
Neural Network Control Of Robot Formations Using Rise Feedback, Jagannathan Sarangapani, Travis Alan Dierks
Electrical and Computer Engineering Faculty Research & Creative Works
In this paper, a combined kinematic/torque control law is developed for leader-follower based formation control using backstepping in order to accommodate the dynamics of the robots and the formation in contrast with kinematic-based formation controllers that are widely reported in the literature. A neural network (NN) is introduced along with robust integral of the sign of the error (RISE) feedback to approximate the dynamics of the follower as well as its leader using online weight tuning. It is shown using Lyapunov theory that the errors for the entire formation are asymptotically stable and the NN weights are bounded as opposed …
Online Reinforcement Learning Control Of Unknown Nonaffine Nonlinear Discrete Time Systems, Qinmin Yang, Jagannathan Sarangapani
Online Reinforcement Learning Control Of Unknown Nonaffine Nonlinear Discrete Time Systems, Qinmin Yang, Jagannathan Sarangapani
Electrical and Computer Engineering Faculty Research & Creative Works
In this paper, a novel neural network (NN) based online reinforcement learning controller is designed for nonaffine nonlinear discrete-time systems with bounded disturbances. The nonaffine systems are represented by nonlinear auto regressive moving average with exogenous input (NARMAX) model with unknown nonlinear functions. An equivalent affine-like representation for the tracking error dynamics is developed first from the original nonaffine system. Subsequently, a reinforcement learning-based neural network (NN) controller is proposed for the affine-like nonlinear error dynamic system. The control scheme consists of two NNs. One NN is designated as the critic, which approximates a predefined long-term cost function, whereas an …
Online Reinforcement Learning Neural Network Controller Design For Nanomanipulation, Qinmin Yang, Jagannathan Sarangapani
Online Reinforcement Learning Neural Network Controller Design For Nanomanipulation, Qinmin Yang, Jagannathan Sarangapani
Electrical and Computer Engineering Faculty Research & Creative Works
In this paper, a novel reinforcement learning neural network (NN)-based controller, referred to adaptive critic controller, is proposed for affine nonlinear discrete-time systems with applications to nanomanipulation. In the online NN reinforcement learning method, one NN is designated as the critic NN, which approximates the long-term cost function by assuming that the states of the nonlinear systems is available for measurement. An action NN is employed to derive an optimal control signal to track a desired system trajectory while minimizing the cost function. Online updating weight tuning schemes for these two NNs are also derived. By using the Lyapunov approach, …
Ceg 498-01: Design Experience, Thomas C. Hartrum
Ceg 498-01: Design Experience, Thomas C. Hartrum
Computer Science & Engineering Syllabi
CEG 498 (Design Experience) is a summative computer engineering design project course that builds upon previous engineering, science, mathematics and communications course work. CEG 498 projects are a minimum of two quarters in length and must be completed in groups of at least three students. Projects are selected under the guidance of the course instructor and are tailored to both student interest and formal classroom preparation. Students are evaluated both on their individual contributions as recorded in a graded engineering journals and on the quality of their collective efforts as reflected in group generated products.
Cs 208-01: Computer Programming For Business I, Dennis Kellermeier
Cs 208-01: Computer Programming For Business I, Dennis Kellermeier
Computer Science & Engineering Syllabi
CS 208 is the first of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming. This course assumes students have never written a program before.
Cs 241-01: Introduction To Computer Science Ii, Mateen M. Rizki
Cs 241-01: Introduction To Computer Science Ii, Mateen M. Rizki
Computer Science & Engineering Syllabi
No abstract provided.
Cs 142-01: Computer Programming Ii, Haiyun Bian
Cs 142-01: Computer Programming Ii, Haiyun Bian
Computer Science & Engineering Syllabi
Concepts introduced in CS 141 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and exception handling. Student must register for both lecture and one lab section.
Cs 141-01: Computer Programming - I, Michael Ondrasek
Cs 141-01: Computer Programming - I, Michael Ondrasek
Computer Science & Engineering Syllabi
This course provides a general introduction to the fundamentals of computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.
Cs 205-01: Introduction To Computers And Office Productivity Software, Kim Gros
Cs 205-01: Introduction To Computers And Office Productivity Software, Kim Gros
Computer Science & Engineering Syllabi
Focus on learning MS Office software applications including word processing (intermediate), spreadsheet database and presentation graphics using a case study approach where critical thinking and problem solving skills are required. Computer concepts are integrated throughout the course to provide an understanding of the basics of computing, the latest technological advances and how they are used in industry. Ethics and issues encountered in business are discussed to challenge students on societal impact of technology.
Cs 209-01: Computer Programming For Business Ii, Dennis Kellermeier
Cs 209-01: Computer Programming For Business Ii, Dennis Kellermeier
Computer Science & Engineering Syllabi
CS 209 is the second of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming.
Cs 214-01: Visual Basic Programming, Michael Ondrasek
Cs 214-01: Visual Basic Programming, Michael Ondrasek
Computer Science & Engineering Syllabi
This course provides a general introduction to the fundamentals of object computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. However, students should have a familiarity with programming concepts. The concepts covered will be applied in the Visual Basic programming language. 4 credit hours.
Cs 241-01: Computer Science Ii, Eric Maston
Cs 241-01: Computer Science Ii, Eric Maston
Computer Science & Engineering Syllabi
This course is the second in the Introduction to Computer Science (24X) series. It focuses on object oriented concepts and an introduction to data structures.