analysis

I have a bunch of code to find the primitive operations for. The thing is that there aren't really many detailed resources out on the web on the subject. In this loop: for i:=0 to n do print test end How many steps do we really have? In my first guess I would say n+1 considering n for the times looping and 1 for the print. Then I thought that maybe I am not precise enough. Isn't there an operation even to add 1 to i in every loop? In that matter we have n+n+1=2n+1. Is that correct? The loop can be broken down into its "primitive operations" by re-casting it as a while : int i = 0; while (i < n

I've just stumbled into the job of analysing a project for one of my company's clients (an SMB). I am a .Net developer (5 years) with little experience in analysing software (UML from school). We've just finished two weeks of talking with the users and got a nice big list of requirements. Obviously we've filtered out the most important requirements and had to mark a bunch as 'out of scope'. I have just started making some usecases, but feel I don't have the required expertise to bring this entire project to a good end. I'd like to know if someone has made the leap from developer to analyst and

I have read a counting sort algorithm which is like this: Counting Sort(A[1,..n]) //C[1,...k] is the temporary memory and k is the range of integers for i<-- 1 to k C[i]<-- 0 for j<-- 1 to n C[A[j]]<--C[A[j]]+1 for i<--2 to k C[i]<--C[i]+C[i-1] for j<--n downto 1 B[C[A[j]]]<--A[j] C[A[j]]<--C[A[j]]-1 I want to know that if I change the last for to this: for j<--1 to n ,the algorithm will be correct too???(is there any way to show that with this "for" the algorithm will be correct??? ) also in this way the algorithm is stable too? thanks The algorithm is correct both ways. It is also stable as

I have two versions of a Java application which use different concurrency logic. I want to analyze and compare their performance (such amount of time a lock was acquired etc.) so that I can use the better one. I found out a tool IBM Lock Analyzer for Java but it is neither open source nor JDK version independent. It requires an IBM®-supplied Java™ SDK or JRE. Another tool also from IBM is Multicore Software Development Kit and has the following problem "The testing and analysis tool of MSDK runs on Sun JDK, except the lock analysis tool. The performance tool requires an IBM JDK." So can

Solr has the built-in "Analysis Screen" , which helps to debug the interplay between tokenizers and filters for specific field types: Is there a plugin for ElasticSearch that does something similar? Specifically, I want to see the input/ output of each filter, not only the end result of the analysis chain. I used Google quite intensively on this, but didn't find anything. https://www.found.no/play/#analysis contains exactly the feature I want (scroll down to "myAnalyzer"), but unfortunately it's not something I can run on my index. But it shows that such a feature is possible. Edit: I know

Anyone knows how to take advantage of ggplot or lattice in doing survival analysis? It would be nice to do a trellis or facet-like survival graphs. So in the end I played around and sort of found a solution for a Kaplan-Meier plot. I apologize for the messy code in taking the list elements into a dataframe, but I couldnt figure out another way. Note: It only works with two levels of strata. If anyone know how I can use x<-length(stratum) to do this please let me know (in Stata I could append to a macro-unsure how this works in R). ggkm<-function(time,event,stratum) { m2s<-Surv(time,as.numeric