Matthias Boehm

2017-09-07, 06:49

Janardhan Pulivarthi

2017-09-05, 03:58

Matthias Boehm

2017-09-04, 22:46

Matthias Boehm

2017-08-31, 23:39

Janardhan Pulivarthi

2017-08-31, 13:00

Matthias Boehm

2017-09-23, 00:00

Janardhan Pulivarthi

2017-09-22, 16:24

Janardhan Pulivarthi

2017-09-04, 14:57

- SystemML
- mail # dev
- Re: [QUESTION] XOR operations in SystemML. Thanks.

thanks Janardhan, in that case I would recommend to go with R syntax

because (1) it's actually one of our selling points that users don't have

to learn a new language, (2) it simplifies the porting of R scripts to DML

(and vice versa), and (3) I would think it's rather uncommon to have long

chains of xor operations.

Btw, a nice follow-up task - in case you're interested - would be to

generalize our AND, OR, NOT, (and XOR) operations to matrices, because

these are currently only supported over scalars. It would get you in touch

with the parser validation, compilation, and runtime of rather simple

operations.

Regards,

Matthias

On Mon, Sep 4, 2017 at 8:57 PM, Janardhan Pulivarthi <

[EMAIL PROTECTED]> wrote:

> Hi,

>

> yes, no big reason to deviate. But, simplicity of `*a (+) b*` or `*a ><

> b*`like

> ` *a ^ 2*` (compared to `*xor(a, b)`*, which of the type` *pow(a, 2) `*),

> to be consistent with the other symbols of dml.

>

> In this simple case:

> 1. ` *a (+) b (+) c (+) d(+)...* `

> 2. ` *xor(xor(a, b), c)..) ` (*sorry, if I written this syntax wrongly)

>

> Your word will be final.

>

> Thanks,

> Janardhan

>

>

> On Mon, Sep 4, 2017 at 6:46 PM, Matthias Boehm <[EMAIL PROTECTED]>

> wrote:

>

> > Could we please stick to R syntax (i.e., "xor(a, b)") here, unless there

> is

> > a good reason to deviate? Thanks.

> >

> > Regards,

> > Matthias

> >

> > On Mon, Sep 4, 2017 at 7:55 AM, Janardhan Pulivarthi <

> > [EMAIL PROTECTED]> wrote:

> >

> > > Hi all, [XOR symbol]

> > >

> > > Now, I gave a sample try for the XOR operator, with caret ` ^ ` symbol.

> > > But, this have been reserved for exponentiation. So, another

> alternative

> > > would be

> > >

> > > 1. ` (+) `

> > > 2. ` >< `

> > > 3. ` >-< `

> > >

> > > Thanks,

> > > Janardhan

> > >

> > > On Thu, Aug 31, 2017 at 7:38 PM, Matthias Boehm <

> [EMAIL PROTECTED]>

> > > wrote:

> > >

> > >> From a scalar operation perspective, you could of course emulate XOR

> via

> > >> AND, OR, and negation. However, you might want to write anyway a

> > java-based

> > >> UDF to efficiently implement this recursive operator.

> > >>

> > >> Down the road, we can think about a generalization of our existing

> > >> cumulative operations such as cumsum, cumprod, cummax, to arbitrary

> cell

> > >> computations and aggregation functions, which would be useful for

> quite

> > a

> > >> number of applications.

> > >>

> > >> Regards,

> > >> Matthias

> > >>

> > >> On Thu, Aug 31, 2017 at 5:59 AM, Janardhan Pulivarthi <

> > >> [EMAIL PROTECTED]> wrote:

> > >>

> > >>> Hi,

> > >>>

> > >>> The following is an equation (2.4) from the algorithm for the

> > generation

> > >>> of sobol sequences. The authors of the paper have utilized the

> bitwise

> > >>> operations of C++ to calculate this efficiently.

> > >>>

> > >>> *Now, the question is:* Can we do this at script level (in dml) or we

> > >>> should do it in the `java` itself as a builtin, function to generate

> > the

> > >>> numbers?.

> > >>>

> > >>>

> > >>>

> > >>> Thanks,

> > >>> Janardhan

> > >>>

> > >>

> > >>

> > >

> >

>

because (1) it's actually one of our selling points that users don't have

to learn a new language, (2) it simplifies the porting of R scripts to DML

(and vice versa), and (3) I would think it's rather uncommon to have long

chains of xor operations.

Btw, a nice follow-up task - in case you're interested - would be to

generalize our AND, OR, NOT, (and XOR) operations to matrices, because

these are currently only supported over scalars. It would get you in touch

with the parser validation, compilation, and runtime of rather simple

operations.

Regards,

Matthias

On Mon, Sep 4, 2017 at 8:57 PM, Janardhan Pulivarthi <

[EMAIL PROTECTED]> wrote:

> Hi,

>

> yes, no big reason to deviate. But, simplicity of `*a (+) b*` or `*a ><

> b*`like

> ` *a ^ 2*` (compared to `*xor(a, b)`*, which of the type` *pow(a, 2) `*),

