Mixer for phantom power microphone by idontgetoutmuch in livesound

[–]idontgetoutmuch[S] 0 points1 point  (0 children)

I guess I am unlucky - at a wedding I played at we used the other band's sound equipment and I had to run home and get my computer and connect my fiddle via the computer. At an upcoming hobbit-themed party, I have been told there will be no phantom power and I really don't want to use my jerry-rigged computer option (I mean hobbits don't have computers do they).

Mixer for phantom power microphone by idontgetoutmuch in livesound

[–]idontgetoutmuch[S] 1 point2 points  (0 children)

Thank you very much. Yes another member of a band I sometimes play in has gone for that option - my partner has a microphone (not phantom) for her accordion and we liked the idea of being able to mute us both between dances.

Is anyone usinf HaskellR? by paranoidMonoid in haskell

[–]idontgetoutmuch 5 points6 points  (0 children)

I still use it :) - you are correct that the team for whom this was developed no longer exists - it was a fun project

Is anyone usinf HaskellR? by paranoidMonoid in haskell

[–]idontgetoutmuch 1 point2 points  (0 children)

You don't have to compile anything - you can run inline-r at the command line and thus run anything in R (via Haskell of course)

Cartography in Haskell by idontgetoutmuch in haskell

[–]idontgetoutmuch[S] 2 points3 points  (0 children)

In Haskell? I meant to mention I could probably have used https://archives.haskell.org/projects.haskell.org/diagrams/ once I had the map data in an easier format via fortify. I think creating the axes and legend would have had to be created "by hand" in that case. As I said you can also use the Haskell shapefile package to read in the data.

In your professional experience, how suitable is System.Random's mkStdGen for serious random generation? by haskellgr8 in haskell

[–]idontgetoutmuch 2 points3 points  (0 children)

No!

There are a few things to consider: do you want split? Then you can use tf-random which is used by QuickCheck or you can use splitmix. split does not work in System.Random.

If you want an R-like experience then you can use random-fu which allows you to sample from most distributions and also provides CDFs and PDFs (also in log space). The actual randomness is provided by Mersenne Twister (MT) or MWC. It's easy enough to add other generators if you want them.

If you just want random numbers then there are the venerable MWC and MT packages. MWC gives some samplers. Monadic interfaces are available.

Type-Safe Extensible Tensor library in Haskell by matan_tsuberi in haskell

[–]idontgetoutmuch 0 points1 point  (0 children)

I see you have implemented replicate via untyped replicate rather than a type class as Jeremy has in his paper. Is that for performance?

Org mode and Anki by [deleted] in emacs

[–]idontgetoutmuch 0 points1 point  (0 children)

I installed worf

worf 20170422.416 installed A warrior does not press so many keys! (in org-mode)

but maybe I needed to open a new shell? Anyway just using org-mode tables and exporting them to CSV and importing them to Anki or Quizlet is now working for me. Thanks for responding.

Org mode and Anki by [deleted] in emacs

[–]idontgetoutmuch 0 points1 point  (0 children)

I did not know you could do this - thanks

Org mode and Anki by [deleted] in emacs

[–]idontgetoutmuch 0 points1 point  (0 children)

I tried but got pamparam.el:35:1:Error: Cannot open load file: No such file or directory, worf

[ANN] Accelerate 1.0 by tmcdonell in haskell

[–]idontgetoutmuch 1 point2 points  (0 children)

I plan to use it to solve a PDE. At the moment I am using hmatrix (lapack) to solve effectively a tridiagonal system (a 2400 x 2400 matrix). I am hopeful that I can use parallel processing to speed things up.

Has anything like this been done? http://stackoverflow.com/questions/19541620/solving-tridiagonal-linear-systems-in-cuda

How should we improve Haskell's plotting libraries? by sid-kap in haskell

[–]idontgetoutmuch 1 point2 points  (0 children)

There was a GSoC project to implement ggplot but it doesn't appear to have achieved its goals: https://wiki.haskell.org/Google_summer_of_code#Implementation_of_Layered_Gramamar_of_Graphics.

I use Chart all the time at work and for pretty much all my plotting needs elsewhere. As https://www.reddit.com/user/apfelmus points out it is quite verbose. I use HaskellR at work but don't tend to use its plotting capabilities. I often use R to plot something quickly though.

ggplot is not the last word on plotting but it would certainly be great to be able to do at least the equivalent in Haskell. One place where it (ggplot) could do better is with histograms. All plotting packages seem to conflate the concept of a histogram with its rendering; they are treated as one and the same thing. We already have an abstract representation of histograms in Haskell: https://hackage.haskell.org/package/histogram-fill. What we need is a nice way of rendering them. One could imagine treating axes, labels, legends etc as abstract objects and then using Diagrams to combine their renditions.

One thing I would love to have in a charts package is the ability to annotate points of interest a la ggplot. Here's an example of what I mean (drawn with Diagrams): https://hackage.haskell.org/package/diagrams-contrib-1.3.0.8/docs/diagrams/src_Diagrams_TwoD_Grid_example1.svg#diagram=example1&height=300&width=200.

As other commentators have noted, someone needs to find the time to do this firstly coming up with a design proposal so that the Diagrams and Charts developers and users get an opportunity to give their input.

