Re: [julia-users] Re: TinySegmenter benchmark

[Michiaki ARIGA]

Finally, I compared with C++ and Go version using TinySegmenterMaker.
https://github.com/shogo82148/TinySegmenterMaker/pull/10

The resulting times(in seconds for 100 loops a text file) is following:
RubyC++PerlNode.jsGoPythonJulia132.9848134105.3110.50111.8511.70

After my blog post, ikawaha optimized Golang version using same way we did,
and golang gets faster than Julia.

On Thu, Oct 22, 2015 at 11:45 PM Michiaki ARIGA <che...@gmail.com> wrote:

> Masahiro Nakagawa a.k.a. repeatedly told me my mistakes of the benchmark,
> I re-benchmarked.
>
> Node.jsPython2Python3JuliaRuby9.6293.0823.941.4619.44
>
> - loop number of Python was 10 times smaller than other languages
> - repeatedly optimized Ruby implementation
> - changed loop size from 100 to 10
>
> repeatedly also benchmarked in dlang, I will do it after updating El
> Capitan :)
> http://repeatedly.github.io/ja/2015/10/tinysegmenter-benchmark-and-d/
>
>
> On Thu, Oct 22, 2015 at 6:28 AM Pontus Stenetorp <pon...@stenetorp.se>
> wrote:
>
>> On 21 October 2015 at 17:49, Stefan Karpinski <ste...@karpinski.org>
>> wrote:
>> >
>> > That's an excellent performance comparison case study! Nice work,
>> Chezou and nice blog post (the Google translation is pretty readable).
>>
>> Very readable indeed and I am always happy to see more NLP code in
>> Julia!  Keep up the good work!
>>
>> Pontus
>>
>

Re: [julia-users] Re: TinySegmenter benchmark

[Michiaki ARIGA]

Masahiro Nakagawa a.k.a. repeatedly told me my mistakes of the benchmark, I
re-benchmarked.

Node.jsPython2Python3JuliaRuby9.6293.0823.941.4619.44

- loop number of Python was 10 times smaller than other languages
- repeatedly optimized Ruby implementation
- changed loop size from 100 to 10

repeatedly also benchmarked in dlang, I will do it after updating El
Capitan :)
http://repeatedly.github.io/ja/2015/10/tinysegmenter-benchmark-and-d/


On Thu, Oct 22, 2015 at 6:28 AM Pontus Stenetorp 
wrote:

> On 21 October 2015 at 17:49, Stefan Karpinski 
> wrote:
> >
> > That's an excellent performance comparison case study! Nice work, Chezou
> and nice blog post (the Google translation is pretty readable).
>
> Very readable indeed and I am always happy to see more NLP code in
> Julia!  Keep up the good work!
>
> Pontus
>

[julia-users] Re: TinySegmenter benchmark

[Michiaki Ariga]

Thanks for Steven's great help, I learned many things to optimize string 
operation of Julia.

Finally, I wrote this episode on my blog (in Japanese only, sorry).
http://chezou.hatenablog.com/entry/2015/10/21/234317

-- chezou

