search for: solution

...which also covers all columns. I solved this problem by creating a second logical matrix which contains all possible combinations of rows: tt <- matrix(as.logical(c(1,0,0,0,1,0,0,0,1,1,1,0,1,0,1,0,1,1,1,1,1)), nrow=3) and then subset the first matrix and check if all columns are covered. This solution, though, is highly inneficient and I am certain that a combination of apply or something will do. ########################### possibles <- NULL length.possibles <- NULL ## I guess the minimum solution is has half the number of rows guesstimate <- floor(nrow(tt)/2) + nrow(tt) %% 2 checke...

Dear All I am using rgenoud to solve the following maximization problem: myfunc <- function(x) { x1 <- x[1] x2 <- x[2] if (x1^2+x2^2 > 1) return(-9999999) else x1+x2 } genoud(myfunc, nvars=2, Domains=rbind(c(0,1),c(0,1)),max=TRUE,boundary.enforcement=2,solution.tolerance=0.000001) How can one increase the precision of the solution $par [1] 0.7072442 0.7069694 ? I have tried solution.tolerance but without a significant improvement. Any ideas? Thanks in advance, Paul

...please help me understand why Clang reallocates the same memory address for different variables while their lifetime intersect? Here is an example code: #include <stdlib.h> #include <stdio.h> #include <memory.h> #include <alloca.h> /* Checking information */ static int solutions[] = { 1, 0, 0, 2, 10, /* 5 */ 4, 40, 92, 352, 724, /* 10 */ 2680, 14200, 73712, 365596, }; #define MAX_SOLUTIONS sizeof(solutions)/sizeof(int) int total_count; int sharedVar = 0; int o...

Hello everybody, i am searching a solution for a videoconferencing, Any solution (Free/commercial). Asterisk is a great software, but recently we have more and more demands about videoconferencing of 3 or more peoples, Existing solutions are heavy and costly, around 2500? for 1 client. This is insane. Is there any solutions out there for no...

I have a set of linear equations and would like to find any feasible solution. A simplex solution works in Case 1 below, but not in Case 2. I would be grateful for any help. Case 1: Find any feasible solution for the set of linear equations: a + b + c = 5 a + b + 0c = 4 0a + b + c = 4 Solution - a feasible (and unique) solution is a=1, b=3, c=1....

...4 104 3.75 3.50 6.25 5.25 4.25 3.75 4.0 5.25 4.75 4.75 5.00 5.75 6.00 4.00 4.75 3.75 5 117 5.00 5.00 4.00 5.00 2.00 4.62 5.0 4.00 4.00 4.00 5.00 4.00 4.70 4.70 5.00 2.00 soi17 1 7.00 2 5.15 3 4.00 4 5.50 5 4.00 > stack <- reshape(ImpSoi,varying=soi,timevar="solution",idvar="iobs",sep="", dir="long") > solution <- factor(solution,levels(1:17),) > stack[1:5,] iobs solution soi 32.1 32 1 7.00 70.1 70 1 5.95 78.1 78 1 3.00 104.1 104 1 3.75 117.1 117 1 5.00 &gt...

So, after some discussion of our new control workstations, we are iterating in on a solution; we are looking at a 1U short-depth SuperMicro SuperServer 5017R-MF with a graphics card in the PCI-Ex16 expansion slot. However, the display requirements have increased to 3 or more monitors for future expansion, so I was wondering whether anyone had any experience with triple- or quad-display sin...

Greetings, I was wondering if somebody is working on a solution to the NAT/SIP-issues? It seems to me that the problem has been identified, is that correct? Just hoping that someone with more skills will provide us with a solution sooner or later... Regards, Stig -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.dig...

https://bugzilla.netfilter.org/show_bug.cgi?id=1357 Bug ID: 1357 Summary: Technical Solution Architect Product: bugzilla Version: other Hardware: All OS: All Status: NEW Severity: enhancement Priority: P5 Component: netfilter bugzilla Assignee: netfilter-buglog at lists.netfilter.org...

