AdMan

AdMan is a standalone Advertisement Management Server that provides publishers with a way to organize ads, view real-time traffic statistics, handle online transactions and interact with advertisers.

AdMan is the perfect tool for companies wishing to eliminate commission charges from advertising middlemen and provide more customizable ad products to their advertisers.

Features:

  • Provide a direct interface between your website’s advertising and the advertisers who wish to advertise on your website.
  • Create and manage zones, sections of a website where you wish to place ads.
  • Support 4 different ad types: text, banner, rich, and text in list. A text ad consists of a headline and description. A banner ad consists of an image. A rich ad consists of any HTML technology including Javascript (even popups), ActiveX, Flash, etc… Text in list is a single entry in a vertically arranged list of links.
  • Automatically integrate with 3rd party ad suppliers like Google AdSense, AdBrite, Commission Junction, etc…
  • Create and manage campaigns, which are collections of ad spaces.
  • Set pricing schemes, which define the different ad purchases that can be made. Pricing schemes consist of a price and service, which is described by cost per click, CPM, or time.
  • Specify whether ads need approval after they’ve been submitted or edited by and advertiser.
  • Edit any detail of an ad even after it has already been submitted.
  • Automatically generate a media kit that allows advertisers to view a summary of ad spaces and costs associated with advertising in these ad spaces.
  • View real time reports: daily stats, zone summaries, advertiser summaries and unique visitors down the IP and request level. Using the unique visitors pages, you can even track the flow of individual customers through your website and identify ways of improving your conversions and website structure.
  • Seamlessly integrate with PayPal’s merchant services. Just enter a PayPal email address and begin receiving credit card, eCheck or other PayPal payments from your advertising clients.
  • View a financial summary of all payments received or lookup an advertiser’s financial statements.
  • Issue refunds.
  • Issue complimentary ad spaces.
  • Hide ad zones and pricing schemes so that only special advertisers can advertise in these areas.
  • Generate the HTML code needed to display an ad zone and perform page tracking.
  • Use AdMan ads on any website, even websites that don’t support PHP or MySQL. You can install the AdMan software on any PHP enabled web server and then display the ads on this or any other web server. (AdMan uses iframes to deliver ad content).
  • Create and manage advertiser accounts: edit/view details and reset passwords.
  • Manage AdMan logos and email notifications.
  • Receive an email notification when an ad needs approval.
  • Automatically schedule ads. Just set a maximum number of ads permitted in an ad zone at any given time and AdMan will automatically schedule the available ad spaces. In addition, you can even view a graph of this schedule.
  • Access a publisher tutorial, which contains screenshots and descriptions of all publisher functionality in AdMan.
  • Utilize SmartLink replacement, the method by which AdMan attempts to dynamically update all URLs in a rich ad in an effort to provide link tracking stats and the option to open a URL in a new window.
  • Access the full AdMan source code so that you can modify or enhance your AdMan installation.
  • Install AdMan in under 5 minutes using AdMan’s installation form.

Click Here for website

bubblesort

This is a simple bubblesort by Petter Nilsenthat takes 2 arrays as
argument.The first one is the actual data used for sorting, the second
is data that will "tag along" with the first array, for instance a
descriptive text about the data in the first array.

/* Author: J.B.Lamer, Date: 20070321
 *
 * bubblesort() takes one array and sorts it
 * slow but simple
 *
 * If you want to reverse, suggest doing the
 *  check outside of the for loops
 *  and call two different (outer) for loops
 *  checking on each rotation can slow you down
 */
function bubblesort( &$a1 )
{
	if ( !is_array($a1) )
	{ return false; }
	$len = count($a1);
	// go down array and get an element
	for( $i = 0; $i < $len; $i++ )
	{
		// check everything above element
		// if we are larger than swap it
		// with that one
		for ( $j = ($i+1); $j < $len; $j++ )
		{
			if ( $a1[$i] > $a1[$j] )
			{	swap( $a1[$i], $a1[$j] ); }
		}
		// at this point the position at $i is the smallest
		// go to the next one
	}
	return true;
}

if ( !function_exists('swap') )
{
	// quess what this function is for
	function swap( &$a, &$b )
	{
		$h = $a;
		$a = $b;
		$b = $h;
	}
}

In String

