MétaCan
Menu
Back to cohort
Record W2095232315 · doi:10.1145/1453175.1453188

Running applications efficiently in online social networks

2008· article· en· W2095232315 on OpenAlexaff
Roger Curry, Cameron Kiddle, Nayden Markatchev, Rob Simmonds, Tingxi Tan, Martin Arlitt, Bruce J. Walker

Bibliographic record

VenueACM SIGMETRICS Performance Evaluation Review · 2008
Typearticle
Languageen
FieldComputer Science
TopicPeer-to-Peer Network Technologies
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsExploitComputer scienceThe InternetWorld Wide WebComputer security

Abstract

fetched live from OpenAlex

In the past several years, online social networks (OSNs) such as Facebook and MySpace have become extremely popular with Internet users. Such sites are popular with users because they simplify both communication among "communities" and access to applications. Application developers are attracted to these sites also, as they are able to exploit "word-of-mouth" marketing, which these OSN sites have embodied into their user experience. A challenge for developers though is managing the application, as it is difficult to predict how successful the marketing will be. Our solution combines an OSN, Virtual Appliances, and a utility computing environment together. We demonstrate our solution using the Facebook portal (OSN), the Fire Dynamics Simulator (application), and a utility environment we built using tools such as Condor, Moab and Xen. The application is supported using Virtual Appliances, which interact with our flexible infrastructure to dynamically expand and contract based on user demand. Thus, we are able to make much more efficient use of the underlying physical infrastructure. We believe that our solution also has great potential for enterprise IT environments. Initial feedback suggests combining an OSN with our flexible infrastructure provides a much better user experience than the traditional, standalone use of the (legacy) application, and simplifies the management and increases the effective utilization of the underlying IT resources.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.966
Threshold uncertainty score0.874

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.012
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.093
GPT teacher head0.348
Teacher spread0.255 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designOther design
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueACM SIGMETRICS Performance Evaluation ReviewSame topicPeer-to-Peer Network TechnologiesFrench-language works237,207