Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Entire DC Network
Changing The Focus: Worker-Centric Optimization In Human-In-The-Loop Computations, Mohammadreza Esfandiari
Changing The Focus: Worker-Centric Optimization In Human-In-The-Loop Computations, Mohammadreza Esfandiari
Dissertations
A myriad of emerging applications from simple to complex ones involve human cognizance in the computation loop. Using the wisdom of human workers, researchers have solved a variety of problems, termed as “micro-tasks” such as, captcha recognition, sentiment analysis, image categorization, query processing, as well as “complex tasks” that are often collaborative, such as, classifying craters on planetary surfaces, discovering new galaxies (Galaxyzoo), performing text translation. The current view of “humans-in-the-loop” tends to see humans as machines, robots, or low-level agents used or exploited in the service of broader computation goals. This dissertation is developed to shift the focus back …
Semantics And Efficient Evaluation Of Partial Tree-Pattern Queries On Xml, Xiaoying Wu
Semantics And Efficient Evaluation Of Partial Tree-Pattern Queries On Xml, Xiaoying Wu
Dissertations
Current applications export and exchange XML data on the web. Usually, XML data are queried using keyword queries or using the standard structured query language XQuery the core of which consists of the navigational query language XPath. In this context, one major challenge is the querying of the data when the structure of the data sources is complex or not fully known to the user. Another challenge is the integration of multiple data sources that export data with structural differences and irregularities. In this dissertation, a query language for XML called Partial Tree-Pattern Query (PTPQ) language is considered. PTPQs generalize …
Design And Implementation Of Two Text Recognition Algorithms, Madhumathi Yendamuri
Design And Implementation Of Two Text Recognition Algorithms, Madhumathi Yendamuri
Theses
This report presents two algorithms for text recognition. One is a neural-based orthogonal vector with pseudo-inverse approach for pattern recognition. A method to generate N orthogonal vectors for an N-neuron network is also presented. This approach converges the input to the corresponding orthogonal vector representing the prototype vector. This approach can restore an image to the original image and thus has error recovery capacility. Also, the concept of sub-networking is applied to this approach to enhance the memory capacity of the neural network. This concept drastically increases the memory capacity of the network and also causes a reduction of the …
Comparing Techniques Of Mapping Pyramid Algorithms Onto The Hypercube : A Case Study For The Connection Machine, Muhammad Ali Siddiqui
Comparing Techniques Of Mapping Pyramid Algorithms Onto The Hypercube : A Case Study For The Connection Machine, Muhammad Ali Siddiqui
Theses
The pyramid structure is most widely used for low-level and intermediate-level image processing and computer vision because of its efficient support of both local and global operations. However, the cost of pyramid computers (PC) may be very high. They also do not support the efficient implementation of the majority of the scientific algorithms. In contrast, the hypercube network has widely been used in the field of parallel processing because it offers a high degree of fault tolerance, a small diameter and rich interconnection structure that permits fast communication at a reasonable cost. Thus, several algorithms have been developed for the …
New Algorithms For Mid-Crack Codes In Image Processing, Wai-Tak Wong
New Algorithms For Mid-Crack Codes In Image Processing, Wai-Tak Wong
Theses
The chain code is a widely-used description for a contour image. Recently, a mid-crack code algorithm has been proposed as another more precise method for image representation. New algorithms using this new mid-crack code for image representation, restoration, and skeletonization are developed. The efficiency and accuracy can be increased obviously.
Firstly, the conversion of a binary image with multiple regions into the mid-crack codes is presented. A fast on-line implementation can be achieved using tables look-up. The input binary image may contain several object regions and their mid-crack codes can be extracted at the same time in a single-pass row-by-row …
Clustering Algorithm For Local Area Network Design In A Cim Environment, A. C. Manjunath
Clustering Algorithm For Local Area Network Design In A Cim Environment, A. C. Manjunath
Theses
Communication systems have come to be regarded as being one of the most important aspects in manufacturing enterprises in recent years. It continues to offer enormous potential for improving the efficiency of manufacturing enterprises through Computer Integrated Manufacturing (CIM). It is true however that this potential cannot be realized by developments on the communications front alone. Strategic and economic considerations in installing a communications system in a manufacturing environment is of vital significance.
This thesis, at the outset attempts to bring out some of the issues in the area of communications (research), specifically in relation to CIM. A perception of …
Fast Arithmetic Operations On The Hypercube Using Conditional Sum Addition And Modified Booth's Algorithm, Umar Bin Iftikhar
Fast Arithmetic Operations On The Hypercube Using Conditional Sum Addition And Modified Booth's Algorithm, Umar Bin Iftikhar
Theses
Algorithms for fast arithmetic operations (i.e., addition and multiplication) on the hypercube computer are presented. The hypercube network of dimension d interconnects N = 2d processors in such a way that each processor is directly connected to d neighboring processors; m order to communicate between processors, the maximum length of the path is d. The addition algorithm is based on the conditional sum technique. The computational time using this algorithm is O(log2 N+q) where q is the number of the bits per processor in the hypercube of N processors. Operands of size N*q are distributed among the hypercube …
The Theory Of Bootstrapped Algorithms And Their Applications To Cross Polarization Interference Cancelation, Abdulkadir Dinc
The Theory Of Bootstrapped Algorithms And Their Applications To Cross Polarization Interference Cancelation, Abdulkadir Dinc
Dissertations
Dual-polarized transmission has become an important method for frequency re-use, particularly in satellite and microwave radio communication. Nevertheless, cross-polarization interference, which is inherent to this method, may cause degradation in system performance.
Different canceler [sic] structures have been proposed to mitigate the effect of cross-polarization. Among these are the diagonalizer, the least mean square (LMS) canceler [sic] and the bootstrapped cancelers [sic]. Bootstrapped canceler [sic] schemes have been proposed and implemented in different applications, such as satellites, tactical communications, and quadrature amplitude madulation [sic] (QAM) dual polarized microwave radio. Nevertheless, no attempt was made in the past to quantify the …