> to be consistent with the other symbols of dml.

>

> In this simple case:

> 1. ` *a (+) b (+) c (+) d(+)...* `

> 2. ` *xor(xor(a, b), c)..) ` (*sorry, if I written this syntax wrongly)

>

> Your word will be final.

>

> Thanks,

> Janardhan

>

>

> On Mon, Sep 4, 2017 at 6:46 PM, Matthias Boehm <[EMAIL PROTECTED]>

> wrote:

>

> > Could we please stick to R syntax (i.e., "xor(a, b)") here, unless there

> is

> > a good reason to deviate? Thanks.

> >

> > Regards,

> > Matthias

> >

> > On Mon, Sep 4, 2017 at 7:55 AM, Janardhan Pulivarthi <

> > [EMAIL PROTECTED]> wrote:

> >

> > > Hi all, [XOR symbol]

> > >

> > > Now, I gave a sample try for the XOR operator, with caret ` ^ ` symbol.

> > > But, this have been reserved for exponentiation. So, another

> alternative

> > > would be

> > >

> > > 1. ` (+) `

> > > 2. ` >< `

> > > 3. ` >-< `

> > >

> > > Thanks,

> > > Janardhan

> > >

> > > On Thu, Aug 31, 2017 at 7:38 PM, Matthias Boehm <

> [EMAIL PROTECTED]>

> > > wrote:

> > >

> > >> From a scalar operation perspective, you could of course emulate XOR

> via

> > >> AND, OR, and negation. However, you might want to write anyway a

> > java-based

> > >> UDF to efficiently implement this recursive operator.

> > >>

> > >> Down the road, we can think about a generalization of our existing

> > >> cumulative operations such as cumsum, cumprod, cummax, to arbitrary

> cell

> > >> computations and aggregation functions, which would be useful for

> quite

> > a

> > >> number of applications.

> > >>

> > >> Regards,

> > >> Matthias

> > >>

> > >> On Thu, Aug 31, 2017 at 5:59 AM, Janardhan Pulivarthi <

> > >> [EMAIL PROTECTED]> wrote:

> > >>

> > >>> Hi,

> > >>>

> > >>> The following is an equation (2.4) from the algorithm for the

> > generation

> > >>> of sobol sequences. The authors of the paper have utilized the

> bitwise

> > >>> operations of C++ to calculate this efficiently.

> > >>>

> > >>> *Now, the question is:* Can we do this at script level (in dml) or we

> > >>> should do it in the `java` itself as a builtin, function to generate

> > the

> > >>> numbers?.

> > >>>

> > >>>

> > >>>

> > >>> Thanks,

> > >>> Janardhan

> > >>>

> > >>

> > >>

> > >

> >

>

Hi,

yes, no big reason to deviate. But, simplicity of `*a (+) b*` or `*a >< b*`like

` *a ^ 2*` (compared to `*xor(a, b)`*, which of the type` *pow(a, 2) `*),

to be consistent with the other symbols of dml.

In this simple case:

1. ` *a (+) b (+) c (+) d(+)...* `

2. ` *xor(xor(a, b), c)..) ` (*sorry, if I written this syntax wrongly)

Your word will be final.

Thanks,

Janardhan

On Mon, Sep 4, 2017 at 6:46 PM, Matthias Boehm <[EMAIL PROTECTED]>

wrote:

> Could we please stick to R syntax (i.e., "xor(a, b)") here, unless there is

> a good reason to deviate? Thanks.

>

> Regards,

> Matthias

>

> On Mon, Sep 4, 2017 at 7:55 AM, Janardhan Pulivarthi <

> [EMAIL PROTECTED]> wrote:

>

> > Hi all, [XOR symbol]

> >

> > Now, I gave a sample try for the XOR operator, with caret ` ^ ` symbol.

> > But, this have been reserved for exponentiation. So, another alternative

> > would be

> >

> > 1. ` (+) `

> > 2. ` >< `

> > 3. ` >-< `

> >

> > Thanks,

> > Janardhan

> >

> > On Thu, Aug 31, 2017 at 7:38 PM, Matthias Boehm <[EMAIL PROTECTED]>

> > wrote:

> >

> >> From a scalar operation perspective, you could of course emulate XOR via

> >> AND, OR, and negation. However, you might want to write anyway a

> java-based

> >> UDF to efficiently implement this recursive operator.

> >>

> >> Down the road, we can think about a generalization of our existing

> >> cumulative operations such as cumsum, cumprod, cummax, to arbitrary cell

> >> computations and aggregation functions, which would be useful for quite

> a

> >> number of applications.

> >>

> >> Regards,

> >> Matthias

> >>

> >> On Thu, Aug 31, 2017 at 5:59 AM, Janardhan Pulivarthi <

> >> [EMAIL PROTECTED]> wrote:

> >>

> >>> Hi,

> >>>

> >>> The following is an equation (2.4) from the algorithm for the

> generation

> >>> of sobol sequences. The authors of the paper have utilized the bitwise

> >>> operations of C++ to calculate this efficiently.

> >>>

