Free discount auto parts software for linux

Auto Contrast is a script-fu based on a technique by lylejk of dpreview.com that performs an entirely automatic contrast adjustment.

You may like the effect, dislike it, or not see a change, but its worth a try!

Mounttero automatically mounts most storage devices such as USB drives and cameras, DVDs, CDROMs, hard disks, and floppies.

Devices are mounted when users opens their directory, such as /mnt/auto/cdrom, and are unmounted when the directory remains unused for four seconds.

Usage

For example, when user opens directory /mnt/auto/usb/, digital camera is automatically mounted and all the pictures shown in the directory. After four seconds of inactivity, device is unmounted and can be detached.

Manual Configuration

The rest of this document describes manual configuration of mounttero. If you installed the rpm, it did all this configuration automatically and you dont need manual configuration. The scripts below contain some latest and greatest version 0.5 improvements that have not made it to rpm yet, namely more usb partitions.

Create the directories used by the automounter. The directory is the one mentioned in /etc/auto.master:

# mkdir -p /mnt/auto/autofs

Create auto.master to tell autofs daemon that /mnt/auto/autofs directory is handled according to auto.tero

# /etc/auto.master
# mountpoint map options # see also: man 8 autofs
/mnt/auto/autofs /etc/auto.tero --timeout=4

List the actual mountpoints and devices in the automounter map

# /etc/auto.tero
# http://iki.fi/karvinen/linux/doc/automatic-mounting-autofs.html
# mountpoint_key options location_device # man 5 autofs
cdrom -fstype=auto,ro,nosuid,nodev,user :/dev/cdrom
cdrom1 -fstype=auto,ro,nosuid,nodev,user :/dev/cdrom1
usb -fstype=auto,nosuid,nodev,noexec,user,gid=100,umask=000 :/dev/sda1
# second and third partitions in usb device:
usb2 -fstype=auto,nosuid,nodev,noexec,user,gid=100,umask=000 :dev/sda2
usb3 -fstype=auto,nosuid,nodev,noexec,user,gid=100,umask=000 :dev/sda3
floppy -fstype=auto,nosuid,nodev,noexec,user,gid=100,umask=000 :/dev/fd0

hda1 -fstype=auto,nosuid,nodev,user :/dev/hda1
hda2 -fstype=auto,nosuid,nodev,user :/dev/hda2
hda3 -fstype=auto,nosuid,nodev,user :/dev/hda3
hda4 -fstype=auto,nosuid,nodev,user :/dev/hda4

hdb1 -fstype=auto,nosuid,nodev,user :/dev/hdb1
hdb2 -fstype=auto,nosuid,nodev,user :/dev/hdb2
hdb3 -fstype=auto,nosuid,nodev,user :/dev/hdb3
hdb4 -fstype=auto,nosuid,nodev,user :/dev/hdb4

hdc1 -fstype=auto,nosuid,nodev,user :/dev/hdc1
hdc2 -fstype=auto,nosuid,nodev,user :/dev/hdc2
hdc3 -fstype=auto,nosuid,nodev,user :/dev/hdc3
hdc4 -fstype=auto,nosuid,nodev,user :/dev/hdc4

hdd1 -fstype=auto,nosuid,nodev,user :/dev/hdd1
hdd2 -fstype=auto,nosuid,nodev,user :/dev/hdd2
hdd3 -fstype=auto,nosuid,nodev,user :/dev/hdd3
hdd4 -fstype=auto,nosuid,nodev,user :/dev/hdd4

# Serial ATA (SATA) disks are IDE emulated in Linux 2.6
hde1 -fstype=auto,nosuid,nodev,user :/dev/hde1
hde2 -fstype=auto,nosuid,nodev,user :/dev/hde2
hde3 -fstype=auto,nosuid,nodev,user :/dev/hde3
hde4 -fstype=auto,nosuid,nodev,user :/dev/hde4

# (c) 2003, 2004-05-29, 2004-09-19 Tero.Karvinen atta iki.fi

# /etc/init.d/autofs restart

Now drives are automatically mounted when you try to access them. You can test it by inserting a cdrom, and cd /mnt/auto/autofs/cdrom. The CDROM is automatically mounted, and ls should show you contents of the cd. When you cd to another directory, such as home directory (cd), CDROM is umounted in four seconds and the eject button in the drive starts working.

To see which drives are mountable (have discs in drive), you can create symlinks (similar to shortcuts) to the mountpoints. You can create the symlinks manually for each drive, for example

# cd /mnt/auto/
# ln -s autofs/cdrom cdrom

List::Part is a Perl module that allows you to partition one array into several.

SYNOPSIS

