search for: strategy

...to that question, I think most examples buy 100 shares each time a buy is triggered? Is it possible to make the rules only buy at the first buy trigger? So the fund is either long 100% equity or in cash for a fixed starting equity. Another idea I would like to try to implement is a slow trading strategy where you have to keep a position for at least x days after a buy. For example some small cap or international funds have a penalty for trading in and out too quickly. It would be nice to test how much such a restriction hurts you? My final question is how to create a rule that uses more than on...

Hello dear R-help mailing list, The other day I published a blog post (with some R code) to help R-users who want to implement a simpler upgrading strategy for R (under windows - but probably the same will be true of mac OS, I am not sure about Linux). This e-mail has 3 goals: (a) To share, (b) to get feedback, and (c) to propose to implement this strategy to R's core. * * *a) Share* The idea of this upgrading strategy is to save steps in upgradi...

Hi., do you think that sbr policy in queue strategy will be useful? Bye ---------- Forwarded message ---------- From: nik600 <nik600 at gmail.com> Date: Sat, 7 Mar 2009 15:21:14 +0100 Subject: add a new queue strategy: SBR To: Asterisk Developers Mailing List <asterisk-dev at lists.digium.com> Hi to all isn't there any plan to add...

Hi guys, I am doing a project to evaluate the 7 individual fund performance from a portfolio compared with all fund performance utilizing the same strategy. Lets say in total there are 10 strategies and in the portfolio there exist 5 strategies. First, i use the BOXPLOT() and SUBSET() to produce the box plot of all the 5 funds performance individually: #identify funds in strategies within the portfolio filteredFunds = subset(allfunds,Strategy %in%...

I was playing today with the different queueing strategies in queues.conf when I noticed the following behavior. I have 4 agents defined in a queue in queues.conf. These agents login using AgentCallbackLogin. The strategy in the queue is set to leastrecent. I place four calls into the queue and * sends only one call to the least recently used agent. If that agent does not pick up, the call is sent to the next agent. If that agent does not pick up, the call is sent to the next agent. This repeats for all agen...

Hi all, I am trying to write an application to monitor queues using the Asterisk Management API. So far I have had some level of sucess, basically reverse engineering the protocol and the event messages using ethereal etc. I know there are a couple of pages on the Wiki that attempt (no dis-respect to who ever did it as it has been a great help) to document the API and was wondering if there

...tempted setting up a queue with agents that log in, and get called with incoming calls: Agents log in using: exten => *88,1,AgentCallbackLogin(${CALLERIDNUM}|${CALLERIDNUM}@test-sip) Calls get into the queue with: exten => 6029995654,1,Queue(test-noc|t|||60) queues.conf: [test-noc] strategy = rrmemory context = test-sip timeout = 10 retry = 4 member => Agent/@2 agents.conf: [agents] ackcall=no group=2 agent => 6029995670,,Joe Bob agent => 6029995671,,Billy Dude Agents can log in fine, but all calls end up at the phone of the first agent to log in. Always...

I have set up an operator queue for our receptionist. That way, if she takes a break or is out, by logging out of the queue, calls to the "Operator" can be handled by other agents. I have set strategy = roundrobin in queues.conf. According to "the book" ATFoT, roundrobin always starts with the first agent in the queue. This is the desired result. I want all calls to start there, and if she is busy or does not answer, calls should go to the next agent logged into the queue. Yet, I a...

...VM handle the "new statement" of C++? Could any one give me any hint? Second, what properties does the callgraph generated by LLVM has? One property I am interesting in is whether the callgraph is a safe approximation of its corresponding run-time callgraph. Third, does LLVM provide any strategy to resolve function calls? If yes, what strategies does it employ? Thanks! Best, Xiaolong

Hi, Our DSL emit sub-optimal LLVM IR that we optimize later on (LLVM IR ==> LLVM IR) before dynamically compiling it with the JIT. We would like to simply follow what clang/clang++ does when compiling with -O1/-O2/-O3 options. Our strategy up to now what to look at the opt.cpp code and take part of it in order to implement our optimization code. It appears to be rather difficult to follow evolution of the LLVM IR optimization strategies. With LLVM 3.3 our optimization code does not produce code as fast as the one produced with clang...

