" HAMTARO SI PENYAYANG "

SINOPSIS CERITA

Cerita ini mengisahkan Hamtaro dari Planet Zorro, bersiar-siar melihat keindahan alam semestra dengan menaiki kapal angkasa. Dalam melihat keindahan alam semestra, kapal angkasa Hamtaro mengalami masalah pada enjin kapalnya, lalu terdampar di sebuah planet yang di panggil "BUMI". Di bumi, Hamtaro terhempas di sebuah negara Tokyo.Hamtaro keliru dengan suasana yang berlainan bagi dirinya serta terpegun dengan keindahan di sekitar Tokyo, dalam berjalan-jalan melihat keindahan sebuah bandaraya Tokyo, Hamtaro terpandang geng budak jahat yang tengah memukul budak itu serta mengugutnya. Hamtaro tidak sampai hati melihat budak itu di pukul oleh budak jahat itu, lalu Hamtaro menggunakan kuasa saktinya untuk menyelamatkan budak yang bernama Zack itu. Geng tersebut tertumpas, Zack keliru dan tidak faham macam mana kejadian itu boleh berlaku lalu dia beredar dari situ, Hamtaro mengekorinya. Zack balik kerumahnya, sampai sahaja di biliknya, Zack baring di atas katil sambil memikirkan bagaimana kejadian tadi boleh berlaku. Hamtaro mengekorinya hingga ke bilik lalu bersembunyi di sebuah kotak kasut kerana tidak tahan dengan bau kotak tersebut, Hamtaro terbersin. Zack tergaman apabila kotak itu bergerak-gerak,lalu Zack mengambil pemukul bola besbol dan menuju ke kotak tersebut. Zack membuka kotak itu, lalu ternampak makluk yang tidak pernah di lihatnya sebelum ini, Zack terkejut lalu menjauhi makluk tersebut. Hamtaro mendekati Zack dan cuba untuk berbaik-baik dengan memperkenalkan diri dan tempat asalnya. Lama-kelamaan Zack faham akan kejadian yang menimpa Hamtaro lalu Zack memperkenalkan dirinya kepada Hamtaro. Sejak hari itu, Zack dan Hamtaro telah menjadi sahabat baik dan Zack mengajar Hamtaro untuk sesuaikan diri dengan suasana yang asing bagi Hamtaro dan memahami antara satu sama lain.

WATAK DAN CIRI-CIRI

u Hamtaro Si Penyayang

u Dari Planet Zorro

u Cute, Comel

u Sanggup mengambil berat mengenai rakannya, Zack

u Mempunyai kuasa sakti

SASARAN

Sasaran dari cerita "Hamtaro Si Penyayang" ialah dari golongan semua peringkat umur tidak kira pelajar-pelajar sekolah, kolej, atau universiti, budak-budak serta orang-orang muda serta tua. Cerita Hamtaro ini menarik kerana watak Hamtaro yang comel bersama rakannya, Zack.

MESEJ CERITA  

Cerita Hamtaro ini banyak memberikan teladan dan pengajaran kepada para penonton yang melihat cerita ini seperti membantu rakan-rakan yang berada dalam kesusahan, menghormati orang tua, jangan bongkah atau sombong yang akan memakan diri sendiri serta berusaha untuk mencapai sesuatu kejayaan.

STEPS FORMAT WINDOWS XP

Part 1: Begin the installation