2015年10月21日水曜日 2時49分56秒 UTC+9 Steven G. Johnson:
>
> I thought people might be interested in this cross-language benchmark of a 
> realistic application:
>
>  https://github.com/chezou/TinySegmenter.jl/issues/8
>
> TinySegmenter is an algorithm for breaking Japanese text into words, and 
> it has been ported by several authors to different programming languages. 
>  Michiaki Ariga (@chezou) ported it to Julia, and after optimizing it a bit 
> with me he ran some benchmarks comparing the performance to the different 
> TinySegmenter ports.  The resulting times (in seconds) for different 
> languages were:
>
> JavaScriptPython2Python3JuliaRuby121.0492.8529.640012.36(933+)
>
> The algorithm basically consists of looping over the characters in a 
> string, plugging tuples of consecutive characters into a dictionary of 
> "scores", and spitting out a word break when the score exceeds a threshold. 
>   The biggest speedup in optimizing the Julia code came from using tuples 
> of Char (characters) rather than concatenating the chars into strings 
> (which avoids the need to create and then discard lots of temporary strings 
> by exploiting Julia's fast tuples).
>
> The Julia implementation is also different from the others in that it is 
> the only one that operates completely in-place on the text, without 
> allocating large temporary arrays of characters and character categories, 
> and returns SubStrings rather than copies of the words.  This sped things 
> up only slightly, but saves a lot of memory for a large text.
>
> --SGJ
>
> PS. Also, Julia's ability to explicitly type dictionaries caught a bug in 
> the original implementation, where the author had missed the fact that the 
> ｸﾞ character is actually formed by two codepoints in Unicode.
>

Re: [julia-users] Re: Juliabox down?

[Michiaki ARIGA]

Hi, Lars
Are you using Juliabox with over 20 person or more?

Once I held hands on at Julia Tokyo with 30+ participants,
JuliaBox suddenly returns 503.

Now I access JuliaBox and I see same error.

> Failed to load resource: the server responded with a status of 503
(Service Unavailable: Back-end server is at capacity)

I heard JuliaBox is running on Amazon EC2, so I think there are some
limitation for number of concurrent users.

On Wed, Sep 23, 2015 at 11:49 PM Lars Ruthotto 
wrote:

> Sorry! but now it does seems to be down again. Does anyone know why?
>
>
> On Wednesday, September 23, 2015 at 10:15:14 AM UTC-4, Lars Ruthotto wrote:
>>
>> Thanks, Seth. Now it works for me again too. Problem solved :)
>>
>> On Wednesday, September 23, 2015 at 10:13:43 AM UTC-4, Seth wrote:
>>>
>>> Working for me at Wed Sep 23 07:13:36 PDT 2015
>>>
>>> On Wednesday, September 23, 2015 at 7:11:55 AM UTC-7, Lars Ruthotto
>>> wrote:

 Dear all,

 I just noticed that Juliabox doesn't work right now. Is there an
 expected maintenance going on and does anybody know when it will be back?

 Thanks,
 Lars

Re: [julia-users] Re: Juliabox down?

[Michiaki ARIGA]

Hi Lars,

I can see only empty site, and Google Chrome Console shows following error
message.
https://dl.dropboxusercontent.com/u/171669/%E3%82%B9%E3%82%AF%E3%83%AA%E3%83%BC%E3%83%B3%E3%82%B7%E3%83%A7%E3%83%83%E3%83%88%202015-09-24%200.16.26.png

When the same problem occurred, people who connect JuliaBox earlier could
use it normally.
But people who connect later, they couldn't use it because of capacity. So
I published my ipython notebook and told them to study at their home :/

Thanks,
Michiaki


On Thu, Sep 24, 2015 at 12:07 AM Lars Ruthotto <lrutho...@googlemail.com>
wrote:

> Hi Michiaki,
>
> I'm using juliabox only on my machine and there are a few (around 8)
> students in the department here that need to finish some homework. I doubt
> that that should challenge EC2.
>
> for me the website https://juliabox.org/ is completely empty. No error
> message at all. How does it look for you right now?
>
> Thx,
> Lars
>
>
> On Wednesday, September 23, 2015 at 11:02:27 AM UTC-4, Michiaki Ariga
> wrote:
>
>> Hi, Lars
>> Are you using Juliabox with over 20 person or more?
>>
>> Once I held hands on at Julia Tokyo with 30+ participants,
>> JuliaBox suddenly returns 503.
>>
>> Now I access JuliaBox and I see same error.
>>
>> > Failed to load resource: the server responded with a status of 503
>> (Service Unavailable: Back-end server is at capacity)
>>
>> I heard JuliaBox is running on Amazon EC2, so I think there are some
>> limitation for number of concurrent users.
>>
>
>> On Wed, Sep 23, 2015 at 11:49 PM Lars Ruthotto <lrut...@googlemail.com>
>> wrote:
>>
>>> Sorry! but now it does seems to be down again. Does anyone know why?
>>>
>>>
>>> On Wednesday, September 23, 2015 at 10:15:14 AM UTC-4, Lars Ruthotto
>>> wrote:
>>>>
>>>> Thanks, Seth. Now it works for me again too. Problem solved :)
>>>>
>>>> On Wednesday, September 23, 2015 at 10:13:43 AM UTC-4, Seth wrote:
>>>>>
>>>>> Working for me at Wed Sep 23 07:13:36 PDT 2015
>>>>>
>>>>> On Wednesday, September 23, 2015 at 7:11:55 AM UTC-7, Lars Ruthotto
>>>>> wrote:
>>>>>>
>>>>>> Dear all,
>>>>>>
>>>>>> I just noticed that Juliabox doesn't work right now. Is there an
>>>>>> expected maintenance going on and does anybody know when it will be back?
>>>>>>
>>>>>> Thanks,
>>>>>> Lars
>>>>>>
>>>>>>

