Curation

Facebook Twitter

18 rue marius jacotot 92800 Puteaux. Le Bambou Blog » Cairngorm 3, architecture et bonnes pratiques pour vos applications Flex. Mathieu barcikowski (mbarcikowski) Designing Web Applications for Scalability. Stride and Associates | Blog Network — Candidate Advantage | Hiring Juice | .NET Convo | Open Source Convo A collaborative Open Source technologies blog focused on scalability, web development, and the latest software development trends. « Pairing NoSQL and Relational Data Storage: MySQL with MongoDB | Building a Scalable Key-Value Database: Project Hydracus » Tags: mongodb, amazon ec2, production, database, nosql I can’t even count the number of times that I’ve heard this phrase: “don’t worry about scaling your web application, worry about visitor (or customer) acquisition.”

Designing Web Applications for Scalability

Navigateurs : Chrome aura sa galerie d'applications - Forum des. Chrome aura sa galerie d'applicationsElle est déjà disponible pour la version développeur de ChromiumGoogle étudie la possibilité de fournir une galerie d'applications pour son navigateur Chrome.Le projet est d'ailleurs bien avancé.

Navigateurs : Chrome aura sa galerie d'applications - Forum des

La galerie en question est en effet déjà disponible, à un stade encore expérimental, pour la version développeur de Chromium, le pendant open-source de Chrome à la base de celui-ci.Le but de cette galerie est de fournir des applications à part entière (gratuites et payantes) qui puissent tourner directement dans le navigateur. Il ne s'agit donc pas d'extensions qui, elles, rajoutent une simple fonctionnalité au programme. Plusieurs discussions sur Google Code traitent de cette galerie, pour l'instant encore cachée. MediaElement.js - HTML5 video player in CSS with Silverlight and Flash fallbacks.

MediaElement.js - HTML5 video player in CSS with Silverlight and Flash fallbacks. Awaitility – Java DSL for easy testing of asynchronous systems — Jayway Team Blog. By Johan Haleby - Java, Testing Introduction Testing asynchronous systems is hard.

Awaitility – Java DSL for easy testing of asynchronous systems — Jayway Team Blog

Wireframes. Mockups. Prototypes — FlairBuilder. Solving the Constructor Ambiguity Problem with Spring 3 & Annota. In a previous tutorial, we stepped through the process of configuring a Spring container and hacking out some Java code that would leverage the Spring container's formidable powers of IoC (Inversion of Control).

Solving the Constructor Ambiguity Problem with Spring 3 & Annota

The final result of our hard work in the previous tutorials was to get the Spring container to spit out an instance of the GameSummary class we created. It's a simple class that represented the results of playing a Rock-Paper-Scissors game. SPARQL XMPP Communications » crschmidt.net. Introduction XMPP, the protocol behind the more commonly known Jabber chat services, is an XML based communications format with significant support for extensibility.

SPARQL XMPP Communications » crschmidt.net

This messaging framework makes for an ideal method of transportation of SPARQL queries to various endpoints, querying the RDF data stored at those endpoints using SPARQL and receving data in the standardized SPARQL XML query results format. Why SPARQL? SPARQL is the W3C's standardized language for querying RDF datastores.

It is implemented in a number of libraries in several different programming languages, and is on the track to become a W3C Recommendation in the near future. Damn Cool Algorithms: Levenshtein Automata. Posted by Nick Johnson | Filed under python, coding, tech, damn-cool-algorithms In a previous Damn Cool Algorithms post, I talked about BK-trees, a clever indexing structure that makes it possible to search for fuzzy matches on a text string based on Levenshtein distance - or any other metric that obeys the triangle inequality.

Damn Cool Algorithms: Levenshtein Automata

Today, I'm going to describe an alternative approach, which makes it possible to do fuzzy text search in a regular index: Levenshtein automata. Introduction The basic insight behind Levenshtein automata is that it's possible to construct a Finite state automaton that recognizes exactly the set of strings within a given Levenshtein distance of a target word.