Review of 2008

過去的一年裡，對我來說算是人生中極有特殊意義的一年。為什麼?
  • 初為人父，小朋友到來的那天，我經歷了相當大的起與落
  • 一度失業，只覺得倒楣
  • 再度失業，但這次有被騙的感覺
  • "家家有本難唸的" 經，修鍊中，進度極緩慢
  • 很多技術面的東西似乎有融會貫通，更上一層的感覺
對於家庭，我的心得是 "用心"。很多事都是生平頭一遭，初面對時的甘苦，只能意會不能言傳。所以，只能用心體會、用心感受並且用心經營。這種事不是三言兩語就能打發的，我只能拼命的吸收日 (前人的經驗) 月 (旁觀者的看法) 精華，期待自己更茁壯，更有智慧去處理可能面對的任何狀況。

對於工作，我的心得是 "需要再磨鍊"。技術當然需要磨鍊，所謂 "工欲善其事，必先利其器"，這是一定要的。我更需要的是 -- "人" 的磨鍊。雖然我的個人特質強烈的顯示，我不適合接觸 "人" 的工作，但，看來是免不了的。

去年的一年，我算是經歷了很大的轉折，小朋友帶來了很大的轉變。和以往比起來，觀念、家庭、工作上都有很大的差異。當然，外型也有些許變化，例如，變 "中廣" 了，白頭髮增加了，...。

總而言之，喜樂參半。

發表本篇的同時，再轉頭看看熟睡的內子與兒子，心中的感覺已不可同日而語了。

願　新的一年，平平順順，健健康康，平平安安，和和樂樂

以上。

Comments

Post a Comment

Popular posts from this blog

How to show only month and year fields in android Date-picker?

Image
Android default DatePicker show day/month/year fields but you have to customize this DatePicker as your requirements. Suppose that you want to show only month and year fields in android datepicker . To do this, you have to customize the Dialog DatePicker source code but it is not an easy task. In this tutorial I will show you a tricky way to solve this problem. Lets see how to show only month and year field in android DatePicker as a dialog.   Step to show only month and year fields in android date-picker: Some days ago I got this same problem and here I am trying to explain this in a sequential manner. I want to show a dialog datepicker when user click on an EditText. So if user click on EditText, A dialog datepicker will be invocked and it will show only month and year fields. To do this, at first we have to create a xml layout to hold the EditText fields. So create an android project and name it DatePickerExample. In the main.xml file just try to write this simple code....
Read more

How to construct a B+ tree with example

Image
A B+ tree contains n-1 search key values K1K2…….Kn-1 and have n pointers.   In a B+ tree the data are ordered  sequentially.  The leaf node may hold up to n pointers and must hold at least N/2 pointers. The root node must hold at least two pointers, unless the tree consists of only one node.  Now we construct a B+ tree. Construct a B+ tree for the following set of key values: (2,3,5,7,11,17,19,23,29,31) Assume that the tree is initially empty and values are added in ascending order. Construct a B+ tree where the pointer number is Four. Solution: When a node exceeds n-1 search key value then we split it into two nodes. First node contains (ceiling(n-1)/2) values.  2 nd node contains remaining node. Copy the smallest search key value of the second node to the parent node. Let's start, we know each node has N pointer and has N-1 search key values. In our example pointer number is 4, so the search key value is 4-1=3. So each node has 4 pointers and 3 search key val...
Read more

Conflict Serializability in database

Image
To maintains database state consistency we introduce serializability. Using serializability we can understand which schedule will ensure consistency, and which schedule will not. When we are capable of converting a concurrent schedule into a serial schedule then we cal it serializable schedule. A schedule is serializable if it is equivalent to a serial schedule. We divided this concepts into two parts 1. Conflict serializability  & 2. View serializability In this discussion I just clarify you the conflict serializability. Consider two instruction read, write and the data item A and B. When two instruction execute different data item such as read(A) and read(B), then we can swap the instruction without affecting the result of the schedule. But when the data item is equivalent to one another we need to consider following four condition.    a.   read (A ),    read ( A ).   they   don’t conflict.    b.   read ( Q),  ...
Read more