Here some changes:

• [FIX] Nicknames were not properly imported by from Sync Server and it was impossible to substitute in event title
• [FIX] Target calendar change is now saved
• [FIX] Event title changes are properly saved
• [FIX] Alarm icon column is no more bound to “data” binding (“value” is now used: no more warning in your console about this deprecated construct)
• [NEW] Agent deactivation removes application data file
• [NEW] Deactivate button is now disabled when a fresh-sync is issued
• [NEW] Added the new specifier “%yp” (equal to %y minus 1)

Here what must still be implemented:

• Software autoupdate

I’d like to thank all of you for your bug report and support.

You can download it at www.devzero.it/yabi

Here some changes:

• 64-bit enabled
• minor memory leaks fixed
• added “partner” attribute for anniversary cross-check
• UI updates
• removed unused frameworks

Here what must still be implemented:

• Save/restore event titles
• Software autoupdate

You can download it at www.devzero.it/yabi

DZSelectableBox is a subclass of NSBox view which emulates this behavior. An instance of this class comes with one more variable member, the box state: when the box is marked as selected, an inner rounded path is drawn inside its bounds; DZSelectableBox honors title position, if it’s visible. You can use this class in two different manners: standalone or as part of a radio group.

Standalone version

A standalone box works as described before: the only thing you’ve to do is open Interface Builder, place a common NSBox in your window, change its class name into DZSelectableBox and start using it.
You can change box state programmatically by using the toggleState message, the setSelected method to set its state or simply by clicking on it.

Radio group version

Whenever you need a group of boxes and the opportunity to select only one of them at time, you’ve to set a radio group; after you followed the steps described before to create your boxes, you’ve to add the following sample code to your application:

leftBox.radioGroup = [NSNumber numberWithInt:1]; 
rightBox.radioGroup = [NSNumber numberWithInt:1]; 
[leftBox setSelected:YES]; 
[rightBox setSelected:NO];

(we suppose you created two boxes and connected them to two outlets called leftBox and rightBox)

When a box belongs to a radio group, it listens for group changes notification: for example, if you select the right box (by clicking on it), the left one will be automatically unselected.

Where can I download the code?

Code is available on GitHub at the following url:

http://github.com/unixo/Selectable-Box

You can also download a Test application

This algorithm requires that each page contained in the page table, besides the common attributes, must also contains two further bits:

• reference bit (R): this bit will be 1 when the system accesses the page, both for read and write operations;
• dirty bit (D): this bit will be 1 only when the page will be written: when a page must be removed from main memory, this bit will remember the operative system to make a copy into secondary storage, before wiping it out.

Searching for a virtual page to be removed will take in account of four possible combinations:

1. R=0, D=0: this page has never been used nor modified -> remove this page
2. R=0, D=1: this page has not been recently used, but has been modified -> write it back to secondary storage and set D=0;
3. R=1, D=0: this page has been recently used only for read access -> set R=0
4. R=1, D=1: this page has been recently used and modified -> set R=0, do a write back and set D=0.

Searching for the best page to replace won’t only be equivalent to select the less used page, but also those pages that weren’t modified; in this way, the more the system uses a page, the less is the probability for that page to be removed.

When a page present into the main memory is dirty, the system must issue two I/O requests: the former to access the secondary memory for paging it out, the latter to bring the requested page into memory (page in). In this scenario, by analyzing the dirty pages periodically and writing them back to the storage, the algorithm improves the overall performances as well as average access time to memory.

This algorithm suffers the disadvantage of partitioning the main memory in two classes: pages which are frequently accessed and pages less frequently accessed; when searching for target page ends, it’s not assured that the victim page is the oldest, but only one of the less accessed pages.

The best instance happens when the first frame has both R & D bits equal to zero: searching stops immediately and it’s not necessary to page it out.

The worst case happens when all pages are both referenced and modified: in this scenario the MMU must completely scan all the entries, just like a FIFO.

The simulator, written in C, is made up of different entities, which are:

• process: it simulates a user process which can access to an random memory location or issue a I/O read
• i/o device: a dedicated thread is spawn to simulate an i/o device (it comes with a FIFO queue to serve processes requests)
• mmu: the MMU simulates the Memory Management Unit, i.e. the responsible to translate virtual addresses (generated by a user process) into physical address; it’s also implements the second chance algorithm.

It let the user specify how many processes run, how much physical memory is installed, the page size and so on; it requires only a C compiler (like gcc) and the utility Makefile.

Its output is in italian language, even if very simple terms have been used.

Download vmbo.tar.gz

1. Go to the theme directory (DOC_ROOT/wp-contents/themes/yourtheme)
2. Look for file named single.php
3. Look for the template tag named the_content
4. Add a new line below and attach the following istructions:

<?php wp_link_pages(array(‘before’ => ‘<p><strong>Pages:</strong> ‘,’after’ => ‘</p>’, ‘next_or_number’ => ‘number’)); ?>

Try to reload the single post page and enjoy page-links.

For further informations about page-links, read this document.

Archive contains sources and relation, written in italian, which describe the algorithm, its purpose and implementation. This was developed for university purposes.

Download rb-sorter.tar.gz

In computing, an arithmetic logic unit (ALU) is a digital circuit that performs arithmetic and logical operations. The ALU is a fundamental building block of the central processing unit (CPU) of a computer, and even the simplest microprocessors contain one for purposes such as maintaining timers.

This project is an example of an ALU realized with Tkgate for university purposes.

The following operators are implemented:

• adder
• multiplier
• divider
• left/right and circular shift

It works with 8-bit unsigned numbers.

Download ALU.tgz

cat /usr/share/emacs/22.1/etc/sex.6
cat /usr/share/emacs/22.1/etc/condom.1

Some months ago I found another way to sync our events with iCal, which doesn’t need manual operation; I quickly wrote a new version, tested and it seems to be stable and functional, but it misses graphical interface like the previous alpha 9.
This version appears as a preference pane and installs a sync-agent which is automatically alerted by the operative system about changes to your address book.

I attach this new version: of course the two YABI should not coexist (they don’t share any data, but it’s advisable not to run both).
To install it, simply double-click on the icon; customize your preferences, activate it and after few seconds events will appear in your iCal (a simple set of settings will be automatically set up at first start-up).
To uninstall, simply right-click on the preference pane and select “remove”.

Download YABI 3.0 alpha 9 (previous version)

Download YABI.prefPane (new version)

“Internet Address Fields” is a collection of three Cocoa classes, inherited from NSMatrix, which look like an NSTextField with an particular NSCustomFormatter.
It contains:

• IPv4 address field
• IPv4 netmask field
• IPv6 address field

Download Source