131 |
An investigation of distributed modelling and intelligent agent techniques for collaborative task supportPatel, Rakeshkumar January 2002 (has links)
No description available.
|
132 |
Configurable highly available distributed servicesKaramanolis, Christos January 1996 (has links)
No description available.
|
133 |
A cycle time constrained approach to manufacturing capacity planningLeach, Nicholas Paul January 1999 (has links)
No description available.
|
134 |
Research into a general framework for computer supported cooperative workHarvey, Paul January 1996 (has links)
No description available.
|
135 |
Distributed simulation of high-level algebraic Petri netsDjemame, Karim January 1999 (has links)
No description available.
|
136 |
A statistical approach to parallel sorting and selection algorithms designLoo, Alfred January 2000 (has links)
No description available.
|
137 |
Improved axis synchronisation in a distributed machine control interpolatorSmith, Anthony Paul January 1994 (has links)
No description available.
|
138 |
Nonlocality and communication complexityDam, Wim van January 1999 (has links)
No description available.
|
139 |
MapReduce based RDF assisted distributed SVM for high throughput spam filteringCaruana, Godwin January 2013 (has links)
Electronic mail has become cast and embedded in our everyday lives. Billions of legitimate emails are sent on a daily basis. The widely established underlying infrastructure, its widespread availability as well as its ease of use have all acted as catalysts to such pervasive proliferation. Unfortunately, the same can be alleged about unsolicited bulk email, or rather spam. Various methods, as well as enabling architectures are available to try to mitigate spam permeation. In this respect, this dissertation compliments existing survey work in this area by contributing an extensive literature review of traditional and emerging spam filtering approaches. Techniques, approaches and architectures employed for spam filtering are appraised, critically assessing respective strengths and weaknesses. Velocity, volume and variety are key characteristics of the spam challenge. MapReduce (M/R) has become increasingly popular as an Internet scale, data intensive processing platform. In the context of machine learning based spam filter training, support vector machine (SVM) based techniques have been proven effective. SVM training is however a computationally intensive process. In this dissertation, a M/R based distributed SVM algorithm for scalable spam filter training, designated MRSMO, is presented. By distributing and processing subsets of the training data across multiple participating computing nodes, the distributed SVM reduces spam filter training time significantly. To mitigate the accuracy degradation introduced by the adopted approach, a Resource Description Framework (RDF) based feedback loop is evaluated. Experimental results demonstrate that this improves the accuracy levels of the distributed SVM beyond the original sequential counterpart. Effectively exploiting large scale, ‘Cloud’ based, heterogeneous processing capabilities for M/R in what can be considered a non-deterministic environment requires the consideration of a number of perspectives. In this work, gSched, a Hadoop M/R based, heterogeneous aware task to node matching and allocation scheme is designed. Using MRSMO as a baseline, experimental evaluation indicates that gSched improves on the performance of the out-of-the box Hadoop counterpart in a typical Cloud based infrastructure. The focal contribution to knowledge is a scalable, heterogeneous infrastructure and machine learning based spam filtering scheme, able to capitalize on collaborative accuracy improvements through RDF based, end user feedback. MapReduce based RDF Assisted Distributed SVM for High Throughput Spam Filtering
|
140 |
A concurrent object coordination language : semantics and applicationsO'Connell, Gordon Wayne. 10 April 2008 (has links)
No description available.
|
Page generated in 0.0827 seconds