1.	Insert the Windows XP CD into your computer and restart your computer.
2.	If prompted to start from the CD, press SPACEBAR. If you miss the prompt (it only appears for a few seconds), restart your computer to try again.
3.	Windows XP Setup begins. During this portion of setup, your mouse will not work, so you must use the keyboard. On the Welcome to Setup page, press ENTER.
4.	On the Windows XP Licensing Agreement page, read the licensing agreement. Press the PAGE DOWN key to scroll to the bottom of the agreement. Then press F8.
5.	This page enables you to select the hard disk drive on which Windows XP will be installed. Once you complete this step, all data on your hard disk drive will be removed and cannot be recovered. It is extremely important that you have a recent backup copy of your files before continuing. When you have a backup copy, press D, and then press L when prompted. This deletes your existing data.
6.	Press ENTER to select Unpartitioned space, which appears by default.
7.	Press ENTER again to select Format the partition using the NTFS file system, which appears by default.
8.	Windows XP erases your hard disk drive using a process called formatting and then copies the setup files. You can leave your computer and return in 20 to 30 minutes. Part 2: Continue the installation
9.	Windows XP restarts and then continues with the installation process. From this point forward, you can use your mouse. Eventually, the Regional and Language Options page appears. Click Next to accept the default settings. If you are multilingual or prefer a language other than English, you can change language settings after setup is complete.
10.	On the Personalize Your Software page, type your name and your organization name. Some programs use this information to automatically fill in your name when required. Then, click Next.
11.	On the Your Product Key page, type your product key as it appears on your Windows XP CD case. The product key is unique for every Windows XP installation. Then, click Next.
12.	On the Computer Name and Administrator Password page, in the Computer name box, type a name that uniquely identifies your computer in your house, such as FAMILYROOM or TOMS. You cannot use spaces or punctuation. If you connect your computer to a network, you will use this computer name to find shared files and printers. Type a strong password that you can remember in the Administrator password box, and then retype it in the Confirm password box. Write the password down and store it in a secure place. Click Next.
13.	On the Date and Time Settings page, set your computer’s clock. Then, click the Time Zone down arrow, and select your time zone. Click Next.
14.	Windows XP will spend about a minute configuring your computer. On the Networking Settings page, click Next.
15.	On the Workgroup or Computer Domain page, click Next. Part 3: Complete the installation
16.	Windows XP will spend 20 or 30 minutes configuring your computer and will automatically restart when finished. When the Display Settings dialog appears, click OK.
17.	When the Monitor Settings dialog box appears, click OK.
18.	The final stage of setup begins. On the Welcome to Microsoft Windows page, click Next.
19.	On the Help protect your PC page, click Help protect my PC by turning on Automatic Updates now. Then, click Next.
20.	Windows XP will then check if you are connected to the Internet: • If you are connected to the Internet, select the choice that describes your network connection on the Will this computer connect to the Internet directly, or through a network? page. If you’re not sure, accept the default selection, and click Next. • If you use dial-up Internet access, or if Windows XP cannot connect to the Internet, you can connect to the Internet after setup is complete. On the How will this computer connect to the Internet? page, click Skip.
21.	Windows XP Setup displays the Ready to activate Windows? page. If you are connected to the Internet, click Yes, and then click Next. If you are not yet connected to the Internet, click No, click Next, and then skip to step 24. After setup is complete, Windows XP will automatically remind you to activate and register your copy of Windows XP.
22.	On the Ready to register with Microsoft? page, click Yes, and then click Next.
23.	On the Collecting Registration Information page, complete the form. Then, click Next.
24.	On the Who will use this computer? page, type the name of each person who will use the computer. You can use first names only, nicknames, or full names. Then click Next. To add users after setup is complete or to specify a password to keep your account private, read Create and customize user accounts.
25.	On the Thank you! page, click Finish.

protection and security concept.

security
Security software is available in many forms. For users who intend to surf the Internet, antivirus software is the basic software should be owned. This antivirus software will scan every file sent and received from the internet to check the probability of a virus. Two major antivirus software suppliers are Norton and McAfee. both the supplier has a good reputation in the international market. To remain effective, antivirus software should be updated often because many viruses are created every day. The virus enters the operating system when it successfully invades undetected.
protection

Addition of firewall system is a personal choice. This system will provide another layer of added protection when users on the Internet. Each program must obtain permission from the firewall to the computer to send and receive any information that comes from the Internet. Computer firewall can be modified, allowing users to allow any program that they can trust. For programs that do not know the origin, Firewall will block any action by any of these programs to seek permission from the user.

protection and security concept.

Protection  concepts

The aim of the concept of computer virus protection is to create suitable safeguards with which the occurrence of computer viruses in the IT systems of an organisation can be prevented or detected as early as possible. In this way, countermeasures can be taken and possible damage can be minimised. In the protection against computer viruses it is essential that the safeguards are consistently adhered to and that technical countermeasures are constantly updated. This requirement is due to the continual occurrence of new computer viruses or variants of viruses. The development of operating systems, programming languages and application software may also provide opportunities for computer viruses to attack. This should therefore be taken into account and suitable countermeasures should be taken.