Re: [julia-users] Re: How can I sort Dict efficiently?

[Michiaki ARIGA]

Thanks for Pontus's kind explanation. He answered what I want to know.
I want to know the standard way to create dictionary (which is a set of
words for ASR or NLP).

To create dictionary for speech recognition or something NLP, we often
control size of vocabulary. There are two ways to limit size of vocabulary,
one is to cut under threshold frequency that Pontus showed, and the other
is to pick up top N frequent words (ngram tool kit such as IRSTLM supports
this situation and it is popular way to control necessary memory size). If
I want to pick frequent words, I think I'll use DataFrame.

On Tue Dec 16 2014 at 15:31:00 Todd Leo sliznmail...@gmail.com wrote:

 Could you provide any clue to guide me locate the issue? I'm willing to
 make a PR but I am unable to find the related issue.


 On Tuesday, December 16, 2014 3:38:11 AM UTC+8, Stefan Karpinski wrote:

 There is not, but if I recall, there may be an open issue about this
 functionality.


 On Sun, Dec 14, 2014 at 10:15 PM, Todd Leo sliznm...@gmail.com wrote:

 Is there a partial sort equivalent to sortperm! ? Supposingly
 selectperm! ?

 On Monday, December 8, 2014 8:21:33 PM UTC+8, Stefan Karpinski wrote:

 We have a select function as part of Base, which can do O(n) selection
 of the top n:

 julia v = randn(10^7);

 julia let w = copy(v); @time sort!(w)[1:1000]; end;
 elapsed time: 0.882989281 seconds (8168 bytes allocated)

 julia let w = copy(v); @time select!(w,1:1000); end;
 elapsed time: 0.054981192 seconds (8192 bytes allocated)


 So for large arrays, this is substantially faster.

 On Mon, Dec 8, 2014 at 3:50 AM, Jeff Waller trut...@gmail.com wrote:

 This can be done in O(N).  Avoid sorting as it will be O(NlogN)

 Here's one of many Q on how http://stackoverflow.com/q
 uestions/7272534/finding-the-first-n-largest-elements-in-an-array

Re: [julia-users] Re: How can I sort Dict efficiently?

[Michiaki ARIGA]

Thanks for your answer, John.
I'll use PriorityQueue to get top N words, and if I want to cut off using
threshold I'll create a dictionary with Dict.

---
Michiaki

On Tue Dec 16 2014 at 22:53:34 John Myles White johnmyleswh...@gmail.com
wrote:

 If you want to retain N words, perhaps a priority queue would be useful?

 http://julia.readthedocs.org/en/latest/stdlib/collections/#priorityqueue

 I'd be cautious about drawing many coding lessons from the TextAnalysis
 package, which has been never been optimized for performance.

  -- John

 On Dec 16, 2014, at 3:30 AM, Michiaki ARIGA che...@gmail.com wrote:

 Thanks for Pontus's kind explanation. He answered what I want to know.
 I want to know the standard way to create dictionary (which is a set of
 words for ASR or NLP).

 To create dictionary for speech recognition or something NLP, we often
 control size of vocabulary. There are two ways to limit size of vocabulary,
 one is to cut under threshold frequency that Pontus showed, and the other
 is to pick up top N frequent words (ngram tool kit such as IRSTLM supports
 this situation and it is popular way to control necessary memory size). If
 I want to pick frequent words, I think I'll use DataFrame.

 On Tue Dec 16 2014 at 15:31:00 Todd Leo sliznmail...@gmail.com wrote:

 Could you provide any clue to guide me locate the issue? I'm willing to
 make a PR but I am unable to find the related issue.


 On Tuesday, December 16, 2014 3:38:11 AM UTC+8, Stefan Karpinski wrote:

 There is not, but if I recall, there may be an open issue about this
 functionality.


 On Sun, Dec 14, 2014 at 10:15 PM, Todd Leo sliznm...@gmail.com wrote:

 Is there a partial sort equivalent to sortperm! ? Supposingly
 selectperm! ?

 On Monday, December 8, 2014 8:21:33 PM UTC+8, Stefan Karpinski wrote:

 We have a select function as part of Base, which can do O(n) selection
 of the top n:

 julia v = randn(10^7);

 julia let w = copy(v); @time sort!(w)[1:1000]; end;
 elapsed time: 0.882989281 seconds (8168 bytes allocated)

 julia let w = copy(v); @time select!(w,1:1000); end;
 elapsed time: 0.054981192 seconds (8192 bytes allocated)


 So for large arrays, this is substantially faster.

 On Mon, Dec 8, 2014 at 3:50 AM, Jeff Waller trut...@gmail.com wrote:

 This can be done in O(N).  Avoid sorting as it will be O(NlogN)

 Here's one of many Q on how http://stackoverflow.com/q
 uestions/7272534/finding-the-first-n-largest-elements-in-an-array

