hello, i need the following php scripts: 1)it should parse a certain file type i can setup in the script from multiple phpbb2,phpBB and InvisionPowerBoard like in the script there is a line it says "index new board" then: filetype to index mp3 im...file without the user knowing the original the adress of the thread is is no site that does things like that yet,but you can visit the boards over or 2) the second script is also multimedia related: i have got an database with http remote mp3`s insite.i want YOU to make a WINAMP/WINDOWS MEDIA PLAYER RADIO that broadcast m3`s randomly or by picking up mp3`s from the database. both scripts should be able to handle templates/css style sheets.
Project: I need a program that will process mp3 files, merge two files together as one. (i.e. take a instrumental track and a seperate track with only vocals both mp3s and place them on top of one another.) then convert the new m3 file to a .wma file. I would also like it to be able to copy snippets of track (i.e. ten seconds of an instrumental). ## Deliverables Rent A Coder requirements notice: As originally posted, this bid request does not have complete details. Should a dispute arise and this project go into arbitration "as is", the contract's vagueness might cause it to be interpreted against you, even though you were acting in good-faith. So for your protection, if you are interested in this project, please work-out and document the requirements onsite. ...
...some to build a vehicle database of every car make and model. So, you will need to search such sites such as , , , and other national vehicle sites that lists vehicles. I want the years to run from 1983 till the present (2005). This can be done in an Access database. I am really just looking for the data. I need: Make (Toyota, Ford, Mazda) Model (Corolla, Expedition, M3) Year (1985, 1986, 1987....., 2002, 2003, 2004, 2005) Type (Sedan, Truck, Sports Utility, Van, Commercial, etc...) Engine (4-cylinder 1.6 Liter, 8-cylinder 5.4 Liter, example) Transmission (Automatic, Manual, 6 speed manual, example) Drive Type (2 Wheel Drive, 4 Wheel Drive, All Wheel Drive) This project includes you studying the various sites (, , and others) for the
... allows for band members to upload thier tracks to the site, at current it is the resposibility of members to compress thier own music. How ever in an effort to make the site more user friendly I would like to have the site automatically compress the Mp3's to reduce the file size, enabling faster streaming. This has to be carried out server side, over right the old mp3 and store the m3's in the directory based on the induviduals band name. the members will be uploading their tracks to the site, in their band folder eg the upload script and all proceedures for this are in place. I just require a script to pull the mp3's from all directories entitled tracks and compress them, if they have'nt already
Describe to me what the following LISP functions do and describe the results. (defun m1 ( n ) (if (<= n 1) 1 (* n(m1(- n 1))))) (defun m2( x ) (cond ((null x) 0) ((atom x) (error "m1 applies only to lists")) ( T (+ 1 (length (cdr x)))))) defun m3( list ) (if (listp list) (loop (when (null list) (return NIL)) (print (pop list))))) ## Deliverables Desciption should consist of 25 words or less of what the functions do and the results using complete declarative sentences. ## Platform Any
Can someone describe to me what the following LISP functions do and describe the results of each? (defun m1 ( n ) (if (<= n 1) 1 (* n(m1(- n 1))))) (defun m2( x ) (cond ((null x) 0) ((atom x) (error "m1 applies only to lists")) ( T (+ 1 (length (cdr x)))))) defun m3( list ) (if (listp list) (loop (when (null list) (return NIL)) (print (pop list))))) ## Deliverables 25 words or less describing what the functions do and the results using declarative sentences ## Platform Any platform
...remainder theorem works: Suppose we have a system of congruencies. x=2 (mod 3) "Again equal represents congruencies" x=3 (mod 5) x=2(mod 7) To solve this system of congruencies, first let m=3.5.7=105 M1= m/3 =35 M2=m/5 =21 M3=m/7 =15 We see that 2 is an inverse of M1=35 (modulo 3) since 35.2=1 (mod 3) Similarly 1 is an inverse of M2=21 (modulo 5) since 21.1= 1 (mod 5) Again 1 is an inverse of M3 =15 (modulo 7) since 15.1=1 (mod 7) The solution to this system are those x such that x= + + a3. M3. y3 = 2.35.2 + 3.21.1 + 2.15.1 233= 23 (mod 105) So 23 is the smallest positive integer that is a simultaneous solution. ## Platform The program must compile on a g++ compiler. THE DUE DATE IS THURSDA...
Homework Assigment for Theory of Computation Nice opportunity to raise your **Coder Rating**! **1**.Prove that the following properties are functional: a) K1={ | P outputs 5 on the input 0 and does not halt on the input 5}. b) K2={ | P does not halt on the input 5}. **2**. Describe algorithms deciding the following properties defined: a) M3= { | starting on the empty tape, the program P reaches the given state q in at most 5 steps}. b) M4={ | there exists a configuration of P with the given state p that yields a configuration with tthe given state q}. **3**.Determine which of the following properties of programs are decidable. If property is decidable, briefly describe an algorithm deciding it. If property is undecidable, show that i...
...make sure that your program will work for lists of any length (up to a certain limit). **HINT** for this program is to modify the _merge sort_. I have attached test files 1 through 4. (i) The program will accept the input from a text file in the following format: (all the ki, ni and mi's are positive integers). k1 n1 n2 n3 n4 n5 n6 n7 n8 n9 n10 n11 n12 ...... k2 m1 m2 m3 m4 m5 m6 m7 m8 m9 m10 ...... This file contains a number of sequences of integers, for each of which inversions are to be counted separately. Each sequence begins with a ki, which is the number of integers in the ith sequence, all by itself on a separate line. From next line onwards will begin a sequence of integers. These numbers could be separated by white spaces or...
...invoice sheet. I can do this myself manually, we will see) 2) The big part ! One Excell sheet per work (work for carpet, work for painting, work for stonefloor, work for wallpaper, ... In this sheet, you will have several kind of work. Examples for Carpet : Cleaning floor, coating, placing of carpet, evacuation of waste, work hours,... For each step you will have the quantity, the type of quantity (m2, m3, hour, ...), the cost price by quantity, the sell price by quantity, the total of cost, the total of sale and finaly the benefit (sale-cost). For each line, you must select before "V" to "validate line" or X to "eXclude line" (total ZERO). If you forget V or X, the benefit must be negative (it's to not forget a work). With All "V" Lin...
...more questions. ---------------------- Consider a three-level memory hierarchy, M1, M2 and M3, with access times t1, t2 and t3, costs per byte c1, c2 and c3, and capacities s1, s2 and s3, respectively. The cache hit ratios are h1=0.95, h2=0.9. (Note that t2 is the access time between the CPU and M2, not between M1 and M2). (a) Derive a formula showing the effective access time Teff of this memory system. (b) Derive a formula showing the total cost of this memory system. (c) Suppose t1=20ns, t2=40ns, t3 is unknown, s1=512Kbytes, s2=5120Kbytes, s3 is unknown, c1=$0.01/byte, c2=$0.001/byte, and c3=$0.0004/byte. The total cost of the memory system is upper-bounded by $25,000. (i) How large a capacity of M3 (s3=?) can you acquire without exceeding the budget limit? (ii) How fas...
...m1,m2,m3,..., mi where 1<=mi<=n the neighboor tomatoes of ripe tomatoes will get ripe=red in the time of one day if they arent already ripe ATTENTION: every tomatoe in the line has 2 neighboor tomatoes except the 1st and the last which have ONLY 1. Write a programm which will calculate how many UNripe tomatoes will be left in the row after d (1<=d<=30) days NOTE: at the input the numbers of the ripe tomatoes are given in serial number eg: 1, 67, 120 Example of the problem starting day: akaaaaaaaaaakakaaaa end 1st day: kkkaaaaaaaakkkkkaaa end 2nd day: kkkkaaaaaakkkkkkkaa where a= unripe and k=ripe Input : a file named is given which has 2 lines. The first line contains the three integer numbers n,m,d with only seperator a space between them! The second line contains t...
I need a active x control (needs to be visual c++ bui...this but i might as well have it built so i do not need to use windows control. just act as windows make one. but add teh ability to change dialog title. need vb anc c++ example of controls use/ ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased. ## Platform win98,2k,m3,xp work must be completed no later than july 15th ## Deadline information must be made in visual c++ as an active x control. if the work is compelte in a week of acceptance a bonus will be concidered. i am producing small projects to meet coders. coders who do good work will be concidered for huge projects at least more profitab...