> >>> *Now, the question is:* Can we do this at script level (in dml) or we

> >>> should do it in the `java` itself as a builtin, function to generate

> the

> >>> numbers?.

> >>>

> >>>

> >>>

> >>> Thanks,

> >>> Janardhan

> >>>

> >>

> >>

> >

>

yes, no big reason to deviate. But, simplicity of `*a (+) b*` or `*a >< b*`like

` *a ^ 2*` (compared to `*xor(a, b)`*, which of the type` *pow(a, 2) `*),

to be consistent with the other symbols of dml.

In this simple case:

1. ` *a (+) b (+) c (+) d(+)...* `

2. ` *xor(xor(a, b), c)..) ` (*sorry, if I written this syntax wrongly)

Your word will be final.

Thanks,

Janardhan

On Mon, Sep 4, 2017 at 6:46 PM, Matthias Boehm <[EMAIL PROTECTED]>

wrote:

> Could we please stick to R syntax (i.e., "xor(a, b)") here, unless there is

> a good reason to deviate? Thanks.

>

> Regards,

> Matthias

>

> On Mon, Sep 4, 2017 at 7:55 AM, Janardhan Pulivarthi <

> [EMAIL PROTECTED]> wrote:

>

> > Hi all, [XOR symbol]

> >

> > Now, I gave a sample try for the XOR operator, with caret ` ^ ` symbol.

> > But, this have been reserved for exponentiation. So, another alternative

> > would be

> >

> > 1. ` (+) `

> > 2. ` >< `

> > 3. ` >-< `

> >

> > Thanks,

> > Janardhan

> >

> > On Thu, Aug 31, 2017 at 7:38 PM, Matthias Boehm <[EMAIL PROTECTED]>

> > wrote:

> >

> >> From a scalar operation perspective, you could of course emulate XOR via

> >> AND, OR, and negation. However, you might want to write anyway a

> java-based

> >> UDF to efficiently implement this recursive operator.

> >>

> >> Down the road, we can think about a generalization of our existing

> >> cumulative operations such as cumsum, cumprod, cummax, to arbitrary cell

> >> computations and aggregation functions, which would be useful for quite

> a

> >> number of applications.

> >>

> >> Regards,

> >> Matthias

> >>

> >> On Thu, Aug 31, 2017 at 5:59 AM, Janardhan Pulivarthi <

> >> [EMAIL PROTECTED]> wrote:

> >>

> >>> Hi,

> >>>

> >>> The following is an equation (2.4) from the algorithm for the

> generation

> >>> of sobol sequences. The authors of the paper have utilized the bitwise

> >>> operations of C++ to calculate this efficiently.

> >>>

> >>> *Now, the question is:* Can we do this at script level (in dml) or we

> >>> should do it in the `java` itself as a builtin, function to generate

> the

> >>> numbers?.

> >>>

> >>>

> >>>

> >>> Thanks,

> >>> Janardhan

> >>>

> >>

> >>

> >

>

Could we please stick to R syntax (i.e., "xor(a, b)") here, unless there is

a good reason to deviate? Thanks.

Regards,

Matthias

On Mon, Sep 4, 2017 at 7:55 AM, Janardhan Pulivarthi <

[EMAIL PROTECTED]> wrote:

> Hi all, [XOR symbol]

>

> Now, I gave a sample try for the XOR operator, with caret ` ^ ` symbol.

> But, this have been reserved for exponentiation. So, another alternative

> would be

>

> 1. ` (+) `

> 2. ` >< `

> 3. ` >-< `

>

> Thanks,

> Janardhan

>

> On Thu, Aug 31, 2017 at 7:38 PM, Matthias Boehm <[EMAIL PROTECTED]>

> wrote:

>

>> From a scalar operation perspective, you could of course emulate XOR via

>> AND, OR, and negation. However, you might want to write anyway a java-based

>> UDF to efficiently implement this recursive operator.

>>

>> Down the road, we can think about a generalization of our existing

>> cumulative operations such as cumsum, cumprod, cummax, to arbitrary cell

>> computations and aggregation functions, which would be useful for quite a

>> number of applications.

>>

>> Regards,

>> Matthias

>>

>> On Thu, Aug 31, 2017 at 5:59 AM, Janardhan Pulivarthi <

>> [EMAIL PROTECTED]> wrote:

>>

>>> Hi,

>>>

>>> The following is an equation (2.4) from the algorithm for the generation

>>> of sobol sequences. The authors of the paper have utilized the bitwise

>>> operations of C++ to calculate this efficiently.

>>>

>>> *Now, the question is:* Can we do this at script level (in dml) or we

>>> should do it in the `java` itself as a builtin, function to generate the

>>> numbers?.

>>>

>>>

>>>

>>> Thanks,

>>> Janardhan

>>>

>>

>>

>

a good reason to deviate? Thanks.

Regards,

Matthias

On Mon, Sep 4, 2017 at 7:55 AM, Janardhan Pulivarthi <

[EMAIL PROTECTED]> wrote:

> Hi all, [XOR symbol]

>

