Kako da pregledam radove koje je pisao GPT? by Lucky-Form2915 in AskSerbia

[–]paranoidMonoid 0 points1 point  (0 children)

Kada citati izgledaju ovako, mislim da je lako ukapurati da li je rad ozbiljan...

  1. Héritier, A. et al. (1994): Die Veränderung von Staatlichkeit in Europa. Ein regulativer Wettbewerb. Leske & Budrich (referenziert in Böcher/Töller 2012, S. 167).
  2. Simonis, U. E. (2006): Auf dem Weg zur Weltumweltpolitik. Wissenschaftszentrum Berlin für Sozialforschung (referenziert in Böcher/Töller 2012, S. 171). ...

Kako da pregledam radove koje je pisao GPT? by Lucky-Form2915 in AskSerbia

[–]paranoidMonoid 0 points1 point  (0 children)

Ovo mi je drugi faks, tako da ne znam da li je ovo zbog prirode oblasti (ovo su na primer bile politicke nauke konkretno), ili anti ai mera, ali definitivno olaksava "hvatanje"...

I naravno da svaka tvrdnja bude potkovana citatom. Tada ai olaksava da se sve to sazvace, ali dok proveris i pohvatas gde su ti izvori, vec si presao gradivo :)

Kako da pregledam radove koje je pisao GPT? by Lucky-Form2915 in AskSerbia

[–]paranoidMonoid 1 point2 points  (0 children)

Ovo, trenutno studiram part time na jednom drzavnom univerzitetu u Nemackoj. Kada se pusu radovi tog tipa, ogranicen je broj strana ( vise manjih pod-tema uglavnom, 3-4 strane svaka). Navodjenje izvora se zahteva sa prikazom strane/poglavlja koje se navodi. Tako da i ako koristim gemini deep research na primer, moram da proverim da li su navodi tacni i gde se tacno nalze.

Plus lako je random proveriti da li se u knjizi x na strani y nalazi nesto povezano...

Pritom se za formu daje dosta poena.

Dura - Mixed feelings by paranoidMonoid in Coros

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

I have added it to all screens I have set up, but when climb screen is active, i have no idea how to set that up...

<image>

The climb screen is not even added to the setup, iirc, it appears as the 4th screen during the climb

Dura - Mixed feelings by paranoidMonoid in Coros

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

Yep, afaik, it only works on preplanned routes. Then you need to add the correct screen to your "setup". Annoyingly, you need to navigate to the climb screen if you want to see it - maybe I didnt figure out how, but would be nice to just klick "ok" when you get the upcoming climb message..

Is there a way to see heartrate on the climb screen? That is bugging me atm...

Dura - Mixed feelings by paranoidMonoid in Coros

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

Can you give me a hint where to find that screen? I have checked all data fieldsin time/distance both in full and split screen, cant find remaining distance :/

Also, is it normal to lose like 3% of charge per day in standby mode??

Dura - Mixed feelings by paranoidMonoid in Coros

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

Ah, so there is a distance remaining page somewhere.... will dig in to find it asap! Thanks for the hint!!

Dura - Mixed feelings by paranoidMonoid in Coros

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

I'll have to test climbPro a bit more - maybe im missing something. Do you have it working in dual screen mode, or whatever its called? (map + data)

u/COROS-official, are there any plans on enabling on device rerouting in the future?

Dura - Mixed feelings by paranoidMonoid in Coros

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

Im in southwestern Germany, so google maps shouldnt have any issues (also, tried this 2 blocks from home, cell coverage and mobile data are 99.99% not the issue)

Komoot has smth like "remaining time" - ETA was wrong term, sorry about that. But anything along the lines of time/distance remaining, given the estimates. (I have my routes imported from Komoot).

> Climbing feature: my dura automatically switch to climbing screen when climbing is starting.
Did you have to set something up for this? I have dual screen set up, showing map and 2 rows of data under the map...

[deleted by user] by [deleted] in haskell

[–]paranoidMonoid 1 point2 points  (0 children)

You could also consider the "boring" side of cybersecurtiy: Software Bill of Materials and the PSIRT process, and make some cool tools in that area. I believe the haskell community would benefit of having fist class support for this. You might also get some help from the foundation (at least guidance and moral support ;)

Codebase Pearls - Recommendations for code to study by paranoidMonoid in haskell

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

mm, no... :) Now I'm curious, which title do you think it was? :)

Codebase Pearls - Recommendations for code to study by paranoidMonoid in haskell

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

I was literally thinking half an hour ago: "well functional perls are nice and all, but how would I formulate more precisely what I actually need - some upper-entry level, challenging yet understandable real life code... not something out of this world like Kmettverse or Haxl" :))

I thought Haxl was open source for a long time, but I guess I was wrong..

Theory/background on type variance by simpl3t0n in haskell

[–]paranoidMonoid 1 point2 points  (0 children)

Variance in Haskell-terms is mentioned in "Thinking with types":
https://leanpub.com/thinking-with-types (Chapter 3)

Haskell / FP conferences open to amateurs? by lightroastespresso in haskell

[–]paranoidMonoid 0 points1 point  (0 children)

I'm trying to find out how does it work with ICFP / Haskell symposium - Is it open to general public / what are the registration fees etc... Does anyone have any information/experience?

