On Tue, Jul 24, 2012 at 3:59 PM, Dan Bron j...@bron.us wrote:
Raul wrote:
This kind of reasoning -- that a language primitive should
not be treated as having utility explicitly stated in the
documentation of that primitive, and obviously present in
the implementations -- does not make
On Thu, Jul 26, 2012 at 7:43 PM, Dan Bron j...@bron.us wrote:
In a draft, I had originally written Meaning its definition is irrelevant.
I think that sums it up.
Change definition to imperative definition and that seems reasonable.
Mostly we think of using J verbs using their imperative tense.
On Fri, Jul 27, 2012 at 6:20 PM, Dan Bron j...@bron.us wrote:
Raul wrote:
Anyways, the definition which is relevant when cap is the left tine of
a fork is a passive definition, and not an imperative definition. And
making this distinction -- that it's being used passively -- seems
On Sun, Jul 29, 2012 at 11:59 PM, Ian Shannon
ian.shan...@environment.nsw.gov.au wrote:
There is another solution.
It's often helpful, in this kind of statement, if you say what is being solved.
Make your noun into a verb as in:
...
Here's one approach for making a noun into a verb:
noun_
On Tue, Aug 14, 2012 at 2:35 PM, Ian Clark earthspo...@gmail.com wrote:
Maybe the IBM 1130 card-sorting program was no cleverer than this (I
never used it that much), but I have a strong feeling it's possible to
do much better.
If the machine has enough memory to store a complete
As near as I can tell, readxlsheets should be defined in tara's jbiffread.ijs
--
Raul
On Tue, Aug 14, 2012 at 5:51 PM, Bill Harris
bill_har...@facilitatedsystems.com wrote:
I'm buffaloed by a seemingly related problem I just encountered.
I have a program I wrote about 3 years ago (and have
In case no one has posted this already, to get both the monadic and
dyadic definitions of a hook (f g), you use: ([ f g@])
--
Raul
On Sun, Aug 19, 2012 at 2:16 PM, Henry Rich henryhr...@nc.rr.com wrote:
([ f g) y = (f g) y
Yes.
But not for the dyadic case:
x ([ f g) y = x f x g y
but
On Thu, Aug 23, 2012 at 5:07 AM, Skip Cave s...@caveconsulting.com wrote:
I would like to generate a vector sequence of numbers starting from s and
going to e, with increment i
...
what would the tacit form of the sequence verb look like, if we defined the
dyadic verb seq thus:
(s,e) seq i
On Thu, Aug 23, 2012 at 12:34 PM, Skip Cave s...@caveconsulting.com wrote:
What I was trying to do was emulate a standard sequence function in Octave
which has the following syntax:
e:i:s
ans = 5.0 5.25000 5.5 5.75000 6.0 6.25000 6.5 6.75000
7.0 7.25000 7.5 7.75000
On Fri, Aug 24, 2012 at 11:17 AM, Jose Mario Quintana
jose.mario.quint...@gmail.com wrote:
to=. [ + i.@::@:.@-~
5 to 8
5 6 7 8
...
inc=. (%) (('.'`)(`:6))
5 to (0.25 inc) 8
5 5.25 5.5 5.75 6 6.25 6.5 6.75 7 7.25 7.5 7.75 8
I like your argument patterns.
But I am uncomfortable
/021172.html
On Fri, Aug 24, 2012 at 11:46 AM, Raul Miller rauldmil...@gmail.com wrote:
On Fri, Aug 24, 2012 at 11:17 AM, Jose Mario Quintana
jose.mario.quint...@gmail.com wrote:
to=. [ + i.@::@:.@-~
5 to 8
5 6 7 8
...
inc=. (%) (('.'`)(`:6))
5 to (0.25 inc) 8
5 5.25 5.5 5.75 6
On Mon, Aug 27, 2012 at 9:29 PM, bob therriault bobtherria...@mac.com wrote:
Raul, you should put that up on the contest site.
If anyone wants to post any of these up on the contest, site, feel free.
I'm not going to bother, though, myself. This is an interesting
exercise, taken by itself, but
Here's another couple characters shaved off:
1j1#1|:(25{.(u:,2#65 97+/i.26)(:@i.}.[)])0
--
Raul
--
For information about J forums see http://www.jsoftware.com/forums.htm
On Tue, Aug 28, 2012 at 2:56 PM, bob therriault bobtherria...@mac.com wrote:
I'd would say that the specs suggest that the period is added so that the
case of '.a' wouldn't come up as the only two letter arguments allowable end
in a period. Subject to interpretation, I'd call it a feature :)
And, I think this is one more character shaved off (45 here):
1j1#1|:(25{.]}.~1+i.~)(u:,2#65 97+/i.26)0
--
Raul
--
For information about J forums see http://www.jsoftware.com/forums.htm
One interesting issue, here, is that the concise expression in J is
not because J was specifically optimized for this task, but because J
has so many expressions which can be used for this task.
But some people had expressed confusion, about how to read one of my drafts:
On Wed, Aug 29, 2012 at 4:04 AM, Linda Alvord lindaalv...@verizon.net wrote:
My question is from an earlier version:
1j1#1|:(25{.(u:,2#65 97+/i.26)(:@i.}.[)])0 'L'
M N O P Q R S T U V W X Y Z A B C D E F G H I J K
In this phrase, what does the identity [ stand for?
:@i.}.[
First
$: refers to the largest containing verb in the current sentence. Explicit
definitions contain sentences.
--
Raul
On Tuesday, September 4, 2012, Ian Clark earthspo...@gmail.com wrote:
Let's define a verb: max which can be used either dyadically:
5 max 7
7
or monadically:
max 5 7
On Thu, Sep 6, 2012 at 11:00 AM, Ian Clark earthspo...@gmail.com wrote:
Say I want to release an addon called: misc/zulu. It has a choice of
modes to load it in.
Why?
The require mechanism assumes that once something is loaded that it
does not have to be loaded again.
It seems to me that
On Thu, Sep 6, 2012 at 3:39 PM, Ian Clark earthspo...@gmail.com wrote:
Re-reading this thread I think my terse reply could be taken for curt.
I apologise if this has given offence.
No offense taken.
Disorientation on the other hand? I have been taking some of that...
1. Is there a
I prefer
;:inv z
But note that
deb,' ',.z
would work. (J6 users need require'strings' before this can work.)
FYI,
--
Raul
On Thu, Sep 6, 2012 at 6:21 PM, Ian Clark earthspo...@gmail.com wrote:
Yes, but we need a string.
You can ravel the 2D array to get a string, viz:
, z
but
bpv '1';'2';'3'
'3
--
Raul
On Thu, Sep 6, 2012 at 6:32 PM, Ian Clark earthspo...@gmail.com wrote:
Here's a really perverse solution ...
bpv=: 3 : '}:8}.5!:5''y'''
bpv z
alpha bravo charlie
I've played with Roger's suggestion: }: ; z,. ' '
to get:
rrb=:[: }.@; SP ,. ]
solutions involving deb aren't general enough, esp for b2f, where
the boxed strings may validly contain multiple spaces.
On Thu, Sep 6, 2012 at 11:32 PM, Raul Miller rauldmil...@gmail.com wrote:
I prefer
;:inv z
But note that
deb,' ',.z
would work. (J6 users need require'strings' before
I don't know?
From your question, I am imagining you were expecting one of these
results to be different. But without knowing which sentence you were
expecting to be different, and what you were expecting, it's hard to
know for sure.
That said, if you expected your second sentence's result to
to
get and solve the equation for the 2nd column but I need strategy for other
columns in a automatic way (i.e. in loop or without loop)
Raul Miller-4 wrote:
What does the text look like?
--
Raul
--
For information about J
the strategy
Raul Miller-4 wrote:
limit error typically means you are doing something different from
what you think you are doing. Here's an example:
i.1+i.1+i.9
|limit error
I would probably start by examining the values used in the expression
which is getting this error
Here are your 50 paths:
paths=: ('/home/user/file', :, '.pgm'[). 1+i.50
If you have a verb which reads one file and processes it, and returns
that result, you might use either:
averb each paths
or
averb0 paths
The first version gives your verb an unboxed file name, the second
version
multiple levels of sub-totals, requiring a
loop, , or perhaps a recusrsive form.
Your point on reserved words is well taken.
Robert
On Mon, Sep 10, 2012 at 4:06 PM, Raul Miller rauldmil...@gmail.com wrote:
gt=: ([#_:), +/@:(}.1)
M=: mt,gt
--
Raul
P.S. I do not like using
On Tue, Sep 11, 2012 at 12:50 PM, pascha amirpasha...@gmail.com wrote:
Thanks.. row_number works
But now the problem is I want the verb to iterate over one array at a time.
for example if I do proccess0(1+i.2) the resultant input is:
/home/user/input/filename1.pgm
to advance to the next argument - you
would effectively have parallel processing going on.
On Tue, Sep 11, 2012 at 1:24 PM, Raul Miller rauldmil...@gmail.com wrote:
On Tue, Sep 11, 2012 at 12:50 PM, pascha amirpasha...@gmail.com wrote:
Thanks.. row_number works
But now the problem is I want
Tree structures -- especially binary tree structures -- are frequently
a bad choice in J.
Personally, if I were working with spatial data in J, I'd probably
start with something like this:
NB. example arbitrary set of points:
points=: ?.20 3$0
prepad=: $__@,~@{:@$, ], $_@,~@{:@$
searchable=:
for taking the time!
-Scott
Raul Miller-4 wrote:
Tree structures -- especially binary tree structures -- are frequently
a bad choice in J.
Personally, if I were working with spatial data in J, I'd probably
start with something like this:
NB. example arbitrary set of points:
points=: ?.20
On Mon, Sep 17, 2012 at 10:16 PM, Ian Clark earthspo...@gmail.com wrote:
Format is a pre-existing addon category. It plays host to Henry's
printf utility, and seems the obvious place for zulu. But my lab just
happens to be the first released in that category. No, the name
doesn't give any
P.S. if you want to overtake (instead of length error when the right
arg does not contain enough elements):
takecut=: [ (*@[ #inv ] /.~ +/\@[ I. #\@]) (+/@[ {. ])
--
Raul
On Tue, Sep 18, 2012 at 10:08 AM, Raul Miller rauldmil...@gmail.com wrote:
On Mon, Sep 17, 2012 at 11:14 PM, June Kim
The big risk from PREPARE is the risk that the learner will not be
able to reproduce their results outside of the lab, making the lab
somewhat useless.
I can see PREPARE being useful if it's enabling a UI that the lab
exploits. However, I think that the use of PREPARE to do things that
make the
1 I.#\@(i.7))(+/@2 3 1 1{.i.7)
Linda
-Original Message-
From: programming-boun...@forums.jsoftware.com
[mailto:programming-boun...@forums.jsoftware.com] On Behalf Of Raul Miller
Sent: Tuesday, September 18, 2012 10:12 AM
To: programm...@jsoftware.com
Subject: Re: [Jprogramming
Here are some options (I'm repeating concepts expressed by Roger Hui
and Devon McCormick:
L=: 1,''
''$ L
{. L
0 { L
,/ L
Roger's suggestion is equivalent to the APL classic in this context,
but in the general case you would need to ravel the right argument if
L had a rank greater
-boun...@forums.jsoftware.com] On Behalf Of Raul
Miller
Sent: Thursday, October 04, 2012 11:34 AM
To: programm...@jsoftware.com
Subject: Re: [Jprogramming] Why the length error?
Here are some options (I'm repeating concepts expressed by Roger Hui
and Devon McCormick:
L=: 1,''
''$ L
In the sentence:
+/.:% resistances
the phrase +/.:% is a verb which finds parallel resistance.
--
Raul
On Thu, Oct 4, 2012 at 9:19 PM, Keith Park wkrp...@gmail.com wrote:
To parallel a number of resistors the expression * %+/% *does the job.
How could one make an equivalent verb?
On
growing is a gerund.
--
Raul
On Fri, Oct 5, 2012 at 2:56 AM, Linda Alvord lindaalv...@verizon.net wrote:
The concept of using adverbs makes sense, and they are handy. I can't say as
much for gerunds. I move around a lot growing up and I missed parts of speech
and had double doses of many
On Tue, Oct 9, 2012 at 7:04 PM, Jose Mario Quintana
jose.mario.quint...@gmail.com wrote:
remember your implementation is based on gerunds. The gerundial (or
atomic) representation seems to be the natural J way to encode verbs
into nouns; however, in my experience, it often leads to space and
A few random comments:
1. When dealing with criticisms a good conversation to have is about
priorities, with the goal of having you understand not only why a
criticism is important but understanding how important that is
(compared to other issues that you are currently facing).
2. I do not have
Given your description, I would have expected a result like this:
0 1 2 0 1 1 2 0
0 1 2 0 1 1 2 0
2 0 1 2 0 0 1 2
1 2 0 1 2 2 0 1
1 2 0 1 2 2 0 1
I do not understand the result you proposed.
Also, you have not specified what happens for rows where the leading
column of A has a value which does
or all not matching rows are deleted.
R.E. Boss
-Oorspronkelijk bericht-
Van: programming-boun...@forums.jsoftware.com
[mailto:programming-boun...@forums.jsoftware.com] Namens Raul Miller
Verzonden: maandag 15 oktober 2012 18:24
Aan: programm...@jsoftware.com
Onderwerp: Re
Since underscores are special in markdown, maybe they need to be
prefixed with a backslash?
--
Raul
On Fri, Oct 19, 2012 at 2:55 PM, Devon McCormick devon...@gmail.com wrote:
Yes - the advice is a little garbled. It looks like it's supposed to
read like this:
load 'graphics/d3'
d3heatmap
: mailto:programming-boun...@forums.jsoftware.com
programming-boun...@forums.jsoftware.com
[ mailto:programming-boun...@forums.jsoftware.com
mailto:programming-boun...@forums.jsoftware.com] On Behalf Of Raul
Miller
Sent: Friday, October 19, 2012 9:30 AM
To: mailto:programm...@jsoftware.com
in the context of (... |.)
(particularly in the case of f ).
-Dan
Please excuse typos; composed on a handheld device.
On Oct 20, 2012, at 12:19 PM, Raul Miller rauldmil...@gmail.com wrote:
If you actually wanted to only be using monadic definitions for f and
g, these would be equivalent definitions
for help on stack overflow.
--
Raul
On Tue, Oct 23, 2012 at 7:06 AM, Ric Sherlock tikk...@gmail.com wrote:
On Mon, Oct 22, 2012 at 5:50 AM, Raul Miller rauldmil...@gmail.com wrote:
Also, I was noticing that we do not have any editor support for
recognizing or moving between matching parenthesis
On Tue, Oct 23, 2012 at 9:57 AM, Linda Alvord lindaalv...@verizon.net wrote:
What I am trying to do is sort out a sequence for developing concepts in
mathematics education. A starting point is Easy J. Also. I favor explicit
definitions using 13 : as they clearly indicate the placement of
...@forums.jsoftware.com] On Behalf Of Raul Miller
Sent: Tuesday, October 23, 2012 11:37 AM
To: programming@jsoftware.cosem
Subject: [Jprogramming] J and education (was: stitching matrices)
On Tue, Oct 23, 2012 at 9:57 AM, Linda Alvord lindaalv...@verizon.net
wrote:
What I am trying to do is sort out
and produce the correct result that i does.
o=:
[: ; ([: ([:={: |.)1 # (, }.)1)1 _
-Original Message-
From: programming-boun...@forums.jsoftware.com
[mailto:programming-boun...@forums.jsoftware.com] On Behalf Of Raul
Miller
Sent: Saturday, October 20, 2012 12:19 PM
To: programm
that i does.
o=:
[: ; ([: ([:={: |.)1 # (, }.)1)1 _
-Original Message-
From: programming-boun...@forums.jsoftware.com
[mailto:programming-boun...@forums.jsoftware.com] On Behalf Of Raul
Miller
Sent: Saturday, October 20, 2012 12:19 PM
To: programm...@jsoftware.com
Subject
Ok... I'd do something like this:
NB. stand-ins -- please replace definitions
isLabel=: 'LA' e.~ {.
isFirst=: 'Attribute1' -: -.' '
processBatch=:
processItem=:
NB. utility
bitshift=: |.!.0
((1 bitshift isFirst) processBatch@:(processItem/.~ [: +/\
isLabel );.1 ]) ;._2 d1
Note that this
Also, borrowed from http://rosettacode.org/wiki/Hailstone_sequence#J
hailseq=: -:`(1 3p.)@.(2|) ^:(1 ~: ]) ^:a:0
Examples:
hailseq 4
4 2 1
hailseq 5
5 16 8 4 2 1
This is similar to the collatz^:a: mentioned in the wiki page.
--
Raul
On Thu, Oct 25, 2012 at 5:44 AM, Brian Schott
...@forums.jsoftware.com
[mailto:programming-boun...@forums.jsoftware.com] On Behalf Of Raul Miller
Sent: Wednesday, October 24, 2012 3:23 PM
To: programm...@jsoftware.com
Subject: Re: [Jprogramming] stitching matrices
On Wed, Oct 24, 2012 at 3:27 AM, Linda Alvord lindaalv...@verizon.net wrote
I suspect you want something like this:
^ t. i. 5
1 1 0.5 0.17 0.0416667
--
Raul
On Fri, Oct 26, 2012 at 5:19 PM, rlvaug...@comcast.net wrote:
I cannot get the dyadic verb u t. to work as described in the Vocabulary:
x u t.y is the product of (x^y) and u t. y
For example:
^t.
On Sat, Oct 27, 2012 at 6:09 PM, Richard Vaughan rlvaug...@comcast.net wrote:
I just used a single coefficient as an example. It was the dyadic case
(i.e. evaluated at x) that puzzled me; it didn't seem to be working as
advertised.
Oh, yes... you are correct.
It's pretty easy to see that the
precision.
---
(B=)
On Oct 29, 2012, at 9:32 AM, Raul Miller rauldmil...@gmail.com wrote:
In this case, it's doing this:
^ t.
%@!
the dictionary definition suggests that we should instead be getting
something like this:
%@! :(^ * %@!@])0
I'm not sure, though, what good that extra
Or,
[: #;._1 ' ',]
--
Raul
On Wednesday, October 31, 2012, Linda Alvord lindaalv...@verizon.net
wrote:
Here's where I was heading:
f=: 13 :'#;._2 '' '',~ y'
f
[: #;._2 ' ' ,~ ]
f 'blåbærgrød crème fraise '
13 1 6 6 0 0 0
g=: 13 :'#;._2 '' '',~ 7 u: y'
g
[: #;._2 '
On Fri, Nov 2, 2012 at 5:18 AM, Linda Alvord lindaalv...@verizon.net wrote:
Raul, I haven't gotten to t. yet, but I did manage not to use (f*g) or p.
f=: 1 2 1p.
g=: 1 3 3 1p.
x=: 10%~i=: i.8
]c=: (f*g) t. iNB. This still has problems
1 5 10 10 5 1 0 0
What problems?
-boun...@forums.jsoftware.com
[mailto:programming-boun...@forums.jsoftware.com] On Behalf Of Raul Miller
Sent: Friday, November 02, 2012 10:46 AM
To: programm...@jsoftware.com
Subject: Re: [Jprogramming] Taylor series
On Fri, Nov 2, 2012 at 5:18 AM, Linda Alvord lindaalv...@verizon.net
wrote
length errors catch so
many problems they have been incorporated in the language.
How do you know this? If there is a citation to a paper backing this up
that'd be good.
On Sat, Nov 3, 2012 at 7:30 AM, Raul Miller rauldmil...@gmail.com wrote:
Brian Schott already answered your
In addition to being relevant to explanations of strong normalizatio,
3 :'y`:6 y' 3 :'y`:6 y'`''
crashes my current implementation of J7 and jbreak does not work on it in
J6.
FYI,
--
Raul
--
For information about J forums
: Saturday, November 03, 2012 9:15 PM
To: J-programming forum
Subject: Re: [Jprogramming] 3 :'y`:6 y' 3 :'y`:6 y'`''
I just get a stack error from this on my version of J7:
Engine: j701/2011-01-10/11:25
Library: 7.01.074
Platform: Win 64
On Sat, Nov 3, 2012 at 4:03 PM, Raul Miller rauldmil
.
1 t. i.6
|length error
| 1 t.i.6
^t.
%@!
t.
t.
Linda
-Original Message-
From: programming-boun...@jsoftware.com
[mailto:programming-boun...@jsoftware.com] On Behalf Of Raul Miller
Sent: Monday, April 04, 2011 11:31 AM
To: Programming forum
Cc: Zsbán Ambrus
In
A=. 0= ? (2$n)$2 NB. generate random matrix of [0,1]
The 0= is unnecessary, and probably reflects a habit based on the
false idea that boolean algebra is does not have an integer domain.
Boolean rings have (subset of) integer domains, and [even after
redefinition] boolean algebra is a
, Nov 4, 2012 at 1:40 PM, Raul Miller rauldmil...@gmail.com wrote:
On Sun, Nov 4, 2012 at 12:53 PM, Mike Day mike_liz@tiscali.co.uk wrote:
I think Raul has overlooked your use of the right argument ys within that
verb, ...
You are right, I had not even tried to read 'revise'.
Looking
In revise, you are using a pair for your right argument.
It looks to me like this might be unnecessary -- that you could use
ys=. I.+./1 D
But this does not exactly reproduce your algorithm. So if this change
breaks your algorithm, could you find an example situation which
illustrates this
with code as good as
this when I started J - would be pretty pleased if I managed it now!
Mike
On 04/11/2012 2:40 PM, Raul Miller wrote:
In
A=. 0= ? (2$n)$2 NB. generate random matrix of [0,1]
The 0= is unnecessary, and probably reflects a habit based on the
false idea
On Sun, Nov 4, 2012 at 4:47 PM, Michal D. michal.dobrog...@gmail.com wrote:
The solver can solve sudoku puzzles (hopefully =)) but it should also be
able to handle more general csp instances where the constraints are not
symmetric. In the case of a sudoku puzzle, I think a single symmetric
On Sun, Nov 4, 2012 at 5:17 PM, I wrote:
Here's a brute force implementation of A for sudoku:
C=: |: R=: ,9#,:i.9 NB. identity within columns (C) and rows (R)
B=: ,3#3#1 i.3 3 NB. identity within boxes
A=: ((2*/~i.81)+/~i.81) * (+. |:) (C =/ R) +. (C =/B ) +. (R =/ B)
That was
On Sun, Nov 4, 2012 at 6:29 PM, Michal D. michal.dobrog...@gmail.com wrote:
for all w in Dy there exists a v in Dx such that the relationship v
compare w is true.
Does this sound right?
Yes, that sounds right so long as compare implies looking up the values in
the correct constraint table.
On Sun, Nov 4, 2012 at 9:46 PM, Michal D. michal.dobrog...@gmail.com wrote:
to J, it would be nice to use more primitive operations. Why the dislike
for a? I'm guessing it's a stab at removing some of the code?
Passing the same data, multiple ways, to J function is something of a
bad code
This looks promising:
http://www.jsoftware.com/jwiki/Addons/arc/zip
But I run into problems when I try to follow its steps:
load 'arc/zip/zfiles'
fexist jpath '~addons/arc/zip/test.zip'
0
fexist jpath '~addons/arc/zip/test/test.zip'
1
zdir jpath '~addons/arc/zip/test/test.zip'
When n=7, d=3, D will contain only 1s while E will typically contain a
mix of 1s and 0s.
I do not know enough about the purpose of this code to comment on
which is better.
--
Raul
On Mon, Nov 5, 2012 at 5:11 AM, Linda Alvord lindaalv...@verizon.net wrote:
I just began to ponder this thread.
I am not sure what your line ends look like.
A general implementation might be:
;._2@,TAB;._2 -.CR ,LF fread 'mytestfile.txt'
This will have an extra blank row at the bottom if your file is
newline terminated, in which case you might want:
;._2@,TAB;._2 -.CR fread 'mytestfile.txt'
If
I have been struggling with understanding this program, and I have an
issue that I need clarified:
D
1 0 0 1
0 1 0 1
1 0 1 0
1 1 0 0
c1
1 0 1 0
1 1 1 0
1 1 1 0
1 0 0 0
X
0 0 0 0
0 0 0 1
0 0 0 0
0 2 0 0
Here, I am thinking that an arc consistent result can only have 1
values in half of
On Sat, Nov 10, 2012 at 12:16 PM, Michal D. michal.dobrog...@gmail.com wrote:
Here X is telling us to use the constraint c1 (presumably b/c C is not
shown) between the variables 1 and 3 (0 based). Likewise, use the
transpose going the other direction (3,1).
Ouch, you are correct, I did not
Another option separates structure from data.
Given an initial matrix M, build:
DATA=: (,M),0
T=. 1 1}._1 _1}. i.2+$M
NDX=: ($M) $1 T i.,2 T +2 0 ] 0, (2+$y) #. _1 ^ #: i. 4
Now, NDX { DATA will give you a 5 item list of matrices which
represent the five desired sample points. Note
On Fri, Nov 16, 2012 at 1:01 PM, Alexander Mikhailov avm...@yahoo.com wrote:
Note that Context Free Grammars tend to be ambiguous, in traditional
programming environments we typically want a Parsing Expression
Grammar. And we probably need cloud sized resources to adequately
tackle natural
On Fri, Nov 16, 2012 at 5:59 PM, Peter B. Kessler
peter.b.kess...@oracle.com wrote:
What I can't give you is a feeling for how Raul Miller came up with this
particular way of producing that result.
I am not used to seeing my name repeated so many times, I am not sure
how to deal
On Fri, Nov 16, 2012 at 11:53 AM, Alex Giannakopoulos
aeg...@blueyonder.co.uk Of course, by the time we get to 3-D
tic-tac-toe on a torus, then cheap
tricks like padding to read will have to be discarded, and something more
serious adopted. (I mean, you're not going to pad a 3-d cube with 6
remove the final @ from h ?
Linda
-Original Message-
From:programming-bounces@**forums.jsoftware.comfrom%3aprogramming-boun...@forums.jsoftware.com
[mailto:programming-bounces@**forums.jsoftware.comprogramming-boun...@forums.jsoftware.com]
On Behalf Of Raul
Miller
Sent: Saturday
On Fri, Nov 16, 2012 at 11:13 PM, Alex Giannakopoulos
aeg...@blueyonder.co.uk wrote:
However, my concern was not the saving of 1k mem, but a deeper elegance
issue. I may be wrong here, I don't know, but I always prefer my data to
exist as only one copy, and as many references to it as are
On Tue, Nov 20, 2012 at 11:51 AM, Alex Giannakopoulos
aeg...@blueyonder.co.uk wrote:
OK, here is a simplified example of what I'm trying to do:
I want to split a matrix into two, so that the result is composed of the
odd rows and even rows of the matrix respectively
e.g.
oddevenrows i.
Another option is:
;(0 l) ,.. r
--
Raul
On Sat, Nov 24, 2012 at 8:06 PM, Bill Harris
bill_har...@facilitatedsystems.com wrote:
l=: 'test 1';'test 2'
r=: ('FL';'GA');('AL';'LA';'TN')
R=. 5 2 $ 'test 1';'FL';'test 1';'GA';'test 2';'AL';'test 2';'LA';'test
2';'TN'
What verb joins l and
Personally, I always try to avoid boxing whenever I can.
And if your data is regular (if all boxes have the same shape) then it
seems to me that boxing is needless overhead.
Am I missing something here?
Thanks,
--
Raul
--
For
Ironically, a good way to improve J documentation would be to write
some (perhaps in blog posts?) and then go through a revision process
with an audience on that.
That said, the best J documentation seems to be off hand --
tutorials that focus on some application and cover just enough of J
for it
'
do_something@do_a_ nl_a_ 0
But obviously one of my questions would be: why do we even have an
object here, and does a different arrangement make sense?
--
Raul
On Mon, Dec 3, 2012 at 1:09 PM, Alex Giannakopoulos
aeg...@blueyonder.co.uk wrote:
On 3 December 2012 15:59, Raul Miller rauldmil
agree with that statement.
On 3 December 2012 19:21, Raul Miller rauldmil...@gmail.com wrote:
There are several ways of translating that javascript code into J, I
would have to know something about the larger context to know which of
them I would pick.
That said, one of the simplest would
Here's another implementation of open with fit which is sufficient
for this case:
fitopen=:4 :0
data=.x,;y
(data i.L:_ _1 y) { data
)
'0' fitopen '11';'111'
110
111
Note that both the implementation and the concept would have to be
refined if we wanted to deal with open in the context of
Note that topswops form a graph between permutations.
So given topswops, we could define a routine which represents the
entire graph for permutations of length n:
swopvec=: 3 : 0
paths=. A.1. (! (@swops@A. :)i. ]) y
vec=. i.#paths
pairs=. ; 2 \. paths
;{:@[`({.@[)`]}./pairs,vec
)
Of course a real python solution involving an existing implementation
should be a few lines of python that call into the existing
implementation...
Anyways, if I were in your situation, I would explain that I expected
that my python development costs would be about 5x my J development
costs, and
better when just getting started.
--
Raul
On Fri, Dec 7, 2012 at 7:49 AM, Neil Murphy dnmur...@gmail.com wrote:
Sounds dishonest to me.
Sent from my iPhone
On 7 Dec 2012, at 12:29, Raul Miller rauldmil...@gmail.com wrote:
Of course a real python solution involving an existing implementation
p.s. by construction work, here, I meant something like building
houses -- something I am not currently doing.
--
Raul
On Fri, Dec 7, 2012 at 9:15 AM, Raul Miller rauldmil...@gmail.com wrote:
Why dishonest?
Granted, I approximated, but there are a variety of costs here having
to do
Here's an example argument list which specifies a permutation:
9 7 8
Here's the complete permutation:
(([ ,~ -.~) 1 i.@+ ./) 9 7 8
0 1 2 3 4 5 6 9 7 8
Here's the relevance of each member of the permutation:
({. +/ . }.)\. (([ ,~ -.~) 1 i.@+ ./) 9 7 8
0 0 0 0 0 0 0 2 0 0
Notice that
I do not understand your question -- which quoted sentence were you
asking about?
Thanks,
--
Raul
On Fri, Dec 7, 2012 at 11:12 AM, Aai agroeneveld...@gmail.com wrote:
On 07-12-12 16:58, Raul Miller wrote:
Here's an example argument list which specifies a permutation:
9 7 8
Here's
:
In other words, it prefixes the argument list with any missing values.
Note that if all these missing values are smaller in value than
anything in the argument list they will have
just missing a period or
Anyways, once the
On 07-12-12 18:12, Raul Miller wrote:
I do
An alternative phrase would be taking the diagonal.
The run together mechanism relates to the distinction between inner
and outer product. If you think of each array having an associated
list of indices along each dimension, normally transpose uses an outer
product combination of these. But when
On Fri, Dec 7, 2012 at 12:43 PM, Boyko Bantchev boyk...@gmail.com wrote:
Traditional algebraic notation is very good for what it has been
designed, and much easier to learn for kids than parsing J, let alone
understanding the underlying computational model.
To my knowledge, no studies have
1 - 100 of 4342 matches
Mail list logo
