Computer Science

I am having trouble figuring out this code b2.addEventListener(MouseEvent.CLICK,b2handler); function b2handler(event:MouseEvent){ if(currentFrame>=0 && currentFrame<=50){gotoAndPlay(50)} else if(currentFrame>=51 && currentFrame<=115){gotoAndPlay(115)} else if(currentFrame>=116 && currentFrame<=180){gotoAndPlay}(180)} else if(currentFrame>=181 && currentFrame<=195){gotoAndPlay}(50)} } And it shows the error, "Error 1083: Syntax error: else is unexpected" Can anybody help?

Any link to get this book and download it plzzz! Thxxx!

Hi all I am looking for some examples online of any area of medicine that uses a data base (informatics) with some figures and proof that they use it, my search turns up either nothing useful or I get explained to me how Informatics is used in medicine, which I already know *sighs* Does any one know where I can some of these examples or actual data bases of the internet? they can be from any companies what so ever too. It can be on any topic related to medicine. I just need some samples for a teaching booklet :/ Thanks for any help any one can offer! Izzy

Hi i am new on the forum. I am making a smartphone application and this is the first time i’m working with algorithms. I am looking for algorithms that can convert x and y value on a Cartesian plane (x,y) to a angle. The angle can be 0-360 degrees or 0-2π radians. Does anyoneknow of such algorithms? I have looked for geometric algorithms on Google. I have also found a list of algorithms on Wikipedia, but no luck finding this particular algorithm. Also are there search databases that solely contain algorithms? Below is a visual presentation of the conversion the algorithm has to do: Thank you in Advance!

Hello, i have to make an automated thoerem prover using natural deduction method and express the proof in a human-friendly style. i've been searching google but most of the materials there are about resolution method. Can anyone give me some books/hints/algorithm about this please? Thanks. example show how to display the proof: http://nv2.upanh.com...67502.resol.png

Recently, a friend of mine asked me to help with the following optimization problem in graph theory: Given a connected graph, decompose it into 3-vertex groups such that the number of resulting groups is minimal. 3-vertex group must be connected in the original graph: it will have 2 or 3 edges. Obviously, there might be some remainder groups with less than 3 vertices. The goal is to minimize the number of such remainder groups as well. Example: take a map of us. Make states nodes and the borders edges. Take Illinois, Wisconsin, Minnesota, Kentucky, Indiana, Missouri. The solution would produce 2 groups. We have an algorithm that seems to work. However…

Hi everyone. I have a great program going that people can talk with and enjoy themselves, but i think it would be so much more fun if i got the audio working. I want it to listen while its not silent, store the sounds in a list and a string if i can, and perform operations on the string. I want it to be able to play back the audio as well. I want to get this done asap thanks for the help! Popcorn

So im in graph theory at my college and i have never done a single proof in my life. Normally the teacher gives us an option of either a proof or a program sense this class is also required for math majors. This time around however he decided to give every one one proof and one program and as far as the proof goes i am 100% lost. The question goes as follows: Corollary 3.2.24: Every binary tree of height h has at most 2^(k+1)-1 vertices. Prove corollary 3.2.24 directly with the "strong form" of induction using its weaker induction: For some h>0 and all k<=h-1, a binary tree of height k has at most 2^(k+1)-1 vertices. I'm not looking for a direct answer but any h…

has anybody ever thought whast the difference by count matematicaly or progress informtation

Hi everyone, Can anyone help me to answer the question below? I would really appreciate it if you could help me. I have been searching for a solution for this question in books but could not find a proper explanation of how these things work. A processor has 24 registers, uses 8-bit immediates, and has 36 different instructions (corresponding to 36 operation codes) in its instruction set. These 36 instructions are classified into 4 types as listed below: Type-A: takes 2 source registers, uses 1 destination register; Type-B: takes 1 source register, uses 1 destination register; Type-C: takes 1 source register, 1 immediate, uses 1 destination register; Type-D:…

I am stuck on a lab assignment where I need to use a version of ubuntu in VMware Player to write some .c files that will use a buffer overflow vulnerability to generate a shell that has root privileges. I can only use the following 2 files: stack.c #include <stdio.h> int bof(char *str) { char buffer[12]; //BO Vulnerability strcpy(buffer,str); return 1; } int main(int argc, char* argv[]) { char str[517]; FILE *badfile; badfile = fopen("badfile","r"); fread(str, sizeof(char),517, badfile); bof(str); printf("Returned Properly\n"); return 1; } exploit.c #include <stdlib.h> #include <stdio.h> #inc…

how to learn formal language and finite automata and how to know the differences in DFA and NFA ?

I need help with a program i wrote that checks online for updates, but I'm wondering if the page turns off when i turn off my computer and if it does how can I make it stay running al the time ?

Question 1 How many different minimum cuts are there in a tree with n nodes (ie. n−1 edges) ? n n2 n−1 2n−2 Question 2 Let "output" denote the cut output by Karger's min cut algorithm on a given connected graph with n vertices, and let p=1n2. Which of the following statements are true? For hints on this question, you might want to watch the short optional video on "Counting Minimum Cuts". For every graph G with n nodes, there exists a min cut (A,B) of G such that Pr[out=(A,B)]≥p. For every graph G with n nodes, there exists a min cut (A,B) such that Pr[out=(A,B)]≤p. There exists a graph G with n node…

LZW on cuda is a feasible project?Is there any difficulties to implement a LZW dictionary based algorithms on CUDA.please reply. I have no GPU ,how CUDA emulator can be downloaded?

ok so for the gantt charts of a and b, this is what i got. so did i do it right? (i'm pretty confused with this class... so... please help me)

oke it might be far fetched But a HD is a plate made of magnetic material when data get write on the disc it exists out of and random Binary numbers and not focus the magnetic plate but if i write program that format the whole disc into only focused binary number say makes any number 1 the whole plate get in basically magnetized and so doing can damage the head that get pulled to the disc so basically software that can damage Harddrives Pyisical. is this just nonsense or is it really possible?

Hy! I just finished my studies at my secondary school and planning to study quantum-computing. In which universities can i study it?Which universities have a strong quantum computing curriculum, and offer some type of quantum computing/information courses/research particurarly in Europe?I already looked some of them f.e: IQC at University of Waterloo, CQTat National University of Singapore,MIT, and Imperial College. I would appreciate some suggestion/opportunities from people who have interest in these fields or studying it.

I recently acquired around 30 computers when a school transferred locations and received new equipment. My main goal was to keep them out of the land fill... now I'm trying to keep them out of the scrap yard as long as possible. My (and my two friends) goal with this project would be to give these computers some work to pay for their own electricity and internet (how little or lot they use) and give one of their parents a little bit of profit for keeping them in their place. The rest of the profit would go to collecting more used/new computers to add to the system. The problem that I have now though... is I can't figure out what they can do... They aren't really powerfu…

Hello, +greetings i'm a new member and my first post on the website will be this, I can understand asynchronous events that the cpu must deal with, but can someone give me an example of synchronous. thank you, -Jadeydrag0117 about me> http://www.scienceforums.net/topic/72566-new-member/

The question is the following: Why is crime reporting so low in "major industries? I am supposed to have a 1 page, double spaced response. However, I have only been able to come up with a little more than half a page, which is the following: One possible reason crime reporting is so low is to give the impression that the company is secure. This is a common strategy that is used to keep people from panicking and getting distracted from their assigned duties. This can also provide mild deterrence, because some hackers may not want to attack a company that has not had a successful at against it. They may just want to target companies and institutions that hav…

I've started reading a book about concurrent programming and found the part about critical reference quite difficult to understand. - Definition 1: An occurrence of a variable v is defined to be a critical reference if a) it is assigned to in one process and has an occurrence in another process b) if it has an occurrence in an expression in one process and is assigned to in another - Definition 2: A program satisfies limited-critical-reference (LCR) if each statement has at most 1 critical reference. "Concurrent programs that satisfy the LCR restriction yield the same set of behaviors whether the statements are considered atomic or are compiled to a machine ar…

Excuse me, dear members of this chat can you help me to find one of magazine it`s magazine *American science* 1852 year juli mounth please help me i need to scan this magazine

When I go to the website arin.net, and I do a Whois query in the top right-hand corner on google.com, why does it return two results? The only difference is the handle number, but everything else is the same. I've been tasked with finding out what the difference is between the two, or more appropriately, why two results are returned. Can anyone help?

I already have self-control on my Ubuntu operating system, but that has a 24 hour cap on its timer. I need a program that can block out a single website for months or even permanently. I don't want myself to be able to glance at it even once in the next several months. And no, it's not porn...