You are currently browsing the tag archive for the ‘Technology’ tag.
Phys.org, 40 Gbit/s at 240 GHz: New world record in wireless data transmission, here.
Researchers of the Fraunhofer Institute for Applied Solid State Physics and the Karlsruhe Institute for Technology have achieved the wireless transmission of 40 Gbit/s at 240 GHz over a distance of one kilometer. Their most recent demonstration sets a new world record and ties in seamlessly with the capacity of optical fiber transmission. In the future, such radio links will be able to close gaps in providing broadband internet by supplementing the network in rural areas and places which are difficult to access.
Read more at: http://phys.org/news/2013-05-gbits-ghz-world-wireless-transmission.html#jCp
Sam Biddle, Gizmodo, AMD Just Set a World Record for Overclocking, here.
It may not technically be the world’s fastest processor, but AMD squeezed an overclocked Guinness World Record number out of its impending 8-core FX CPU: 8.429 GHz, beating the previous global high of 8.308 GHz. Intel fanboys, begin your outrage!
Niels Broekhuijsen, Tom’s Hardware, Intel’s Core i7-4770K Overclocked to 8.0 GHz, here. AMD makes better geek video.
Earlier, we showed you a screenshot of Intel’s Haswell Core i7-4770K overclocked to a massive 7.0 GHz, but now we have a piece of video showing the CPU overclocked all the way to 8.0 GHz. Theoretically, the CPU shouldn’t be able to go above 8 GHz due to restrictions with the multiplier and base clock, even on the “*K” version.
The video shows the CPU with only two cores enabled and HyperThreading disabled. The voltage of the CPU reaches 2.259 V as the CPU’s clock speed is gradually increased.
Report: Intel’s Ivy Bridge-E CPUs Will Launch Sept. 2013, here.
The flagship i7-4960X would pack six processing cores and with HyperThreading feature 12 threads. It would have a base clock of 3.6 GHz, which will boost up to the 4.0 GHz mark. It has 15 MB of L3 cache and support for DDR3-1866 memory. All this processingpower is made possible through a TDP of a massive 130 Watts.
Wolfgang Gruener, Tom’s Hardware, Intel Has 5 nm Processors in Sight, here. Looks uncomfortable for the FPGA guys.
According to the company, future production processes down to 5 nm are on the horizon and will most likely be reached without significant problems. Following the current 22 nm process, Intel’s manufacturing cadence suggests that the first 14 nm products will arrive in late 2013, 10 nm in 2015, 7 nm in 2017, and 5 nm in 2019. A slight adjustment has been made to include different production processes for traditional processors and nowSoCs. The company previously indicated that SoCs will be accelerated to catch up with the process applied to Intel’s main processor products.
Anand Lai Simpi, Anand Tech, Intel Details Haswell Overclocking at IDF Beijing, here. Haswell is out 2 June. Not going to buy any Ivy Bridge at this point, too late.
As we march towards the June 2nd release of Intel’s Haswell processors, the company is slowly but surely filling in the missing blanks. Most recently we saw a shot of the often discussed but rarely seen Haswell GT3e part with on-package DRAM, and today we get some confirmation on what overclocking Haswell will be like.
As a quick refresher, the max clock frequency of Haswell is governed by the following equation:
Clock Speed = BCLK * Ratio
In the old days, both of the variables on the right hand side were unlocked (back then it wasn’t called BCLK). Around the time of the Pentium II, Intel locked the multiplier ratios (rightmost variable) and then a few years ago we lost the ability to manipulate un-multiplied input frequency.
Google IO, here.
Be inspired by the tech world’s latest web, mobile and social breakthroughs to create simple, life-improving technologies and viable businesses among a rich and diverse community of cutting edge developers.
MIT, Fall 2012 6.858: Computer Systems Security, here. Smashing the Stack paper is new to me.
Cryptography
- Applied Cryptography by Bruce Schneier. John Wiley & Sons, 1996. ISBN 0-471-11709-9.
- Handbook of Applied Cryptography by Menezes, van Oorschot, and Vanstone.
- Introduction to Cryptography by Johannes Buchmann. Springer, 2004. ISBN 978-0-387-21156-5.
- Cryptographic libraries:
- KeyCzar by Google.
- GPGME by GnuPG.
- OpenSSL.
- NaCl: Networking and Cryptography library by Tanja Lange and Daniel J. Bernstein.
Control hijacking attacks
- Smashing The Stack For Fun And Profit, Aleph One.
- Bypassing non-executable-stack during exploitation using return-to-libc by c0ntex.
- Basic Integer Overflows, blexim.
Computing Frontiers 2013 Program, here. Maxeler folks are there doing the Dataflow talk. Boy it sure helps to know a little history doesn’t it? It can save you a bunch.
Alex Mansfield, BBC, NASA buys into ‘quantum’ computer, here. Since when did NASA get money to buy stuff? Alex had a draft of this article with “blink of an eye” instead of “fractions of a second,” right?
A $15m computer that uses “quantum physics” effects to boost its speed is to be installed at a Nasa facility.
It will be shared by Google, Nasa, and other scientists, providing access to a machine said to be up to 3,600 times faster than conventional computers.
Unlike standard machines, the D-Wave Two processor appears to make use of an effect called quantum tunnelling.
This allows it to reach solutions to certain types of mathematical problems in fractions of a second.
Quentin Hardy, NYT, Google Buys a Quantum Computer, here.
The Quantum Artificial Intelligence Lab, as the entity is called, will focus on machine learning, which is the way computers take note of patterns of information to improve their outputs. Personalized Internet search and predictions of traffic congestion based on GPS data are examples of machine learning. The field is particularly important for things like facial or voice recognition, biological behavior, or the management of very large and complex systems.
“If we want to create effective environmental policies, we need better models of what’s happening to our climate,” Google said in a blog post announcing the partnership. “Classical computers aren’t well suited to these types of creative problems.”
Google said it had already devised machine-learning algorithms that work inside the quantum computer, which is made by D-Wave Systems of Burnaby, British Columbia. One could quickly recognize information, saving power on mobile devices, while another was successful at sorting out bad or mislabeled data. The most effective methods for using quantum computation, Google said, involved combining the advanced machines with its clouds of traditional computers.
Google and NASA bought in cooperation with the Universities Space Research Association, a nonprofit research corporation that works with NASA and others to advance space science and technology. Outside researchers will be invited to the lab as well.
This year D-Wave sold its first commercial quantum computer to Lockheed Martin. Lockheed officials said the computer would be used for the test and measurement of things like jet aircraft designs, or the reliability of satellite systems.
Scott Aaronson, Shtetl-Optimized, Ask Me Anything! Tenure Edition, here. You don’t really have to read the BBC and NYT coverage of Quantum when you can just ask Aaronson anything.
By popular request, for the next 36 hours—so, from now until ~11PM on Tuesday—I’ll have a long-overdue edition of “Ask Me Anything.” (For the previous editions, see here, here, here, and here.) Today’s edition is partly to celebrate my new, tenured “freedom to do whatever the hell I want” (as well as the publication after 7 years of Quantum Computing Since Democritus), but is mostly just to have an excuse to get out of changing diapers (“I’d love to, honey, but the world is demanding answers!”). Here are the ground rules:
-
One question per person, total.
-
Please check to see whether your question was already asked in one of the previous editions—if it was, then I’ll probably just refer you there.
-
No questions with complicated backstories, or that require me to watch a video, read a paper, etc. and comment on it.
-
No questions about D-Wave. (As it happens, Matthias Troyer will be giving a talk at MIT this Wednesday about his group’s experiments on the D-Wave machine, and I’m planning a blog post about it—so just hold your horses for a few more days!)
-
If your question is offensive, patronizing, nosy, or annoying, I reserve the right to give a flippant non-answer or even delete the question.
-
Keep in mind that, in past editions, the best questions have almost always been the most goofball ones (“What’s up with those painting elephants?”).
Julia La Roche, BI, BLOOMBERG SPYING SCANDAL ESCALATES: Reporters Used Terminals To Spy On JPMorgan During ‘London Whale’ Disaster, here. I told you, Data is rough business.
Reporters at Bloomberg News used private information from Bloomberg terminals to spy on employees at Goldman Sachs.
And now it’s clear that Bloomberg reporters used private terminal information to report on at least one other firm, too.
Wall Street firms pay Bloomberg millions of dollars a year to buy Bloomberg terminal accounts for their employees.
Until recently, Bloomberg News reporters with access to these private Bloomberg systems could see when specific Bloomberg clients were logging on and off and various search functions they use.
The Post’s story revealed that reporters at Bloomberg News used this private information to spy on the activity of individual Goldman partners and use the information they discovered in developing Bloomberg news stories.
According to a source at JPMorgan, Bloomberg reporters also secretly used private client information on the terminal while reporting on JPMorgan’s disastrous “London Whale” trade last year.
Read more: http://www.businessinsider.com/bloomberg-news-goldman-2013-5#ixzz2T0gkfKbA
QuickFIX, Source code, here.
| Source Code | |||||||||||||
| QuickFIX https://quickfix.svn.sourceforge.net/svnroot/quickfix/trunk/quickfixQuickFIX Log Viewer https://quickfix.svn.sourceforge.net/svnroot/quickfix/trunk/quickfix-logviewer |
|||||||||||||
| Other Tools | |||||||||||||
|
|||||||||||||
Boost, C++ Libraries, here.
Boost provides free peer-reviewed portable C++ source libraries.
We emphasize libraries that work well with the C++ Standard Library. Boost libraries are intended to be widely useful, and usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use.
We aim to establish “existing practice” and provide reference implementations so that Boost libraries are suitable for eventual standardization. Ten Boost libraries are included in the C++ Standards Committee’s Library Technical Report (TR1) and in the new C++11 Standard. C++11 also includes several more Boost libraries in addition to those from TR1. More Boost libraries are proposed for TR2.
David Foster Wallace, Vimeo, This is Water, here. Little tighter than Burry’s UCLA address.
Robert Morelos-Zaragoza, The Error Correcting Codes (ECC) Page, here. Source code for starters here is a sample -
The Ubiquitous Reed-Solomon Codes
by Barry A. Cipra, Reprinted from SIAM News, Volume 26-1, January 1993
Decoding the Berlekamp-Masssey (BM) algorithm, with error evaluation as explained in Lin and Costello’s book.
(Simon Rockliff, 1989
Based on the above program to handle errors and erasures, plus other features. Note: The program does not work with shortened codes and codes over GF(2^m), m<8 … it gives good ideas though.
(Thirumoorthy, 1995)
Nicely written, greatly improved version of the program above. It now lets the user create multiple encoders at run time with specified parameters You can get the latest package here. Check also Phil’s home page.
(Phil Karn, 2006).
Enter only the length and error correcting capability. The program computes the generator polynomial of any binary BCH code, plus encoding and decoding using the BM algorithm.
(Morelos-Zaragoza, 1994).
Yaron Minsky, yminsky’s blog, here
We just had a really fun tutorial on OCaml, Core and Async for about 20 people from the current Hacker School batch. The tutorial was in part based on an early cut of Real World OCaml, and in part based on the examples in the Core Hello World repo that has a few examples of Core and Async in action.
A few weeks ago, we gave out a small, early snapshot of the first few chapters of RWO, and some instructions for installing OPAM so you could get the appropriate versions of OCaml, Core and Async installed, in the hopes of getting people prepared for the tutorial. A few people also started working on the 99 problems in OCaml from the ocaml.org website.
Cade Metz, Wired, Facebook Ratlles Networking World With ‘Open Source’ Gear, here. Very cool, the Kickstarter play for my 2014 Open Source Haswell Server cannot be far behind. Adds numbers in less time than a blink of an eye, communicates over fiber thinner than a human hair, and does not need to move it’s lips when it reads. It’s like totally inhuman, or something.
Two years ago, Mark Zuckerberg and company turned the hardware world on its head when they launched the Open Compute Project, an effort to improve every aspect of the modern data center and share the results with the world at large. They began by “open sourcing” fresh designs for computer servers and power systems and cooling equipment. Then they did the same with hardware that stores massive amounts of digital data. Then they remade the racks that hold all these machines. And now it’s time for the networking gear.
The idea is to design a networking switch that anyone can load with their own operating system — just as you can load your own OS on a computer server. Typically, networking switches are sold by hardware giants such as Cisco and HP and Dell, and they ship with software specific to the company that designed them. But Facebook aims to separate the hardware from the software.
Sam Biddle, ValleyWag, Ex-Facebook Exec: Startup World Should Be “Utterly Ashamed Of Itself, here.
Former Facebook bigwig and current investor Chamath Palihapitiya isn’t pulling any punches at this week’s TechCrunch Disrupt, where many a punch is typically pulled. He’s disgusted with what’s called tech innovation now, saying “we are at an absolute minimum in terms of things that are being started.”
