Scheduled shutdown on Windows 2003 server

由於最近經常碰到停電的狀況，因此有了這樣的需求，特別花了時間去試了一下。

作法如下：

1. 開啟 "記事本"，輸入如下的內容並存成 shutdown.bat。當然，請將它存在你設定的路徑下。

shutdown.exe -s

2. 開啟 "附屬應用程式" > "系統工具" > "排定的工作"。

3. 點選 "新增排定的工作" > 下一步 > 選取應用程式，請指定 shutdown.bat > 輸入工作名稱並指定工作的執行方式 > 指定開始時間及開始日期 > 輸入使用者名稱及其密碼，請輸入管理者的帳號和密碼 > 完成。

4. 檢視該工作設定的內容 > 切換至 "設定" 分頁 > 請將 "電源管理" 區塊中的前兩項取消並勾選第三項 > 確定。

5. 登出系統。

照著以上的步驟，就可以正確的完成設定並讓系統在指定時間條件下進行關機。請注意第 4 點的紅字部份若未照做，系統就沒辦法在登出後正確關機！

同理，若想要做定時重新開機，也可如法炮製，變更工作執行的方式即可達成目的。

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