I wrote:
> In order to find these limits simply sort the random data (a random
> sample drawn out of the raw data) and take the values that have
> approximately 30% or 80% of the values below them (no scaling needed
> for that). In statistical terms: Find the 30% and 80% quantiles.
Sorry, read
> I wrote:
> In order to find these limits simply sort the random data (a random
> sample drawn out of the raw data) and take the values that have
> approximately 30% or 80% of the values below them (no scaling needed
> for that). In statistical terms: Find the 30% and 80% quantiles.
Please
[@Mark: A (weighted) mean is a location parameter, one number.]
Here the customer (say Dagobert Duck) wants to change/weight the
distribution of the data.
As Dar says, he could do a mapping from 0-800 to bins as
"bad, neutral, good" simply by setting limits for the bins.
For example 0-30 = bad,
Today is not my coding day. I have a problem I should be able to design
a solution for an am struggling. Clearly I am missing "something"
I have 2 lists (LISTNEW and LISTOLD) of the following format:
ParentA
Child 1
Child 2
etc.
ParentB
Child 1
etc.
etc.
The parents are in alphabetical sorted
On 8/5/19 9:00 AM, Mark Wieder via use-livecode wrote:
have to weight the measured values to determine the maximum (and the Q
as desired).
Urk. Now it's my turn to have misspoken.
The maximum is easy to measure.
But looking at the clustering of values to determine the Q of the
bandpass filter
Opps.. correction to: "... When I look at the graph of this function using a
"k" value of 5 and above, I *thinK* it starts to simulate your desired
mapping"
That should read " ... When I look at the graph of this function using a 'k'
value of 3 down to close to zero I *think* starts to
Ralph:
Although several persons have responded... most far above my "pay-scale" ...
Your mention of the audio taper rang bell for me. In the process of simulating
an analog audio potentiometer using a digital one... I needed to find a formula
for an inverse audio taper... and it DID take a
Is it just me or would anyone else like to see the scope of the
wholeMatches property expanded beyond just wordOffset, itemOffset, and
lineOffset.
I'd like to see wholeMatches apply to:
Replace
Replace in field
Contains (as in if X contains Y)
With wholeMatches meaning test at white space
Hi all,
Read about new developments in LiveCode open source and the open source
community in today's edition of the "This Week in LiveCode" newsletter!
Read issue #188 here: http://bit.ly/33dSA1S
This is a weekly newsletter about LiveCode, focussing on what's been
going on in and around
On 8/5/19 1:48 AM, hh via use-livecode wrote:
[@Mark: A (weighted) mean is a location parameter, one number.]
Yes, exactly.
In sum, Dagobert wants to change the method on base of the raw
data or change the raw data such that the results are the wished
ones. (Honi soit qui mal y pense ...)
Hi.
This seems like a good case for arrays (pseudo):
You have to create an array for each parent. The only way i see to find those
is to go through the list looking for lines that DO NOT start with a space. If
you work from the bottom up, since children are always at the bottom and they
always
When computing limits for distribution categories given
frequencies the following may be useful:
A number q is a p%-quantile of a data set
If the percentage of data nums <= q is >= p%
and the percentage of data nums >= q is >= (100-p)%
For each percentage p there is an interval
[lowerV,upperV]
Hi,
anyone already tested the new keyboard commands for mobile(Android)?
mobileSetKeyboardReturnKey "done"
mobileSetKeyboardDisplay "over"
set the keyboardType of me to "email"
these seem not to work, and even do not bring up the keyboard as wanted.
so i use as normal this one:
I really do not like the use-list. It is difficult to format one's answers.
Here is a handler that places a few pieces of data into two variables. These
would be the two isolated lists of children derived from the parents as
described earlier. There is one difference between the two lists, the
I know this does not attend to the question, but my feelings are like this: if
one has control, go back and use arrays from the start.
Now, to your comments on robustness in parsing the files. I suppose any
whitespace at the start of a line could be considered a child. Also, it is an
error if
I'm a great fan of, and user of, arrays - but we always need to be
careful of losing data with duplicated keys.
You haven't said that the parent names in LISTNEW are guaranteed to be
unique. This simple code assumes they are - if they're not, it's easy to
add a check ... (And it also assumes
I'm pretty sure I goofed somewhere, but maybe something like this?
intersect ARRAYNEW with ARRAYOLD into temp
union temp with ARRAYNEW recursively
> On Aug 5, 2019, at 9:53 AM, Paul Dupuis via use-livecode
> wrote:
>
> Today is not my coding day. I have a problem I should be able to design a
Hmmm. I had mentioned earlier:
"You cannot just find matching lines between the two lists, because some
children
AND some parents may be present in both...
The discussion has focused on array lore, and that is fine, but are we all
in agreement that the main task is to isolate the parents,
I saw your post preceded my second one.
Besides the fact that this works as well and is faster:
repeat for each line tLine in tAll
put tLine into myArray[ tLine]
end repeat
The array thing is the easy part. The real working of this gadget depends on
being able to isolate the
I'd tend to look for ways to do this with functions that work on whole
collections and avoid loops.
If that is not found, or is hard to work with, I'd change the lists to be
arrays.
Each array is is keyed by parents. Each parent is an array of children.
Children can be represented as an
On 8/5/2019 11:53 AM, Paul Dupuis via use-livecode wrote:
Today is not my coding day. I have a problem I should be able to
design a solution for an am struggling. Clearly I am missing "something"
I have 2 lists (LISTNEW and LISTOLD) of the following format:
ParentA
Child 1
Child 2
etc.
Yikes! I wasn't aware of duplicate keys being a problem. How does that happen?
> On Aug 5, 2019, at 2:28 PM, Alex Tweedly via use-livecode
> wrote:
>
> I'm a great fan of, and user of, arrays - but we always need to be careful of
> losing data with duplicated keys.
>
> You haven't said that
I had not considered using arrays. I have no idea why, as it provides a
mechanism. Just not thinking well today. Thanks for the tip!
On 8/5/2019 1:40 PM, dunbarx--- via use-livecode wrote:
Hi.
This seems like a good case for arrays (pseudo):
You have to create an array for each parent. The
I agree that the lack of formatting makes it hard to communicate. I would favor
changing the list settings to allow for it. I don't think we have a spam
problem that would discourage that.
And to help support this, LC copy should include types easily pasted into mail
clients.
> On Aug 5,
On 8/5/19 2:24 PM, Dar Scott Consulting via use-livecode wrote:
Yikes! I wasn't aware of duplicate keys being a problem. How does that happen?
Marx
Groucho
Chico
etc.
Marx
Karl
etc.
--
Mark Wieder
ahsoftw...@gmail.com
___
use-livecode mailing
This is the kind of math I use every day, without knowing what I’m doing.
On Mon, Aug 5, 2019 at 09:21 Mark Wieder via use-livecode <
use-livecode@lists.runrev.com> wrote:
> On 8/5/19 9:00 AM, Mark Wieder via use-livecode wrote:
> > have to weight the measured values to determine the maximum
My mistake. I was thinking arrays.
> On Aug 5, 2019, at 3:34 PM, Mark Wieder via use-livecode
> wrote:
>
> On 8/5/19 2:24 PM, Dar Scott Consulting via use-livecode wrote:
>> Yikes! I wasn't aware of duplicate keys being a problem. How does that
>> happen?
>
> Marx
> Groucho
> Chico
> etc.
>
Hi,
i am currently trying to edit/modify a lcdoc file of a built in lc library. The
lcdoc is not displayed correctly in the dictionary. Some text is missing, in
this case text like is not visible.
Do i really have to restart LC and open the dictionary again after every change?
Are there
On 8/5/19 3:20 PM, dsc--- via use-livecode wrote:
Children are sub-arrays of parents.
Ain't that the truth.
--
Mark Wieder
ahsoftw...@gmail.com
___
use-livecode mailing list
use-livecode@lists.runrev.com
Please visit this url to subscribe,
I fixed this to use lists... Maybe.
put parentArray( LISTNEW ) into aNew
put parentArray( LISTOLD ) into aOld
intersect aNew with aOld -- Remove from aOld that which is not in aNew
union aOld with aNew recursively -- Leaves aNew unchanged except that children
in aOld are brought in. I think.
Check out this stack:
https://github.com/bwmilby/DocEditorPlus
On Mon, Aug 5, 2019 at 7:33 PM Matthias Rebbe via use-livecode <
use-livecode@lists.runrev.com> wrote:
> Hi,
> i am currently trying to edit/modify a lcdoc file of a built in lc
> library. The lcdoc is not displayed correctly in the
31 matches
Mail list logo
