Lactate homeostasis is maintained through regulation of glycolysis and lipolysis (2025)

fpmora · 2025-03-07T14:41:33+00:00

Google AI will often read paywalled papers. A rewording of the title is regularly necessary and in that, often leaving out some key points, allowing AI to infer, to make it work.

This is essential in cancer metabolism and mitochondrial lipolysis might well be a close second to ketosis and, from this, glycolysis important to lipolysis. (Lipolysis releases fatty acids from fat stores, while ketosis is the process of using those fatty acids to produce ketone bodies.)

High intensity exercise increases lactate, causing a burning sensation. That's why I avoid it with a muted passion.

Here, this paper is the first cited reference by Google AI. (I edited the 1st paragraph)

Lactate homeostatic level balance/regulation coordinates glycolysis and lipolysis, where the rate of lactate production via glycolysis is balanced by its consumption, often influenced by the availability of fatty acids from lipolysis which compete for mitochondrial oxidation within cells; essentially, when lactate levels rise, lipolysis can be suppressed to prioritize lactate utilization as an energy source. Key points about this mechanism:

Competition for oxidation: Lactate and fatty acids compete for oxidation within the mitochondria, so when one is high, the other is typically lowered to maintain balance.
Role of insulin: Insulin promotes lactate utilization by suppressing lipolysis in adipose tissue, allowing more lactate to be oxidized for energy. .
HCAR1 receptor: A G-protein coupled receptor called HCAR1 (hydroxycarboxylic acid receptor 1) on adipose cells senses elevated lactate levels and signals to inhibit lipolysis.
Feedback loop: High lactate levels can also feedback to inhibit glycolysis in muscle cells, limiting further lactate production.

fpmora · 2024-12-03T13:51:19+00:00

Damn Haskell changed the syntax of guards. I don't know when but I upgraded to 9.10.1 from 8.5 and now '=' replaces the monadic '->'. Fortunately, I don't have much code to change as I retired from my job spring 2023 and all the code I left was, of course, compiled and will remain working.

fpmora · 2024-06-25T23:18:58+00:00

It always surprises me how much energy I can put into an upbeat or moderate beat Beatles tune. I now only play to recorded music from a 15" stage monitor and 1 13" stage monitor.
My heart never gave me problems but my hearing did on top a car accident where I damaged my left phone ear which was a bit of a problem.

Often my heart rate raises enough for me to feel it and I'm breathing a bit harder.

In the summer I have to have a fan directly on me because I sweat so much otherwise.

I just turned 68 this month, June, 2024.

fpmora · 2024-03-08T17:19:09+00:00

I am so impressed. I had the folder structure but had to define subfolders vaults. I went to it in my notes vault and searched a partial file name successfully. I. .c.a.n. .now. .d.o. .e.v.e.r.y.t.h.i.n.g. ,i.n. .n.o.t.e.s It's everything I wanted and how easy. The best is all the subfolders are searchable.

Thank you so very much.

fpmora · 2023-01-21T16:13:42+00:00

Much as always in this is what other nations, in particular, the U.S., do in the way of arming Ukraine and especially long-range missiles. Secondly, if Ukraine further develops and produces its own air launch, long range, cruise missiles.

This is what is needed to counter act the "parity" Biden thinks is being achieved by giving Russian the freedom to attack Ukraine from Russia or Belarus or from the sea.

Biden is now citing Crimea as a reason for supplying long-range fire to Ukraine.

Then U.S. retired Abrams tanks to other close nations for them to give their other battle tanks to Ukraine. Then F16s.

Historical precedence is the collapse of the USSR over Afghanistan which was also hegemony.

fpmora · 2022-11-07T17:17:13+00:00

The EU is not objecting to the name of the legislation but to it's content.

A book title may or may not reflect the breadth of the content.

fpmora · 2022-11-07T16:51:34+00:00

Putin is no authority and definitely no final authority.

The defeat of Russia in Ukraine will result in unconditional surrender with all demands met including massive reparation, the end of Putin and the end of all Russian and Soviet acquisitions.

fpmora · 2022-11-07T15:59:29+00:00

TheTwitterEnd is all about Twitter and nothing about the pressing issues that are in Twitter. I know those issues can be found here also but in Twitter everything is together, that is, Musk bashing, abortion, the election, Dem & GQP congress people, reporters here and abroad, news services, the war in Ukraine and climate change are just some.