Security concepts

Certain concepts recur throughout different fields of security:

Assurance - assurance is the level of guarantee that a security system will behave as expected

Countermeasure - a countermeasure is a way to stop a threat from triggering a risk event

Defense in depth - never rely on one single security measure alone

Exploit - a vulnerability that has been triggered by a threat - a risk of 1.0 (100%)

Risk - a risk is a possible event which could cause a loss

Threat - a threat is a method of triggering a risk event that is dangerous

Vulnerability - a weakness in a target that can potentially be exploited by a threat security

7.1Recognize security policy and mechanism.

Protection mechanisms

In computer science, protection mechanisms are built into a computer architecture to support the enforcement of security policies. A simple definition of a security policy is "to set who may use what information in a computer system.

·         a mechannism for controlling the access of programs, processes, or users the resources defined by the computer system.

·         the protention mechanism ensures the enforcement of a certain policy.

·         policy is established in several ways:

ü      system design.

ü      system management.

ü      user defined.

Security in computer system

·         security is an enternal operating systems problem-providing controlled access to programs and data stored in the computer

·         security is mainly focused on malicious behavior of entities external to the system,affecting computer assets:

ü      software.

ü      data

ü      Hardware

Software  mechanism

A compatibility mode is a software mechanism in which a computer's operating system emulates an older processor, operating system, and/or hardware platform in order to allow obsolete software to remain compatible with the computer's newer hardware or software.

Hardware mechanisms that protect computers and data

Hardware based or assisted computer security offers an alternative to software-only computer security. Devices such as dongles may be considered more secure due to the physical access required in order to be compromised.

Security Policy

A computer security policy defines the objectives and elements of computer system organization. This definition is very formal or regular informal. Security policy enforced by organizational policy or security mechanisms. A technical implementation of defining what a computer system is not secure or safe.

Elaborate authentic basic.

password

A password is a secret word or string of characters that is used for authentication, to prove identity or gain access to a resource (example: an access code is a type of password). The password should be kept secret from those not allowed access.

Artifact

In natural science and signal processing, an artifact is any error in the perception or representation of any visual or aural information introduced by the involved equipment or technique(s).[1]

In computer science, digital artifacts are anomalies introduced into digital signals as a result of digital processing.

In microscopy, artifacts are sometimes introduced during the processing of samples into slide form. See Artifact (microscopy)

Biometric

Biometrics consists of methods for uniquely recognizing humans based upon one or more intrinsic physical or behavioral traits. In computer science, in particular, biometrics is used as a form of identity access management and access control. It is also used to identify individuals in groups that are under surveillance.

Elaborate protection concept and access control.

File systemt management

File systems and operating systems Most operating systems provide a file system, as a file system is an integral part of any modern operating system. Early microcomputer operating systems' only real task was file management — a fact reflected in their names (see DOS). Some early operating systems had a separate component for handling file systems which was called a disk operating system. On some microcomputers, the disk operating system was loaded separately from the rest of the operating system. On early operating systems, there was usually support for only one, native, unnamed file system; for example, CP/M supports only its own file system, which might be called "CP/M file system" if needed, but which didn't bear any official name at all.

Because of this, there needs to be an interface provided by the operating system software between the user and the file system. This interface can be textual (such as provided by a command line interface, such as the Unix shell, or OpenVMS DCL) or graphical (such as provided by a graphical user interface, such as file browsers). If graphical, the metaphor of the folder, containing documents, other files, and nested folders is often used (see also: directory and folder).

Sharing file

File sharing is the practice of distributing or providing access to digitally stored information, such as computer programs, multi-media (audio, video), documents, or electronic books. It may be implemented through a variety of ways. Storage, transmission, and distribution models are common methods of file sharing incorporate manual sharing using removable media, centralized computer file server installations on computer networks, World Wide Web-based hyperlinked documents, and the use of distributed peer-to-peer networking (see peer-to-peer file sharing).

peer-to-peer file sharing

