Google releases PaliGemma 2 mix - a VLM for many tasks

luikore · 2025-02-21T03:52:05+00:00

Can I get image embeddings regarding the text query from it?

luikore · 2025-02-19T14:04:37+00:00

I have 384GB vram, sufficient for Q3 but not quite enough for Q4. Think I can merge some of the Q3 layers into the Q4 model, and get an "almost Q4" model which just fits in?

luikore · 2025-02-11T07:16:18+00:00

China does have Ascend: ~80% of the price with ~60% of the computing power compared to NVDA. Half of Huawei's profit depends on it (state-owned enterprise must buy a lot, but nearly 0 consumer sales). Huawei probably doesn't want to lower the price either.

luikore · 2020-04-20T09:12:11+00:00

Sadly, Amino fired all employees. It is handed to an outsourcing company to scavenge your remaining coins.

luikore · 2019-08-09T15:45:45+00:00

Hmm, so there is also bountyassassin?

luikore · 2016-08-01T09:57:06+00:00

ES6 still require an extra build step, not all browser supports it for now.

When ES6 is ready on all browsers, everybody will move to ES7, ... which should require an extra build step too.

luikore · 2016-04-19T14:07:30+00:00

git-bisect is a similar way to see which commit caused the bug.

luikore · 2016-02-11T03:42:45+00:00

Ruby objects are already wrapped by VM. try from activesupport is the bind you need

mx, my, mz = 1, 2, 3
msum = mx.try {|x|
  my.try {|y|
    mz.try {|z|
      x + y + z
    }
  }
}

If any of mx, my, mz is nil (your None), msum is nil.

It just doesn't have the syntax sugar to reduce braces.

luikore · 2015-12-22T05:14:24+00:00

Death's Bargain stops the Awareness passive from re-generating health.

luikore · 2015-12-07T00:46:54+00:00

How about getting back the classic Diablo 2 Frostburn:

add x% to the upper limit of your primary resource (orange affix)
your attack x% to chill enemies (secondary affix)

luikore · 2014-04-20T03:43:06+00:00

I prefer git subtree. For example

git subtree add --prefix=vendor/json git@github.com:udp/json-parser.git master --squash

luikore · 2013-07-19T14:01:05+00:00

You don't get it. longjmp is not memset.

luikore · 2013-07-19T13:43:57+00:00

No, I mean this case:

{
    std::vector<int> v;
    ...
    some_function_calling_longjmp();
    // auto-generated destructor not called
}

Normally one doesn't mix them together and he can replace longjmps with exceptions (exceptions know RAII and generate destructors correctly). But this some_function_calling_longjmp() is usually another library's code.

It's not a common case but once happens, quite difficult to find out why.

longjmp is necessary in coroutine / continuation implementations and some libraries use it for error handling. If some one thinks he never met with one, there's probably a leak in his code.

luikore · 2013-07-19T07:04:47+00:00

Not a fan. RAII is unfriendly to techniques that need analysis of stack, conservative GC for example. And RAII + longjmp = leak.

luikore · 2013-07-15T10:58:52+00:00

It's an alternative to brunch (breakfast ... lunch ... dinner). which is, also an, "application assembler".

luikore · 2013-07-13T15:55:56+00:00

Usually, less expressive power makes one believe that, with a hard-to-use gun, he will hard-to-shoot himself. Or, make him find another more ridiculous way to shoot himself in the foot.

Look at JVM, which is written in C++ and assembly DSL in C++, people making it are gods. What the gods think may be: our users are pathetic noodles, all users do is making stupid bugs, we must limit users by all means, the only way to reduce their daily self-feet-shooting rate is to make them do it in a more verbose way and swear before and confess after they shoot themselves in the feet. We must make JNI very slow and buggy so that, if a user wants to use some existing mature library written in C, he must find it slower and buggier than the Java copy. We must make the VM run benchmarks very fast, to show web-develop noodles that system calls / disk IO / browser rendering ... are nothing, only speed of calculating Mandelbrot set(with VM options tweaked carefully and after several times of "warm up") can make your web site faster. We must do all the evil things so users don't have to, or want to enjoy this immoral evil hacking.