Hi, I need some help. I'm doing a project that demands me to obtain several simplex solutions and I would like to can keep the solution in a vector or something to be able to use it after I get it. The comand simplex() prints the solution but how can I keep it? Another alternative would be to export it to excel, how can I do this? I just see the solution and have to note it on a paper or...

Hi, I've added several pages of worked solutions for the book Ecological Detective by Hilborn and Mangel to the R-wiki. My hope is that this will be of use to others working through this book without access to a local expert. I am certainly not an expert, local or otherwise. I have posted solutions for chapters 3-6, which includes some really...

Hello, I am sending the following proposal to discuss issues and solutions regarding data races in concurrent ThinLTO processes. This caught my attention when we encountered a race condition in ThinLTO with caching. While looking into how ThinLTO deals with the problem of cache files reads/writes/deletes I spotted a lot of problems: some of them are related to data race...

We have been working a OpenSer/Asterisk solution to replace our Avaya PBXs.The OpenSer is to provide scalability and the Asterisk to provide rich features.I know this has been many times for calling card platforms but I'm not sure if anyone has a good scalable solution they are using on their virtual PBX or in a CPE PBX environment?If so I wo...

Dear All I am trying to perform the below optimization problem, but getting (0.5,0.5) as optimal solution, which is wrong; the correct solution should be (1,0) or (0,1). Am I doing something wrong? I am using R 2.5.0 on Fedora Core 6 (Linux). Thanks in advance, Paul ------------------------------------------------------ myfunc <- function(x) { x1 <- x[1] x2 <- x[2] abs(x1-x2) } opti...

...46, Steven Wu <stevenwu at apple.com> a écrit : > Hi Katya > > Thanks for investigating this. Here is my thought inline. > > On Mar 22, 2018, at 1:32 AM, katya.romanova at sony.com wrote: > > > Hello, > > I am sending the following proposal to discuss issues and solutions > regarding data races in concurrent ThinLTO processes. > > This caught my attention when we encountered a race condition in ThinLTO > with caching. > While looking into how ThinLTO deals with the problem of cache files > reads/writes/deletes I spotted a lot of problems: some of...

I blogged about some of the problems with aaf in production (http://www.jroller.com/BrightCandle) yesterday but inspired by the poitive response I thought I would share the perceived problems and discuss some of the potential solutions to help newcomers and make aaf work as if by magic just like Rails does. All of these problems boil down to one simple problem, running acts as ferret in a production environment simply is not consistent with the rails behaviour. Rails is single threaded system, resulting in multiple processes on...

The free DHCP solution, ISC, seems to be having scaling issues (i.e. handling only about 200 DHCPDISCOVER and 20 DHCPRENEW requests), and I was wondering if anyone had any open source suggestions of solutions that could scale much better? (Ideally, I could find a free version of a solution like Nominum, but I know that&...

Hello, I seem to be having an issue where one of my BDC servers constantly needs to rebind to the "master" ldap server (ldap1.ae-solutions.com). Whenever this happens I see several entries in the log like this: "smbldap_search_ext: waiting 928 milliseconds for LDAP replication." It appears to cause delay when browsing samba shares whenever this happens. The master ldap server is at a different WAN site, this BDC doe...

...sing the FreeBSD MAC Framework. To make things clear I will call the hosted users "web users". Those are the issues I am dealing with: ** Network Security ** - Web users shouldn't be able to connect to reserved local ports apart from 25(smtp); 80(http); 443(https) and 3306(MySQL) Solution: run the web server and web users shell in a jail, use ipfw to limit the jail access to localhost Those are the rules I have set: ${fwcmd} add 60 pass ip from any to any dst-port 25 jail 1 via lo0 ${fwcmd} add 61 pass ip from any to any dst-port 80 jail 1 via lo0 ${fwcmd} add 62 pass ip fro...

Hello, I have a matrix equation, Ax=b, that I need to solve for x. x should be a vector of positive numbers (between 0 and 1). A is not a square matrix in general. This lead me to using the SVD. However, using the SVD gives me positive and negative numbers, as well. I have some constraints included in the A matrix itself (i.e., that the sum of some xi should be equal to 1) but I do not know how