Re: [julia-users] Re: How can I sort Dict efficiently?

[Michiaki ARIGA]

Of course Julia can work fast with Array, I know.
But in natural language processing or text analyzing, we often count word
frequency and create dictionary. We usually store word frequency in kind-a
Dict and we always cut off non-frequent words (its frequency are under
threshold) to exclude noisy words. So I want remove keys which values
follow some condition.

Finally, I found John Myles White's implementation creating n-gram. So, I
will refer this.

https://github.com/johnmyleswhite/TextAnalysis.jl/blob/master/src/ngramizer.jl

Re: [julia-users] Re: How can I sort Dict efficiently?

[Michiaki ARIGA]

I'm sorry that my example is not good to explain what I want to do.

I tried to count up words and get top N frequent words and I referred to
following example.

https://github.com/JuliaLang/julia/blob/master/examples/wordcount.jl

I don't think it should return Dict for top N words, so I think DataFrame
is good to get top N words using head(). But I wonder if DataFrame isn't
suitable because DataFrame converted from Dict is not sortable style using
its values of Dict.

On Sat Dec 06 2014 at 11:24:02 Steven G. Johnson stevenj@gmail.com
wrote:



 On Friday, December 5, 2014 9:57:28 AM UTC-5, Michiaki Ariga wrote:

 I found there are no method such as sort_by() after v0.3.
 But I want to count word frequency with Dict() and sort by its value to
 find frequent word.
 So, how can I sort Dict efficiently?


  You may want to use a different data structure.  For example, you can
 store word frequencies in a PriorityQueue and then pull out the most
 frequent word with peek or dequeue.  See:

 http://julia.readthedocs.org/en/latest/stdlib/collections/

 (A PriorityQueue lets you quickly fetch the smallest value, whereas you
 want the largest frequency, but you can work around this by just storing
 frequency * -1.)

 If you need all of the values in order, you can instead use an OrderedDict
 from https://github.com/JuliaLang/DataStructures.jl

[julia-users] How can I sort Dict efficiently?

[Michiaki Ariga]

Hi,
I have a question about Dict().

I found there are no method such as sort_by() after v0.3.
But I want to count word frequency with Dict() and sort by its value to 
find frequent word.
So, how can I sort Dict efficiently?

Of course, I know sort using DataFrame like following,

```
counts = Dict{String, Int64}(apple = 100, town = 250, space = 24)
df = DataFrame(word = collect(keys(counts)), count = 
collect(values(counts)))
sort(df, cols = [:count], rev = true)
```

I think it is natural `convert(DataFrame, dict)` returns Nx2 DataFrame 
instead of 1xN one.

Thanks,

---
Michiaki Ariga
https://github.com/chezou

Re: [julia-users] How can I bind C code including cross dependent structs

[Michiaki ARIGA]

Thank you for your answer. I'll try it!

