I am able to use git protocol there's no problem with that, git works out
of the box. However somehow julia can't connect to github. I added julia
from the ppa .
On Sat, Aug 2, 2014 at 9:07 AM, Stefan Karpinski ste...@karpinski.org
wrote:
You are most likely behind a firewall. Can you clone
I have some very simple Matlab code laying around that I have written
myself. It is capable of doing 1D, 2D but potentially any dimension. The
wavelet is given as a parameter and there are some defaults. I needed it as
a sparsity transformation for some compressed sensing work I have done.
So
There are two packages and some general package is discussed in here
https://github.com/JuliaDSP/Roadmap/issues/1#issuecomment-49784659. The
authors have also their own packages. I think the gummif's one does what
you would like. Disclaimer: I am one of them...
Best.
On Saturday, 2 August
Thanks for the link https://github.com/gummif/Wavelets.jl looks very good
and is MIT licensed.
Am Samstag, 2. August 2014 10:30:52 UTC+2 schrieb Tomas Krehlik:
There are two packages and some general package is discussed in here
Hi Ken,
sorry can i just ask you a question on this? Thibaut (post below) was
actually able to use your function to set Julia up on our departmental SGE
cluster and it works fine. That facility is down with a disk failure for
the time being though, so I have been trying to get going on a
Given a variable number of arrays, or an array of arrays, what is the best
Julian way to find the values that occur in all of them? So for
a = [1,2,3,4,5]
b = [6,7,3,4,9]
would return 3 and 4?
I thought about using .== for every possible pair of the N arrays but I
wondered if there was a
intersect(a, b) should work for that. It also can take a variable number of
arrays/iterables. There’s also ∩ (type \captab at the REPL), which is the
synonym for intersect if you like Unicode.
— Mike
Suppose I have some type T{P1,P2,P3} depending some parameters. I don't
know which type exactly, except that it originates from a type hierarchy
which has 3 parameters. What is the best way to construct, given e.g. a
variable of type T{P1,P2,P3} with specific values for P1, P2, P3, to
Ah thanks! One last question, what should the input be for (setq
inferior-julia-program-name) in .emacs? Should this be the location of the
julia binary?
Yes.
I work a good deal with Set objects. When I found the sizehint function, I
thought this would be useful to use as the data structure supporting my
sets would be pre-allocated to be large enough for what I anticipated
putting therein. But sizehint doesn't apply to Set objects:
julia A = Set()
Yes, that package seems good, it has image decomposition and MIT license.
Thanks, I'll check it out more indepth.
On Saturday, August 2, 2014 5:42:55 AM UTC-3, Tobias Knopp wrote:
Thanks for the link https://github.com/gummif/Wavelets.jl looks very good
and is MIT licensed.
Am Samstag, 2.
Do note that the imminent release is **0.3**, not *3.0*. There's been a
little confusion around about Julia's versioning, so just thought I'd
clarify.
On Fri, Aug 1, 2014 at 8:35 AM, Daniel Carrera dcarr...@gmail.com wrote:
Thanks!
On 1 August 2014 14:04, Ivar Nesje iva...@gmail.com wrote:
How come I did not notice. I hope we never make stupid enough mistakes in
1.0 that we will ever need a 2.X release (and even worse a 3.0 release).
kl. 20:27:35 UTC+2 lørdag 2. august 2014 skrev Jacob Quinn følgende:
Do note that the imminent release is **0.3**, not *3.0*. There's been a
Just to close this off I did some more experiments and it is clear that
using the \-based solving is the main performance enhancement (2-25 times
faster for N M in the 10:5000 range I've tested with!) while
UniformScaling gives a rather small improvement (few percent) on top of
that (expected
(Hope this isn't a disappointment, but this was implemented already in
v0.3.)
On Sat, Aug 2, 2014 at 10:59 AM, Ivar Nesje iva...@gmail.com wrote:
Note that we're not lazy, but we know that contributing to Julia is highly
addictive. We want more people to look at Base with a critical eye in
Hey all,
I finally got around to playing around with a suffix array implementation
and wanted to share. It's a pure julia port of sais
https://sites.google.com/site/yuta256/sais, by Yuta Mori and while not
the bleeding edge fastest suffix array sorting algorithm out there, I
personally think
Not a disappointment at all! I look forward to 0.3 being officially
released. Thank you.
On Saturday, August 2, 2014 4:00:12 PM UTC-4, Kevin Squire wrote:
(Hope this isn't a disappointment, but this was implemented already in
v0.3.)
On Sat, Aug 2, 2014 at 10:59 AM, Ivar Nesje
The JuliaOpt team is pleased to announce ECOS.jl
https://github.com/JuliaOpt/ECOS.jl, a wrapper for the linear program and
second-order cone program solver ECOS https://github.com/ifa-ethz/ecos.
In METADATA now!
Credit goes to João Felipe Santos (@jfsantos) for starting this particular
The \ method may also be more numerically stable.
On Saturday, August 2, 2014 3:49:10 PM UTC-4, Robert Feldt wrote:
Just to close this off I did some more experiments and it is clear that
using the \-based solving is the main performance enhancement (2-25 times
faster for N M in the
Dear Julia colleagues,
I'm reviving this old thread because I am also trying to create two
versions of my balanced-tree code, the fast version and the debug version,
and I am trying to figure out the appropriate way for one source-code file
to yield two versions. In C++, the usual technique
constant propagation is almost implemented in inference.jl (it's quite
similar to type propagation), but it isn't active now:
https://github.com/JuliaLang/julia/issues/5560
On Sat, Aug 2, 2014 at 8:33 PM, vava...@uwaterloo.ca wrote:
Dear Julia colleagues,
I'm reviving this old thread because
Dear Julia Colleagues,
I'm writing a balanced-tree library in Julia. Balanced trees can be used
to implement a sort-order dictionary, which is a particular implementation
of the Associative abstract type, so I write:
type SortOrderDict{K,V} : Associative{K,V}
where SortOrderDict is my own
See https://github.com/JuliaLang/julia/issues/5533
On Aug 2, 2014 9:51 PM, vava...@uwaterloo.ca wrote:
Dear Julia Colleagues,
I'm writing a balanced-tree library in Julia. Balanced trees can be used
to implement a sort-order dictionary, which is a particular implementation
of the
There's something else wrong. It makes no sense that the time hit should be so
large; evaluating sin is _expensive_, much more than a conditional, especially
since this one will work perfectly with the CPU's branch-point prediction.
I tried it using @time rather than tic/toc, and the extra
When the JAGS had been installed and added a path C:\Program
Files\JAGS\JAGS-3.4.0\x64\bin to system variable on WIndows 7 x64, I turn
Julia's REPL to shell mode and then command run(`jags`). But, it return
error like Error: could not spawn `jags`: no such file or directory
(ENOENT).
I have
jags is distributed as jags.bat, but jags.bat is defined as not executable
in windows. This is because Windows doesn't let you spawn arbitrary files.
The command prompt implements various workarounds for this, but libuv has
chosen not to try to duplicate them. It seems your options are either to
Hi Jameson,
1) run(`cmd jags`) lets Julia go into command prompt, and then input jags will
go into JAGS mode. Can it come back to Julia again?
2) run(`jags-terminal`) seems find JAGS but fails to load JAGS' modules, it
says module could not be found.
Any suggestions?
Thank you.
Jameson於
28 matches
Mail list logo