/* Author: J.B.Lamer, Date: 20070321
 * I suggest using strpos and testing with
 *   the false using triple equals instead of this function.
 * If you don't have strpos, than update your php.
 * Using the original intent of this function
 *   if $needle is in $haystack return the pos (starting from 1)
 *   and 0 on fail or can't find
 * If you want to check if they are strings you can before the if statement
 *   or in the if before checking for pos
 */
function InStr($needle, $haystack)
{
	// suppressing errors with @
	if ( false === ($pos = @strpos($haystack,$needle)) )
	{	return 0; }
	return ($pos+1);
}

Quick Sort Function


/* Author: JBLamer, Date: 20070322 *

* qsort is a recursive quicksort function of an array

*

* $array_to_sort is the array that needs sorting

* the keys are pulled and replaced with a normal numeric array

* false is returned if $array_to_sort is not an array

*   and true is returned otherwise

*

* $btm and $top are internal to track positions in the array

* $lvl in internal to track depth, leave at zero

*

* this uses the swap() function which takes two elements and swaps them

*/

function qsort( &$array_to_sort, $btm=null, $top=null, $lvl=0 )

{

// check if top of recursion and do checks

// otherwise the checks slow down the recursion

if ( $lvl == 0 )

{

if ( !is_array($array_to_sort) )

{	return false; }

// yank all the values out to prevent incorrect keying

$array_to_sort = array_values($array_to_sort);		$btm=0;

$top=count($array_to_sort)-1;

}

$lo = $btm;

$hi = $top;

$pivot = $array_to_sort[$hi];

// throw highs and lows to each side of the element

// and the one element will be in the correct position,

// then array is already partially sorted

while ( $lo < $hi )

{

while ( $lo  strval($array_to_sort[$lo]) )

{	$lo++; }

if ( $lo != $hi )

{	swap( $array_to_sort[$lo], $array_to_sort[$hi] ); }

while ( $lo  $pivot )

{	$hi--; }

if ( $lo != $hi )

{	swap( $array_to_sort[$lo], $array_to_sort[$hi] ); }

}

// now $lo and $hi are on the sorted element

if ( $lo-1 > $btm )  // if equal, there is only one sorted element

{	qsort($array_to_sort, $btm, $lo-1, $lvl+1); }

if ( $top > $lo+1  ) // see last comment

{	qsort($array_to_sort, $lo+1, $top, $lvl+1); }

return true;

}

/* Author: JBLamer, Date: 20070322

*

* qsort0 is a nonrecursive quicksort function of an array

*

* $array_to_sort is the array that needs sorting

* the keys are pulled and replaced with a normal numeric array

* false is returned if $array_to_sort is not an array

*   and true is returned otherwise

*

* This is handy on machines that have memory management issues

*   that the recursive function can trigger on huge arrays.

*   Actually on many speed tests, this was the quicker

*   but that may be because of all the checks on recursion...

*

* this uses the swap() function which takes two elements and swaps them

*/

function qsort0( &$array_to_sort )

{

if ( !is_array($array_to_sort) )

{	return false; }

// yank all the values out to prevent incorrect keying

$array_to_sort = array_values($array_to_sort);

// record where we are via stack

$track_sort = array();

array_push($track_sort, array(0, count($array_to_sort)-1));

while ( count($track_sort) > 0 )

{

$hold = array_pop($track_sort);

$lo = $hold[0];

$hi = $hold[1];

$pivot = $array_to_sort[$hi];

// throw highs and lows to each side of the element

// and the one element will be in the correct position,

// then array is already partially sorted

while ( $lo < $hi )

{

while ( $lo  strval($array_to_sort[$lo]) )

{	$lo++; }

if ( $lo != $hi )

{	swap( $array_to_sort[$lo], $array_to_sort[$hi] ); }

while ( $lo  $pivot )

{	$hi--; }

if ( $lo != $hi )

{	swap( $array_to_sort[$lo], $array_to_sort[$hi] ); }

}

// now $lo and $hi are on the sorted element

if ( $lo-1 > $hold[0] )  // if equal, there is only one sorted element

{	array_push($track_sort, array($hold[0], $lo-1)); }

if ( $hold[1] > $lo+1  ) // see last comment

{	array_push($track_sort, array($lo+1, $hold[1])); }

}

return true;

}

// this function is to swap element a with b

if ( !function_exists('swap') )

