Displaying 20 results from an estimated 59698 matches for "solutations".
Did you mean:
salutations
2005 Nov 19
5
help with apply, please
Dear list,
I have a problem with a toy example:
mtrx <- matrix(c(1,1,0,1,1,1,0,1,1,0,0,1), nrow=3)
rownames(ma) <- letters[1:3]
I would like to determine which is the minimum combination of rows that
"covers" all columns with at least a 1.
None of the rows covers all columns; all three rows clearly covers all
columns, but there are simpler combinations (1st and the 3rd, or 2nd
2007 May 09
3
Increasing precision of rgenoud solutions
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
2019 Nov 20
2
[Clang] memory allocation
Hi,
Could anyone 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 */
2009 Mar 22
2
Global videoconferencing solution.
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 non millionaires ? Or even Free
? I remember a company who
2008 Dec 11
2
Simplex function in R
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.
The following R code
2010 Aug 30
1
Help With Post-hoc Testing
I am trying to do post-hoc tests associated with a repeated measures
analysis with on factor nested within respondents.
The factor (SOI) has 17 levels. The overall testing is working fine, but I
can''t seem to get the multiple comparisons to work.
The first step is to "stack" the data.
Then I used "lme" to specify and test the overall model.
Finally
2013 Aug 20
2
Triple- or Quad-display single-card graphics solutions
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 single card
2003 Sep 28
6
NAT/SIP solution?
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:
2019 Jul 25
2
[Bug 1357] New: Technical Solution Architect
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
2009 Jun 19
2
Manipulate solution of simplex
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
2008 Jan 05
1
Ecological Detective worked solutions [R-wiki]
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
horrible direct translations of the pseudocode
2018 Mar 22
4
[pre-RFC] Data races in concurrent ThinLTO processes
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 races, others - to
2007 Jun 27
2
OpenSer/Asterisk PBX solution
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 would like to talk
to them about buy their deploying,
2007 May 07
3
Bad optimization solution
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)
}
2018 Mar 27
2
[pre-RFC] Data races in concurrent ThinLTO processes
Le jeu. 22 mars 2018 à 16: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.
>
2007 Sep 11
2
Newcomer perceived problems with AAF/Ferret
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
2011 Jul 20
5
high performance open source DHCP solution?
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's asking for much.)
Anyone have any suggestions?
--
Also on LinkedIn??
2012 Feb 06
0
BDC constantly rebinds to master ldap server causing browsing delay
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
2007 Feb 18
1
Secure shared web hosting using MAC Framework
Hi all,
I am looking at securing a web server using 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
2004 Jul 27
4
SVD with positivity constraints
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