Archive

Posts Tagged ‘sam’

Home Page & Search Pages For Quotes & Service Portal

May 12th, 2011 Comments off

We want a coder who does attractive but functional and easy to use & understand design. and a coder who is a good and frequent communicator. and a coder who bids honestly. we pay bonuses for great fast work by coders who quickly understand what we want.
==============================================================

please see attached draft front page

and please see and use nationalwarranties.com.au/sam

SAM is the search and data back-end of a new planned search portal for collecting and sending quoytes for IT purchases & service jobs

as you can see, we have already implemented the back-end data management and Google mapping & proximity search functions as per current page

so we want to add a ‘get a quote’ function and a ‘find a service agent’ function to fronbt end of ../sam as per attached mock-up screen

the attached form will have two search forms attached – one for each button

with the two ‘search’ forms, we collect various criteria, eg itenm category, product specification, price range, etc, etc, about request and apply the relevant criteria to SAM database and return with results on screen.

(the other collected criteria are just to be included in email request to selected resellers/service agents)

the user can toggle beteeen list results and map results

they can then select from results and send emails with request to matching records/resellers

as per mock-up, the homepage should have featured ads and other features/articlesw/rss feeds

the code for where ads are inserted has to be nice and clean so we can just drop new ads into form without another changes

as mentioned we have already implemented search and mapping in SAM to use in this add-on. the deleveloper who maintains SAM will work with you to implement the additional search enhancements needed for this app.

Web Page Song Adding For Sam

February 16th, 2010 Comments off

My radio station uses Streaming Audio Manager(SAM) from http://www.spacialaudio.com. Currently the only way to add songs into the system is through the computer that it is hosted on and SAM only runs on Windows. SAM is driven by a data base which is hosted on my web server, but the mp3′s are hosted on the windows machine it’s self. I would like a web page script that lets my DJ’s add new songs with out VPNing into my windows computer. I would like a web page they can log into and ftp the mp3 into the windows machine(which has an ftp server set up) and then add in the information into the database about the song that SAM requires(artist, title, cd name, cd image, track number, location of mp3, category). It’s also required to ftp the cd image to the windows computer. To see the database structure, you can download a trial copy of sam, i have not changed it from the default. I use mysql for database.

if this could made into a wordpress plugin that would be even better, but not required.

Another fellow wrote a similar script, but then took it down and no longer has it available. details of it can be found at…

http://support.spacialaudio.com/forums/viewtopic.php?f=20&t=23331

the user who created it was mario222

Categories: MySQL, PHP, Programming, Wordpress Tags: , , , , , ,

Sam Broadcaster Integration

January 31st, 2010 Comments off

I want to integrate sam broadcaster php web into my dolphin site .

Sam Broadcaster Project

November 24th, 2009 Comments off

Looking for someone familiar with working with Sam Broadcaster software so that song info can be displayed in real time on website.

I have sam broadcaster software and shoutcast server and also a website. Need to be able to display Current song title, Album, length of song. Next song coming up, and history of last 5 songs played.

Thanks

Programming Project 1256876976

October 29th, 2009 Comments off

I need a banner done for a tax website…also i need a logo done as well.I have already created the logo I just need some touch ups on it..
As well for the banner I have the rough draft for it..

can u flip the guy with the uncle sam. We want uncle sam putting money in the guys pockets..basically instead the guy being upside down it would show the person getting money from uncle sam and also can u stretch out uncle sam hand so it would cover the whole logo..

the logo we picked is the one with the moon in the middle but can u replace the moon with the logo i just attached to u..where the money is spinning. cash logo flow tax express.

Sam Broadcaster Layout

August 11th, 2009 Comments off

i am looking some 1 to set up a player just like this http://cdselectaz.com/radio/player.php and a like there too so people can click and the request page come up too

Sam Broadcaster

July 30th, 2009 Comments off