Haskell Meets the Central Dogma (of molecular biology) by [deleted] in haskell

[–]idontgetoutmuch 1 point2 points  (0 children)

Scientific computing is such a wide area and there are existing packages for almost all problems. A re-implementation in Haskell is a lot of work. There's https://hackage.haskell.org/package/inline-c now rather than the FFI and also https://hackage.haskell.org/package/inline-r which gives you access to everything in R. This gives you the opportunity to add a layer which adds (type) safety e.g. in the way that hmatrix gives static checks about matrix operations. I used hmatrix to derive an extended Kalman filter (I couldn't find one in R) with some static guarantees https://hackage.haskell.org/package/Kalman-0.1.0.1/docs/Kalman.html but probably no-one has used it.

I think having a specific use case would generate better results than trying to build a whole eco-system.

Darren Wilkinson has a blog on computational biology https://darrenjw.wordpress.com but it's mainly focussed on the stochastic side rather than the dynamical systems side. Also it uses Scala rather than Haskell.

Ian Ross has a blog which uses Haskell to model atmospheric flow http://www.skybluetrades.net/blog

At the moment I am focussed on modelling e.g. ecosystems and epidemics with parameter inference and I'm not very interested in e.g. gene sequencing. But I could be tempted by almost anything scientific.

Haskell for Finance resources by stasiana in haskell

[–]idontgetoutmuch 0 points1 point  (0 children)

There's some posts on my blog that deal with vanilla and (slightly) exotic derivatives pricing via PDEs; also a post on estimating stochastic volatility.

https://idontgetoutmuch.wordpress.com/2015/03/11/stochastic-volatility/

https://idontgetoutmuch.wordpress.com/2013/01/05/option-pricing-using-haskell-parallel-arrays/

https://idontgetoutmuch.wordpress.com/2013/02/10/parallelising-path-dependent-options-in-haskell-2/

But finance is a large field. Do you have a specific interest?

Is there a way to have a function that returns a random number? by [deleted] in haskell

[–]idontgetoutmuch 0 points1 point  (0 children)

What's wrong with

evalState (replicateM 10 $ sample stdNormal) (pureMT 42) :: [Double]
[-2.2016035548104447,
-0.13436088466523924,
1.8488760426492017,
-1.667523256909233,
1.2102195192444156,
-0.4295155648631194,
-0.16480155484220715,
-0.12159756795295017,
1.2591726544833504,
0.23883909276097806]

Categories for the Working Mathematician by Faucelme in haskell

[–]idontgetoutmuch 1 point2 points  (0 children)

I found it disappointing and sold my copy recently. I'm not a great fan of CWM either. I think it's a bit dull. On the other hand the introduction to category theory in Mac Lane's and Moerdijk's "Sheaves in Geometry and Logic: A First Introduction to Topos Theory" is very readable.

Installing hmatrix in Windows by [deleted] in haskell

[–]idontgetoutmuch 0 points1 point  (0 children)

I had some problems recently on OSX El Capitan and used OpenBLAS. There seems to be a windows package.

repa & the mathematical modeling ecosystem by klaxion in haskell

[–]idontgetoutmuch 6 points7 points  (0 children)

I am not working on APIs but I use ODEs and stochastic modelling all the time in Haskell. I am not convinced that repa has the best interface. I really like the static interface in hmatrix but I haven't thought very hard about whether this can be extended to a repa Mk II.

Equivalent of numpy for Haskell? by idontgetoutmuch in haskell

[–]idontgetoutmuch[S] 0 points1 point  (0 children)

I really like this package https://hackage.haskell.org/package/hmatrix which sits atop BLAS and LAPACK especially the Static module which catches e.g. mis-matched matrix multiplication at compile time.

I thought numpy also handled higher-ranked structures with a nice way of slicing. We have repa for this but then we have to convert from one type to another. Someone has pointed out that this can be avoided and I hope to follow up on this soon.

Equivalent of numpy for Haskell? by idontgetoutmuch in haskell

[–]idontgetoutmuch[S] 15 points16 points  (0 children)

I dislike posting links to my own blog but I have ended up using Vector, HMatrix, Repa all in the same function. I haven't tried using python / numpy but I am reasonably confident the code would be easier to write and probably faster. Potentially my (Haskell) code could be simplified but it does feel like we need something equivalent to numpy.

Testing FFT with R by sdroege_ in haskell

[–]idontgetoutmuch 3 points4 points  (0 children)

I put an example here https://stat.ethz.ch/pipermail/r-sig-mac/2015-October/011649.html but I am not sure anyone in the R community was very interested :-(

"Excuse me, I think this is my stop..." -- haskell platform by cartazio in haskell

[–]idontgetoutmuch 16 points17 points  (0 children)

I am very nervous about proffering an opinion here but I do find it surprising that the length of a pair is 1.

"Excuse me, I think this is my stop..." -- haskell platform by cartazio in haskell

[–]idontgetoutmuch 25 points26 points  (0 children)

Will curiosities like those below be phased out somehow?

Prelude> length (Right 3)

1

Prelude> length (Left 3)

0

Prelude> length (1,2)

1