順著天賦做事，逆著個性做人

我是個很幸運的人，因為我經常遇到貴人，不管這些貴人們曾經如何對我，我總能直接或間接的從他們身上汲取到一些經驗! 對此，我也由衷的感謝! 當然，標題的這句話也是從貴人們身上獲得的寶貴經驗!

最近我常會想起這句話，"順著天賦做事，逆著個性做人"，從字面上解釋，就是發揮自己的長才，修飾或隱藏自己在個性上的缺點，使得為人處事都能圓滿! 或許會有人說，那不就是偽裝? 虛偽? 其實不盡然。

舉例來說，我的專長就是溝通，所以，我就應該好好發揮這個長處，使得人、事、物得以透過溝通、協調進而圓滿! 這就是 "順著天賦做事"!

而我的個性其實很懶散，從小被管到大的我，很討厭被約束，我也很討厭去約束別人! 因為 "己所不欲，勿施於人"! 但，當我的工作付予任務，即時有千百個不願意，為了工作，為了群體利益，我就會壓抑著自己在個性上的特質，想辦法去完成任務! 這就是 "逆著個性做人"!

當然，有人曾經問我，"何苦來哉? 這樣對待自己能有什麼好處?" 剛開始我總會試著去說明，後來就只是笑著不回應了。乍看之下，這樣做的確對自己沒什麼好處，做得汗流浹背，別人嫌到口水亂噴!

我的理由如下:
  1. 對自己負責，也對工作有交待，心安理得。
  2. 如果事情能順利做完，也對群體有正面的助益，雖然知道會很苦，何不試著樂觀面對? 做起來也開心。
  3. 有些事，在當下會很苦、很難熬! 但，咬牙撑過後，反而會有一番不同的感受，結果，我又成長了。
過往的歷練也驗證了這句話的價值! 我因為這句話，受益不少! 至少，當別人在批評草莓世代時，我很慶幸自己的抗壓性在不同階段都能每況愈上! 只是我還是沒有做得很好! 至少，目前還是! 還需要多努力、多加油!

謹以此文引以為愓!

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