> Now, I gave a sample try for the XOR operator, with caret ` ^ ` symbol.

> But, this have been reserved for exponentiation. So, another alternative

> would be

>

> 1. ` (+) `

> 2. ` >< `

> 3. ` >-< `

>

> Thanks,

> Janardhan

>

> On Thu, Aug 31, 2017 at 7:38 PM, Matthias Boehm <[EMAIL PROTECTED]>

> wrote:

>

>> From a scalar operation perspective, you could of course emulate XOR via

>> AND, OR, and negation. However, you might want to write anyway a java-based

>> UDF to efficiently implement this recursive operator.

>>

>> Down the road, we can think about a generalization of our existing

>> cumulative operations such as cumsum, cumprod, cummax, to arbitrary cell

>> computations and aggregation functions, which would be useful for quite a

>> number of applications.

>>

>> Regards,

>> Matthias

>>

>> On Thu, Aug 31, 2017 at 5:59 AM, Janardhan Pulivarthi <

>> [EMAIL PROTECTED]> wrote:

>>

>>> Hi,

>>>

>>> The following is an equation (2.4) from the algorithm for the generation

>>> of sobol sequences. The authors of the paper have utilized the bitwise

>>> operations of C++ to calculate this efficiently.

>>>

>>> *Now, the question is:* Can we do this at script level (in dml) or we

>>> should do it in the `java` itself as a builtin, function to generate the

>>> numbers?.

>>>

>>>

>>>

>>> Thanks,

>>> Janardhan

>>>

>>

>>

>

From a scalar operation perspective, you could of course emulate XOR via

AND, OR, and negation. However, you might want to write anyway a java-based

UDF to efficiently implement this recursive operator.

Down the road, we can think about a generalization of our existing

cumulative operations such as cumsum, cumprod, cummax, to arbitrary cell

computations and aggregation functions, which would be useful for quite a

number of applications.

Regards,

Matthias

On Thu, Aug 31, 2017 at 5:59 AM, Janardhan Pulivarthi <

[EMAIL PROTECTED]> wrote:

> Hi,

>

> The following is an equation (2.4) from the algorithm for the generation

> of sobol sequences. The authors of the paper have utilized the bitwise

> operations of C++ to calculate this efficiently.

>

> *Now, the question is:* Can we do this at script level (in dml) or we

> should do it in the `java` itself as a builtin, function to generate the

> numbers?.

>

>

>

> Thanks,

> Janardhan

>

AND, OR, and negation. However, you might want to write anyway a java-based

UDF to efficiently implement this recursive operator.

Down the road, we can think about a generalization of our existing

cumulative operations such as cumsum, cumprod, cummax, to arbitrary cell

computations and aggregation functions, which would be useful for quite a

number of applications.

Regards,

Matthias

On Thu, Aug 31, 2017 at 5:59 AM, Janardhan Pulivarthi <

[EMAIL PROTECTED]> wrote:

> Hi,

>

> The following is an equation (2.4) from the algorithm for the generation

> of sobol sequences. The authors of the paper have utilized the bitwise

> operations of C++ to calculate this efficiently.

>

> *Now, the question is:* Can we do this at script level (in dml) or we

> should do it in the `java` itself as a builtin, function to generate the

> numbers?.

>

>

>

> Thanks,

> Janardhan

>

Hi,

The following is an equation (2.4) from the algorithm for the generation of

sobol sequences. The authors of the paper have utilized the bitwise

operations of C++ to calculate this efficiently.

*Now, the question is:* Can we do this at script level (in dml) or we

should do it in the `java` itself as a builtin, function to generate the

numbers?.

Thanks,

Janardhan

The following is an equation (2.4) from the algorithm for the generation of

sobol sequences. The authors of the paper have utilized the bitwise

operations of C++ to calculate this efficiently.

*Now, the question is:* Can we do this at script level (in dml) or we

should do it in the `java` itself as a builtin, function to generate the

numbers?.

Thanks,

Janardhan

Hi Janardhan,

sure - I've created SYSTEMML-1931, which covers the support of boolean

operations over matrices. Your current PR for SYSTEMML-1883 already touches

some aspects of it for XOR. I would recommend to keep 1883 and 1931

separate. Hence, you don't have to deal with value type propagation and

GPU, SPARK, or MR instructions in 1883 right now.

Regarding the generalization of cumulative operations, I don't think we're

ready to create an actual task yet - it's just an observation that a lot of

operations like cumsum and removeEmpty have a common recursive

characteristics and that there are lots of use cases, where we would want a

similar primitive with arbitrary element-wise and cumulative aggregation

functions. If you're interested in working on it, we should probably start

with a design document.

Regards,

Matthias

On Fri, Sep 22, 2017 at 9:23 AM, Janardhan Pulivarthi <

[EMAIL PROTECTED]> wrote:

> Hi Matthias,

>

> In your previous mail - you wrote,

>

> > Down the road, we can think about a generalization of our existing

> cumulative operations such as cumsum, cumprod, cummax, to arbitrary cell

> computations and aggregation functions, which would be useful for quite a

> number of applications.

