Samsung A51 video quality not matching camera quality

I recently got an A51 off of Samsung and I have been testing out their camera. When I take a photo using the rear camera, I got to say, I am impressed, it came out like a 4K image. However, when I take a video, things started going south. There are grains and noise everywhere in the video and even using the UHD 4K setting, I still get subpar 720p footage.

Now I have searched online but most of the help online is regards to why the camera sucks at taking pictures, which for me is obviously not the case because taking photographs with the A51 is satisfactory. Is there a way to make the video quality match with the camera quality? Below is such examples of camera quality I wish the video can compare to:

enter image description here

In the above image, you can see the cat’s face is extremly detailed and the background is slightly blurred, which makes the subject stand out a bit more, however, I have tried this exact scene with video, and I just get a blurry mess (no background blur, the lighting is uniformal and bland). I have also noticed that the metadata for both are seperate as well. Here is the camera metadata for a photo:

1.27 MB    4000x2250
F2.0     1/24s    4.60mm    ISO 500
WB AUTO    No flash

And here is the metadata from the video:

55.21 MB   1920x1080

Which it seems like the aperature, ISO, white balance are all missing from the video metadata. I am not a professional photographer, but I do know some settings that I can tweak to make it look better, however none of these manual settings exist in the video mode.

Why is it that using the same phone with the same cameras, taking a photo looks like a DSLR camera did it while a video looks like some old camcorder footage? Is there software (PC or mobile app) that can make me adjust the settings so that taking a video will be like taking a video?

pattern matching – Behaviour of PatternTest

I was surprised by the following behavior of PatternTest and I think that this may be instructive for other people too.

Consider FreeQ(x), an operator that returns True if its operand does not contain x. E.g. FreeQ(x)(1) returns True.

Now look at:

MatchQ(2 , _?FreeQ(x))
False

Not what I ecpected. However, if we put brackets around FreeQ(x):

MatchQ(2 , _?(FreeQ(x)))
True

With the help of Wolfram support I could finally entangle this mystery. The PatternTest has a pretty high precedence, higher than Part, so that _?FreeQ(x) is interpreted as (_?FreeQ)(x) and not as expected: _?(FreeQ(x))

sharepoint online – How to select ALL matching results of a filter in a document library (not just those displayed on the user’s screen)?

Desired Behaviour

  • Filter items in a Document Library by Column title
  • Click Select All icon
  • ALL items that match the filter are selected (not just those displayed on the user’s screen)

The desired functionality is demonstrated in GMail when performing a search and clicking Select All, ie:

enter image description here

Actual Behaviour

It seems document libraries use ‘lazy load’ functionality where only enough items are retrieved to fill the user’s screen.

For example, if I were to apply the following filter on a Column title:

Vehicle Type:  Boat

It might display 100 items.

If I then clicked Select All, the interface would say 100 selected, even though there could be 5,000 results, eg:

enter image description here

enter image description here

Workaround

Currently I am instructing users to:

Keep scrolling until items don’t load anymore to ensure all matching documents in the library are loaded and selected

But this is not a scalable or sophisticated solution.

Question

Is there a way to select ALL matching results of a filter in a document library, rather than just those displayed on the user’s screen?

Environment

Browser: Chrome Version 91.0.4472.101 (Official Build) (64-bit)
SharePoint Online
Microsoft Team SharePoint Site Document Library

matching theory – Number of edges in bipartite graphs

Let $G$ be a bipartite graph on $n$ vertices of either color.

Suppose $G$ contains no perfect matching the number of edges can be $Omega(n^2)$ (just do not place an edge between a particular pair of vertices).

  1. Suppose $G$ contains exactly one perfect matching what is the maximum number of edges it can have?

  2. Suppose $G$ contains exactly two perfect matchings what is the maximum number of edges it can have?

I think $2n-1$ is the upper bound for 1. Essentially fix a perfect matching. As long as we do not have a $2times2$ subgraph we can add edges and there is exactly $n-1$ additional edges we can add. For 2. the upper limit is $2n$ I think by the same calculation.

seo – Google page title not matching html tag

Check Google’s cached version – you can see that “<no title>” was actually the title of your page at the point it was crawled in June:

<title>&lt;no title&gt; &#8212; Machine Learning from Scratch</title>

Use Google Search Console to get Google to re-crawl your page, and it will see and index the new title.

google sheet : extract number from string by matching the prefix

I have a cell contains this value/text :

T50 EX3 OF2 BE40 BL10 ZLD6 ZLS2 ZRS10 AA1

How to get the number with the ‘EX’ prefix ? in this case i want to extract that ‘3’ from EX3.

Also, this number can be any digit, for example it can be :

EX112

or

EX00078 

How to extract that ‘112’ and ‘00078’ and make it as number 112 and 78 ?

Thanks

algorithms – Weighted edge cover and matching problems in bipartite graphs

I am interested in the following problem for its own sake. This is not a homework problem.

Given a bipartite graph $G = (V = X cup Y, E)$ and a weight function $w: E rightarrow mathbb{R}_{+}$, how does one reduce the problem of finding a minimum weight edge cover to that of finding an optimal weight perfect matching?

The following link

https://cstheory.stackexchange.com/questions/14690/reducing-a-minimum-cost-edge-cover-problem-to-minimum-cost-weighted-bipartie-per

apparently provides an answer which clearly I am not following. When discussing an edge cover, please use the definition — that is, a subset $C subseteq E$ such that each $v in V$ is incident to at least one $e in C$.

I would like to use the Hungarian algorithm as part of a solution to this problem. Any insight, whether it is a clarification of the linked answer or otherwise, is greatly appreciated.

Using Filter by an entity reference view with Rewrite Results gives “there are no entities matching” error

I’m using Drupal 9.2.
I have created entity reference views and use them as filter for entity reference fields (autocomplete widget).
When I’m using only “Content: Title” field everything works as expected. When using more fields either hidden (rewriting Title) or visible, I get “There are no entities matching (my selection)” error on save.

Does anybody have any idea why this is happening or how to debug?
Thanks

commerce – How to load matching TaxZone from order address

I’m working on a Drupal 9 commerce site (made by another developer).

They have made their own OrderProcessor, and made a lot of hacks to prevent alot of Resolvers and services to be fired (insert a lot of bad-words here)

My question is to that I need to use the Commerce Tax module, and cannot see how i can get the actual Tax Type / zone for the order, so i can calculate the VAT / Tax for the order,

So i need a guideline to how to get the tax for the order programmatically.

And no it’s unfortunately not an option to make it the right way (lack of time)

Thanks in regard.

Also apply filter to matching messages – Gmail filters

The filters are only applied to incoming messages.

One way to use a simple filter all the time is to use the Multiple inbox setting. Wiith multiple inboxes you can display 5 other queries as a separate inbox view.

Under settings/inbox change inbox type to “multiple inboxes”. You can then put the logic of the filter you want in the definition of the section. I don’t know how complex the query can be.