perhaps the [count*] notation means: repeat the line count times i.e.:
hd1
hd1
hd2
hd2
:
no time to dig or test yet, so this is just another guess.
On Wednesday, October 28, 2015 at 9:36:08 PM UTC+2, Ismael VC wrote:
>
> Hello everyone,
>
> I have succesfully added all nodes and I can init julia
One other potential useful piece of information. I've tried installing
packages ink and julia-client both using the Atom package manager, and by
following the instructions here:
https://github.com/JunoLab/atom-julia-client/tree/master/docs#developer-install
but it doesn't make a difference.
Ch
Here's the latest commit on my local Atom.jl:
colin@colin:~/.julia/v0.4/Atom$ git log
commit e2d2bd6d4be24acfe72f8e3d91291b424af70512
Merge: 2d78ca1 72a050a
Author: Mike J Innes
Date: Sat Sep 19 10:13:45 2015 +0100
Merge pull request #9 from ssfrr/depwarn-0_4
fixes some deprecatio
Looks like the cache fixed itself before I could try that. It works at the
moment.
On Tuesday, 27 October 2015 17:10:46 UTC-5, Tony Kelman wrote:
>
> Okay, sounds like you might be hitting
> https://github.com/JuliaLang/WinRPM.jl/issues/47 then. If you try
> deleting the https://cache.e.ip.saba
Thank you Seth, the count arg is not supported in 0.3.x, I'll update
shortly to 0.4.x
El miércoles, 28 de octubre de 2015, 13:42:55 (UTC-6), Seth escribió:
>
>
> On Wednesday, October 28, 2015 at 10:20:00 AM UTC-7, Ismael VC wrote:
>>
>> How can I start 2 workers on each node, using Julia 0.3.11?
Thank you very much Greg that worked! :D
El miércoles, 28 de octubre de 2015, 13:31:53 (UTC-6), Greg Plowman
escribió:
>
> On v0.3 try multiple entries (lines) in machine file, one for each worker.
Thanks all,
I managed to do it.
On Tuesday, October 27, 2015 at 9:43:45 PM UTC-7, julia...@gmail.com wrote:
>
> I want to debug the Debug.jl itself?
>
> Is there a special cut of instructions to do it? Because when i use @debug
> and @bp macro on itself. it fails.
>
> Thanks
>
On Wednesday, October 28, 2015 at 10:20:00 AM UTC-7, Ismael VC wrote:
>
> How can I start 2 workers on each node, using Julia 0.3.11?
>
> [count*][user@]host[:port] [bind_addr[:port]]
>
> The way I understand:
>
> [count*][user@]host[:port] [bind_addr[:port]]
>
> Is that `count` is an integer whil
Hello everyone,
I have succesfully added all nodes and I can init julia like this:
[root@hd0 ~]# julia -p 2 --machinefile Beowulf
_
_ _ _(_)_ | A fresh approach to technical computing
(_) | (_) (_)| Documentation: http://docs.julialang.org
_ _ _| |_ _
On v0.3 try multiple entries (lines) in machine file, one for each worker.
One reason would be to reduce pressure on the compiler: this will perform
badly in terms of memory usage and compilation time because a separate
version of "f" has to be compiled for every "T":
immutable X{T}
val::T
end
f(x) = println("got $(x.val)")
for i=1:10^5
f(X((zeros(i)...)))
end
Hi;
Is there an easy way to get function call tree in Julia.
For example, if a call f(3), it will give me a result like follows at least
in text format.
f(3)
|- g(4)
| |- h(5)
|- h(8)
Thanks
Tony, we can compare Github desktop too. The nominator below represents 32
bit of course. On battery, I should say. I wait until I see processor
usage < 5% before clicking and retest Julia too:
Github desktop: 32 s / 9 s = 3.5
Julia 0.4.0:20 s / 3.5 s = ~5.7
And in any other context in Julia, "in" is a function that returns "true"
or "false" based on whether the first thing is in the second thing.
As far as I'm aware, the language is supposed to be structured to make it
easy for a human to understand, with the underlying parser then converting
it i
Yeah, antivirus or something is more likely. We use the same version of git
for either 32 or 64 bit Julia, I wouldn't expect that much of a performance
difference between 32 and 64 bit if run on exactly the same setup.
On Wednesday, October 28, 2015 at 10:27:53 AM UTC-7, hustf wrote:
>
> Tony,
Tony, I also forgot to mention above. The small notebook has an SSD. It
seems to me that 64 bit versus 32 bit is the big factor here, but the 32
bit may have some bloatware virus program from HP.
It's a well-known issue. Is the slow machine using an HDD while the iMac
has an SSD? Also try the nightlies, we're using libgit2 on 0.5 which should
be much faster.
On Wednesday, October 28, 2015 at 10:18:56 AM UTC-7, hustf wrote:
>
> This just came in:
>
> 1seconds Windows 8.1 64 bit 0.4
Sorry, typo there:
1 seconds is on the same 64 bit computer, just running on the other disk
partition with Mac OS X.
There is no delay from working on Windows through bootcamp normally. I do
that 95% of the time out of preference, this includes gaming.
How can I start 2 workers on each node, using Julia 0.3.11?
[count*][user@]host[:port] [bind_addr[:port]]
I have a machine file, with only one node (one line), this examples are the
ways it works,
but adding only one worker per node, I'm using the default port for now and
not using a different
This just came in:
1seconds Windows 8.1 64 bit 0.4.0 an iMac from 2012, updated OS
3.5 seconds Windows 8.1 64 bit 0.4.0 bootcamp on an iMac from 2012
3.5 seconds Windows 8.1 64 bit 0.4.0 bootcamp on an iMac from 2012
20 seconds Windows 10 32 bit 0.4.0 a brand n
Let's shortly state why "in" is more appropriate. The notion "for i = 1 :
n" is established and meaningful *when* read as "for (i = 1) : (n)", very
similar in the mathematical notation $\sum_{i=1}^{n} f(i)$. Notice the
parentheses in both expressions! On the other hand, at any other location
"
This is probably a bit of a newbie question (and possibly going off topic)
but I typically use closures to
accomplish what Keno's let block does. For example,
a = 10
let a = a
global f1
f1(x) = x*a
end
function genf(a)
f(x) = x*a
return f
end
f2 = genf(a)
My question is: is th
I want quite the opposite behavior. I do want `f` to be updated every time `a`
is changed.
The question is: is it always true in any circumstance?
Thanks for the tip, just about time I try out @devec.
Right I forgot that I can make use of blas manually!
On 28 October 2015 at 14:25, STAR0SS wrote:
> You can try axpy! for the addition case, might be faster:
>
>
> http://docs.julialang.org/en/release-0.4/stdlib/linalg/#Base.LinAlg.BLAS.axpy
>
On Wednesday, October 28, 2015 at 8:10:41 AM UTC-4, Stefan Karpinski wrote:
>
> The key behavioral difference between these two is that with the
> non-parametric union version you can change both the value and the type of
> the field of a MyType object after construction, whereas in the parametri
On Wednesday, October 28, 2015 at 2:57:32 PM UTC+1, Tomas Lycken wrote:
>
> The Gmail app on Android can handle several Google accounts (at least on
> my phone :P) so the race might not be lost yet :
>
The point is: I don't want google to make a connection between two
(actually some more) onli
Hello,
has someone a working version for
julia >=0.4 and this nice python library pyqtgraph?
Under OSX 11.1 or Linux?
Thanks!
You can try axpy! for the addition case, might be faster:
http://docs.julialang.org/en/release-0.4/stdlib/linalg/#Base.LinAlg.BLAS.axpy!
No, it's just a matter of changing the parser to accept that – and
convincing people that it's a good idea.
On Wed, Oct 28, 2015 at 9:39 AM, DNF wrote:
> On Wednesday, October 28, 2015 at 2:29:54 PM UTC+1, Stefan Karpinski wrote:
>>
>> I think we're getting into Parkinson's law territory here. F
It can also be useful to set up filtering to take advantage of GitHub's
differential notification feature:
- notifications for issues in which you are directly involved (because you
subscribed, commented, or were '@' mentioned) will have your specific email
address set in the cc: field.
- notifica
On Wednesday, October 28, 2015 at 9:58:11 AM UTC-4, FANG Colin wrote:
>
> I am wondering if there exist the in place version of .* and .+, for
> matrix piecewise operation, so that it reduces memory allocation?
>
You just write a loop in this case.
Yeah, that's a good point. When you give the compiler the assurance that
"I'm not going to change the type of x here", you also loose the
possibility to do that :) Type instabilities are a major performance
bottleneck (one of the most common performance problems, actually...) but
in many applic
Hi all
I am wondering if there exist the in place version of .* and .+, for matrix
piecewise operation, so that it reduces memory allocation?
Or is there a plan to add them?
For the moment,
(.*)(A::SparseMatrixCSC, B::Number) = SparseMatrixCSC(A.m, A.n, copy(A.colptr),
copy(A.rowval), A.nzva
The Gmail app on Android can handle several Google accounts (at least on my
phone :P) so the race might not be lost yet :)
// T
On Wednesday, October 28, 2015 at 11:09:54 AM UTC+1, Andreas Lobinger wrote:
>
> Hello colleagues,
>
> thanks for the answers. I thought i'm missing some github configu
On Wednesday, October 28, 2015 at 2:29:54 PM UTC+1, Stefan Karpinski wrote:
>
> I think we're getting into Parkinson's law territory here. First off, I
> don't think this causes all that much confusion. Second, since this is pure
> syntax involving a keyword no less, this is one of the easiest th
You are right, it only "really" applies to indexing (and related)... but
that's kind of the point. There are only a select number of cases where the
"=" is more natural, but it is definitely more natural in those situations.
More generally, if you're wanting a simple counter to make the code do
I think we're getting into Parkinson's law territory here. First off, I
don't think this causes all that much confusion. Second, since this is pure
syntax involving a keyword no less, this is one of the easiest things to
mechanically fix should we chose to do so in the future.
On Wed, Oct 28, 2015
On Wed, Oct 28 2015, feza wrote:
> But really this seems like a fundamental enough language construct that
> there should be only one correct way; but on the other hand my brain
> doesn't have a problem with `=` and it seems natural since I have been
> using matlab for a while, even though `in
actually its more about simple confusion rather than mental cost @DNF.
Starting out you either use = or in then you see some other code and they
use something else and wonder, what is right, is one notation faster or
better, what's going on? Of course, it's not the simplest thing to try and
sea
May help long-term for other users of the same antivirus software to try
reporting the false positive, unless it's running in some paranoid mode where
it injects itself into all code JITting or filesystem access.
You are right, of course. It's just one of those minor cosmetic things you
fix in a pre-1.0 version, or then maybe never. And it's good not to have
too many of those.
Also
for i ∈ 1:N
just looks incredibly awesome.
On Wednesday, October 28, 2015 at 1:38:57 PM UTC+1, STAR0SS wrote:
>
> I think
I think people grossly exaggerate the "mental cost" of having both = and
in. It's really not that complicated, well explained in the docs and can
never cause bugs.
On the other hand the depreciation cost will big quite large, given it
seems both are used 50/50. Plus the numerous complain posts
Hi Simon,
Christian Haargaard just created a PR (
https://github.com/JuliaLang/Sundials.jl/pull/56), which means that there
is now (or should be) a working branch.
May I ask what you mean by "minor API differences"?
Best,
Alex.
On Saturday, 17 October 2015 10:58:10 UTC+2, Simon Frost wrote:
One solution is to make sure you're using the current release version of
Julia: parse(Int,string(lista[3])[1]) works as intended.
On Wednesday, October 28, 2015 at 3:06:26 AM UTC-7, paul analyst wrote:
>
> Is ok but I can`t convert to int
> julia> string(lista[3])[1]
> '4'
>
> julia> int(str
On Wednesday, October 28, 2015 at 10:22:45 AM UTC+1, Glen O wrote:
>
> The thing is, it IS an assignment that's going on. In the case of a range,
> especially, "for i=1:5" says "loop 5 times, with i=1, then i=2, then i=3,
> then i=4, then i=5". "i' is being assigned to on each iteration. Think
The key behavioral difference between these two is that with the
non-parametric union version you can change both the value and the type of
the field of a MyType object after construction, whereas in the parametric
version you can change the value of the field after an object has been
constructed,
On Wednesday, October 28, 2015 at 9:51:10 AM UTC+1, Tamas Papp wrote:
>
> I am probably old-fashined, but I always prefer to stick to ASCII unless
> there is a compelling reason. If I want something to stick out, I can
> always customize Emacs to do it.
>
Well, both 'in' and '=' are ASCII, s
On Wed, Oct 28, 2015 at 7:02 AM, 'Greg Plowman' via julia-users
wrote:
> Thanks Kristoffer.
>
> But for Q2, I'm not sure I want to exclude gc time.
> Rather I want gc time to be correctly allocated.
> I'm not really sure how gc works, but I thought calling gc() before each
> function call would en
Thanks Kristoffer.
But for Q2, I'm not sure I want to exclude gc time.
Rather I want gc time to be correctly allocated.
I'm not really sure how gc works, but I thought calling gc() before
each function call would ensure there are no outstanding gc's that might
happen during the call.
In other wo
Hi,
>
> I am at a loss how to proceed, so please forgive a rambling unfocused plea
> for help and I appreciate any questions to help me focus my search for a
> solution.
>
> I have Julia 0.4.0 installed on my MacBook running Windows 10 (I know I
> know :)). My installation is nice and snappy w
Ups:)
THX
Paul
W dniu 2015-10-28 o 11:12, Tamas Papp pisze:
Are you sure about that? Try x=99.
Best,
Tamas
On Wed, Oct 28 2015, Paul Analyst wrote:
Very smart, thx
Paul
W dniu 2015-10-26 o 23:18, David Epstein pisze:
A one-liner, with type conversion to get an integer back:
Are you sure about that? Try x=99.
Best,
Tamas
On Wed, Oct 28 2015, Paul Analyst wrote:
> Very smart, thx
> Paul
> W dniu 2015-10-26 o 23:18, David Epstein pisze:
>>
>> A one-liner, with type conversion to get an integer back:
>>
>> *convert(Int64,floor(x/10^(floor(log10(x)
Hello colleagues,
thanks for the answers. I thought i'm missing some github configuration,
but i see the some third party interaction is needed. As i use a different
account for my android phone working with this gmail account can't be
enabled.
Is ok but I can`t convert to int
julia> string(lista[3])[1]
'4'
julia> int(string(lista[3])[1])
52
Paul
W dniu 2015-10-27 o 09:35, Alireza Nejati pisze:
Michele's solution is preferred here, but you can also do it like this:
string(lista[3])[1]
A1. There will be an overhead for each call to f, however, if f does a
significant amount of work then this overhead will likely be insignificant
since you only call f once.
A2. If you don't want to include the gc timing in your benchmark you could
completely turn off the gc for the calls to f
Very smart, thx
Paul
W dniu 2015-10-26 o 23:18, David Epstein pisze:
A one-liner, with type conversion to get an integer back:
*convert(Int64,floor(x/10^(floor(log10(x)*
On Saturday, October 24, 2015 at 11:40:03 AM UTC-4, Michele Zaffalon
wrote:
There is also the builtin
http:/
The thing is, it IS an assignment that's going on. In the case of a range,
especially, "for i=1:5" says "loop 5 times, with i=1, then i=2, then i=3,
then i=4, then i=5". "i' is being assigned to on each iteration. Think of
it this way - suppose you were using elementwise operations. You could wr
On Wed, Oct 28 2015, DNF wrote:
> On Wednesday, October 28, 2015 at 7:56:54 AM UTC+1, Gabor wrote:
>>
>> Confusion?
>> Considering the investment into learning all the new and powerful Julia
>> language constructs,
>> I don't see why exactly this elegant duality would be a problem for anyone.
>>
On Wednesday, October 28, 2015 at 8:56:44 AM UTC+1, DNF wrote:
>
> I don't think = and in represent an elegant duality. They seem a very odd
> couple to me (even though I have been using = in Matlab for 15 years.) On
> the other hand, = and ∈ do seem to offer an elegant duality,
>
Sorry, of co
On Wednesday, October 28, 2015 at 7:56:54 AM UTC+1, Gabor wrote:
>
> Confusion?
> Considering the investment into learning all the new and powerful Julia
> language constructs,
> I don't see why exactly this elegant duality would be a problem for anyone.
>
I don't think = and in represent an eleg
Try running "git pull" from within the package directories. Maybe you're on
local master but don't have all the commits from remote? What's the most recent
commit you see in Atom.jl and CodeTools.jl?
-s
> On Oct 27, 2015, at 10:03 PM, colintbow...@gmail.com wrote:
>
> Done. Precompilation occu
that makes sense. many thanks!
在 2015年10月28日星期三 UTC+8下午3:14:26，Tomas Lycken写道：
>
> With a type declared like that, any access of the field x will be type
> unstable, which means that Julia’s JIT compiler will emit much more
> defensive, and thus slower, code.
>
> The solution is to declare a *pa
Thank you thank you Tony. Yes, we are using different antivirus software
and that was the culprit. Things are happy snappy now :)
On Wednesday, October 28, 2015 at 12:28:07 PM UTC+8, Tony Kelman wrote:
>
> Watch task manager while this is happening, see which other processes are
> taking cpu. An
With a type declared like that, any access of the field x will be type
unstable, which means that Julia’s JIT compiler will emit much more
defensive, and thus slower, code.
The solution is to declare a *parametric* type:
type MyType{T<:Union{Int64, Float64}}
x::T
end
That way, MyType(3)
I think I have read that passing around functions in not efficient.
Or maybe this is just anonymous functions?
In any case I want to run some comparison performance tests on many
functions, so have written a general function to perform tests on functions
passed in as arguments. See below.
Q1. Is
65 matches
Mail list logo
