We started producing shows as Today with a Techie on 2005-09-19, 13 years, 9 months, 4 days ago. Our shows are produced by listeners like you and can be on any topic that "are of interest to hobbyists". If you listen to HPR then please consider contributing one show a year. If you record your show now it could be released in 22 days.
In this episode, Yannick talks with Wendy Hill about her use of opensource software in her job
Hosted by Yannick on 2019-06-17 is flagged as Clean and released under a CC-BY-SA license. Tags:opensource, photography, lubuntu, darktable, rapidphotodownloader, displaycal, gimp.
Listen in ogg, spx, or mp3 format.
Series: Interviews | Comments (0)
Wendy Hill is a photographer. And by that, I don’t mean she takes pictures of her kids on Sundays at the baseball game. Although, if she was to do that, it would probably turn out to be great pictures. No, Wendy is a professional photographer, and to run her business, she uses free and opensource software.
Wait… no Photoshop? No Illustrator? How is that possible? Wendy joined me on Mumble earlier this year – that’s 2019 for you, visitors from the future – and we discussed about that.
Moving right along with shows from the requests list, I combine two program lists.
Hosted by Christopher M. Hobbs on 2019-06-13 is flagged as Clean and released under a CC-BY-SA license. Tags:programs, linux, android, apps, applications, lists, favorites.
Listen in ogg, spx, or mp3 format.
In this episode, Yannick talks with Robbie Ferguson about the Nagios Enterprise Monitoring System
Hosted by Yannick on 2019-06-10 is flagged as Clean and released under a CC-BY-SA license. Tags:nagios, network, monitoring, opensource, singleboardcomputer, sbc, raspberrypi, odroid.
Listen in ogg, spx, or mp3 format.
Series: Interviews | Comments (1)
When it comes to monitoring your network, and the machines on it, you have a lot of options. But, let’s face it : none of those are easy to implement, and configuring a monitoring tool, whether it’s an open-source or a proprietary one, is often complex and time consuming.
Well, someone took that matter into their own hands, and made NEMS. What is NEMS, how can it help us, and what infrastructure does it require? Those are a few of the questions I asked Robbie Ferguson, the maintainer of NEMS, who joined me on Easter week-end for a little chat.
A request for comments on not publishing clips with known fair use samples
Hosted by Various Hosts on 2019-06-06 is flagged as Clean and released under a CC-BY-SA license. Tags:HPR, Policy Change, Legal, DMCA, TWAT, Fair Use, PacketSniffers, Copyright.
Listen in ogg, spx, or mp3 format.
Request for comments
Under safe harbor provisions, we as volunteers are usually insulated from any copyright issues that may arise in the shows. "We do not vet, edit, moderate or in any way censor any of the shows on the network, we trust you to do that."
This we got by accident because "This is a long standing tradition arising from the fact that HPR is a community of peers who believe that any host has as much right to submit shows as any other."
In the show notes associated with hpr2829 on 2019-06-06, the host included the following text "For all included materials: If anyone feels they have right to any material in this show please let me know and I will comply."
"Never include content, for example music, in your show that you do not have permission to redistribute. Try to avoid using any content in your show that can not be redistributed under a Creative Commons Attribution-ShareAlike 3.0 Unported license. If you are redistributing under another Creative Commons License or by arranged permission please make note of the restrictions when you upload your show. We can then signal that, so that others who redistribute HPR content can filter your show out."
As it was clear that they were not in compliance, I contacted the host. The host has been very helpful and has already removed some of the content but commented "There are still 2 audio clips included. I claim I can use them on the basis off fair use principles."
While the host may be correct, if they are not, then it is me and not the host that will be held responsible for posting it. I do not want that responsibility.
Under the current HPR rules I am allowed to reject this submission.
Before I do, I would appreciate as much feedback as possible on this topic so that we can gauge the opinions of the HPR Community as a whole.
The discussion thread remains open and is open to all by joining the Maillist.
Last time we looked how to model technology and research. This time we’ll do some actual research. I’m skipping over some of the details as the episode is long enough as it is. Hopefully it’s still possible to follow with the show notes.
Main concepts that I’m mentioning: Technology allows usage of specific buildings, ship components and such. Research unlock technologies and may have antecedents that has to be completed before the research can be started. Research cost is measure of how expensive a research is in terms of research points, which are produced by different buildings.
Earlier I modeled tech tree as Map that had Technology as keys and Research as values. I realized that this is suboptimal and will replace it at some point in the future.
There’s three resources that client can connect to. First one is for retrieving list of available research, second one for manipulating current research and last one for retrieving info on how much research points is being produced.
/api/research/available ApiAvailableResearchR GET
/api/research/current ApiCurrentResearchR GET POST DELETE
/api/research/production ApiResearchProductionR GET
Simulation of research is done by handleFactionResearch, which does simulation for one faction for a given date. After calculating current research point production and retrieving list of current research, function calculates progress of current researches. Unfinished ones are written back to database, while completed are moved into completed_research table. Final step is updating what research will be available in the next turn.
handleFactionResearch date faction = do
production <- totalProduction $ entityKey faction
current <- selectList [ CurrentResearchFactionId ==. entityKey faction ] 
let updated = updateProgress production <$> current
_ <- updateUnfinished updated
_ <- handleCompleted date updated $ entityKey faction
_ <- updateAvailableResearch $ entityKey faction
Research point production
Research points are produced by buildings. So first step is to load all planets owned by the faction and buildings on those planets. Applying researchOutput function to each building yields a list of TotalResearchScore, which is then summed up by mconcat. We can use mconcat as TotalResearchScore is a monoid (I talked about these couple episodes ago).
researchOutput function below uses pattern matching. Instead of writing one function definition and case expression inside of it, we’re writing multiple definitions. Each of them matches building of different type. First example is definition that is used for ResearchComplex, while second one is for ParticleAccelerator. Final case uses underscore to match anything and indicate that we’re not even interested on the particular value being matched. mempty is again from our monoid definition. It is empty or unit value of monoid, which in case of TotalResearchScore is zero points in all research categories.
Moving research forward is more complex looking function. There’s bunch of filtering and case expressions going on, but the idea is hopefully clear after a bit of explanation.
updateProgress takes two parameters, total production of research points and current research that is being modified. This assumes that there are only one of each categories of research going on at any given time. If there were more, we would have to divide research points between them by some logic. Function calculates effect of research points on current research and produces a new current research that is the end result.
Perhaps the most interesting part is use of lenses. For example, line entityValL . currentResearchProgressL +~ engResearch $ curr means that curr (which is Entity CurrentResearch) is used as starting point. First we reach to data part of Entity and then we focus on currentResearchProgress and add engResearch to it. This results a completely new Entity CurrentResearch being constructed, which is otherwise identical with the original, but the currentResearchProgress has been modified. Without lenses we would have to do this destructuring and restructuring manually.
Writing unfinished research back to database is short function. First we find ones that hasn’t been finished by filtering with (not . researchReady . entityVal) and then we apply replace to write them back one by one.
Handling finished research starts by finding out which ones were actually completed by filtering with (researchReady . entityVal) and their research type with currentResearchType . entityVal. Rest of the function is all about database actions: creating entries into completed_research and adding news entries for each completed research, then removing entries from current_research and available_research.
handleCompleted date updated fId = do
let finished = filter (researchReady . entityVal) updated
let finishedTech = currentResearchType . entityVal <$> finished
insertMany_ $ currentToCompleted date . entityVal <$> finished
insertMany_ $ researchCompleted date fId . (currentResearchType . entityVal) <$> finished
deleteWhere [ CurrentResearchId <-. fmap entityKey finished ]
deleteWhere [ AvailableResearchType <-. finishedTech
, AvailableResearchFactionId ==. fId ]
Figuring out what researches will be available for the next turn takes several steps. I won’t be covering random numbers in detail, they’re interesting enough for an episode on their own. It’s enough to know that g <- liftIO getStdGen gets us a new random number generator that is seeded by current time.
updateAvailableResearch starts by loading available research and current research for the faction and initializing a new random number generator. g can be used multiple times, but it’ll always return same sequence of numbers. Here it doesn’t matter, but in some cases it might. getR is helper function I wrote that uses random number generator to pick n entries from a given list. n in our case is hard coded to 3, but later on I’ll add possibility for player to research technologies that raise this limit. newAvailableResearch (we’ll look into its implementation closer just in a bit) produces a list of available research for specific research category. These lists are combined with <> operator and written into database with rewriteAvailableResearch.
updateAvailableResearch fId = do
available <- selectList [ AvailableResearchFactionId ==. fId ] 
completed <- selectList [ CompletedResearchFactionId ==. fId ] 
g <- liftIO getStdGen
let maxAvailable = ResearchLimit 3
-- reusing same g should not have adverse effect here
let engCand = getR g (unResearchLimit maxAvailable) $ newAvailableResearch isEngineering maxAvailable available completed
let natCand = getR g (unResearchLimit maxAvailable) $ newAvailableResearch isNaturalScience maxAvailable available completed
let socCand = getR g (unResearchLimit maxAvailable) $ newAvailableResearch isSocialScience maxAvailable available completed
rewriteAvailableResearch fId $ engCand <> natCand <> socCand
newAvailableResearch is in charge of figuring out what, if any, new research should be available in the next turn. In case where amount of currently available research is same or greater than research limit, empty list is returned, otherwise function calculates candidates and returns them. Logic for that is following:
candidates are research of specific category of those that has been unlock and unresearched
unlocked and unresearched are unlocked ones that are in list of known technology
unlocked research are ones with antecedents available in tech tree
known technology are ones in list of completed research
and complete definition of the function is shown below:
newAvailableResearch selector limit available completed =
if ResearchLimit (length specificCategory) >= limit
specificCategory = filter (availableResearchFilter selector) available
candidates = filter (selector . researchCategory) unlockedAndUnresearched
unlockedAndUnresearched = filter (\x -> researchType x `notElem` knownTech) unlockedResearch
unlockedResearch = filter (antecedentsAvailable knownTech) $ unTechTree techTree
knownTech = completedResearchType . entityVal <$> completed
availableResearchFilter f x =
maybe False (f . researchCategory) res
res = Map.lookup (availableResearchType $ entityVal x) techMap
Final step of the simulation of research is to update database with new available research. mkUniq is helper function that removes duplicate elements from a list. It’s used in rewriteAvailableResearch function to make a list that contains all unique top research categories (engineering, natural sciences and social sciences). If the resulting list isn’t empty, we’ll use it to remove all available research for those top categories and insert new available research.
rewriteAvailableResearch fId res = do
let cats = mkUniq $ fmap (topCategory . researchCategory) res
unless (null cats) $ do
deleteWhere [ AvailableResearchFactionId ==. fId
, AvailableResearchCategory <-. cats ]
insertMany_ $ researchToAvailable fId <$> res
Now everything is ready for next round of simulation.
I briefly discss a CTF event I was invited to and what I plan to bring with me.
Hosted by Christopher M. Hobbs on 2019-06-04 is flagged as Clean and released under a CC-BY-SA license. Tags:ctf, hacking, security, infosec, events, conventions, gear.
Listen in ogg, spx, or mp3 format.
Unscripted ramblings about an upcoming CTF event.
Hak5 items mentioned (hak5.org):
Bash Bunny (erroneously referred to as a ‘rabbit’)
Released: 2019-05-27. Duration: 00:46:24. Flag: Clean. Series:Interviews. Tags:vcfe, vintage, computers, exhibition, munich, germany.
I interviewed some of the exhibitors at the recent vcfe.org event in Munich, Germany.
Released: 2019-05-23. Duration: 00:08:13. Flag: Clean. Series:Podcast recommendations. Tags:podcasts, narrowcasting, broadcasting.
I provide a slightly different view on podcasts to that recently given by Knightwise.
Released: 2019-05-13. Duration: 01:29:47. Flag: Clean. Series:Interviews. Tags:ubuntu, snap, snapcraft, flatpack, linux, appimage, alan pope, popey.
In this episode, Yannick talks with Alan Pope about snaps, snapcraft and all things related
Released: 2019-05-10. Duration: 00:07:42. Flag: Explicit. Tags:Android, fdroid, lineageos, AFWall+, Wi-Fi, wpa_supplicant.conf, termux.
Ken fixes an Android Firewalled Wi-Fi connection that reports no Internet and won’t connect
Released: 2019-04-19. Duration: 00:36:50. Flag: Clean. Series:Tabletop Gaming. Tags:RPG,Tabletop Game,Dead Earth.
A review of a 20-year old, GNU Free Documentation Licensed, RPG about post-apocalyptic turmoil
Released: 2019-04-18. Duration: 00:40:12. Flag: Clean. Series:Interviews. Tags:ubuntu, mate, ubuntu mate, martin wimpress, raspberry pi, desktop environment, linux.
In this episode, Yannick talks with Martin Wimpress about the Ubuntu MATE project
Released: 2019-04-11. Duration: 00:16:38. Flag: Clean. Series:Random Elements of Storytelling. Tags:stories, storytelling, pacing, lostnbronx.
Lostnbronx takes a stab at explaining why the pace of your story matters.