On Mon Nov 24 2014 at 3:37:31 Erik Schnetter schnet...@cct.lsu.edu wrote:

 One easy solution is to use `Ptr{Void}` in the structure definition,
 which you then need to convert before accessing the structure.

 -erik

 On Sun, Nov 23, 2014 at 10:51 AM, Michiaki Ariga che...@gmail.com wrote:
  Hi all,
 
  I troubled with binding C code to Julia.
  C code witch I want to bind have cross dependent structs like following,
 
  ```
  struct node {
struct node *next;
struct path *path;
...
  }
 
  struct path {
struct node *rnode;
struct path *lnext;
...
  }
  ```
 
  I know we can bind if I implement type like C structure, but in this case
  Julia doesn't know
  2 structures depends on each other because one struct doesn't know other
  struct when first struct is defined.
 
  How can I bind such structs?
 
  ---
  Michiaki Ariga
 
 



 --
 Erik Schnetter schnet...@cct.lsu.edu
 http://www.perimeterinstitute.ca/personal/eschnetter/

[julia-users] How can I bind C code including cross dependent structs

[Michiaki Ariga]

Hi all,

I troubled with binding C code to Julia.
C code witch I want to bind have cross dependent structs like following,

```
struct node {
  struct node *next;
  struct path *path;
  ...
}

struct path {
  struct node *rnode;
  struct path *lnext;
  ...
}
```

I know we can bind if I implement type like C structure, but in this case 
Julia doesn't know 
2 structures depends on each other because one struct doesn't know other 
struct when first struct is defined.

How can I bind such structs?

---
Michiaki Ariga

[julia-users] ANN: ConfidenceWeighted.jl

[Michiaki Ariga]

Hi all,

I implement ConfidenceWeighted.jl
https://github.com/chezou/ConfidenceWeighted.jl

Confidence weighted is one of online machine learning algorithm.

Actually, the package is porting from Python implementation 
(https://github.com/echizentm/ConfidenceWeighted),
and only implemented soft confidence weighted now.

I know I have to optimize for Julia (e.g. not using Dict), so please send 
pull request to me!

-- Michiaki Ariga a.k.a chezou

[julia-users] ANN: MeCab.jl - Julia binding of most popular Japanese morphological analyzer

[Michiaki Ariga]

Hi, all.

I've released first version of MeCab.jl, Julia binding of MeCab.

MeCab is the most popular Japanese morphological analyzer.

https://github.com/chezou/MeCab.jl


Enjoy!

-- Michiaki

Re: [julia-users] Re: 100 Julia exercises

[Michiaki ARIGA]

Thank you for your correction, Jim.

In Apprentice.2, same approach with numpy version, I fixed as following.

```
Z = rand(100,2)
X, Y = Z[:,1], Z[:,2]
R = sqrt(X.^2 + Y.^2)
T = atan2(Y,X)
```

Also in Apprentice. 7, I fixed . position.

I understand Julia works well without anonymous function, so when should I
use array comprehension?
Do I have to make function to use array comprehension?

Many people advised to use array comprehension in this thread, but I don't
understand when to use it...



che...@gmail.com


2014-07-06 10:58 GMT+09:00 Michael Prentiss mcprent...@gmail.com:

 Julia is not as performant with anonymous functions, and list
 comprehension.
 The compiler has a harder time with the optimization step.  This is not a
 surprise and is
 known to the language designers.  This is not a surprise.


 On Saturday, July 5, 2014 8:01:46 PM UTC-5, james.dill...@gmail.com wrote:


 In Apprentice.6,  I don't think you want to use the sqrtm().  sqrt() is
 already vectorized over the matrix.  Also a couple of '.'s are misplaced,
 so perhaps instead:

 Z =rand(10,2)

 D = sqrt((Z[:,1].-Z[:,1]').^2+(Z[:,2].-Z[:,2]').^2)

 As a newbie myself, what surprised me is that this is faster and
 allocates less memory than the comprehension:

 D =  [norm(Z[i,:]-Z[j,:],2) for i = 1:10, j = 1:10]

 I am sure someone else here can explain why.

 Jim
 On Sunday, June 22, 2014 10:43:32 AM UTC-4, Michiaki Ariga wrote:

 Hi all,

 I'm a Julia newbee, and I'm trying to learn Julia and wrote Julia
 version of rougier's 100 numpy exercises(http://www.loria.fr/
 ~rougier/teaching/numpy.100/index.html).

 https://github.com/chezou/julia-100-exercises

 I'd like you to tell me more julia way or something wrong with.

 Best regards,
 Michiaki

[julia-users] Re: 100 Julia exercises

[Michiaki Ariga]