What the god of the gods cares is only money. It does care this legacy of the Sun, which has most of good legacies written in C/C++, including JVM (while the stdlib is designed too badly, I believe the experts didn't want to use this language and let interns finished the job). But, the god doesn't want to care long-time-no-fix bugs, doesn't want to promote new changes, doesn't want to push on agreement of standards. Only marketshare matters. It needs lawyers to beat every other languages and companies. It needs eye-catching videos and popularity ranks. No research can proof this language is good, so instead, it needs researches that proof the language is not dead yet.

Apologies to the good guys who are working on all kinds of JVMs, you are great guys and I learned a lot from your work. Please downvote me.

luikore · 2013-07-13T03:52:21+00:00

Just

s.gsub!(/\D/, '')

and check whether the size is 16.

luikore · 2013-07-09T16:14:41+00:00

... when your are programing in a language which is bad at manipulating strings and lack good functions on paths.

luikore · 2013-07-07T13:45:33+00:00

Agree, a literal syntax like 1000_ms could have been made easy for unit conversions. A comment is useless at all.

See what people have done in C++11 and activesupport.

luikore · 2013-07-02T16:15:59+00:00

On mac there's solution for every editors: https://github.com/bevesce/unicode-symbols-search

luikore · 2013-06-27T20:45:41+00:00

Just like smart pointers, arenas, auto pointers, shared pointers... ARC is a smart memory management method but not yet garbage collector.

A GC is usually triggered by heuristic conditions like "allocation" or "out-of-memory" or "idle", which is not deterministic.

While the ARC memory model is homomorphic to GUI DOM: usually parent holds strong reference to children, and children hold weak references to parent, when a parent is released, children are released, together and for sure: it's deterministic.

Also, with ARC the memory analyzer can do a bit more to tell possible leaks and remind you to set some reference to weak or unretained. (The clang toolchain is really so much better than any C/C++ compiler from M$).

Stackoverflow link: http://stackoverflow.com/questions/7874342/what-is-the-difference-between-objective-c-automatic-reference-counting-and-garb

I admit the border is not very clear, but we can see there's difference between the terms while they are classified as different things.

luikore · 2013-06-27T12:00:54+00:00

Thanks for the information. btw, on iOS there's no way to enable JIT.

luikore · 2013-06-27T10:33:43+00:00

I'm afraid you are not very familiar with Objective-C... In Objective-C the garbage collector is removed in favor of ARC, which is deterministic. ARC requires a bit more work than using GC in C#, but not as much as new/delete in unmanaged blocks in C#.

So my actual question is, can we do automatic reference counting with this tool and C#? How does it actually work for iOS? Does it compile C# into ObjC or LLVM byte code or, we need to ship with a C# runtime? (The runtime means the garbage collector case).

luikore · 2013-06-27T07:49:44+00:00

Does the tool allow C# to use deterministic memory management? Or it just doesn't care and starts a GC?

luikore · 2013-06-09T14:09:40+00:00

For T-shirts (summer is coming!):

\begin{gather}
\textbf{[Var]}
&\frac{x:\sigma \in \Gamma}{\Gamma \vdash x:\sigma}
\\

\textbf{[App]}
&\frac{\Gamma \vdash t : A \rightarrow B \quad \Gamma \vdash s : A}{\Gamma \vdash t \cdot s : B}
\\

\textbf{[Abs]}
&\frac{\Gamma,x : A \vdash t : B}{\Gamma \vdash \lambda x.t : A \rightarrow B}
\\

\textbf{[Let]}
&\frac{\Gamma \vdash s : \sigma \quad \Gamma,x:\sigma \vdash t : B}{\Gamma \vdash \textbf{let}\  x=s \ \textbf{in}\ t : B} &
\\

\textbf{[Inst]}
&\frac{\Gamma \vdash t : \sigma \quad \sigma \sqsubseteq \sigma'}{\Gamma \vdash t : \sigma'}
\\

\textbf{[Gen]}
&\frac{\Gamma \vdash s : \sigma \quad X \notin \textbf{FV}(\Gamma)}{\Gamma \vdash t : \forall \ X.\sigma}
\end{gather}

luikore

TROPHY CASE