similar to: Slide Show (S9) v1.1 Update - More Template Packs (Deck.js, Impress.js, CSSS, Slidy2, etc.)

Hello, == What's new in 0.7? I removed the dependency on Maruku (and Oniguruma) and now allow and check for optional installed Markdown libraries/gems. For now the search order for markdown libraries is first come, first serve, that is: rdiscount > rpeg-markdown > maruku > bluecloth (fallback, always present because it's required in gem spec). If you want to use

Hello, I've published a Ruby gem that lets you create slide shows and author slides in plain text using a wiki-style markup language that's easy-to-write and easy-to-read. Yes, that's Markdown. (Textile is supported too ;-) You can find two samples online in Markdown: o http://slideshow.rubyforge.org/svn/samples/rest.text o

Is there a way to pass command line arguments to R for use in BATCH mode or something similar? -- -Alex Morgan Homepage: http//pubpages.unh.edu/~amorgan AIM login: HomeySage "Anyway, no drug, not even alcohol, causes the fundamental ills of society. If we're looking for the source of our troubles, we shouldn't test people for drugs, we should test them for stupidity,

Author: jkennedy Repository: /hg/zfs-crypto/gate Revision: 6a727a093fbd6794a7ca69a71d9fa81f29c9364b Log message: 6251659 statvfs taking 30 second to complete performance regression s9 to s10 oracle 9ir2 starcat ufs Files: update: usr/src/uts/common/fs/ufs/ufs_alloc.c update: usr/src/uts/common/fs/ufs/ufs_inode.c update: usr/src/uts/common/fs/ufs/ufs_thread.c update:

Author: peterte Repository: /hg/zfs-crypto/gate Revision: 3ba32c5bc9459959256eb41efe4324aff24953d0 Log message: 6259653 cp command fail to copy 3.2 GB flash archive from DVD in S9/S10 32 bit x86 system. Files: update: usr/src/uts/common/fs/hsfs/hsfs_vnops.c update: usr/src/uts/common/sys/fs/hsfs_spec.h

Author: casper Repository: /hg/zfs-crypto/gate Revision: eda2f70f88e7ae03c995f668ced6bcdce8297daf Log message: 6361644 Differences in SUID scripts between S9 and S10 Files: update: usr/src/uts/common/exec/elf/elf.c update: usr/src/uts/common/exec/intp/intp.c update: usr/src/uts/common/os/exec.c update: usr/src/uts/common/sys/exec.h

Hi All! I am interested in testing whether the means for the data I am investigating are equal to a specific value - let's say 0.01. I have already run a one-way ANOVA and know that the differences in the means are not significant, so now I want to know what values the means take on. "otestme" is the data I am working with (it would be hard for me to get into a form that would be

Hi All, This is my first post ... I *HAD* been trying to get RHEL AS 4 onto this Dell PE 6400/700, but it just wouldn't go without some weird tweaking. I am VERY happy to say that CentOS 4.4 installed without a hitch! NICELY done folks! The only real issue for me is that the machine fails to reboot or shutdown correctly. It requires physical interaction with the power switch,

Hello All, I've been getting an error using rsync that I've been trying to track down the cause of, but haven't been able to solve yet. When I try to connect to a remote rsync deamon, using a double colon address like 192.168.0.2::classes to copy files in either direction, I get this error after a timeout. @ERROR: chroot failed rsync: connection unexpectedly closed (128 bytes

Hi Linfeng, On 06/02/17 02:51 PM, Linfeng Zhang wrote: > However, the critical thing is that all the states in each stage when > processing input[i] are reused by the next input[i+1]. That is > input[i+1] must wait input[i] for 1 stage, and input[i+2] must wait > input[i+1] for 1 stage, etc. That is indeed the tricky part... and the one I think you could do slightly differently. If

> >% gdiff ../kqemu-osol-1.3.0pre9/kqemu-solaris.c . > >54c54 > >< static uint_t kqemu_busy = 0; > >--- > > > > > >>static uint32_t kqemu_busy = 0; > >> > >> > >73c73 > >< static uint_t upages_locked = 0; > >--- > > > > > >>static uint32_t upages_locked = 0; > >> >

Hi Linfeng, On 06/02/17 07:18 PM, Linfeng Zhang wrote: > This is a great idea. But the order (psEncC->shapingLPCOrder) can be > configured to 12, 14, 16, 20 and 24 according to complexity parameter. > > It's hard to get a universal function to handle all these orders > efficiently. Any suggestions? I can think of two ways of handling larger orders. The obvious one is

Hi Jean-Marc, Thanks a lot for reviewing this huge assembly function! silk_warped_autocorrelation_FIX_c()'s kernel part is for( n = 0; n < length; n++ ) { tmp1_QS = silk_LSHIFT32( (opus_int32)input[ n ], QS ); /* Loop over allpass sections */ for( i = 0; i < order; i++ ) { /* Output of allpass section */ tmp2_QS = silk_SMLAWB(

Hi Jean-Marc, Attached is the silk_warped_autocorrelation_FIX_neon() which implements your idea. Speed improvement vs the previous optimization: Complexity 0-4: Doesn't call this function. Complexity 5: 2.1% (order = 16) Complexity 6: 1.0% (order = 20) Complexity 8: 0.1% (order = 24) Complexity 10: 0.1% (order = 24) Code size of silk_warped_autocorrelation_FIX_neon() changes from 2,644

Hi Linfeng, Thanks for the updated patch. I'll have a look and get back to you. When you report speedup percentages, is that relative to the entire encoder or relative to just that function in C? Also, what's the speedup compared to master? Cheers, Jean-Marc On 05/04/17 12:14 PM, Linfeng Zhang wrote: > I attached a new patch with small cleanup (disassembly is identical as > the

This is a great idea. But the order (psEncC->shapingLPCOrder) can be configured to 12, 14, 16, 20 and 24 according to complexity parameter. It's hard to get a universal function to handle all these orders efficiently. Any suggestions? Thanks, Linfeng On Mon, Feb 6, 2017 at 12:40 PM, Jean-Marc Valin <jmvalin at jmvalin.ca> wrote: > Hi Linfeng, > > On 06/02/17 02:51 PM,

Hi Linfeng, I had a closer look at your patch and the code looks good -- and slightly simpler than I had anticipated, so that's good. I did some profiling on a Cortex A57 and I've been seeing slightly less improvement than you're reporting, more like 3.5% at complexity 8. It appears that the warped autocorrelation function itself is only faster by a factor of about 1.35. That's a

Dear R-help list: I have want seems to be a simple task, but can't find a solution. I tried querying the archives, but did not succeed. My goal is to set up two (or more) graphs in one graph window, and then during execution of a sequential algorithm add points sequentially to these graphs. The graphs have different scales / coordinates. I use the par(mfg...) command to switch between

Hello, I am trying to test some results I have for significance. It has been recommended that I use R and I am completely new to this. Set-up: Groups: two groups of 8 subjects (16 total) Two conditions: alert and passive Measurements: responses for three different stimuli (A, B, and C) measured in each condition Experiment: Testing the order of conditions Group one: Alert A, B

I attached a new patch with small cleanup (disassembly is identical as the last patch). We have done the same internal testing as usual. Also, attached 2 failed temporary versions which try to reduce code size (just for code review reference purpose). The new patch of silk_warped_autocorrelation_FIX_neon() has a code size of 3,228 bytes (with gcc). smaller_slower.c has a code size of 2,304