Skip to main content

给Dell Latitude D610安装Ubuntu 5.10

Ubuntu 5.10是我认为现在对于个人用户,日常开发使用最合适和优秀的linux distribution。 自身的软件库已经非常全面和方便。像firfox的mplayer plugin, java-plugin这种东西都已经有了现成的包可以用apt直接安装。

在给一些SATA硬盘的台式机安装ubuntu时可能你会遇到一些问题。比如在Dell Dimension 3100, Compaq Presario SR1030z上不管是ubuntu breezy还是hoary, 还是任何debian的linux, 都看不到硬盘。但Dell Dimension 4700使用的是一样的硬盘,却可以被安装程序识别。

安装breezy到D610非常容易。默认安装一路冲到底就差不多了,应该只有LCD的分辨率会有点小问题,因为D610的最大分辨率是不标准的1400x1050。 下面的包可以直接用apt-get安装,在别的linux里这些通常要自己手动搞一搞。

915 resolution可以解决D610非标准的分辨率问题。可以下载安装他的debian包,执行"915resolution -l",选一个你不会用的分辨率(我选的是3c, 1600x1200x8), 执行 "915resolution 3c 1400 1050 32"用你想要的分辨率覆盖不用的分辨率。然后restart gdm或者kdm服务。

如果你想让他每次启动自动执行,可以做一个比gdm早启动的service, 或者把"/usr/sbin/915resolution 3c 1400 1050 32"这句加到/etc/init.d/gdm里面。


Popular posts from this blog

Spring, Angular and other reasons I like and hate Bazel at the same time

For several weeks I've been trying to put together an Angular application served Java Spring MVC web server in Bazel. I've seen the Java, Angular combination works well in Google, and given the popularity of Java, I want get it to work with open source. How hard can it be to run arguably the best JS framework on a server in probably the most popular server-side language with  the mono-repo of planet-scale ? The rest of this post walks through the headaches and nightmares I had to get things to work but if you are just here to look for a working example, github/jiaqi/angular-on-java is all you need. Java web application with Appengine rule Surprisingly there isn't an official way of building Java web application in Bazel, the closest thing is the Appengine rule  and Spring MVC seems to work well with it. 3 Java classes, a JSP and an appengine.xml was all I need. At this point, the server starts well but I got "No

Wreck-it Ralph is from Chicago?

Hotel Felix in Chicago   The building of Fix-it Felix Jr.  

Project Euler problem 220 - Heighway Dragon

This document goes through a Java solution for Project Euler problem 220 . If you want to achieve the pleasure of solving the unfamiliarity and you don't have a solution yet, PLEASE STOP READING UNTIL YOU FIND A SOLUTION. Problem 220 is to tell the coordinate after a given large number of steps in a Dragon Curve . The first thing came to my mind, is to DFS traverse a 50 level tree by 10^12 steps, during which it keeps track of a direction and a coordinate. Roughly estimate, this solution takes a 50 level recursion, which isn't horrible, and 10^12 switch/case calls. Written by a lazy and irresponsible Java engineer, this solution vaguely looks like: Traveler traveler = new Traveler(new Coordinate(0, 0), Direction.UP); void main() { try { traverse("Fa", 0); } catch (TerminationSignal signal) { print signal; } } void traverse(String plan, int level) { foreach(char c:plan) { switch(c) { case 'F': traveler.stepForward(); break; ca