
2007年10月21日
Rank
1:
SIGMOD: ACM SIGMOD Conf on Management of
Data
PODS: ACM SIGMOD Conf on Principles of DB
Systems
VLDB: Very Large Data Bases
ICDE: Intl Conf on Data Engineering
CIKM: Intl. Conf on Information and Knowledge Management
ICDT: Intl Conf on Database Theory
Rank
2:
SSD: Intl Symp on
Large Spatial Databases
DEXA: Database and Expert System Applications
FODO: Intl Conf on Foundation on Data Organization
EDBT: Extending DB Technology
DOOD: Deductive and Object-Oriented Databases
DASFAA: Database Systems for Advanced Applications
SSDBM: Intl Conf on Scientific and Statistical DB Mgmt
CoopIS - Conference on Cooperative Information Systems
ER - Intl Conf on Conceptual Modeling (ER)
參考 http://www3.ntu.edu.sg/home/assourav/crank.htm
posted @
2009-09-25 00:02 wqwqwqwqwq 閱讀(277) |
評(píng)論 (0) |
編輯 收藏
摘要: That’s why I don’t want to hear people’s ideas.
I’m not interested until I see their execution.
閱讀全文
posted @
2008-08-11 11:21 wqwqwqwqwq 閱讀(1305) |
評(píng)論 (1) |
編輯 收藏
摘要: 這兩天在學(xué)習(xí)python,主要參考簡(jiǎn)明教程http://www.swaroopch.com/byteofpython/ , 入門很不錯(cuò),有興趣推薦參考。
在16章中,作者建議讀者寫一個(gè)地址簿程序,還記得寫它都是在大一學(xué)c語(yǔ)言的年代了,不過下午還是抽出了一點(diǎn)時(shí)間來寫這個(gè)程序,寫了兩個(gè)版本,一個(gè)是使用python 字典來存儲(chǔ)名字和地址,另一個(gè)版本則使用python的面向?qū)ο筇匦裕瑏礞準(zhǔn)酱鎯?chǔ)聯(lián)系人對(duì)象。
閱讀全文
posted @
2008-07-24 17:51 wqwqwqwqwq 閱讀(1561) |
評(píng)論 (3) |
編輯 收藏
摘要: 據(jù)說最近psp最近要升值了~無論是因?yàn)槠平獾脑蜻€是什么,但總之估計(jì)sony還是很難想到,當(dāng)然我們也很值得慶幸的是這幫hack的大牛已然將kvm,python stackless等移植到了psp平臺(tái),強(qiáng)大的ppc支持,可足以媲美幾年前的personal computer,這一點(diǎn)毋庸置疑,更不用去與手機(jī)平臺(tái)相對(duì)比了。
閱讀全文
posted @
2008-07-24 12:21 wqwqwqwqwq 閱讀(2508) |
評(píng)論 (4) |
編輯 收藏
摘要: org.eclipse.jface.viewers.TreeViewer
的繼承關(guān)系是
閱讀全文
posted @
2008-04-23 00:10 wqwqwqwqwq 閱讀(4857) |
評(píng)論 (3) |
編輯 收藏
目前 ext已經(jīng)全面升級(jí)了主站,而且也release2.1版本,并新增了一些例子。
最近發(fā)布的Firefox3 beta 5版本,個(gè)人認(rèn)為還是比較不錯(cuò),運(yùn)行JS的也更快、上網(wǎng)速度也快了很多。
但經(jīng)原來做的一些js程序測(cè)試,ext2.0版本運(yùn)行在FF3Beta5上還存在一些顯示問題。
posted @
2008-04-22 12:50 wqwqwqwqwq 閱讀(1464) |
評(píng)論 (1) |
編輯 收藏
摘要: 昨天寫了個(gè)關(guān)于圖庫(kù)的總結(jié)mail 在這貼下,以供參考,當(dāng)然望不吝賜教
閱讀全文
posted @
2008-04-21 18:09 wqwqwqwqwq 閱讀(1423) |
評(píng)論 (0) |
編輯 收藏
摘要: 前兩天寫了一個(gè)處理邏輯表達(dá)式的小程序,可以用來處理專家系統(tǒng)實(shí)事等邏輯關(guān)系表達(dá)式。
閱讀全文
posted @
2008-02-26 19:05 wqwqwqwqwq 閱讀(2593) |
評(píng)論 (2) |
編輯 收藏
摘要: EasyMock 是一套通過簡(jiǎn)單的方法對(duì)于指定的接口或類生成 Mock 對(duì)象的類庫(kù),它能利用對(duì)接口或類的模擬來輔助單元測(cè)試。本文將對(duì) EasyMock 的功能和原理進(jìn)行介紹,并通過示例來說明如何使用 EasyMock 進(jìn)行單元測(cè)試。
閱讀全文
posted @
2008-02-18 22:14 wqwqwqwqwq 閱讀(770) |
評(píng)論 (0) |
編輯 收藏
摘要: Craigslist的網(wǎng)站上沒有圖片,只有密密麻麻的文字,標(biāo)著各種生活信息,是個(gè)巨大無比的網(wǎng)上分類廣告加BBS的組合...
閱讀全文
posted @
2008-01-21 13:06 wqwqwqwqwq 閱讀(2538) |
評(píng)論 (0) |
編輯 收藏
posted @
2007-12-25 20:25 wqwqwqwqwq 閱讀(438) |
評(píng)論 (0) |
編輯 收藏
摘要: Trie樹是一棵度 m ≥ 2 的樹,它的每一層分支不是靠整個(gè)關(guān)鍵碼的值來確定,而是由關(guān)鍵碼的一個(gè)分量來確定。
閱讀全文
posted @
2007-12-13 20:07 wqwqwqwqwq 閱讀(1737) |
評(píng)論 (0) |
編輯 收藏
摘要: For myself learning.
Personal Mastery
閱讀全文
posted @
2007-12-09 18:28 wqwqwqwqwq 閱讀(1459) |
評(píng)論 (3) |
編輯 收藏
摘要: Have you read Jess In Action by Earnest J. Freedman-Hill? It's one of the better books out there on rule engines, though it does require some experience to get the most out of the book.
A variation on the bookstore could be recommendation engine. That would provide an opportunity to use a rule engine for direct matching on category/subcategory and aggregations.
閱讀全文
posted @
2007-11-29 10:42 wqwqwqwqwq 閱讀(984) |
評(píng)論 (5) |
編輯 收藏
摘要: IBM Dump Analyzer for Java是來分析虛擬機(jī)穩(wěn)定性的一種可擴(kuò)展框架。對(duì)Java虛擬機(jī)生成的產(chǎn)物進(jìn)行自動(dòng)診斷。
閱讀全文
posted @
2007-11-16 15:36 wqwqwqwqwq 閱讀(1246) |
評(píng)論 (1) |
編輯 收藏
摘要: 實(shí)在忍受不了sun的做事風(fēng)格和它的開發(fā)工具了,nb的beta6一踏糊涂一堆bug,唉~想著就想起來sun中國(guó)弄個(gè)nb插件的比賽不僅過程糟糕,獲獎(jiǎng)了居然還不兌現(xiàn)承諾,到現(xiàn)在也杳無音信,估計(jì)是證書也不想發(fā)了,真是讓大家對(duì)它越發(fā)感到?jīng)]有信心~~~~~~~~~不提這個(gè)了,還是講講Europa 和 myeclipse, 最近在寫一個(gè)基于規(guī)則的引擎,用的Europa 和myeclipse6 感覺非常舒服,myeclipse的功能也大大加強(qiáng)了比如改進(jìn)了javaEE5 提高了EJB3開發(fā)效率可以支持從數(shù)據(jù)模型到bean的轉(zhuǎn)換,java的持久化程度及其Spring-JPA的高度集成。開發(fā)ajax的朋友可以發(fā)現(xiàn) myeclipse對(duì)ajax的開發(fā)和測(cè)試做的也非常好,尤其是對(duì)js的調(diào)試。Web開發(fā)的另一個(gè)特點(diǎn)是支持RAD web。nb原來喊的一項(xiàng)特色是集成了matisse,在myeclipse目前也集成了它而且對(duì)于可視化swing開發(fā)非常方便,當(dāng)然你也可以自己按照,不直接更新。
myeclipse中集成的derby和tomcat也大大加速了服務(wù)器的連接和部署,調(diào)試等。至于db視圖個(gè)人使用oracle
閱讀全文
posted @
2007-11-11 15:11 wqwqwqwqwq 閱讀(2247) |
評(píng)論 (11) |
編輯 收藏
摘要: Given a picture composed entirely of horizontal and vertical line segments, calculate the minimum number of times you must lift your pen to trace every line segment in the picture exactly n times.
Each line segment will be of the form "
" (quotes for clarity), representing a segment from (x1,y1) to (x2,y2). Segments may cross each other. Segments may also overlap, in which case you should count the overlapping region as appearing in the drawing only once. For example, say t 閱讀全文
posted @
2007-10-30 21:36 wqwqwqwqwq 閱讀(1188) |
評(píng)論 (0) |
編輯 收藏
摘要: In most states, gamblers can choose from a wide variety of different lottery games. The rules of a lottery are defined by two integers (choices and blanks) and two boolean variables (sorted and unique). choices represents the highest valid number that you may use on your lottery ticket. (All integers between 1 and choices, inclusive, are valid and can appear on your ticket.) blanks represents the number of spots on your ticket where numbers can be written. 閱讀全文
posted @
2007-10-24 21:20 wqwqwqwqwq 閱讀(1205) |
評(píng)論 (1) |
編輯 收藏
摘要:
Let's say you have a binary string such as the following:
011100011
One way to encrypt this string is to add to each digit the sum of its adjacent digits. For example, the above string would become:
123210122 閱讀全文
posted @
2007-10-23 13:34 wqwqwqwqwq 閱讀(1055) |
評(píng)論 (1) |
編輯 收藏
摘要: People enjoy mazes, but they also get them dirty. Arrows, graffiti, and chewing gum are just a few of the souvenirs people leave on the walls. You, the maze keeper, are assigned to whiten the maze walls. Each face of the wall requires one liter of paint, but you are only required to paint visible faces. You are given a map of the maze, and you must determine the amount of paint needed for the job. 閱讀全文
posted @
2007-10-21 21:28 wqwqwqwqwq 閱讀(1460) |
評(píng)論 (1) |
編輯 收藏
摘要: In written languages, some symbols may appear more often than others. Expected frequency tables have been defined for many languages. For each symbol in a language, a frequency table will contain its expected percentage in a typical passage written in that language. For example, if the symbol "a" has an expected percentage of 5, then 5% of the letters in a typical passage will be "a". If a passage contains 350 letters, then 'a' has an expected count of 17.5 for that passage (17.5 = 350 * 5%). Pl 閱讀全文
posted @
2007-10-21 20:14 wqwqwqwqwq 閱讀(917) |
評(píng)論 (1) |
編輯 收藏