>

> > would be to generalize our AND, OR, NOT, (and XOR) operations to

> matrices, because

> these are currently only supported over scalars.

>

> Is there any jira is created for this? (would you mind please, creating a

> jira for me with a little description of task). Is there anything that you

> would like to add for the above tasks, to handle in one nice PR at once.

>

> Thanks,

> Janardhan

>

>

> On Thu, Sep 7, 2017 at 12:18 PM, Matthias Boehm <[EMAIL PROTECTED]>

> wrote:

>

>> thanks Janardhan, in that case I would recommend to go with R syntax

>> because (1) it's actually one of our selling points that users don't have

>> to learn a new language, (2) it simplifies the porting of R scripts to DML

>> (and vice versa), and (3) I would think it's rather uncommon to have long

>> chains of xor operations.

>>

>> Btw, a nice follow-up task - in case you're interested - would be to

>> generalize our AND, OR, NOT, (and XOR) operations to matrices, because

>> these are currently only supported over scalars. It would get you in touch

>> with the parser validation, compilation, and runtime of rather simple

>> operations.

>>

>> Regards,

>> Matthias

>>

>> On Mon, Sep 4, 2017 at 8:57 PM, Janardhan Pulivarthi <

>> [EMAIL PROTECTED]> wrote:

>>

>> > Hi,

>> >

>> > yes, no big reason to deviate. But, simplicity of `*a (+) b*` or `*a ><

>> > b*`like

>> > ` *a ^ 2*` (compared to `*xor(a, b)`*, which of the type` *pow(a, 2)

>> `*),

>> > to be consistent with the other symbols of dml.

>> >

>> > In this simple case:

>> > 1. ` *a (+) b (+) c (+) d(+)...* `

>> > 2. ` *xor(xor(a, b), c)..) ` (*sorry, if I written this syntax wrongly)

>> >

>> > Your word will be final.

>> >

>> > Thanks,

>> > Janardhan

>> >

>> >

>> > On Mon, Sep 4, 2017 at 6:46 PM, Matthias Boehm <[EMAIL PROTECTED]>

>> > wrote:

>> >

>> > > Could we please stick to R syntax (i.e., "xor(a, b)") here, unless

>> there

>> > is

>> > > a good reason to deviate? Thanks.

>> > >

>> > > Regards,

>> > > Matthias

>> > >

>> > > On Mon, Sep 4, 2017 at 7:55 AM, Janardhan Pulivarthi <

>> > > [EMAIL PROTECTED]> wrote:

>> > >

>> > > > Hi all, [XOR symbol]

>> > > >

>> > > > Now, I gave a sample try for the XOR operator, with caret ` ^ `

>> symbol.

>> > > > But, this have been reserved for exponentiation. So, another

>> > alternative

>> > > > would be

>> > > >

>> > > > 1. ` (+) `

>> > > > 2. ` >< `

>> > > > 3. ` >-< `

>> > > >

>> > > > Thanks,

>> > > > Janardhan

>> > > >

>> > > > On Thu, Aug 31, 2017 at 7:38 PM, Matthias Boehm <

>> > [EMAIL PROTECTED]>

>> > > > wrote:

>> > > >

>> > > >> From a scalar operation perspective, you could of course emulate

>> XOR

>> > via

>> > > >> AND, OR, and negation. However, you might want to write anyway a

>> > > java-based

sure - I've created SYSTEMML-1931, which covers the support of boolean

operations over matrices. Your current PR for SYSTEMML-1883 already touches

some aspects of it for XOR. I would recommend to keep 1883 and 1931

separate. Hence, you don't have to deal with value type propagation and

GPU, SPARK, or MR instructions in 1883 right now.

Regarding the generalization of cumulative operations, I don't think we're

ready to create an actual task yet - it's just an observation that a lot of

operations like cumsum and removeEmpty have a common recursive

characteristics and that there are lots of use cases, where we would want a

similar primitive with arbitrary element-wise and cumulative aggregation

functions. If you're interested in working on it, we should probably start

with a design document.

Regards,

Matthias

On Fri, Sep 22, 2017 at 9:23 AM, Janardhan Pulivarthi <

[EMAIL PROTECTED]> wrote:

> Hi Matthias,

>

> In your previous mail - you wrote,

>

> > Down the road, we can think about a generalization of our existing

> cumulative operations such as cumsum, cumprod, cummax, to arbitrary cell

> computations and aggregation functions, which would be useful for quite a

> number of applications.

>

> > would be to generalize our AND, OR, NOT, (and XOR) operations to

> matrices, because

> these are currently only supported over scalars.

>

> Is there any jira is created for this? (would you mind please, creating a

> jira for me with a little description of task). Is there anything that you

> would like to add for the above tasks, to handle in one nice PR at once.

>

> Thanks,

> Janardhan

>

>

> On Thu, Sep 7, 2017 at 12:18 PM, Matthias Boehm <[EMAIL PROTECTED]>

> wrote:

>

>> thanks Janardhan, in that case I would recommend to go with R syntax

>> because (1) it's actually one of our selling points that users don't have