Hello Philip, it seems like r226311 [1] introduced a bug which causes finishAssembly() to be called multiple times, even if there is only one strategy. For each function, GCModuleInfo::getFunctionInfo() adds the strategy to the StrategyList instance variable. AsmPrinter::doFinalization() calls finishAssembly() for each strategy in this list. -Manuel [1] http://reviews.llvm.org/rL226311

Hi all, We''re having a rather unique problem with class caching. We are implementing the strategy pattern in the following manner: 1. Set an accessor for the class, let''s call it :strategy class Widget cattr_accessor :strategy end 2. In environment.rb, we instantiate an object that implements the strategy and use the accessor to set it for the class strat = MyStrategy.ne...

Hi folks, I''m pleased to offer a more detailed explanation of Oracle''s strategy for the Lustre File System. The attached slide deck outlines our plans, answering the following important questions that our users have been asking: - What is Oracle?s open source strategy for Lustre? - Where can I get Lustre today? - Is Oracle going to support a Lustre community? - Will Oracl...

Seeing as the "leastrecent" strategy does not work for us (it will *always* call the leastrecent agent, even if that agent is busy, and will not move to the next agent) I thought I'd try the roundrobin strategy. This seemed to work - however, I had my supervisor telling me today that a certain agent seemed to be getting most o...

Hello, i have to backup (tape library) a mailsystem with about 300.000 Mailboxes on 2 backends. Summary of all mailboxes are 2 TByte. The mailstore is mdbox. Is it save to do a simple filesystem backup (full and incremental) with backupsoftware? What is the prefered strategy to do a backup for desaster recovery (mailsystem crash) and restoring single usermailboxes? Regards, Claus

Dear R-list, I apologize for my many emails but I think I know how to desctribe my problem differently and more clearly. My question is how to compare linear models with intercept and those without intercept using maximizing adjusted R^2 strategy. Now I do it like the following: > library(leaps) > n=20 > x=matrix(rnorm(n*3),ncol=3) > b=c(1,2,0) > intercept=1 > y=x%*%b+rnorm(n,0,1)+intercept > > var.selection=leaps(cbind(rep(1,n),x),y,int=F,method="adjr2") > ##### Choose the model with maximum adjr2 &gt...

..., > > and ideally merged, it is an unknown quantity. Good well meaning > > people routinely drop their projects, good projects run into > > unexpected roadblocks, and life happens. > > That's not the point -- at least it never was my point. > > Upstream has set a strategy, and it's totally fine to raise concerns, discuss > them, look for solutions, draw conclusions and do adjustments where needed. We don't really do strategy in the kernel. This language is a bit off putting. Linux runs on community consensus and if any strategy exists it is reflected by...

...re are 30 funds in my portfolio with 7 different strategies. "FundName"(fundNames), "fundStrats", "Return"(fundrets) Here is my code: for(i in 1:T){ # T equals to the amount of strategies in my portfolio strat = portStrats[i]; #get strategy portidx = fundStrats == strat; # identify portfolio funds of the same strategy frets = fundrets[portidx]; fnames = fundNames[portidx]; #get returns and names,? frets?: fund return, ?fnames?:fund name N = length(frets); s = 1 / N; #now figure out where to put the labels...

Hi All, if memory serves me well I recall some paper comparing the relative success in getting mainstream acceptance (as mainstream as statistics can be) of both R and Octave. I remember vaguely that the fact the development strategies (core team vs one main developer) played a major role in the relative success of the two programs. I tried to find this paper, but my goggle skills are failing

...lties for my agents. What is happening: two agents configuired one agent with penalty 1 and the other with penalty 2. All the calls must go first to Agent 1 and if his line is busy then only then agent 2 will get the call. However my queues are not behaving in this manner. I have impmemnted ringall strategy. Now when first call comes it ends up with agent 1, when secnd call comes it continue wait in queue and doesn't go to agent 2 and when agent one is free it goes to this agent. I have set penalties in queue.conf. I have monitered my queue and witnessed that my agent1 status shows Not In Use...