I solved Expert 4 by Alireza's approach like following. (I don't understand 
how to use TensorOperations.jl in this case)
Thanks for Alireza!

```
p, n = 10, 20
M = ones(n,n,p)
V = ones(n,p)
S = reduce(+, [M[i,:,j]*V[i] for i = 1:n, j = 1:p])'
S
```

2014年6月27日金曜日 5時59分15秒 UTC+9 Steven G. Johnson:



 On Thursday, June 26, 2014 9:54:34 AM UTC-4, Michiaki Ariga wrote:

 In original numpy version as following, matrix and vector are 3dimension 
 arrays.
 Is there any way to compute tensordot like numpy?


 There is no built-in tensor contraction function at the moment (
 https://github.com/JuliaLang/julia/issues/3250), but you can try out the 
 TensorOperations package:

  https://github.com/Jutho/TensorOperations.jl

 You can also just write your own loop and the performance should be fine; 
 it's pretty easy to do this if you know the dimensionality in advance, and 
 it's only complicated to write tensor contraction code if you want to 
 handle arbitrary dimensionality and arbitrary contraction index sets.  (It 
 takes a while to get used to the fact that you don't need to call a library 
 function for every inner loop in Julia.)

[julia-users] Re: 100 Julia exercises

[Michiaki Ariga]

In original numpy version as following, matrix and vector are 3dimension 
arrays.
Is there any way to compute tensordot like numpy?

p, n = 10, 20M = np.ones((p,n,n))V = np.ones((p,n,1))S = np.tensordot(M, V, 
axes=[[0, 2], [0, 1]])print S# returns #[[ 15.]# [ 15.]# [ 15.]# [ 15.]# [ 15.]]


2014年6月24日火曜日 7時08分08秒 UTC+9 Alireza Nejati:

 Actually, a slight modification. The way I wrote it, it will compute the 
 product of all matrices with all vectors (pxp mults), which is not what you 
 want. You just want each matrix to multiply its respective vector (p 
 mults). The solution to that is:

 p = length(matlist)
 reduce(+, [matlist[i]*veclist[i] for i = 1:p])

 On Monday, June 23, 2014 2:43:32 AM UTC+12, Michiaki Ariga wrote:

 Hi all,

 I'm a Julia newbee, and I'm trying to learn Julia and wrote Julia version 
 of rougier's 100 numpy exercises(
 http://www.loria.fr/~rougier/teaching/numpy.100/index.html).

 https://github.com/chezou/julia-100-exercises

 I'd like you to tell me more julia way or something wrong with.

 Best regards,
 Michiaki

[julia-users] Re: 100 Julia exercises

[Michiaki Ariga]

Thank you for your kind replies.

I noticed that I'm not familiar with array comprehension style in Julia.
I added your solutions to my repos.
(If you have any problem to do it, please tell me)

As Alireza said, this is just a translation from numpy, but I believe there 
are good questions suitable for Julia.
Why don't you propose more Julia like exercises using pull request!
(Especially, I think harven's Generators exercise is good for example.)

I have a question.

Alireza told me solution for Expert.4 as following.

 Another thing is that more functional-type coding is also emphasized in 
julia. Here's a solution for Expert.4 (which I notice you've left empty):
 reduce(+, [A*x for A in matlist, x in veclist])

It seems to return scalar value 80, but original numpy version's result 
is as following 20x1 vector.
How can I reduce keeping array?

```
[[ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]
 [ 200.]]
```


2014年6月22日日曜日 23時43分32秒 UTC+9 Michiaki Ariga:

 Hi all,

 I'm a Julia newbee, and I'm trying to learn Julia and wrote Julia version 
 of rougier's 100 numpy exercises(
 http://www.loria.fr/~rougier/teaching/numpy.100/index.html).

 https://github.com/chezou/julia-100-exercises

 I'd like you to tell me more julia way or something wrong with.

 Best regards,
 Michiaki

[julia-users] 100 Julia exercises

[Michiaki Ariga]

Hi all,

I'm a Julia newbee, and I'm trying to learn Julia and wrote Julia version 
of rougier's 100 numpy 
exercises(http://www.loria.fr/~rougier/teaching/numpy.100/index.html).

https://github.com/chezou/julia-100-exercises

I'd like you to tell me more julia way or something wrong with.

Best regards,
Michiaki