Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9065)
- Missouri University of Science and Technology (1898)
- City University of New York (CUNY) (958)
- Brigham Young University (710)
- University of Texas at Arlington (661)
-
- Syracuse University (479)
- University of Central Florida (477)
- University of Nevada, Las Vegas (393)
- Chulalongkorn University (258)
- Regis University (254)
- Portland State University (243)
- TÜBİTAK (230)
- Old Dominion University (197)
- University of South Carolina (193)
- San Jose State University (192)
- Wright State University (186)
- Technological University Dublin (152)
- Washington University in St. Louis (148)
- University of South Florida (137)
- Purdue University (112)
- Edith Cowan University (111)
- University of Nebraska - Lincoln (109)
- Nova Southeastern University (101)
- Zayed University (97)
- California Polytechnic State University, San Luis Obispo (96)
- Dartmouth College (94)
- University of New Mexico (94)
- Air Force Institute of Technology (89)
- University at Albany, State University of New York (89)
- Kennesaw State University (75)
- Keyword
-
- Machine learning (601)
- Artificial intelligence (406)
- Deep learning (340)
- Machine Learning (267)
- College for Professional Studies (253)
-
- School of Computer & Information Science (236)
- Security (197)
- Artificial Intelligence (191)
- Natural language processing (184)
- Deep Learning (182)
- Computer Science (180)
- Privacy (149)
- Social media (140)
- Computer science (138)
- Algorithms (137)
- MS Computer and Information Technology (136)
- Data mining (135)
- Neural networks (129)
- Natural Language Processing (123)
- Reinforcement learning (123)
- Computer vision (122)
- Cybersecurity (117)
- Twitter (116)
- Software engineering (115)
- AI (113)
- Classification (109)
- Regis University MSCIT thesis (108)
- Cloud computing (106)
- Optimization (106)
- Clustering (96)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8532)
- Computer Science Faculty Research & Creative Works (907)
- Theses and Dissertations (837)
- Computer Science Technical Reports (411)
- Faculty Publications (382)
-
- Computer Science and Engineering Theses - Archive (364)
- Electronic Theses and Dissertations (331)
- Publications and Research (291)
- Electrical and Computer Engineering Faculty Research & Creative Works (282)
- Computer Science and Engineering Dissertations - Archive (270)
- Open Educational Resources (262)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (258)
- Regis University Student Publications (comprehensive collection) (254)
- Masters Theses (236)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (236)
- Turkish Journal of Electrical Engineering and Computer Sciences (230)
- Dissertations and Theses (204)
- Dissertations and Theses Collection (Open Access) (192)
- Electrical Engineering and Computer Science - Technical Reports (176)
- Master's Projects (167)
- Dissertations, Theses, and Capstone Projects (145)
- Electrical Engineering and Computer Science - All Scholarship (138)
- McKelvey School of Engineering Graduate Student Theses & Dissertations (137)
- USF Tampa Graduate Theses and Dissertations (122)
- Doctoral Dissertations (119)
- Electronic Theses and Dissertations, 2020-2023 (119)
- All Works (97)
- Computer Science Faculty Publications (94)
- Northeast Parallel Architecture Center (92)
- Dissertations (89)
- Publication Type
- File Type
Articles 18061 - 18090 of 20639
Full-Text Articles in Entire DC Network
Forms Of Expression For Designing Visual Languages For Animation, Richard C. Davis, James A. Landay
Forms Of Expression For Designing Visual Languages For Animation, Richard C. Davis, James A. Landay
Research Collection School Of Computing and Information Systems
We present further steps in our research into visual languages for animation. Animation is a rich mode of communication that is currently accessible to few, because animation systems are complex. Some systems try to make animation simple but put severe limits on users’ creative expression. Our field studies are demonstrating that would-be animators need to express animation in a wide variety of ways. We are developing a taxonomy of forms of expression for animation that will help the designers of visual languages for animation to determine which expressive forms to support. Our end goal is to build animation sketching systems …
Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework, Hoong Chuin Lau, Lei Zhang, Chang Liu
Solving Generalized Open Constraint Optimization Problem Using Two-Level Multi-Agent Framework, Hoong Chuin Lau, Lei Zhang, Chang Liu
Research Collection School Of Computing and Information Systems
The Open Constraint Optimization Problem (OCOP) refers to the COP where constraints and variable domains can change over time and agents' opinions have to be sought over a distributed network to form a solution. The openness of the problem has caused conventional approaches to COP such as branch-and-bound to fail to find optimal solutions. OCOP is a new problem and the approach to find an optimal solution (minimum total cost) introduced in [1] is based on an unrealistic assumption that agents are willing to report their options in nondecreasing order of cost. In this paper, we study a generalized OCOP …
New Efficient Mds Array Codes For Raid Part I: Reed-Solomon-Like Codes For Tolerating Three Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao, Jia-Chen Shen
New Efficient Mds Array Codes For Raid Part I: Reed-Solomon-Like Codes For Tolerating Three Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao, Jia-Chen Shen
Research Collection School Of Computing and Information Systems
This paper presents a class of binary maximum distance separable (MDS) array codes for tolerating disk failures in redundant arrays of inexpensive disks (RAID) architecture based on circular permutation matrices. The size of the information part is m×n, the size of the parity-check part is m×3, and the minimum distance is 4, where n is the number of information disks, the number of parity-check disks is 3, and (m+1) is a prime integer. In practical applications, m can be very large and n is from 20 to 50. The code rate is R=n/(n+3). These codes can be used for tolerating …
Partial Adjustable Autonomy In Multi-Agent Environment And Its Application To Military Logistics, Hoong Chuin Lau, Lucas Agussurja, Ramesh Thangarajoo
Partial Adjustable Autonomy In Multi-Agent Environment And Its Application To Military Logistics, Hoong Chuin Lau, Lucas Agussurja, Ramesh Thangarajoo
Research Collection School Of Computing and Information Systems
In a rapidly changing environment, the behavior and decision-making power of agents may have to be adaptive with respect to a fluctuating autonomy. In this paper, a centralized fuzzy approach is proposed to sense changes in environmental conditions and translate them to changes in agent autonomy. A distributed coalition formation scheme is then applied to allow agents in the new autonomy to renegotiate to establish schedule consistency. The proposed framework is applied to a real-time logistics control of a military hazardous material storage facility under peace-to-war transition.
On Organizing And Accessing Geospatial And Georeferenced Web Resources Using The G-Portal System, Zehua Liu, Ee Peng Lim, Yin-Leng Theng, Dion Hoe-Lian Goh, Wee-Keong Ng
On Organizing And Accessing Geospatial And Georeferenced Web Resources Using The G-Portal System, Zehua Liu, Ee Peng Lim, Yin-Leng Theng, Dion Hoe-Lian Goh, Wee-Keong Ng
Research Collection School Of Computing and Information Systems
In order to organise and manage geospatial and georeferenced information on the Web making them convenient for searching and browsing, a digital portal known as G-Portal has been designed and implemented. Compared to other digital libraries, G-Portal is unique for several of its features. It maintains metadata resources in XML with flexible resource schemas. Logical groupings of metadata resources as projects and layers are possible to allow the entire metadata collection to be partitioned differently for users with different information needs. These metadata resources can be displayed in both the classification-based and map-based interfaces provided by G-Portal. G-Portal further incorporates …
Studies In The Dynamics Of Economic Systems, Christophe G. Giraud-Carrier, Kevin Seppi, Nghia Tran, Sean C. Warnick, W. Samuel Weyerman, R. Johnson
Studies In The Dynamics Of Economic Systems, Christophe G. Giraud-Carrier, Kevin Seppi, Nghia Tran, Sean C. Warnick, W. Samuel Weyerman, R. Johnson
Faculty Publications
This paper demonstrates the utility of systems and control theory in the analysis of economic systems. Two applications demonstrate how the analysis of simple dynamic models sheds light on important practical problems. The first problem considers the design of a retail laboratory, where the small gain theorem enables the falsification of pricing policies. The second problem explores industrial organization using the equilibria of profit-maximizing dynamics to quantify the percentage of a firm’s profits due strictly to the cooperative effects among its products. This ”Value of Cooperation” suggests an important measure for both organizational and antitrust applications.
Challenging Policies That Do Not Play Fair: A Credential Relevancy Framework Using Trust Negotiation Ontologies, Travis S. Leithead
Challenging Policies That Do Not Play Fair: A Credential Relevancy Framework Using Trust Negotiation Ontologies, Travis S. Leithead
Theses and Dissertations
This thesis challenges the assumption that policies will "play fair" within trust negotiation. Policies that do not "play fair" contain requirements for authentication that are misleading, irrelevant, and/or incorrect, based on the current transaction context. To detect these unfair policies, trust negotiation ontologies provide the context to determine the relevancy of a given credential set for a particular negotiation. We propose a credential relevancy framework for use in trust negotiation that utilizes ontologies to process the set of all available credentials C and produce a subset of credentials C' relevant to the context of a given negotiation. This credential relevancy …
A Dynamic Weight Assignment Approach For Ir Systems, M. Shoaib, Prof Dr. Abad Ali Shah, A. Vashishta
A Dynamic Weight Assignment Approach For Ir Systems, M. Shoaib, Prof Dr. Abad Ali Shah, A. Vashishta
International Conference on Information and Communication Technologies
Weights are assigned to the extracted keywords for partial matching and computing ranking in an IR system. Weight assignment technique is suggested by the IR model that is used for an IR system. Currently suggested weight assignment techniques are static which means that once weight is assigned a keyword it remains unchanged during life-span of an IR system. In this paper, we suggest a dynamic weight assignment technique. This technique can be used by any IR model that supports partial matching.
Opnet, Arne, And The Classroom, Philip Doane
Opnet, Arne, And The Classroom, Philip Doane
Regis University Student Publications (comprehensive collection)
This paper examines OPNET Technology, Inc's management programs, and Regis University's Academic Research Network (ARNe) needs to find out which OPNET programs can meet the needs of ARNe. The method used was to examine ARNe's needs, and research Microsoft's SMF/MOF management framework, research OPNET's program and module offerings, research OPNET's University Program, and research how OPNET's programs are used at some other universities. The research was used to create a match up between Microsoft's Service Management Functions and OPNET's programs and modules. And it was used to create a list of textbooks, labs, and lab manuals that would work with …
Achieving Minimum Coverage Breach Under Bandwidth Constraints In Wireless Sensor Networks, Maggie Xiaoyan Cheng, Lu Ruan, Weili Wu
Achieving Minimum Coverage Breach Under Bandwidth Constraints In Wireless Sensor Networks, Maggie Xiaoyan Cheng, Lu Ruan, Weili Wu
Computer Science Faculty Research & Creative Works
This paper addresses the coverage breach problem in wireless sensor networks with limited bandwidths. In wireless sensor networks, sensor nodes are powered by batteries. To make efficient use of battery energy is critical to sensor network lifetimes. When targets are redundantly covered by multiple sensors, especially in stochastically deployed sensor networks, it is possible to save battery energy by organizing sensors into mutually exclusive subsets and alternatively activating only one subset at any time. Active nodes are responsible for sensing, computing and communicating. While the coverage of each subset is an important metric for sensor organization, the size of each …
Dynamic Dead Variable Analysis, Micah S. Lewis
Dynamic Dead Variable Analysis, Micah S. Lewis
Theses and Dissertations
Dynamic dead variable analysis (DDVA) extends traditional static dead variable analysis (SDVA) in the context of model checking through the use of run-time information. The analysis is run multiple times during the course of model checking to create a more precise set of dead variables. The DDVA is evaluated based on the amount of memory used to complete model checking relative to SDVA while considering the extra overhead required to implement DDVA. On several models with a complex control flow graph, DDVA reduces the amount of memory needed by 38-88MB compared to SDVA with a cost of 36 bytes of …
Task Similarity Measures For Transfer In Reinforcement Learning Task Libraries, James Carroll, Kevin Seppi
Task Similarity Measures For Transfer In Reinforcement Learning Task Libraries, James Carroll, Kevin Seppi
Faculty Publications
Recent research in task transfer and task clustering has necessitated the need for task similarity measures in reinforcement learning. Determining task similarity is necessary for selective transfer where only information from relevant tasks and portions of a task are transferred. Which task similarity measure to use is not immediately obvious. It can be shown that no single task similarity measure is uniformly superior. The optimal task similarity measure is dependent upon the task transfer method being employed. We define similarity in terms of tasks, and propose several possible task similarity measures, dT, dp, dQ, and dR which are based on …
Automatic Source Attribution Of Text: A Neural Networks Approach, Foaad Khosmood, Franz J. Kurfess
Automatic Source Attribution Of Text: A Neural Networks Approach, Foaad Khosmood, Franz J. Kurfess
Computer Science and Software Engineering
Recent advances in automatic authorship attribution have been promising. Relatively new techniques such as N-gram analysis have shown important improvements in accuracy [2]. Much of the work in this area does remain in the realm of statistics best suited for human assistance rather than autonomous attribution [6]. While there have been attempts at using neural networks in the area in the past, they have been extremely limited and problem-specific [7]. This paper addresses the latter points by demonstrating a practical and truly autonomous attribution process using neural networks. Furthermore, we use a word-frequency classification technique to demonstrate the feasibility of …
Searching Multi-Hierarchical Xml Documents: The Case Of Fragmentation, Alex Dekhtyar, Ionut E. Iacob, Srikanth Methuku
Searching Multi-Hierarchical Xml Documents: The Case Of Fragmentation, Alex Dekhtyar, Ionut E. Iacob, Srikanth Methuku
Computer Science and Software Engineering
To properly encode properties of textual documents using XML, multiple markup hierarchies must be used, often leading to conflicting markup in encodings. Text Encoding Initiative (TEI) Guidelines [1] recognize this problem and suggest a number of ways to incorporate multiple hierarchies in a single well-formed XML document. In this paper, we present a framework for processing XPath queries over multi-hierarchical XML documents represented using fragmentation, one of the TEI-suggested techniques. We define the semantics of XPath over DOM trees of fragmented XML, extend the path expression language to cover overlap in markup, and describe FragXPath, our implementation of the proposed …
Integration Of Interactive Voice Response Unit And Outage Management System, Chaomei Jiang
Integration Of Interactive Voice Response Unit And Outage Management System, Chaomei Jiang
Regis University Student Publications (comprehensive collection)
This project provides a technical solution that integrates the Interactive Voice Response Unit (IVR) and the Outage Management System (OMS) for the Public Service Company. The IVR system is introduced because its automatic call logging functionality can process a large volume of phone calls from the customers reporting electrical service problems. This is a major improvement over the current Trouble Call Center (TCC) infrastructure that has a limited number of agents handling a relatively small number of customer calls. Because OMS can receive more calls, it then can predict the outage locations and causes more accurately, dispatch more repair crews …
Effects Of Information And Machine Learning Algorithms On Word Sense Disambiguation With Small Datasets, Gondy Leroy, Thomas C. Rindflesch
Effects Of Information And Machine Learning Algorithms On Word Sense Disambiguation With Small Datasets, Gondy Leroy, Thomas C. Rindflesch
CGU Faculty Publications and Research
Current approaches to word sense disambiguation use (and often combine) various machine learning techniques. Most refer to characteristics of the ambiguity and its surrounding words and are based on thousands of examples. Unfortunately, developing large training sets is burdensome, and in response to this challenge, we investigate the use of symbolic knowledge for small datasets. A naïve Bayes classifier was trained for 15 words with 100 examples for each. Unified Medical Language System (UMLS) semantic types assigned to concepts found in the sentence and relationships between these semantic types form the knowledge base. The most frequent sense of a word …
The Design And Implementation Of The Megacomm Media Center's Extranet, Kenneth J. Quigley
The Design And Implementation Of The Megacomm Media Center's Extranet, Kenneth J. Quigley
Regis University Student Publications (comprehensive collection)
The Purpose of this thesis is to document the project that designed, configured and implemented a network infrastructure that provided the capability to segment, current and future, non-MegaComm Media Center companies that need IT services from the MegaComm Media Center (MMC) and provided Business-to- Business connectivity. The MegaComm Media Center, located in Littleton, Colorado, is a wholly owned subsidiary of the MegaComm Corporation. The MMC provides unique services to the cable industry. In support of these services, the MMC hosts several tenants. Prior to this project the tenants had access to internal MMC networks. The MMC also has several vendors …
Integration Of The Sam-Grid Infrastructure To The D0 Data Reprocessing Effort, Anoop Rajendra
Integration Of The Sam-Grid Infrastructure To The D0 Data Reprocessing Effort, Anoop Rajendra
Computer Science and Engineering Theses - Archive
The D0 experiment is one of the two high energy physics experiments currently being conducted at Fermi National Accelerator Laboratory, in Batavia, IL, on what is currently the world's highest energy particle accelerator, the Tevatron. The experiment produces vast amounts of raw data of the order of several hundred terabytes. This data needs to be converted from the raw format that comes from the detector, ie. digitized data, to a format that is close to the physics, ie. data that can be subjected to analysis. This process, called reconstruction, is done according to constantly evolving and improving reconstruction algorithms. This …
Structure Based Xml Indexing, Niroj Manandhar
Structure Based Xml Indexing, Niroj Manandhar
Computer Science and Engineering Theses - Archive
The increase in the usage and popularity of semi-structured data has received considerable attention, and a lot of research is going on for the efficient retrieval and storage of semi-structured data. A popular model and language for semi-structured data is XML. In this thesis we focus on the structure based indexing of XML. As a part of an ongoing XML indexing project, we study and implement A(k)-index, which is a structure based indexing technique; and propose the use of offset, length pair to retrieve nodes of interest. We record offset and length of every node using the SAX parser, and …
A Framework For Supporting Quality Of Service Requirements In A Data Stream Management System, Qingchun Jiang
A Framework For Supporting Quality Of Service Requirements In A Data Stream Management System, Qingchun Jiang
Computer Science and Engineering Dissertations - Archive
Currently, a large class of data-intensive applications, in which data are presented in the form of continuous data streams rather than static relations, has been widely recognized in the database community. Not only is the size of the data for these applications unbounded and the data arrives in a highly bursty mode, but these applications have to conform to Quality of Service (QoS) requirements for processing continuous queries (CQs) over data streams. These characteristics make it infeasible to simply load the arriving data streams into a traditional database management system and use currently available techniques for their processing. Therefore, a …
Finding Blood In Capsule Endoscopy Video, Jay Frederick Cox
Finding Blood In Capsule Endoscopy Video, Jay Frederick Cox
Computer Science and Engineering Theses - Archive
Capsule Endoscopy (CE) is a new procedure where endoscopists can visualize and discriminate anomalies of the human gastrointestinal track by allowing the patient to swallow a camera pill. The digital video obtained from the pill is used to safely pinpoint the location of these abnormalities in areas previously unavailable for view. One of the main functions of CE is determining the location of bleeding. Given Imaging, currently the only maker of a FDA approved CE device, has a proprietary and unspecified blood test, called Suspected Blood Index, which can be used to automatically detect where blood occurs in the video. …
An Emperical Evaluation Of Adequacy Criteria For Testing Concurrent Programs, Gaurav Saini
An Emperical Evaluation Of Adequacy Criteria For Testing Concurrent Programs, Gaurav Saini
Computer Science and Engineering Theses - Archive
A concurrent program contains two or more threads that execute concurrently and work together to perform some task. Concurrency increases the efficiency of a program. Testing of concurrent programs has been a challenging task because of the inherent non-determinism. Most approaches proposed for concurrent program testing employ, explicitly or implicitly, a coverage criterion to measure test adequacy. In order to apply those approaches, we must first choose a criterion that suits best for our programs. There is a need for quantitative results of evaluation regarding the effectiveness of the various coverage criteria used for the testing of concurrent programs. Such …
Comparison Of Search-Based And Kernel-Based Methods For Graph-Based Relational Learning, Chris Manuel Gonsalves
Comparison Of Search-Based And Kernel-Based Methods For Graph-Based Relational Learning, Chris Manuel Gonsalves
Computer Science and Engineering Theses - Archive
Graph-based relational learning has been the focus of relational learning for quite some time. As most of the real-world data is structured, and hence cannot be represented in a single table, various logic-based and graph-based techniques have been proposed for dealing with structured data. Our goal is to perform an in-depth analysis of two such graph-based learning systems. We have selected Subdue to represent the search-based approach and support vector machine (SVM) with graph kernels to represent the kernel-based approach. We perform a comparison between search-based and kernel-based approaches and evaluate their performance in various domains. A search-based approach to …
A Framework For A Dynamic Invocation Interface And High-Level Interoperability For Mobile Agent Platforms, Vamsi K. Putrevu
A Framework For A Dynamic Invocation Interface And High-Level Interoperability For Mobile Agent Platforms, Vamsi K. Putrevu
Computer Science and Engineering Theses - Archive
The mobile agent paradigm for distributed systems is inherently suitable for many applications ranging from network management to e-commerce. One inherent problem to its wide spread use is communication between disparate agent platforms and reducing overheads while doing the same. Not all platforms for mobile agents are the same. The Mobile Agent Facility (MAF) proposal is an attempt to standardize this execution environment, this thesis proposes a framework extending the current MAF specification, by which inter-agent communication can be achieved in a more scalable fashion by interpreter based mobile agent systems. The future of the Internet depends on its ability …
Monitoring And Analyzing Distributed Cluster Performance And Statistics Of Atlas Job Flow, Sreeranjani Ramprakash
Monitoring And Analyzing Distributed Cluster Performance And Statistics Of Atlas Job Flow, Sreeranjani Ramprakash
Computer Science and Engineering Theses - Archive
Grid3 is a Grid facility used by many High Energy Physics experiments to enable physicists to process data intensive and CPU intensive jobs more effectively as well as more efficiently. Amongst other things, the highlights of Grid3 are participation by more than 25 sites across the U.S. and Korea which collectively provide more than 2000 CPU's, resources used by seven different scientific applications, including three high energy physics simulations and four data analyses in high energy physics, bio-chemistry, astrophysics and astronomy, more than 100 individuals are currently registered with access to the Grid, a peak throughput of 500-900 jobs running …
Sql-Based Approach To Significant Interval Discovery In Time-Series Data, Sunit Shrestha
Sql-Based Approach To Significant Interval Discovery In Time-Series Data, Sunit Shrestha
Computer Science and Engineering Theses - Archive
With time-series data, events (like turning off a light, opening garage door, turning on TV) occur with a high degree of certainty not at specific time points but within time intervals (sequence of time points). So, it is useful for applications to consider data as contiguous time points. The smallest interval that satisfies the criteria of interval-confidence (i.e., ratio of total support of participating time points and the number of days) is termed as Significant Interval (SI). Significant Interval Discovery (SID) algorithm finds SIs from time-series data. The main focus of this thesis is on the improvement of existing SID …
Quantitative Comparison Of Two Approaches To Agent Cooperation, Jose Ramon Espino
Quantitative Comparison Of Two Approaches To Agent Cooperation, Jose Ramon Espino
Computer Science and Engineering Theses - Archive
Multi-agent systems (MASs) are characterized by collections of autonomous agents that interact with each other in simple ways, but the collection of agents as a whole is characterized by emergent behavior (EB) which will have properties that individual agents do not. Engineers want to design artificial MASs for a variety of reasons including military operations. The idea is for the EB to be carrying out the mission itself. In this scenario, the agents are relatively inexpensive and expendable. A large body of work exists in MAS research for military applications and a variety of different designs have been proposed. Because …
Utility Based Resource Aware Framework For Information Caching And Sharing In Mobile And Distributed Systems, Huaping Shen
Utility Based Resource Aware Framework For Information Caching And Sharing In Mobile And Distributed Systems, Huaping Shen
Computer Science and Engineering Dissertations - Archive
Along with the technology advancements in mobile and wireless networks, ubiquitous information service is becoming a reality in which users can access the information anytime anywhere. However, the user mobility, network heterogeneity and resource constraints impose significant challenges to provide ubiquitous information services. In this dissertation, a utility based resource aware framework is proposed to enhance ubiquitous information availability to mobile users through data caching and peer-to-peer sharing. The framework considers the constrained resources of mobile and distributed environments and provides flexible, efficient and scalable data access services to the mobile users. The major contributions of this framework are as …
Efficient And Adaptive Schemes For Consistent Information Sharing In Wireless Mobile And Peer-To-Peer Networks, Zhijun Wang
Efficient And Adaptive Schemes For Consistent Information Sharing In Wireless Mobile And Peer-To-Peer Networks, Zhijun Wang
Computer Science and Engineering Dissertations - Archive
With the tremendous growth of applications in wireless mobile and Peer-to-Peer (P2P) networks, significant research efforts have been made to improve the quality of sevice. Caching and replicating frequently used data objects or files in user's local buffers are popular mechanisms to effectively reduce the communication bandwidth requirement and thus improve the overall system performance. However, the frequent disconnections of users make data consistency a difficult task in wireless mobile and P2P networks. In this dissertation, we design and analyze a Scalable Asynchronous Cache Consistency Scheme (SACCS) for single cell wireless cellular networks. SACCS is a highly scalable, efficient, and …
Edge Inference For Image Interpolation, Bryan S. Morse, Neil Toronto, Dan A. Ventura
Edge Inference For Image Interpolation, Bryan S. Morse, Neil Toronto, Dan A. Ventura
Faculty Publications
Image interpolation algorithms try to fit a function to a matrix of samples in a "natural-looking" way. This paper presents edge inference, an algorithm that does this by mixing neural network regression with standard image interpolation techniques. Results on gray level images are presented, and it is demonstrated that edge inference is capable of producing sharp, natural-looking results. A technique for reintroducing noise is given, and it is shown that, with noise added using a bicubic interpolant, edge inference can be regarded as a generalization of bicubic interpolation. Extension into RGB color space and additional applications of the algorithm are …