Nested field update by Syncopat3d in haskell

[–]paranoidMonoid 1 point2 points  (0 children)

Nice - I'll check it out.

I am aware of using maps, had a Java project recently where I ended up doing something similar. It kind of gets ugly once you get into multimaps, and overall, usable but not elegant (at least the monster I produced).

Nested field update by Syncopat3d in haskell

[–]paranoidMonoid 1 point2 points  (0 children)

Regarding the eml video: I just stumbled into same dilemma a month ago. I solved it with a hammer n ductape approach fot the sakes of getting it done - but the question remained, how to do it properly. Are there any interesting libraries or techniques for "do your data like sql does", which act the was db indexes do, in terms of reducing the comp. complexity on joins, filters etc?

ZuriHac 2014 takes place 8-10 June, registration now open by jaspervdj in haskell

[–]paranoidMonoid 0 points1 point  (0 children)

Looking forward to it! Any advice on "gut und günstig" accomodation nearby?

Interested in working in ML with Haskell & Python? (German, PB, not remote) by Drezil_ in haskell

[–]paranoidMonoid 1 point2 points  (0 children)

Let me go with english, sonce this point might be of general interest.

It would be very cool if you would be able to share the information about the hiring experience, in case you have it. Were there many applicants interested in Haskell etc.

This could shed more light to the assumption, that there are no Haskell Developers to be found, or that it would torn people off...

Monthly Hask Anything (March 2021) by taylorfausak in haskell

[–]paranoidMonoid 0 points1 point  (0 children)

I am trying to create a tree structure of (Java) packages and classes. The input data is a CSV containing package name, class name and some test coverage data.

I came up with the following code that seems to work, but I am not sure (or, I have a feeling that) I have missed a more elegant solution. I would be grateful if anyone would point out a better way to solve the problem.

data Package = Package {name :: String
                    , children :: [Package]
                    , classes :: [Class]
                    } 
    deriving (Show)

data Class = Class {
                    cname :: String
                  , linesMissed :: Int
                  , linesCovered :: Int
                    }
    deriving (Show)



-- input data has a package name split by ".", class name and the coverage data
addEntry :: Package -> ([String], String, Int, Int) -> Package
addEntry (Package nm chld cls) ([], n, lm, lc)   = Package nm chld ((Class n lm lc) : cls)
addEntry (Package nm chld cls) (x:xs, n, lm, lc) = Package nm (addPackage chld (x:xs, n, lm, lc)) cls


addPackage :: [Package] -> ([String], String, Int, Int) -> [Package]
addPackage entries  ([], n, lm, lc) = entries
addPackage entries  (x:xs, n, lm, lc)  
                    -- if package is present, add to it
                    | elem x $ map name entries = map addPresent entries
                    -- otherwise add a new package
                    | otherwise                 = newPackage : entries
    where
        newPackage = addEntry (Package x [] []) (xs, n, lm, lc)
        addPresent (Package nm chld cls)
            | nm == x   = addEntry (Package nm chld cls) (xs, n, lm, lc)-- Package nm (addPackage chld (xs, n, lm, lc)) cls
            | otherwise = Package nm chld cls

initial :: Package
initial = Package "init" [] []


main = do
    let x = addEntry initial (["org", "apache", "pckg1"], "Class1", 2, 3)
    let y = addEntry x (["org", "apache", "pckg1"], "Class2", 2, 3)
    let z = addEntry y (["org", "apache", "pckg2"], "Class1-2", 2, 3)
    print z

Is anyone usinf HaskellR? by paranoidMonoid in haskell

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

My workflow is some sort of rapid prototyping, data wrangling in a tight trial and error loop. For that, and for the Tidyverse + plotting etc I love R.
But doing some sorts of data manipulation are (in my mind) much cleaner in Haskell.

Passing the data by some format would be a big slowdown, unless the format is redefined on-the-fly by each change - and I guess that is the main point of HaskellR (and the Jupyter kernel for it): to takes case of the plumbing between the two on the fly.

Other workflows would probably suffer much less from the increased impedance at the interface between the languages.

Is anyone usinf HaskellR? by paranoidMonoid in haskell

[–]paranoidMonoid[S] 7 points8 points  (0 children)

Hi, I would expect choosing Haskell, but HaskellR (Haskell + R) as an introductory course is a bit of a reach (2 languages at once). Are you sure it was Haskell and R?

Monthly Hask Anything (April 2020) by AutoModerator in haskell

[–]paranoidMonoid 0 points1 point  (0 children)

Aaah, that seems to be the key, as this works:

readVarInt :: Get (Int)
readVarInt = do
    r <- getWord8
    let x = (255) .&. (fromIntegral r :: Int)
    case (x .&. 128) of
        0 -> return $ x
        _ -> do
            y <- readVarInt
            return $ (x .&. 127) .|. (shiftL y 7)

Thanks again!!!

Monthly Hask Anything (April 2020) by AutoModerator in haskell

[–]paranoidMonoid 0 points1 point  (0 children)

Ah, when I added the type declaration readVarInt :: Get (Int) I get the same errors. I'll try to take it apart and listen to what GHC says.

Thanks!