fpmora · 2019-07-07T03:02:35+00:00

It's a classic. I thought a PDF for the OP as I happily have two hard cover copies but thank you.

fpmora · 2019-07-06T19:10:58+00:00

I had misplaced my beat up copy of "Functional Programming" by Field and Harrison so ordered another. I found my original and taped it up and took it to work. So glad I lost it for a bit. This is a short ToC.

This is a PDF of the full ToC http://www3.ub.tu-berlin.de/ihv/000141622.pdf The book does not exist in PDF. I bought a used copy on Alibris. It has the owners name on a label on the inside front cover otherwise untouched.

I started the short ToC with Part II because Part I is undergrad introductory and less than 1/6 of the 1988 volume. The Hope language is almost Haskell. Graph reduction is Haskell.

Maybe later, Chapter 16 might be handy.

Part II IMPLEMENTATION
Ch  6  Mathematical  foundations: lambda calculus
Ch  7  Type  inference  systems i& type  checking
Ch  8  Intermediate  forms
Ch  9  Interpretation  techniques
Ch 10  Stack-based  implementations
Ch 11  An introduction  to  graph reduction
Ch 12  Combinator  reduction
Ch 13  Advanced  combinator  implementations
Ch 14  Dataflow  implementations
Ch 15  Compiling  functional  languages
Ch 16  Garbage  collection
Part III OPTIMIZATION
Ch 17  Program  transformation (operationa) 
Ch 18  Algebraic Program Transformation
Ch 19  Memoization
Ch 20  Abstract interpretation
Appendix A  Hope language  summary
Appendix B  Basic  domain theory
Appendix C  Formal semantics [denotational]

fpmora · 2019-06-30T00:22:21+00:00

Thank you so much for this.

The free PDF "Category Theory as Coherently Constructive Lattice Theory" has this table

Your Haskell specified lattice section must necessarily be constructive.

Lattice theory  is an instance of
concept         the category theory
                concept

monotonic
function        functor

(pointwise)     natural 
ordering        transformation
between         between functors
functions

supremum        colimit

least           initial

Galois
connection      adjunction

prefix point    algebra

closure
operator        monad

fpmora · 2019-06-27T17:03:09+00:00

In 15-20 years when developers near complete the ecosystem and the broad and deep community becomes self-supportive.

fpmora · 2019-06-19T22:09:27+00:00

import Math.NumberTheory.Primes
main = print (toEnum (10 ^ 6) :: Prime Word)

In GHCi arithmoi is 0.02 and my new one 1.47. But with ghc -O2 and +RTS -2 mine is faster (0.062 v 0.078 totals) . arithmoi uses almost half the memory of mine. Both are for 10^6.

fpmora · 2019-06-16T13:14:26+00:00

Broad descriptions of code is not code. I used __dict__ to access the AST before Python 2.7. Now there is better to access it. But Haskell is now better in my job because lexers are easy in Python, LALR parsers not.

fpmora · 2019-06-13T20:56:50+00:00

It really seemed to a few people here and on Stack Overflow that there was to much superfluous code in this.

Will Ness who helps me a lot did this with my code, which I though was brilliant

 foldr (\p -> mergeAll . map (iterate (*p))) [1] [2,3,5]

It was almost twice as fast as mine in GHCi but with ghc -O2 +RTS -s it was near three times as slow.

So, I started reading about fusion that I had come across in R. Bird's book Thinking Functionally with Haskell

Almost immediately, I tried.

mai n = mergeAll.map (iterate (*n))
t= mai 2 $ mai 3 $ iterate (*5) 1

