id
int64 2
42.1M
| by
large_stringlengths 2
15
⌀ | time
timestamp[us] | title
large_stringlengths 0
198
⌀ | text
large_stringlengths 0
27.4k
⌀ | url
large_stringlengths 0
6.6k
⌀ | score
int64 -1
6.02k
⌀ | descendants
int64 -1
7.29k
⌀ | kids
large list | deleted
large list | dead
bool 1
class | scraping_error
large_stringclasses 25
values | scraped_title
large_stringlengths 1
59.3k
⌀ | scraped_published_at
large_stringlengths 4
66
⌀ | scraped_byline
large_stringlengths 1
757
⌀ | scraped_body
large_stringlengths 1
50k
⌀ | scraped_at
timestamp[us] | scraped_language
large_stringclasses 58
values | split
large_stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
42,349 | adamsmith | 2007-08-14T19:12:37 | Raising Money: Every morning wake up and say to yourself 'They need me more than I need them.' | http://blogs.xobni.com/asmith/archives/58 | 18 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,350 | farmer | 2007-08-14T19:14:56 | Surfing As GoogleBot | http://www.thegooglecache.com/uncategorized/googles-real-back-door/?surf-as-google | 4 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,356 | danw | 2007-08-14T19:28:07 | Interview with Richard Moross and Stefan Magdalinski of Moo.com | null | http://www.thinkvitamin.com/interviews/webapps/richard-moross-and-stefan-magdalinski/ | 2 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,363 | jcwentz | 2007-08-14T19:40:47 | New Biometric System Verifies Iris of Walking Person in 2 Seconds | null | http://techon.nikkeibp.co.jp/english/NEWS_EN/20070809/137753/ | 2 | 0 | null | null | null | no_error | 日経クロステック（xTECH） | null | 日経クロステック（xTECH） |
ピックアップ
動かないコンピュータ
気仙沼市立病院で4万8651人の患者情報が漏洩の恐れ、廃棄したPOSレジにデータ残存
2024年8月、気仙沼市立病院で4万8651人の患者情報に漏洩の恐れが判明した。流出元となったのは、病院の移転に伴って処分したPOSレジ端末だった。委託業者を通じてフリマに出品され、落札者からの連絡で漏洩が発覚した。個人情報を含む医療機器は破砕処分していたが、個人情報を含まないと勘違いしていた。2024.11.08
記者の眼
スターリンクによる建設現場革命は起こるのか、イーロン・マスク氏の動向に注目
ニュース解説
EV電池発火10の疑問、TeslaのEVトラック消火に19万リットルの水
日経クロステック ランキング
2024年10月にミドル層（部課長クラス）の会員が読んだ記事ランキング
建設業界マンスリー・アーカイブス
住人が「隣のタワマンが眺望を阻害」と提訴／病院の雨漏り、鹿島に1億円超の支払い命令／建設現場にスターリンク、工事に革新
先端技術マンスリー・アーカイブス
「エンジンなくなるまでやる」宣言／「端から日系部品メーカーは外す」、重い一言／VWはなぜ工場閉鎖に追い込まれたのか
最新AIがすごすぎる
グルメ評判店探しや動画検索はGeminiにおまかせ、拡張機能でカバー範囲を拡大
日経クロステック編集部おススメ
「読書プラスα」で利用者魅了、通いたくなる公立図書館5選
10分充電で“EV2.0”
日本から“10分切り”の充電技術続々、大本命は全固体電池
本音で議論、企業情報システムの「勘所」
自治体システム標準化、統一システムでみんながハッピーになる全体最適を実現しよう
ニュース解説：建築・住宅
ハザードマップの死角、100億円投じた日立市庁舎は23年豪雨でなぜ浸水したか
ニュース解説
識者に聞く、スズキ48V次世代ハイブリッドの狙い
ピックアップ一覧
ニュース
「ヤリス」シリーズが1年3カ月ぶりの首位、2024年10月の新車販売
日本自動車販売協会連合会（自販連）と全国軽自動車協会連合会（全軽自協）が2024年11月7日に発表した同年10月の車名別新車販売台数（速報値、以下同じ）によると、登録車（乗用…
2024.11.08
ベトナムVinFastがメキシコの公共交通機関にEV3000台を供給
ベトナムVinFast（ビンファスト）は、メキシコ・ドゥランゴ市の運転手組合と公共交通機関のグリーン化に関して覚書を締結した。この覚書に基づき、VinFastはドゥランゴ市の…
2024.11.08
NECがAIと衛星画像を用いた水管橋点検、ドローン撮影よりもコスト減を実証
NECがAI（人工知能）と無償利用できる人工衛星画像を用いた水管橋点検の実証実験を札幌市で行った。ドローンによる点検作業と比べて、撮影コストをかけずに多頻度な計測を実現できた…
2024.11.08
ニュース一覧
トピックス
日経クロステック編集部おススメ
「読書プラスα」で利用者魅了、通いたくなる公立図書館5選
2024.11.08
情報技術マンスリー・アーカイブス
日本通運がアクセンチュア提訴／AIデータセンターの真相／ハイパーオートメーション
2024.10.10
先端技術マンスリー・アーカイブス
「エンジンなくなるまでやる」宣言／「端から日系部品メーカーは外す」、重い一言／VWはなぜ工場閉鎖に追い込まれたのか
2024.11.08
建設業界マンスリー・アーカイブス
住人が「隣のタワマンが眺望を阻害」と提訴／病院の雨漏り、鹿島に1億円超の支払い命令／建設現場にスターリンク、工事に革新
2024.11.08
知ったかぶりをする前に読んでおきたい「IT基本用語辞典」
仕事に役立つ！ IT・電機・製造・建築・土木の用語集＆Excel・Linux・ネットワークのコマンド集
ぜひお申し込みください「日経クロステック登録会員（無料）」の特典を紹介
有料会員は全記事読み放題！見たい記事が必ず探せる「日経クロステック活用ガイド」
特設サイト
日経クロステック／技術メディアの本
国土交通白書2024の読み方
最新の出題内容や傾向を基に2023年版を大幅に改訂。25年度も必読の国土交通白書の効率的な読み方...
世界EV総覧＆技術戦略レポート2025
日米欧中韓印34社の戦略・280車種の車両仕様を総ざらい。世界のEVメーカーは何を狙い、どこを攻...
DXサーベイ2025-2027
936社のデジタル化実態調査、先進企業の戦略、ITベンダー/コンサルの顧客満足度、期待度調査… ...
ＡＩビジネス事業創出・参入戦略2025-2028
ＡＩ活用でどのようなビジネスチャンスが考えられるのか？市場規模はどこまで伸びるのか？拡大するＡＩ...
２０４５ 不都合な未来予測48 生成AIが開けた扉の向こう側
「AIは世界を変える」と言うが、どのように変わるのかに想像できなければ備えようがありません。本書...
ChatGPT＆Copilot 爆速の時短レシピ
ChatGPTをはじめとする生成AIでできること、使うべき場面を、具体例に即して多数紹介。生成A...
書籍一覧
注目のイベント
【11月5日】どうする？ 狙われる製造業、待ったなしの工場セキュリティ
2024年 11月 15日
【11月22日】落合博満氏が語る「常勝チーム」、企業の成長戦略にどう生かす？
2024年11月22日（金）
サイバーイニシアチブ東京2024
2024年11月26日（火) 9:30～18:00、11月27日（水）9:30〜17:30
【11月26～27日】ロケット開発の舞台裏、新たな技術が生み出すイノベーションとは
2024年11月26日、2024年11月27日
DX Insight 2024 Winter
2024年11月28日（木）、11月29日（金）10:30～16:20
【11月28日】日清食品HDのCIOが語る、生成AIの戦略的なビジネス活用
2024年 11月28日（木）
【11月19日】求められる「顧客体験」向上、AI・データ活用のポイントは？
2024年11月29日（火）
WOMAN EXPO 2024 Winter
2024年11月30日（土）10：00～17：30
DIGITAL Foresight 2024-25 Winter
2024年12月3日（火）～2025年2月20日（木）16：00～17：00 ※毎週火・木開催予定
【12月13日】生成AI活用の新常識、セキュリティと高精度を両立させる方法とは？
2024年 12月13日（金）
注目記事
増え続ける内部脅威インシデント、従業員の犯行を防ぐ有効な対策とは
セキュリティの内部脅威に備える！ あらゆる組織に問うべき確認ポイント
Microsoft製品の移行で「よくある質問トップ10」、クラウド大手がズバリ解説
「自分の生産性は高い」は大きな錯覚、無駄なタスクを減らす3つの方法
テストの抜け漏れが信用失墜に！ 第三者テストの重要性とは
これは簡単・確実！ 電話番号だけでネットサービスの本人認証を強化する方法
特設サイトアーカイブ
U29エンジニアの教科書
半導体不足の深層
2023年の展望
ウクライナ危機（日経BP全社サイト）
ウクライナ危機
省エネNext
技術者の転職
ウッドショック急襲
悩める30代、できるエンジニアへの羅針盤
3.11 東日本大震災から10年
日経クロステック Special
What's New!
今と未来を見据えたAI戦略を実現する
SDVで開発環境刷新は必須に。対応策は？
増加する車載ディスプレイを効率的に接続
「Cyber Operate」誕生
SDV時代におけるセキュリティテスト対策
IT
今と未来を見据えたAI戦略を実現する
「Cyber Operate」誕生
AIでセキュリティーはどう変わる？
GPUを生かすGMOのインフラ構築術
最前線企業語る生成AI導入と活用のリアル
アグレックス、ログの活用でさらにホワイトな職場環境へ
生成ＡＩを無償で実体験できるセミナーとは
ＤＸ先進企業こそ再考するべき運用の価値
日本のAI創薬の基盤となるインフラとは？
小木曽工業の経営改革 ERPで成果を実感
「会社に行きたくなるオフィス」とは？
新Llamaで、激変する生成AI活用
SASEの運用は専門家に任せる時代へ
住友生命／採用業務を４割削減した業務改革
ＶＲ映像を活用したエネルギー環境教育とは
中小企業向けのマイクロソフトセキュリティ
ＩＰＡがＯＳＳの情報を発信する理由
SAP S/4HANA移行の最適解とは？
生成AI基盤の構築・活用どうする？
PC処分・廃棄時のデータ消去｜3つの方法と注意点を解説
進化するサイバー脅威に挑む企業から学ぶ
「2025年の崖」を生み出した問題の本質
マルチクラウド成功の3社事例公開
ＰＣ刷新で教育ＤＸを進める北海道木古内町
SUBARUにおけるAI開発の舞台裏
JR東日本グループのハイブリッドワーク
DX with Cybersecurity
イノベーションの起爆剤
ServiceNowでDXを加速≫方法は
SAPプロジェクトの全体像をいかに描くか
製造
SDVで開発環境刷新は必須に。対応策は？
増加する車載ディスプレイを効率的に接続
SDV時代におけるセキュリティテスト対策
デジタル化、市場創造 製造業の課題解決策
女性エンジニアが活躍できるAGCの働き方
小木曽工業の経営改革 ERPで成果を実感
三菱商事都市開発が提案する「ＣＲＥ戦略」
高付加価値化のための異能技術/展示相談会
過渡応答特性に優れる降圧コンバータ電源
毎月更新。電子エンジニア必見の情報サイト
建築・住宅
小木曽工業の経営改革 ERPで成果を実感
木質建築空間デザインコンテスト 審査発表
土木
小木曽工業の経営改革 ERPで成果を実感
コンストラクション倶楽部
| 2024-11-08T05:58:37 | ja | train |
42,368 | acgourley | 2007-08-14T19:49:50 | uncov on timebridge: 8.5 million raised for google calendar feature | http://www.uncov.com/2007/8/14/timebridge-constructs-new-failroad-station | 6 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,371 | andrewmobile | 2007-08-14T19:50:32 | Facebook entrepeneur event: 2-day conference on social network platforms | http://andrewchen.typepad.com/andrew_chens_blog/2007/08/in-depth-confer.html | 6 | 1 | [
42418
] | null | null | null | null | null | null | null | null | null | train |
|
42,372 | dfranke | 2007-08-14T19:52:37 | [PDF] Encoding information flow in Haskell (think Perl taint-checking on steroids) | http://www.cis.upenn.edu/~stevez/papers/LZ06a.pdf | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,379 | terpua | 2007-08-14T19:58:24 | Ask.com on the Upswing | null | http://bits.blogs.nytimes.com/2007/08/14/askcom-tiny-but-better-loved/ | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,382 | terpua | 2007-08-14T19:59:43 | EBay's Swarm Strategy to Take On Craigslist | http://bits.blogs.nytimes.com/2007/08/13/ebays-swarm-strategy-to-take-on-craigslist/ | 4 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,387 | Keios | 2007-08-14T20:06:38 | Thinking the way animals do | Interesting note on how some autistic people think. | http://www.grandin.com/references/thinking.animals.html | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,391 | palish | 2007-08-14T20:18:04 | Website Statistics? | What sort of site statistics do you all collect on your websites? I'm gearing up for my site launch and I have the usual view count per page plus IP address logging, but I'm wondering if there's any other interesting statistic gathering I could be doing.<p>So what do you do? | 1 | 1 | [
42393
] | null | null | invalid_url | null | null | null | null | 2024-11-08T16:37:59 | null | train |
|
42,398 | mhb | 2007-08-14T20:29:23 | We are living in someone else's computer simulation | null | http://www.nytimes.com/2007/08/14/science/14tier.html?ex=1344744000&en=22bfff4070a81187&ei=5090&partner=rssuserland&emc=rss | 57 | 41 | [
42529,
42617,
42475,
42586,
42403,
42555,
42435,
42458,
42462,
42521,
42653,
42515,
42847,
42609,
42510,
42564,
42535,
42637
] | null | null | null | null | null | null | null | null | null | train |
42,399 | mitchstein | 2007-08-14T20:30:02 | Wrestler death numbers misleading - TvByDemand | Forums | WWE | null | http://www.tvbydemand.com/topic.asp?TOPIC_ID=530&CAT_ID=2&FORUM_ID=49&Forum_Title=WWE&Topic_Title=Wrestler+death+numbers+misleading | 1 | -1 | null | null | true | null | null | null | null | null | null | null | train |
42,404 | Keios | 2007-08-14T20:40:11 | Really small motherboard | 10cms X 7cms. | http://www.mini-itx.com/ | 1 | 0 | null | null | null | missing_parsing | mini-itx.com - news | null | null |
KUBIC is a Nintendo-themed Mini-ITX case you can 3D Print July 15, 2024KUBIC is a 3D Printable Mini-ITX case created by instructables user WhoisLudwig.The KUBIC is a cube-shaped enclosure with a convenient carry handle, and has been designed to accomodate a very short depth (up to 220mm) graphics card plugged directly into the motherboard, an SFX power supply, a 140mm cooling fan and a socket Mini-ITX board with a generously sized CPU heatsink. The exhaust route is from bottom to top and was enough to keep Ludwig's CPU and GPU at a steady 75�C in a 2 hour stress test.Construction is from 34 different parts all no larger than 170x170mm, meaning smaller 3D printers can be used. In addition to the printed components, a variety of hex screws, standoffs, brass inserts and momentary switches are required - all listed in the instructables recipe, and printables files.The Nintendo-themed colouring has been achieved with about 1.5Kg of filament in Black, Wine Red, Light Grey and Dark Grey PLA, though PETG could also be used.
MILK-V's Jupiter Mini-ITX Board powered by RISC-VJuly 05, 2024Chinese startup Milk-V has announced the Jupiter, a Mini-ITX board powered by a RISC-V processor.RISC-V is an open source modular architecture - developers are able add or omit extensions based on their specific needs, and without incurring licensing fees. Milk-V chose the 8-core Spacemit K1 or M1 processor, which sports RVV1.0 vector extensions with a whole raft of instructions suitable for basic ML and AI uses - giving up to 2 TOPS of AI performance.The Jupiter will come with 4GB, 8GB or 16GB of soldered LPDDR4X memory, HDMI output, 2x 1Gbps RJ45 and WiFi 6, plenty of USB ports and a PCIe x8 slot supporting graphics cards and PCIe to SATA. Storage is well provided for with SPI Flash boot support, a M.2 PCIe Slot, eMMC connector and microSD card slot. Power is supported through a standard 24pin ATX connector or a 2.5/5.5mm 12V DC Power Jack, so pretty much any Mini-ITX enclosure will work.Jupiter specifications page
AMD’s Ryzen 8000G CPUs - the perfect choice for smaller Mini-ITX builds?January 17, 2024Las Vegas, Jan 8th 2024 - AMD announced their latest desktop processors, designed for boards with AM5 sockets.The processors of most appeal to Mini-ITX aficionados will be their 8000G range, which include powerful built-in graphics on the die. The previous leader in this category is AMD’s own 5700G, which has been around since 2021.Powerful socket processors with built-in graphics aren’t a new idea. Intel have included reasonable integrated graphics for years on most of their processors, and AMD’s more recent socket AM5 processors have all included integrated graphics. But the difference with AMD’s ‘G’ processors is the proportion of the die assigned to graphics is much greater than standard desktop socket processors.There are 3 processors of interest, plus another one you won’t be able to buy. The Ryzen 7 8700G is at the top of the heap with 8 Zen4 cores, 16 threads, 12 RDNA3 compute units and a Ryzen AI NPU. The Ryzen 5 8600G has 6 Zen4 cores, 12 threads, 8 RDNA3 compute units and the AI NPU. The Ryzen 3 8500G has 2 Zen4 cores and 4 efficient Zen4c cores, 12 threads and 4 RDNA3 compute units but no AI NPU. The Ryzen 3 8300G is a base level processor only available for OEM partners.A standard ATX PC enclosure almost always supports a graphics card, whereas in the world of Mini-ITX there are many categories of case that don’t need to support them, relying instead on integrated graphics from the SoC or processor. This gives a wider range of form factors and smaller chassis size, and often come with power consumption benefits.Delightful Mini-ITX enclosures supporting full-sized graphics cards clock in at around 10 litres in volume - but enclosures without GPU support can start at around 2.5 litres. With the new 8000G processors, the bar has been raised for how powerful these tiny machines can be. AMD say these processors will be available from Jan 31st 2024.AMD Press ReleaseAMD 8000G ProcessorsSocket AM5 Mini-ITX Boards
Intel Hands Over the NUC Reins to ASUSSeptember 06, 2023Intel has formally vacated its role in the development of its NUC (Next Unit of Compute) mini-PC series, redirecting its focus to its foundational semiconductor ventures. While Intel didn't pioneer the mini-PC—companies like Zotac had ventured into this space earlier—it did make significant contributions to popularising it. The task of continuing the NUC legacy has now been entrusted to ASUS, the electronics heavyweight from Taiwan.Beginning on the 1st of September, ASUS will integrate the NUC series into its existing product range, embarking on what the company envisions as a "new, exhilarating journey." Importantly, ASUS has secured the rights to manufacture and provide support for Intel's 10th to 13th generation NUCs, as well as to develop new models under the NUC brand.However, there's an intriguing twist: these rights are non-exclusive. This allows other tech vendors the opportunity to use the NUC name and IP, thus injecting an element of competition into the already vibrant mini-PC market.It's worth noting that while the term 'NUC' may be associated with Intel, the concept of a mini-PC is not exclusive to any single company. Indeed, even as ASUS takes over the NUC branding, other vendors can (and do) produce similar small form-factor PCs without using the NUC name.Intel's exit from the NUC segment is part of a broader strategic move to trim its portfolio, focusing on its primary revenue-generating operations. Shortly after announcing their exit, ASUS and Intel disclosed a term sheet outlining ASUS's role in producing and supporting Intel's 10th to 13th generation NUCs and crafting new NUC designs for the future.While the specific details surrounding the transition are still forthcoming, the inclusion of ASUS in the NUC narrative certainly adds a new layer of intrigue to the ever-evolving mini-PC market. As this chapter in the NUC story unfolds, the tech industry watches with great interest, wondering which other players might enter this increasingly dynamic field.Asus's NUC Overview page
NA500 Network Appliances now availableMay 24, 2023NA500 1U Short Depth 6x 2.5Gb LAN Server Appliances are now available from Mini-ITX.com as components or as fully built and tested systems with extended 3 year warranty.The NA500 is a low power consumption system powered by a powerful 10W TDP, 4 Core, 4 Thread 2.0GHz (2.6GHz Burst) Intel Celeron J6412 processor with 6x Intel i225V Gigabit LAN ports (expandable to 10 ports with 4 additional i211AT Gigabit LAN ports), up to 32GB memory, 2.5in and M.2 Type 2242 (NVMe/SATA) drive bays.The NA500 is compatible with a wide range of Linux and Windows operating systems, including pfSense, OPNSense, Ubuntu, CentOS, Debian, Fedora, and pretty much any other modern OS you can throw at it.NA500 1U Network Server Appliances at Mini-ITX.com
Expanded range of Dynatron Coolers now available from Mini-ITX.comFebruary 08, 2023We have expanded our range of Dynatron Coolers to 20, covering a wide selection of AMD and Intel desktop, workstation and server sockets.Sockets now covered include: AM4, AM5, sWRX8, TR4, SP3, 115X, 1200, 1700, 2011, 3647 and 4189.Dynatron make a variety of cooler sizes to fit 1U, 2U and 3U, including 1U compatible all-in-one liquid coolers.Dynatron at Mini-ITX.com
The Commodore 64x - modern Mini-ITX inside a retro enclosureJuly 07, 2022The Commodore C64 was an 8-bit home computer introduced in January 1982 by Commodore International. You can read the rest on Wikipedia. What you're really wondering is how can I build one today using a Mini-ITX motherboard and replica parts made from the original moulds created by Commodore USA back in 2011?The answer is UK-based My Retro Computer Ltd and (if it hasn't finished by the time you read this) their Kickstarter for the Commodore C64xIf you're not a fan of the traditional Satin Beige colour scheme, there will be options for White, Purple, Red, Yellow, Pink, Green, Blue and even Translucent.A barebones case is on offer for custom builds, together with a couple of pre-built versions. The 'Extreme' has a Celeron J6412 processor, whereas the 'Ultimate' has an i5 and GTX 1650. All within the constraints of the rather lovely C64 enclosure.But the nostalgia doesn't stop there. Plans are afoot for a 24in retro Commodore monitor, together with celebratory Mugs, Mice and T-Shirts.Commodore C64x Kickstarter
The Turing Pi V2 - now on KickstarterMay 16, 2022Turing Pi have announced further details of their second Mini-ITX sized Compute Module cluster board.Compute modules are effectively tiny low power consumption computers. A module has a processor and memory, often flash storage and sometimes Wi-Fi, and not much else. Compute Modules lack connectivity, so are generally mounted on a carrier or IO board to provide a route to the outside world.The Turing Pi V2 is a carrier board which connects and powers up to 4 Raspberry Pi CM4 or Nvidia Jetson compute modules together.The board becomes a cluster when multiple modules are fitted, with each compute module functioning as a node within that cluster.The clever stuff happens underneath.2x Gigabit LAN ports sit on the back panel, with an internal 7-port switch with VLAN support connecting all the modules together. A Baseboard Management Controller allows remote board diagnostics and cluster management. The BMC and its network run independently from the data plane.External storage is supported with 2 SATA 6Gbps interfaces. There are plenty of other interfaces to connect between the modules: HDMI, 2x Mini PCIe, 2x SATA, 4x USB 3.0, 3x 40-pin GPIO, Audio etc.With 4x Raspberry Pi CM4 pi4.8_x modules connected, a cluster would have 16 cores and 32GB of memory on tap.The Turing Pi V2 has a standard 24-pin ATX power connector and 17x17cm Mini-ITX form factor, meaning almost all Mini-ITX cases and power supplies can be used to house the cluster.Original announcement (Oct 2020)Recent announcement (August 2021) Kickstarter Page (May 2022)
AMD announce Ryzen 4000 "G " Series with Integrated GraphicsJuly 21, 2020AMD announced today their Ryzen 4000-series desktop processors with integrated graphics.These processors advance the designs of the already-released "Renoir" Ryzen 4000 mobile processors to 35W and 65W desktop power budgets.Ryzen "G" processors are of particular interest to Mini-ITX aficionados as they do not require a separate graphics card, and therefore can use a much smaller enclosure and power supply.The new CPUs include an 8 core 16 thread Ryzen 7 for the first time, whereas the previous generation only went to Ryzen 5.The range consists of the Ryzen 3 4300G, Ryzen 5 4600G and Ryzen 7 4700G. These are all 65W TDP desktop CPUs. OEMs will have more choice for their Mini PCs with the 35W TDP, slightly slower clocked variants: The Ryzen 3 4300GE, Ryzen 5 4600GE and (yep) the Ryzen 7 4700GE.CoresThreadsBaseBoostCacheGPU CoresTDPRyzen 7 4700G8163.6GHz4.4GHz12MB865WRyzen 7 4700GE8163.1GHz4.3GHz12MB835WRyzen 5 4600G6123.7GHz4.2GHz11MB765WRyzen 5 4600GE6123.3GHz4.2GHz11MB735WRyzen 3 4300G483.8GHz4.0GHz6MB665WRyzen 3 4300GE483.5GHz4.0GHz6MB635W"G" processors have been noticeably more powerful than their Intel equivalents recently and AMD's marketing materials suggest this trend continues, though they do rather sneakily compare against 9th generation Intel processors and not the latest 10th generation.A Ryzen 3 4300G looks to be broadly equivalent to an i3-9100 in single-threaded and an i5-9500 in multi-threaded operation. A Ryzen 5 4600G could b considered to be like an i5-9500 (single threaded) and i7-9700 (multi threaded). The Ryzen 7 4700G measures faster than the i7-9700 however many cores are tested.Graphic benchmarks are similarly impressive, with a Ryzen 7 4700G generating double or greater frame rates in popular games than an i7-9700. This is despite having fewer GPU cores than the previous generation Ryzen "G" - 6, 7 and 8 cores across the range instead of the previous 8 and 11. If you are in the market in a few weeks for the best integrated graphics possible in a Mini-ITX machine without a graphics card the Ryzen 7 4700G will be your CPU of choice - if you can get one. The downside is these processors are targetted at the OEM market, and will not be available very widely in retail.
ASRock built a Mini-ITX sized RX 570 with Thunderbolt 3June 11, 2019On display at Computex 2019 was a interesting Mini-ITX sized product (currently) in a brand new category of its own.The ASRock RX570TM-ITX/TBT comprises of a Mini-ITX sized motherboard with an RX570 GPU and various connectors on its IO panel.But this is not a Mini-ITX motherboard. There is no CPU socket. The key connector here is Thunderbolt 3.This board is designed primarily for manufacturers and integrators to build their own external Thunderbolt enclosure.Essentially - Thunderbolt from a laptop or PC goes in one end; graphics, storage and networking connectors come out of the other.ASRock displayed the unit in two formats.The first was a one-off Mini-ITX enclosure courtesy of Coolermaster, with a traditional IO shield on one side and power button on the other. This would fit between your monitor(s) and your laptop or PC.The second looked like an All In One PC with the board attached to the rear of a large Display. By connecting a laptop or PC through Thunderbolt you effectively get a monitor with built-in graphics acceleration and additional storage and connectivity.The unit is powered by an external AC Adapter, with Thunderbolt allowing power transfer back to keep a laptop charged up.The small size and Mini-ITX format has advantages. The RX 570 is a lower end GPU with relatively low (for a graphics card) power requirements at around 120W. It can be kept cool inside a relatively small space. If the unit makes it out into consumer territory as a standalone board - and there is no guarantee whatsoever that it will - it could be fitted into a standard Mini-ITX enclosure, perhaps next to another Mini-ITX enclosure housing the main PC.Provisional specificationsRadeon RX 570 with 4GB or 8GB GDDR5Thunderbolt 32x HDMI, VGA, LVDS19V DC-In4x USB 3.2 Gen1Gigabit EthernetSATA 6Gb/sSource: hermitage akihabara
| 2024-11-08T20:10:08 | null | train |
42,406 | Keios | 2007-08-14T20:41:24 | Potato powered webserver | http://d116.com/spud/ | 15 | 1 | [
42463
] | null | null | null | null | null | null | null | null | null | train |
|
42,408 | neilgd | 2007-08-14T20:44:28 | Facebook wars: social groups, symbols, jargon and tagging others | http://blog.businessofsoftware.org/2007/08/facebook-wars-s.html | 2 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,412 | Keios | 2007-08-14T20:49:59 | A better Random Number generator | Uses atmospheric noise. An API around this would be useful. | http://www.random.org/ | 3 | 0 | null | null | null | no_error | RANDOM.ORG - True Random Number Service | null | Mads Haahr | Advisory: We only operate services from the RANDOM.ORG domain. Other sites that claim to be operated by us are impostors. If in doubt, contact us.
What's this fuss about true randomness?
Perhaps you have wondered how predictable machines like
computers can generate randomness. In reality, most random numbers
used in computer programs are pseudo-random, which means they
are generated in a predictable fashion using a mathematical
formula. This is fine for many purposes, but it may not be random
in the way you expect if you're used to dice rolls and lottery drawings.
RANDOM.ORG offers true random numbers to anyone on
the Internet. The randomness comes from atmospheric noise, which
for many purposes is better than the pseudo-random number
algorithms typically used in computer programs. People use RANDOM.ORG for holding drawings, lotteries and sweepstakes, to drive online games, for scientific applications and for art and music.
The service has existed since 1998 and was built by Dr Mads Haahr of the School of Computer Science
and Statistics at Trinity College,
Dublin in Ireland. Today, RANDOM.ORG is operated by Randomness and Integrity Services Ltd.
| 2024-11-08T00:32:44 | en | train |
42,416 | ansemond | 2007-08-14T20:59:01 | Making Desktop App Upgrades as easy as Web 2.0 Apps | null | http://ansemond.com/blog/?p=88 | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,424 | dawie | 2007-08-14T21:13:04 | See Who's Editing Wikipedia - Diebold, the CIA, a Campaign | null | http://www.wired.com/politics/onlinerights/news/2007/08/wiki_tracker | 3 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,428 | dpapathanasiou | 2007-08-14T21:21:37 | Nasdaq's New Portal Market: IPO Alternative for Startups? | http://www.washingtonpost.com/wp-dyn/content/article/2007/08/13/AR2007081301170.html | 16 | 7 | [
42429,
42477,
42470,
42449
] | null | null | null | null | null | null | null | null | null | train |
|
42,431 | davidw | 2007-08-14T21:26:00 | The Trouble With Enterprise Software | http://evora.mit.edu/smr/issue/2007/fall/01/ | 4 | 5 | [
42439
] | null | null | null | null | null | null | null | null | null | train |
|
42,433 | aston | 2007-08-14T21:28:32 | Whoah, new comment sorting? | I noticed this on <a href="http://news.ycombinator.com/item?id=42317" rel="nofollow">http://news.ycombinator.com/item?id=42317</a>. It looks like top-level comments aren't being sorted outright by score. Porque no? | 3 | 3 | [
42441,
42476
] | null | null | invalid_url | null | null | null | null | 2024-11-08T16:37:59 | null | train |
|
42,440 | transburgh | 2007-08-14T21:45:52 | Hitwise Launches New Widget | null | http://www.webpronews.com/topnews/2007/08/14/hitwise-launches-new-widget | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,442 | transburgh | 2007-08-14T21:46:42 | Classmates.com hopes for an IPO boost (What?) | http://valleywag.com/tech/social-networks/classmatescom-hopes-for-an-ipo-boost-289470.php | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,444 | mk | 2007-08-14T21:50:04 | Scsh - The Scheme Shell | http://www.scsh.net/ | 3 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,445 | mk | 2007-08-14T21:51:17 | Teach Yourself Scheme in Fixnum Days | http://www.ccs.neu.edu/home/dorai/t-y-scheme/t-y-scheme.html | 5 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,448 | sbraford | 2007-08-14T21:53:44 | Anyone going to BarCamp this weekend? | 2 | 2 | [
42497,
42488
] | null | null | invalid_url | null | null | null | null | 2024-11-08T16:37:59 | null | train |
||
42,453 | byrneseyeview | 2007-08-14T22:03:20 | Looking for Liberty? Avoid adjectives. | From "A Plan for Spam": "As a rule of thumb, the more qualifiers there are before the name of a country, the more corrupt the rulers. A country called The Socialist People's Democratic Republic of X is probably the last place in the world you'd want to live." | http://socialscienceplusplus.blogspot.com/2007/08/its-all-in-name-kingdom-of-norway-vs.html | 5 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,454 | Tichy | 2007-08-14T22:07:51 | Find a co-founder at the weekend of code (8th/9th of September) | null | http://weekendofcode.ning.com/ | 6 | 3 | [
42455
] | null | null | http_404 | Error 404 Network - Ning.com | null | null |
Currently we are thoroughly watching over the situation in Ukraine and trying to support the brave and unstoppable spirit of Ukrainian nation in fight against Russian invasion by donating to the official resources provided by the Government. NING is standing with Ukraine in this fight for freedom and independence and if you want to show your support you can donate here. Слава Україні! Героям Слава!
| 2024-11-08T01:16:26 | null | train |
42,457 | dawie | 2007-08-14T22:19:53 | First Google Health Screenshots | http://blogoscoped.com/archive/2007-08-14-n43.html | 18 | 2 | [
42527,
42568
] | null | null | null | null | null | null | null | null | null | train |
|
42,460 | kkim | 2007-08-14T22:34:48 | A List Apart: Staying Motivated | null | http://www.alistapart.com/articles/stayingmotivated | 12 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,464 | kkim | 2007-08-14T22:37:42 | New Scientist: The Lure of the Conspiracy Theory | http://www.therazor.org/?p=855 | 2 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,465 | omouse | 2007-08-14T22:44:44 | Linux.com: Spreading Python applications | I submitted this a week ago to programming.reddit but I know not everyone is signed up on reddit. So here it is, a quick tour of distutils. | http://www.linux.com/feature/118439 | 2 | 3 | [
42513
] | null | null | null | null | null | null | null | null | null | train |
42,466 | amichail | 2007-08-14T22:48:30 | VisualIDs: Automatic Distinctive Icons for Desktop Interfaces [pdf] | http://www.idiom.com/~zilla/Work/VisualIDs/visualids.pdf | 2 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,467 | jcwentz | 2007-08-14T22:51:53 | From UNIVAC to Google: A Computer in Every Kitchen? | null | http://reason.com/news/show/120942.html | 2 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,471 | comatose_kid | 2007-08-14T23:03:38 | How to negotiate with the corporate elephant | http://business.timesonline.co.uk/tol/business/enterprise/article606996.ece | 2 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,480 | thinkingserious | 2007-08-14T23:30:37 | RUP Based Project Process | The Rational Unified Process (RUP) is a good methodology to keep your projects in order. This process model is an overview of the steps that should be used when creating a project. It is meant to be a step by step template. | http://blog.thembid.com/index.php/2007/08/14/rup-based-project-process/ | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,495 | omouse | 2007-08-15T00:10:20 | Beautiful Code: That Pesky Binary Search | http://blog.codekills.net/archives/20-Beautiful-Code-That-Pesky-Binary-Search.html | 5 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,496 | omouse | 2007-08-15T00:11:22 | Optimal Movie Seating Puzzle | http://blog.codekills.net/archives/14-Optimal-Movie-Seating-Puzzle.html | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,499 | ivankirigin | 2007-08-15T00:19:13 | DIY Drones: Chris Anderson's Ning Social Network for building UAVs | null | http://diydrones.com/ | 6 | 0 | null | null | null | no_error | diydrones | null | Posted by Assembly Dronenthusiast on November 2, 2024 at 12:54am |
Welcome to the largest community for amateur Unmanned Aerial Vehicles!
This community is the birthplace of ArduPilot, the world's first universal autopilot platform (planes, multicopters of all sorts and ground rovers). Today the Pixhawk autopilot runs a variety of powerful free and open UAV software systems, including:
PX4, a pro-quality open source copter, plane, rover and VTOL software stack from the Linux Foundation's Dronecode Project
ArduCopter, open source multicopter and heli UAV software
ArduPlane, open source software for planes of all types
ArduRover, open source software for ground-based vehicles
It is crucial to take pre-flight and APP inspection before using an agri drone. Check these key tips and make sure each flight is safe and stable!
Read more…
The application of smart agricultural drones for spraying and spreading has boosted farming efficiency,which vividly shows that modern agricultural technology is revolutionizing the way of agricultural protection in Colombia.
Compared to traditional pest control methods, drone spraying significantly enhances efficiency and precision. The Z50P agricultural drone, equipped with a large payload tank, can easily spray orange orchards with a high flow rate. The fine atomizing tech enables the fluid to cover each leaf of the trees, achieving precise and even spraying while reducing pesticide waste. Moreover, this application is beneficial to the environment and promotes green and sustainable agriculture.
Besides, the drone plays more crucial roles than that.According to the pilot team in the video, a Z50P can spray over 100 hectares per day. This high efficiency enables an easier way for farming management and even increases incomes by serving other farms.…
Read more…
Hi there,
Agri drone spraying not only reduces the usage of pesticide, but also protects the crops from trampling by big machines.
For example, the vast field farming in Romania usually employs heavy agri machines to carry out land preparation, sowing and harvest.
And the introduction of agri drones drives precision agriculture to a new level. Equipped with advanced aerial spraying technology, it delivers precise, measured applications, protecting the soil and promoting sustainable crop growth.It ensures that the fertilizer is absorbed precisely by leaves and safeguards healthier growth.
Tap the pics and see Z50P working in maize field.…
Read more…
This video describes shortly the hardware and software aspects of my self-made tracking drone. The major parts are: a holybro frame, a pixhaxk 6c flight controller, a raspberry pi 4, a oak-d camera and 8 sensors (gps, lidar, compass, ...). The tracking relies on a fine-tuned YOLOv8 object detector and a custom python tracking code. The yaw and the pitch of the drone are derived form the height and center of the detected object. A simple obstacle detection…
Read more…
As we know, Turkey is one of important international grain exporter. To enhance agricultural productivity and promote green farming, it is actively adopting agricultural drone technology and supporting local production. EFT, as a global drone solution provider, develop with local Turkish drone companies, offering comprehensive agri drone solutions and component support to advance agricultural drone technology and promotes the drone applications for local fields.
Read more…
PX4 has its own unique advantages; it is preferred and liked by the majority of users. The TF series is a highly cost-effective LiDAR launched by Benewake, which is sought after by the majority of drone users. This tutorial introduces the connection method of TF series PixHawk and configuring over the PX4 firmware. The same procedure can be followed for other flight controllers as long as the right physical port is used. This document is based on QGroundControl v4.0.6 and firmware PX4 v1.11.0. If the ground station or firmware is not fully functional, please upgrade。
1 Hardware Connection
This article uses Pixhawk as an example to illustrate the connection, as shown below：
Please install the TF Series LiDAR on the multi-rotor, vertically downwards, and ensure that there are no obstacles in front of the lens. Then…
Read more…
Loading ...
massimino casadei posted a discussion in ArduCopter Italian Group
salve a tutti , di recente ho avuto un poroblema col mission planner,quando mi collego tramite la telemetrria, 10 secondi dopo il link e dopo aver scaricato i dati l HUD del planner e i dati di volo si frizzano, probabilmente è un problema del…
Assembly Dronenthusiast posted a blog post
It is crucial to take pre-flight and APP inspection before using an agri drone. Check these key tips and make sure each flight is safe and stable!
Assembly Dronenthusiast posted a blog post
The application of smart agricultural drones for spraying and spreading has boosted farming efficiency,which vividly shows that modern agricultural technology is revolutionizing the way of agricultural protection in Colombia.Compared to traditional…
Assembly Dronenthusiast posted a blog post
Hi there,Agri drone spraying not only reduces the usage of pesticide, but also protects the crops from trampling by big machines.For example, the vast field farming in Romania usually employs heavy agri machines to carry out land preparation, sowing…
colin is now a member of diydrones
More…
Loading ...
"Because $10,000 $5,000 $1,000 is too much to pay for an autopilot, especially one that doesn't do exactly what you want."An Unmanned Aerial Vehicle (UAV, colloquially known as a "drone") is basically an aerial robot. As we define it, it is capable of both remotely controlled flight (like a regular RC aircraft) and fully-autonomous flight, controlled by sensors, GPS, and onboard computers performing the functions of an autopilot. Our UAVs include airplanes, helicopters, quadcopters and blimps. Most of them are under five pounds, and some of them (especially the blimps) can be used indoors.We are focused on non-commercial ("recreational") projects by amateurs, although pros are always welcome too. Reasons to make your own UAV range from a fun technical challenge, student contests, aerial photography and mapping (what we call "GeoCrawling"), and scientific sensing. We are primarily interested in civilian, not military, UAV uses here.If you're new to all this, start here.DIY Drones is a community based on the Ning social networking platform, and anybody who registers (it's free and easy) can post their own blog entries like this one on the front page, along with starting discussions in the sidebar at left or uploading videos below that. Your registration gives you the ability to do a lot on the site--so feel free to post anything you think will be of interest to this community!There are other amateur sites out there, from the discussion forums of RC Groups to individual blogs, but DIY Drones is explicitly built as a social network, which means that the community is as important as the content. We're also focused on the most accessible end of the amateur UAV world, with the aim of potentially including high school students.This means we emphasize amateur UAV projects that are:
Simple: The aim of this project is to create new amateur UAV platforms, including those that could be used for a FIRST-like contest appropriate for students. While we're at it, we'll make amateur UAV development easier for everyone.
Cheap: The target cost of all of our platforms is less than $1,000. You can buy a very good autopilot system for $10,000, but that's not our approach. Cheaper is better, especially with students and schools.
Safe: We follow the current interpretation of the FAA guidelines on small UAVs. Recreational use (non-commercial), under 400 ft altitude, line of sight, "pilot in the loop" and onboard safety systems that always allow for manual control in the case of malfunction. We're building experimental platforms that demonstrate autonomy and the capacity to do real useful UAV work, but we test them in controlled settings. If you want to fly miles out of sight or map cities, we're going to assume you've got the proper FAA clearance or we don't want to know about it.
Participatory: Share and others will share with you. That means that whenever possible, we open source our code and post it online. Everything on this site is published under a Creative Commons "attribution" license, which means that anyone can use or repost it, as long as they give credit to the original author.
Civil: This is a community site of peers helping each other. Bad behavior, from rudeness to foul language, will be deleted. Generosity and kindness is often rewarded with reciprocal behavior and help.
Here are the full set of Site Policies:
Civility is paramount. Treat others with respect, kindness and generosity. Some of our most expert members are people who were once total n00bz but were helped and encouraged by others, and are now repaying the favor with the next generation. Remember the Golden Rule. Don't be a jerk to anyone, be they other members, moderators or the owners. This is not a public park, and you have no constitutionally-mandated right to free speech. If you're creating a hostile or unpleasant environment, you'll be warned, then if it continues you'll be suspended.
No discussion of politics or religion. This is not the place to discuss your views on the wisdom of military use of UAVs, any nation's foreign policy, your feelings about war, or anything else that is inclined to turn into a political debate. It is our experience that the rules for good dinner party conversation--no discussion of politics and religion--apply to online communities, too. DIY Drones aims to bring people together, and we find that discussions of politics and religion tend to polarize and drive people apart. There are plenty of other places to discuss those topics online, just not here.
Ask questions in the discussion forum; inform others in blog posts. Submitted blog posts that are just questions and should have been posted in the discussion forum will not be approved. The moderators may or may not message you with the text so you can repost in the right area. To avoid losing your post, put it in the right place from the start.
Blog posts are for informative topics of broad interest to the community. They must start with a picture or video, so the image appears on the front page on the site and gives a sense of the topic as well as inviting people to click in for more. Videos should be embedded (paste the embed code in the HTML tab, not the Rich Text tab). The post should also include links where appropriate. Don't make people do a Google search for what you're talking about if you can provide a link.
The Discussion Forum is for questions and tech support. We prefer to do all tech support in public, so that others can follow along. If you have a problem, please describe your particular system setup completely, ideally with a photograph, and pick the right forum tags so that others can find the thread later.
No discussion of military or weaponized applications of UAVs. This site is just about amateur and civilian use.
No discussion of illegal or harmful use of UAVs will be tolerated. Responsible use of UAVs is at the core of our mission. That means conforming with all laws in the United States, where this site is based, and insisting that our members elsewhere follow the laws of their own countries. In addition, we feel that part of our responsibility it to help the relevant authorities understand what's possible with amateur UAVs, so they can make better-informed policies and laws. So we have encouraged all relevant regulators, defense agencies and law enforcement agencies to become members here and even participate to help them do that, and many have. In addition, if we see any discussion of UAV use that we feel is potentially illegal or intended to do harm, we will bring it to the attention to the relevant authorities, and will comply with any legal request they make for information about users (although we don't know much that isn't public; see the next item).
Promote safe flying. Moderators may delete postings that they decide are unsafe or promote unsafe activity. This is a judgement call, since it is also healthy to have public discussion about why certain activities are unsafe, but the decision as to whether to leave a post or edit/delete it is at the moderators' discretion.
Your privacy is protected, up to a point: This is a social network, so everything you write and post here is public, with certain exceptions: 1) Your private messages are private. Administrators are unable to see them, nor can anyone else other than the recipient. Members must not make private messages public without the explicit permission of everyone involved. 2) Your IP address is private. We are hosted on Ning, which controls the server logs. DIY Drones administrators can only see your username and email address; they cannot see your password and do not have access to your account.
Do not publish personal emails or PMs without permission. This is a violation of expected confidentiality (that's why they're called "personal messages") and is grounds for banning.
Do not type in ALL CAPS. It's considered SHOUTING. Posts in all caps will be deleted by the moderators.
Absolutely no personal attacks. It's fine to disagree, but never okay to criticize another member personally.
Share. Although we are not limited to open source projects, the ones that tend to get the most participation tend to be open source. Don't wait until your code or design is "finished"--post it as it is, and you may find that others will help you finish it faster. The best way to contribute is with your creativity--we love data, code, aircraft designs, photos of UAV projects, videos of flights and build logs. Post early and often!
Keep comments open: Authors of blog posts and discussion threads technically have the option to close their comments or approve them before they appear, but we ask members not to do that. We want to encourage a free flow of conversation and blocking or delaying comments only interferes with that. The Moderators are standing by to ensure the conversation remains on-topic and civil, so please leave your comments open and let them do their job.
Trouble Shooting F90 Long Range Motor
After a crash, I have noticed that my fourth motor (F90 LRM) is not working, others three work fine. Initially, I thought it was because the wiring from the ESC (f55A pro) to flight controller (Tmotor f7) was loose, so I redid the wiring and plugged…
Read more…
Hobbies?
Hello everyone! Recently caught myself thinking that time is merciless, it's consumed by tasks, work, family. And I have no hobbies left. Absolutely none, except PC and mobile games, Aviator of smth like from this. Can you suggest what you do in…
Read more…
| 2024-11-08T17:41:02 | en | train |
42,504 | transburgh | 2007-08-15T00:34:07 | 'All things are founder-like things' | null | http://www.foundread.com/view/all-things-are | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,507 | donna | 2007-08-15T00:46:38 | What's the Future of Work? | http://blogs.bnet.com/intercom/?p=687&tag=nl.e713 | 2 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,508 | NoMoreSnow | 2007-08-15T00:50:40 | Can software start-ups succeed with non-programmer founder(s)? | Can non-programmers have success at raising money for a software start-up?<p>Also, do you know of any success stories(received more than angel funding) where the founder(s) were not programmers?<p>Thanks,
NoMoreSnow | 11 | 17 | [
42550,
42560,
42536,
42648,
42553,
42548
] | null | null | invalid_url | null | null | null | null | 2024-11-08T16:37:59 | null | train |
|
42,509 | mcxx | 2007-08-15T00:56:12 | Discussion about the new voting system | PG, what exactly is "a louder voice"? If an article will be raised up by two or more points by a person with bigger voting power will its submitter get an adequate karma raise? Is there a limit? Is there a bonus for the up-voter? Do you take into consideration current karma? Does voting power apply to down voting (I assume it does)?<p>I think there will be a temporary higher amount of voters on the New queue, seeking for a bigger voting power, which is a good thing because the good stories will get to the main site faster. Maybe it won't be temporary as newcommers will strive for power and the easiest/only way is voting the good stories soon.<p>However, consider this situation: A speculator comes around, voting up at random (thinking "someone will have to raise this one up") and then another one appers, seeing that a story already has 2,3 or 4 points, he could raise it up to just because it will earn him a better voting power... Will the system be able to deal with this (altough I'm not really sure this is a real threat)?
| 6 | 4 | [
42622,
42880,
42605
] | null | null | invalid_url | null | null | null | null | 2024-11-08T16:37:59 | null | train |
|
42,514 | thinkingserious | 2007-08-15T01:19:33 | Notifir To Launch Digg Tracker | Notifir is an upcoming service that lets you track and manage some of your social bookmarking accounts from one central location. The site is launching its private beta tomorrow, and we got a sneak peek at the site. | http://mashable.com/2007/08/14/notifir/ | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,523 | michael_nielsen | 2007-08-15T01:51:19 | Open source Google | http://michaelnielsen.org/blog/?p=256 | 4 | 0 | null | null | null | no_error | Open source Google – Michael Nielsen | null | null |
Why can’t we ask arbitrarily complex questions of the whole web?
Consider the questions we can ask the web. Type a name into Google and you see, very roughly, the top sites mentioning that name, and how often it is mentioned on the web. At a more sophisticated level, Google makes available a limited API (see here, here, and here) that lets you send simple queries to their back-end database.
Compare that to what someone working internally for Google can do. They can ask arbitrarily complex questions of the web as a whole, using powerful database query techniques. They can even apply algorithms that leverage all the information available on the web, incorporating ideas from fields like machine learning to extract valuable information. This ability to query the web as a whole, together with Google’s massive computer cluster, enables not only Google search, but also many of the dozens of other applications offered by Google. To do all this, Google constructs a local mirror of the web, which they then enhance by indexing and structuring it to make complex queries of the web possible.
What I want is for all developers to have full access to such a mirror, enabling anyone to query the web as a whole. Such a mirror would be an amazing development platform, leading to many entirely new types of applications and services. If developed correctly it would, in my opinion, eventually become a public good on a par with the electricity grid.
A related idea was announced last week by Wikipedia’s Jimbo Wales: the Search Wikia search engine is making available an open source web crawler which can be improved by the community at large. This great idea is, however, just the tip of a much larger iceberg. Sure, an open source search tool might improve the quality and transparency of search, and provide some serious competition to Google. But search is just a single application, no matter how important; it would be far more valuable to open up the entire underlying platform and computing infrastructure to developers. I predict that if Search Wikia is successful, then the developers contibuting to it will inevitably drive it away from being a search application, and towards being a development platform.
I believe such a platform can be developed as an open source project, albeit a most unconventional one. So far as I am aware, no-one has ever attempted to develop an open source massively distributed computing platform. Many of the required ideas can of course be found in massively distributed applications such as SETI@Home, Folding@Home, and Bram Cohen’s BitTorrent. However, this project has many very challenging additional problems, such as privacy (who gets to see what data?) and resource allocation (how much time does any party get on the platform?)
Once these problems are overcome, such an open source platform will enable us to query not only the web as a whole, but also what John Battelle has called the “database of human intentions†– all the actions ever taken by any user of the platform. Indeed, Google’s most powerful applications increasingly integrate their mirror of the web with their proprietary database of human intentions. It’d be terrific if these two databases – the web as a whole, and the database of human intentions – were available to and fully queryable by humanity at large.
Post navigation
| 2024-11-08T08:48:16 | en | train |
|
42,524 | rasel4all | 2007-08-15T01:58:55 | Enveluv.com | http://www.enveluv.com/blog | 1 | 2 | [
42525
] | null | null | fetch failed | null | null | null | null | 2024-11-07T15:10:27 | null | train |
|
42,528 | transburgh | 2007-08-15T02:14:45 | Lessons from the 'One-Man Conglomerate' | null | http://www.foundread.com/view/the-one-man | 2 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,534 | transburgh | 2007-08-15T03:21:18 | My Idea Map | null | http://www.foundread.com/view/my-idea-map | 3 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,537 | jamongkad | 2007-08-15T03:29:33 | Zed Shaw: Kitchen Sink | http://www.zedshaw.com/essays/kitchensink.html | 5 | 3 | [
43398,
42538,
42625
] | null | null | null | null | null | null | null | null | null | train |
|
42,540 | dood | 2007-08-15T03:33:24 | Does your project need a Cool Cam? | http://worsethanfailure.com/Articles/The-Cool-Cam.aspx | 31 | 8 | [
42611,
42606,
42651
] | null | null | null | null | null | null | null | null | null | train |
|
42,551 | zemaj | 2007-08-15T04:09:32 | Request: simple story promotion algorithm | Hi all,<p>I recently added a karma-like voting system to posts in a phpBB forum that was having some problems with spam (we have an point incentive system that users use to bid for real items - now instead of rewarding points for posts, they're now awarded for votes).<p>My question is; does anyone know a simple algorithm that can get a list of the "best-recent" posts based on votes. So simply if an item has a certain number of positive and negative points with each vote point made at a certain time, how can I combine that to get a list of highly voted, recent posts.<p>I could obviously research and come up with something myself, but there's probably quite a few people here who have experience in this area, so I thought it was worth a post!<p>Thanks,
James | 4 | 10 | [
42557,
42589,
42635
] | null | null | invalid_url | null | null | null | null | 2024-11-08T16:37:59 | null | train |
|
42,554 | stympy | 2007-08-15T04:18:53 | 5 Tips to Speed Up Your Rails App | http://www.bencurtis.com/archives/2007/08/5-tips-to-speed-up-your-rails-app/ | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,556 | ivankirigin | 2007-08-15T04:22:27 | Linden Lab's CFO explains how the economy works in the virtual community. | null | http://www.technologyreview.com/Biztech/19242/ | 7 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,559 | dfranke | 2007-08-15T04:33:42 | Hacking and Refactoring | http://www.catb.org/~esr/writings/hacking-and-refactoring.html | 2 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,567 | nickb | 2007-08-15T05:23:40 | What does your favorite text editor say about you? | http://www.terminally-incoherent.com/blog/2007/08/14/what-does-your-favorite-text-editor-say-about-you/ | 4 | 2 | [
42572,
42628
] | null | null | null | null | null | null | null | null | null | train |
|
42,569 | nickb | 2007-08-15T05:25:38 | jQuery for JavaScript programmers | http://simonwillison.net/2007/Aug/15/jquery/ | 5 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,570 | nickb | 2007-08-15T05:27:58 | Introducing the YUI Compressor - new JavaScript minifer/compressor | http://www.julienlecomte.net/blog/2007/08/13/introducing-the-yui-compressor/ | 3 | 1 | [
42613
] | null | null | null | null | null | null | null | null | null | train |
|
42,571 | nickb | 2007-08-15T05:31:24 | The #1 reason excuse for programmers legitimately slacking off (not if you use Lisp ;) | http://xkcd.com/303/ | 17 | 3 | [
42677,
42896,
42641
] | null | null | null | null | null | null | null | null | null | train |
|
42,573 | nickb | 2007-08-15T05:32:24 | Black Hat USA 2007 Round-Up Part 2 | http://taosecurity.blogspot.com/2007/08/black-hat-usa-2007-round-up-part-2.html | 1 | 0 | null | null | null | no_error | Black Hat USA 2007 Round-Up Part 2 | 2007-08-05T14:03:00-04:00 | Richard Bejtlich |
Black Hat USA 2007 Round-Up Part 2
I'm waiting in another airport, so it's time to summarize my second day at Black Hat USA 2007. (The first day is Black Hat USA 2007 Round-Up Part 1.)I started the day in Bruce Schneier's keynote. Bruce's talk was interesting but plauged by audio problems (not his fault). Bruce reiterated his ideas of the "security consumer" who asks "is it worth it?" when deciding whether or not to wear a bullet-proof vest when walking out his front door. Bruce seems to have changed his mind about the evils of "security theater," because he said "security is a feeling and a reality," and sometimes security theater is needed to right imbalances between the feeling and the reality. This imbalance can come about when citizens watch television, which impairs their availability heuristic by making rare and catastrophic events seem common and personal. Bruce focused on psychology, stating people, on average, are risk-seeking when facing losses but risk-adverse when facing gains. In other words, they are more likely to take a chance to avoid a loss than they are to take a chance to acquire a greater gain. Bruce published a paper describing his views at The Psychology of Security. Pay attention to the five aspects of the security trade-off.Jim Hoaglund from Symantec presented my first technical talk of the day. He described the new Windows Vista TCP/IP stack and emphasized the role of tunnels for IPv6. It's probably best just to read the papers behind the talk, namely Windows Vista Network Attack Surface Analysis (.pdf), The Teredo Protocol: Tunneling Past Network Security and Other Security Implications (.pdf), draft-ietf-v6ops-teredo-security-concerns , Microsoft's Objectives for IPv6, and Jim's blog post. Jim said "stacks are complex entities that take years to mature." Jim discussed stack vulnerabilities found in beta versions of Vista. I was very interested in hearing about the new fragmentation reassembly standard used in Vista, which differs from previous versions. (Hello trouble for IDS/IPS/etc, good news for stack fingerprinters.)Jim spent a lot of time talking about Teredo, documented in RFC 4380. Teredo is designed as an IPv6 transition mechanism "of last resort." I've documented my tests with Miredo, a Unix implementation. What struck me about Jim's comments were his revelation that Teredo was designed without visibility or control. This directly contradicts my idea of Security Application Instrumentation. Essentially, unless an inspection product analyzes every UDP packet, it is not possible to control Teredo. It is possible to "starve" Teredo traffic by blocking outbound to Teredo servers on UDP port 3544, but that is not a complete solution. Also, Jim claimed that in some cases Teredo "may be preferred even over native IPv4." He recommended that Teredo not be deployed on "managed networks," which is just about anywhere that matters.Nick Harbour of MANDIANT discussed basic, intermediate, and advanced ways to hide malware. He talked about hook injection to hide malware in existing processes, library injection (the most common attack) via CreateProcessThread() to hide in libraries, and direct injection, where code is inserted directly into processes. He mentioned registry tricks like Image File Execution Options to launch malware as a "debugger" that calls a legitimate process. Nick said he would release Malvm and his Executable Toolkit on nickharbour.com soon. I watched almost all of Gadi Evron's talk about the Estonia "information war," but I felt like he took over an hour when probably 20 minutes would have sufficed.One of the best talks on the second day was delivered by Tom Ptacek and Eric Monti who described vulnerabilities and exposures in extrusion detection and related products. Because they could not name the products they had tested, they profiled a "fake" product called PlugBoy. Basically, these products are nearly worthless, except for the value they deliver in demonstrations to executives and the launch pad they provide for intruders. They focused on host-based systems instead of those that sit inline or offline.Tom and Eric said "evasion is a given." For example, you can trivially bypass their filters using any number of techniques at layers 3, 4, or higher. It could take as simple a technique as changed text in a word document to bold or adding a space between every character of the document. The problem with these products is that they need to do some sort of file format decoding in order to have a prayer of making sense of a document's contents. Unfortunately, by introducing file format dissection decoding, they are incredibly vulnerable (think of Wireshark's security history with protocol dissectors and recent file format fuzzing exploits.)Here's another problem with extrusion products on the host: they tend to communicate what they find in the clear to their management platforms. (Zlib compression doesn't count as "encryption.") So, think of this: you have a product sitting between a remote SSL-enabled site, inspecting and grabbing sensitive content, then retransmitting a subset of that content in the clear to the management server. Who designed this train wreck? Furthermore, these products tend to have application, service, and kernel components. This means you have a piece of code that by design has access to everything you consider sensitive sitting in the kernel. Tom and Eric said this code is rife with vulnerabilities. They described how sending a malformed AIM packet would root the agent and therefore the kernel and therefore the box. Returning to agent to manager communications, this channel is unauthenticated. This means anyone could spoof traffic or send traffic to the management console. That content tends to be rendered in a Web application viewable by the administrator. Now you can send traffic to the management console (think XSS or other file rendering attacks) and own it. In case you didn't put all these steps together, here they are: 1) Web browser with ED agent visits malicious Web site; 2) Web site attacks and owns ED agent; 3) Owned ED agent attacks ED manager; 4) Owned ED managed attacks and owns all ED agents on all hosts; Game Over.In brief, the host-based ED products Eric and Tom reviewed are "latent botnets" in addition to all their potential violations of PCI and other regulations protecting data.I managed to briefly talk with Tom and Eric prior to their presentation, which was cool. They reminded me I need to try their tools, like Black Bag, which is "Netcat on steroids."I finished the day watching my friends Keith Jones and Rohyt Belani present three case studies on insider attacks. Keith talked about the Duronio case. Rohyt described a wireless exploit at a retail company and a law firm document management system abused by an administrator.I had the following thoughts after watching these talks.We cannot eliminate the probability of compromise of the general Internet population. This is another way to say "prevention eventually fails." We can reduce the probability of compromise by applying costing countermeasures or drastically limiting exposure. You could think of this situation as the difference in the lives between the President and his Secret Service vs Joe Sixpack. The President can try to venture outside if protected by agents, but Joe is a sitting duck. His best bet is to stay home if he feels threatened. This deserves more thought, so I will probably address it later. A digital equivalent is hiring a team to build your own special Web browser or using a text-based Web browser and living a more monastic life.Modern countermeasures applied to reduce vulnerability and/or exposure in many cases increase both vulnerability and exposure. This is certainly the case with so many agents (see Matasano is Right About Agents.) Developers continue to ignore history by reintroducing old vulnerabilities and exposures. Tom and Eric talked about how so many products ship old vulnerable versions of Gzip libraries, as one example.As assets are increasingly managed, it becomes easier for intruders to exploit vulnerabilities in them and assume management of those assets. Eric and Tom noted that monolithic agents are being placed on assets of all types for purposes of managing them (if operating system homogeneity weren't enough of a problem). These agents are not coded to the standards found in the OS (props to Microsoft for getting its act together in recent years). The problem with these agents is that they open a brittle window for takeover by malicious parties.Firewalls are channel restriction products, not compromise prevention products. As the number of channels proliferates, the firewall is increasingly irrelevant. Inspection products (which include detection and filtering devices) are caught in a quandry. Application-unaware (think content matching alone, maybe via regex) inspection and filtering systems are less able to understand content and counter attacks. Application and protocol awareness would seem to be the answer, but those dissectors are directly targted by intruders and are heavily vulnerable to protocol and file format attacks. (Previously the content inspectors were mainly vulnerable if their content-matching system [think regex library] had a flaw.) No one wins.I'm really rushed here so I may revisit this post to fix a few thoughts. I will post my overall defensive recommendations in a future post.
Popular posts from this blog
Zeek in Action Videos
This is a quick note to point blog readers to my Zeek in Action YouTube video series for the Zeek network security monitoring project . Each video addresses a topic that I think might be of interest to people trying to understand their network using Zeek and adjacent tools and approaches, like Suricata, Wireshark, and so on. I am especially pleased with Video 6 on monitoring wireless networks . It took me several weeks to research material for this video. I had to buy new hardware and experiment with a Linux distro that I had not used before -- Parrot . Please like and subscribe, and let me know if there is a topic you think might make a good video.
MITRE ATT&CK Tactics Are Not Tactics
Just what are "tactics"? Introduction MITRE ATT&CK is a great resource, but something about it has bothered me since I first heard about it several years ago. It's a minor point, but I wanted to document it in case it confuses anyone else. The MITRE ATT&CK Design and Philosophy document from March 2020 says the following: At a high-level, ATT&CK is a behavioral model that consists of the following core components: • Tactics, denoting short-term, tactical adversary goals during an attack; • Techniques, describing the means by which adversaries achieve tactical goals; • Sub-techniques, describing more specific means by which adversaries achieve tactical goals at a lower level than techniques; and • Documented adversary usage of techniques, their procedures, and other metadata. My concern is with MITRE's definition of "tactics" as "short-term, tactical adversary goals during an attack," which is oddly recursive. The key word in the tacti
New Book! The Best of TaoSecurity Blog, Volume 4
I've completed the TaoSecurity Blog book series . The new book is The Best of TaoSecurity Blog, Volume 4: Beyond the Blog with Articles, Testimony, and Scholarship . It's available now for Kindle , and I'm working on the print edition. I'm running a 50% off promo on Volumes 1-3 on Kindle through midnight 20 April. Take advantage before the prices go back up. I described the new title thus: Go beyond TaoSecurity Blog with this new volume from author Richard Bejtlich. In the first three volumes of the series, Mr. Bejtlich selected and republished the very best entries from 18 years of writing and over 18 million blog views, along with commentaries and additional material. In this title, Mr. Bejtlich collects material that has not been published elsewhere, including articles that are no longer available or are stored in assorted digital or physical archives. Volume 4 offers early white papers that Mr. Bejtlich wrote as a network defender, either for technical or pol
| 2024-11-08T11:52:55 | en | train |
|
42,574 | nickb | 2007-08-15T05:36:44 | Coding Horror: Measuring Font Legibility | http://www.codinghorror.com/blog/archives/000930.html | 2 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,575 | nickb | 2007-08-15T05:38:04 | Beautiful Code: The Forgotten Pattern | http://beautifulcode.oreillynet.com/2007/08/the_forgotten_pattern.php | 5 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,576 | nickb | 2007-08-15T05:38:27 | The open-source community's double standard on MySQL | http://blogs.cnet.com/8301-13505_1-9758671-16.html | 3 | 0 | null | null | null | fetch failed | null | null | null | null | 2024-11-08T08:17:44 | null | train |
|
42,577 | dawie | 2007-08-15T05:39:15 | Cool Workspaces | null | http://tutorialblog.org/cool-workspaces/ | 2 | 1 | [
42580
] | null | null | no_article | null | null | null | null | 2024-11-08T13:09:02 | null | train |
42,581 | zach | 2007-08-15T05:50:44 | This patent application seems coherent. Then, a dedication to 50 Cent. Then... | Scroll down to see the description. | http://www.freepatentsonline.com/20070156594.html | 3 | 2 | [
42636,
42583
] | null | null | body_too_long | null | null | null | null | 2024-11-08T02:49:37 | null | train |
42,585 | mk | 2007-08-15T06:33:25 | JavaScript:The World's Most Misunderstood Programming Language | http://javascript.crockford.com/javascript.html | 13 | 3 | [
42612,
42634,
42831
] | null | null | null | null | null | null | null | null | null | train |
|
42,587 | mk | 2007-08-15T06:43:20 | Norvig: How to write a spelling corrector | Peter Norvig does a very good job of writing a spelling corrector similar to the way google's works (although much simpler). This is done step by step in python. | http://norvig.com/spell-correct.html | 63 | 7 | [
42675,
42904,
42686,
42797,
42650
] | null | null | no_error | How to Write a Spelling Corrector | null | null |
Feb 2007to August 2016
One week in 2007, two friends (Dean and Bill) independently told me
they were amazed at Google's spelling correction. Type in a search like [speling] and Google
instantly comes back with Showing results for:
spelling.
I thought Dean and Bill, being highly
accomplished engineers and mathematicians, would have good intuitions
about how this process works. But they didn't, and come to think of it, why should they
know about something so far outisde their specialty?
I figured they, and others, could benefit from an explanation. The
full details of an industrial-strength spell corrector are quite complex (you
can read a little about it here or here).
But I figured that in the course of a transcontinental plane ride I could write and explain a toy
spelling corrector that achieves 80 or 90% accuracy at a processing
speed of at least 10 words per second in about half a page of code.
And here it is (or see spell.py):
import re
from collections import Counter
def words(text): return re.findall(r'\w+', text.lower())
WORDS = Counter(words(open('big.txt').read()))
def P(word, N=sum(WORDS.values())):
"Probability of `word`."
return WORDS[word] / N
def correction(word):
"Most probable spelling correction for word."
return max(candidates(word), key=P)
def candidates(word):
"Generate possible spelling corrections for word."
return (known([word]) or known(edits1(word)) or known(edits2(word)) or [word])
def known(words):
"The subset of `words` that appear in the dictionary of WORDS."
return set(w for w in words if w in WORDS)
def edits1(word):
"All edits that are one edit away from `word`."
letters = 'abcdefghijklmnopqrstuvwxyz'
splits = [(word[:i], word[i:]) for i in range(len(word) + 1)]
deletes = [L + R[1:] for L, R in splits if R]
transposes = [L + R[1] + R[0] + R[2:] for L, R in splits if len(R)>1]
replaces = [L + c + R[1:] for L, R in splits if R for c in letters]
inserts = [L + c + R for L, R in splits for c in letters]
return set(deletes + transposes + replaces + inserts)
def edits2(word):
"All edits that are two edits away from `word`."
return (e2 for e1 in edits1(word) for e2 in edits1(e1))
The function correction(word) returns
a likely spelling correction:
>>> correction('speling')
'spelling'
>>> correction('korrectud')
'corrected'
How It Works: Some Probability Theory
The call correction(w)
tries to choose the most likely spelling correction for w. There is no way to
know for sure (for example, should "lates" be corrected to "late" or
"latest" or "lattes" or ...?), which suggests we use probabilities. We
are trying to find the correction c, out of all possible candidate
corrections, that maximizes the probability that c is the intended correction, given the
original word w:
argmaxc ∈ candidates P(c|w)
By Bayes' Theorem this is equivalent
to:
argmaxc ∈ candidates P(c) P(w|c) / P(w)
Since P(w) is the same for every possible candidate c, we can factor it out, giving:
argmaxc ∈ candidates P(c) P(w|c)
The four parts of this expression are:
Selection Mechanism: argmax
We choose the candidate with the highest combined probability.
Candidate Model: c ∈ candidates
This tells us which candidate corrections, c, to consider.
Language Model: P(c)
The probability that c appears as a word of English text.
For example, occurrences of "the" make up about 7% of English text, so
we should have P(the) = 0.07.
Error Model: P(w|c)
The probability that w would be typed in a text when the
author meant c. For example, P(teh|the) is relatively high,
but P(theeexyz|the) would be very low.
One obvious question is: why take a simple expression like P(c|w) and replace
it with a more complex expression involving two models rather than one? The answer is that
P(c|w) is already conflating two factors, and it is
easier to separate the two out and deal with them explicitly. Consider the misspelled word
w="thew" and the two candidate corrections c="the" and c="thaw".
Which has a higher P(c|w)? Well, "thaw" seems good because the only change
is "a" to "e", which is a small change. On the other hand, "the" seems good because "the" is a very
common word, and while adding a "w" seems like a larger, less probable change, perhaps the typist's finger slipped off the "e". The point is that to
estimate P(c|w) we have to consider both the probability of c and the
probability of the change from c to w anyway, so it is cleaner to formally separate the
two factors.
How It Works: Some Python
The four parts of the program are:
Selection Mechanism: In Python, max with a key argument does 'argmax'.
Candidate Model:
First a new concept: a simple edit to a word is a deletion (remove one letter), a transposition (swap two adjacent letters),
a replacement (change one letter to another) or an insertion (add a letter). The function
edits1 returns a set of all the edited strings (whether words or not) that can be made with one simple edit:
def edits1(word):
"All edits that are one edit away from `word`."
letters = 'abcdefghijklmnopqrstuvwxyz'
splits = [(word[:i], word[i:]) for i in range(len(word) + 1)]
deletes = [L + R[1:] for L, R in splits if R]
transposes = [L + R[1] + R[0] + R[2:] for L, R in splits if len(R)>1]
replaces = [L + c + R[1:] for L, R in splits if R for c in letters]
inserts = [L + c + R for L, R in splits for c in letters]
return set(deletes + transposes + replaces + inserts)
This can be a big set. For a word of length n, there will
be n deletions, n-1 transpositions, 26n
alterations, and 26(n+1) insertions, for a total of
54n+25 (of which a few are typically duplicates). For example,
>>> len(edits1('somthing'))
442
However, if we restrict ourselves to words that are known—that is,
in the dictionary— then the set is much smaller:
def known(words): return set(w for w in words if w in WORDS)
>>> known(edits1('somthing'))
{'something', 'soothing'}
We'll also consider corrections that require two simple edits. This generates a much bigger set of
possibilities, but usually only a few of them are known words:
def edits2(word): return (e2 for e1 in edits1(word) for e2 in edits1(e1))
>>> len(set(edits2('something'))
90902
>>> known(edits2('something'))
{'seething', 'smoothing', 'something', 'soothing'}
>>> known(edits2('somthing'))
{'loathing', 'nothing', 'scathing', 'seething', 'smoothing', 'something', 'soothing', 'sorting'}
We say that the results of edits2(w) have an edit distance of 2 from w.
Language Model:
We can estimate the probability of a word, P(word), by counting
the number of times each word appears in a text file of about a million words, big.txt.
It is a concatenation of public domain book excerpts from Project Gutenberg
and lists of most frequent words from Wiktionary
and the British
National Corpus. The function words breaks text into words, then the
variable WORDS holds a Counter of how often each word appears, and P
estimates the probability of each word, based on this Counter:
def words(text): return re.findall(r'\w+', text.lower())
WORDS = Counter(words(open('big.txt').read()))
def P(word, N=sum(WORDS.values())): return WORDS[word] / N
We can see that there are 32,192 distinct words, which together appear 1,115,504 times, with 'the' being the most common word, appearing 79,808 times
(or a probability of about 7%) and other words being less probable:
>>> len(WORDS)
32192
>>> sum(WORDS.values())
1115504
>>> WORDS.most_common(10)
[('the', 79808),
('of', 40024),
('and', 38311),
('to', 28765),
('in', 22020),
('a', 21124),
('that', 12512),
('he', 12401),
('was', 11410),
('it', 10681),
('his', 10034),
('is', 9773),
('with', 9739),
('as', 8064),
('i', 7679),
('had', 7383),
('for', 6938),
('at', 6789),
('by', 6735),
('on', 6639)]
>>> max(WORDS, key=P)
'the'
>>> P('the')
0.07154434228832886
>>> P('outrivaled')
8.9645577245801e-07
>>> P('unmentioned')
0.0
Error Model:
When I started
to write this program, sitting on
a plane in 2007, I had no data on spelling errors, and no internet connection (I know
that may be hard to imagine today). Without data I couldn't build a good spelling error model, so I
took a shortcut: I defined a trivial, flawed error model that says all known words
of edit distance 1 are infinitely more probable than known words of
edit distance 2, and infinitely less probable than a known word of
edit distance 0. So we can make candidates(word) produce the first non-empty list of candidates
in order of priority:
The original word, if it is known; otherwise
The list of known words at edit distance one away, if there are any; otherwise
The list of known words at edit distance two away, if there are any; otherwise
The original word, even though it is not known.
Then we don't need to multiply by a P(w|c) factor, because every candidate
at the chosen priority will have the same probability (according to our flawed model). That gives us:
def correction(word): return max(candidates(word), key=P)
def candidates(word):
return known([word]) or known(edits1(word)) or known(edits2(word)) or [word]
Evaluation
Now it is time to evaluate how well this program does. After my plane landed, I
downloaded Roger Mitton's Birkbeck spelling error
corpus from the Oxford Text Archive. From that I extracted two
test sets of corrections. The first is for development, meaning I get
to look at it while I'm developing the program. The second is a final
test set, meaning I'm not allowed to look at it, nor change my program
after evaluating on it. This practice of having two sets is good
hygiene; it keeps me from fooling myself into thinking I'm doing
better than I am by tuning the program to one specific set of
tests. I also wrote some unit tests:
def unit_tests():
assert correction('speling') == 'spelling' # insert
assert correction('korrectud') == 'corrected' # replace 2
assert correction('bycycle') == 'bicycle' # replace
assert correction('inconvient') == 'inconvenient' # insert 2
assert correction('arrainged') == 'arranged' # delete
assert correction('peotry') =='poetry' # transpose
assert correction('peotryy') =='poetry' # transpose + delete
assert correction('word') == 'word' # known
assert correction('quintessential') == 'quintessential' # unknown
assert words('This is a TEST.') == ['this', 'is', 'a', 'test']
assert Counter(words('This is a test. 123; A TEST this is.')) == (
Counter({'123': 1, 'a': 2, 'is': 2, 'test': 2, 'this': 2}))
assert len(WORDS) == 32192
assert sum(WORDS.values()) == 1115504
assert WORDS.most_common(10) == [
('the', 79808),
('of', 40024),
('and', 38311),
('to', 28765),
('in', 22020),
('a', 21124),
('that', 12512),
('he', 12401),
('was', 11410),
('it', 10681)]
assert WORDS['the'] == 79808
assert P('quintessential') == 0
assert 0.07 < P('the') < 0.08
return 'unit_tests pass'
def spelltest(tests, verbose=False):
"Run correction(wrong) on all (right, wrong) pairs; report results."
import time
start = time.clock()
good, unknown = 0, 0
n = len(tests)
for right, wrong in tests:
w = correction(wrong)
good += (w == right)
if w != right:
unknown += (right not in WORDS)
if verbose:
print('correction({}) => {} ({}); expected {} ({})'
.format(wrong, w, WORDS[w], right, WORDS[right]))
dt = time.clock() - start
print('{:.0%} of {} correct ({:.0%} unknown) at {:.0f} words per second '
.format(good / n, n, unknown / n, n / dt))
def Testset(lines):
"Parse 'right: wrong1 wrong2' lines into [('right', 'wrong1'), ('right', 'wrong2')] pairs."
return [(right, wrong)
for (right, wrongs) in (line.split(':') for line in lines)
for wrong in wrongs.split()]
print(unit_tests())
spelltest(Testset(open('spell-testset1.txt'))) # Development set
spelltest(Testset(open('spell-testset2.txt'))) # Final test set
This gives the output:
unit_tests pass
75% of 270 correct at 41 words per second
68% of 400 correct at 35 words per second
None
So on the development set we get 75% correct (processing words at a rate of 41 words/second), and on the final test set we get 68%
correct (at 35 words/second). In conclusion, I met my goals for brevity, development time, and runtime speed, but not for accuracy.
Perhaps my test set was extra tough, or perhaps my simple model is just not good enough to get to 80% or 90% accuracy.
Future Work
Let's think about how we
could do better. (I've developed the ideas some more in a separate chapter for a book
and in a Jupyter notebook.)
P(c), the language model. We can distinguish two sources
of error in the language model. The more serious is unknown words. In
the development set, there are 15 unknown words, or 5%, and in the
final test set, 43 unknown words or 11%. Here are some examples
of the output of spelltest with verbose=True):
correction('transportibility') => 'transportibility' (0); expected 'transportability' (0)
correction('addresable') => 'addresable' (0); expected 'addressable' (0)
correction('auxillary') => 'axillary' (31); expected 'auxiliary' (0)
In this output we show the call to correction and the actual and expected results
(with the WORDS counts in parentheses).
Counts of (0) mean the target word was not in the dictionary, so we have no chance of getting it right.
We could create a better language model by collecting more data, and perhaps by
using a little English morphology (such as adding "ility" or "able" to the end of a word).
Another way to deal with unknown words is to allow the result of
correction to be a word we have not seen. For example, if the
input is "electroencephalographicallz", a good correction would be to
change the final "z" to an "y", even though
"electroencephalographically" is not in our dictionary. We could
achieve this with a language model based on components of words:
perhaps on syllables or suffixes, but it is
easier to base it on sequences of characters: common 2-, 3- and 4-letter
sequences.
P(w|c), the error model. So far, the error model
has been trivial: the smaller the edit distance, the smaller the
error. This causes some problems, as the examples below show. First,
some cases where correction returns a word at edit distance 1
when it should return one at edit distance 2:
correction('reciet') => 'recite' (5); expected 'receipt' (14)
correction('adres') => 'acres' (37); expected 'address' (77)
correction('rember') => 'member' (51); expected 'remember' (162)
correction('juse') => 'just' (768); expected 'juice' (6)
correction('accesing') => 'acceding' (2); expected 'assessing' (1)
Why should "adres" be corrected to "address" rather than "acres"?
The intuition is that the two edits from "d" to "dd" and "s" to "ss"
should both be fairly common, and have high probability, while the
single edit from "d" to "c" should have low probability.
Clearly we could use a better model of the cost of edits. We could
use our intuition to assign lower costs for doubling letters and
changing a vowel to another vowel (as compared to an arbitrary letter
change), but it seems better to gather data: to get a corpus of
spelling errors, and count how likely it is to make each insertion,
deletion, or alteration, given the surrounding characters. We need a
lot of data to do this well. If we want to look at the change of one
character for another, given a window of two characters on each side,
that's 266, which is over 300 million characters. You'd
want several examples of each, on average, so we need at least a
billion characters of correction data; probably safer with at least 10
billion.
Note there is a connection between the language model and the error model.
The current program has such a simple error model (all edit distance 1 words
before any edit distance 2 words) that it handicaps the language model: we are
afraid to add obscure words to the model, because if one of those obscure words
happens to be edit distance 1 from an input word, then it will be chosen, even if
there is a very common word at edit distance 2. With a better error model we
can be more aggressive about adding obscure words to the dictionary. Here are some
examples where the presence of obscure words in the dictionary hurts us:
correction('wonted') => 'wonted' (2); expected 'wanted' (214)
correction('planed') => 'planed' (2); expected 'planned' (16)
correction('forth') => 'forth' (83); expected 'fourth' (79)
correction('et') => 'et' (20); expected 'set' (325)
The enumeration of possible
corrections, argmaxc. Our program enumerates all corrections within
edit distance 2. In the development set, only 3 words out of 270 are
beyond edit distance 2, but in the final test set, there were 23 out
of 400. Here they are:
purple perpul
curtains courtens
minutes muinets
successful sucssuful
hierarchy heiarky
profession preffeson
weighted wagted
inefficient ineffiect
availability avaiblity
thermawear thermawhere
nature natior
dissension desention
unnecessarily unessasarily
disappointing dissapoiting
acquaintances aquantences
thoughts thorts
criticism citisum
immediately imidatly
necessary necasery
necessary nessasary
necessary nessisary
unnecessary unessessay
night nite
minutes muiuets
assessing accesing
necessitates nessisitates
We could consider extending the model by allowing a limited set of
edits at edit distance 3. For example, allowing only the insertion of
a vowel next to another vowel, or the replacement of a vowel for
another vowel, or replacing close consonants like "c" to "s" would
handle almost all these cases.
There's actually a fourth (and best) way to improve: change the
interface to correction to look at more context. So far,
correction only looks at one word at a time. It turns out that
in many cases it is difficult to make a decision based only on a
single word. This is most obvious when there is a word that appears
in the dictionary, but the test set says it should be corrected to
another word anyway:
correction('where') => 'where' (123); expected 'were' (452)
correction('latter') => 'latter' (11); expected 'later' (116)
correction('advice') => 'advice' (64); expected 'advise' (20)
We can't possibly know that correction('where') should be
'were' in at least one case, but should remain 'where' in other cases.
But if the query had been correction('They where going') then it
seems likely that "where" should be corrected to "were".
The context of the surrounding words can help when there are obvious errors,
but two or more good candidate corrections. Consider:
correction('hown') => 'how' (1316); expected 'shown' (114)
correction('ther') => 'the' (81031); expected 'their' (3956)
correction('quies') => 'quiet' (119); expected 'queries' (1)
correction('natior') => 'nation' (170); expected 'nature' (171)
correction('thear') => 'their' (3956); expected 'there' (4973)
correction('carrers') => 'carriers' (7); expected 'careers' (2)
Why should 'thear' be corrected as 'there' rather than 'their'? It is
difficult to tell by the single word alone, but if the query were
correction('There's no there thear') it would be clear.
To build a model that looks at multiple words at a time, we will need a lot of data.
Fortunately, Google has released
a database
of word counts for all sequences up to five words long,
gathered from a corpus of a trillion words.
I believe that a spelling corrector that scores 90% accuracy will
need to use the context of the surrounding words to make a
choice. But we'll leave that for another day...
We could also decide what dialect we are trying to train for. The
following three errors are due to confusion about American versus
British spelling (our training data contains both):
correction('humor') => 'humor' (17); expected 'humour' (5)
correction('oranisation') => 'organisation' (8); expected 'organization' (43)
correction('oranised') => 'organised' (11); expected 'organized' (70)
Finally, we could improve the implementation by making it much
faster, without changing the results. We could re-implement in a
compiled language rather than an interpreted one. We could cache the results of computations so
that we don't have to repeat them multiple times. One word of advice:
before attempting any speed optimizations, profile carefully to see
where the time is actually going.
Further Reading
Roger Mitton has a survey article
on spell checking.
Jurafsky and Martin cover spelling correction well in their text
Speech and Language Processing.
Manning and Schutze
cover statistical language models very well in their text
Foundations of Statistical Natural Language Processing,
but they don't seem to cover spelling (at least it is not in the index).
The aspell project has a lot of interesting material,
including some test data that seems better than what I used.
The LingPipe project has a spelling tutorial.
Acknowledgments
Ivan Peev, Jay Liang, Dmitriy Ryaboy and Darius Bacon pointed out problems in earlier versions
of this document.
Other Computer Languages
After I posted this article, various people wrote versions in
different programming languages. These
may be interesting for those who like comparing
languages, or for those who want to borrow an implementation in their
desired target language:
LanguageLinesCodeAuthor(and link to implementation)
Awk15Tiago "PacMan" Peczenyj
Awk28Gregory Grefenstette
C184Marcelo Toledo
C++98Felipe Farinon
C#43Lorenzo Stoakes
C#69Frederic Torres
C#160Chris Small
C#---Jo�o Nuno Carvalho
Clojure18Rich Hickey
Coffeescript21Daniel Ribeiro
D23Leonardo M
Erlang87Federico Feroldi
F#16Dejan Jelovic
F#34Sebastian G
Go57Yi Wang
Groovy22Rael Cunha
Haskell24Grzegorz
Java 823Peter Kuhar
Java35Rael Cunha
Java372Dominik Schulz
Javascript92Shine Xavier
Javascript53Panagiotis Astithas
Lisp26 Mikael Jansson
OCaml148Stefano Pacifico
Perl63riffraff
PHP68Felipe Ribeiro
PHP103Joe Sanders
R2Rasmus B��th
Rebol133Cyphre
Ruby34Brian Adkins
Scala20Pathikrit Bhowmick
Scala23Thomas Jung
Scheme45Shiro
Scheme89Jens Axel
Swift108 Airspeed Velocity
Other Natural Languages
This essay has been translated into:
Simplified Chinese
by Eric You XU
Japanese by Yasushi Aoki
Korean by JongMan Koo
Russian by Petrov Alexander
Thanks to all the authors for creating these implementations and translations.
Peter Norvig
| 2024-11-08T14:08:03 | en | train |
42,588 | ulfstein | 2007-08-15T07:06:48 | Made to Stick - why some ideas survive and others die | http://www.madetostick.com/ | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,590 | staunch | 2007-08-15T07:36:20 | Moving to San Francisco | null | http://www.instigatorblog.com/moving-to-san-francisco/2007/08/14/ | 1 | 0 | null | null | null | no_error | Moving to San Francisco | null | null | The weather is beautiful
The people there complain about the fog, but that’s just silliness. Come visit Montreal in February. Then talk to me about fog.
The city is nice
They’ve got the ocean, mountains and a vibrant city. The earthquake thing isn’t great, but get a sturdy a desk to hide under and you should be fine, right?
The startup community is unbeatable
I love the YCombinator system and got a chance to learn a lot about how it all works while I was there. Of course there are a ton of non-YCombinator startups doing incredible work as well…
So are you really moving to the Valley?
No, I’m not. But the thought certainly crossed my mind.
Mostly, this is because of how many people asked me if and when I was moving.
The question came from venture capitalists and entrepreneurs alike. It seemed natural and obvious to them that I should move there, because that’s “where it all happens.” They’re not entirely wrong.
And I’m not the only one thinking about this. Scott Kirsner noted that several of the entrepreneurs recently presenting at YCombinator Demo Day in Boston are planning a move to the Valley.
“The VCs more adventurous. The partnership opportunities more plentiful. The potential for generating buzz better.”
All true. I think cities like Boston (and Montreal) can do a lot to build a great startup ecosystem, but it’s going to take a ton of work. And it won’t be easy.
Meanwhile, I have no immediate plans to move to San Francisco. I absolutely believe that startups can succeed outside of the Valley fishbowl (here’s hoping I prove that true!) Mind you…perpetual Spring weather…hhhmmm…
Photos by lloydi, brandonwardlaw
| 2024-11-08T11:13:49 | en | train |
42,591 | RyanGWU82 | 2007-08-15T07:42:27 | BarCampBlock in Palo Alto - this weekend - anyone attending? | http://barcamp.org/BarCampBlock | 9 | 6 | [
42810,
42592,
42663,
42692
] | null | null | null | null | null | null | null | null | null | train |
|
42,596 | danw | 2007-08-15T08:42:13 | Tip: Don't Ever, Not Reply to a Sales Inquiry | null | http://www.techquilashots.com/2007/08/14/tip-dont-ever-not-reply-to-a-sales-inquiry/ | 3 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,600 | zyroth | 2007-08-15T09:18:47 | Hitting the Memory Wall | http://www.bitwiese.de/2007/08/hitting-memory-wall.html | 1 | 0 | null | null | null | Failed after 3 attempts. Last error: Quota exceeded for quota metric 'Generate Content API requests per minute' and limit 'GenerateContent request limit per minute for a region' of service 'generativelanguage.googleapis.com' for consumer 'project_number:854396441450'. | Hitting The Memory Wall | null | null |
Acknowledgement (2011-11-21): You should search Google for your blog titles before hitting "publish". When I wrote this article some years back, "hitting the memory wall" was just a term I had read some time earlier and internalized for myself as a standing term, like folklore. This was wrong. There is a paper from 1995 by WA Wulf and SA McKee with the same title: Hitting the memory wall that I was not aware of to this day. Thanks to sam in the comments for pointing this out. Sorry, for being late with the acknowledgement.You have always ignored the internals of CPU properties like the number of registers, the exact format of CPU words, the precise format of intructions and of course the cache. I know you have (well, let's say I am sure about 99% of you out there). I ignored this for a pretty long time, too, when programming (although I was lucky enough to be forced to learn about the general principles at university).
And it has always been enough for you, right? Your enterprisy Java programs ran nicely, your beautiful literal Haskell programs zipped smoothly along and your Ruby and Python scripts ran with whatever speed the interpreter made possible. Your C(++) programs ran well, too, didn't they?
At least they did for me (ignoring bugs) - until now. I ignored the CPU internals, kept to common programmer's sense and best practice. I made sure my sorting algorithms ran in O(n · log(n)), searching ran in O(log n) and generally made sure that all algorithms algorithms were in polynomial time and the constants in big-O notation were small.
I thought I was happy and no problem would occur to me. And so you might think. Think again.
Ready, set, go...
I was working on parallelizing Counting Sort, a simple integer sorting algorithm that runs in linear time and needs O(n) additional space.
The algorithm is given an array of integers in the range of [0, max_key] and then works as follows:
For each integer from 0 to max_key, count the number of occurences in the input array.
Then, determine for each of these integers, where the first one will be written to in the sorted array.
Third, copy the elements from the input array into a buffer array at the right positions.
At last, copy the elements from the buffer back into input array.
Note that the algorithm is stable, i.e. the order within the elements with the same keys is preserved. This property is important for its application in the DC3 algorithm for linear time Suffix Array construction.
1 /* Use the Counting Sort algorithm to sort the range
2 * [arr, arr + n). The entries must be in the range of
3 * [0, max_key]. */
4 static void counting_sort(int* arr, int n, int max_key)
5 {
6 // counter array
7 int* c = new int[K + 1];
8 // reset counters
9 for (int i = 0; i <= K; i++) c[i] = 0;
10 // count occurences
11 for (int i = 0; i < n; i++) c[arr[i]]++;
12
13 // compute exclusive prefix sums
14 for (int i = 0, sum = 0; i <= max_key; i++)
15 {
16 int t = c[i]; c[i] = sum; sum += t;
17 }
18
19 // copy elements sorted into buffer
20 int *buffer = new int[end - begin];
21 for (int i = 0; i < n; i++)
22 buffer[c[arr[i]]++] = arr[i];
23
24 // copy elements back into input
25 for (int i = 0; i < n; i++)
26 arr[i] = buffer[i];
27
28 // copy elements back
29 delete [] buffer;
30 delete [] c;
31 }
Also note that we copy back the elements from the input instead of simply filling up the result array with the keys we determined earlier. The reason for this is that the input array could be an array of objects which are then sorted by a certain integer property/key.
...and crash!
So, where is the problem? Counting Sort! One of the simplest algorithms there is. Taught in undergraduate courses or in school! Can it get simpler than that? Where can the problem be?
I wanted to parallelize the DC3 algorithm using the shared memory with OpenMP. DC3 needs a linear time integer sorter to run in linear time and the reference implementation uses counting sort for it.
So I threw in some parallel instructions: Line 14-16 were executed for each thread, i.e. every thread got an equally (plus minus one) sized part of the input array and counted the occurences. Afterwards, the threads were terminated and the master thread calculated the "global prefix sums" so all threads got the right positions to write to. Then, lines 21-22 were parallelized again.
The parallelelized code can be found here.
OK, so far - since the sequential work is reduced to memory allocation and the global prefix sum calculation (aka rank calculation) involves very few additions there should not be a problem, right? (Let us ignore the copy-back step for this article.)
So I compiled the source on our Dual Xeon (each with 2 cores) machine with GCC 4.2 and level 3 optimization and ran some benchmarks. The maximum key was set to 127 (i.e. we could sort ASCII strings), the array size set to 16M (i.e. 64GB of data since ints are 4 bytes long on the architecture, filled with random integers) and the number of threads was varied from 1 to 4. The results are shown below (the line numbers correspond to the sequential code not the parallel one):
counting sort benchmark results, n = 228 no. of threads 1 2 3 4 line 14-17 30.20 ms 19.99 ms 29.74 ms 23.88 ms lines 21-22 100.92 ms 59.61 ms 56.41 ms 55.78 ms
So, we get a speedup of about 1.5 with two threads but afterwards, there is no speedup at all. We should expect a speedup of n with n processors in these two parts since these sections were completely parallelized.
So, what the heck is happening there?
The von Neumann Bottleneck
It's the von Neumann Bottleneck, baby! Today's SMP (Shared Memory Processing) systems are still built similar to the von Neumann machine. You were propably taught about it if you have a computer science background:
The main memory is accessible via random access and stores machine words.
The bus connects main memory, processor, peripherical devices. Only one connected entity can use the bus at any given time.
The processor loads data and instructions from the main memory and executes it.
There are peripherical devices for input and output (HDD, keyboard etc.)
Today's computers do not work directly on the main memory, however, but normally on registers which can be accessed in one cycle. Read and write access to the main memory are cached in a cache hierarchy. The specs of the caches on the given machine were measured to be as follows:
memory hierarch specs for the Xeon 5140 system - L1 Cache L2 Cache Main Memory size 32 KiB 4 MiB 8 GiB latency [cycles] 3 cycles 9 cycles 133 cycles latency [time] 1.28 ns 3.94 ns 56.95 ns
Additionally, the memory bus bandwidth in the system is 6.4 GB/s (however, as usual with bandwidth you will not be able to actually transfer more than half of that data per second in a real system).
So let us see if we can explain the behaviour with the knowledge about the architecture and these numbers in mind.
Lines 14-17 are executed 224 times in total and because ints are 4 bytes wide, this makes 226 bytes = 64 MiB transferred from memory if we only consider arr[] - c[] is small enough to fit into the processor's cache all the time (even one copy for each core).
With one thread (i.e. one processor working), 64 MiB get read in 30 ms which means that 2.133 GiB/s were read. With two threads working, the 64 MiB get read in roughly 20ms which manes that 3.2 GiB/s were read - the memory bus is saturated, our algorithm gets memory I/O bound and has to wait for the slow SD-RAM.
A Strange Phenomenon
Now, let us try to transfer that calculation to lines 21-22 - it should be pretty easy now. Again, we can assume that c[] can be kept in the level 1 cache all the time. This leaves reading arr[] and writing to buffer[]. Note that buffer[] is more or less accessed randomly (depending on the order of the values in arr[]). However, there are only 127 positions in buffer that are written to (limited by the size of c[]) and thus we can keep these positions of buffer[] in the L2 cache.
We would expect lines 21-22 to take twice the time than lines 14-17 because there are twice as much memory accesses. However, it takes thrice the time with two threads where we would expect the bus saturation. It gets even a bit faster with more threds although we would expect the bus to be saturated already! What is happening?
The image of modern computers we drew above was not really exact: Modern operating systems use virtual memory with paging to protect applications from each other and the kernel from user land:
Programs use virtual addresses to address their variables and these virtual addresses have to be translated into physical addresses. The data in the cache is addressed physically so access of main memory requires a resolution of a virtual address into a physical address. The addressing is done page wise, e.g. in chunks of 4 KiB. Each of these pages has a virtual base address which has to be mapped to its physical address (the place the page resides in RAM is called page frame).
The operating system has a table for each process that has the mapping from virtual page addresses to physical ones. This table resides in memory, too, and has to be accessed for each memory access. Parts of these tables are kept in a special cache: The so called Translation Lookaside Buffer (TLB). The TLB of the system is again separated into two levels, the faster one is approximately as fast as the registers, the slower one as fast as the L1 cache.
Let us explain our results with these numbers.
Since the page size of the system is 4KiB, we only have to look at the page table every 1024th memory access in lines 14-17. This very few times and we can neglect the access times since they are few and fast (since the L1 TLB is hit).
In lines 25-26, we transfer 128MiB in and out of the RAM. This should take us about 40ms but the lines take use 60ms. However, since access is almost random, we expect to look at the L2 TLB almost every time we want to access buffer[]. This means looking at it 224 times with 1.28ns each. This simplified calculation yields 21ms for the TLB accesses which seems right considered that we will hit the L1 TLB some times, too.
Whee, I do not know about you, but I would like to see a summary of all this to wrap my mind around it properly.
Summary
We examined the parallelization of counting sort, a simple linear time sorting algorithm. The algorithm could be parallelized well but the parallel parts did not yield the expected linear speedup. We considered current, modern computer architectures and could explained our experimental results with the specs of the machine we used and the knowledge of the architecture.
Note, ladies and gentlemen that we are crossing the border between algorithmics and system architecture here: Sometimes, actually implemented algorithms behave different from theoretical results (which indicated a lineare speedup).
So, what's next? We could try to kick our "slow" sorting algorithm into the virtual nirvana and replace it by another one. But which one should we choose? Counting sort needs exactly 4 · n + O(k) operations for an array with the length of n containing values from 0 to k. Any comparison based algorithm like Quicksort would need much more operations and parallelizing them comes at a pretty high overhead. Bucketsort exhibits the same non-locality when copying back elements and Radixsort needs another stable sorting algorithm like counting sort internally. If you, dear reader, know of a better linear sorting algorithm then please let me know since it would solve a problem for me.
We could use a NUMA machine where each processor has its own memory bus and memory. After splitting the input array, each processor could sort its part in its own memory. However, the final result composition would be slower since access to other processor's memory is slow and we have to go through one single bottlenecky bus again.
I hope you had as much fun reading this article as I had analyzing the algorithm and writing the article.
We are looking forward to your comments.
Updates
I think that I have not made it clear enough above that the algorithm actually is cache efficient. Everwhere, memory is accessed, it is only accessed ones and in streams (every entry of c points to a part of buffer and this can be considered a stream). Each of these streams is read/written sequentially. This seems to have been hidden by the description of modern computers' architecture above.
| 2024-11-08T12:20:57 | null | train |
|
42,602 | qwertyuiop | 2007-08-15T10:06:57 | OLPC speed improved | http://morgancollett.wordpress.com/2007/08/15/olpc-review-by-a-12-year-old-xo-speed/ | 1 | 1 | [
42700
] | null | null | null | null | null | null | null | null | null | train |
|
42,621 | tomh | 2007-08-15T12:26:11 | Networking Tips from the White House | null | http://www.fourhourworkweek.com/blog/2007/08/13/networking-tips-from-the-white-house/#more-117 | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,627 | Keios | 2007-08-15T12:47:48 | How to be a Programmer: A Short, Comprehensive, and Personal Summary | http://samizdat.mines.edu/howto/HowToBeAProgrammer.html#id2792906 | 40 | 10 | [
43164,
42849,
42758
] | null | null | null | null | null | null | null | null | null | train |
|
42,629 | LaurieCheers | 2007-08-15T13:01:18 | The nerdiest nerd test around | http://students.washington.edu/mmccain/nerdtest.html | 1 | 5 | [
42638,
42689
] | null | null | null | null | null | null | null | null | null | train |
|
42,630 | electric | 2007-08-15T13:01:24 | Disrupters are agents for change -- what makes technology disruptive? | http://www.canada.com/ottawacitizen/news/business/story.html?id=3e235634-d62f-450c-8057-02c10a972434&p=2 | 2 | 3 | [
42766,
42674
] | null | null | http_404 | Canada.Com | null | null |
Skip to Content
Search o.canada.com
Canada.com
Search o.canada.com
Travel Canada
Travel USA
Travel International
Cruises
Travel Essentials
Puzzmo
Contests
Profile
Settings
Newsletters
Customer Service
FAQ
Travel Canada
Travel USA
Travel International
Cruises
Travel Essentials
Puzzmo
Contests
404Missing page
Oh no! Mr Beaver lost this page when he went scavenging (or you need to check your spelling). Try searching below or check out our other top stories!
Search o.canada.com
Top Stories
Notice for the Postmedia Network
This website uses cookies to personalize your content (including ads),
and allows us to analyze our traffic. Read more about
cookies here.
By continuing to use our site, you agree to our
Terms of Use
and Privacy Policy.
| 2024-11-07T22:16:21 | null | train |
|
42,631 | nreece | 2007-08-15T13:02:38 | How to Give a Kick Ass Presentation | http://www.pubcon.com/blog/index.cgi?mode=viewone&blog=1187123220 | 12 | 1 | [
42974
] | null | null | http_404 | Pubcon Pro | null | null |
Vegas Oct 2024
Main Page Vegas OCT 2024
Search Chaos Agenda
Breakout Sessions
Pubcon Masters Workshops
Main Workshop Info
SEO Workshop Track
PPC Track
AI or DIE Track
Exhibition and Sponsorship
Exhibitors and Sponsors
Venue and Lodging
Speaking Proposals
Register for Pubcon
AI or DIE!
Austin June 2024
Onboarding AI Workshop Series
Workshop Syllabus
AI or DIE Austin – Venue and lodging
AI or DIE Sponsorship Opportunities
Register for AI or DIE!
Registration Pass Types
More Cities Soon
Speakers
Past Speakers
Speaking Proposals
Speaking Proposal Guidelines
Speaker Selection Process
Submit Speaking Proposal
Pubcon News
Pubcon News
Exhibitors News
Email Updates
Testimonials
About
Pubcon Policies
About Pubcon Inc.
Pubcon Policies
Conference History
Past Keynotes
Site Search
Contacts
Exhibition and Sponsorship
Press
Social Media
Subscribe to Blog Updates
Error 404 - Not Found
Sorry, but you are looking for something that isn't here.
| 2024-11-08T14:20:37 | null | train |
|
42,640 | eastsidegringo | 2007-08-15T13:28:11 | Chocolate Rain: What can it teach us entrepreneurs? | I think there's more to the song than just 19 couplets with the same repetitive intro. There's an underlying meaning there that the creator himself describes as "a process of internalized racism". And with lyrics like "the Bell Curve blames the baby's DNA", I have to agree.
| http://tracksuitceo.wordpress.com/2007/08/15/chocolate-rain-what-does-it-mean/ | 2 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,652 | byrneseyeview | 2007-08-15T14:22:05 | Silphium: Did Greek science die out because their elite discovered The Pill? | http://en.wikipedia.org/wiki/Silphium | 10 | 1 | [
42687,
42776
] | null | null | no_error | Silphium | 2003-08-20T23:50:45Z | Contributors to Wikimedia projects |
From Wikipedia, the free encyclopedia
This article is about the plant that was used in classical antiquity. For the modern genus of plants, see Silphium (genus).
Not to be confused with Silpium.
Ancient silver coin from Cyrene depicting a stalk of silphium
Silphium (also known as laserwort or laser; Ancient Greek: σίλφιον, sílphion) is an unidentified plant that was used in classical antiquity as a seasoning, perfume, aphrodisiac, and medicine.[1][2]
It was the essential item of trade from the ancient North African city of Cyrene, and was so critical to the Cyrenian economy that most of their coins bore a picture of the plant. The valuable product was the plant's resin, called in Latin laserpicium, lasarpicium or laser (the words Laserpitium and Laser were used by botanists to name genera of aromatic plants, but the silphium plant is not believed to belong to these genera).
The exact identity of silphium is unclear. It was claimed to have become extinct in Roman times.[3] It is commonly believed to be a relative of giant fennel in the genus Ferula.[1][4][5] The extant plant Thapsia gummifera[6] has been suggested as another possibility. Another theory is that it was simply a high quality variety of asafoetida, a common spice in the Roman Empire. The two spices were considered the same by many Romans including the geographer Strabo.[7]
Silphium was considered invaluable by all who held it. The BBC reports that the plant was sung about in Roman poems and songs, who considered it equivalent to its weight in gold.[2] Historically, Pliny the Elder blamed silphium's valuation on "tax-farmers," and Julius Caesar directly registered silphium as "1500 pounds of laser" in the Roman treasury.[8]
Identity and extinction[edit]
A coin of Magas of Cyrene c. 300–282/75 BC. Reverse: silphium and small crab symbols.
The identity of silphium is highly debated. Without a surviving sample, no genetic analysis can be made. It is generally considered to belong to the genus Ferula, as an extinct or living species. The currently extant plants Thapsia gummifera,[6] Ferula tingitana, Ferula narthex, Ferula drudeana, and Thapsia garganica have been suggested as possible identities.[1][4][5][9][10] Ferula drudeana, an endemic species found in Turkey, is a candidate for silphium based on similarity of appearance in descriptions and production of a spice-like gum-resin with supposedly similar properties to silphium.[11][5] However, F. drudeana belongs to a lineage from the southern Caspian Sea region, with no known connection to Eastern Libya.[12]
Theophrastus mentioned silphium as having thick roots covered in black bark, about one cubit (48 cm) long, with a hollow stalk, similar to fennel, and golden leaves, like celery.[2]
Weighing and loading of silphium at Cyrene
The disappearance of silphium is considered the first extinction of a plant or animal species in recorded history.[13] The cause of silphium's supposed extinction is not entirely known but numerous factors are suggested. Silphium had a remarkably narrow native range, about 125 by 35 miles (201 by 56 km), in the southern steppe of Cyrenaica (present-day eastern Libya).[14] Overgrazing combined with overharvesting have long been cited as the primary factors that led to its extinction.[3] However, recent research has challenged this notion, arguing instead that desertification in ancient Cyrenaica was the primary driver of silphium's decline.[15]
Another theory is that when Roman provincial governors took over power from Greek colonists, they over-farmed silphium and rendered the soil unable to yield the type that was said to be of such medicinal value. Theophrastus wrote in Enquiry into Plants that the type of Ferula specifically referred to as "silphium" was odd in that it could not be cultivated.[16] He reports inconsistencies in the information he received about this, however.[17] This could suggest the plant is similarly sensitive to soil chemistry as huckleberries which, when grown from seed, are devoid of fruit.[2]
Similar to the soil theory, another theory holds that the plant was a hybrid, which often results in very desired traits in the first generation, but second-generation can yield very unpredictable outcomes. This could have resulted in plants without fruits, when planted from seeds, instead of asexually reproducing through their roots.[2]
Pliny reported that the last known stalk of silphium found in Cyrenaica was given to Emperor Nero "as a curiosity".[3]
Many medical uses were ascribed to the plant.[18] It was said that it could be used to treat cough, sore throat, fever, indigestion, aches and pains, warts, and all kinds of maladies.
Hippocrates wrote:[19]
When the gut protrudes and will not remain in its place, scrape the finest and most compact silphium into small pieces and apply as a cataplasm.
The plant may also have functioned as a contraceptive and abortifacient.[4][20]
Silphium was used in Graeco-Roman cooking, notably in recipes presented in Apicius. Some historians have suggested that its use, particularly in the North African region of its origin, was extensive:Not quite as ubiquitous as liquamen, but just as necessary in the Roman kitchen, was the herb silphium...Life in Cyrenaica revolved around [silphium] to such an extent that the dramatist Antiphanes, in the fourth century BC, made one of his characters groan: "I will not sail back to the place from which we were all carried away, for I want to say goodbye to all—horses, silphium, chariots, silphium stalks, steeple-chasers, silphium leaves, and silphium juice!"[21]Long after its claimed extinction, silphium continued to be mentioned in lists of aromatics copied one from another, until it makes perhaps its last appearance in the list of spices that the Carolingian cook should have at hand—Brevis pimentorum que in domo esse debeant ("A short list of condiments that should be in the home")—by a certain "Vinidarius", whose excerpts of Apicius[a] survive in one 8th-century uncial manuscript. Vinidarius's dates may not be much earlier.[22]
Hieroglyphs and symbols for silphium[edit]
Evans's 1921 description of silphium hieroglphys at Knossos
The Minoans probably used silphium as the visual reference for the hieroglyph psi (), meaning "plant." It resembles a central shoot flanked by two stalks.[23] Minoan fetishes with this geometry are known as psi and phi type figurines, and are also designed for their letter-like shape. This glylph developed into the modern greek psi (Ψ).
Egyptian hieroglyphs for Libyan silphium have also been documented in archeological publications as a balm ingredient that must be dehulled and which produces a sap. In one record, it appears similar to the hieroglyph for branch (𓆱) written to be read from left-to-right.[24]
Ancient Cyrenean silver coin depicting a silphium seed or fruit
There has been some speculation about the connection between silphium and the traditional heart shape (♥).[25] Silver coins from Cyrene of the 6th–5th centuries BCE bear a similar design, sometimes accompanied by a silphium plant, and is understood to represent its seed or fruit.[26] Some plants in the family Apiaceae, such as Heracleum sphondylium, have heart-shaped indehiscent mericarps (a type of fruit).Drawing of Heracleum sphondylium, showing its heart-shaped mericarpContemporary writings help tie silphium to sexuality and love. Silphium appears in Pausanias' Description of Greece in a story of the Dioscuri staying at a house belonging to Phormion, a Spartan:
For it so happened that his maiden daughter was living in it. By the next day this maiden and all her girlish apparel had disappeared, and in the room were found images of the Dioscuri, a table, and silphium upon it.[27]
Silphium as laserpicium makes an appearance in a poem (Catullus 7) of Catullus to his lover Lesbia (though others have suggested that the reference here is instead to silphium's use as a treatment for mental illness, tying it to the "madness of love"[28][29]).
In the Italian military heraldry, Il silfio d'oro reciso di Cirenaica ("Silphium of Cyrenaica, smoothly cut and printed in gold; in blazon: silphium couped or of Cyrenaica") is the symbol granted to units that distinguished themselves in the Western Desert Campaign in North Africa during World War II.[30]
Italian coat of arms Il silfio d'oro reciso di Cirenaica
Silphium depicted on the arms of Italian Libya
Characters in Lindsey Davis's 1998 historical crime novel Two for the Lions travel from Rome to North Africa in search of Silphium.[31]
Necropolis of Cyrene
^ A generic term for a cookery book, as "Webster" is of American dictionaries.
^ a b c Tatman, J.L. (October 2000). "Silphium, Silver and Strife: A History of Kyrenaika and Its Coinage". Celator. 14 (10): 6–24.
^ a b c d e Zaria Gorvett (2017). "The mystery of the lost Roman herb". BBC. Archived from the original on 2018-05-17. Retrieved 2018-08-27.
^ a b c Pliny, XIX, Ch.15 Archived 2022-09-28 at the Wayback Machine
^ a b c Did the ancient Romans use a natural herb for birth control? Archived 2006-10-27 at the Wayback Machine, The Straight Dope, October 13, 2006
^ a b c Grescoe, Taras (23 September 2022). "This miracle plant was eaten into extinction 2,000 years ago—or was it?". National Geographic. Archived from the original on 25 September 2022. Retrieved 26 September 2022.
^ a b Amigues, Suzanne (2004). "Le silphium - État de la question" [Silphium - State of the art]. Journal des Savants (in French). 2 (1): 191–226. doi:10.3406/jds.2004.1685.
^ Dalby 2000, p. 18.
^ Parejko, Ken (2003-05-29). "Pliny the Elder's Silphium: First Recorded Species Extinction". Conservation Biology. 17 (3): 925–927. doi:10.1046/j.1523-1739.2003.02067.x. ISSN 0888-8892.
^ Andrews, Alfred C. (1941). "The Silphium of the Ancients: A Lesson in Crop Control". Isis. 33 (2): 232–236. doi:10.1086/358541. JSTOR 330743. S2CID 144108503.
^ Parejko, K (2003). "Pliny the Elder's Silphium: First Recorded Species Extinction". Conservation Biology. 17 (3): 925–927. Bibcode:2003ConBi..17..925P. doi:10.1046/j.1523-1739.2003.02067.x. S2CID 84007922.
^ Miski, Mahmut (2021-01-06). "Next Chapter in the Legend of Silphion: Preliminary Morphological, Chemical, Biological and Pharmacological Evaluations, Initial Conservation Studies, and Reassessment of the Regional Extinction Event". Plants. 10 (1): 102. doi:10.3390/plants10010102. ISSN 2223-7747. PMC 7825337. PMID 33418989.
^ Piwczyński, Marcin; Wyborska, Dominika; Gołębiewska, Joanna; Puchałka, Radosław (2018). "Phylogenetic positions of seven poorly known species of Ferula (Apiaceae) with remarks on the phylogenetic utility of the plastid TRNH-psbA, TRNS-TRNG, and atpB-RBCL intergenic spacers". Systematics and Biodiversity. 16 (5): 428–440. Bibcode:2018SyBio..16..428P. doi:10.1080/14772000.2018.1442374. S2CID 90391176.
^ Grescoe, Taras (15 September 2023). "Eat the past to preserve the future". The Globe and Mail. Retrieved 6 March 2024.
^ "Off this tract is the island of Platea, which the Cyrenaeans colonized. Here too, upon the mainland, are Port Menelaus, and Aziris, where the Cyrenaeans once lived. The Silphium begins to grow in this region, extending from the island of Platea on the one side to the mouth of the Syrtis on the other." (Herodotus, iv.168–198 on-line text Archived 2013-04-09 at the Wayback Machine)
^ Pollaro, Paul; Robertson, Paul (2022). "Reassessing the Role of Anthropogenic Climate Change in the Extinction of Silphium". Frontiers in Conservation Science. 2. doi:10.3389/fcosc.2021.785962. ISSN 2673-611X.
^ Theophrastus, III.2.1, VI.3.3
^ Theophrastus, VI.3.5
^ Pliny, XXII, Ch. 49 Archived 2007-12-28 at the Wayback Machine
^ Hippocrates, Translated by Francis Adams. "On Fistulae, Section 9". Archived from the original on 2012-06-03. Retrieved 2012-03-25.
^ Riddle, John M. (1992). Contraception and Abortion from the Ancient World to the Renaissance. Harvard University Press. p. 58. ISBN 978-0-674-16876-3. Archived from the original on 2021-09-03. Retrieved 2021-09-03.
^ Tannahill, Reay (1973). Food in History. New York: Stein and Day. p. 99. ISBN 0-8128-1437-1.
^ Maguelonne Toussaint-Samat, Anthea Bell, tr. The History of Food, revised ed. 2009, p. 434.
^ Evans, Arthur (1921). The palace of Minos : a comparative account of the successive stages of the early Cretan civilization as illustrated by the discoveries at Knossos. Cornell University Library. London : Macmillan and Co. pp. §92, pp. 215-6.
^ Fritschy, Wantje (June 2021). "A New Interpretation of the Early Dynastic so-called 'Year' Labels. 'Balm Labels' and the Preservation of the Memory of the King". The Journal of Egyptian Archaeology. 107 (1–2): 207–224. doi:10.1177/03075133211060366. ISSN 0307-5133.
^ Favorito, E. N.; Baty, K. (February 1995). "The Silphium Connection". Celator. 9 (2): 6–8.
^ Buttrey, T. V. (1992). "The Coins and the Cult". Expedition. 34 (1–2): 59–66. Archived from the original on 2021-09-03. Retrieved 2021-09-03.
^ Pausanias, 3.16.3 Archived 2021-02-25 at the Wayback Machine
^ Moorhouse, A. C. (1963). "Two Adjectives in Catullus, 7". The American Journal of Philology. 84 (4): 417–418. doi:10.2307/293237. JSTOR 293237.
^ Bertman, Stephen (December 1978). "Oral Imagery In Catullus 7". The Classical Quarterly. 28 (2): 477–478. doi:10.1017/S0009838800035060. S2CID 170172017.
^ "Si distinsero i soldati del 28° Reggimento Fanteria "Pavia" il cui scudo reca nel terzo quarto una pianta di silfio d'oro reciso e sormontata da una stella d'argento"." (Gaetano Arena, Inter eximia naturae dona: il silfio cirenaico fra ellenismo e tarda antichità, 2008:13
^ "Two for the Lions". Kirkus Reviews. 1999. Retrieved 19 March 2024. exploring the hills and towns along the African coast ... searching for the herb silphium, a gold mine if found
Dalby, Andrew (2000). Dangerous Tastes: The Story of Spices. University of California Press. ISBN 9780520227897.
Herodotus. The Histories. II:161, 181, III:131, IV:150–65, 200–05.
Pausanias. Description of Greece 3.16.1–3
Pliny the Elder. Natural History. XIX:15 and XXII:100–06.
Tatman, John. "Silphium: Ancient wonder drug?". Jencek's Ancient Coins & Antiquities. Archived from the original on 2007-03-30. Retrieved 2007-02-05.
Theophrastus. Enquiry into plants and minor works on odours and weather signs, with an English translation by Sir Arthur Hort, bart (1916). Volume 1 (Books I–V) and Volume 2 (Books VI–IX) Volume 2 includes the index, which lists silphium (Greek σιλϕιον) on page 476, column 2, 2nd entry.
Buttrey, Theodore V; MacPhee, Ian (1998). The coins from the sanctuary of Demeter and Persephone. The University Museum. ISBN 978-0-924171-48-2. OCLC 611613435.
Fisher, Nick (1996). "Laser-Quests Unnoticed Allusions to Contraception in a Poet and a Princeps?". Classics Ireland. 3: 73–96. doi:10.2307/25528292. JSTOR 25528292.
Gemmill, Chalmers L. (1966). "Silphium". Bulletin of the History of Medicine. 40 (4): 295–313. JSTOR 44447186. PMID 5912906. ProQuest 1296321392.
Helbig, Maciej (2012). "Physiology and Morphology of σίλφιον in Botanical Works of Theophrastus". Scripta Classica (9): 41–48.
Koerper, Henry; Kolls, A. L (April 1999). "The silphium motif adorning ancient libyan coinage: Marketing a medicinal plant". Economic Botany. 53 (2): 133–143. doi:10.1007/BF02866492. S2CID 32144481.
Riddle, John M. (1997). "Silphium". Eve's Herbs: A History of Contraception and Abortion in the West. Harvard University Press. pp. 44–46. ISBN 978-0-674-27026-8.
Riddle, John M.; Estes, J. Worth; Russell, Josiah C. (1994). "Ever Since Eve... Birth Control in the Ancient World". Archaeology. 47 (2): 29–35. JSTOR 41770706. OCLC 5543506162.
Tameanko, M. (April 1992). "The Silphium Plant: Wonder Drug of the Ancient World Depicted on Coins". Celator. 6 (4): 26–28.
Tatman, J. L. (October 2000). "Silphium, Silver and Strife: A History of Kyrenaika and Its Coinage". Celator. 14 (10): 6–24.
Wright, W. S. (February 2001). "Silphium Rediscovered". Celator. 15 (2): 23–24.
William Turner, A New Herball (1551, 1562, 1568)
Selivanova, Larisa (2018). "Растительный символ на монетах Кирены" [A Vegetation Symbol on Coins from Cyrene]. История (in Russian). 9 (2). doi:10.18254/S0002135-7-1.
Asciutti, Valentina (2004). The Silphium plant: analysis of ancient sources (Thesis).
Contraception In Ancient Times: Use of Morning-After Pill by David W. Tschanz
Silphion at Gernot Katzer's Spice Pages
The Secret of the Heart
Margotia gummifera
Ferula tingitana
| 2024-11-07T23:52:09 | en | train |
|
42,655 | ivankirigin | 2007-08-15T14:37:26 | Google To Release Embeddable Maps | null | http://radar.oreilly.com/archives/2007/08/google_to_relea.html | 5 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,658 | citris | 2007-08-15T15:02:37 | Spark Networks Banking Conference Presentation. | 400M Pageviews/Month for all sites combined.
New director very experienced in Advertising/Social Networking .<p>Niche is all about marketing, product doesn't matter.<p>Lots of talk on company strategy
| http://plentyoffish.wordpress.com/2007/08/14/spark-networks-banking-conference-presentation/ | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,664 | toffer | 2007-08-15T15:31:20 | Matt Maroon: Demo Day | http://mattmaroon.com/?p=263 | 25 | 14 | [
42681,
42691,
42682
] | null | null | null | null | null | null | null | null | null | train |
|
42,666 | webology | 2007-08-15T15:35:56 | Blueprints are not final | http://playgroundblues.com/posts/2007/aug/10/blueprints-are-not-final/ | 1 | 0 | null | null | null | http_404 | Nathan Borror | null | null |
Page not found
The page was not found.
| 2024-11-08T12:42:00 | null | train |
|
42,667 | webology | 2007-08-15T15:37:41 | Blueprint is a CSS framework | http://bjorkoy.com/blueprint/ | 9 | 4 | [
42699
] | null | null | null | null | null | null | null | null | null | train |
|
42,670 | samb | 2007-08-15T15:46:59 | The Opposite | http://sethgodin.typepad.com/seths_blog/2007/08/the-opposite.html | 3 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,671 | drm237 | 2007-08-15T15:55:02 | Yahoo! Health in Stealth Mode or Just Plain Off-the-Radar? | Yahoo!'s lack of involvement in the burgeoning ehealth space is something I probably spend a little bit too much time thinking about, but I just can't understand why Yahoo! Health doesn't get more attention from its parent portal. | http://healthcareinformationsystemsblog.blogspot.com/2007/08/yahoo-health-in-stealth-mode-or-just.html | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,672 | epi0Bauqu | 2007-08-15T15:57:02 | What to do if you get sued and you're the little guy | http://www.tonywright.com/2007/what-to-do-if-you-get-sued-and-youre-the-little-guy/ | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,673 | farmer | 2007-08-15T15:58:07 | Wozniak's New Goal is Efficient Housing | http://www.ecnmag.com/article.aspx?id=146610&menuid=&adcode=section=effzone | 15 | 1 | [
43078
] | null | null | null | null | null | null | null | null | null | train |
|
42,676 | morselsrule | 2007-08-15T16:00:36 | Nine Javascript Gotchas | http://www.fitzblog.com/tabid/17782/bid/2127/Nine-Javascript-Gotchas.aspx | 1 | 1 | [
42685
] | null | null | null | null | null | null | null | null | null | train |
|
42,679 | run4yourlives | 2007-08-15T16:08:23 | Common Pitfals of Corporate Innovation | http://davidpiccione.com/blog/innovation-and-the-corporation/ | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,680 | transburgh | 2007-08-15T16:08:34 | Unborn Baby Gets Facebook Profile | null | http://www.marketingpilgrim.com/2007/08/unborn-baby-gets-facebook-profile.html | 2 | 1 | [
42734
] | null | null | no_article | null | null | null | null | 2024-11-08T07:10:11 | null | train |
42,683 | Tichy | 2007-08-15T16:23:33 | Scientific Handbook for the Simulation of Collective Intelligence (ebook creative commons) | http://www.scribd.com/doc/244626/Scientific-Handbook-for-the-Simulation-of-Collective-Intelligence | 3 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,688 | bosky101 | 2007-08-15T16:37:37 | Screenshots, by bosky : geek cartoon strip | Drawing cartoons, began as a hobby during my younger days, and got a real energetic jiff of rejuvenation, after working on a vector-graphic product with a startup in Bangalore. | http://bhaskervk.com/screenshots | 1 | 0 | null | null | null | null | null | null | null | null | null | null | train |
42,693 | dawie | 2007-08-15T16:50:09 | Exclusive images of Endeavor's damaged tiles | http://blogs.zdnet.com/emergingtech/?p=662 | 3 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,698 | toffer | 2007-08-15T17:01:51 | Coding Horror: Discipline Makes Strong Developers | http://www.codinghorror.com/blog/archives/000931.html | 26 | 1 | [
43079
] | null | null | null | null | null | null | null | null | null | train |
|
42,701 | null | 2007-08-15T17:08:02 | null | null | null | null | null | null | [
"true"
] | null | null | null | null | null | null | null | null | train |
42,702 | transburgh | 2007-08-15T17:08:55 | Why Paul? Why Did You Change It? (About Hacker News) | null | http://www.centernetworks.com/y-combinator-hacker-news | 37 | 45 | [
42717,
42756,
42760,
42715,
42787,
42842,
42801,
42996,
43123,
42817,
42744,
42806
] | null | null | null | null | null | null | null | null | null | train |
42,707 | blahblah | 2007-08-15T17:18:23 | Programming as if Performance Mattered | http://www.dadgum.com/james/performance.html | 3 | 0 | null | null | null | null | null | null | null | null | null | null | train |
|
42,714 | terpua | 2007-08-15T17:36:52 | A peek inside Moleskine notebooks by artists, designers, architects, etc. | null | http://www.37signals.com/svn/posts/559-a-peek-inside-moleskine-notebooks-by-artists-designers-architects-etc | 3 | 1 | [
42746
] | null | null | null | null | null | null | null | null | null | train |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.