what is your versioninfo()?
Am 09.09.2015 um 08:17 schrieb Arch Call :
> I am getting fma not defined! It is probably related to line 22.
>
> On Wednesday, September 9, 2015 at 1:04:34 AM UTC-4, Jeffrey Sarnoff wrote:
> I wrote this FloatTest to find out if three things that should be true of
It's "rm": http://docs.julialang.org/en/latest/stdlib/file/?highlight=rm#Base.rm
Am 06.09.2015 um 17:56 schrieb J Luis :
> Let's say that in a script I had to create a temporary file. How do I delete
> it when no longer needed? Searched the docs for delete and remove but didn't
> find a soluti
Only process number 1 has the actual underlying file handle. Therefore all
other workers, when trying to read, report that the file is unaccessible.
You could try to designate one worker for the reads, i.e. use something along
the lines of
@fetchfrom 1 dset=fid["punkty"*string(i)]
You could
Hi,
yes, it works almost the same:
julia> eval(parse("[1,2,3]"))
3-element Array{Int64,1}:
1
2
3
parse parses the string into an expression (abstract syntax tree, AST), and
eval, well, evaluates ;-)
But take care, any valid code inside the string will get executed.
Rene
Am 31.08.2015
There is no difference. identity is defined as "identity(x) = x", and this gets
inlined by the compiler.
You can also check, for example, the output of "@code_native f(1)" and compare
it with g.
Am 30.08.2015 um 16:06 schrieb Diego Javier Zea :
> Thanks!
>
> One more question, what is the di
Thanks for the info.
I filed an issue with IJulia about this:
https://github.com/JuliaLang/IJulia.jl/issues/347
Am 29.08.2015 um 22:12 schrieb Christoph Ortner :
> Many thanks for this:
> * On 0.3.11, it works fine for me
> * On Version 0.4.0-dev+6297 (2015-07-27 21:28 UTC) I have the same
Can you try whether adding a flush(STDOUT) after the print statement makes any
difference?
Am 28.08.2015 um 15:16 schrieb Christoph Ortner :
> If I use `println` or `@show` to output intermediate results of a computation
> in IJulia, the output is often delayed until the computation is complet
weeks, used to work just fine.
Am 28.08.2015 um 15:20 schrieb René Donner :
> Can you try whether adding a flush(STDOUT) after the print statement makes
> any difference?
>
>
> Am 28.08.2015 um 15:16 schrieb Christoph Ortner :
>
>> If I use `println` or `@show` to outp
Not yet, but see the discussion in
https://github.com/JuliaLang/METADATA.jl/issues/2800
In the meantime, you could try https://github.com/rened/DeclarativePackages.jl
Cheers,
Rene
Am 25.08.2015 um 19:26 schrieb Chris <7hunderstr...@gmail.com>:
> Is this possible yet? It would be very useful
Hi Michael,
you might also want to post this on julia-j...@googlegroups.com (some people
might be watching the lower-volume julia-jobs more closely).
Rene
Am 25.08.2015 um 14:42 schrieb Michael Francis :
>
> As way of an introduction I work for BlackRock and we are actively looking
> for
It all depends on the details of what you want to achieve, but in the simplest
case something along these lines?
ref = @spawn someGUIstuff()
othercomputations()
guiresult = fetch(ref)
This will move the work to one of the workers (if there are any available, see
addprocs()).
Something si
You can use
parse(Int,split(readall(`wc -l test.txt`))[1])
for that.
FYI, a small benchmark of showed countlines to be 3x faster than run(wc..) and
4x faster than the mmap approach.
The code for countlines is interesting, nice example for highly efficient Julia
code:
Am 19.08.2015 um 1
This should work:
a = Mmap.mmap("test.txt")
n = 1
for i in 1:length(a)
if a[i]==10
n+=1
end
end
@show n
Am 19.08.2015 um 12:13 schrieb René Donner :
> I guess you could access it using mmap and simply loop through the array:
>
> http://docs.julialang.org/en/lates
I guess you could access it using mmap and simply loop through the array:
http://docs.julialang.org/en/latest/stdlib/io-network/?highlight=mmap#memory-mapped-i-o
I'd be curious, are there even faster alternatives?
Am 19.08.2015 um 12:10 schrieb Daniel Carrera :
> Hello,
>
> I need to count t
You can use the default .travis file which gets generated on current julia when
you run Pkg.generate("MyPackage","MIT")
# Documentation: http://docs.travis-ci.com/user/languages/julia/
language: julia
os:
- linux
- osx
julia:
- release
- nightly
notifications:
email: false
# uncomment
Hi,
I think this does what you want:
function sum{T<:FloatingPoint}(x::Array{T,1})
println("hi")
end
Cheers,
Rene
Am 18.08.2015 um 11:22 schrieb Uwe Fechner :
> Ok, the following definition works on Julia 0.4, but not with 0.3:
>
> FloatArray = Union{Array{Float32, 1}, Array{Float64,
You could also try something like
julia> a = rand(100,10);
julia> @time [norm(sub(a,:,i)) for i in 1:size(a,2)];
0.135117 seconds (1.80 M allocations: 40.381 MB, 14.14% gc time)
As long as your slices are along the last dimension, i.e. columns in a matrix,
you can use FunctionalData
just a typo for "state"
Am 12.08.2015 um 14:23 schrieb Sisyphuss :
> Just a somewhat irrelevant question: what is "sate"?
>
>
> On Wednesday, August 12, 2015 at 1:42:15 PM UTC+2, J Luis wrote:
> In the latest Docs I am now seeing several repetitions like the case in the
> image bellow.
>
>
>
Thanks a ton to everyone who made this happen! Absolutely fantastic stuff,
especially that it made it into 0.4!
Am 07.08.2015 um 06:39 schrieb Steven G. Johnson :
> Many of you are aware that Julia 0.4 has some facilities for precompiling
> modules, but in the last couple of days they have bec
I proof-read the changes, they look good to me!
Thanks Tobias for tackling this, the previous entry was really not more than a
stub.
Cross-linking this to the corresponding issue:
https://github.com/JuliaLang/julia/issues/11816
Am 23.06.2015 um 12:17 schrieb Vladislav Falfushinsky
:
> Recently I`ve tried to deploy julia application, but I recieved an error.
>
> The code is rather simple:
>
> function main()
> println(
Hi,
you can use strip() for that. This and some other very handy functions (e.g.
lstrip / rstrip) are listed in
http://docs.julialang.org/en/release-0.3/stdlib/strings/?highlight=strip#strings
cheers,
rene
Am 17.06.2015 um 11:38 schrieb Paul Analyst :
> Is another way [1:end-1] to lost "\
Hi,
are there any fellow Julia users in Vienna, Austria, which would be interested
in setting up a monthly meetup?
There are currently three of us, aiming for July 23rd for a small
get-to-know-each-other session, where we can plan further talks / topics /
meetings:
http://www.meetup.com/Vie
You dont have to worry about this, pmap distributes the work onto the workers
(one each), and once a worker is done it gets a new piece of work to do.
Am 21.05.2015 um 09:49 schrieb Fred :
> Hi !
>
> When the number of tasks exceed the number of CPUs, is it safe to send all
> the tasks in pma
> ExtremelyRandomizedTrees.jl: Might be really good, but errored a lot on
> version 4.
Sorry, the fixes for 0.4 were only in master - I tagged a new version (0.0.11)
just now.
I use it mostly on 0.4, actually - if you find any issues please let me know!
You could use an ensemble regression approach - see
https://github.com/rened/ExtremelyRandomizedTrees.jl#regression for a 1D to
1D example. For your data you could use this (ndims == 2, for
visualization):
using ExtremelyRandomizedTrees, FunctionalDataUtils
# train model
ndim = 2
nsamples = 10
> Thin plate splines are just a special case of Polyharmonic Splines. Would
> there be interest of expanding this script into a package?
Yes please, that would be great to have!
>
> -Luke
>
> On Wednesday, May 13, 2015 at 12:26:12 AM UTC-7, Jan Kybic wrote:
> I have a set of irregularly gridde
The history can be found in ~/.julia_history
Am 12.05.2015 um 15:14 schrieb cameyo :
> Hi,
> i'd like to save all (or a part of) the history of commands typed in REPL in
> a file.
> Is there a way to do it?
> Thanks.
>
> Massimo
>
>
>
>
> --
> View this message in context:
> http://julia-pr
The packages are by default in ~/.julia/v0.3 (or v0.4 respectively).
You can try to copy this over to Machine2 and see whether the packages you need
work that way.
One thing that will be missing are binary package dependencies which are
installed using the package manager in a package's build s
The package does not seem to be registered in METADATA, yet - you can install
it with Pkg.clone("https://github.com/jverzani/JGUI.jl.git";) though.
Am 12.05.2015 um 13:49 schrieb Peter Kristan <5er.kris...@gmail.com>:
> ERROR: unknown package JGUI
> in wait at task.jl:51
> in sync_end at task.
Hi,
you could look up the name in the list of fieldnames:
in(:asf, names(Tech))
will return true if Tech has a field "asf", false otherwise.
I don't know what your usage scenario is, but perhaps a Dict() might be an
alternative, where you can set arbitrary fields and query their existence wi
Hi,
the contexts in Compose form a tree, so you need to combine the points you want
in the same color in a unique context, and then compose each of these contexts
with the "main" context.
You can see an example of this here:
https://github.com/rened/ImagePlot.jl/blob/master/src/ImagePlot.jl#
You can see such behaviour implemented in
https://github.com/timholy/ProgressMeter.jl (which might already do what you
want ;-)
Am 08.05.2015 um 12:39 schrieb Ali Rezaee :
> Hi,
>
> I would like to show the progress of my Julia code while its running. But I
> do not want each different perce
Hi,
I am not aware of a built-in function, but this should do the trick:
a = ["a","a","b","c","c","c","d"]
d = Dict()
for x in a
d[x] = get!(d,x,0) + 1
end
for k in sort(collect(keys(d)))
println("Value $k with count $(d[k])")
end
Cheers,
Rene
Am 30.04.2015 um 20:35 schr
Hi,
I had to fiddle with the precompilation myself, initially hitting similar
issues.
Are you starting julia simply with "julia" or do you specify the path to the
system image using the "-J" parameter? In case you use "-J" you need to use the
exeflags parameter of addprocs to specify this for
I believe range(i,num) is what you are looking for.
Am 29.04.2015 um 16:22 schrieb Sebastian Good
:
> I find myself creating ranges of the form i:i+num-1. That is, the ith thing,
> and num more. Whenever I see a +1 or -1 I worry about careless off by one
> errors, so I wonder if there is a fu
uh, sorry, the assignment was totally unnecessary of course ;-)
d = Dict()
for i in 1:length(a)
push!( get!(d,a[i],Int[]) ,i)
end
Am 29.04.2015 um 15:40 schrieb René Donner :
> Depending on your needs for efficiency and the exact task, this general
> approach might be ok:
&
Depending on your needs for efficiency and the exact task, this general
approach might be ok:
a = String["a", "b", "c", "a", "d", "b"]
d = Dict()
for i in 1:length(a)
d[a[i]] = push!(get!(d,a[i],Int[]),i)
end
julia> d
Dict{Any,Any} with 4 entries:
"c" => [3]
"b" => [2,6]
"a" =>
I am using
autocmd FileType julia set commentstring=#\ %s
together with https://github.com/tpope/vim-commentary (don't have experience
with tComment)
Am 28.04.2015 um 11:14 schrieb Magnus Lie Hetland :
>
>
> I'm using vim for Julia editing, and the Julia mode is great; for some
> reason,
planned improvements and optimizations take
>> > > place. One of the key ones is a tuple overhaul.
>> > >
>> > > Fair to say it can never be 'zero' cost since there is different inherent
>> > > overhead depending on the type of subarray, e.g
As far as I have measured it sub in 0.4 is still not cheap, as it provides the
flexibility to deal with all kinds of strides and offsets, and the view object
itself thus has a certain size. See
https://github.com/rened/FunctionalData.jl#efficiency for a simple analysis,
where the speed is mostl
perfect, thanks!
Am 15.04.2015 um 17:02 schrieb Stefan Karpinski :
> Sys.get_process_title()
Hi,
is there a way to find out the path of the Julia executable inside of Julia,
similar to args[0] in C?
Thanks,
Rene
You can find more information on Picture here:
http://mrkulk.github.io/www_cvpr15/
Am 13.04.2015 um 18:24 schrieb Seth :
> http://phys.org/news/2015-04-probabilistic-lines-code-thousands.html
>
> Joining Kulkarni on the paper are his adviser, professor of brain and
> cognitive sciences Josh Te
Can you try whether using "tunnel = true" helps?
http://docs.julialang.org/en/release-0.3/stdlib/parallel/#Base.addprocs
When tunnel==false (the default), the workers need to be able to see each other
directly, which will not work through firewalls which allow only ssh etc.
Am 13.04.2015 um
Unfortunately the documentation is not really great yet, but
https://github.com/rened/FunctionalData.jl#computing-map-and-friends-details
is a collection of functions that could be used for this, with optional
in-place operations and parallel processing. It is basically a generalization
of t
e syntax worked a few
> days ago. Do you know if this is a new feature of matplotlib?
>
> 2015-04-01 23:57 GMT-06:00 René Donner :
> The following works:
>
> using PyPlot
> a = plot(sin(linspace(-3,3)))
> savefig("test.png")
>
> savefig only seems
The following works:
using PyPlot
a = plot(sin(linspace(-3,3)))
savefig("test.png")
savefig only seems to work on the current figure.
The error message you are seeing comes from the fact that that
"myimage[:savefig]" tells julia to index "myimage" with ":savefig", and this
syntax is just
Not knowing the entire code, could it be that you are passing values > 255 to
UInt8? And 'round' of e.g. 255.1 thus makes the error disappear?
julia> UInt8(255.0)
0xff
julia> UInt8(255.1)
ERROR: InexactError()
in call at base.jl:36
julia> UInt8(-0.1)
ERROR: InexactError()
in call at base.jl:3
Perhaps one of these can help:
https://github.com/panlanfeng/KernelEstimator.jl
https://github.com/JuliaStats/KernelDensity.jl
https://github.com/johnmyleswhite/SmoothingKernels.jl
Just in case you don't know these resources already, http://pkg.julialang.org
and https://github.com/svaksha/
You can try the jld* functions of the HDF5.jl package, they can save custom
types: https://github.com/timholy/HDF5.jl
Am Dienstag, 24. März 2015 13:21:02 UTC+1 schrieb Christopher Fisher:
>
> I would like to save the output of a kernel density estimate function for
> future use. The KernelDensit
t; Am Mittwoch, 18. März 2015 16:01:11 UTC+1 schrieb pip7...@gmail.com:
> One thing I forgot to ask is what if I wan to keep the array as it is
> and then add to it ...if I run a = filter(x->x<3, z) ... it overwrites the
> array.
> Regards
>
> On Wednesday, 18 March 20
es the
> array.
> Regards
>
> On Wednesday, 18 March 2015 14:04:45 UTC, pip7...@gmail.com wrote:
>>
>> Thanks everybody - got it!
>> Regards
>>
>> On Wednesday, 18 March 2015 12:04:48 UTC, René Donner wrote:
>>>
>>> or simply
>>>
&
or simply
a = filter(x->x<3, z)
Am Mittwoch, 18. März 2015 12:46:52 UTC+1 schrieb Konstantin Markov:
>
> julia> a = [i for i=filter(x->x<3,z)]
> 2-element Array{Any,1}:
> 1
> 2
>
>
> On Wednesday, March 18, 2015 at 8:31:57 PM UTC+9, pip7...@gmail.com wrote:
>>
>> Hi
>> I want to fill an arra
You mean as a literal?
Any[[1,2], [4,5,6]]
will give you:
2-element Array{Any,1}:
[1,2]
[4,5,6]
Or when you want to create that array of array programmatically:
julia> [ones(2) for i in 1:2]
2-element Array{Array{Float64,1},1}:
[1.0,1.0]
[1.0,1.0]
Am Mittwoch, 18. März 2015 11:
You can achieve this with filter:
http://docs.julialang.org/en/release-0.3/stdlib/collections/?highlight=filter#Base.filter
Am Mittwoch, 18. März 2015 12:31:57 UTC+1 schrieb pip7...@gmail.com:
>
> Hi
> I want to fill an array based on a condition - eg
>
> a = []
> z = [1,2,3,4]
>
> for i = 1:len
This is in the works, but in the meantime you can get try building your own
system image:
http://docs.julialang.org/en/release-0.3/devdocs/sysimg/?highlight=userimg
But this is only handy when the code that gets included there does not change
too often, as building this image will take a few mi
I believe this might help:
https://groups.google.com/d/msg/julia-users/K1BlJW8k2o0/FRfANpsB_XIJ
Am Dienstag, 17. März 2015 16:08:09 UTC+1 schrieb Kristoffer Carlsson:
>
> Say I have an immutable with only one type.
>
> immutable Strain
> exx::Float64
> eyy::Float64
> ezz::Float64
>
That string does represent a filename, doesn't it? Do you obtain that by
calling readdir() at some point perhaps? This can now return a
Array{Union(UTF8String,ASCIIString),1}, which I believe was not the case in
0.3. (At least I had to adapt my code at some point to deal with this)
Am 13.03.2
000 simulations.
>
> Pieter
>
>
> On Friday, March 13, 2015 at 3:29:48 PM UTC, René Donner wrote:
>
> Am 13.03.2015 um 16:20 schrieb Pieter Barendrecht :
>
> > Thanks! I tried both approaches you suggested. Some results using
> > SharedArrays (100,000 simul
work on chunks of data /
batches of itertations, i.e. dont pmap over millions of things but only a
couple dozen. Looking at the code might shed some light.
>
> On Friday, March 13, 2015 at 8:37:19 AM UTC, René Donner wrote:
> Perhaps SharedArrays are what you need here?
> http://doc
Perhaps SharedArrays are what you need here?
http://docs.julialang.org/en/release-0.3/stdlib/parallel/?highlight=sharedarray#Base.SharedArray
Reading from a shared array in workers is fine, but when different workers try
to update the same part of that array you will get racy behaviour and most
Just the limitations of floating point numbers:
https://en.wikipedia.org/wiki/Floating_point
Am 12.03.2015 um 20:23 schrieb Hanrong Chen :
> julia> 1-0.8
> 0.19996
>
> Is this a bug?
> With that I was able to debug the problem in a snap. It turns out that one
> of my functions had "readlines(open(...))" instead of
> "open(readlines,...)". The critical difference is that the former leaves a
> file pointer dangling.
>
Ah, ok, that's exactly the difference: using open(myfunc
More are hint than a direct answer, are you using the "do" syntax for
opening the files?
open("somefile", "w") do file
write(file, ...);
read(file, );
end
Regardless of how you exit that block, regularly or via exceptions, the
file will be closed, so at least there are no files ac
For inplace matrix multipliation you can also try the in-place BLAS
operations:
http://docs.julialang.org/en/release-0.3/stdlib/math/?highlight=at_mul_b#Base.A_mul_B!
Am Donnerstag, 12. März 2015 10:14:34 UTC+1 schrieb Mauro:
>
> Julia is not yet very good with producing fast vectorized code w
I can reproduce this with the following code on both 0.3.6 and a 10 days
old master with the following code:
using TSne, MNIST
data, labels = traindata()
Y = tsne(data, 2, 50, 1000, 20.0)
Filed an issue here: https://github.com/JuliaLang/julia/issues/10487
my versioninfo():
Julia Version 0.4
Hi,
try:
a = IntSet([1,2,1,3])
collect(a)
that gives you a 3-element Array{Int64,1}. This also work with ranges, like
collect(1:3)
Cheers,
Rene
Am 11.03.2015 um 17:03 schrieb Ali Rezaee :
> In Python I would normally to something like this:
>
> a = set([1,2,1,3])
> a = list(a)
>
>
To get rid of name clashed you could e.g. also say
import Gadfly
using PyPlot
Like this "plot" will refer to PyPlot.plot, and you can use "Gadfly.plot"
anytime you need Gadfly's plot.
You can find more info here:
http://docs.julialang.org/en/release-0.3/manual/modules/#summary-of-module-usage
Sure, would be good!
I generally use this pattern only inside more general, pure functions that,
say, loop over an array or list of items, where the data that is being viewed
into is guaranteed to exist. I avoid to use these unsafe functions directly /
on an adhoc basis, and I never pass the re
And if you want to reduce memory allocations and your fields are all of the
same type:
immutable Foo{T}
a::T
b::T
c::T
end
# this always works also for mutables / varying fieldtypes:
typevec(a) = [a.(x) for x in names(a)]
# create initial view
typevec!(foo::Foo) = pointer_to_array(
While not built-in, this might do what you want:
https://github.com/rened/DeclarativePackages.jl
Am 03.03.2015 um 23:58 schrieb Duane Johnson :
> Reviving this thread from almost exactly a year ago. Has the package
> situation changed?
>
> Specifically, I'm wondering if there's a way to take
loat64})
>
> On Tuesday, March 3, 2015 at 10:41:11 PM UTC+1, René Donner wrote:
> Looks like curve_fit has been moved to https://github.com/JuliaOpt/LsqFit.jl
>
>
> Am 03.03.2015 um 22:30 schrieb Andrei Berceanu :
>
> > i found this post concerning nonlinear
Looks like curve_fit has been moved to https://github.com/JuliaOpt/LsqFit.jl
Am 03.03.2015 um 22:30 schrieb Andrei Berceanu :
> i found this post concerning nonlinear curve fitting in Julia,
> http://www.walkingrandomly.com/?p=5181
> but it appears the curve_fit method no longer exists
>
> doe
In my experience, it is better to specifically indicate that you want to see
the entire contents - once you move beyond basic experimentation with the
language, watching several hundred megabytes being accidentally piped into your
terminal or an IJulia session can make for quite annoying coffee
You can use this:
julia> Array(Int64,0,0)
0x0 Array{Int64,2}
Am 03.03.2015 um 16:09 schrieb Charles Novaes de Santana
:
> Dear all,
>
> Sorry if this question is too silly. But I would like to know how to create
> an empty 2-dimensional Array of Int64 with Julia.
>
> To create a empty Arra
you can use showall([1:100])
Am 03.03.2015 um 14:05 schrieb cormull...@mac.com:
> Usually it's good how Julia REPL abbreviates output, using \vdots (vertical
> ellipsis) based on window height:
>
> julia> [1:100]
> 100-element Array{Int64,1}:
>1
>2
>3
>4
>5
>6
>⋮
>
If I run your code in the REPL I see the same behavior. Putting it into a
function works:
julia> function test()
S = SharedArray(Int, (3,))
pmap(i->S[i], 1:3)
end
test (generic function with 1 method)
julia> test()
3-element Array{Any,1}:
0
0
0
The same holds true when
I have to tried it myself yet, but did you see
https://github.com/scheinerman/LatexPrint.jl?
Am 28.02.2015 um 10:52 schrieb Tamas Papp :
> Hi,
>
> I am solving some economic models in Julia. I have vectors that describe
> various moments, for some data and then for a bunch of models. I would
>
You could try the table functions from
https://github.com/rened/FunctionalData.jl
julia> Pkg.update(); Pkg.add("FunctionalData")
julia> ptable((x,y)->x+y, 1:2, 1:3)
2x3 Array{Int64,2}:
2 3 4
3 4 5
table does not parallelize, ptable uses all workers, and ltable uses only the
local workers.
allocated)
elapsed time: 0.289836491 seconds (89548756 bytes allocated, 35.00% gc time)
Am 17.02.2015 um 18:07 schrieb Jameson Nash :
> There is an IOBuffer type that works well as a string builder
> On Tue, Feb 17, 2015 at 11:56 AM René Donner wrote:
> You could use
>
> a
You could use
a = Any[]
while ...
push!(a, somestring)
end
join(a)
Am 17.02.2015 um 15:28 schrieb Maurice Diamantini
:
> Hi,
>
> In Ruby, String is mutable and there is the << operator to accumulate
> a string at the end of another one.
>
> I Julia, String is immutable and so, I use the c
I remember seeing a commit by Jeff at least a year ago which made returns from
functions sometimes yield() to allow scheduled tasks to have their turn more
often, independent of manual calls to yield().
But I cannot find any information relating to that any more - perhaps I am
imagining things
Perhaps the following is what you need. P should be 2 x nPoints. try e.g.
inpolygon([10 20 20 10; 10 10 20 20],1:50,1:40)
function inpolygon(P,m::Int,n::Int)
j = size(P,2)
oddnodes = false
M = P[1,:]
N = P[2,:]
for i in 1:size(P,2)
if M[i] < m && M[j] >= m || M[j] <
t; the schedule method but I have not been able to find an example or doc on it:
>
> https://github.com/JuliaLang/julia/issues/6283
>
> Thanks,
>
> Robert
>
> Den lördag 17 januari 2015 kl. 07:39:25 UTC+1 skrev René Donner:
> Is there also something like interrupt
Is there also something like interrupt(task) to selectively kill one of several
tasks? I could not find anything in the docs.
Thanks!
Am 17.01.2015 um 04:24 schrieb Isaiah Norton :
> Have you tried using tasks with start_timer and interrupt?
>
> On Tue, Jan 13, 2015 at 7:42 AM, Robert Feldt
Hi Simon,
just in case you are looking for a Julia-based deep learning framework, there
is Mocha.jl (https://github.com/pluskid/Mocha.jl), which is very well designed
and documented, and a pleasure to use.
cheers,
rene
Am 16.01.2015 um 19:27 schrieb Simon Danisch :
> Thought this could be
Hi,
another way would be to use the nix package manager: http://nixos.org/nix/
list of available packages: http://nixos.org/nixos/packages.html
you don't need to be super user to install it, and everything you install
through nix can reside in your home directory as well.
it is my goto tool wh
Hi,
perhaps https://github.com/rened/DeclarativePackages.jl can help you here.
Rene
Am 09.01.2015 um 21:37 schrieb Seth :
> I find myself frequently using features in other packages that haven't been
> tagged yet. Is there a way to specify in REQUIRES that, say, the master
> branch of the p
hi,
this should work:
d = """aaa
bbb
ccc"""
Rene
Am 06.01.2015 um 11:15 schrieb Andreas Lobinger :
> Hello colleagues,
>
> is there a counterpart for the string literal split to multiple lines like in
> python?
>
> d = '09ab\
> eff1\
> a2a4'
>
> Wishing a happy day,
>Andreas
>
Hi,
@code_warntype is in 0.4 master, I believe it got only introduced a few days
ago.
rene
Am 03.01.2015 um 21:12 schrieb Christoph Ortner :
> Dear Tim and Viral (and others),
>
> The above code snippet is a slightly simplified version of my original code,
> supplied with random data. I wr
ic, thanks a lot!
Am 03.01.2015 um 19:23 schrieb Ivar Nesje :
> See https://github.com/JuliaLang/julia/issues/4869
>
> kl. 19:19:26 UTC+1 lørdag 3. januar 2015 skrev René Donner følgende:
> Hi,
>
> I wanted to append the tuple (3,4) to the tuple (1,2), expecting (1,2
Hi,
I wanted to append the tuple (3,4) to the tuple (1,2), expecting (1,2,3,4) as
output:
julia> a = (1,2,(3,4)...)
(1,2,(3,4)...)
It turns out I have to use tuple(1,2,(3,4)...) == (1,2,3,4).
I understand (1,2,3,4) and (1,2,(3,4)), but what does the output
"(1,2,(3,4)...)", which has typ
Hi,
DeclarativePackages.jl (jdp for short) provides declarative, per-project
package management for Julia. It allows to declaratively specify which Julia
packages a project should use, optionally with exact version or commit details.
jdp will install the specified packages (if necessary) and st
Hi,
as I am just in the process of wrapping caffe, this looks really exiciting! I
will definitely try this out in the coming days.
Are there any specific areas where you would like testing / feedback for now?
Do you have an approximate feeling how the performance compares to caffe?
Cheers,
Re
Hi,
perhaps Quick-Shift clustering might be interesting as well [1]. It is easy to
implement, fast, and in contrast to k-means / k-medoids (which it generalizes)
has the very appealing property that the initial, hierachical data-structure
has to be computed only once - you can then investigate
I don't know how feasible it is, but a (perhaps optional) inclusion of the
functionality in https://github.com/astrieanna/TypeCheck.jl would be great!
Am 09.06.2014 um 00:46 schrieb Tony Fong :
> Thanks. PR created.
>
> I have added a few more low hanging fruits to the Lint module:
> * correct
I don't know how feasible it is, but a (perhaps optional) inclusion of the
functionality in https://github.com/astrieanna/TypeCheck.jl would be great!
Am 09.06.2014 um 00:46 schrieb Tony Fong :
> Thanks. PR created.
>
> I have added a few more low hanging fruits to the Lint module:
> * correct
Hi,
you can use string interpolation:
for i = 1:10
println("A$i.csv")
end
cheers,
rene
Am 07.01.2014 um 14:03 schrieb paul analyst :
> How to use the value of a variable to the file numbering?
> I need 10 csv files with 10 random arrays ...A1, A2, ... A10
>
> for i=1:10
> A=rand(100,100)
99 matches
Mail list logo