>> to learn a new language, (2) it simplifies the porting of R scripts to DML

>> (and vice versa), and (3) I would think it's rather uncommon to have long

>> chains of xor operations.

>>

>> Btw, a nice follow-up task - in case you're interested - would be to

>> generalize our AND, OR, NOT, (and XOR) operations to matrices, because

>> these are currently only supported over scalars. It would get you in touch

>> with the parser validation, compilation, and runtime of rather simple

>> operations.

>>

>> Regards,

>> Matthias

>>

>> On Mon, Sep 4, 2017 at 8:57 PM, Janardhan Pulivarthi <

>> [EMAIL PROTECTED]> wrote:

>>

>> > Hi,

>> >

>> > yes, no big reason to deviate. But, simplicity of `*a (+) b*` or `*a ><

>> > b*`like

>> > ` *a ^ 2*` (compared to `*xor(a, b)`*, which of the type` *pow(a, 2)

>> `*),

>> > to be consistent with the other symbols of dml.

>> >

>> > In this simple case:

>> > 1. ` *a (+) b (+) c (+) d(+)...* `

>> > 2. ` *xor(xor(a, b), c)..) ` (*sorry, if I written this syntax wrongly)

>> >

>> > Your word will be final.

>> >

>> > Thanks,

>> > Janardhan

>> >

>> >

>> > On Mon, Sep 4, 2017 at 6:46 PM, Matthias Boehm <[EMAIL PROTECTED]>

>> > wrote:

>> >

>> > > Could we please stick to R syntax (i.e., "xor(a, b)") here, unless

>> there

>> > is

>> > > a good reason to deviate? Thanks.

>> > >

>> > > Regards,

>> > > Matthias

>> > >

>> > > On Mon, Sep 4, 2017 at 7:55 AM, Janardhan Pulivarthi <

>> > > [EMAIL PROTECTED]> wrote:

>> > >

>> > > > Hi all, [XOR symbol]

>> > > >

>> > > > Now, I gave a sample try for the XOR operator, with caret ` ^ `

>> symbol.

>> > > > But, this have been reserved for exponentiation. So, another

>> > alternative

>> > > > would be

>> > > >

>> > > > 1. ` (+) `

>> > > > 2. ` >< `

>> > > > 3. ` >-< `

>> > > >

>> > > > Thanks,

>> > > > Janardhan

>> > > >

>> > > > On Thu, Aug 31, 2017 at 7:38 PM, Matthias Boehm <

>> > [EMAIL PROTECTED]>

>> > > > wrote:

>> > > >

>> > > >> From a scalar operation perspective, you could of course emulate

>> XOR

>> > via

>> > > >> AND, OR, and negation. However, you might want to write anyway a

>> > > java-based

Hi Matthias,

In your previous mail - you wrote,

> Down the road, we can think about a generalization of our existing

cumulative operations such as cumsum, cumprod, cummax, to arbitrary cell

computations and aggregation functions, which would be useful for quite a

number of applications.

> would be to generalize our AND, OR, NOT, (and XOR) operations to

matrices, because

these are currently only supported over scalars.

Is there any jira is created for this? (would you mind please, creating a

jira for me with a little description of task). Is there anything that you

would like to add for the above tasks, to handle in one nice PR at once.

Thanks,

Janardhan

On Thu, Sep 7, 2017 at 12:18 PM, Matthias Boehm <[EMAIL PROTECTED]>

wrote:

> thanks Janardhan, in that case I would recommend to go with R syntax

> because (1) it's actually one of our selling points that users don't have

> to learn a new language, (2) it simplifies the porting of R scripts to DML

> (and vice versa), and (3) I would think it's rather uncommon to have long

> chains of xor operations.

>

> Btw, a nice follow-up task - in case you're interested - would be to

> generalize our AND, OR, NOT, (and XOR) operations to matrices, because

> these are currently only supported over scalars. It would get you in touch

> with the parser validation, compilation, and runtime of rather simple

> operations.

>

> Regards,

> Matthias

>

> On Mon, Sep 4, 2017 at 8:57 PM, Janardhan Pulivarthi <

> [EMAIL PROTECTED]> wrote:

>

> > Hi,

> >

> > yes, no big reason to deviate. But, simplicity of `*a (+) b*` or `*a ><

> > b*`like

> > ` *a ^ 2*` (compared to `*xor(a, b)`*, which of the type` *pow(a, 2) `*),

> > to be consistent with the other symbols of dml.

> >

> > In this simple case:

> > 1. ` *a (+) b (+) c (+) d(+)...* `

> > 2. ` *xor(xor(a, b), c)..) ` (*sorry, if I written this syntax wrongly)

> >

> > Your word will be final.

> >

> > Thanks,

> > Janardhan

> >

> >

> > On Mon, Sep 4, 2017 at 6:46 PM, Matthias Boehm <[EMAIL PROTECTED]>

> > wrote:

> >

> > > Could we please stick to R syntax (i.e., "xor(a, b)") here, unless

> there

> > is

> > > a good reason to deviate? Thanks.

