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 (83)
- 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 11341 - 11370 of 13036
Full-Text Articles in Computer Sciences
The Effect Of Object Color On Depth Ordering, Reynold Bailey, Cindy Grimm, Christopher Davoli, Richard Abrams
The Effect Of Object Color On Depth Ordering, Reynold Bailey, Cindy Grimm, Christopher Davoli, Richard Abrams
All Computer Science and Engineering Research
The relationship between color and perceived depth for realistic, colored objects with varying shading was explored. Background: Studies have shown that warm-colored stimuli tend to appear nearer in depth than cool-colored stimuli. The majority of these studies asked human observers to view physically equidistant, colored stimuli and compare them for relative depth. However, in most cases, the stimuli presented were rather simple: straight colored lines, uniform color patches, point light sources, or symmetrical objects with uniform shading. Additionally, the colors were typically highly saturated. Although such stimuli are useful for isolating and studying depth cues in certain contexts, they leave …
Emergent Task Allocation For Mobile Robots Through Intentions And Directives, Nuzhet Atay, Burchan Bayazit
Emergent Task Allocation For Mobile Robots Through Intentions And Directives, Nuzhet Atay, Burchan Bayazit
All Computer Science and Engineering Research
Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computationally expensive and may require a large number of messages between the robots as the robots need to be aware of the global spatiotemporal information. In this paper, we introduce an emergent task allocation approach for mobile robots. Each robot uses only the information obtained from its immediate neighbors in its decision. Our technique is general enough to be applicable to any task allocation scheme as long as a utilization criteria is given. We demonstrate that our approach …
Splice: A Standardized Peripheral Logic And Interface Creation Engine, Justin Thiel
Splice: A Standardized Peripheral Logic And Interface Creation Engine, Justin Thiel
All Computer Science and Engineering Research
Recent advancements in FPGA technology have allowed manufacturers to place general-purpose processors alongside user-configurable logic gates on a single chip. At first glance, these integrated devices would seem to be the ideal deployment platform for hardware-software co-designed systems, but some issues, such as incompatibility across vendors and confusion over which bus interfaces to support, have impeded adoption of these platforms. This thesis describes the design and operation of Splice, a software-based code generation tool intended to address these types of issues by providing a bus-independent structure that allows end-users to easily integrate their customized peripheral logic into embedded systems. To …
Splice: A Standardized Peripheral Logic And Interface Creation Engine, Master's Thesis, May 2007, Justin Thiel
Splice: A Standardized Peripheral Logic And Interface Creation Engine, Master's Thesis, May 2007, Justin Thiel
All Computer Science and Engineering Research
Recent advancements in FPGA technology have allowed manufacturers to place general-purpose processors alongside user-configurable logic gates on a single chip. At first glance, these integrated devices would seem to be the ideal deployment platform for hardware-software co-designed systems, but some issues, such as incompatibility across vendors and confusion over which bus interfaces to support, have impeded adoption of these platforms. This thesis describes the design and operation of Splice, a software-based code generation tool intended to address these types of issues by providing a bus-independent structure that allows end-users to easily integrate their customized peripheral logic into embedded systems. To …
Price Of Asynchrony: Queuing Under Ideally Smooth Congestion Control, Maxim Podlesny, Sergey Gorinsky
Price Of Asynchrony: Queuing Under Ideally Smooth Congestion Control, Maxim Podlesny, Sergey Gorinsky
All Computer Science and Engineering Research
The ability of TCP (Transmission Control Protocol) or alternative congestion control algorithms to operate successfully in networks with small link buffers has recently become a subject of intensive research. In this paper, we investigate fundamental limitations on minimum buffer requirements for any congestion control. We present an idealized protocol where all flows always transmit at their fair rates. The ideally smooth congestion control causes link queuing only due to asynchrony of flow arrivals, which is intrinsic to computer networks. Our analysis and simulations for different distributions of flow interarrival times agree that the buffer size needed for a fixed loss …
Architecture For Document Clustering In Reconfigurable Hardware, Master's Thesis, December 2006, Adam G. Covington
Architecture For Document Clustering In Reconfigurable Hardware, Master's Thesis, December 2006, Adam G. Covington
All Computer Science and Engineering Research
High-performance document clustering systems enable similar documents to automatically self-organize into groups. In the past, the large amount of computational time needed to cluster documents prevented practical use of such systems with a large number of documents. A full hardware implementation of K-means clustering has been designed and implemented in reconfigurable hardware that rapidly clusters a half million documents. Documents and concepts are represented as vectors with 4000 dimensions. The circuit was implemented in Field Programmable Gate Array (FPGA) logic and uses four parallel cosine distance metrics to cluster document vectors together. An exploration of the effect of the integer …
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.
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.
Cs 242-01: Computer Science Iii, Eric Maston
Cs 242-01: Computer Science Iii, Eric Maston
Computer Science & Engineering Syllabi
This is the third and final course in the Introduction to Computer Science series. This course focuses on data structures with abstract data types, such as trees, stacks, queues and tables.
Cs 240-01: Introduction To Computer Science I, Dale E. Nelson
Cs 240-01: Introduction To Computer Science I, Dale E. Nelson
Computer Science & Engineering Syllabi
No abstract provided.