Ports Search

This program is designed to match up items in two different lists, which may have two different systems of coordinates. The program allows the two sets of coordinates to be related by a linear, quadratic, or cubic transformation. There was a major change in version 0.15: the first stage uses the clever method of finding the most likely triangles described in Tabur, Publications of the Astronomical Society of Australia, vol 24 , page 189 (2007). This replaces the more brute-force-ish method of Valdes et al., Publications of the Astronomical Society of the Pacific, vol 107, page 1119 (1995), which was employed in version up to 0.14. The program was designed and written to work on lists of stars and other astronomical objects, but it might be applied to other types of data. In order to match two lists of N points, the main algorithm calls for O(N^6) operations (yes, that's N-to-the-sixth), so it's not the most efficient choice. I find myself becoming impatient for N >= 100, but your mileage may vary. On the other hand, it does allow for arbitrary translation, rotation, and scaling...

This is version 1.6P-7 of GramoFile (patches are from the debian package). With this program you can record audio of (for example) gramophone records, process the signal and listen to the results. Because sound files of the .WAV-format are used, it is possible to exchange the files with many other programs. Cdrecord(1) can burn CD-Recordables of these, so you can make CDs with the music of your favorite records. The user interface of GramoFile has a windows-like look-and-feel, making it fairly easy to use. One of the most important parts of GramoFile is the ability to process digital audio signals. Through the application of several filters it is possible to accomplish a significant reduction of disturbances like ticks and scratches. Another interesting feature is the track splitting. Just make one .wav file of an entire side of an record and GramoFile will detect where the individual tracks are located. This happens fully automatically, without need to set any options. More experienced users may fine-tune the algorithm, or change the detected track starts and ends, but generally that will not be necessary. Track-times are saved in an editable (plaintext) .tracks file, that will be used during the signal processing to produce one processed .wav file for each individual track.

gtkpod is a platform independent graphical user interface for Apple's iPod using GTK2. It supports the first to fifth generation, including the iPod mini, iPod photo, iPod shuffle, iPod nano, and iPod video. It allows you to: * Read your existing iTunesDB (i.e. import the existing contents of your iPod including playcounts, ratings, and on-the-go playlists) * Add MP3, WAV, M4A (non-protected AAC), M4B (audio book), and podcast files (single files, directories or existing playlists) to the iPod * Browse the contents of your local hard disk by album/artist/genre * Create and modify playlists, including smart playlists * Choose the charset the ID3 tags are encoded in from within gtkpod * Extract tag information (artist, album, title, etc.) from the filename * Detect duplicates when adding songs (optional) * Remove and export tracks from your iPod * Modify/Refresh ID3 tags, optionally updating the original file * Synchronize directories * Normalize the volume of your tracks (via mp3gain or the replay-gain tag) * Download and display of Album Art from the Internet * Work offline and synchronize your new playlists/songs with the iPod later * Export your korganizer/kaddressbook/thunderbird/evocalendar/evolution/ webcalendar/... data to the iPod (scripts for other programs can be easily added)

OptimFROG is a lossless audio compression program. Its main goal is to reduce at maximum the size of audio files, while permitting bit identical restoration for all input. It is similar with the ZIP compression, but it is highly specialized to compress audio data. OptimFROG obtains asymptotically the best lossless audio compression ratios. It has Windows, Linux, and Mac versions, fully featured input plug-ins for the Windows Media Player, foobar2000, Winamp2/3/5, dBpowerAMP, XMPlay, QCD, and XMMS audio players (with bitstream error resilience, ID3v1.1 and APEv2 read tagging support, ID3v2 compatible), optimal support for all integer PCM wave formats up to 32 bits and an extensible streamable (error tolerant) compressed format. It is also fast, the default mode encodes CD quality audio data at 12.4x real-time and decodes at 17.4x real- time on AMD Athlon XP 1800+ (the fastest mode encodes at 28.1x real-time and decodes at 24.7x real-time). Self-extracting (sfx) archives can also be created with a small overhead of just 54 KB.

Gerber Viewer (gerbv) is a viewer for Gerber files. Gerber files are generated from PCB CAD system and sent to PCB manufacturers as basis for the manufacturing process. The standard supported by gerbv is RS-274X. The basic difference between RS-274D (the old standard) and RS-274X is basically the addition of apertures in RS-274X. It might be possible to make an RS-274X file out of an RS-274D file and an aperture list. gerbv also supports drill files. The format supported are known under names as NC-drill or Excellon. The format is a bit undefined and different EDA-vendors implement it different. But basically you need to have the tools definition in the file, then the parser is quite tolerant. The different holes are shown as dots in the (scaled) correct size. The different layers of the PCB are separated into different files. gerbv can load all files at the same time and display them "on top of each other". You can independently turn them on and off.

The EAGLE Layout Editor is an easy to use, yet powerful tool for designing printed circuit boards (PCBs). The name EAGLE is an acronym, which stands for Easily Applicable Graphical Layout Editor. The program consists of three main modules: o Layout Editor o Schematic Editor o Autorouter which are embedded in a single user interface. Therefore there is no need for converting netlists between schematics and layouts. This is a Light Freeware Edition. It has the following limitations: o The useable board area is limited to 100 x 80 mm (4 x 3.2 inches). o Only two signal layers can be used (Top and Bottom). o The schematic editor can only create one sheet. o Support is only available via email or through our forum (no fax or phone support). o Use is limited to non-profit applications or evaluation purposes. Apart from these limitations the EAGLE Light Edition can do anything the Professional Edition can do. You can even load, view and print drawings that exceed these limits!

LIRC is a package that allows you to decode and send infra-red signals of many (but not all) commonly used remote controls. The most important part of LIRC is the lircd daemon that will decode IR signals received by the device drivers and provide the information on a socket. It will also accept commands for IR signals to be sent if the hardware supports this. The second daemon program called lircmd will connect to lircd and translate the decoded IR signals to mouse movements. You can e.g. configure X to use your remote control as an input device. The user space applications will allow you to control your computer with your remote control. You can send X events to applications, start programs and much more on just one button press. The possible applications are obvious: Infra-red mouse, remote control for your TV tuner card or CD-ROM, shutdown by remote, program your VCR and/or satellite tuner with your computer, etc.

bitmapped vectors of booleans (no NAs), coercion from and to logicals, integers and integer subscripts; fast boolean operators and fast summary statistics. With 'bit' vectors you can store true binary booleans {FALSE,TRUE} at the expense of 1 bit only, on a 32 bit architecture this means factor 32 less RAM and ~ factor 32 more speed on boolean operations. Due to overhead of R calls, actual speed gain depends on the size of the vector: expect gains for vectors of size > 10000 elements. Even for one-time boolean operations it can pay-off to convert to bit, the pay-off is obvious, when such components are used more than once. Reading from and writing to bit is approximately as fast as accessing standard logicals - mostly due to R's time for memory allocation. The package allows to work with pre-allocated memory for return values by calling .Call() directly: when evaluating the speed of C-access with pre-allocated vector memory, coping from bit to logical requires only 70% of the time for copying from logical to logical; and copying from logical to bit comes at a performance penalty of 150%. the package now contains further classes for representing logical selections: 'bitwhich' for very skewed selections and 'ri' for selecting ranges of values for chunked processing. All three index classes can be used for subsetting 'ff' objects (ff-2.1-0 and higher).

The Firm library implements the Firm intermediate representation (IR). libFirm contains algorithms for construction of the SSA form directly from the attributed syntax tree. A set of analyses and optimisation phases is provided. This version includes a complete backend for the IA32 architecture, as well as some unfinished backends for SPARC, ARM * support for object oriented type hierarchies * analyses: dominance, loop tree, execution frequency, control dependencies, call graph, rapid type, def-use, alias analysis, class hierarchy analysis * Optimisations: constant folding, local common subexpression elimination, global common subexpression elimination, code placement, operator strength reduction, scalar replacement, load/store, control flow optimisations, if-conversion, partial condition evaluation, reassociation, tail recursion elimination, inlining, procedure cloning, dead code elimination, ... * enhanced debugging support: extensive checkers, breakpoints on node creation, entity creation, graph dumping * lowering of intrinsics, double word arithmetics, bitfields * backend with SSA based register allocation including several algorithms for spilling and copy coalescing. Instruction and block scheduling, support for ABI handling. * working ia32 backend with support for x87 and SSE2 floating point * handwritten recursive descent C90/C99 frontend available (lang/cparser)

Nana provides improved support for assertion checking and logging in C, C++ using GDB. In particular it provides: o Operations can be implemented directly in C or by generating debugger commands which do the checking and logging only if the application is run under the debugger. The debugger based calls require are very space efficient (0 or 1 bytes per call). o Support for checking real time constraints. o Support for assertion (invariant checking) including: + Space and time efficient (at least versus <assert.h>) For example: assert(i>=0) uses 53 bytes on a i386 vs an optimised nana call which uses 10 bytes per call. + Checking can be turned on or off at compile or run time. + The action taken when an error is detected can be modified on a global and per/call basis. o Support for logging (printf style debugging) including: + Logging can be turned on and off at compile or run time. + Logging to files, processes or circular buffers in memory with optional time stamping. o Support for the quantifiers of predicate calculus (forall, exists). o Support for before and after state saving and checking (x, x').