Displaying 16 results from an estimated 16 matches for "consequtive".
Did you mean:
consecutive
2009 Sep 22
3
Function similar to cumsum/cumprod
Hello, everyone
I wonder if there is in R somewhere a function similar to cumsum().
The function calculates a statistic (say mean or standard deviation)
buy adding consequtively one more data point.
So, say I have a timeseries of 100 observations.
I start by calculating mean of first 30 observations
Then I add one observation and calculate mean of 31 observations
Then I add one more observation and calculate mean of 32 observation,
and so on until the end
Is there a fu...
2005 Nov 19
2
OggPCM2: channel map
> True, but remember that the channel map type implied the number of
> entries in the table, and also that in this organization you'll always
> number the logical channels consequtively since each logical channel
> indeed corresponds to an index into the array. If the channel map type
> says it's a map for 5.1, there will only be 6 slots in the table no
> matter how many channels are actually stored.
Not quite, let's say the six first logical channels are t...
2017 Mar 22
3
"isolinux.bin missing or corrupt" when booting USB flash drive in old PC
On Tue, Mar 21, 2017 at 09:03:35AM +0100, Thomas Schmitt via Syslinux wrote:
> I think we should offer David a binary which he can combine with
> the MBR of the ISO and the image with the recognizable blocks.
> I will later today upload a binary version of my block producer
> and post the URL.
>
> The combination will be:
> 432 bytes from Martin's MBR
> 80 bytes
2005 Nov 18
2
OggPCM2: channel map
> I that this is handled pretty nicely by the "simple map" that Sampo
> suggested. This is basically the same thing as the "channel map"
> described on the wiki, but with the (physical,logical) channel pair
> swapped. So, using the syntax from the wiki:
> channel_type = OGG_CHANNEL_MAP_STEREO
> channel_map [OGG_CHANNEL_FRONT_LEFT] = 1
> channel_map
2017 Mar 22
0
"isolinux.bin missing or corrupt" when booting USB flash drive in old PC
...r the job.
> C<LBA0>/<C0>/<H0>/<S0>
> <LBA1>/<C1>/<H1>/<S1>
> <LBA2>/<C2>/<H2>/<S2>
> <LBA3>/<C3>/<H3>/<S3>
Anything strange to see with this sequence of addresses which are
supposed to be consequtive ?
Whatever, if this was only about confused addresses, then David would
probably see one of the blocks with numbered content.
The all-0 read result looks rather like there had been no reading
at all.
It will be interesting to hear from David whether a non-zero block
is read when he fills the USB...
2009 Apr 22
0
Error in manual and a suggestion
...n was not set to 2048. So actually there should just
be inserted the statement: packet.len = 2048;
?
This has been done in the code, but is not reflected in the manual.
?
?
Another thing is if I may and that is to suggest a functionallity to the
speex specific jitter buffer which would be a
int?get_consequtive_lost_count() or bool is_reset() which would simple
deal with with the lost_count variable in the jitter_buffer (not speex
specific) and either return the lost_count value or return a value
indicating wether it is higher than the value used to reset the
jitter_buffer (think its 20 atm).
?
The reason...
2008 Jun 30
2
[LLVMdev] TableGen && OpenBSD
On Jun 29, 2008, at 1:48 PM, Anton Korobeynikov wrote:
> Hello, Everyone
>
>> Thanks for your help, and good luck debugging!
> Ok, looks like I've nailed down the tablegen bug and even reproduced
> the
> assertion on linux.
>
> Steps to reproduce: just apply the attached patch. This makes
> iteration
> over PatterFragments map little bit slower, but
2008 Jun 30
0
[LLVMdev] TableGen && OpenBSD
On Sun, Jun 29, 2008 at 08:03:05PM -0700, Chris Lattner wrote:
Dear Chris,
>>> Thanks for your help, and good luck debugging!
>> Ok, looks like I've nailed down the tablegen bug and even reproduced the
>> assertion on linux.
>>
>> Steps to reproduce: just apply the attached patch. This makes iteration
>> over PatterFragments map little bit slower, but
2007 Oct 17
0
predictable bit patterns in runif(n) shortly after set.seed
...the
standard Mersenne Twister with the following modifications:
- It uses MRG32k5a by P.L'Ecuyer for generating the initial state
(This generator works modulo odd primes and so does not generate
dependencies of the kind to which Mersenne Twister is sensitive.)
- Combines 26 bits of two consequtive numbers into a single number
with 52 random bits (this explains its name) and adds a constant
shift 2^-53 to guarantee that the result is always in (0,1).
Combining the two changes together allows to keep the current Mersenne
Twister implementation intact for backward compatibility and provi...
2005 Nov 19
0
OggPCM2: channel map
...make it a map?). So if you had a
> OGG_CHANNEL_SPECIAL with an id of 1000, it would force 1000 entries in
> the array.
True, but remember that the channel map type implied the number of
entries in the table, and also that in this organization you'll always
number the logical channels consequtively since each logical channel
indeed corresponds to an index into the array. If the channel map type
says it's a map for 5.1, there will only be 6 slots in the table no
matter how many channels are actually stored. So you would have to
define a map type with 1000 separate logical channels be...
2005 Nov 19
0
OggPCM2: channel map
>> True, but remember that the channel map type implied the number of
>> entries in the table, and also that in this organization you'll always
>> number the logical channels consequtively since each logical channel
>> indeed corresponds to an index into the array. If the channel map type
>> says it's a map for 5.1, there will only be 6 slots in the table no
>> matter how many channels are actually stored.
>
> Not quite, let's say the six first logic...
2007 Jul 16
4
[LLVMdev] fields in structure re-arranged for alignment?
Hi Folks,
Bear with me, I'm a newbie to LLVM.
I've read the language reference and the mailing list archive. One area of
the semantics of the Structure type that hasn't been discussed is whether
fields in the structure get re-arranged to better suit the target machine's
natural alignment, ala what happens in C.
For example would this structure on a 32-bit machine:
{ i16, i32,
2017 Mar 26
1
"isolinux.bin missing or corrupt" when booting USB flash drive in old PC
...two conversion factors HpC and SpH are needed for the formula
to convert C/H/S to LBA or vice versa:
LBA = C * HpC * SpH + H * SpH + S - 1
Introducing the term "track" here seems surplus.
It would become confusing as soon as we speak of optical media too.
There "track" is a consequtive sequence of some normally quite large
number of blocks.
Have a nice day :)
Thomas
2017 Mar 26
2
"isolinux.bin missing or corrupt" when booting USB flash drive in old PC
Hi,
Ady wrote:
> so, why the original isohybrid image from Debian and many other
> isohybrid images have mostly (but not all) "00s" in place of the "90s"?
That's a fake Block0 of an Apple Partition Map. Part of mjg's layout.
Caused by isohybrid option --mac or xorrisofs option -isohybrid-apm-hfsplus.
* Fedora has it with EFI FAT filesystem in one partition
2019 Nov 10
2
[Bug 112239] New: nouveau hangs video with TU116 - regression in kernel 5.3
...card state switch. In
fact, I don't use it to render the output (is DynOff by default), but I cannot
disable it in BIOS and when I open/close a laptop lid it is temporarily waken
up to get back to sleep after a few seconds. It works that way in 5.2, but in
5.3 it "hangs video" on the consequtive switch (occasionally also during the
first X/gdm setup).
The key related errors in the system log:
> kernel: nouveau 0000:01:00.0: fifo: SCHED_ERROR 08 []
(a lot of)
> kernel: nouveau 0000:01:00.0: fifo: fault 01 [VIRT_WRITE] at 0000000000002000 engine c0 [BAR2] client 08 [HUB/HOST_CPU_NB]...
2007 May 14
6
Conditional Sums for Index creation
Hi,
Apologies for the long mail. I have a data.frame with columns of
price/mcap data for a portfolio of stocks, and the date. To get the
total value of the portfolio on a daily basis, I calculate rowSums of
the data.frame.
> set.seed(1)
> ab <- matrix(round(runif(100)*100),nrow=20,ncol=5)
> ab[1:5,4:5] <- NA
> ab[6:10,5] <- NA
> ac <- as.data.frame(ifelse(ab <=