Re: [julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

On Thursday, April 28, 2016 at 9:21:03 PM UTC-4, 2n wrote: > > If you re-write or translate something doesn't it necessarily mean that > you are no longer using licensed code? that you have full copyrights to the > new code? > No, typically a translation would be considered a "derived work" of

Re: [julia-users] use of parse and eval to create programmatically anonymous function

On Thu, Apr 28, 2016 at 6:05 PM, Josh Langsfeld wrote: > That's quite a strong statement to say never use parse. Could you explain? I > think manipulating strings is typically much easier than Expr objects. I don't believe that is true. String processing is slow, error prone

[julia-users] Re: What are the best ways to define scenarios?

Define a type (possibly immutable) per sensation, with the constants Create a function that operates on that type that carries out the scenario. loop (or map (or pmap)) through an array of the aforementioned type, applying the aforementioned function. On Friday, 29 April 2016 09:15:40 UTC+8, K

Re: [julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

On Wednesday, 27 April 2016 21:10:47 UTC+8, Mosè Giordano wrote: > > Hi Kristoffer, > > 2016-04-27 14:32 GMT+02:00 Kristoffer Carlsson >: > > This looks interesting. > > Thank you! > > > It is in my opinion a bit unfortunate that you chose > > to use the GPL license

Re: [julia-users] Image not saving

The key line in the error message is "out-of-range values": if you're using `Float64`, black corresponds to 0.0 and white corresponds to 1.0. It's alerting you that some of your values went outside that range. If it didn't alert you to this problem in some way, then you'd wonder "how come I had

[julia-users] What are the best ways to define scenarios?

Each scenario has the same set of constants but with different values. I would like to loop through all these scenarios. What are the best ways to handle this?

Re: [julia-users] Re: Trouble with parametric parts of a type def

On Thu, Apr 28, 2016 at 7:13 PM, Ben Ward wrote: > The only way I've come up with so far is with this clunky looking type > union: > > intsAndVecs = Union{Unsigned, > AbstractVector{UInt8}, > AbstractVector{UInt16}, >

[julia-users] Re: Trouble with parametric parts of a type def

The only way I've come up with so far is with this clunky looking type union: intsAndVecs = Union{Unsigned, AbstractVector{UInt8}, AbstractVector{UInt16}, AbstractVector{UInt32}, AbstractVector{UInt64},

[julia-users] Trouble with parametric parts of a type def

Hi, I'm tying to create a parametric type which can hold a variable which could be any kind of vector, and whatever the vector is, it can store one of the UInts. So it could have: UInt8[1,2,3] UInt64[1,2,3] UnitRange(1, 3) UnitRange(UInt16(1), UInt16(3)) ... and so on. But I'm having trouble

Re: [julia-users] use of parse and eval to create programmatically anonymous function

That's quite a strong statement to say never use parse. Could you explain? I think manipulating strings is typically much easier than Expr objects. On Thursday, April 28, 2016 at 8:38:27 AM UTC-4, Yichao Yu wrote: > > > On Apr 28, 2016 7:15 AM, "Ben Lauwens" > wrote: > > >

[julia-users] GLVisualize in existing OpenGL context

Hi, For QML.jl, I have created an experimental OpenGL QML type that can be used as rendering target for GLAbstraction.jl by simply skipping the GLFW commands and drawing directly to the Qt-provided context (code: https://github.com/barche/QML.jl/blob/master/example/gltriangle.jl). I attempted

Re: [julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

2016-04-28 22:34 GMT+02:00 Steven G. Johnson : > > > On Thursday, April 28, 2016 at 4:09:54 PM UTC-4, Mosè Giordano wrote: >> >> > +1 for ComplexRoots.jl >> >> Ok, then I'll see how to change the name of the package in METADATA.jl > > > I would suggest something like

Re: [julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

Hi Steven, 2016-04-28 14:58 GMT+02:00 Steven G. Johnson : > On Thursday, April 28, 2016 at 8:46:06 AM UTC-4, Steven G. Johnson wrote: >> >> Out of curiosity, how does the performance and accuracy compare to the >> "roots" function in the Polynomials.jl package, which uses

Re: [julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

On Thursday, April 28, 2016 at 4:09:54 PM UTC-4, Mosè Giordano wrote: > > > +1 for ComplexRoots.jl > > Ok, then I'll see how to change the name of the package in METADATA.jl > I would suggest something like PolynomialRoots.jl; the names "ComplexRoots" are "CmplxRoots" are not very

[julia-users] Re: First time setup of Atom/Juno failing with LoadError's

Never mind, I ended up solving the problem, though not quite sure where the issue was. After numerous install/reinstall attempts I installed the Atom package in the julia command line successfully, and then opened Atom successfully. It showed INFO: Precompiling module Atom... and succeeded.

[julia-users] Suppress warnings during tests?

My code has several functions which print warnings under certain conditions. The problem is, I have lots of tests, many of which create the conditions that trigger a warning, and these warnings are not useful to print during Pkg.test("MyModule"). Is there a way to suppress this output?

[julia-users] GPU capabilities

Hi All, Has anyone here had experience using Julia programming using Nvidia's Tesla K80 or K40 GPU? What was the experience, is it buggy or does Julia have no problem.?

[julia-users] Re: First time setup of Atom/Juno failing with LoadError's

And to be complete, I completely deleted Atom and re-installed it, and the uber-juno package. First use of the console goes through the setup, then hits a road block at "Precompiling module Atom" INFO: Precompiling module Atom... Please submit a bug report with steps to reproduce this fault,

Re: [julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

Hi David, 2016-04-28 14:10 GMT+02:00 David P. Sanders : > As far as I could see, the original library has an Apache license, so you > should be able to use MIT. > > I believe that you need to include a copy of the original license in your > package? Original code is

[julia-users] First time setup of Atom/Juno failing with LoadError's

I'm setting up the Juno IDE and Julia for the first time. Windows 10. Julia runs from the command line ok. When I start Atom it starts installing packages in Julia and runs into errors. I've opened up Julia's command prompt and Pkg.rm("Atom") shut down Atom and restarted it. Again I saw errors

[julia-users] Problem read HDF5 file with Mocha

Hello, I am working on some image classification problems using Mocha.jl. I converted my jpg images into an HDF5 in a very similar fashion to the example moist conversion script (https://github.com/pluskid/Mocha.jl/blob/master/examples/mnist/convert.jl). I was force to convert the eight bit

[julia-users] Image not saving

When I plotted a Julia set, I used this: array = Array{UInt8}(size, size, 3) imOutput = Images.colorim(array) then for each pixel imOutput.data[x, y, :] = [r, g, b] then to output: FileIO.save(filename, imOutput)

[julia-users] Image not saving

Hello all, I'm trying to save PNG images of the mandelbrot set. So, I've been using the package Images to do so. To get a grip around how the package works, I've decided to test out the function "save". I've given it a filename to save in and a random two-dimensional array of Float64s

Re: [julia-users] Re: Manual deallocation

Thanks! On Thursday, April 28, 2016 at 10:15:21 AM UTC-4, Yichao Yu wrote: > > On Thu, Apr 28, 2016 at 10:10 AM, Cedric St-Jean > wrote: > > Number of weak references. That was 7-8 years ago, I can't find a source > > now. Maybe it was fixed. Maybe I misunderstood -

[julia-users] Re: Starting Julia with Julia -p 2 provides 1 worker

A friend on mine encounters the same problem with another Macbook Pro model and El Captain OS. "julia -p N" doesn't work from terminal but addprocs() works as a charm

Re: [julia-users] Re: Manual deallocation

On Thu, Apr 28, 2016 at 10:10 AM, Cedric St-Jean wrote: > Number of weak references. That was 7-8 years ago, I can't find a source > now. Maybe it was fixed. Maybe I misunderstood - O(N^2) doesn't make much > sense. But I clearly remember using them a lot to "add fields"

Re: [julia-users] Re: Manual deallocation

Number of weak references. That was 7-8 years ago, I can't find a source now. Maybe it was fixed. Maybe I misunderstood - O(N^2) doesn't make much sense. But I clearly remember using them a lot to "add fields" to existing objects, and profiling to see >90% GC time. On Thursday, April 28, 2016

Re: [julia-users] Re: Manual deallocation

On Apr 28, 2016 8:53 AM, "Cedric St-Jean" wrote: > > I'd like to know the cost of weak references / dicts. In SBCL, they had a catastrophic O(N^2) impact on GC. What's N, heap size?live cell?dead cell?num of weak ref? > > On Wednesday, April 27, 2016 at 9:18:20 PM

[julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

On Thursday, April 28, 2016 at 8:46:06 AM UTC-4, Steven G. Johnson wrote: > > Out of curiosity, how does the performance and accuracy compare to the > "roots" function in the Polynomials.jl package, which uses the standard > companion-matrix approach? > Just checked: it is much faster than

Re: [julia-users] Re: Manual deallocation

I'd like to know the cost of weak references / dicts. In SBCL, they had a catastrophic O(N^2) impact on GC. On Wednesday, April 27, 2016 at 9:18:20 PM UTC-4, Yichao Yu wrote: > > On Wed, Apr 27, 2016 at 9:00 PM, Stefan Karpinski > wrote: > > Performance. If you want to

[julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

On Wednesday, April 27, 2016 at 7:15:35 AM UTC-4, Mosè Giordano wrote: > > Dear all, > > I am happy to announce the first version of CmplxRoots.jl > , a fast root finder of real > and complex polynomials. > > This is a Julia implementation of the

Re: [julia-users] (Large memory) computations and disk swapping

Try the following code: addprocs(3) using IterativeSolvers function test(N=1) @sync K=SharedArray(Complex{Float64}, (N,N), init = S -> S[Base.localindexes(S)] = rand()) f=SharedArray(Complex{Float64},N) fill!(f, 1.0+1.0im) #constant normal extension of the given Dirichlet data

Re: [julia-users] use of parse and eval to create programmatically anonymous function

On Apr 28, 2016 7:15 AM, "Ben Lauwens" wrote: > > Hi > > I like to create automatically functions that evaluates the total derivative of a function with respect to time, eg. > given f(t, x1, x2) = t^2+x1*x2, I want to obtain df/dt(t,x1,x2,dx1/dt,dx2/dt) =

Re: [julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

As far as I could see, the original library has an Apache license, so you should be able to use MIT. I believe that you need to include a copy of the original license in your package? +1 for ComplexRoots.jl

Re: [julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

There is a reason, then ;) But I see you have already changed the name from cmplx_roots to CmplxRoots.jl to keep up with Julia naming conventions, so going all the way would be even better! Who knows what odd reasons or compromises may be behind the original name. Just to refer to the Julia

Re: [julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

Hi, 2016-04-28 12:57 GMT+02:00 DNF : > Just a question: Is there some particular reason you chose to to skip the > letters 'o' and 'e' in the name? > > It seems like the kind of thing that would make the package hard to find, > and cause confusion and frustration. In fact, while

[julia-users] use of parse and eval to create programmatically anonymous function

Hi I like to create automatically functions that evaluates the total derivative of a function with respect to time, eg. given f(t, x1, x2) = t^2+x1*x2, I want to obtain df/dt(t,x1,x2,dx1/dt,dx2/dt) = 2t+x1*dx2/dt+x2*dx1/dt, d2f/dt2(t,x1,x2,dx1/dt,dx2/dt,d2x1/dt2,d2x2/dt) =

[julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

Just a question: Is there some particular reason you chose to to skip the letters 'o' and 'e' in the name? It seems like the kind of thing that would make the package hard to find, and cause confusion and frustration. In fact, while I immediately saw that you skipped the 'e', it read it many

Re: [julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

Of course, if you started with a LGPL library, then this much be LGPL. Just for some context, a majority of Julia packages, including the core language are under MIT license. So there is a certain preference for that, but other licenses are certainly not precluded. There is a lot of GPL/LGPL

[julia-users] Re: Fbls - a simple but flexible Julia DB

1) In general, the typical paradigm in Julia for these kinds of things is lazy checking, and runtime errors if applicable. If you want stricter checking, have you seen: https://github.com/mauro3/Traits.jl 2) Which version of Julia do you intend to support? The way tuple types are denoted has

Re: [julia-users] Re: [ANN] CmplxRoots.jl: Fast Complex Polynomial Root Finder

2016-04-27 15:10 GMT+02:00 Mosè Giordano : > Hi Kristoffer, > > 2016-04-27 14:32 GMT+02:00 Kristoffer Carlsson : >> This looks interesting. > > Thank you! > >> It is in my opinion a bit unfortunate that you chose >> to use the GPL license for this

[julia-users] Re: Improvements to GPU integration with Julia

Hey, I am one of the maintainers of OpenCL.jl and I would recommend you to look at https://github.com/JuliaGPU/OpenCL.jl, https://github.com/JuliaGPU/CLFFT.jl, and https://github.com/JuliaGPU/CLBLAS.jl. We welcome any improvements and help. I can only speak for myself in that most of the