To display the most relevant entries to you in priority,
vote for the stories you are interested in
()
and reject those that you are not interested in
()
Tout le monde cache quelque chose. Votre voisin, votre femme, votre ami... Et si vous pouviez tout
savoir ? Connaître leurs peurs, leurs secrets intimes ? Comme dans "l'oeil de Caine", un
reality-show qui fascine l'Amérique. Dix candidats, dix secrets.
Fujitsu a présenté son PC portable L1010 pour la Génération Y-ers -
des gars qui ont grandi avec les jeux vidéo et qui connaissent bien la technologie. Le
L1010 incluera les caractéristqiues suivantes :-
Processeur Intel Core 2 Duo
Chipset Intel PM45/GM45 Express
Chipset Intel WiFi Link 5300AGN
Webcam 1.3 mégapixels
Microphone
Carte vidéo NVIDIA GeForce 9300M GS 256Mo
Ecran LCD 14.1"
Sorti HDMI
Chose intéressante, le Fujitsu L1010 a un design de charnière qui le cache
intelligemment quand l'écran est baissé. Le prix ou la disponibilité ne sont
pas connus, mais vous aurez le choix entre différentes couleurs.
The other week I delivered an Ext-based application to a customer. Shortly after they were in
touch to say that it was slow. Although an application that relies on >500KB of JavaScript is
never going to be super-fast it shouldn't be taking 10 seconds to open each new tab within the
application, which is what they were experiencing.
Delays in the region of 10s to open a page make an application almost useless as most users just
won't wait that long for stuff to happen. Needless to say I set about trying to work out why it
was happening.
From the off the problem appeared to be "their side". Performance on the server I'd been
developing was as good as you'd expect from an Ext-based application. Resisting the temptation to
simply say "Works fine here!" (hey, I'm a pro, I'd never say that to a
paying customer) I got the customer to log the browser-server transactions, so I
could take a closer look. Not having access to their servers meant I couldn't debug it directly.
To record the HTTP transaction log I had them install the free Basic Edition of HttpWatch. All they had to do then was
start recording, open the application, open a new form, open a new document, edit the document,
save the document etc and then stop recording. The result is a .HWL file which I can then open in
my version of HttpWatch's "Studio". I can then see all headers, response code and the amount of
time taken for all transactions involved.
On opening the the HWL file it was almost immediately obvious there was a problem. Here's a view
of the transactions involved:
Notice the Result column. This shows the HTTP status code returned. A code of 200 means
everything was "ok". This is "ok" but not what we'd expect to see for all transactions.
Especially on subsequent requests for the same resource. What we'd expect is a code of 304 which
tells the browser it hasn't changed and it can use the local cached copy instead. Because this
isn't happening the cache is never used and so it runs unacceptably slowly.
Why is it doing this though?
Drilling down in to each individual transaction I noticed something common to them all. For each
GET request the server was returning a Cache-Control header of no-cache.
While we expect this for certain URLs, such as those ending in ?OpenAgent or ?OpenForm, we
certainly wouldn't expect it of requests for files ending in CSS, JS or GIF. The image above
shows a request for a JS file which is 500KB in size. You definitely want something like that
cached browser-side!
What could be causing this?
As far as I know the only way for this to happen would be if a developer or administrator had
previously added a Web Site Rule to the server's directory which looked something like this:
The effect of applying this rule, which I verified by testing on my own server (following a
restart), is that the server tells the browser not to cache anything from it.
While I imagine this might have solved whatever problems the developer was having with caching at
the time it has - in turn - created other problems, as they're finding now.
It should go without saying, but I'll say it anyway -- never ever use a system-wide configuration
change like this as a quick fix to a problem you're having. If you do then you at least need to
be mindful of any adverse effects on other applications.
My advise to the customer was that the only real solution was to remove the rule. Although, as I
warned them, this could then "break" any systems that have been developed with it in place.
An alternative would be to add subsequent Rules which tell the browser to using caching if the
URL ends in *.js etc and hope that it trumps the Rule already in place.
Le processeur Atom 330, équivalent du N230 mais en dual-core, devrait selon nos
confrères de Fudzilla être lancé le 21 septembre prochain. L’Atom 330
cadencé à 1.6 GHz emprunte le socket BGA 437 et profite d’un FSB de 533 MHz
ainsi que d’un cache L2 de 1 Mo (512 Ko par Core). Ses deux cÅ“urs supporteraient
4 [...]
Depuis Intervilles 2005 et son départ du service public, Patrice
Laffont a rejoint la TNT et Direct 8. Après Direct Poker, l'animateur prendra prochainement
les commandes d' On va s'aimer !, adapté du succès de la télévision
Tournez Manège.
Après Pelle et Râteau pour les plus jeunes sur Fun TV, cette nouvelle émission
explorera à son tour les rouages de la séduction, version plus de 35 ans. À
travers différentes épreuves, le candidat du jour fera la connaissance de quatre
prétendants. Parmi ces derniers se cache (...)
Engadget Chine vient de mettre en ligne une photo du ATOM Dual-Core le N330. Ce nouveau processeur
Low-Cost intègrera 2 cores, 4 Threads, et 1 Mo de cache L2, le tout à une vitesse de
1.6 GHz. A n'en pas douter, ce processeur redonnera surement un coup de boost aux nettops qui
l'intègreront, surtout que son prix n'est pas excessif, car il devrait être vendu 20$
de plus que la version simple core.
Samsung cache l'identité d'un écran Surprise sur l'IFA lors d'une rencontre avec deux
responsables coréens de Samsung : le moniteur doté d'un temps de réponse de 1
ms ne...
Comparativas entre discos duros y discos SSD ya hemos visto unas cuantas.
Pero muchas veces estas se quedan en simples números o datos, haciendo difícil apreciar
si realmente merece la pena optar por una tecnología o por la otra.
Por ello me ha parecido relevante el vídeo que han hecho en Exoid comparando dos modelos del
mismo ultraportátil, cada uno de ellos equipado con un disco distinto. Se trata del
Asus Eee 1000H y el Asus Eee 1000, el primero de los cuales
viene con un disco tradicional y el segundo con uno de tipo SSD.
La comparativa demuestra que hay diferencias significativas entre ambos portátiles, que
dependiendo de la tarea que estemos realizando representan un tiempo más que elevado. Por
ejemplo, la instalación de Adobe Acrobat en el modelo con SSD dura más del
doble que en el modelo con disco duro.
Aunque la velocidad de lectura del disco SSD es más elevada, la de escritura es bastante
menor, por lo que las operaciones de este tipo ralentizan considerablemente el ordenador en la
mayoría de usos. Por ejemplo, al navegar no hay diferencias demasiado significativas, pues
las ventajas de velocidad que puede aportar el SSD se ven compensadas por que el navegador guarde
los datos en la cache en el disco.
Para poner la guinda, el modelo con disco SSD dispone de 2GB de RAM, mientras que el modelo con
disco duro solo dispone de 1 GB, lo que debería lastrarlo frente al otro, aunque como
podemos ver en el vídeo el rendimiento es mejor en la mayoría de ocasiones.
Eso sí, es necesario poner las cosas en su sitio. Esto no significa que los discos SSD en
general sean peores que los discos duros, sino que se compara el modelo concreto que utiliza el
Eee 1000 con el 1000H. Probablemente, discos de otras marcas
darán resultados distintos.
Por otro lado, los discos SSd ofrecen ventajas claras, como un menor consumo de energía,
mejor resistencia a golpes y, como demuestran estos dos modelos, menor tamaño, pues el que
viene con disco duro es bastante más grueso que el otro.
Cada uno deberá decidir cual es la opción que más le conviene, teniendo en cuenta
que, por ejemplo en este caso, el modelo con disco SSD de 40 GB de capacidad cuesta 100
dólares más que el modelo con disco duro de 80 GB.
J’ai pris du plaisir à faire ce visuel, un visu gratuit, sans
“blague” ou sens caché, juste du joli, une certaine esthétique aussi.
Avec le recul je me rends compte que l’eau est très “Louis
quinzée”, toute en courbes et contre-courbes, probablement une influence liée
à ma passion pour les meubles anciens.
J’ai tenté de mélanger plusieurs choses qui me passionnent, le Japon, le
luxe, l’Antiquité, la Nature, l’illogisme également. Je suis heureux
que ce visuel ait été choisi, il compte beaucoup pour moi, pour diverses
raisons… C’est compliqué de parler de soi, encore plus de son travail, voire
de son univers.
Enjoy. (un subtil jeu de mot se cache dans le titre de ce visuel, tu peux te faire aider par un
adulte si tu ne trouves pas de suite, mon dernier mot Jean-Pierre sera: cueille ce
jour…). Beyond the Chuch’
Souvenez-vous, il y a quelques temps , on vous présentait le travail de Desiree Palmen,
camouflages urbains conçus pour se fondre dans un paysage hostile. Plus discret, et aussi
plus poétique, Joshua Callaghan conçoit aussi des trompe-l'oeil urba... Lire la suite |
commentaire
chez ma tente...de toi Décakelon fort du succès de ses tentes automatiques "2
sec;", se lance à l'assaut du marché de la tente de toit, avec un modèle
commercialisée sous le nom de "FanfTent 2sec", une appelation "barbare" qui cache un
modèle 2sec adapté aux besoins des 4x4 et autres véhicules de tourisme.
Le modèle était présenté par deux charmantes hôtesses,
en avant première le premier week-end d'Août à Epagny en Haute-Savoie,
où la marque possède une importante surface commerciale, sur une Mégane
Renault.   En exclusivité, notre partenaire Lipocamp était
présent et s'est prêté au jeu du comparatif, et nous a ramené
quelques images qui pourraient bien révolutionner dans quelques temps nos bivouacs en
raid. Retrouvez le diaporama complet 
The STX B+ Tree package is a set of C++ template classes implementing a B+ tree
key/data container in main memory. The classes are designed as drop-in replacements of the STL
containers set, map, multiset, and multimap, and follow their interfaces very closely. By packing
multiple value pairs into each node of the tree, the B+ tree reduces heap fragmentation and
utilizes cache-line effects better than the standard red-black binary tree. The tree algorithms are
based on the implementation in Cormen, Leiserson, and Rivest's Introduction into Algorithms, Jan
Jannink's paper, and other algorithm resources. The classes contain extensive assertion and
verification mechanisms to ensure the implementation's correctness by testing the tree invariants.
License: GNU Lesser General Public License (LGPL) Changes:
All issues with root node pointer == NULL have been fixed. A crash when attempting to
copy-construct an empty btree or when trying to remove a nonexistent item from an empty btree has
been fixed. A crash when running verify() on an empty btree object has been fixed. Now the root
node is freed when the last item is removed.
The STX B+ Tree package is a set of C++ template classes implementing a B+ tree
key/data container in main memory. The classes are designed as drop-in replacements of the STL
containers set, map, multiset, and multimap, and follow their interfaces very closely. By packing
multiple value pairs into each node of the tree, the B+ tree reduces heap fragmentation and
utilizes cache-line effects better than the standard red-black binary tree. The tree algorithms are
based on the implementation in Cormen, Leiserson, and Rivest's Introduction into Algorithms, Jan
Jannink's paper, and other algorithm resources. The classes contain extensive assertion and
verification mechanisms to ensure the implementation's correctness by testing the tree invariants.
License: GNU Lesser General Public License (LGPL) Changes:
All issues with root node pointer == NULL have been fixed. A crash when attempting to
copy-construct an empty btree or when trying to remove a nonexistent item from an empty btree has
been fixed. A crash when running verify() on an empty btree object has been fixed. Now the root
node is freed when the last item is removed.
I’ve upgraded the software and plugins on this site. Some files have changed and you may need
to clear your cache to get the new files.The most noticeable new feature is client-side validation
of comment format. If your comment is not properly formed, changes will be made to it and you will
be notified of the differences before you submit. It’s not perfect or smart, but it gets the
job done. I will implement “give...
Voici maintenant le focus qui est mis sur la prochaine version de Toolbar Windows Live
dans sa version 2009 également appelée Wave 3. L’auteur de ses
révélations est encore l’excellent LiveSino.
)
and reject those that you are not interested in
(
)
Depuis Intervilles 2005 et son départ du service public, Patrice
Laffont a rejoint la TNT et Direct 8. Après Direct Poker, l'animateur prendra prochainement
les commandes d' On va s'aimer !, adapté du succès de la télévision
Tournez Manège.
The STX B+ Tree package is a set of C++ template classes implementing a B+ tree
key/data container in main memory. The classes are designed as drop-in replacements of the STL
containers set, map, multiset, and multimap, and follow their interfaces very closely. By packing
multiple value pairs into each node of the tree, the B+ tree reduces heap fragmentation and
utilizes cache-line effects better than the standard red-black binary tree. The tree algorithms are
based on the implementation in Cormen, Leiserson, and Rivest's Introduction into Algorithms, Jan
Jannink's paper, and other algorithm resources. The classes contain extensive assertion and
verification mechanisms to ensure the implementation's correctness by testing the tree invariants.
License: GNU Lesser General Public License (LGPL) Changes: