Computer Science

Hi Gurus, For an algorithm to experience Belady's anomaly, a page that will be referenced in future needs to necessarily evicted. I understand that MRU as its name stands, removes pages that are needed the most, totally opposite to the idea of locality of reference. Although there are certain instances where it does better than others ( for example in case of a loop). Is it true that MRU can suffer Belady's Anomaly in any unfavorable cases? I have searched for an answer to this query for a day long, but found no explicit answer to this. I believe someone from the Science Forum, can surely help me understand this. Thanks, Aniruddha India

First of all I am a huge Battlestar Galactica fan, so I watched Caprica. I was disappointed, but the program that made the original Cylons made me think. Would it be possible to to create a Digital Double of a person using personality tests, and a lifetime's worth of journal entries?

Hello, I have an offer from university to study Computer Science. I like it a lot but sometimes I struggle horribly too and get very frustrated. Sometimes even shut the laptop and get away from problems... However, there is another thing: I lack practice and knowledge horribly because I did not have any IT classes available in my town's school and got an insight into programming only recently. What make me sad is that I know very little: usually people who study CS are already knowledgeable and has a lot of experience in advance before starting a degree. The course structure is here: http://www.sheffield.ac.uk/prospectus/courseDetails.do?id=4839362012 -----…

Hi guys, i'm trying to make the basic expectimax and star1 algorithm parallel. What part should I start doing the parallel process. thanks

Hello all, I was wondering what software would you need to create your own program for a clothing store? Something you would use at the front disk to check the price, how many pieces left, how many sold. Just curious and would like to know. I know back in school before I switched my major I took a class about Visual studio and we have done hotel room reservation. Would that be the same? Thanks Tima

Is the creation of an A.I really possible. I mean can we really write an algorithm to define life? Even the self evolving algorithms lead to nothing more than a new database of what to say when or what to avoid when. What is it that we're missing? any ideas are welcomed. Put forward your theory on how it can be created.

Hi. I was reading the book Ready Player One, and the idea of Aech's "Basement" Chat room sounded pretty cool to me. I got thinking, and decided I wanted to make a simple one for myself. A (comparitively) simple program, in first person, where I could boot the application, go into the basement, and mess around. Hopefully, I would be able to embed some emulators in it, so I could play Atari, Commodore 64, NES, MAME, and other things, as well as listen to music, and a fwe other things. This would not be available to the public; only to me and my friends that I give a copy to. Come to think of it, it could be top down, since it would be much easier, and would kind of work the…

I am pursuing mtech in computer science and engineering.As part of the course we need to find ieee/ACM or international journal papers for seminar. And i need to improve that paper and create an implementation based on that paper. I am particularly interested in - data compression - topics.

Hello everybody. There are so-called camera lens detectors. Link for reference: (the example of camera lens detector) The question is this: is it possible to construct a smart and intelligent hidden camera (with the respective hardware and software means) which will be able to detect such detectors, recognize theirs presence and automatically mask lens system, effectively preventing its detection? You see, a friend of mine wants to buy such thing to use for example in hotels, but I believe that such purchase is unnecessary. Any ideas? Thanks for your time!

These are some things that can be done in organizing open source crew: (link removed by moderator)

Hi all, I'm having a bit of trouble understanding how to construct binary syntax trees given a regular expression. Specifically, using the steps of the Thompson construction. Any advice or direction to a website that maybe gives a simple example? The regular expression is: a + ba* Much appreciated, Ray

The largest repository of networking methods, techniques, models and management. Is there a place like that? Well yes there is. The next question then is Where ca we find it? The answer is all around. It's everywhere, in every place by every person you may know or may not ever know. How would I be able to gain access to such resources? Well there are a lot of ways like conferences, seminars and conventions. To name one and is my personal favorite is "The International Conference in Computing, Networking and Digital Technologies" Cause in this conference, we can assure that resources are of highest quality considering the fact that participants of this conference who w…

Memento A = { E.n } where E is an event and n is the last number in the sequence. Through out the movie each scene expands on E.n The original length of the scene is E.n-1 but the point it is trying to get across is E.n-1+E.n By the end of the movie the length of the last scene is E.1 +E.2...E.n. Another funny thing i realized is that the main actor in memento acts like a computer. He recieves an input and displays an out. The input is the text on his pictures and the output is the action that he performs. His day will contain trying to achieve that event. His accepting inputs and displaying outputs. so we have A = {E.n-i} where n-i is the scene number and at t…

Image processing Artifical Intelligent

Hello, I am start working with graph matching. I need suggestions for good books and algorithms, in the topic graph matching, can someone help-me? My problem can be statement as following: There is two attributed graphs Gm=(Vm,Em) and Gd=(Vd,Ed) that should be merged. Each node vi in Vm contains 3 atributes, number of edges (in and out), area and color. Each node vi in Vd contains 3 atributes, number of edges (in and out), area and name. This should be formulated with an inexact graph matching problem with option for multiples nodes in Gm could be associated to one node in Vd. I am trying to formulate the fitness functions, but i need examples to do …

Do you have to create a mathematical base for it separately? Or is that handled by machine code? And is machine code a type of "pre-language" that enables a computer to interact with ("understand") a higher level language? In other words, does each new language have to teach a computer about general math and how to perform every type of basic calculation, or does the language assume the computer is outfitted with such capabilities, and the language only specifies in what order to perform calculations and how to react when text or any other kinds of input occur? Also, is there a variety of machine code languages, the way there is a huge variety of higher lev…

So I was looking through my computer using the Start button's search bar, for a windows 'reminder' application. Apparently one doesn't exist. But I did find something else... something pretty weird: a doc. file called 'reminder'; when opened there is some text, written in the symbol font- so I can't understand it. Any idea how I can translate or decrypt this seemingly hidden message?

I used bioruby program before. But it has some problem. What is the matter? It dose not work well. I do not know the cause of the trouble. ruby program [quit] require 'rubygems' require 'bio' #if __FILE__ == $0 begin require 'pp' alias p pp rescue LoadError end puts ">>> Bio::DDBJ::XML::Blast" serv = Bio::DDBJ::XML::Blast.new # serv.log = STDERR query = "MSSRIARALALVVTLLHLTRLALSTCPAACHCPLEAPKCAPGVGLVRDGCGCCKVCAKQL" puts "### searchSimple('blastp', 'SWISS', query)" puts serv.searchSimple('blastp', 'SWISS', query) execution result >>> Bio::DDBJ::XML::Blast /usr/lib/ruby/1.8/net/http.rb:56…

Hai, Do anyone know about LLVM compiler? Can you please help me to find the basic ideas to start with LLVM? Where could I find new project topic in LLVM?

hi, can I find code in matlab of agglomerative clustering method? thanks

Suppose one fine day in future, people gather up to form a perfect working group. What characteristics would that group have? Would it have strong or weak hierarchy, would it be faced to promote relaxed working environment or would it be faced to encourage members to work hard and to expose their best to outer world, would it be seamless across all segments or would it allow deviations in particular areas, would it accept new members, what rights would members have, how would it compare to today's most popular firm organizations, how important money would be, ... and stuff like that? I'm really curious about Ur opinions :|

hi, is the score of sequence alignmnet can be negative when alignmnet non biological sequence? Note: whether global or local alignmnet thanks in advance

Allow me to explain as contritely as possible. This all began about four years ago. I built my own pc, I purchased two different versions of windows xp from a local pc store. One xp pro 32 the other windows xp 64 bit. My first ISP was verizon at the time. This is right after they laid the new fiber optic cables. My router began being flooded with massive amounts of data and contacting ip addresses world wide, even when the pc was not in any use at all. I began a carefully calculated lock down of remote ports and exploit ports. When I finally had the problem defeated within a few min my router was destroyed internally so I had to get a new one from verizon. …

It's very frustrating that objects can't be explicitly deleted in Java... I can change the reference and let garbage collection delete it, but this gets tricky when there's more than one reference to the object. Why does Java have this limitation and is there any way to get around it? Specifically, I'm trying to implement a binary search tree. Ultra-specifically, I'm trying to write the function to delete a node. Deleting a leaf should be easy--just get rid of it. But it's turning out to be the hardest type of node to delete because to "just get rid of it," I have to go back and find the parent node, figure out whether the leaf is on the left or right branch, and set …

y does processor give out more heat when working with linux os when compared with windows