我们还有多长的路要走

最近在搞hsqldb(一个著名的内存数据库 http://hsqldb.sourceforge.net)的相关开发, 无意中浏览了hsqldb的开发人员,贴出来让大家也瞧一瞧

User Name:
boucherb

Resume:
Campbell Boucher-Burnet

Born: Oct 9, 1961
Height: 6'1".
Eyes: grey/w green/blue
Hair: dirty blonde
Build: Athletic (for a programmer). 220 lb.

1975-80

Obtained an Altair machine.

Learned 8080 Assembler, Altair 8080 operation, PDP 11 programming, HP Basic and card/tape-based batch processing on my Highschool's HP Minicomputer. Did personal projects and work for my highschool (HP batch programming)

1980-85

Learned Basic, Lisp, Forth, Pascal, Intel Assembler, C/C++.

Attended college and received Applied Scientific Computing diploma.

Worked for Continental Carlisle Douglas Investement Brokers for several years.

1985-1990

Bought a Sinclair Z80 machine.

Did independent Amiga/IBM PC/Macintosh programming.

Bought an Amiga 1000.

Did commercial Dbase programming for small business.

Co-founded Animattic Video Productions Inc.

Bought second Amiga (2000)

Built a 25 MHz 68030 daughter card for second Amiga.

Developed Amiga device drivers for controlling 3/4" UMatic Video recorders, Sony BetaMax commercial-grade cameras, and video switching devices.

Wrote Amiga AREXX glue for coordinating Deluxe Music Construction Set, several multimedia, video, and image editing programs, Imagine raytracing engine, an Amiga 8MB framebuffer addon, a custom storyboarding database that I wrote, and single frame recording through the UMatic device drivers I developed.

Worked as a retail salesperson for one year.

Worked as a retail manager for 1 1/2 years.

1991-1995

Moved to a different city.

Worked as a shipper/receiver

Worked as an inventory controller

Bought first IBM PC compatible computer (Dell XPS 120c).

Learned AutoCAD and AutoLISP.
Learned 3DStudio Max
Leaned Adobe Photoshop
Leaned Adobe Premier
Learned TrueSpace
Learned Microsoft Office and Visual Basic for Applications
Learned Micorsoft Access
Learned Microsoft Internet Information Server
(including Active Server Pages)
Learned Microsoft SQL Server
Learned Microsoft FrontPage
Learned Microsoft Visual Studio EE (C/C++, J++, FoxPro, etc)
Learned HTML/JavaScript/CSS/Applets
Learned many other Win32-based web development systems and software packages.

1996-2000

Attended university in the faculty of science toward a degree in computer science /w math minor.

Bought second IBM PC compatible computer (Dell XPS D333)

Founded Camco & Associates Consulting sole proprietership.

Worked for local government as a programmer/business analyst/technical writer.

Learned Oracle 7/8, including PL/SQL.

Learned HP/UX shell programming and administration, including Oracle 7.x on HP/UX administration.

Learned Sybase PowerBuilder 5, 6.x, and 7, including Powerbuilder Foundation Class (PFC) framework and SuperClass! framework.

Learned Sysbase Enterprise Application Studio and other Sybase products, including:
- PowerSite
- PowerDynamo
- PowerDesigner
- DataArchitect Suite
- O'Reilly WebSite
- Sybase EAServer (Jaguar CTS)
- ObjectCycle versioning system
- Watcom C/C++
- SQL Anywhere

Successfully completed Sysbase courses:
- Mastering Datawindows
- Building Object-Oriented Applications in PowerBuilder

Wrote requirements spec for forms<->database automation module of Dept. of Highways Property Services Information system (PSIS).

Performed PSIS upgrade/maintenance work for several years.

Performed all client consultation, wrote requirments specs, created client software, back-end database software (PL/SQL), and historical data conversion designs, implemented and rolled out designs for Saskatchewan Dept. of Highways Motor Carrier Offence List system (MCOL). Project passed peer review.

Handled all aspects, ranging from client interviews and requirments gathering/specification to design and implementation, for developmenet of Saskatchewan Dept. of Highways Engineering Division Gravel Inventory and Crush Simulation OLTP/OLAP system. Project passed peer review and is in production to present.

Wrote requirments specification for new interface between Saskatchewan Dept.of Justice Land Titles sytem (JAIN) and Saskatchewan Dept. of Highways Property Services Information system (PSIS). Interface was successfully implemented by another consultant, based on my specification.

Learned Java, JFC, and J2EE
Learned Linux/UNIX administration and shell programming.
Learned Perl.
Learned PHP, including a number of PHP IDEs.
Learned openSSL/openSSH,
Learned Netbeans/Forte4J IDE
Learned Oracle JBuilder IDE
Learned Oracle 8i
Learned Apache/Jakarta Tomcat
Learned Cinema 4D XL 5 and 6
Learned Alias|Wavefront Maya 2.
Learned Cakewalk 8/9
Learned Finale 97/2000
Learned CoolEdit 98/2000
Learned Cubase 3/5

Became involved with Bennettarts.com as a web developer with Senzai Corp, the research branch of Bennettarts.com.

Performed maintenance and configuration of sites in the technozone.com family.

2000-2003

Bought a third IBM PC compatible computer.

Upgraded my original Dell XPS 120c computer by installing a new motherboard, power supply, 30 GB 7200RPM hard drive, 500 MHz Athlon, and 512MB SDRAM.

Wired my home with an 8 port ethernet hub and ethernet ports set up in various locations throughout the house. The network currently has five stations, being my three computers plus my sons' and my wifes' computers, all of which I administer.

Developing Java wrapper of DynAPI.
Developing Java JNDI<->hsqldb Adapter.
Developing Java JOS targeted applications and services.
Developing 100% in memory Java 1.1 compliant Applet-based web-desktop using concepts from DynAPI, JNDI, hsqldb, and JOS.
Developing Java J2EE Applications.
Developing Oracle WebDB and IFS applications.
Increasing involvement with HSQLDB, including development and contribution of full DatabaseMetaData facility

Became Core HSQLDB Member

Contributed parametric statement precompilation facility for HSQLDB, achieving 2-3 X performance boost for certain classes of statement.

2003 - present

Returned to work for Gov't of Saskatchewan Corportate Information Services, supporting and developing applications for Dept. of Highways and Dept. of Agriculture & Foods.

Contributing Java Management Extentions framework for HSQLDB

Contributing RA optimizations for HSQLDB

Researching alternate join strategy implementations for HSQLDB.

Skill Inventory

SkillLevelExperience
3100 SQLCompetent> 10 years
3110 C/C++Competent> 10 years
3120 PerlCompetent2 yr - 5 yr
3130 PHPCompetent2 yr - 5 yr
3140 JavaCompetent5 yr - 10 yr
3900 Other Prog. Lang.Competent> 10 years
7100 UNIX AdminCompetent2 yr - 5 yr
7110 NetworkingCompetent5 yr - 10 yr
7120 SecurityCompetent2 yr - 5 yr
7130 WritingCompetent> 10 years
7140 EditingCompetent> 10 years
7150 DatabasesCompetent> 10 years
7900 Other Skill AreaCompetent> 10 years
3160 Visual BasicCompetent5 yr - 10 yr
3180 UMLCompetent2 yr - 5 yr
3200 HTML/DHTMLCompetent5 yr - 10 yr
3210 XML/XPath/XLink/XSL/XSLTCompetent6 Mo - 2 yr
7160 Object Oriented DesignCompetent> 10 years
7170 Object Oriented AnalysisCompetent> 10 years
3240 LISPCompetent> 10 years
3250 DelphiCompetent5 yr - 10 yr
3260 ASPCompetent5 yr - 10 yr
3310 RubyWant to Learn< 6 Months

看完了吧,有什么感觉?反正我是大受震撼,这位老兄已经40多岁了,只是hsqldb中一个普通的developer,看看他的职业生涯,他的丰富经历,可以想象到美国IT业的雄厚积累,国人想有所突破,想超越,必须要静下心来,踏踏实实,一步一个脚印的走下去,千万不能浮躁。

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
### 回答1: 题目描述: 某校大门外长度为l的马上有一排树,每两棵相邻的树之间的间隔都是1米。我们可以把马看成一个数轴,马的一端在数轴的位置,另一端在l的位置;数轴上的每个整数点,即,1,2,……,l,都种有一棵树。 由于马上有一些区域要用来建地铁。这些区域用它们在数轴上的起始点和终止点表示。已知任一区域的起始点和终止点的坐标都是整数,区域之间可能有重合的部分。现在要把这些区域中的树(包括区域端点处的两棵树)移。你的任务是计算将这些树都移后,马上还有多少棵树。 解题思: 首先,我们可以将所有要移的树的位置都标记出来,然后再遍历整个马,计算没有被标记的树的数量即可。 代码实现: ### 回答2: 首先,我们可以将每个区域内的树都移,这可以通过计算每个区域的长度(终止点坐标减去起始点坐标再加1)来得到。接着,需要判断每个区域的边界处是否还有树,如果有,则将其移。最后,数轴上剩余的树的数量就是答案。 具体实现上,可以使用一个长度为l+1的数组表示数轴上的每个点是否有树。首先,将数组中所有位置的值初始化为1,即都种有树。然后,遍历每个区域,将区域内的位置的值设为0,表示这些树已经被移了。接着,遍历每个区域的边界处,判断是否有树,并将其移。遍历完成后,数组中值为1的位置的数量就是剩余的树的数量。 代码实现: int main() { int l, n; int start, end; cin >> l >> n; int* road = new int[l+1]; memset(road, 1, (l+1)*sizeof(int)); //初始化,1表示该位置有树 for (int i = 0; i < n; i++) { cin >> start >> end; for (int j = start; j <= end; j++) { road[j] = 0; //移该区域内的树 } if (road[start-1] == 1) { road[start-1] = 0; //移该区域左边的树 } if (road[end+1] == 1) { road[end+1] = 0; //移该区域右边的树 } } int count = 0; for (int i = 0; i <= l; i++) { if (road[i] == 1) { count++; //计算剩余的树的数量 } } cout << count << endl; return 0; } ### 回答3: 这道题可以通过计算要移除掉的树的数量,来求出剩余树的数量。我们可以先将要移除掉的区间保存到一个数组中,然后遍历这个数组,在遍历的过程中计算出要移除的树的数量。最后用总树的数量减去移除的树的数量,即可得到剩余树的数量。 具体实现步骤如下: 1. 定义变量l和n,分别表示马的长度和树的数量。此时n=l+1,因为每个整数点上都有一棵树。 2. 定义一个数组broken_intervals,存储要移除的区间。数组中的每个元素包含两个整数,表示该区间的起始点和终止点。 3. 遍历数组broken_intervals,计算出要移除的树的数量total_broken_trees。对于每个区间,我们可以先将其起始点和终止点都减去1,然后再将它们之间的距离加上1(因为区间端点处的两棵树也要被移除)。最后将每个区间上要移除的树的数量相加即可得到total_broken_trees。 4. 将总树的数量n减去total_broken_trees,即为剩余树的数量。 完整代码如下: ```python l = 10 # 马的长度 n = l + 1 # 树的数量,每个整数点上都有一棵树 broken_intervals = [(2, 5), (7, 8)] # 要移除的区间 total_broken_trees = 0 # 要移除的树的数量 for start, end in broken_intervals: distance = end - start + 1 # 区间的长度 total_broken_trees += distance # 将区间上要移除的树的数量相加 remaining_trees = n - total_broken_trees # 剩余树的数量 print(remaining_trees) ``` 输出结果为:6。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值