i am looking some 1 to set up a player just like this http://cdselectaz.com/radio/player.php and a like there too so people can click and the request page come up too

Closest Birthday

July 23rd, 2009 Comments off

The Problem
It’s the first day of class and you are barely awake. You are hoping to snooze through a typical syllabus day when your new teacher commands you to get up and find the person in the room with the closest birthday to yours. Luckily, you’ve taken AP Computer Science already and realize that the key to solving the problem is to sort EVERYONE by their birthday, and then simply look directly to the left and right of you (the birthday that occurs immediately before and after yours) and see which of the two is closer. If you on the end of the list, you have to check with the person at the beginning and vice versa.

In order to solve this problem, you’ll get several different classes from an input file. Each class will have several queries. You are required to implement either Merge Sort of Quick Sort in the solution of your assignment.

Input File Specification (birthday.txt)
The input file has a single positive integer, n, on its first line, specifying the number of classes in the input file.

The first line of each input file will have a single positive integer k (k < 1001), representing the number of students in the class. The next k lines will have information about each student. Each line will have the following information separated by spaces: first name, last name, month, day and year of birth. All names will only contain uppercase alphabetic characters and be no longer than 29 characters long. The month will be represented in its full spelling, in uppercase letters. The day and year will be the appropriate integers. You are guaranteed that all of this information is valid. (Thus, no April 31st will appear, etc.) It is also guaranteed that each full name will be unique. (Namely, no two people in a class will have the exact same first AND last name.)

Following those k lines will be a line containing a single positive integer m (m < k), representing the number of queries for that class. The following m lines will contain the first and last name (separated by a space) of the student in question. (Your goal will be to find the name of the student with the closest birthday to the queried student.)

Output Specification
For each input class, print out a header with the following format:

Class #c:

where c represents the day of the simulation (1 ≤ c ≤ n).

Follow this with a blank line.

The following k lines will answer the queries for that class in the order they were given. For each of these queries, output a single line with the following format:

FIRST2 LAST2 has the closest birthday to FIRST LAST.

where FIRST LAST is the name of the queried student and FIRST2 LAST2 is the name of the student with the closest birthday to FIRST LAST.

To avoid ambiguity, sort the students in the following manner:

1) By birthdate, ignoring the year.
2) To break ties between students with the same exact birthdate, use last name as compared by the strcmp function.
3) To break ties where both #1 and #2 are the same, use the first name, which in these cases, is guaranteed to be different.

To further avoid ambiguity, if both the person who appears right before and right after the queried person are the same number of days away (in birthday) as the queried person, always choose the first who comes AFTER the queried person in the array. Note: for these purposes, February 29th won’t count as an actual day, unless someone in the class has that birthday. For example, if the queried person’s birthday is March 1st, the person right before her has a February 28th birthday and the person right after her as a March 3rd birthday, then the person with the February 28th birthday is considered the closest (1 day way) as compared to the March 3rd birthday (2 days away). BUT, if there IS a February 29th birthday in the class, then that does count as a day.

Put a blank line between the output for each case.

Implementation Restrictions
You must store all the relevant information about a student in an appropriate struct. You must implement either Merge Sort or Quick Sort. You must follow all the tie-breaking procedures described above.

Sample Input File
2
3
SAM MALONE MAY 3 1961
DIANE CHAMBERS AUGUST 16 1970
NORM PETERSON DECEMBER 12 1955
2
SAM MALONE
NORM PETERSON
4
DAN MARINO SEPTEMBER 15 1961
JOHN ELWAY JUNE 28 1960
JOE MONTANA JUNE 11 1956
DAN FOUTS JUNE 10 1951
1
JOE MONTANA

Sample Output
Class #1:

DIANE CHAMBERS has the closest birthday to SAM MALONE.
DIANE CHAMBERS has the closest birthday to NORM PETERSON.

Class #2:

DAN FOUTS has the closest birthday to JOE MONTANA.

Please write in C.

Bear