{

function swap( &$a, &$b )

{

$h = $a;

$a = $b;

$b = $h;

}

}

Google Code Prettify for wordpress

This wordpress plugin enables syntax highlighting of code snippets in your post. You will need to have JavaScript enabled in your browser for this to work.

Google Code Prettify for wordpress v1.1
zip, 7kb

Installation

This plugin requires WordPress v.2.0 or later.

  1. unzip and upload the files to your wp-content/plugins/ directory.
  2. Activate the plugin by logging into your WordPress administration panel, going to ‘Plugins’, then clicking the  ‘Activate’  button for  ‘Google Code Prettify’.
  3. Done,enjoy it.

Usage

Put code snippets in <pre…</pre> or <code…</code> and it will automatically be pretty printed.

The comments in prettify.js are authoritative but the lexer should work on a number of languages including C and friends. It works passably on Ruby, PHP and Awk and a decent subset of Perl, but, because of commenting conventions, doesn’t work on Smalltalk, Lisp-like, or CAML-like languages. There’s no way to tell it which language because would complicate the interface. If it doesn’t guess the language properly, that’s a bug. It’s been tested with IE 6, Firefox 1.5 & 2, and Safari 2.0.4.

The Emmy Awards

The Emmy® Awards are administered by three sister organizations who focus on various sectors of television programming: the Academy of Television Arts & Sciences (prime time), the National Academy of Television Arts & Sciences (daytime, sports, news and documentary), and the International Academy of Television Arts & Sciences (international).

The Emmy Awards recognize excellence within various areas of the television industry. The awards are a symbol of peer recognition from over 15,000 members of the Academy. Each member casts a ballot for the category of competition in their field of expertise.

Three of the Academy of Television Arts and Sciences’ most prominent areas of competition are:

Primetime Emmy® Awards
The Primetime Emmy® Awards
celebrate excellence in
national prime time
programming, awarding
top honors at the annual
creative arts gala and prime
time awards telecast.

Daytime Awards
The Daytime Emmys operate
under the jurisdiction of
the National Television
Academy in New York. For
additional information about
the Daytime Emmys
call (212) 586-8426.

L.A. Area Awards
Local programming in the
LA area receive honors
at the Los Angeles Area
Emmy Awards ceremony,
with the Los Angeles
Area Awards Committee
responsible for its structure.

~GetWIKI(Emmy_Awards)~

The Annie Awards

Wikipedia does not have an article on this topic, But we have it!!

The highest honor given for excellence in animation. Each year, Annie Award trophies are awarded for the year’s best feature film, video, television program, commercial, and animated interactive production; as well as individual achievement by artists, writers and voice talent.

~GetWIKI(The_Annie_Awards)~

JM Designs

Wikipedia does not have an article on this topic, But we have it!!

They are a solutions based design company that focuses on creating results through a thought based process of design. The process begins by developing a relationship with the client. They focus on concept and product development with a strong background in the aerospace, marketing, and retail industries. They are dedicated to developing solutions that increase the innovation, quality, and appearance of our clients and their products in the marketplace.

~GetWIKI(JM_Designs)~

The Effie Awards

Wikipedia does not have an article on this topic, But we have it!!

Effie awards Ideas that Work – the great ideas that achieve real results and the strategy that goes into creating them. Effie winners represent client and agency teams who tackled a marketplace challenge with a big idea and knew exactly how to communicate their message to their customer.

Any form of consumer engagement is eligible for an Effie award. From print to TV, to packaging design to guerrilla, to events, to digital, to anything. If your efforts can demonstrate measurable results, we want to see it in the Effies.

Since 1968, winning an Effie has become a global symbol of achievement. Today, Effie celebrates effectiveness worldwide with the Global Effie, the Euro Effie, Effie Asia Pacific and more than 35 national Effie programs.

~GetWIKI(The_Effie_Awards)~

ADC Awards

Wikipedia does not have an article on this topic, But we have it!!

The ADC Hybrid Award honors innovative, groundbreaking advertising communications that represent relevant, entertaining, engaging brand experiences and solutions. ADC Hybrid winners define the vanguard.

The ADC Design Sphere Award honors a sustained design program for a single client. ADC Design Sphere solutions combine and convey brand relevance with consistent, impactful and emotional connections. The ADC Sphere sets the standard for excellence.

~GetWIKI(ADC_Awards)~

« Previous entries
1