similar to: Problem with hard links

Displaying 20 results from an estimated 10000 matches similar to: "Problem with hard links"

2012 Apr 11
12
[Bug 8856] New: --hard-links does not handle hard-linked symlinks correctly on FreeBSD
https://bugzilla.samba.org/show_bug.cgi?id=8856 Summary: --hard-links does not handle hard-linked symlinks correctly on FreeBSD Product: rsync Version: 3.0.7 Platform: All OS/Version: FreeBSD Status: NEW Severity: normal Priority: P5 Component: core AssignedTo: wayned at
2011 May 19
2
trouble with summary tables with several variables using aggregate function
Dear all, I am having trouble creating summary tables using aggregate function. given the following table: Var1 Var2 Var3 dummy S1 T1 I 1 S1 T1 I 1 S1 T1 D 1 S1 T1 D 1 S1 T2 I 1 S1 T2 I 1 S1 T2 D 1 S1 T2 D 1 S2
2009 Oct 11
1
Solving a nonlinear System of equations
Hello there, I wish to solve the following nonlinear System of equations: + u1 - Vmax11*S1/(S1 + Km11 *(1 + S2/Km21)) - Vmax12*S1/( S1 + Km12 *(1+S2/Km22)) == 0 + u2 - Vmax22*S2/(S2 + Km22 *(1 + S1/Km12)) - Vmax21*S2/( S2 + Km21 *(1+S1/Km11)) == 0 + Vmax11*S1/(S1 + Km11 *(1 + S2/Km21)) + Vmax12*S1/( S1 + Km12 *(1+S2/Km22)) - d1*P1 == 0 + Vmax22*S2/(S2 + Km22 *(1 + S1/Km12)) + Vmax21*S2/( S2 +
2005 Dec 01
2
Minimizing a Function with three Parameters
Hi, I'm trying to get maximum likelihood estimates of \alpha, \beta_0 and \beta_1, this can be achieved by solving the following three equations: n / \alpha + \sum\limits_{i=1}^{n} ln(\psihat(i)) - \sum\limits_{i=1}^{n} ( ln(x_i + \psihat(i)) ) = 0 \alpha \sum\limits_{i=1}^{n} 1/(psihat(i)) - (\alpha+1) \sum\limits_{i=1}^{n} ( 1 / (x_i + \psihat(i)) ) = 0 \alpha \sum\limits_{i=1}^{n} (
2004 Oct 12
5
[LLVMdev] set_intersect and Visual C compiler
On Tue, 12 Oct 2004 14:01:21 -0500 (CDT) Chris Lattner <sabre at nondot.org> wrote: > On Tue, 12 Oct 2004, Morten Ofstad wrote: > > > This is my first post on this mailing list, so bear with me... My name > > is Morten Ofstad and I work for Hue AS (www.hue.no), a company that > > makes 3D Visualization software. We are looking into using LLVM for JIT > >
2012 Feb 23
1
[LLVMdev] Simple question on sign
Hi James, So does this mean if the instruction could set the overflow flag, the instruction should not have [(set ... )] in it's pattern, i see this is the difference in instruction description for the mips case. I'm wondering how llvm knows when to use certain compare instructions such as SETNE or SETUNE? And for sign or zero extending loads? I can see the PatFrags described and the
2012 Nov 01
2
[LLVMdev] llvm linking issue
I have three modules: ----------------------------------------------------------------- s1.ll: %0 = type <{ i32, i32 }> define void @s1(%0* byval %myStruct) nounwind { return: ret void } ----------------------------------------------------------------- s2.ll: %0 = type <{ i32, i32 }> define void @s2(%0* byval %myStruct) nounwind { return: ret void }
2012 Nov 01
0
[LLVMdev] llvm linking issue
Hi Xiaoyi, this looks like a bug to me - please file a bug report. Ciao, Duncan. On 01/11/12 04:35, Guo, Xiaoyi wrote: > I have three modules: > ----------------------------------------------------------------- > s1.ll: > > %0 = type <{ i32, i32 }> > > define void @s1(%0* byval %myStruct) nounwind { > return: > ret void > } >
2004 Dec 09
1
more clustering questions
Sorry to bother you kind folks again with my questions. I am trying to learn as much as I can about all this, and I will admit that I don't have the proper background, but I hope that someone can at least point me in the correct direction. I have created a test matrix for what I want to do: s1 s2 s3 s4 s5 s1 10 5 0 8 7 s2 5 10 0 0 5 s3 0 0 10 0 0 s4 8 0 0 10 0 s5 7
2009 Jun 02
1
Difference between rsync -r S1 S2 T and cp -r S1 S2 T
The manual says rsync can be used as an improved cp command. If S1 and S2 are (local) source files or directories and T is an (local) existing directory, is it safe to think that $ rsync -r S1 S2 T does the same thing as $ cp -r S1 S2 T , assuming no trailing slashes in S1, S2? -- View this message in context:
2004 Oct 13
0
[LLVMdev] set_intersect and Visual C compiler
Both are working well on VC. Just tested. template<class STy> void set_intersect(STy &S1, const STy &S2) { for(STy::iterator I = S1.begin(), E = S1.end(); I != E; ) if (S2.count(*I)) S1.erase(*I++); else ++I; } template <class S1Ty, class S2Ty> void set_intersect(S1Ty &S1, const S2Ty &S2) { for (typename S1Ty::iterator I = S1.begin(); I !=
2017 Feb 07
2
[PATCH] Optimize silk_warped_autocorrelation_FIX() for ARM NEON
This is a great idea. But the order (psEncC->shapingLPCOrder) can be configured to 12, 14, 16, 20 and 24 according to complexity parameter. It's hard to get a universal function to handle all these orders efficiently. Any suggestions? Thanks, Linfeng On Mon, Feb 6, 2017 at 12:40 PM, Jean-Marc Valin <jmvalin at jmvalin.ca> wrote: > Hi Linfeng, > > On 06/02/17 02:51 PM,
2004 Oct 12
0
[LLVMdev] set_intersect and Visual C compiler
On Tue, 12 Oct 2004, Morten Ofstad wrote: > This is my first post on this mailing list, so bear with me... My name > is Morten Ofstad and I work for Hue AS (www.hue.no), a company that > makes 3D Visualization software. We are looking into using LLVM for JIT > compiling shader programs, to replace our own (slow) VM. A requirement Neat! > for this is that we can compile LLVM in
2018 Feb 07
2
add geo-replication "passive" node after node replacement
Hi all, i had a replica 2 gluster 3.12 between S1 and S2 (1 brick per node) geo-replicated to S5 where both S1 and S2 were visible in the geo-replication status and S2 "active" while S1 "passive". I had to replace S1 with S3, so I did an "add-brick replica 3 S3" and then "remove-brick replica 2 S1". Now I have again a replica 2 gluster between S3 and S2
2009 Jul 29
3
Object equality for S4 objects
To test two environments for object equality (Lisp EQ), I can use 'identity': > e1 <- environment(local(function()x)) > e2 <- environment(local(function()x)) > identical(e1,e2) # compares object identity [1] FALSE > identical(as.list(e1),as.list(e2)) # compares values as name->value mapping [1] TRUE # (is there a
2007 Jul 18
2
Linear programming question
Hi everybody, consider please an optimization problem: minimize sum S1+S2 Subject to : y - x =< A + S1 x - y =< A + S2 and we want to add two more constraints: y - x =< B - S3 x - y =< B - S4 where A is a small constant value and B is a large constant value, S1 and S2 are surplus and S3
2010 Aug 05
1
Samba4 replication PDC/BDC Status
Dear all, I set up a samba4 dc (S1; provisioned) on a physical machine and a second samba4(S2) on another machine. S2 wa set up without provisioning by replication. Users, groups are well replicated and show up on both DCs. But when I stop S1 my win-clients can logon( I think only cached) but the shares on S2 are not accesible. Error no DC available. Starting S1 again all shares on S2 work well.
2013 Jan 13
1
Understanding tinc edge connections and re-routing
Hi, I have successfully setup a tinc network between five hosts (in switch mode). Two of the hosts have static and known IP addresses (S1 and S2). Other hosts (H3-H5) connect one (or both) of them. The traffic flows nicely between all hosts. The initial edges (ConnectTo configuration directives) in my test network are: S1<->S2 H3 -> S1 and S2 H4 -> S1 H5 -> S2 As far as I have
2009 Jul 25
1
regex expression to select row or column
I have a multidimensional data which looks like the following: "S1-a" "S2-b" "S3-c" "S4-d" "S5-a" "S6-b" "S7-c" "S8-d" "T1-A" "T1-B" "T1-C" "T1-D" "T2-A" "T2-B" "T2-C" "T2-D" I read it from csv file and would like to have 16
2009 Mar 06
1
frequency of subsequent events
Hello, The example shows a sequence of songtypes a bird has sang. The entire list contains several thousand songs which the bird has produced consecutively. Is there any convenient way in R to produce a contingency table which shows how often a special song type was sang after a special other songtype? Or within a determined frame of e.g. 10 consecutively produced songs? Example: Nr Songtype 1