Hello all,
I am an education doctoral student who is a self-taught stats and
programming person. My primary coding and stats experience is with R. I
have started to attempt Julia and was using the Project Euler questions as
a way to teach myself the language structure, types, and specifying
Thanks. I managed to get it to work by using the terminal instead. For
those running Juno and encountering similar problems I'd recommend building
packages from the terminal.
On Saturday, May 16, 2015 at 11:16:54 PM UTC-5, Tony Kelman wrote:
No, this isn't normal, but bugs happen. Blosc's
Hi all,
I'm working on a scienfitic unix cluster where the NLopt.jl provided
build.jl fails. I paste the error output in the end. I installed NLopt
manually into ~/local. How can I build NLopt.jl such that it takes my
~/local/lib/libnlopt.a? I have done
push!(Sys.DL_LOAD_PATH,
I am building a web app for DSP tasks. It consists of SPA frontend, REST
API Server, RabbitMQ and computation server.
And I want to use Julia lang for develop computation back-end.
Has anybody had some experience in integration Julia programs with AMQP
message brokers?
P.S. I've read this topic
That's true.
On Monday, May 18, 2015, Roman Kravchik ro...@kravchik.ru wrote:
Thanks for the link.
But it seems to be like CGI-style operation - eval julia expression and
i'm not sure it's a perspective direction.
понедельник, 18 мая 2015 г., 17:46:16 UTC+3 пользователь Kevin Squire
You can be a tutor I guess.
On Saturday, May 16, 2015 at 2:32:22 PM UTC+2, Scott Jones wrote:
These are particular interesting to me (if I were a student, or not
already more than full-time working using Julia), I'd jump on one of these
two:
When you benchmark stuff like this it is good to make a benchmark with as
little noise in it as possible. Here is a version which removes slicing,
bounds checking, allocations etc:
function timeit()
A = rand(1024, 1024)
B = similar(A)
a = @elapsed for i = 1:size(A, 1), j = 1:size(A,
Just a side question: If i run wrap_c on one of the larger system
libraries (e.g. X11.h) and get an error; is it more likely it uses a
rather esoteric cpp features (and therefore isn't covered in the current
wrap_c) OR is it more likely that i miss some compiler flags?
Hard to say, depends
Have you tried to restart the REPL, because I see no problems in running:
function fib_sum_2(x,y,z)
sum(x:x:z) + sum(y:y:z) - sum(lcm(x,y):lcm(x,y):z)
end
julia fib_sum_2(3,5,999)
233168
This works for me, both in Julia 0.3 and 0.4
julia function fib_sum_2(x,y,z)
sum(x:x:z) + sum(y:y:z) - sum(lcm(x,y):lcm(x,y):z)
end
fib_sum_2 (generic function with 1 method)
julia fib_sum_2(3,5,999)
233168
What happens if you restart Julia and try again?
On Monday, May
Thank you. I said this in the post below, but is this an issue with Julia
going forward? The need to restart.
On Monday, May 18, 2015 at 10:50:28 AM UTC-4, Kristoffer Carlsson wrote:
This works for me, both in Julia 0.3 and 0.4
julia function fib_sum_2(x,y,z)
sum(x:x:z) +
Hi there,
xdata (or any other grid) does not need to be on a grid, that's just the
way the example is written. but no extrapolation, that's right.
On Thursday, 14 May 2015 01:05:55 UTC+1, Yakir Gagnon wrote:
Thanks a ton people!!!
ExtremelyRandomizedTrees.jl: Might be really good, but
Hi Roman,
Not a direct answer to your question, but you might check out node-julia (
https://www.npmjs.com/package/node-julia), if you're open to including node
in the soup of web components.
Cheers,
Kevin
On Monday, May 18, 2015, Roman Kravchik ro...@kravchik.ru wrote:
I am building a web
Hello,
I just discover abs2() function :v
And I have to say that i'm really surprised that:
sqrt(abs2( x )) is quicker than abs( x )
For a Matrix of size 512*512 and then a vector of size 512
1 realizations, the mean results are (on a macbook):
abs(x[:,:])
0.0073665214096
Thanks for the link.
But it seems to be like CGI-style operation - eval julia expression and i'm
not sure it's a perspective direction.
понедельник, 18 мая 2015 г., 17:46:16 UTC+3 пользователь Kevin Squire
написал:
Hi Roman,
Not a direct answer to your question, but you might check out
Cool, thanks again Tim!
Yakir Gagnon
The Queensland Brain Institute (Building #79)
The University of Queensland
Brisbane QLD 4072
Australia
cell +61 (0)424 393 332
work +61 (0)733 654 089
On Fri, May 15, 2015 at 12:05 AM, Tim Holy tim.h...@gmail.com wrote:
I'm not sure myself how hard this
On Sunday, May 17, 2015 at 7:06:34 PM UTC+2, Isaiah wrote:
(please file issues...)
Just a side question: If i run wrap_c on one of the larger system libraries
(e.g. X11.h) and get an error; is it more likely it uses a rather esoteric
cpp features (and therefore isn't covered in the current
I’m now using open instead of readandwrite…
Yakir Gagnon
The Queensland Brain Institute (Building #79)
The University of Queensland
Brisbane QLD 4072
Australia
cell +61 (0)424 393 332
work +61 (0)733 654 089
On Fri, May 15, 2015 at 10:27 AM, Yakir Gagnon 12.ya...@gmail.com wrote:
Thanks!
Right, yea, it was all a mistake I made and I thought the parenthesis were
the culprits... Thanks anyway!!!
Yakir Gagnon
The Queensland Brain Institute (Building #79)
The University of Queensland
Brisbane QLD 4072
Australia
cell +61 (0)424 393 332
work +61 (0)733 654 089
On Sun, May 17, 2015
The package has been moved to under JuliaSparse:
https://github.com/JuliaSparse/SparseVectors.jl
Best,
Dahua
On Sunday, May 17, 2015 at 10:24:57 PM UTC+8, Dahua Lin wrote:
Dear all,
I am pleased to announce a new package SparseVectors:
https://github.com/lindahua/SparseVectors.jl
For my own modules, I've tended to follow the example of the Distributions
and Distances package, where each distribution (or distance) is its own
type, and then there is a small number of generic functions (eg evaluate)
that use multiple dispatch to return the appropriate value depending
Side note: A[] == A[1]
On Saturday, May 16, 2015 at 9:19:48 PM UTC+2, paul analyst wrote:
Use []
julia A=rand(1)
1-element Array{Float64,1}:
0.33519
julia A[]
0.3351896128863725
julia
W dniu piątek, 15 maja 2015 23:18:32 UTC+2 użytkownik Lytu napisał:
Someone know how to convert
(or use `workspace()`)
On Mon, May 18, 2015 at 11:56 AM, Jameson Nash vtjn...@gmail.com wrote:
at some point you probably entered something like:
sum = 5
from that point on, sum refers to 5, rather than the Base.sum function.
you could restore it by typing
sum = Base.sum
or just restart
You probably did this:
julia x = rand(3)
3-element Array{Float64,1}:
0.203537
0.0976039
0.425243
julia sum = 5 # you just borked sum
5
julia sum(x)
ERROR: type: apply: expected Function, got Int64
But notice sum is still there:
julia Base.sum(x)
0.7263840892398132
julia sum = Base.sum
at some point you probably entered something like:
sum = 5
from that point on, sum refers to 5, rather than the Base.sum function.
you could restore it by typing
sum = Base.sum
or just restart
On Mon, May 18, 2015 at 11:37 AM James Byars jimmyby...@gmail.com wrote:
Thank you. I said this in
Big thx, but after this code x is no changed
Paul
W dniu 2015-05-17 o 20:23, wild...@gmail.com pisze:
map(e-replace(string(e), ',', '.'), x)
On Saturday, May 16, 2015 at 2:40:05 PM UTC-4, paul analyst wrote:
I have file with decimal separator lika ,
x=readdlm(x.txt,'\t')
julia
Am I doing something wrong? I get the same error in 0.3.8.
I notice that there is a method with signature
read(::HDF5.HDF5Dataset, ::Type{Array{HDF5.HDF5Compound,N}})
but not
read(::HDF5.HDF5Dataset, ::Type{HDF5.HDF5Compound})
_
_ _ _(_)_ | A fresh approach to
But very important !
Paul
W dniu 2015-05-18 o 17:45, Sisyphuss pisze:
Side note: A[] == A[1]
On Saturday, May 16, 2015 at 9:19:48 PM UTC+2, paul analyst wrote:
Use []
julia A=rand(1)
1-element Array{Float64,1}:
0.33519
julia A[]
0.3351896128863725
julia
W
On Monday, May 18, 2015 at 10:51:48 AM UTC-4, antony schutz wrote:
Hello,
I just discover abs2() function :v
And I have to say that i'm really surprised that:
sqrt(abs2( x )) is quicker than abs( x )
Note that the abs(x) function is more robust because it avoids spurious
overflow
Working with a 16 core / 32 thread machine with 32GB ram that presents to
ubuntu as 32 cores. I'm trying to understand how to get the best
performance for embarrassingly parallel tasks. I want to take a bunch of
svds in parallel as an example. The scaling seems to be perfect (6.6
seconds
Aside from semver.org, I'm going to guess not yet. But I'm also not privy
to any private discussions that may have happened within Julia Computing.
(Hopefully we can avoid there needing to be too many of those related to
the language itself)
On Monday, May 18, 2015 at 1:41:17 PM UTC-7,
The milestone flags are useful references (nothing really set in stone at
this point though, AFAIK).
https://github.com/JuliaLang/julia/issues?q=is%3Aopen+is%3Aissue+milestone%3A0.5
https://github.com/JuliaLang/julia/issues?q=is%3Aopen+is%3Aissue+milestone%3A1.0
On Mon, May 18, 2015 at 6:19 PM,
You could also take a look at JudyDicts.jl, which wrap the corresponding C
library. Supposedly, it's one of the most highly optimized Dict
implementations anywhere. I think the Julia package may need an update,
however.
https://github.com/tanmaykm/JudyDicts.jl
-Jacob
On Mon, May 18, 2015 at
On Mon, May 18, 2015 at 5:24 PM, Scott Jones scott.paul.jo...@gmail.com wrote:
I suppose I could use a set simply to determine if it was present or not,
and then push! to another array if not present... just didn't seem as
efficient as what I'm used to...
Why does it have to be an array? And
Scott, this looks pretty much exactly like what Tim's example does: you have a
dictionary (aka associative array, aka mapping, depending on your terminology)
mapping keys to a counter.
Dicts are reasonably fast in Julia, although they could certainly be further
optimized (like almost
use a Set?
http://docs.julialang.org/en/latest/stdlib/collections/?highlight=set
On Mon, May 18, 2015 at 4:46 PM Scott Jones scott.paul.jo...@gmail.com
wrote:
I would like to be able to do the following in Julia:
Take a UInt64 (or UInt128, for that matter), and add it to an array, if it
is
How well do Dict’s perform currently in Julia? I hope pretty well! Thanks,
that’s more what I needed…
-Scott
On May 18, 2015, at 5:34 PM, Tim Holy tim.h...@gmail.com wrote:
If you really want to get the index back, perhaps better might be a dict:
counter = 0
d = Dict{KeyType,Int}()
As long as the dict is concretely typed, it should be pretty good. (I can't
comment about string keys, but you probably could! I think Symbols are more
performant than strings for indexing.)
Also, small correction: I should have used get! instead of get. You want to
set that new value in the
I suppose I could use a set simply to determine if it was present or not,
and then push! to another array if not present... just didn't seem as
efficient as what I'm used to...
On Monday, May 18, 2015 at 4:53:02 PM UTC-4, Jameson wrote:
use a Set?
I would like to be able to do the following in Julia:
Take a UInt64 (or UInt128, for that matter), and add it to an array, if it
is not already present, returning the index.
(This would be trivial in the language I used to work on, and I think it
probably is in Julia as well, but I haven't found
On Monday, May 18, 2015 at 5:31:18 PM UTC-4, Yichao Yu wrote:
On Mon, May 18, 2015 at 5:24 PM, Scott Jones scott.pa...@gmail.com
javascript: wrote:
I suppose I could use a set simply to determine if it was present or
not,
and then push! to another array if not present... just didn't
I'm actually just about to do another round of windows testing on #11280,
so I'll test this out as well. Thanks for the report!
-Jacob
On Mon, May 18, 2015 at 6:27 PM, Sebastian Souyris
sebastian.souy...@gmail.com wrote:
It seems that there is a bug when you define several SharedArray in one
This is amazing! Do keep us posted on how things go.
-viral
On Tuesday, May 19, 2015 at 4:42:39 AM UTC+5:30, Amit Jamadagni wrote:
Hello everyone,
I am most happy to inform that my project titled JuliaQuantum :
Framework for Solvers
Support for Microsoft platforms is obviously important. Not just Azure, but
even AWS keeps coming out with really cool stuff almost by the day. It is
tempting to think that an army of engineers can shorten everything and get
things done quicker (mythical man month?) - but I personally don't
Just wanted to say thanks for responding, and if you do encounter that
thread again in your travels, I'd be very grateful if you could post a link
(but please don't waste time searching for it on my behalf).
Cheers,
Colin
On Monday, 18 May 2015 18:22:06 UTC+10, Mauro wrote:
For my own
I'm not able to reproduce the above behavior with my latest changes to
#11280, so that's a good sign!
If you're feeling ambitious/able, feel free to give that PR a spin to see
if it fixes it for you as well.
-Jacob
On Mon, May 18, 2015 at 8:55 PM, Jacob Quinn quinn.jac...@gmail.com wrote:
I'm
Hello I'm just starting with julia and im stuck on converting a hex string
to base64 encoded string. How would you do this with julia?
Thanks,
-Martin
this definitely looks like a bug. can you post an issue? it might be good
to see if https://github.com/JuliaLang/julia/pull/11280 fixes it as well.
On Mon, May 18, 2015 at 10:44 PM Sebastian Souyris
sebastian.souy...@gmail.com wrote:
It seems that there is a bug when you define several
On Julia 1.0 and related tools, I recently put something together for a
grant proposal, basically summarizing various issues on github and
discussions we have been having. I need to do some cleanup, but will share
something here in a few days. We can then iterate on it and publish it as a
Thanks everybody, Dicts are working fine now, for my tests with UInt64 and
UInt128s as keys... (I haven't benchmarked it against my old stuff, I'll
have to do that at some point ;-) )
What I'm doing right now isn't really performance critical (I, of course,
am obsessively interested in any
On Monday, May 18, 2015 at 6:26:06 PM UTC-4, Jacob Quinn wrote:
You could also take a look at JudyDicts.jl, which wrap the corresponding C
library. Supposedly, it's one of the most highly optimized Dict
implementations anywhere. I think the Julia package may need an update,
however.
Strings are immutable, so replace can't change the existing string, so it
returns a new string, so map returns a new array which you have to assign
back to x
Cheers
Lex
On Tuesday, May 19, 2015 at 2:10:18 AM UTC+10, paul analyst wrote:
Big thx, but after this code x is no changed
Paul
W
1) I would like to compile LLVM with cmake as I'm used to... which flags I
shoud use ?
see `deps/llvm-svn/build_Release/config.log` for the flags we pass in, and
try to mirror at least some of those.
2) Maybe there is some trick : llvm-config --cxxflags can give flags
different from the
Out of interest is there a definition of 1.0 ?
On Sunday, May 17, 2015 at 12:29:19 AM UTC-4, Tony Kelman wrote:
Julia might get Microsoft's attention at some point. You could go vote for
If you really want to get the index back, perhaps better might be a dict:
counter = 0
d = Dict{KeyType,Int}()
for item in list
idx = get(d, item, counter+1)
if idx counter
counter += 1
end
# Do whatever you plan to do with idx
end
--Tim
On Monday, May 18, 2015 02:24:25
Oops... that should have been:
If '$data(arr(key),index) { // If the array already has the key, it is set
into the variable index, otherwise:
Set index = $Increment(arr) // atomically increment index, and set the
key to that value in the array
Set arr(key) = index
Set index(index) =
Hello everyone,
I am most happy to inform that my project titled JuliaQuantum :
Framework for Solvers
https://www.google-melange.com/gsoc/project/details/google/gsoc2015/amitjamadagni/5700735861784576
has
been selected for GSoC 2015
Hi all,
I'm just writing with a broad question about how to structure a module in
Julia.
For my own modules, I've tended to follow the example of the Distributions
and Distances package, where each distribution (or distance) is its own
type, and then there is a small number of generic
I just stepped up as the new organizer of Zurich Julia Users Group.
I plan to hold the next meeting around first or second week of July to give
a summary of what went on at JuliaCon. If you're near Zurich and not yet a
member of the meetup, please join at:
59 matches
Mail list logo
