Thank you for these precious informations. The JuMP package looks very
awesome, I hope to give it a try soon.
There was a Julia age during which BigInt(3)/BigInt(28) was equal to the
BigRational 3/28, why this feature has been removed ?
It would be too long to explain what my R appli here
Thanks! I remember seeing this now.
On Wednesday, April 9, 2014, Simon Kornblith si...@simonster.com wrote:
The dpss function now lives in DSP.jl (https://github.com/JuliaDSP/DSP.jl)
Simon
On Wednesday, April 9, 2014 7:47:38 PM UTC-4, Kevin Squire wrote:
Hi Simon,
I noticed that you
My use case is a C function that creates a sparse matrix in triplet form
(rows, cols, vals). What's the appropriate way to return this to Julia?
I've tried the following, thinking that Julia accepts C pointers as return
values, so why not tuples of C pointers:
jl_value_t *my_c_function(void) {
Hi, this is more a guess but could you try changing the return type in
ccall to NTuple{3,Ptr{Any}}? Or maybe just Tuple. Further you could try
using on the left hand site only a single variable name, i.e.
tup = = ccall((:my_c_function, mylib), Tuple, ())
Am Donnerstag, 10. April 2014 09:15:30
Thanks for the suggestions. Changing the return type results in complaints
from Julia:
ERROR: error compiling anonymous: in anonymous: ccall: missing return type
or
ERROR: error compiling anonymous: error interpreting ccall return type:type
cannot be constructed
Using a single variable
By the way for another problem I need to get the vertices of the
polyhedron defined by the linear constraints, as with the cddlib library,
do you know how I could get that ?
Enumerating vertices requires a very different algorithm from optimizing
over polyhedra. The best way to do this
Unless I'm blind and just can't find one, it appears there is not yet a
solid high-dimensional computational geometry package for Julia, like
cddlib or the Multi-Parametric Toolbox for Matlab. I imagine a wrapper
around cddlib would be fairly easy to write (perhaps even autogenerated),
or you
There was a Julia age during which BigInt(3)/BigInt(28) was equal to the
BigRational 3/28, why this feature has been removed ?
I don't think that command ever worked like that actually; in order to get
Rational values, you need to use a double-slash // in stead of a single
slash:
big(3) //
Announced by me is a big word here, but thanks to Kevin the correct link
found its way to this post! =)
Sorry about the confusion, we still try to figure out how to get things
across on the mailing list!
And its quite a complex topic, so it's a bit difficult to get a good
summary across,
Again, thank you for all these answers. Sorry Carlo, I missed the double
slash in your previous answer.
It would be a good opportunity for me to call Python in order to train my
skills in Python in addition to Julia. But what do you suggest me to call
pycddlib with PyCall rather than calling
Again, thank you for all these answers. Sorry Carlo, I missed the double
slash in your previous answer.
It would be a good opportunity for me to call Python in order to train my
skills in Python in addition to Julia. But why do you suggest me to call
pycddlib with PyCall rather than calling
Greetings,
Does this exist somewhere in base and/or DataFrames: the ability to read
only selected columns from some text input? Ideally, you could have each
output vector of a different type (Float64, Int, etc.). (So it differs
from readdlm() in philosophy.)
A minimal implementation is below
It would definitely be good to have something like clojuredocs.org. You
could include the docs for functions in all packages and Base, make
everything searchable. If you could build meaningful connections between
packages, even better.
But – and please forgive me if I've missed the point here
Is it the zlib implementation in the function crc32() you're comparing
to? Taking a peek in the zlib source, it looks like they do a fair
bit of manual loop unrolling and also process the CRC 4 bytes at a
time. Given those differences, the speed difference might not be so
surprising.
On Thu,
Thanks Elliot, I thought the readme might have been enough as a starting
point, but I see, that my post doesn't encourage anyone to put time into
this.
The readme shows how to use the event system and I'd like to know, if this
is a good design for an event system.
I wouldn't trust my judgment
There are bits and pieces in Github issues and posts, but can post a
definitive list of what needs to be replaced/removed to make Julia non GPL?
Will any functionality be missing? From what I understand I can use MKL for
some stuff. I've read that MKL has the ability to mimic FFTW, but will
As readline is now removed I think GMP (BigInt's) and MPFR (arbitrary
precision floating points) are the only GNU ibraries left if you are able
to use MKL and don't require FFTW. Steven also working on a branch where
he provides FFT support in pure julia.
Best,
Jake
On Thursday, April 10,
Rmath too, but I think that is on the way out. All of the licenses are
linked here:
https://github.com/JuliaLang/julia/blob/master/LICENSE.md
On Thu, Apr 10, 2014 at 10:05 AM, Jake Bolewski jakebolew...@gmail.comwrote:
As readline is now removed I think GMP (BigInt's) and MPFR (arbitrary
See also
DISTRIBUTING.mdhttps://github.com/JuliaLang/julia/blob/master/DISTRIBUTING.md.
Any discussion should probably be summarized there.
kl. 16:05:10 UTC+2 torsdag 10. april 2014 skrev Jake Bolewski følgende:
As readline is now removed I think GMP (BigInt's) and MPFR (arbitrary
There's been a lot of talk about turning various bits of functionality like
GMP, MPFR, FFTW and such into packages that simply happen to be pre-loaded
by default, making it easy to get a much more spare basic Julia version.
This will definitely happen over the summer. Note that OpenBLAS is
Are there any more liberally licensed libraries that get close to the
functionality in MPFR, I know that there are some non-GPL BigInt
implementations out there although I don't think any match GMP's
performance.
On Thursday, April 10, 2014 10:13:20 AM UTC-4, Stefan Karpinski wrote:
There's
To be fair, the simplest implementation being the fastest isn't
*necessarily* to Julia's credit, since it may also mean that Julia can only
optimise the simplest code. Not saying that's the case here, but it's worth
looking at it from that angle.
Chris' point gives me an idea for an @unroll
See @simd: https://github.com/JuliaLang/julia/pull/5355
On Thu, Apr 10, 2014 at 10:26 AM, Mike Innes mike.j.in...@gmail.com wrote:
To be fair, the simplest implementation being the fastest isn't
*necessarily* to Julia's credit, since it may also mean that Julia can
only optimise the simplest
Ah, nice
On 10 Apr 2014 15:39, Isaiah Norton isaiah.nor...@gmail.com wrote:
See @simd: https://github.com/JuliaLang/julia/pull/5355
On Thu, Apr 10, 2014 at 10:26 AM, Mike Innes mike.j.in...@gmail.comwrote:
To be fair, the simplest implementation being the fastest isn't
*necessarily* to
It's not able to vectorize the loop, at least on my computer when I tested
it.
On Thursday, April 10, 2014 10:44:44 AM UTC-4, Mike Innes wrote:
Ah, nice
On 10 Apr 2014 15:39, Isaiah Norton isaiah...@gmail.com javascript:
wrote:
See @simd: https://github.com/JuliaLang/julia/pull/5355
On
MPFR and GMP are LGPL, which is not quite as problematic or viral.
Some of SuiteSparse is GPL, parts of it are LGPL, and at least one file of
the Julia code in base for sparse matrices that is based on parts of
SuiteSparse is also LGPL.
On Thursday, April 10, 2014 7:18:45 AM UTC-7, Jake
Does anyone have any experience using Emacs IPython
Notebookhttp://tkf.github.io/emacs-ipython-notebook/but with IJulia?
findin(*a*, *b*) returns the indices of elements in collection a that
appear in collection b.Is there a notfindin function that returns the
indices of elements in collection a that do not appear in collection b? If
not, what do you think of the idea of adding a keyword argument to switch
to
help setdiff
INFO: Loading help data...
Base.setdiff(s1, s2)
Construct the set of elements in s1 but not s2. Maintains
order with arrays. Note that both arguments must be collections,
and both will be iterated over. In particular,
setdiff(set,element) where element is a potential
El jueves, 10 de abril de 2014 10:19:14 UTC-5, David P. Sanders escribió:
El miércoles, 9 de abril de 2014 03:40:40 UTC-5, Simon Frost escribió:
Dear All,
I'm implementing Gillespie's direct method for stochastic simulation:
http://en.wikipedia.org/wiki/Gillespie_algorithm
I'm
I tried both the ein and ipython emacs packages but wasn't able to connect
Julia (Python works fine). If you'd like I could try it again and post the
error messages.
On Thursday, April 10, 2014 11:15:04 AM UTC-4, Stefan Karpinski wrote:
Does anyone have any experience using Emacs IPython
Either approach should work in principle (pycddlib vs. cddlib), but I
suspect that the Python wrapper is higher-level, and will be easier to use
from Julia. For reference, here's a snippet of how you might calculate the
extreme points as rationals, calling pycddlib from Julia (adapted from code
On the latest pull I'm getting this build error:
$ make
CC src/jltypes.o
CC src/gf.o
FLISP src/julia_flisp.boot
FLISP src/julia_flisp.boot.inc
CC src/ast.o
CC src/builtins.o
CC src/module.o
CC src/codegen.o
CC src/interpreter.o
CC src/alloc.o
CC
Source for slides are at
github.com/dmbates/slides/2014-04-09-Evanston
An HTML version based on ioslides.js is at
http://www.stat.wisc.edu/~bates/2014-04-09-Evanston.html ('f' to toggle
fullscreen, 'w' to toggle widescreen). I'm not sure why but the figures
seem to be missing in that HTML
No. It is just warnings and Julia works fine. An issue has been opened.
Den torsdag den 10. april 2014 skrev Andrew Dabrowski unhandya...@gmail.com
:
On the latest pull I'm getting this build error:
$ make
CC src/jltypes.o
CC src/gf.o
FLISP src/julia_flisp.boot
FLISP
I'm neither a Julia nor even a competent programmer, but since no one else
has responded I'll take a shot at it.
I think that might be fair description of Mathematica, but not of Julia.
Julia is very much a multi-paradigm language, it's not pure enough in any
sense to be considered a member of
I thought this would work, but it seems that when I insert items in
ascending order (and the heap is supposed to be descending), my heap is
getting messed up. Is something wrong with my `ord` function?
In [448]: matches = (String,Float64)[]
Out [448]: 0-element Array{(String,Float64),1}
In
I wonder if this has to do with the fact that heappush! assumes heap-order,
but isn't taking into account my Reverse ordering in ord?
-Jacob
On Thursday, April 10, 2014 12:51:19 PM UTC-4, Jacob Quinn wrote:
I thought this would work, but it seems that when I insert items in
ascending order
On Thu, Apr 10, 2014 at 11:07 AM, Tony Kelman t...@kelman.net wrote:
MPFR and GMP are LGPL, which is not quite as problematic or viral.
Some of SuiteSparse is GPL, parts of it are LGPL, and at least one file of
the Julia code in base for sparse matrices that is based on parts of
SuiteSparse
Le jeudi 10 avril 2014 17:19:12 UTC+2, Tony Kelman a écrit :
help setdiff
well, findin returns the positions of the elements, not the elements
themselves.
This is quite different.
julia findin(honolulu,ou)'
1x4 Array{Int64,2}:
2 4 6 8
julia intersect(honolulu,ou)'
1x4 Array{Char,2}:
You *could* use setdiff, it depends on what you're working with (e.g. a
range of integers)
In [24]: a = [1:10]
Out [24]: 10-element Array{Int64,1}:
1
2
3
4
5
6
7
8
9
10
In [25]: b = [2,6,9]
Out [25]: 3-element Array{Int64,1}:
2
6
9
In [26]: setdiff(1:10,findin(a,b))
Ok, I found embedding.c. Allocating Julia arrays as given in the example
there works. In Julia, I specify the return type of the C function as Any,
and I get a nice tuple.
On Thursday, April 10, 2014 12:30:18 AM UTC-7, Dominique Orban wrote:
Thanks for the suggestions. Changing the return
Le jeudi 10 avril 2014 19:45:04 UTC+2, Jacob Quinn a écrit :
You *could* use setdiff, it depends on what you're working with (e.g. a
range of integers)
I am working with general collections. but then I can define
findnot(a,b) = setdiff(1:length(a), findin(a,b))
which seems to work as I
On 4/10/14, 12:31, Mike Nolta wrote:
On Thu, Apr 10, 2014 at 11:07 AM, Tony Kelman t...@kelman.net wrote:
MPFR and GMP are LGPL, which is not quite as problematic or viral.
Some of SuiteSparse is GPL, parts of it are LGPL, and at least one file of
the Julia code in base for sparse matrices
I'm not a lawyer either, but I don't think this is any more problematic
than the current situation with inclusion of Rmath etc. The combined work
is GPL (or LGPL, once we get rid of the GPL parts), but the vast majority
of the source files are (also) MIT. This seems fine since MIT gives all of
If it is just connecting to the IPython notebook HTTP server, the only
difference it should have to deal with is that IJulia uses a different
default port (8998) than IPython (). You could try ipython notebook
--port --profile julia
On Thursday, April 10, 2014 11:36:36 AM UTC-4,
Thanks to everyone for the information. I guess it's fair to say a non-GPL
version is feasible and likely in the future. I love the language myself
and would continue using it myself regardless, but I wanted to clear this
up before I start evangelizing it at work.
I'm interested to hear more
should be fairly easy to use fftpack which has single and double precision
and is ok from the license.
Am Donnerstag, 10. April 2014 21:10:25 UTC+2 schrieb Jay Kickliter:
Thanks to everyone for the information. I guess it's fair to say a non-GPL
version is feasible and likely in the future.
I tried to simplify the inner loop to:
~~~
for word::D in data
remainder = (remainder word_size)
end
~~~
It still took more than half the time of the original (with table indexing
and two XORs) in my Win7-x64 machine. It shows that not much speed-ups with
the real operations can
I think it helps to distinguish in the license discussion build
dependencies and runtime dependencies.
As far as I can see:
- Core Julia, which consists of libjulia (statically linking libuv and
llvm) and the repl, are MIT licensed
- Base Julia has some GPL dependencies. But to get rid of them
Check out Cartesian's @nexprs macro. Docs are in the package, but the
functionality is now in Base.
That said, when @simd applies it should be even better.
--Tim
On Thursday, April 10, 2014 07:26:47 AM Mike Innes wrote:
To be fair, the simplest implementation being the fastest isn't
note that the running time does not change with a partial loop unroll, like
this:
~~~
function signed_loop{D:Unsigned, A:Unsigned}(::Type{D}, r::A, data,
table::Vector{A})
local j = 0
for i = 1 : div(length(data),20)
r = (r 8) $ table[1 + (data[j+=1]$convert(D,r))]
r =
...and adding @inbounds begin ... end around the r-update instruction block
actually slows things down
On Fri, Apr 11, 2014 at 6:44 AM, Laszlo Hars laszloh...@gmail.com wrote:
note that the running time does not change with a partial loop unroll, like
this:
~~~
function signed_loop{D:Unsigned, A:Unsigned}(::Type{D}, r::A, data,
table::Vector{A})
local j = 0
for i = 1 :
Hi, sorry for the newbie question:
in
https://github.com/emacs-ess/ESS/wiki/Julia
Instalation
(setq inferior-julia-program-name /path/to/julia/julia-release-basic)
wath path is this?
/path/to/julia/julia-release-basic
I run Julia in Ubuntu 12.04 64bits
thanks in advance
El viernes,
huh. i had forgotten about this.
i'll try four tables. it shouldn't be that hard to add (although there's
going to be extra book-keeping - it's not an obvious gain to me).
cheers,
andrew
On Thursday, 10 April 2014 19:08:21 UTC-3, Chris Foster wrote:
On Fri, Apr 11, 2014 at 6:44 AM, Laszlo
Btw, I think this is the standard CRC32 written in Julia (without the
4-byte trick, or data conversion or padding), based on the GNU Radio
implementation
~~~
module CRC32 ###
export crc32
const t =
Unless you pad it with the license itself ;-).
Seriously, I believe that such short snippets are considered fair use.
https://www.gnu.org/licenses/gpl-faq.html#GPLFairUse
On Friday, April 11, 2014 1:50:31 AM UTC+2, Mike Nolta wrote:
Probably a bad idea to post GPL code snippets to this list.
Hello all!
I am wondering if there is a way to find the size a file in megabytes. I'm
going to be outputting a lot of data and i'd like to monitor the size of my
output file and create a new file once it hits a certain size.
Thanks in advance
Jason
filesize() gives a file's size in bytes, divide that by (1024^2) and you're
good to go.
-E
On Thu, Apr 10, 2014 at 5:06 PM, Jason Solack jaysol...@gmail.com wrote:
Hello all!
I am wondering if there is a way to find the size a file in megabytes.
I'm going to be outputting a lot of data and
thank you!
On Thursday, April 10, 2014 10:34:32 PM UTC-4, Elliot Saba wrote:
filesize() gives a file's size in bytes, divide that by (1024^2) and
you're good to go.
-E
On Thu, Apr 10, 2014 at 5:06 PM, Jason Solack jays...@gmail.comjavascript:
wrote:
Hello all!
I am wondering if
Note that hard disc manufacturers use 1000^2 (it makes disks look bigger), and
Apple has followed their example in OSX.
62 matches
Mail list logo