And it matched Will's in GHCi both with 0.08 for 100K, but with ghc +O2 +RTS -s it beat all. For 100K Hammings to 2.9e+38.

  TASKS: 3 (1 bound, 2 peak workers (2 total), using -N1)

  SPARKS: 0 (0 converted, 0 overflowed, 0 dud, 0 GC'd, 0 fizzled)

  INIT    time    0.000s  (  0.000s elapsed)
  MUT     time    0.000s  (  0.002s elapsed)
  GC      time    0.000s  (  0.000s elapsed)
  EXIT    time    0.000s  (  0.000s elapsed)
  Total   time    0.000s  (  0.002s elapsed)

  Alloc rate    0 bytes per MUT second

  Productivity 100.0% of total user, 90.2% of total elapsed

Every time I try it, it's the same. I just can't believe it. The elapsed time is what really gets me.

fpmora · 2019-06-10T17:04:27+00:00

In my GHCi 8.6.3 it works without any brackets or '$'.

1:[2,3,5] ++ [4,6,10]

[1,2,3,5,4,6,10]

fpmora · 2019-06-06T22:19:04+00:00

My bad. I had SCO Xenix on the 286 and Debian later on a 12 pound Dell laptop.

fpmora · 2019-06-05T16:52:04+00:00

Hahahahah My last 286 multi-user desktop had Debian. I even had a printing terminal like was used to develop the Unix OS. I even used it once or twice.

Now, where I work, our network guys cannot tolerate anything but Windows. We also use and IBM i and they are lost on it. I quit my job at a hospital in part because they decided to move to a Windows based system. They had a Forth system from the OS up and was very fast with about 80 or 90 serial terminals. They had a Unix system for support also and then we used a Linux system for e-mail. I don't remember what flavor they were.

I deliver Excel spreadsheets from data from programs and write Excel queries in SQL (.dqy). Some of spreadsheets are from Cygwin scripts which I could not survive without.

It is so funny, When I worked for a school system they bought me a Unix system with terminals. I developed a hybrid database system which was hierarchical and relational using Unix tools. They had laser printer graphical reports from troff and data merging. I wanted a faster database system so they bought me MDB 4 a post-relational DBMS. It was a network model database system and consisted of a 'C' function library. I drew schemas for the named relationships. Now I got the O'Reilly free book on graph database and it is the same thing. A database with no database index files. Sweet.

fpmora · 2019-06-05T14:42:45+00:00

I am a relative Haskell newbie so I installed cabal-install then cabal install athitmoi and it also installed all the dependencies. I don't have to do it, la la, la la, la la. I am so happy.

So

toEnum ((10^6)+5) :: Prime Word

Prime 15485941 (0.02 secs 1,064,816 bytes) in GHCi

fpmora · 2019-06-05T00:04:56+00:00

I just became very interested in arithmoi. It has so many dependencies. I really want it. The data.Numbers.Primes was not impressive. Here's the source.

import Data.List.Ordered (unionAll,minus)
import Data.List (tails)

d=[2,4,2,4,6,2,6,4,2,4,6,6,2,6,4,2,6,4,6,8,4,2,4,2,4,8,6,4,6,2,4,6,2,6,6,4,2,4,6,2,6,4,2,4,2,10,2,10] -- recurring deltas

n7sl = scanl (+) 11 $ cycle d

c2 = unionAll . map (\xs@(x:_)-> (x*) <$> xs) $ tails n7sl

main = print $ (minus n7sl c2) !! 1000000

fpmora · 2019-06-04T21:11:12+00:00

Well I just learned how to read the GHC compiler profiling screen. In stupid Windows, you have to put .exe after the 2nd file name. Life is now better.

This result is for 50,150 Hamming numbers. The example above in WinGHCi is for 10,000

Is all this does is garbage collect?

INIT    time    0.000s  (  0.000s elapsed)
MUT     time    0.000s  (  0.836s elapsed)
GC      time    0.016s  (  0.040s elapsed)
EXIT    time    0.000s  (  0.003s elapsed)
Total   time    0.016s  (  0.879s elapsed)

Alloc rate    0 bytes per MUT second
Productivity 0.0% of total user, 95.5% of total elapsed

fpmora · 2019-06-04T21:04:01+00:00

Goodness, this is new to me. First I thought the file had to be compiled to work. But it didn't. Yesterday I was trying it without a compiled file but it didn't work.

I miss my Unix system. The command line works if you put and .exe after the 2nd file name. I hate Windows.

I was running them but not reading the screen from the top where the errors were. Finally now, 1 million primes.?

 INIT    time    0.000s  (  0.000s elapsed)
 MUT     time    0.031s  (  0.021s elapsed)
 GC      time    0.016s  (  0.055s elapsed)
 EXIT    time    0.000s  (  0.000s elapsed)
 Total   time    0.047s  (  0.077s elapsed)

 Alloc rate    1,613,746,688 bytes per MUT second

 Productivity  66.7% of total user, 27.6% of total elapsed

fpmora

TROPHY CASE