In julia we don't say you shouldn't do something that could give better
performance (if you really want it). The thing is that Julia uses automatic
garbage collection because it is a pain to do manually, and then you have
to live with the semantics of a garbage collector.
If your program is
Suppose I have an abstract class. I want to provide a kind of default
property of all sub-types of it.
I believe I can do this using a function, for example
abstract Machine
function data(m::Machine)
Int[]
end
type BigMachine : Machine
data::Vector{Integer}
end
function
Hi Zenna,
there has been a long discussion in
https://github.com/JuliaLang/julia/issues/4935 on the subject. Please have
a look at te whole thread as the thinking has changed quite a bit.
In short you can also just assume that an asbtract type has certain field.
Then you would only have to
d:\addprogram\Julia 0.3.0-prereleasejulia.lnk
ERROR: stat: connection reset by peer (ECONNRESET)
d:\addprogram\Julia 0.3.0-prereleasejulia.lnk
_
_ _ _(_)_ | A fresh approach to technical computing
(_) | (_) (_)| Documentation: http://docs.julialang.org
What has happened, two months later, to the (in)famous 'dot' notation in
Julia?
There was such a convincing discussion that 5 + x shall not be correct, so
I got used to it. When I now by chance try
julia x = [0.1, 0.2, 0.3];
julia 5 + x
3-element Array{Float64,1}:
5.1
Le mardi 08 juillet 2014 à 01:51 -0700, Hans W Borchers a écrit :
What has happened, two months later, to the (in)famous 'dot' notation
in Julia?
There was such a convincing discussion that 5 + x shall not be
correct, so
I got used to it. When I now by chance try
julia x = [0.1, 0.2,
Hi Don,
I think the reason they're not sparse is that in the line
A = (In - rho*W);
the matrix In is not sparse: if you replace the line
In = eye(n);
by
In = speye(n);
the result should then be sparse. However at the moment there doesn't seem
to be a sparse det method (I just filed
I think I-ρW would be even better in this case. I is a generic identity
matrix. A and B are probably positive definite. If so, I think
logdet(cholfact(A)) would be the best solution.
2014-07-08 11:06 GMT+02:00 Simon Byrne simonby...@gmail.com:
Hi Don,
I think the reason they're not sparse is
Has this been announced somewhere? (Frankly,I'm not reading julia-dev on a
regular basis.)
I see that the manual does not reflects this change. See section
Vectorized Operators and Functions:
Some operators without dots operate elementwise anyway
when one argument is a scalar.
These
Just commenting on the lack of anouncement. As all this happend on a
developement branch of Julia which is always a little in flux these things
should not really be anounced. What counts is how the NEWS file looks in
the end.
Am Dienstag, 8. Juli 2014 11:56:12 UTC+2 schrieb Hans W Borchers:
Try one of the newer builds (last week or less). This issue was addressed
in https://github.com/JuliaLang/julia/issues/5574
On Tuesday, July 8, 2014 4:47:50 AM UTC-4, Andreas Lobinger wrote:
d:\addprogram\Julia 0.3.0-prereleasejulia.lnk
ERROR: stat: connection reset by peer (ECONNRESET)
Little bit better, but still not there...
On Tuesday, July 8, 2014 11:26:40 AM UTC+2, Willy Heineman wrote:
Try one of the newer builds (last week or less). This issue was addressed
in https://github.com/JuliaLang/julia/issues/5574
D:\addprogram\Julia-0.3.0-prereleasejulia.lnk
Fully realising that this discussion has been settled and the convention is
here to stay, I nevertheless feel obsessed to make the remark that there
would have been more elegant solutions. Other languages have been able to
come up with acceptable operators for a binary 'min' or 'max':
Since I just read these operators were later removed from gcc again, it must
not all have been perfect either :D.
On 08 Jul 2014, at 16:04, Jutho juthohaege...@gmail.com wrote:
Fully realising that this discussion has been settled and the convention is
here to stay, I nevertheless feel
Hi everybody,
I wrote a vanilla feedforward neural network package a bit ago and was
hoping work to polish it up (with the long term goal of getting it
registered with the Julia distribution).
The package repo can be found here: https://github.com/EricChiang/ANN.jl
Can anyone provide general
Please open a github issue. What is your %HOMEDRIVE%%HOMEPATH%?
On Tue, Jul 8, 2014 at 9:47 AM, Andreas Lobinger lobing...@gmail.com
wrote:
Little bit better, but still not there...
On Tuesday, July 8, 2014 11:26:40 AM UTC+2, Willy Heineman wrote:
Try one of the newer builds (last week or
Are there any plans to document the Julia GC (i.e. your comment implies
that it's a stop-the-world GC) and/or add performance tuning knobs?
On Tue, Jul 8, 2014 at 12:17 PM, Stefan Karpinski ste...@karpinski.org
wrote:
Writing `A = nothing` in Julia will not cause the memory used by A to be
In terms of rich output in the recent release I really just threw together the
most basic thing that worked. For now that means there're going to be some
issues like this, but the good news is I'll be adding lots of frills and polish
for the next release.
Ideally I do want to support both
It is currently, stop-the-world, although that could change. What kind of
documentation would you be interested in? There's really nothing
interesting about Julia's GC at this point – it's completely vanilla
stop-the-world, mark-and-sweep.
On Tue, Jul 8, 2014 at 9:28 AM, Abraham Egnor
Ok , I know what I am going to do :).
So I have split my projet into 4 parts...
*Part 1:*
I need to find a way to store pixels in a 3D Euclidean space. (X,Y,Z) with
X,Y and Z *INTEGER*
I can do this with a 3xXxYxZ Array{Uint8,4}.
But I will need to know if a (X,Y,Z) position is empty or not
Animations are there; check out the demo. I've decided to go for simplicity
and let the user wrap animations in loops, which should call the animate()
function to update the screen at the end of every frame, rather than
building a draw() function that automatically and perpetually loops. This
And, yes, Julia packages in the art department are still few and young, but
we're getting there. ;)
Best,
Rob
On Tuesday, July 8, 2014 6:48:25 PM UTC+2, Robert Ennis wrote:
Animations are there; check out the demo. I've decided to go for
simplicity and let the user wrap animations in loops,
Hi all, I'm trying to get julia working via ESS in Aquamacs 3.0a. I managed
to get it running on one computer but can't seem to get it on another one
with very similar setups. The first thing I did was add this to my .emacs
(setq inferior-julia-program-name
You may also find this pull request interesting:
https://github.com/JuliaLang/julia/pull/5227
On Tuesday, July 8, 2014 11:31:12 AM UTC-5, Abraham Egnor wrote:
Are there any plans to document the Julia GC (i.e. your comment implies
that it's a stop-the-world GC) and/or add performance tuning
For 3D, Simon is the go-to person.
But for just displaying an image (which was your question at the bottom),
ImageView will do exactly what you want. See the README, focusing especially
on the programmatic usage section. If you're storing the array color-first,
you'll need to wrap it in an
Thanks for the question.
On Tuesday, July 8, 2014 4:38:15 PM UTC+2, Jameson wrote:
Please open a github issue. What is your %HOMEDRIVE%%HOMEPATH%?
afaics (i'm not really a windows commandline user, i use cygwin for that)
HOMEPATH=\
HOMEDRIVE=H:
and as you can assume, H: is only available
Could you file an issue about the segfault with the code to reproduce it?
Definitely not useful if it segfaults.
-viral
On Monday, July 7, 2014 12:45:38 AM UTC-7, Robert Feldt wrote:
BTW, can anyone explain why it segfaults if one continues increasing the
number of procs available:
Have you seen this section of the
manual: http://docs.julialang.org/en/latest/manual/packages/ ?
-viral
On Tuesday, July 8, 2014 7:29:03 AM UTC-7, Eric Chiang wrote:
Hi everybody,
I wrote a vanilla feedforward neural network package a bit ago and was
hoping work to polish it up (with the
I believe I saw discussion of finding areas of memory allocation in the
output of Profile.view() or the flame plot from ProfileView.view().
However, like so many other things, I fail to remember the details.
The particular case I am interested in is described in an IJulia notebook
called
You can find the places where garbage is collected using ProfileView; bars in
red correspond to lines that trigger gc. For this to work properly, your C
backtraces have to resolve the function name correctly. That worked for me on
Kubuntu 12.04, but after upgrading to Kubuntu 14.04 now I get
Thanks tim, I made a wonderfull movie.
but you need to have a 800*600 image.bmp
to work properly
using Images
using ImageView
img = imread(image.bmp)
c = canvasgrid(1,1)
ops = [:pixelspacing = [1,1]]
display(c[1,1], img; ops...)
for i = 1:200
img.data = rand(Uint8,3,800,600)
This should work, except that you're not providing any initial values for x. Is
your problem one-dimensional or multi-dimensional?
-- John
On Jul 8, 2014, at 11:44 AM, Mathieu Taschereau-Dumouchel mat...@gmail.com
wrote:
I am trying to optimize a simple function that takes a parameter as an
I am trying to optimize a simple function that takes a parameter as an
argument. Something like:
a=2
f(x)=-(x-a)^2
optimize(f)
Is there any way to do this? I have played quite a bit with optimize
without success.
Thanks a lot
Mathieu
Thanks for that. I installed the package but it's still not functioning.
Interestingly, I have noticed that I neither start R nor Julia from an
Emacs shell. And again, although M-x R does work M-x julia does not. Other
ideas?
On Tuesday, July 8, 2014 12:29:31 PM UTC-5, Ista Zahn wrote:
Hi
Thanks for the quick reply!
My problem is one-dimensional. Here is the code:
using Optim
a=2
f(x)=-(x-a)^2
optimize(f,3)
I get:
ERROR: no method optimize(Function, Int64)
I am running Version 0.3.0-prerelease+3884 (2014-06-25 10:41 UTC) and have
updated all packages.
Thanks for your help
scratch that, R does start up in the emacs shell. And I fixed my path
variable so I can start julia up in the emacs shell too (had a syntax error
in my .bash_profile).
What I still cannot get is M-x julia to work on emacs start-up. However,
M-x julia does work once I've run M-x R. It seems
I run Julia 0.3.0-prerelease on Windows 7 64.
I am trying to install Sublime-IJulia that I would like to evaluate, looks
like exactly what I am looking for as an IDE.
I went through all the install steps
https://github.com/quinnj/Sublime-IJulia.
I keep on getting the dreaded ***Kernel Died***.
OK, got it working after more playing. I had to remove the path from my
.emacs file get it write in the .bash_profile. It seemed that the path
was set more than once in emacs bash and this was causing the crash and
ess not recognizing it.
On Tuesday, July 8, 2014 2:06:35 PM UTC-5, Steve
Mostly I was looking for documentation on performance characteristics,
although I'd settle for anything at all :) The Julia home page and manual
have zero mention of memory management that I could find, except for a FAQ
entry about unbinding large values in the REPL. I inferred GC but the
Hi Steve,
Glad you got it working. I just tried it out with aquamacs (can't
stand it myself, but to each his own...) and it worked for me,
provided that I set
(setq inferior-julia-program-name
/Applications/Julia-0.2.1.app/Contents/Resources/julia/bin/julia-basic)
rather than
(setq
Dear Simon,
Thank you for the quick and informative response! I have a few
questions/observations:
1) Thank you for the information regarding the randn() function. I found a
workaround in the original code but now it looks much better and acts as
expected.
2) When I use A = sparse(In -
Andreas,
Yes, you are correct and your solution works just fine.
Thank you for taking the time to answer my question. I've said it before
but the kindness and generosity of this community is remarkable!
Thanks,
Don
On Tuesday, July 8, 2014 5:34:45 AM UTC-4, Andreas Noack wrote:
I think
Yes, we should probably have a manual chapter on memory management.
On Tue, Jul 8, 2014 at 12:46 PM, Abraham Egnor abe.eg...@gmail.com wrote:
Mostly I was looking for documentation on performance characteristics,
although I'd settle for anything at all :) The Julia home page and manual
have
Ok. Then there are two problems witht the inputs you're using:
(1) One-dimensional optimize doesn't take a single starting point, it takes a
bracket in which you think the minimum occurs.
(2) You need to use floating point inputs.
Things will work if you do optimize(f, -10.0, 10.0) or
Definitely a missing piece. Here's the relevant issue:
https://github.com/JuliaLang/julia/issues/6975. It's largely a question of
design and implementation.
On Tue, Jul 8, 2014 at 12:56 PM, Abraham Egnor abe.eg...@gmail.com wrote:
I'm very new to Julia, so my apologies for the bits I
Ahh I see. It works now.
Thanks a lot!
Mathieu
On Tuesday, July 8, 2014 4:00:44 PM UTC-4, John Myles White wrote:
Ok. Then there are two problems witht the inputs you're using:
(1) One-dimensional optimize doesn't take a single starting point, it
takes a bracket in which you think the
Hi Rob,
Thanks for your answer. I use very similar approach with Emacs and ESS
mode[1]: I've bound command ess-eval-line-and-step to C-d (CONTROL /
COMMAND + D) to be able to send single line and ess-load-file to C-c
C-c (double CONTROL / COMMAND + C) to reload the entire file. I don't like
Hi, I am writing an MCMC likelihood function that comes from a dynamic
model. I have about 50 state variables for several thousand individuals
that each get updated iteratively over time. However, some individuals'
variables get updated at some type steps but not at others (because they
are
What you're doing isn't a workaround: it's the correct way to do this in the
current version of Julia. There may be shorthand in the future, but this is the
right approach today.
-- John
On Jul 8, 2014, at 2:01 PM, Andrei Zh faithlessfri...@gmail.com wrote:
Here's another question about
Abraham, you might also be interested in the prototype that I have prepared
in https://github.com/JuliaLang/julia/pull/7025
While I am also looking forward that anything like this lands in Julia,
this is mainly about getting better error messages and code organization.
Julia is perfectly
On Tuesday, July 8, 2014 1:41:40 PM UTC-5, Tim Holy wrote:
You can find the places where garbage is collected using ProfileView; bars
in
red correspond to lines that trigger gc. For this to work properly, your C
backtraces have to resolve the function name correctly. That worked for me
Hi Andrei,
I'll have a look at your pointers before further extending the TextMate bundle,
particularly [2] looks promising.
Thanks, and regards,
Rob J. Goedman
goed...@icloud.com
On Jul 8, 2014, at 2:19 PM, Andrei Zh faithlessfri...@gmail.com wrote:
Hi Rob,
Thanks for your answer. I
The documentation
here http://julia.readthedocs.org/en/latest/manual/introduction/ works
beautifully, you can search it by keywords, etc. and every function in the
standard library is represented. As for user-defined functions, I'm not
sure what we can do about that except for looking at the
On Tuesday, July 08, 2014 03:24:02 PM Douglas Bates wrote:
Is there a way of zooming in on the window?
Just click drag. (If you're running from the REPL; doesn't work in IJulia.)
Double-click to go back out to the full view.
--Tim
Thanks for the answers. I agree that a manual chapter would be helpful.
For your additional question: no overhead for the abstract version versus
the two specialized. Don't think of them as types like in C/C++ function
definition, think of them as a filter. Julia will compile a new version for
every type input you put in anyway that is specialized for the type
(on a related note, for the same reason type assertions in a method
definition don't actually improve performance)
On Tuesday, July 8, 2014 6:19:51 PM UTC-7, Iain Dunning wrote:
For your additional question: no overhead for the abstract version
versus the two specialized. Don't think of them
As an experiment, I had recently started work on implementing the reverse
of this (extracting the implicit interface given a type) in a pull request
for astrieanna's TypeCheck.jl package:
https://github.com/vtjnash/TypeCheck.jl/commit/b0ebcac4c2a9a3daccd1eeb1b28030b90ae5e2c9
On Tue, Jul 8, 2014
The only reference I can find in the manual to the `const` keyword is in
the performance section [1]. Well, that and the `isconst` function[2].
This seems like it would be worth documenting, especially since it behaves
significantly differently than the const that I remember from Java or C++,
That's a really cool idea. It will be really interesting to see what our
implicit interfaces are determined to be.
On Tue, Jul 8, 2014 at 7:22 PM, Jameson Nash vtjn...@gmail.com wrote:
As an experiment, I had recently started work on implementing the reverse
of this (extracting the implicit
I was wondering if anyone has done any work on Gaussian process factor
analysis in julia? I'm interested in the techniques in this paper:
1. Yu, B. M. *et al.* Gaussian-process factor analysis for low-dimensional
single-trial analysis of neural population activity. *Journal of
Neurophysiology*
61 matches
Mail list logo