> > >

> > > Regards,

> > > Matthias

> > >

> > > On Mon, Sep 4, 2017 at 7:55 AM, Janardhan Pulivarthi <

> > > [EMAIL PROTECTED]> wrote:

> > >

> > > > Hi all, [XOR symbol]

> > > >

> > > > Now, I gave a sample try for the XOR operator, with caret ` ^ `

> symbol.

> > > > But, this have been reserved for exponentiation. So, another

> > alternative

> > > > would be

> > > >

> > > > 1. ` (+) `

> > > > 2. ` >< `

> > > > 3. ` >-< `

> > > >

> > > > Thanks,

> > > > Janardhan

> > > >

> > > > On Thu, Aug 31, 2017 at 7:38 PM, Matthias Boehm <

> > [EMAIL PROTECTED]>

> > > > wrote:

> > > >

> > > >> From a scalar operation perspective, you could of course emulate XOR

> > via

> > > >> AND, OR, and negation. However, you might want to write anyway a

> > > java-based

> > > >> UDF to efficiently implement this recursive operator.

> > > >>

> > > >> Down the road, we can think about a generalization of our existing

> > > >> cumulative operations such as cumsum, cumprod, cummax, to arbitrary

> > cell

> > > >> computations and aggregation functions, which would be useful for

> > quite

> > > a

> > > >> number of applications.

> > > >>

> > > >> Regards,

> > > >> Matthias

> > > >>

> > > >> On Thu, Aug 31, 2017 at 5:59 AM, Janardhan Pulivarthi <

> > > >> [EMAIL PROTECTED]> wrote:

> > > >>

> > > >>> Hi,

> > > >>>

> > > >>> The following is an equation (2.4) from the algorithm for the

> > > generation

> > > >>> of sobol sequences. The authors of the paper have utilized the

> > bitwise

> > > >>> operations of C++ to calculate this efficiently.

> > > >>>

> > > >>> *Now, the question is:* Can we do this at script level (in dml) or

> we

> > > >>> should do it in the `java` itself as a builtin, function to

> generate

> > > the

> > > >>> numbers?.

> > > >>>

> > > >>>

> > > >>>

> > > >>> Thanks,

> > > >>> Janardhan

In your previous mail - you wrote,

> Down the road, we can think about a generalization of our existing

cumulative operations such as cumsum, cumprod, cummax, to arbitrary cell

computations and aggregation functions, which would be useful for quite a

number of applications.

> would be to generalize our AND, OR, NOT, (and XOR) operations to

matrices, because

these are currently only supported over scalars.

Is there any jira is created for this? (would you mind please, creating a

jira for me with a little description of task). Is there anything that you

would like to add for the above tasks, to handle in one nice PR at once.

Thanks,

Janardhan

On Thu, Sep 7, 2017 at 12:18 PM, Matthias Boehm <[EMAIL PROTECTED]>

wrote:

> thanks Janardhan, in that case I would recommend to go with R syntax

> because (1) it's actually one of our selling points that users don't have

> to learn a new language, (2) it simplifies the porting of R scripts to DML

> (and vice versa), and (3) I would think it's rather uncommon to have long

> chains of xor operations.

>

> Btw, a nice follow-up task - in case you're interested - would be to

> generalize our AND, OR, NOT, (and XOR) operations to matrices, because

> these are currently only supported over scalars. It would get you in touch

> with the parser validation, compilation, and runtime of rather simple

> operations.

>

> Regards,

> Matthias

>

> On Mon, Sep 4, 2017 at 8:57 PM, Janardhan Pulivarthi <

> [EMAIL PROTECTED]> wrote:

>

> > Hi,

> >

> > yes, no big reason to deviate. But, simplicity of `*a (+) b*` or `*a ><

> > b*`like

> > ` *a ^ 2*` (compared to `*xor(a, b)`*, which of the type` *pow(a, 2) `*),

> > to be consistent with the other symbols of dml.

> >

> > In this simple case:

> > 1. ` *a (+) b (+) c (+) d(+)...* `

> > 2. ` *xor(xor(a, b), c)..) ` (*sorry, if I written this syntax wrongly)

> >

> > Your word will be final.

> >

> > Thanks,

> > Janardhan

> >

> >

> > On Mon, Sep 4, 2017 at 6:46 PM, Matthias Boehm <[EMAIL PROTECTED]>

> > wrote:

> >

> > > Could we please stick to R syntax (i.e., "xor(a, b)") here, unless

> there

> > is

> > > a good reason to deviate? Thanks.

> > >

> > > Regards,

> > > Matthias

> > >

> > > On Mon, Sep 4, 2017 at 7:55 AM, Janardhan Pulivarthi <

> > > [EMAIL PROTECTED]> wrote:

> > >

> > > > Hi all, [XOR symbol]

> > > >

> > > > Now, I gave a sample try for the XOR operator, with caret ` ^ `

> symbol.

> > > > But, this have been reserved for exponentiation. So, another

> > alternative

> > > > would be

> > > >

> > > > 1. ` (+) `

