S-MOJOHON: Towards a semantic architecture for message exchanging
International Conference on Semantic Computing (ICSC 2007)Published 1 September 2007
Daniel C. Lobato, Renato de Freitas Bulcao Neto, Matheus Qualio Barbosa, Maria da Graça Campos Pimentel, César A. C. Teixeira
Citations16
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper uses S-MOJOHON to select a rendezvous point for a multimedia flow using information about which autonomous systems it belongs to and its uptime and represents these information using an ontology developed by us, which produces RDF documents that are handled by a semantic web framework and a reasoning engine.
Abstract
This paper presents our efforts on adding semantic information to our MOJOHON architecture creating S- MOJOHON - Semantic, Modular, Java-oriented and Hostile NAT-proof - middleware for message exchanging. We developed S-MOJOHON aiming at allowing the communication among two or more instances of a distributed application while maintaining a high level of abstraction with respect to the communication facilities available and exploiting context information provided by an ontology. In our proofof-concept implementation, we use S-MOJOHON to select a rendezvous point for a multimedia flow using information about which autonomous systems it belongs to and its uptime. We represent these information using an ontology developed by us, which produces RDF documents that are handled by a semantic web framework and a reasoning engine. In preliminary tests, S-MOJOHON were able to successfully select the best rendezvous point considering information provided by the knowledge base.
Keywords
Computer ScienceSocial Sciences
ACM Transactions on Intelligent Systems and TechnologyLIBSVM
41,340 Citations2011Chih-Chung Chang, Chih‐Jen Lin
Issues such as solving SVM optimization problems theoretical convergence multiclass classification probability estimates and parameter selection are discussed in detail.
Cambridge University Press eBooksAn Introduction to Support Vector Machines and Other Kernel-based Learning Methods
13,883 Citations2000Nello Cristianini, John Shawe‐Taylor
Mining and summarizing customer reviews
7,714 Citations2004Minqing Hu, Bing Liu
This research aims to mine and to summarize all the customer reviews of a product, and proposes several novel techniques to perform these tasks.
Journal of Marketing ResearchThe Effect of Word of Mouth on Sales: Online Book Reviews
5,939 Citations2006Judith A. Chevalier, Dina Mayzlin
Meeting of the Association for Computational LinguisticsThumbs Up or Thumbs Down? Semantic Orientation Applied to Unsupervised Classification of Reviews
3,654 Citations2002Peter Peter, Turney
Seeing stars
2,127 Citations2005Bo Pang, Lillian Lee
A meta-algorithm is applied, based on a metric labeling formulation of the rating-inference problem, that alters a given n-ary classifier's output in an explicit attempt to ensure that similar items receive similar labels.
Vivaldi
1,154 Citations2004Frank Dabek, Russ Cox +2 more
Vivaldi is a simple, light-weight algorithm that assigns synthetic coordinates to hosts such that the distance between the coordinates of two hosts accurately predicts the communication latency between the hosts.
Large margin classification using the perceptron algorithm
1,099 Citations1998Yoav Freund, Robert E. Schapire
Sentiment Analysis using Support Vector Machines with Diverse Information Sources
693 Citations2004Tony Mullen, Nigel Collier
Experiments on movie review data from the Internet Movie Database demonstrate that hybrid SVMs which combine unigram-style feature-based SVMs with those based on real-valued favorability measures obtain superior performance, producing the best results yet published using this data.
Automatically assessing review helpfulness
522 Citations2006Soo-Min Kim, Patrick Pantel +2 more
This paper considers the task of automatically assessing review helpfulness, and finds that the most useful features include the length of the review, its unigrams, and its product rating.
Bristol Research (University of Bristol)Text Classification using String Kernels
514 Citations2000Huma Lodhi, John Shawe‐Taylor +2 more
A novel kernel is introduced for comparing two text documents consisting of an inner product in the feature space consisting of all subsequences of length k, which can be efficiently evaluated by a dynamic programming technique.
King
370 Citations2002Krishna P. Gummadi, Stefan Saroiu +1 more
The accuracy of King is significantly better than the accuracy of IDMaps, and that King tends to preserve order among its latency estimates, as well as a variety of measurement studies and applications that could benefit from the tool.
Seeing stars when there aren't many stars
319 Citations2006Andrew B. Goldberg, Xiaojin Zhu
A graph-based semi-supervised learning algorithm is presented to address the sentiment analysis task of rating inference and achieves significantly better predictive accuracy over other methods that ignore the unlabeled examples during training.
Word sequence kernels
191 Citations2003Nicola Cancedda, Éric Gaussier +2 more
This article proposes the use of string kernels, a novel way of computing document similarity based of matching non-consecutive subsequences of characters with sequences of words rather than characters, and presents some extensions to sequence kernels dealing with symbol-dependent and match-dependent decay factors.
Metrics for the Internet Age: Quality of Experience and Quality of Business
167 Citations2001Moorsel van
A QoBiz evaluation framework is introduced, responding to the emergence of three types of services that impact quantitative evaluation: business to consumer services, business to business services, and service utility through service providers.
Rational Kernels: Theory and Algorithms
153 Citations2004Corinna Cortes, Patrick Haffner +1 more
ACM SIGOPS Operating Systems ReviewThe Information Bus
107 Citations1993Brian Oki, Manfred Pfluegl +2 more
Research can rarely be performed on large-scale, distributed systems at the level of thousands of workstations, so the motivating constraints, design principles, and archite...
ACM SIGCOMM Computer Communication ReviewEstimating network proximity and latency
78 Citations2006Puneet Sharma, Zhichen Xu +2 more
Netvigator is proposed, a scalable network proximity and latency estimation tool that uses information obtained from probing a small number of landmark nodes and intermediate routers that are discovered en route to the landmarks, to identify the closest nodes.
Future Generation Computer SystemsUsing RDF to describe networks
67 Citations2006Jeroen J. van der Ham, Freek Dijkstra +3 more
The idea of the Network Description Language (NDL), which builds on Semantic Web techniques to create a distributed Topology Knowledge Base (TKB), which can provide a collection of reachability graphs, showing connectivity rules among physical and/or virtual entities is presented.
Network latency metrics for server proximity
63 Citations2002Katia Obraczka, F. Silva
It is argued that, when choosing a single metric for network latency, RTT should be the metric of choice when trying to reduce clients' perceived latency, because it is the least expensive metric to measure.
Software Architecture Documentation in Practice: Documenting Architectural Layers
58 Citations2000Felix Bachmann, Len Bass +6 more
The theme of the work is that documenting an architecture entails documenting the set of relevant views of that architecture, and then completing the picture with documentation of information that transcends any single view.
Efficient Computation of Gapped Substring Kernels on Large Alphabets
36 Citations2005Juho Rousu, John Shawe‐Taylor
Exploiting autonomous system information in structured peer-to-peer networks
29 Citations2005Ji Li, Karen Sollins
By using autonomous system information effectively, structured peer-to-peer networks can achieve lookup performance approaching that based on proximity neighbor selection, but with much less network traffic.
ACM SIGCOMM Computer Communication ReviewWhere is multicast today?
10 Citations2005Ernst W. Biersack
In the following, innovative applications using multicast were developed and the fact that there are multiple receivers that may experience heterogeneous transmission conditions with repect to bandwidth, loss and delay poses a number of challenges for the design of multicast error control and congestion control schemes.
MOJOHON
5 Citations2007Daniel C. Lobato, Matheus Qualio Barbosa +2 more
A layered architecture, named MOJOHON, designed to allow the communication among two or more instances of a distributed application while maintaining a high level of abstraction with respect to the communication facilities available is presented.
eCommons (Cornell University)Latency- and Bandwidth-Minimizing Optimal Failure Detectors
2 Citations2006Kelvin C. W. So, Emin Gün Sirer
This paper analytically derive the optimal closed form formulas for multi-node failure detectors and provides two variants of the optimal solution for optimality metrics appropriate for two different deployment scenarios.