Users can use software that connects in to a peer-to-peer network to search for shared files on the computers of other users (i.e. peers) connected to the network. Files of interest can then be downloaded directly from other users on the network. Typically, large files are broken down into smaller chunks, which may be obtained from multiple peers and then reassembled by the downloader. This is done while the peer is simultaneously uploading the chunks it already has to other peers.

File map

MAP files are a type of debugging symbol.

These are typically plain text files that indicate the relative offsets of functions for a given version of a compiled binary.

Image Maps Another Form of the .MAP file is for HTML image maps. An image map is formatted in HTML and creates click-able areas over an provided image.

Block index

Index locking is a technique utilized to maintain index integrity. A portion of an index is locked during a database transaction when this portion is being accesses by the transaction as a result of attempt to access related user data. Also special database system's transactions (not user invoked transactions) may be invoked to maintain and modify an index, as part of a system's self-maintenance activities. When a portion of index is locked by a transaction, other transactions may be blocked from accessing this index portion (blocked from modifying, and even from reading it, depending on lock type and needed operation).

Specialized concurrency control techniques exist for accessing indexes. These techniques depend on the index type, and take advantage of its structure. They are typically much more effective than applying to indexes common concurrency control methods applied to user data. Notable and have been widely researched are specialized techniques for B-trees (B-Tree concurrency control which are regularly utilized as database indexes.

Index locks are used to coordinate threads accessing indexes concurrently, and typically shorter-lived than the common transaction locks on user data. Often they are called in the professional literature latches

Management Data Input/Output

Management Data Input/Output, or MDIO, is a serial bus defined for the Ethernet IEEE 802.3 specification for Media Independent Interface, or MII. The MII connects Media Access Control (MAC) devices with physical bus interface, or PHY, circuits. The MII comprises:

a data interface to the Ethernet link and a management interface, referred as MDIO or as Media Independent Interface Management (MIIM).

The MDIO bus provides access to the configuration & status registers of each PHY. These registers are used to initially configure each PHY and also to monitor status during operation

Buffering

a buffer is a region of memory used to temporarily hold data while it is being moved from one place to another. Typically, the data is stored in a buffer as it is retrieved from an input device (such as a Mouse) or just before it is sent to an output device (such as Speakers). However, a buffer may be used when moving data between processes within a computer. This is comparable to buffers in telecommunication. Buffers can be implemented in either hardware or software, but the vast majority of buffers are implemented in software. Buffers are typically used when there is a difference between the rate at which data is received and the rate at which it can be processed, or in the case that these rates are variable, for example in a printer spooler or in online video streaming.

A buffer often adjusts timing by implementing a queue (or FIFO) algorithm in memory, simultaneously writing data into the queue at one rate and reading it at another rate.

MEMORY MANAGEMENT

Concept memory management

A user context is held in extended memory. The page management of this memory as a stack is carried out directly by the R/3 System, not by the host operating system. This extended memory is implemented as an anonymous (unnamed) mapped file.

That is, the address space is mapped onto the operating system paging file or swap space. For more information, please see the man page for mmap (UNIX implementations) or the topics "Create File Mapping" and "Map View of File" for Microsoft Windows NT.
At a context switch, the extended user context is not copied (in contrast to the roll area) but is assigned to different work processes by way of mapping operations. As a consequence, the size of the roll area can be reduced. The result is a faster context switch because less data is copied and because the effort required for mapping the extended storage is insignificant.
The advantages of the new memory management system require in return sufficient swap space and main memory. More swap space is needed because the internal tables and lists now reside in the user address space in their full size and thus require swap space. The swap space usually needs to be extended. More main memory may be needed to avoid excessive operating system paging as a result of increased swap space requirements.


Objective management

 Objective- uses another form of memory management known as "reference counting." In this system, each object is associated with a count of how many other objects are currently using it, but the reference counts of objects in an application must be actively managed by the developer.

The idea is that when an object has a reference count of "0", no other objects are using it, and it can safely be de-allocated to free up memory space.

LOCATION OUTDOOR SYSTEM

When physical memory becomes scarce the Linux memory management subsystem must attempt to free physical pages. This task falls to the kernel swap daemon (kswapd).
The kernel swap daemon is a special type of process, a kernel thread. Kernel threads are processes have no virtual memory, instead they run in kernel mode in the physical address space.
The kernel swap daemon is slightly misnamed in that it does more than merely swap pages out to the system's swap files. Its role is make sure that there are enough free pages in the system to keep the memory management system operating efficiently.
The Kernel swap daemon (kswapd) is started by the kernel init process at startup time and sits waiting for the kernel swap timer to periodically expire.

Reducing the size of the buffer and page caches,

Swapping out System V shared memory pages,

Swapping out and discarding pages.

If the number of free pages in the system has fallen below free_pages_low, the kernel swap daemon will try to free 6 pages before it next runs. Otherwise it will try to free 3 pages.
Each of the above methods are tried in turn until enough pages have been freed. The kernel swap daemon remembers which method it was using the last time that it attempted to free physical pages. Each time it runs it will start trying to free pages using this last successful method.



MEMORY RECOLATION POLICY

The relocation policy specifies the thresholds of the overall system-supported metrics as well as policy window which is the time window to be used for metric history collected by the WPAR Manager agent, and agent polling time which states how long the agent should wake up to analyze policy violations.

Policy-based relocation is available only for WPARs that meet the following requirements:

·                 The WPARs are checkpointable.

·                 The WPARs are marked as policy enabled.

·                 The WPARs hosting systems belong to relocation domains.

·                 The WPARs do not have target shares set.

The candidate system to relocate the WPAR belongs to the same relocation domain of the system in trouble. Notice that multiple policy violation relocations might be required to achieve the goal of removing the threshold violation.

When a policy violation is reported. The WPAR capable system problem status is set to Warning to notify the user that a policy violation has occurred. The system will also be listed in the Director Health Summary scoreboard.

Details of the analysis performed to resolve the reported policy violation can be seen in list of Applied Activities of the managed system where the violation occurred. There is also a corresponding Job in the Active and Scheduled Jobs view with the same information.

Paging file system

1. Once an executable image has been memory mapped into a processes virtual memory it can start to execute. As only the very start of the image is physically pulled into memory it will soon access an area of virtual memory that is not yet in physical memory. When a process accesses a virtual address that does not have a valid page table entry, the processor will report a page fault to Linux.
2. The page fault describes the virtual address where the page fault occurred and the type of memory access that caused.
3. Linux must find the vm_area_struct that represents the area of memory that the page fault occurred in. As searching through the vm_area_struct data structures is critical to the efficient handling of page faults, these are linked together in an AVL (Adelson-Velskii and Landis) tree structure. If there is no vm_area_struct data structure for this faulting virtual address, this process has accessed an illegal virtual address. Linux will signal the process, sending a SIGSEGV signal, and if the process does not have a handler for that signal it will be terminated.
4. Linux next checks the type of page fault that occurred against the types of accesses allowed for this area of virtual memory. If the process is accessing the memory in an illegal way, say writing to an area that it is only allowed to read from, it is also signalled with a memory error.
5. Linux must differentiate between pages that are in the swap file and those that are part of an executable image on a disk somewhere. It does this by using the page table entry for this faulting virtual address.
6. If the page's page table entry is invalid but not empty, the page fault is for a page currently being held in the swap file. For Alpha AXP page table entries, these are entries which do not have their valid bit set but which have a non-zero value in their PFN field. In this case the PFN field holds information about where in the swap (and which swap file) the page is being held. How pages in the swap file are handled is described later in this chapter.
7. Not all vm_area_struct data structures have a set of virtual memory operations and even those that do may not have a nopage operation. This is because by default Linux will fix up the access by allocating a new physical page and creating a valid page table entry for it. If there is a nopage operation for this area of virtual memory, Linux will use it.
8. The generic Linux nopage operation is used for memory mapped executable images and it uses the page cache to bring the required image page into physical memory.
9. However the required page is brought into physical memory, the processes page tables are updated. It may be necessary for hardware specific actions to update those entries, particularly if the processor uses translation look aside buffers. Now that the page fault has been handled it can be dismissed and the process is restarted at the instruction that made the faulting virtual memory access.