> > > > 2. ` >< `

> > > > 3. ` >-< `

> > > >

> > > > Thanks,

> > > > Janardhan

> > > >

> > > > On Thu, Aug 31, 2017 at 7:38 PM, Matthias Boehm <

> > [EMAIL PROTECTED]>

> > > > wrote:

> > > >

> > > >> From a scalar operation perspective, you could of course emulate XOR

> > via

> > > >> AND, OR, and negation. However, you might want to write anyway a

> > > java-based

> > > >> UDF to efficiently implement this recursive operator.

> > > >>

> > > >> Down the road, we can think about a generalization of our existing

> > > >> cumulative operations such as cumsum, cumprod, cummax, to arbitrary

> > cell

> > > >> computations and aggregation functions, which would be useful for

> > quite

> > > a

> > > >> number of applications.

> > > >>

> > > >> Regards,

> > > >> Matthias

> > > >>

> > > >> On Thu, Aug 31, 2017 at 5:59 AM, Janardhan Pulivarthi <

> > > >> [EMAIL PROTECTED]> wrote:

> > > >>

> > > >>> Hi,

> > > >>>

> > > >>> The following is an equation (2.4) from the algorithm for the

> > > generation

> > > >>> of sobol sequences. The authors of the paper have utilized the

> > bitwise

> > > >>> operations of C++ to calculate this efficiently.

> > > >>>

> > > >>> *Now, the question is:* Can we do this at script level (in dml) or

> we

> > > >>> should do it in the `java` itself as a builtin, function to

> generate

> > > the

> > > >>> numbers?.

> > > >>>

> > > >>>

> > > >>>

> > > >>> Thanks,

> > > >>> Janardhan

Hi all, [XOR symbol]

Now, I gave a sample try for the XOR operator, with caret ` ^ ` symbol.

But, this have been reserved for exponentiation. So, another alternative

would be

1. ` (+) `

2. ` >< `

3. ` >-< `

Thanks,

Janardhan

On Thu, Aug 31, 2017 at 7:38 PM, Matthias Boehm <[EMAIL PROTECTED]>

wrote:

> From a scalar operation perspective, you could of course emulate XOR via

> AND, OR, and negation. However, you might want to write anyway a java-based

> UDF to efficiently implement this recursive operator.

>

> Down the road, we can think about a generalization of our existing

> cumulative operations such as cumsum, cumprod, cummax, to arbitrary cell

> computations and aggregation functions, which would be useful for quite a

> number of applications.

>

> Regards,

> Matthias

>

> On Thu, Aug 31, 2017 at 5:59 AM, Janardhan Pulivarthi <

> [EMAIL PROTECTED]> wrote:

>

>> Hi,

>>

>> The following is an equation (2.4) from the algorithm for the generation

>> of sobol sequences. The authors of the paper have utilized the bitwise

>> operations of C++ to calculate this efficiently.

>>

>> *Now, the question is:* Can we do this at script level (in dml) or we

>> should do it in the `java` itself as a builtin, function to generate the

>> numbers?.

>>

>>

>>

>> Thanks,

>> Janardhan

>>

>

>

Now, I gave a sample try for the XOR operator, with caret ` ^ ` symbol.

But, this have been reserved for exponentiation. So, another alternative

would be

1. ` (+) `

2. ` >< `

3. ` >-< `

Thanks,

Janardhan

On Thu, Aug 31, 2017 at 7:38 PM, Matthias Boehm <[EMAIL PROTECTED]>

wrote:

> From a scalar operation perspective, you could of course emulate XOR via

> AND, OR, and negation. However, you might want to write anyway a java-based

> UDF to efficiently implement this recursive operator.

>

> Down the road, we can think about a generalization of our existing

> cumulative operations such as cumsum, cumprod, cummax, to arbitrary cell

> computations and aggregation functions, which would be useful for quite a

> number of applications.

>

> Regards,

> Matthias

>

> On Thu, Aug 31, 2017 at 5:59 AM, Janardhan Pulivarthi <

> [EMAIL PROTECTED]> wrote:

>

>> Hi,

>>

>> The following is an equation (2.4) from the algorithm for the generation

>> of sobol sequences. The authors of the paper have utilized the bitwise

>> operations of C++ to calculate this efficiently.

>>

>> *Now, the question is:* Can we do this at script level (in dml) or we

>> should do it in the `java` itself as a builtin, function to generate the

>> numbers?.

>>

>>

>>

>> Thanks,

>> Janardhan

>>

>

>

Apache Lucene, Apache Solr and all other Apache Software Foundation project and their respective logos are trademarks of the Apache Software Foundation.

Elasticsearch, Kibana, Logstash, and Beats are trademarks of Elasticsearch BV, registered in the U.S. and in other countries. This site and Sematext Group is in no way affiliated with Elasticsearch BV.

Service operated by Sematext

Elasticsearch, Kibana, Logstash, and Beats are trademarks of Elasticsearch BV, registered in the U.S. and in other countries. This site and Sematext Group is in no way affiliated with Elasticsearch BV.

Service operated by Sematext