use List::Part;
($good, $bad)=part { !/substring/ } @array; #store arrayrefs into $good and $bad
(*good, *bad)=part { !/substring/ } @array; #store into @good and @bad

ABSTRACT

List::Part implements the part function, allowing one array to be "partitioned" into several based on the results of a code reference.

There are many applications in which the items of a list need to be categorized. For example, lets say you want to categorize lines in a log file:

my($success, $failure)=part { /^ERR/ } ;

Or, suppose you have a list of employees, and you need to determine their fate:

my($lay_off, $give_raise, $keep)=part {
$_->is_talented ? 0
: $_->is_executive ? 1
: 2
} @employees;

Actually, the second one is better suited to parts alternate form, parta:

my($lay_off, $give_raise, $keep)=parta
[ sub { $_->talented }, sub { $_->is_executive }, qr// ] =>
@employees;

Or maybe you just want yet another way to write the traditional Perl signoff:

perl -MList::Part -e"print map{@$_}part{$i++%5}split,JAercunrlkso ettPHr hea,"

List::Part can help you do those sorts of things.

Auto Project Planner software automatically calculates a proper project plan based on your effort estimations and the due dates you have in mind. A list of tasks and a list of employees can be defined. Tasks can be assigned to one or more employees.
The project is also possible to define a maximum percentage value an employee can/should work on a task.
Public holidays, leaves, weekly working hours and some more parameters can be specified and are considered in the calculation.
According to this input the software compute time plans by minimizing the MSE (mean squared error) between expected and computed end dates.
Main features:
- Add/Remove/Edit/Arrange Tasks
- Estimated/Remaining Time
- Expected End Date
- Predecessors
- Add/Remove/Edit Staff Members
- Hours per week
- Assign (multiple) Staff Members to Tasks
- Define max. percentage a Staff Member could/should work on a Task
- Define Sick/Personal Leaves & Public Holidays
- Set Start Date of Calculation
- Output: Phase Plan (printable)
- Output: General & Weekly Overview of calculated plan
- Calculation
- Minimizes MSE between Expected and Calculated End Dates of Tasks
- New/Open/Save APP Projects
- Export to GanttProject

Auto Adjust Photos main goal is to set and correct a photo image automatically with only one click. With other words, to make it seen better. This means setting the contrast, color balance and gamma levels of the image by analization.

Not all images are adjusted originally in the proper way. Some of them can be too dark, too bright, or the colors are just too yellowish. The middle tone can be too dark - at this we see the pictures too dark, no matter how many light colors they have. The program tries to set these parameters by analization to the best values.

This can be a solution for those kind of users who are not able to set up and correct images with complicated huge graphical softwares, or just simply dont intend to spend a lot of time with setting the images one-by-one manually. Only selecting the image files are enough, then right-clicking with the mouse you can just start the automatic color correction command from the local menu (one-step operation from a console command too).

The program handles the following image formats: mif, pnm / pgm / ppm, bmp, ras, jp2, jpc, jpg, pgx

This program is FREEWARE - Free software. You are free to use it. You may not rent, lease, sell, modify, decompile or disassemble it without the written permission of the author. The creator of the software will not be liable for any damages or data loss while using it.

The following options are supported:

--help Print this help
-v --version Print version information
-d --description Print more detailed information about the program
-l --licence Print licence agreement
-i --info Information about the image
-a --autoadjust *Auto adjust the colors of the image
-o --overwrite *Overwrite mode, the original source file is replaced
-j1 --jpg JPG image output
-j2 --jp2 JPEG 2000 image output
-r --resize *Resize image with given value taking the longer side
-s --speed Print extra speed information
-q --quality *Set image quality from 1 to 100
-m --mute Muted mode, no information printed during operation

* marked parameters need file input

EXAMPLES:

aaphoto --version
aaphoto --help
aaphoto --description
aaphoto --licence
aaphoto --info image.jpg
aaphoto --autoadjust image.jpg
aaphoto --resize70% image.jpg
aaphoto --resize600 image.jpg
aaphoto --quality80 image.jp2
aaphoto *.jp2 --overwrite --speed

REMARKS:

- auto adjust parameter is set by default if no other parameters are given
- a _new filename will be generated without --overwrite parameter
- on directory input every file will be processed in it but not recursively
- order of parameters does not matter
- resizing can be set in percentage too
- resize parameter should be less or equal than original
- resize uses the best (and slowest) resampling method
- default jpeg compression quality is 95%

auto-nng is a software for analysis and classification of data, using artificial neuronal networks. You can feed an amount of datasets consisting of certain input and output parameters into the program, to make it try to find a mathematical correlation between the input and output parameters.
Afterwards the program tries to calculate the output parameters for datasets which only have known input parameters.
auto-nng is free, and can be used and enhanced under the terms of the given license (MIT-style). It was developed under the NetBSD operating system, and runs under Linux (and other similar systems) too.
Enhancements:
- The transformation function for continuous input and output values has been changed to cause a smaller error during defuzzyfication.

Data::Locations - magic insertion points in your data
Did you already encounter the problem that you had to produce some data in a particular order, but that some piece of the data was still unavailable at the point in the sequence where it belonged and where it should have been produced?
Did you also have to resort to cumbersome and tedious measures such as storing the first and the last part of your data separately, then producing the missing middle part, and finally putting it all together?
In this simple case, involving only one deferred insertion, you might still put up with this solution.
But if there is more than one deferred insertion, requiring the handling of many fragments of data, you will probably get annoyed and frustrated.
You might even have to struggle with limitations of the file system of your operating system, or handling so many files might considerably slow down your application due to excessive file input/output.
And if you dont know exactly beforehand how many deferred insertions there will be (if this depends dynamically on the data being processed), and/or if the pieces of data you need to insert need additional (nested) insertions themselves, things will get really tricky, messy and troublesome.
In such a case you might wonder if there wasnt an elegant solution to this problem.
This is where the "Data::Locations" module comes in: It handles such insertion points automatically for you, no matter how many and how deeply nested, purely in memory, requiring no (inherently slower) file input/output operations.
(The underlying operating system will automatically take care if the amount of data becomes too large to be handled fully in memory, though, by swapping out unneeded parts.)
Moreover, it also allows you to insert the same fragment of data into SEVERAL different places.
This increases space efficiency because the same data is stored in memory only once, but used multiple times.
Potential infinite recursion loops are detected automatically and refused.
In order to better understand the underlying concept, think of "Data::Locations" as virtual files with almost random access: You can write data to them, you can say "reserve some space here which I will fill in later", and continue writing data.
And you can of course also read from these virtual files, at any time, in order to see the data that a given virtual file currently contains.
When you are finished filling in all the different parts of your virtual file, you can write out its contents in flattened form to a physical, real file this time, or process it otherwise (purely in memory, if you wish).
You can also think of "Data::Locations" as bubbles and bubbles inside of other bubbles. You can inflate these bubbles in any arbitrary order you like through a straw (i.e., the bubbles object reference).
Note that this module handles your data completely transparently, which means that you can use it equally well for text AND binary data.
You might also be interested in knowing that this module and its concept have already been heavily used in the automatic code generation of large software projects.
Enhancements:
- Fixed test file "02___refcount.t" to auto-adjust the offset dealing with self-ties not incrementing
- the refcount in some Perl versions.
- Added a warning to "Makefile.PL" that Perl versions including and between v5.6.1 and v5.7.0 are not fully supported (test file "11_______dump.t" dumps core).

Dinamica project is a powerful and very easy to use framework for J2EE Web development. Its newbie friendly and was built from scratch to be a high productivity framework for building business-oriented Web applications, whether they are large-scale or smaller ones.
It stands apart from other Java MVC frameworks because it incorporates innovative programming techniques that boost productivity without sacrificing good object oriented design practices. Most common programming tasks can be completed without writing a single line of code.It uses Servlet API 2.3 and does not require JSP or TagLibs.
Main features:
- Centralized request control via powerful MVC mechanism
- Data-driven application behavior - declarative programming style
- Integrated performance log - no coding required (request, MVC and JDBC level)
- Centralized error handling with configurable email notifications
- Complete and real separation of presentation from business logic
- Powerful page composition with reusable HTML parts
- Automatic and flexible form validation - extensible via simple plugins
- Effortless international support
- Declarative Server-side charts (with JFreeChart)
- Server-side PDF reports (with IText)
- Easy Blob management (save, retrieve and display)
- Fully encapsulated JDBC facilities - automatic persistence
- Disconnected Recordsets - efficient abstraction that eliminates O-R mapping
- Transparent and declarative JDBC transactions control
- Includes a complete security system with administrative web based console
- Built-in support for Hessian Web Services
- Built-in support for SOAP-based Web Services
- Built-in support for HTTP tunneling
- Built-in support for consuming RSS feeds
- Built-in support for publishing simple REST services
- Integrated AuditLog API
- Fully documented (26+ PDFs), with a complete collection of How-to and Step-by-Step guides
- Extensible in many ways via Plug-Ins
- Abundant template code and pre-built solutions
- Free support available
- Includes a Code Generator, that auto-generates SQL, HTML and Java code, reads metadata from your database to generate code, it also creates documentation from your application configuration files.
Enhancements:
- This release adds better support for code-free Oracle BLOBs management (tested with Oracle 9i R2), a new generic class and complete reusable solution template, and enhanced generic recordset capabilities.